Structured Programming with go to Statements
ACM Computing Surveys (CSUR)
An axiomatic basis for computer programming
Communications of the ACM
Correctness-preserving program transformations
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
Computability and completeness in logics of programs (Preliminary Report)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A new incompleteness result for Hoare's system
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Some transformations for developing recursive programs
Proceedings of the international conference on Reliable software
Nondeterminism in logics of programs
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Recursion in logics of programs
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Computability and completeness in logics of programs (Preliminary Report)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Propositional Dynamic Logic for Recursive Procedures
VSTTE '08 Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments
Correct transformation: From object-based graph grammars to PROMELA
Science of Computer Programming
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Local Reasoning for Global Invariants, Part II: Dynamic Boundaries
Journal of the ACM (JACM)
| Hi-index | 0.00 |
Denoting a version of Hoare's system for proving partial correctness of recursive programs by H, we present an extension D which may be thought of as H &ugr; {@@@@,@@@@,@@@@,@@@@} &ugr; H-1, including the rules of H, four special purpose rules and inverse rules to those of Hoare. D is shown to be a complete system (in Cook's sense) for proving deductions of the form &sgr;1,....&sgr;n @@@@ &sgr; over a language, the wff's of which are assertions in some assertion language L and partial correctness specifications of the form p(&agr;)q. All valid formulae of L are taken as axioms of D. It is shown that D is sufficient for proving partial correctness, total correctness and program equivalence as well as other important properties of programs, the proofs of which are impossible in H. The entire presentation is worked out in the framework of nondeterministic programs employing iteration and mutually recursive procedures.