Weak equivalence in a class of structured program schemes

DOI10.1016/0022-0000(84)90016-3zbMATH Open0546.68013OpenAlexW2049312593MaRDI QIDQ797988FDOQ797988

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

Recommendations

• scientific article; zbMATH DE number 3928354
• Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas
• An algebraic approach to schemes of structured programs
• An algorithm deciding functional equivalence in a new class of program schemes
• Axiomatizing schemes and their behaviors

zbMATH Keywords

weak equivalencestructured programmingflowcharts

Mathematics Subject Classification ID

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

Cites Work

• Analysis of structured programs
• A Perspective View of Discrete Automata and Their Design
• On the Computational Complexity of Program Scheme Equivalence
• Algebraic and graph theoretic characterizations of structured flowchart schemes
• Title not available (Why is that?)
• An axiomatization of D-scheme strong equivalence

Cited In (3)

• Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas
• An algorithm deciding functional equivalence in a new class of program schemes
• Title not available (Why is that?)

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

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