Journal of Automated Reasoning 2012: all accepted papers
- The HOL Light Theory of Euclidean Space ↗John Harrison101 citations
- Formalization of Bernstein Polynomials and Applications to Global Optimization ↗Cesar A. Munoz, Anthony Joseph Narkawicz73 citations
- Wave Equation Numerical Resolution: A Comprehensive Mechanized Proof of a C Program ↗Sylvie Boldo, François Clément, Jean-Christophe Filliâtre et al.69 citations
- ATP and Presentation Service for Mizar Formalizations ↗Josef Urban, Piotr Rudnicki, Geoff Sutcliffe68 citations
- 6 Years of SMT-COMP ↗Clark Barrett, Morgan Deters, Leonardo de Moura et al.56 citations
- The Mizar Mathematical Library in OMDoc: Translation and Applications ↗Mihnea Iancu, Michael Kohlhase, Florian Rabe et al.48 citations
- On Rewriting Rules in Mizar ↗Artur Korniłowicz38 citations
- Methods of Lemma Extraction in Natural Deduction Proofs ↗Karol Pąk31 citations
- Contraction-Free Linear Depth Sequent Calculi for Intuitionistic Propositional Logic with the Subformula Property and Minimal Depth Counter-Models ↗Mauro Ferrari, Camillo Fiorentini, Guido Fiorino28 citations
- Formal Mathematics for Mathematicians ↗Andrzej Trybulec, Artur Korniłowicz, Adam Naumowicz et al.22 citations
- Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets ↗Eugenio Giovanni Omodeo, Alexandru Ioan Tomescu21 citations
- Proof Pearl—A Mechanized Proof of GHC’s Mergesort ↗Christian Sternagel14 citations
- Uncurrying for Termination and Complexity ↗Nao Hirokawa, Aart Middeldorp, Harald Zankl13 citations
- Multi-Completion with Termination Tools ↗Sarah Winkler, Haruhiko Sato, Aart Middeldorp et al.11 citations
- Custom Automations in Mizar ↗Marco B. Caminati, Giuseppe Rosolini9 citations
- Specification and Verification of Concurrent Programs Through Refinements ↗Sandip Ray, Rob Sumners8 citations
- A Tableau Based Decision Procedure for an Expressive Fragment of Hybrid Logic with Binders, Converse and Global Modalities ↗Serenella Cerrito, Marta Cialdea Mayer5 citations
- Case Splitting in an Automatic Theorem Prover for Real-Valued Special Functions ↗James P. Bridge, Lawrence Charles Paulson5 citations
- Preface ↗Benjamin C. Pierce, Stephanie Weirich4 citations
- Formalization of Definitions and Theorems Related to an Elliptic Curve Over a Finite Prime Field by Using Mizar ↗Yuichi Futa, Hiroyuki Okazaki, Yasunari Shidama3 citations
- Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints ↗Carles Creus, Adrià Gascón, Guillem Godoy2 citations
- A Two-Valued Logic for Properties of Strict Functional Programs Allowing Partial Functions ↗David Sabel, Manfred Schmidt-Schauß1 citation
- Eliciting Implicit Assumptions of Mizar Proofs by Property Omission ↗Jesse Alama1 citation
- On the Formalization of Theories ↗Jan Mycielski1 citation
- Non-Linear Rewrite Closure and Weak Normalization ↗Carles Creus, Guillem Godoy, Francesc Massanes et al.
- SMELS: Satisfiability Modulo Equality with Lazy Superposition ↗Christopher Lynch, Quang-Trung Ta, Duc-Khanh Tran
- The GOEDEL Program ↗Johan G. F. Belinfante
This page in Markdown → https://md.research.elamur.ai/free/en/venues/journal-of-automated-reasoning/2012/papers/