Model checking and boolean graphs
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Verifying Bisimulations "On the Fly"
FORTE '90 Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, III
OPEN/CÆSAR: An OPen Software Architecture for Verification, Simulation, and Testing
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
A Tool Set for deciding Behavioral Equivalences
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
A generic on-the-fly solver for alternation-free boolean equation systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
On-the-fly state space reductions for weak equivalences
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
Improved On-the-Fly Equivalence Checking Using Boolean Equation Systems
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
"On the fly" input output conformance verification
SE '08 Proceedings of the IASTED International Conference on Software Engineering
Translating FSP into LOTOS and networks of automata
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Translating Pi-calculus into LOTOS NT
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Fractal Coherence: Scalably Verifiable Cache Coherence
MICRO '43 Proceedings of the 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture
CADP 2010: a toolbox for the construction and analysis of distributed processes
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Specifying and verifying the SYNERGY reconfiguration protocol with LOTOS NT and CADP
FM'11 Proceedings of the 17th international conference on Formal methods
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Distributed on-the-fly model checking and test case generation
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Verification of a self-configuration protocol for distributed applications in the cloud
Proceedings of the 27th Annual ACM Symposium on Applied Computing
An experience report on the verification of autonomic protocols in the cloud
Innovations in Systems and Software Engineering
| Hi-index | 0.00 |
The equivalence checking problem consists in verifying that a system (e.g., a protocol) matches its abstract specification (e.g., a service) by comparing their Labeled Transition Systems (Ltss) modulo a given equivalence relation. Two approaches are traditionally used to perform equivalence checking: global verification requires to construct the two Ltss before comparison, whereas local (or on-the-fly) verification allows to explore them incrementally during comparison. The latter approach is able to detect errors even in prohibitively large systems, and therefore reveals more effective in combating state explosion.