📰 Journal of Automated Reasoning 2018 — papers

The works of Journal of Automated Reasoning published in 2018 that our library holds (publisher: Springer Science+Business Media): 1 work, listed below with the most cited first; each has a page with our summary, its key points and its references.

Most cited papers

By their OpenAlex citations; a paper with our summary links to its page here, the others to the original.

1. Hammer for Coq: Automation for Dependent Type Theory ↗Łukasz Czajka, Cezary Kaliszyk115 citations
2. VST-Floyd: A Separation Logic Tool to Verify Correctness of C Programs ↗Qinxiang Cao, Lennart Beringer, Samuel Gruetter et al.96 citations
3. OptiMathSAT: A Tool for Optimization Modulo Theories ↗Roberto Sebastiani, Patrick Trentin49 citations
4. A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality ↗Jasmin Christian Blanchette, Mathias Fleury, Peter Lammich et al.44 citations
5. Efficient Active Automata Learning via Mutation Testing ↗Bernhard K. Aichernig, Martin Tappler27 citations
6. A Verified ODE Solver and the Lorenz Attractor ↗Fabian Immler26 citations
7. Canonicity for Cubical Type Theory ↗Simon Huber22 citations
8. Explaining AI Decisions Using Efficient Methods for Learning Sparse Boolean Formulae ↗Susmit Jha, Tuhin Sahai, Vasumathi Raman et al.21 citations
9. The Flow of ODEs: Formalization of Variational Equation and Poincaré Map ↗Fabian Immler, Christoph Traut20 citations
10. The Univalence Axiom in Cubical Sets ↗Marc Bezem, Thierry Coquand, Simon Huber20 citations

All works of the year (59)

The most cited first; 1 with our summary link to their page here, the others to the original.

1. Hammer for Coq: Automation for Dependent Type Theory ↗Łukasz Czajka, Cezary Kaliszyk115 citations
2. VST-Floyd: A Separation Logic Tool to Verify Correctness of C Programs ↗Qinxiang Cao, Lennart Beringer, Samuel Gruetter et al.96 citations
3. OptiMathSAT: A Tool for Optimization Modulo Theories ↗Roberto Sebastiani, Patrick Trentin49 citations
4. A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality ↗Jasmin Christian Blanchette, Mathias Fleury, Peter Lammich et al.44 citations
5. Efficient Active Automata Learning via Mutation Testing ↗Bernhard K. Aichernig, Martin Tappler27 citations
6. A Verified ODE Solver and the Lorenz Attractor ↗Fabian Immler26 citations
7. Canonicity for Cubical Type Theory ↗Simon Huber22 citations
8. Explaining AI Decisions Using Efficient Methods for Learning Sparse Boolean Formulae ↗Susmit Jha, Tuhin Sahai, Vasumathi Raman et al.21 citations
9. The Flow of ODEs: Formalization of Variational Equation and Poincaré Map ↗Fabian Immler, Christoph Traut20 citations
10. The Univalence Axiom in Cubical Sets ↗Marc Bezem, Thierry Coquand, Simon Huber20 citations
11. Verified iptables Firewall Analysis and Verification ↗Cornelius Diekmann, Lars Hupel, Julius Michaelis et al.19 citations
12. A Consistent Foundation for Isabelle/HOL ↗Ondřej Kunčar, Andrei Popescu18 citations
13. From Types to Sets by Local Type Definition in Higher-Order Logic ↗Ondřej Kunčar, Andrei Popescu18 citations
14. CompCertS: A Memory-Aware Verified C Compiler Using a Pointer as Integer Semantics ↗Frédéric Besson, Sandrine Blazy, Pierre Wilke16 citations
15. A Resolution-Based Theorem Prover for {\textsf {K}}_{n}^{}Kn: Architecture, Refinements, Strategies and Experiments ↗Cláudia Nalon, Ullrich Hustadt, Clare Dixon15 citations
16. Guarded Cubical Type Theory ↗Lars Birkedal, Aleš Bizjak, Ranald Clouston et al.15 citations
17. A Formal Proof of the Expressiveness of Deep Learning ↗Alexander Bentkamp, Jasmin Christian Blanchette, Dietrich Klakow14 citations
18. Formalization of the Resolution Calculus for First-Order Logic ↗Anders Schlichtkrull14 citations
19. Formally Verifying the Solution to the Boolean Pythagorean Triples Problem ↗Luı́s Cruz-Filipe, João P. Marques-Silva, Peter Schneider–Kamp14 citations
20. A Proof Theory for Model Checking ↗Quentin Heath, Dale Miller12 citations
21. A Verified Generational Garbage Collector for CakeML ↗Adam Sandberg Ericsson, Magnus O. Myreen, Johannes Åman Pohjola12 citations
22. Automatic Refinement to Efficient Data Structures: A Comparison of Two Approaches ↗Peter Lammich, Andreas Lochbihler11 citations
23. On the Generation of Quantified Lemmas ↗Gabriel Ebner, Stefan Hetzl, Alexander Leitsch et al.11 citations
24. Long-Distance Q-Resolution with Dependency Schemes ↗Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider10 citations
25. Formally Verified Algorithms for Upper-Bounding State Space Diameters ↗Mohammad Abdulaziz, Michael Norrish, Charles Gretton9 citations

See all 59 papers in Journal of Automated Reasoning 2018 — papers →

📄 Works with our summary in our library (1)

The most cited first (OpenAlex citations plus our library's).

1. TacticToe: Learning to Prove with TacticsJournal of Automated ReasoningThibault Gauthier, Cezary Kaliszyk, Josef Urban, et al.2018 · 57 citations

🧭 Top topics

Topics of its works in our library, with the number of works on each.

🧮Reasoning (1)

📚 Fields

🖥️Computer Science (1)

🧑‍🔬 Top authors

Authors with a page who published here most often: their works here, and the citations of those works.

🏛️ Top institutions

Institutions on the bylines of its works here, by the number of works.

🎓Universität InnsbruckInnsbruck · Austria1 work here🔬Data61Sydney · Australia1 work here🎓Czech Technical University in PraguePrague · Czechia1 work here

works and citations from OpenAlex and our library.

↑ back to top

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