An Efficient Equivalence-checking Algorithm for a Model of Programs with Commutative and Absorptive Statements

DOI10.3233/FI-2016-1410MaRDI QIDQ4589207zbMATH OpenOpenAlexFDO

Authors V. V. Podymov

Publication date 9 November 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2016-1410

zbMATH Keywords

commutativitysemigroupsequivalence checkingprogram modelsleft absorption

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• On an equivalence checking technique for algebraic models of programs
• On the polynomial complexity of the equivalence checking problem in algebraic models of programs
• Efficient equivalence-checking algorithms for procedural programs in progressive semigroup gateway models
• The problem of equivalence in commutative s-models for programs
• Model Checking Recursive Programs with Exact Predicate Abstraction
• A polynomial-time algorithm that recognizes the commutative equivalence of program schemata
• An efficient approach for abstraction-refinement in model checking
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences
• Calculus of equivalences of abstract programs

Cited in

(3)

• Equivalence checking of Petri net models of programs using static and dynamic cut-points
• Efficient algorithms for checking the equivalence of programs in interrupt handling models
• The problem of equivalence in commutative s-models for programs

This page was built for publication: An Efficient Equivalence-checking Algorithm for a Model of Programs with Commutative and Absorptive Statements

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