Skip to main content

Journal of Automated Reasoning OnlineFirst articles


A Decidable Class of Security Protocols for Both Reachability and Equivalence Properties

We identify a new decidable class of security protocols, both for reachability and equivalence properties. Our result holds for an unbounded number of sessions and for protocols with nonces. It covers all standard cryptographic primitives. Our …


HO in Coq

We present a formalization of HO $$\pi $$ π in Coq, a process calculus where messages carry processes. Such a higher-order calculus features two very different kinds of binder: process input, similar to $$\lambda $$ λ -abstraction, and name …

09.09.2020 Open Access

Formalising -Protocols and Commitment Schemes Using CryptHOL

Machine-checked proofs of security are important to increase the rigour of provable security. In this work we present a formalised theory of two fundamental two party cryptographic primitives: $$\varSigma $$ Σ -protocols and Commitment Schemes.

05.09.2020 Open Access

Machine Learning Guidance for Connection Tableaux

Connection calculi allow for very compact implementations of goal-directed proof search. We give an overview of our work related to connection tableaux calculi: first, we show optimised functional implementations of connection tableaux proof …


Mechanisation of the AKS Algorithm

The AKS algorithm (by Agrawal, Kayal and Saxena) is a significant theoretical result, establishing “PRIMES in P” by a brilliant application of ideas from finite fields. This paper describes an implementation of the AKS algorithm in our theorem …

Aktuelle Ausgaben

Über diese Zeitschrift

The interdisciplinary Journal of Automated Reasoning balances theory, implementation and application. The spectrum of coverage ranges from the presentation of a new inference rule with proof of its logical properties to a detailed account of a computer program designed to solve various problems in industry. Topics include automated theorem proving, logic programming, expert systems, program synthesis and validation, artificial intelligence, computational logic, robotics, and various industrial applications. The contents focus on several aspects of automated reasoning, a field whose objective is the design and implementation of a computer program that serves as an assistant in solving problems and in answering questions that require reasoning.

The Journal of Automated Reasoning provides a forum and a means for exchanging information for those interested purely in theory, those interested primarily in implementation, and those interested in specific research and industrial applications.

Proof Pearls

In addition to regular research articles, the Journal of Automated Reasoning offers the special article type Proof Pearls. The goal is to disseminate insights gleaned from the growing body of machine-checked formalizations and proofs, obtained using both interactive and automated methods. Application areas include the full range from pure mathematics and logic to software and hardware verification. Proof Pearls should be short communications that focus on a few central ideas rather than extended research reports.

Contributions may include: a short, elegant proof of a self-standing result; a novel way of defining a fundamental concept; a notable approach to proving a key lemma in a larger development; a snippet of verified code, carefully engineered to balance efficiency with ease of verification; or a clever or impressive application of automated tools in a particular domain.

Proof Pearls adapt Jon Bentley's notion of a "programming pearl" to the verification paradigm. Proof Pearls should thus encapsulate fundamental insights that are adaptable and reusable, while being elegant and satisfying in their own right. Typical examples could be a verification of Huffman's algorithm, a perspicuous proof of the fundamental theorem of algebra, or a novel axiomatization of a particular algebraic system that was discovered using automated methods.

Submissions will undergo the usual refereeing process, and will be evaluated according to expository and theoretical merit. Systems and formalizations should be made available online.

Weitere Informationen

Premium Partner