Weak equivalence in a class of structured program schemes

DOI10.1016/0022-0000(84)90016-3zbMath0546.68013OpenAlexW2049312593MaRDI QIDQ797988

Douglas R. Troeger

Publication date: 1984

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(84)90016-3

zbMATH Keywords

weak equivalencestructured programmingflowcharts

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• An axiomatization of D-scheme strong equivalence
• Analysis of structured programs
• Algebraic and graph theoretic characterizations of structured flowchart schemes
• On the Computational Complexity of Program Scheme Equivalence
• A Perspective View of Discrete Automata and Their Design

This page was built for publication: Weak equivalence in a class of structured program schemes