AbstractIn this paper, the relation between WHILE-programs and formal proofs of their quantified specification is studied. This gives us a logical basis for programming methodology since the programming concepts such as assignment statements, IF-statements and WHILE-statements are fully explained logically, here ‘logically’ means ‘how to think’. As an example, Hoare's program FIND is studied methodologically
We describe a formalization of the meta-mathematics of programming in a higher-order logical calculu...
Formal reasoning about computer programs can be based directly on the semantics of the programming l...
We show how some classical static analyses for imperative programs, and the optimizing transformatio...
AbstractIn this paper, the relation between WHILE-programs and formal proofs of their quantified spe...
Programs are like constructive proofs of their specifications. This analogy is a precise equivalenc...
A formal correctness proof of code containing loops such as while statements typically uses the tech...
In this paper an attempt is made to explore the logical founda-tions of computer programming by use ...
In this paper an attempt is made to explore the logical founda-tions of computer programming by use ...
In several papers,e.g. [COOK] or [APT] the problems of correctness and completeness of Hoare calculi...
Existing verification technology, though theoretically adequate, is not directly applicable to the ...
AbstractLogic programs are considered as abductive programs with negative literals as abductive hypo...
Using Martin-Löf's set theory as a programming logic one identifies specifications with sets and pro...
A syntax directed proof system which allows to prove liveness properties of while-programs is introd...
Systems built for automated program construction aim at the formalization of the programming process...
A unified framework for formal reasoning about programs and deductive mechanisms involved in program...
We describe a formalization of the meta-mathematics of programming in a higher-order logical calculu...
Formal reasoning about computer programs can be based directly on the semantics of the programming l...
We show how some classical static analyses for imperative programs, and the optimizing transformatio...
AbstractIn this paper, the relation between WHILE-programs and formal proofs of their quantified spe...
Programs are like constructive proofs of their specifications. This analogy is a precise equivalenc...
A formal correctness proof of code containing loops such as while statements typically uses the tech...
In this paper an attempt is made to explore the logical founda-tions of computer programming by use ...
In this paper an attempt is made to explore the logical founda-tions of computer programming by use ...
In several papers,e.g. [COOK] or [APT] the problems of correctness and completeness of Hoare calculi...
Existing verification technology, though theoretically adequate, is not directly applicable to the ...
AbstractLogic programs are considered as abductive programs with negative literals as abductive hypo...
Using Martin-Löf's set theory as a programming logic one identifies specifications with sets and pro...
A syntax directed proof system which allows to prove liveness properties of while-programs is introd...
Systems built for automated program construction aim at the formalization of the programming process...
A unified framework for formal reasoning about programs and deductive mechanisms involved in program...
We describe a formalization of the meta-mathematics of programming in a higher-order logical calculu...
Formal reasoning about computer programs can be based directly on the semantics of the programming l...
We show how some classical static analyses for imperative programs, and the optimizing transformatio...
DOI
Add to ORKG