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
Logic for reasoning about programs must proceed from the programming language semantics. It is our t...
AbstractIn 1971, C.A.R. Hoare gave the proof of correctness and termination of a rather complex algo...
We show how logical frameworks can provide a basis for logic program synthesis. With them, we may us...
AbstractIn this paper, the relation between WHILE-programs and formal proofs of their quantified spe...
This thesis presents a formal apparatus which is adequate both to express the termination and correc...
A formal correctness proof of code containing loops such as while statements typically uses the tech...
Programs are like constructive proofs of their specifications. This analogy is a precise equivalenc...
Existing verification technology, though theoretically adequate, is not directly applicable to the ...
In several papers,e.g. [COOK] or [APT] the problems of correctness and completeness of Hoare calculi...
AbstractWe consider the completeness of Hoare's logic with a first-order assertion language applied ...
We describe a formalization of the meta-mathematics of programming in a higher-order logical calculu...
Systems built for automated program construction aim at the formalization of the programming process...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
AbstractWe discuss the stepwise construction of iterative programs from specifications, represented ...
AbstractWe present the program development concept in a logical framework including constructive typ...
Logic for reasoning about programs must proceed from the programming language semantics. It is our t...
AbstractIn 1971, C.A.R. Hoare gave the proof of correctness and termination of a rather complex algo...
We show how logical frameworks can provide a basis for logic program synthesis. With them, we may us...
AbstractIn this paper, the relation between WHILE-programs and formal proofs of their quantified spe...
This thesis presents a formal apparatus which is adequate both to express the termination and correc...
A formal correctness proof of code containing loops such as while statements typically uses the tech...
Programs are like constructive proofs of their specifications. This analogy is a precise equivalenc...
Existing verification technology, though theoretically adequate, is not directly applicable to the ...
In several papers,e.g. [COOK] or [APT] the problems of correctness and completeness of Hoare calculi...
AbstractWe consider the completeness of Hoare's logic with a first-order assertion language applied ...
We describe a formalization of the meta-mathematics of programming in a higher-order logical calculu...
Systems built for automated program construction aim at the formalization of the programming process...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
AbstractWe discuss the stepwise construction of iterative programs from specifications, represented ...
AbstractWe present the program development concept in a logical framework including constructive typ...
Logic for reasoning about programs must proceed from the programming language semantics. It is our t...
AbstractIn 1971, C.A.R. Hoare gave the proof of correctness and termination of a rather complex algo...
We show how logical frameworks can provide a basis for logic program synthesis. With them, we may us...