The denotational semantics of programming languages
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Reasoning about recursively defined data structures
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Complementary Definitions of Programming Language Semantics
Complementary Definitions of Programming Language Semantics
A Discipline of Programming
A Theory of Programming Language Semantics
A Theory of Programming Language Semantics
On the Relation between Direct and Continuation Semantics
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Developing formally verified Ada programs
IWSSD '89 Proceedings of the 5th international workshop on Software specification and design
Formal Verification of Ada Programs
IEEE Transactions on Software Engineering
Dynamic Verification of C++ Generic Algorithms
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
A survey of semantic description frameworks for programming languages
ACM SIGPLAN Notices
| Hi-index | 0.00 |
A theory of partial correctness proofs is formulated in Scott's logic computable junctions. This theory allows mechanical construction of verification condition solely on the basis of a denotational language definition. Extensionally these conditions, the resulting proofs, and the required program augmentation are similar to those of Hoare style proofs; conventional input, output, and invariant assertions in a first order assertion language are required. The theory applies to almost any sequential language defined by a continuation semantics; for example, there are no restrictions on aliasing or side-effects. Aspects of "static semantics",such as type and declaration constraints, which are expressed in the denotational definition are validated as part of the verification condition generation process.