An axiomatization of D-scheme strong equivalence

DOI10.1016/0022-0000(83)90040-5MaRDI QIDQ799095zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• Algebraic and graph theoretic characterizations of structured flowchart schemes
• scientific article; zbMATH DE number 3717264 (Why is no real title available?)
• scientific article; zbMATH DE number 3562465 (Why is no real title available?)
• Structured Programming With and Without go to Statements

Cited in

(2)

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

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

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