The Turing programming language: design and definition
The Turing programming language: design and definition
Predicate calculus and program semantics
Predicate calculus and program semantics
Systematic software development using VDM (2nd ed.)
Systematic software development using VDM (2nd ed.)
Proof in VDM: a practitioner's guide
Proof in VDM: a practitioner's guide
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Software Development: A Rigorous Approach
Software Development: A Rigorous Approach
Mural: A Formal Development Support System
Mural: A Formal Development Support System
Theoretical Computer Science - Foundations of software science and computation structures
The Early Search for Tractable Ways of Reasoning about Programs
IEEE Annals of the History of Computing
A program verifier
Operational semantics: concepts and their expression
Information Processing Letters - Special issue: Contribution to computing science
Understanding programming language concepts via operational semantics
Domain modeling and the duration calculus
RPL: a policy language for dynamic reconfiguration
Proceedings of the 2008 RISE/EFTS Joint International Workshop on Software Engineering for Resilient Systems
Reflections on, and Predictions for, Support Systems for the Development of Programs
ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
| Hi-index | 0.00 |
Reasoning about programs using "axioms" is well established; in this paper we argue that reasoning about a program directly in terms of Structural Operational Semantic (SOS) language descriptions is a viable addition and that this is anyway necessary for the vast majority of languages where there is nothing like a full axiomatic description. Using an SOS description is likely to require detailed proofs whose acceptability to users will depend on suitable support systems. The paper presents a very simple example to illustrate how we can reason about (in fact, develop) a program to prove that it satisfies a specification. The main contribution is to use this trivial example to point out issues in designing an interactive proof system for constructing such proofs.