Affiliation:
1. New York University, New York, USA
Abstract
We study transformational program logics for correctness and incorrectness that we extend to explicitly handle both termination and nontermination. We show that the logics are abstract interpretations of the right image transformer for a natural relational semantics covering both finite and infinite executions. This understanding of logics as abstractions of a semantics facilitates their comparisons through their respective abstractions of the semantics (rather that the much more difficult comparison through their formal proof systems). More importantly, the formalization provides a calculational method for constructively designing the sound and complete formal proof system by abstraction of the semantics. As an example, we extend Hoare logic to cover all possible behaviors of nondeterministic programs and design a new precondition (in)correctness logic.
Publisher
Association for Computing Machinery (ACM)
Reference114 articles.
1. Peter Aczel. 1977. An Introduction to Inductive Definitions. In Handbook of Mathematical Logic, John Barwise (Ed.). North–Holland, Amsterdam. 739–782. isbn:0-444-86388-5
2. Ten Years of Hoare's Logic: A Survey—Part I
3. Ten years of Hoare's logic: A survey— part II: Nondeterminism
4. Fifty years of Hoare’s logic
5. Assessing the Success and Impact of Hoare’s Logic
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献