Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Another look at abstraction in process algebra
14th International Colloquium on Automata, languages and programming
Action versus state based logics for transition systems
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
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
Communication and Concurrency
Efficient on-the-fly model-checking for regular alternation-free mu-calculus
Science of Computer Programming - Special issure on formal methods for industrial critical systems (FMICS 2000)
A Performance Study of BDD-Based Model Checking
FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
Computing Behavioural Relations, Logically
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Safety for Branching Time Semantics
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
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
Local Model-Checking of Modal Mu-Calculus on Acyclic Labeled Transition Systems
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
"On the Fly" Verification of Behavioural Equivalences and Preorders
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Using On-The-Fly Verification Techniques for the Generation of test Suites
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
On-the-fly state space reductions for weak equivalences
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
Partial Order Reductions Using Compositional Confluence Detection
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Structural Analysis of Boolean Equation Systems
ACM Transactions on Computational Logic (TOCL)
BISIMULATOR: a modular tool for on-the-fly equivalence checking
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A sub-quadratic algorithm for conjunctive and disjunctive boolean equation systems
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Bounded analysis and decomposition for behavioural descriptions of components
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
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
Consistent consequence for boolean equation systems
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Equivalence checking for infinite systems using parameterized Boolean equation systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
Boolean Equation Systems (BESS) offer a useful representation for various verification problems on finite-state concurrent systems, such as equivalence/preorder checking and model checking. In particular, on-the-fly resolution methods enable a demand-driven construction of the BES (and hence, of the state space) during verification. In this paper, we present a generic library dedicated to on-the-fly resolution of alternation-free BESS. Four resolution algorithms are currently provided by the library: A1, A2 are general, the latter being optimized to produce small-depth diagnostics, and A3, A4 are specialized for handling acyclic and disjunctive/conjunctive Bess in a memory-efficient way. The library is developed within the CADP toolbox and serves as engine for on-the-fly equivalence/preorder checking modulo five widely-used relations, and for model checking of alternation-free µ-calculus.