default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Automated Reasoning, Volume 65
Volume 65, Number 1, January 2021
- Yong Guan, Jingzhi Zhang, Guohui Wang, Ximeng Li, Zhiping Shi
, Yongdong Li:
Formalization of Euler-Lagrange Equation Set Based on Variational Calculus in HOL Light. 1-29 - Danijela Simic, Filip Maric, Pierre Boutry:
Formalization of the Poincaré Disc Model of Hyperbolic Geometry. 31-73 - Guillaume Ambal, Sergueï Lenglet, Alan Schmitt:
HOπ in Coq. 75-124 - Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan:
Building Strategies into QBF Proofs. 125-154
Volume 65, Number 2, February 2021
- Jasmin Blanchette:
Message from the New Editor-in-Chief. 155 - Dario Cattaruzza, Alessandro Abate, Peter Schrammel, Daniel Kroening:
Unbounded-Time Safety Verification of Guarded LTI Models with Inputs by Abstract Acceleration. 157-203 - Hing-Lun Chan, Michael Norrish:
Mechanisation of the AKS Algorithm. 205-256 - Thibault Gauthier, Cezary Kaliszyk, Josef Urban, Ramana Kumar, Michael Norrish:
TacticToe: Learning to Prove with Tactics. 257-286 - Michael Färber, Cezary Kaliszyk, Josef Urban:
Machine Learning Guidance for Connection Tableaux. 287-320 - Andrei Popescu, Peter Lammich, Ping Hou:
CoCon: A Conference Management System with Formally Verified Document Confidentiality. 321-356
Volume 65, Number 3, March 2021
- Marco Voigt:
Decidable ∃ *∀ * First-Order Fragments of Linear Rational Arithmetic with Uninterpreted Predicates. 357-423 - Silvio Ghilardi, Elena Pagani:
Higher-Order Quantifier Elimination, Counter Simulations and Fault-Tolerant Systems. 425-460 - Dirk Beyer, Matthias Dangl, Philipp Wendler:
Correction to: A Unifying View on SMT-Based Software Verification. 461
Volume 65, Number 4, April 2021
- Maximiliano Cristiá, Gianfranco Rossi:
Automated Proof of Bell-LaPadula Security Properties. 463-478 - Véronique Cortier, Stéphanie Delaune, Vaishnavi Sundararajan:
A Decidable Class of Security Protocols for Both Reachability and Equivalence Properties. 479-520 - David Butler, Andreas Lochbihler, David Aspinall, Adrià Gascón:
Formalising $\varSigma$-Protocols and Commitment Schemes Using CryptHOL. 521-567 - Zhé Hóu, David Sanán, Alwen Tiu, Yang Liu, Koh Chuen Hoa, Jin Song Dong:
An Isabelle/HOL Formalisation of the SPARC Instruction Set Architecture and the TSO Memory Model. 569-598
Volume 65, Number 5, June 2021
- David M. Cerna, Alexander Leitsch, Anela Lolic:
Schematic Refutations of Formula Schemata. 599-645 - Christoph Wernhard:
Craig Interpolation with Clausal First-Order Tableaux. 647-690 - Anthony Bordg, Hanna Lachnitt, Yijun He:
Certified Quantum Computation in Isabelle/HOL. 691-709
Volume 65, Number 6, August 2021
- Xicheng Peng, Qihang Chen, Jingzhong Zhang, Mao Chen:
Automated Discovery of Geometric Theorems Based on Vector Equations. 711-726 - Mauro Vallati, Lukás Chrpa, Thomas Leo McCluskey, Frank Hutter:
On the Importance of Domain Model Configuration for Automated Planning Engines. 727-773 - Alexander Steen, Christoph Benzmüller:
Extensional Higher-Order Paramodulation in Leo-III. 775-807 - Maximiliano Cristiá, Gianfranco Rossi:
Automated Reasoning with Restricted Intensional Sets. 809-890
Volume 65, Number 7, October 2021
- Pascal Fontaine:
Preface: Special Issue of Selected Extended Papers of CADE 2019. 891-892 - Alexander Bentkamp, Jasmin Blanchette, Sophie Tourret, Petar Vukmirovic, Uwe Waldmann:
Superposition with Lambdas. 893-940 - Diego Calvanese, Silvio Ghilardi, Alessandro Gianola, Marco Montali, Andrey Rivkin:
Model Completeness, Uniform Interpolants and Superposition Calculus. 941-969 - Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Automata Terms in a Lazy WSkS Decision Procedure. 971-999 - Aina Niemetz, Mathias Preiner, Andrew Reynolds, Yoni Zohar, Clark W. Barrett, Cesare Tinelli:
Towards Satisfiability Modulo Parametric Bit-vectors. 1001-1025 - Andrei Popescu, Dmitriy Traytel:
Distilling the Requirements of Gödel's Incompleteness Theorems with a Proof Assistant. 1027-1070 - Patrick Trentin, Roberto Sebastiani:
Optimization Modulo the Theories of Signed Bit-Vectors and Floating-Point Numbers. 1071-1096
Volume 65, Number 8, December 2021
- Koen Claessen, Ann Lillieström:
Handling Transitive Relations in First-Order Automated Reasoning. 1097-1124 - Maximiliano Cristiá, Gianfranco Rossi:
An Automatically Verified Prototype of the Tokeneer ID Station Specification. 1125-1151 - Wilfried Sieg, Farzaneh Derakhshan:
Human-Centered Automated Proof Search. 1153-1190 - Salvador Lucas:
Derivational Complexity and Context-Sensitive Rewriting. 1191-1229 - Thaynara Arielly de Lima, André Luiz Galdino, Andréia Borges Avelar, Mauricio Ayala-Rincón:
Formalization of Ring Theory in PVS. 1231-1263 - Michael Kohlhase, Florian Rabe:
Experiences from Exporting Major Proof Assistant Libraries. 1265-1298
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-18 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
