An axiomatization of D-scheme strong equivalence

DOI10.1016/0022-0000(83)90040-5zbMath0547.68019OpenAlexW2006107362MaRDI QIDQ799095

Douglas R. Troeger

Publication date: 1983

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(83)90040-5

zbMATH Keywords

Dijkstra schemesmonadic flowchart schemessigma-algebra

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Axiomatizing schemes and their behaviors ⋮ Weak equivalence in a class of structured program schemes

Cites Work

• Algebraic and graph theoretic characterizations of structured flowchart schemes
• Structured Programming With and Without go to Statements
• Unnamed Item
• Unnamed Item

This page was built for publication: An axiomatization of D-scheme strong equivalence