A formal software verification concept based on automated theorem proving and reverse engineering

Satisfiability Modulo Theories (SMT) solvers have emerged as prominent tools in formal methods applications. While originally targeted towards quantifier-free inputs, SMT solvers are now often used for handling quantified formulas in automated theorem proving and software verification applications. The most common technique for handling quantified formulas in modern SMT solvers in quantifier instantiation. This paper gives an overview of recent advances in quantifier instantiation in SMT. In addition to the well-known technique known as E-matching, we discuss the use of conflicts and models for accelerating the search for (un)satisfiably. We further mention new instantiation-based techniques that are specialized to background theories such as linear real and integer arithmetic, and future work in this direction.

Download Full-text

The 10th IJCAR automated theorem proving system competition – CASC-J10

AI Communications ◽

10.3233/aic-201566 ◽

2021 ◽

pp. 1-15

Author(s):

Geoff Sutcliffe

Keyword(s):

Theorem Proving ◽

Classical Logic ◽

Automated Theorem Proving ◽

Fully Automatic

The CADE ATP System Competition (CASC) is the annual evaluation of fully automatic, classical logic Automated Theorem Proving (ATP) systems. CASC-J10 was the twenty-fifth competition in the CASC series. Twenty-four ATP systems and system variants competed in the various competition divisions. This paper presents an outline of the competition design, and a commentated summary of the results.

Download Full-text

Retrieval System and Dynamic Algorithm Looking for Axioms of Notions Defined by Programs

Fundamenta Informaticae ◽

10.3233/fi-1993-193-404 ◽

1993 ◽

Vol 19 (3-4) ◽

pp. 275-301

Author(s):

Andrzej Biela

Keyword(s):

Theorem Proving ◽

Dynamic Process ◽

Functional Equations ◽

Automated Theorem Proving ◽

Retrieval System ◽

Formal System ◽

Dynamic Algorithm ◽

Algorithmic Logic ◽

Correctness Of Programs

In this paper we shall introduce a formal system of algorithmic logic which enables us to formulate some problems connected with a retrieval system which provides a comprehensive tool in automated theorem proving of theorems consisting of programs, procedures and functions. The procedures and functions may occur in considered theorems while the program of the above mentioned system is being executed. We can get an answer whether some relations defined by programs hold and we can prove functional equations in a dynamic way by looking for a special set of axioms /assumptions/ during the execution of system. We formulate RS-algorithm which enables us to construct the set of axioms for proving some properties of functions and relations defined by programs. By RS-algorithm we get the dynamic process of proving functional equations and we can answer the question whether some relations defined by programs hold. It enables us to solve some problems concerning the correctness of programs. This system can be used for giving an expert appraisement. We shall provide the major structures and a sketch of an implementation of the above formal system.

Download Full-text