Operational semantics and generalized weakest preconditions

DOI10.1016/0167-6423(94)90010-8MaRDI QIDQ1330453zbMATH OpenOpenAlexFDO

Authors Johan L. Lukkien

Publication date 21 July 1994

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(94)90010-8

zbMATH Keywords

unfoldingweakest preconditionoperational semanticstemporal property

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Recommendations

• Formal Methods in Computer-Aided Design
• Structural operational semantics for weak bisimulations
• A proof theoretic approach to operational semantics
• scientific article; zbMATH DE number 65532
• Publication:4945216
• Formal foundations of operational semantics
• Inductive assertions and operational semantics
• Operational semantics with semicommutations
• Structural operational semantics and bounded nondeterminism

Cited in

(7)

• Structural operational semantics for weak bisimulations
• Guards, failure, and partiality: Dijkstra's guarded-command language formulated topologically
• scientific article; zbMATH DE number 794263 (Why is no real title available?)
• Safety and progress of recursive procedures
• Weakest relative precondition semantics. Balancing approved theory and realistic translation verification
• The weakest precondition calculus: Recursion and duality
• Formal semantics for program paths

This page was built for publication: Operational semantics and generalized weakest preconditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330453)