On an equivalence checking technique for algebraic models of programs

DOI10.1134/S0361768811060065MaRDI QIDQ1758688zbMATH OpenFDO

Authors R. I. Podlovchenko

Publication date 16 November 2012

Published in Programming and Computer Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0361768811060065

zbMATH Keywords

decision algorithmequivalence problempolynomial complexityprogram schema

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Formal languages and automata (68Q45)

Recommendations

• On the polynomial complexity of the equivalence checking problem in algebraic models of programs
• Complete systems of equivalent transformations in balanced semigroup models of programs with left cancellation
• Technique of traces in solving the equivalence problem in algebraic program models
• Efficient equivalence-checking algorithms for procedural programs in progressive semigroup gateway models
• On a class of algebraic models of programs of practical interest

Cites work

• A polynomial-time algorithm that recognizes the commutative equivalence of program schemata

Cited in

(20)

• The problem of equivalence in commutative s-models for programs
• On the construction of complete systems of equivalent transformations of program schemes
• A polynomial-time algorithm that recognizes the commutative equivalence of program schemata
• Complete systems of equivalent transformations in balanced semigroup models of programs with left cancellation
• Efficient equivalence-checking algorithms for procedural programs in progressive semigroup gateway models
• On the polynomial complexity of the equivalence checking problem in algebraic models of programs
• scientific article; zbMATH DE number 1693485 (Why is no real title available?)
• Equivalence checking using structural methods
• Algorithmic algebraic model checking. III: Approximate methods
• Studies in the theory of algebraic models of programs with procedures
• A case of insolubility of the problem of equivalence of programs
• Fast algorithms for deciding the equivalence of operator programs on balanced scales.
• AlPiNA: A Symbolic Model Checker
• Algorithm for verifying the equivalence of linear unary recursive programs on ordered semigroup scales
• An Efficient Equivalence-checking Algorithm for a Model of Programs with Commutative and Absorptive Statements
• Implementation and Application of Automata
• scientific article; zbMATH DE number 5181785 (Why is no real title available?)
• Equivalence checking for orthocomplemented bisemilattices in log-linear time
• Technique of traces in solving the equivalence problem in algebraic program models
• Efficient algorithms for checking the equivalence of programs in interrupt handling models

This page was built for publication: On an equivalence checking technique for algebraic models of programs

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