The verification of programs that contain mutually recursive procedures is a difficult task, and
one which has not been satisfactorily addressed in the literature. Published proof rules have …

During the last 15 years a large number of specification techniques based on the so-called
assumption/commitment paradigm have been proposed. The formulation of verification rules …

The design of concurrent programs that run reliably and efficiently on networks of
interconnected computers will remain an important challenge for the foreseeable future, as …

This thesis studies various manifestations of monads in the mathematics of computation and
presents three applications of calculi based on monads. The view that monads provide …

A general framework based on Hoare logic is introduced for specifying and reasoning about
Constraint Logic Programs with dynamic scheduling. The framework consists of a mixed …

This is an essay where the author expresses his views on applied denotational semantics. In
the author's opinion, whether a software system has or does not have a sufficiently abstract …

In the current paper we present a powerful technique of obtaining natural deduction proof
systems for first-order fixpoint logics. The term fixpoint logics refers collectively to a class of …

Résumé Cette thèse est consacrée à l'utilisation des méthodes formelles de spécification et
de vérification dans le cadre des techniques déductives basées sur la preuve de théorèmes …

The complexity of electronic systems has increased dramatically in recent years. This has
led to an increased reliance on system description languages such as, VHDL and Verilog, or …

Verification Condition Generator (VCG) tools have been effective in simplifying the task of
proving programs correct. However, in the past these VCG tools have in general not …