Résumé: In this paper we shall describe a formal system which enables us to prove theorems within propositional calculus, logic of quantifiers and first order theories, including theorems containing programs. Its main feature relies on generating an additional set of assumptions needed to prove a considered formula. Thus we are able to consider expressions which can become theorems by looking for a special set of assumptions (axioms) and then adding it to the standard set of axioms. Using this system the correctness and equivalence of programs can be determined. In the end we present some experimental results.

Langue: Anglais