📰 Journal of Automated Reasoning 2011: all accepted papers

30 papers · the most cited first · ← Journal of Automated Reasoning 2011

1. The Locally Nameless Representation ↗Arthur Charguéraud149 citations
2. Strongly Typed Term Representations in Coq ↗Nick Benton, Chung-Kil Hur, Andrew John Kennedy et al.77 citations
3. Proof Pearl: Regular Expression Equivalence and Relation Algebra ↗Alexander Krauss, Tobias Nipkow65 citations
4. A Two-Level Logic Approach to Reasoning About Computations ↗Andrew Gacek, Dale Miller, Gopalan Nadathur50 citations
5. Simulating Circuit-Level Simplifications on CNF ↗Matti J„ärvisalo, Armin Biere, Marijn J. H. Heule47 citations
6. An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic ↗Angelo Brillout, Daniel Kroening, Philipp Rümmer et al.34 citations
7. A Canonical Locally Named Representation of Binding ↗Randy Pollack, Masahiko Sato, Wilmer Ricciotti31 citations
8. Analytic Tableaux for Higher-Order Logic with Choice ↗Julian Backes, Chad E. Brown31 citations
9. Decreasing Diagrams and Relative Termination ↗Nao Hirokawa, Aart Middeldorp24 citations
10. Tractable Extensions of the Description Logic EL with Numerical Datatypes ↗Despoina Magka, Yevgeny Kazakov, Ian Horrocks23 citations
11. ExpTime Tableaux for Using Sound Global Caching ↗Rajeev Prabhakar Goré, Linh Anh Nguyen21 citations
12. Proving Termination by Dependency Pairs and Inductive Theorem Proving ↗Carsten Fuhs, Jürgen Giesl, Michael Parting et al.17 citations
13. Automated Inference of Finite Unsatisfiability ↗Koen Claessen, Ann Lillieström14 citations
14. Monotonicity Inference for Higher-Order Formulas ↗Jasmin Christian Blanchette, Alexander Krauss14 citations
15. A Presheaf Environment for the Explicit Fusion Calculus ↗Filippo Bonchi, Maria Grazia Buscemi, Vincenzo Ciancia et al.12 citations
16. A List-Machine Benchmark for Mechanized Metatheory ↗Andrew W. Appel, Robert Dockins, Xavier Leroy11 citations
17. Satisfiability Checking in Łukasiewicz Logic as Finite Constraint Satisfaction ↗Steven Schockaert, Jeroen Janssen, Dirk Vermeir11 citations
18. A Solution to the PoplMark Challenge Based on de Bruijn Indices ↗Jérôme Vouillon9 citations
19. On Explicit Substitution with Names ↗Kristoffer H. Rose, Roel Bloo, Frédéric Lang9 citations
20. Paramodulation with Non-Monotonic Orderings and Simplification ↗Miquel Bofill, Albert Rubio7 citations
21. Formal Metatheory of Programming Languages in the Matita Interactive Theorem Prover ↗Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen et al.5 citations
22. Formalizing Adequacy: A Case Study for Higher-order Abstract Syntax ↗James Cheney, Michael Norrish, René Vestergaard5 citations
23. PSPACE Tableau Algorithms for Acyclic Modalized ALC ↗Jia Tao, Giora Slutzki, Vasant Honavar5 citations
24. Invariant-Free Clausal Temporal Resolution ↗Jose Gaintzarain, Montserrat Hermo, Paqui Lucio et al.4 citations
25. A Solution to the PoplMark Challenge Using de Bruijn Indices in Isabelle/HOL ↗Stefan Berghofer3 citations
26. Classical Logic with Partial Functions ↗Hans de Nivelle3 citations
27. Encoding Abstract Syntax Without Fresh Names ↗Matthew R. Lakin, Andrew M. Pitts3 citations
28. Preface: Theory and Applications of Abstraction, Substitution and Naming ↗Maribel Fernández, Christian Urban3 citations
29. Preface: Special Issue of Selected Extended Papers of IJCAR 2010 ↗Jürgen Giesl, Reiner Hähnle
30. Special Issue on Security and Rewriting Foreword ↗Hubert Comon, Catherine A. Meadows

↑ back to top

This page in Markdown → https://md.research.elamur.ai/free/en/venues/journal-of-automated-reasoning/2011/papers/