CAESAR_SOLVE: A generic library for on-the-fly resolution of alternation-free Boolean equation systems

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 unde...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International journal on software tools for technology transfer Ročník 8; číslo 1; s. 37 - 56
Hlavný autor: Mateescu, Radu
Médium: Journal Article Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: Berlin Springer 01.02.2006
Springer Nature B.V
Predmet:
Algorithms
Applied sciences
Boolean
Boolean algebra
Calculus
Computer science; control theory; systems
Demand analysis
Equivalence
Exact sciences and technology
Libraries
Software
Software engineering
Verification
Equivalence relation
Partial-order reduction
Program library
Finite state machine
Partial ordering
Verification
State space method
Mu calculus
Modeling
Temporal logic
Program verification
Boolean equation
Software libraries
Bisimulation
Confluence
Open systems
Model checking
Modal logic
Boolean equation system
Generic programming
ISSN:1433-2779, 1433-2787
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 mu-calculus, and on-the-fly reduction of state spaces based on tau-confluence. [PUBLICATION ABSTRACT]
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
ISSN:1433-2779
1433-2787
DOI:10.1007/s10009-005-0194-9