Deriving bisimulation relations from path based equivalence checkers

DOI10.1007/S00165-016-0406-YMaRDI QIDQ520250zbMATH OpenOpenAlexFDO

Authors Kunal Banerjee, Dipankar Sarkar, Chittaranjan Mandal

Publication date 3 April 2017

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00165-016-0406-y

zbMATH Keywords

bisimulation relationpath-based equivalence checkertranslation validationvalue propagation

Mathematics Subject Classification ID

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

Recommendations

• Tools and Algorithms for the Construction and Analysis of Systems
• Testing equivalence as a bisimulation equivalence
• Deciding bisimulation equivalences for a class of non-finite-state programs
• Deciding bisimulation equivalences for a class of non-finite-state programs
• scientific article; zbMATH DE number 2020181

Cites work

• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• Sparse code motion
• Validating High-Level Synthesis

Cited in

(3)

• Equivalence checking of Petri net models of programs using static and dynamic cut-points
• scientific article; zbMATH DE number 4022620 (Why is no real title available?)
• scientific article; zbMATH DE number 177532 (Why is no real title available?)

This page was built for publication: Deriving bisimulation relations from path based equivalence checkers

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