Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
A Discipline of Programming
An Introduction to the General Theory of Algorithms
An Introduction to the General Theory of Algorithms
Computability and completeness in logics of programs (Preliminary Report)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
LOGICS OF PROGRAMS: AXIOMATICS AND DESCRIPTIVE POWER
LOGICS OF PROGRAMS: AXIOMATICS AND DESCRIPTIVE POWER
Axiomatic Definitions of Programming Languages: A Theoretical Assessment
Journal of the ACM (JACM)
Specifying the Semantics of while Programs: A Tutorial and Critique of a Paper by Hoare and Lauer
ACM Transactions on Programming Languages and Systems (TOPLAS)
Axiomatic definitions of programming languages, II
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On effective axiomatizations of Hoare logics
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Axiomatic definability and completeness for recursive programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
A precise definition is given of how partial correctness or termination assertions serve to specify the semantics of classes of program schemes. Assertions involving only formulas of first order predicate calculus are proved capable of specifying program scheme semantics, and effective axiom systems for deriving such assertions are described. Such axiomatic specifications are possible despite the limited expressive power of predicate calculus.