Axiomatic definitions of programming languages, II

Authors:
Joseph Y. Halpern;Albert R. Meyer
Affiliations:
Harvard University, Cambridge, Massachusetts;Massachusetts Institute of Technology, Cambridge, Massachusetts
Venue:
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
1981

Citing 4
Cited 1

Axiomatic definitions of programming languages: a theoretical assessment (preliminary report)

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Specifying programming language semantics: a tutorial and critique of a paper by Hoare and Lauer

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
On the expressive power of Dynamic Logic (Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing

Axiomatic Definitions of Programming Languages: A Theoretical Assessment

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sufficient conditions are given for partial correctness assertions to determine the input-output semantics of quite general classes of programming languages. This determination cannot be unique unless states which are indistinguishable by predicates in the assertions are identified. Even when indistinguishable states are identified, partial correctness assertions may not suffice to determine program semantics.