AbstractThis paper is concerned with the relationship between the correctness of programs and the satisfiability (or unsatisfiability) of certain formulas of the first-order predicate calculus. Results on the equivalence of programs are also included
This paper is concerned with the semantics (or computational power) of very simple loop programs ove...
AbstractA survey of various results concerning the use of Hoare's logic in proving correctness of no...
International audienceHow to prove the correctness of a program with mathematical certainty? The pri...
Abstract. Correctness is one of the most important property of a program. Nevertherless, the student...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
These lecture notes are intended to introduce the reader to the basic notions of the first order pr...
interpretation is a well-known and extensively used method to extract over-approximate program invar...
A programming system is a language made from a fixed class of data abstractions and a selection of f...
The fundamental relation between a program P and its specification S is correctness: P satisfies S ...
We advocate a declarative approach to proving properties of logic programs. Total correctness can be...
This dissertation shows that satisfiability procedures are abstract interpreters. This insight provi...
We provide here a computational interpretation of first-order logic based on a constructive interpre...
AbstractA programming system is a language made from a fixed class of data abstractions and a select...
This thesis is about the development and usage of deductive methods in two main areas: (i) the deduc...
The paper focusses on the logical backgrounds of the Dijkstra-Scholten program development style for...
This paper is concerned with the semantics (or computational power) of very simple loop programs ove...
AbstractA survey of various results concerning the use of Hoare's logic in proving correctness of no...
International audienceHow to prove the correctness of a program with mathematical certainty? The pri...
Abstract. Correctness is one of the most important property of a program. Nevertherless, the student...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
These lecture notes are intended to introduce the reader to the basic notions of the first order pr...
interpretation is a well-known and extensively used method to extract over-approximate program invar...
A programming system is a language made from a fixed class of data abstractions and a selection of f...
The fundamental relation between a program P and its specification S is correctness: P satisfies S ...
We advocate a declarative approach to proving properties of logic programs. Total correctness can be...
This dissertation shows that satisfiability procedures are abstract interpreters. This insight provi...
We provide here a computational interpretation of first-order logic based on a constructive interpre...
AbstractA programming system is a language made from a fixed class of data abstractions and a select...
This thesis is about the development and usage of deductive methods in two main areas: (i) the deduc...
The paper focusses on the logical backgrounds of the Dijkstra-Scholten program development style for...
This paper is concerned with the semantics (or computational power) of very simple loop programs ove...
AbstractA survey of various results concerning the use of Hoare's logic in proving correctness of no...
International audienceHow to prove the correctness of a program with mathematical certainty? The pri...
DOI
Add to ORKG