Program equivalence checking by two-tape automata

DOI10.1007/s10559-010-9232-zzbMath1288.68171OpenAlexW2088459913MaRDI QIDQ2452753

Vladimir A. Zakharov

Publication date: 5 June 2014

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-010-9232-z

zbMATH Keywords

equivalencecomputational complexityprogramalgorithmic decidabilitymultitape automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines

Cites Work

• Technique of traces in solving the equivalence problem in algebraic program models
• Efficient algorithms for checking the equivalence of programs in interrupt handling models
• Metalinear schemes with transfer of constants
• Rational equivalence relations
• Automata-theoretic techniques for modal logics of programs
• A hierarchy of program models
• Semigroup program models
• On the decidability of the equivalence problem for orthogonal sequential programs
• A polynomial-time algorithm that recognizes the commutative equivalence of program schemata
• On formalised computer programs
• Decidable Properties of Monadic Functional Schemas
• On the Decidability of the Equivalence Problem for Monadic Recursive Programs
• The equivalence problem for deterministic finite-turn pushdown automata
• Implementation and Application of Automata
• Implementation and Application of Automata
• Fast algorithms for deciding the equivalence of propositional operator programs on ordered semigroup scales
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Program equivalence checking by two-tape automata