BISIMULATOR: A Modular Tool for On-the-Fly Equivalence Checking

Bergamini, Damien; Descoubes, Nicolas; Joubert, Christophe; Mateescu, Radu

doi:10.1007/978-3-540-31980-1_42

Cited by 31 publications

(29 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The verification technique based on Bes resolution allows one to reproduce the first algorithm by observing that the Bess corresponding to bisimulations between deterministic Ltss are conjunctive, and by devising a specialized local resolution algorithm for this case [34]. The algorithm for the nondeterministic case is outperformed in practice by local Bes resolution algorithms, as it was observed experimentally [4].…”

Section: Introductionmentioning

confidence: 92%

“…This representation is application-independent, allowing to employ the resolution algorithms as computing engines for several on-the-fly verification tools of Cadp: the model checker Evaluator [35], the equivalence checker Bisimulator [4,34], and the Reductor tool for Lts generation equipped with partial order reductions. Table 2 summarizes the local resolution algorithms currently available in Caesar Solve and their application for equivalence checking within Bisimulator.…”

Section: Implementation and Experimentsmentioning

confidence: 99%

See 1 more Smart Citation

Improved On-the-Fly Equivalence Checking Using Boolean Equation Systems

Mateescu

Oudot

Model Checking Software

Self Cite

View full text Add to dashboard Cite

Abstract. Equivalence checking is a classical verification method for ensuring the compatibility of a finite-state concurrent system (protocol ) with its desired external behaviour (service) by comparing their underlying labeled transition systems (Ltss) modulo an appropriate equivalence relation. The local (or on-the-fly) approach for equivalence checking combats state explosion by exploring the synchronous product of the Ltss incrementally, thus allowing an efficient detection of errors in complex systems. However, when the two Ltss being compared are equivalent, the on-the-fly approach is outperformed by the global one, which completely builds the Ltss and computes the equivalence classes between states using partition refinement. In this paper, we consider the approach based on translating the on-the-fly equivalence checking problem in terms of the local resolution of a boolean equation system (Bes). We propose two enhancements of the approach in the case of equivalent Ltss: a new, faster encoding of equivalence relations in terms of Bess, and a new local Bes resolution algorithm with a better average complexity. These enhancements were incorporated into the Bisimulator 2.0 equivalence checker of the Cadp toolbox, and they led to significant performance improvements w.r.t. existing on-the-fly equivalence checking algorithms.

show abstract

Section: Introductionmentioning

confidence: 92%

Section: Implementation and Experimentsmentioning

confidence: 99%

Improved On-the-Fly Equivalence Checking Using Boolean Equation Systems

Mateescu

Oudot

Model Checking Software

Self Cite

View full text Add to dashboard Cite

show abstract

“…In addition, priorities may differentiate interactions: when several interactions are possible, the one with highest priority must occur, preempting others (when interaction have the same priority, any of them may occur). To our knowledge, BIP verification features are now limited to a deadlock detection tool [5], while CADP offers several model checkers [43,44,45], equivalence checkers [6], tools for compositional verification [23,38,25], test case generation [33], performance evaluation [14], and even more 5 . Nonetheless, a distributed code generation tool is available for BIP [9]; it instantiates a multiway rendezvous protocol to handle interaction in a distributed way-the protocol presented in this paper improves over the one used in BIP.…”

Section: Modeling Languages Equipped With Both Formal Verification Anmentioning

confidence: 99%

Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous

Evrard

Lang

2017

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

Formal process languages inheriting the concurrency and communication features of process algebras are convenient formalisms to model distributed applications, especially when they are equipped with formal verification tools (e.g., model checkers) to help hunting for bugs early in the development process. However, even starting from a fully verified formal model, bugs are likely to be introduced while translating (generally by hand) the concurrent model -which relies on high-level and expressive communication primitives-into the distributed implementation -which often relies on low-level communication primitives. In this paper, we present DLC, a compiler that enables distributed code to be generated from models written in a formal process language called LNT, which is equipped with a rich verification toolbox named CADP, and where processes interact by value-passing multiway rendezvous. The generated code uses an elaborate protocol to implement rendezvous, and can be either executed in an autonomous way (i.e., without requiring additional code to be defined by the user), or connected to external software through user-modifiable C functions. The protocol itself is modeled in LNT and verified using CADP. We present several experiments assessing the performance of DLC, including the Raft consensus algorithm.

show abstract

“…This modular architecture facilitates the addition of new equivalence relations (each relation is implemented as a separate module containing the Bes translation and the diagnostic interpretation) and does not penalize performance, Bisimulator competing favourably with other implementations of algorithms dedicated to on-the-fly equivalence checking [4]. The diagnostics (counterexamples) issued by the tool when the Ltss are not equivalent (or not included) are acyclic graphs containing all the sequences that, simultaneously executed in the two Ltss, lead to non equivalent states.…”

Section: Some Verification Toolsmentioning

confidence: 99%

Specification and Analysis of Asynchronous Systems using CADP

Mateescu¹

2008

Modeling and Verification of Real‐Time Systems

Self Cite

View full text Add to dashboard Cite

Abstract. The design of complex industrial critical systems involving asynchronous parallelism requires the use of formal methods, assisted by appropriate verification tools, in order to detect and correct errors as early as possible. In this paper, we illustrate the use of the Cadp toolbox for the formal modeling and verification of such systems by considering as an example a unit dedicated to the drilling of metal products. We describe in the Lotos language two different versions of the unit, supervised by a sequential and a parallel controller, respectively. Then, we perform the generation and minimisation of the two underlying state spaces, and also the inspection (visual checking) of the smaller one, corresponding to the version equipped with a sequential controller. Finally, we analyse the behaviour of the two versions of the drilling unit by means of two complementary verification methods, based on bisimulations (equivalence checking) and temporal logics (model checking).

show abstract

BISIMULATOR: A Modular Tool for On-the-Fly Equivalence Checking

Cited by 31 publications

References 7 publications

Improved On-the-Fly Equivalence Checking Using Boolean Equation Systems

Improved On-the-Fly Equivalence Checking Using Boolean Equation Systems

Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous

Specification and Analysis of Asynchronous Systems using CADP

Contact Info

Product

Resources

About