On-the-Fly Data Flow Analysis Based on Verification Technology
Electronic Notes in Theoretical Computer Science (ENTCS)
Behavioral adaptation of component compositions based on process algebra encodings
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
A Model Checking Language for Concurrent Value-Passing Systems
FM '08 Proceedings of the 15th international symposium on Formal Methods
Improved On-the-Fly Equivalence Checking Using Boolean Equation Systems
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
A Multi-Core Solver for Parity Games
Electronic Notes in Theoretical Computer Science (ENTCS)
Computation Tree Regular Logic for Genetic Regulatory Networks
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Adaptation of Service Protocols Using Process Algebra and On-the-Fly Reduction Techniques
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
DATALOG_SOLVE: A Datalog-Based Demand-Driven Program Analyzer
Electronic Notes in Theoretical Computer Science (ENTCS)
Partial Order Reductions Using Compositional Confluence Detection
FM '09 Proceedings of the 2nd World Congress on Formal Methods
CADP 2006: a toolbox for the construction and analysis of distributed processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
C.OPEN and ANNOTATOR: tools for on-the-fly model checking C programs
Proceedings of the 14th international SPIN conference on Model checking software
A study of shared-memory mutual exclusion protocols using CADP
FMICS'10 Proceedings of the 15th international conference on Formal methods for industrial critical systems
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Theoretical Computer Science
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
Property-dependent reductions for the modal Mu-calculus
Proceedings of the 18th international SPIN conference on Model checking software
Structural Analysis of Boolean Equation Systems
ACM Transactions on Computational Logic (TOCL)
A model-extraction approach to verifying concurrent C programs with CADP
Science of Computer Programming
Distributed on-the-fly model checking and test case generation
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Sequential and distributed on-the-fly computation of weak tau-confluence
Science of Computer Programming
Partial model checking using networks of labelled transition systems and boolean equation systems
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On parallel software verification using boolean equation systems
SPIN'12 Proceedings of the 19th international conference on Model Checking Software
Science of Computer Programming
| Hi-index | 0.00 |
Boolean equation systems (Bess) provide a useful framework for modeling various verification problems on finite-state concurrent systems, such as equivalence checking and model checking. These problems can be solved on the fly (i.e., without constructing explicitly the state space of the system under analysis) by using a demand-driven construction and resolution of the corresponding Bes. In this article, we present a generic software library dedicated to on-the-fly resolution of alternation-free Bess. Four resolution algorithms are currently provided by the library: algorithms A1 and A2 are general, the latter being optimized to produce small-depth diagnostics, whereas algorithms A3 and A4 are specialized for handling acyclic and disjunctive/conjunctive Bess in a memory-efficient way. The library has been developed within the Cadp verification toolbox using the generic Open/Caesar environment and is currently used for three purposes: on-the-fly equivalence checking modulo five widely used equivalence relations, on-the-fly model checking of regular alternation-free modal μ-calculus, and on-the-fly reduction of state spaces based on τ-confluence .