Consistent and complementary formal theories of the semantics of programming languages

zbMath0264.68006MaRDI QIDQ2561836

Peter E. Lauer, C. A. R. Hoare

Publication date: 1974

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General topics in the theory of software (68N01)

Related Items (23)

Correct translation of data parallel assignment onto array processors ⋮ Predicate transformers as power operations ⋮ Equivalence of formal semantics definition methods ⋮ Unnamed Item ⋮ The formal definition of a real-time language ⋮ A simple relation between relational and predicate transformer semantics for nondeterministic programs ⋮ Floyd's principle, correctness theories and program equivalence ⋮ Semantical analysis of specification logic ⋮ General correctness: A unification of partial and total correctness ⋮ Some applications of topology to program semantics ⋮ An axiomatic proof technique for parallel programs ⋮ Axiomatic approach to side effects and general jumps ⋮ Fifty years of Hoare's logic ⋮ On an equivalence between continuation and stack semantics ⋮ The clean termination of Pascal programs ⋮ Program invariants as fixedpoints ⋮ Propositional dynamic logic of regular programs ⋮ Current methods for proving program correctness ⋮ Proving program inclusion using Hoare's logic ⋮ Ten years of Hoare's logic: A survey. II: Nondeterminism ⋮ Average case optimality for linear problems ⋮ The axiomatic semantics of programs based on Hoare's logic ⋮ Constructive design of a hierarchy of semantics of a transition system by abstract interpretation

Uses Software

• LCF

This page was built for publication: Consistent and complementary formal theories of the semantics of programming languages