An algorithm deciding functional equivalence in a new class of program schemes

DOI10.1016/0304-3975(90)90201-RzbMath0698.68016OpenAlexW2048338103MaRDI QIDQ912596

Viktor K. Sabelfeld

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90201-r

zbMATH Keywords

verificationtransformationdecidabilityprogram optimizationdecision algorithmequivalence of program schemes

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25)

Related Items (6)

Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time ⋮ Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas ⋮ Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas ⋮ On the computational complexity of dynamic slicing problems for program schemas ⋮ Equivalence of conservative, free, linear program schemas is decidable ⋮ On the Decidability of the Equivalence Problem for Monadic Recursive Programs

Cites Work

• The equivalence problem for deterministic two-tape automata
• Äquivalente Transformationen für Flußdiagramme
• On formalised computer programs
• Functional equivalence of discrete processors. II
• A variant of a recursively unsolvable problem
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm deciding functional equivalence in a new class of program schemes