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

DOI10.3233/FI-2016-1410zbMath1373.68180OpenAlexW2398836986MaRDI QIDQ4589207

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

semigroupscommutativityequivalence checkingprogram modelsleft absorption

Mathematics Subject Classification ID

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

Related Items (1)

Equivalence checking of Petri net models of programs using static and dynamic cut-points

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