Consistent and complementary formal theories of the semantics of programming languages
From MaRDI portal
Cited in
(24)- Ten years of Hoare's logic: A survey. II: Nondeterminism
- 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
- An axiomatic proof technique for parallel programs
- Axiomatic approach to side effects and general jumps
- On an equivalence between continuation and stack semantics
- The clean termination of Pascal programs
- Program invariants as fixedpoints
- Propositional dynamic logic of regular programs
- Correct translation of data parallel assignment onto array processors
- Equivalence of formal semantics definition methods
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
- Predicate transformers as power operations
- General correctness: A unification of partial and total correctness
- Fifty years of Hoare's logic
- Some applications of topology to program semantics
- scientific article; zbMATH DE number 3688675 (Why is no real title available?)
- Current methods for proving program correctness
- Tony Hoare: his path to the ACM Turing Award
- Proving program inclusion using Hoare's logic
- Average case optimality for linear problems
- The axiomatic semantics of programs based on Hoare's logic
- Semantical analysis of specification logic
This page was built for publication: Consistent and complementary formal theories of the semantics of programming languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2561836)
