## Nusmv 2: An opensource tool for symbolic model checking (2002)

### Cached

### Download Links

- [nusmv.irst.itc.it]
- [sra.itc.it]
- [www.cs.cmu.edu]
- [www.cs.cmu.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 234 - 14 self |

### BibTeX

@INPROCEEDINGS{Cimatti02nusmv2:,

author = {Alessandro Cimatti and Edmund Clarke and Enrico Giunchiglia and Fausto Giunchiglia and Marco Pistore and Marco Roveri and Roberto Sebastiani and Armando Tacchella},

title = {Nusmv 2: An opensource tool for symbolic model checking},

booktitle = {},

year = {2002},

pages = {359--364},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

### Citations

1302 |
Symbolic Model Checking
- McMillan
- 1993
(Show Context)
Citation Context ...escribes version 2 of the NuSMV tool. NuSMV is a symbolic model checker originated from the reengineering, reimplementation and extension of SMV, the original BDD-based model checker developed at CMU =-=[15]-=-. The NuSMV project aims at the development of a state-of-the-art symbolic model checker, designed to be applicable in technology transfer projects: it is a well structured, open, flexible and documen... |

1121 | Chaff: engineering an efficient SAT solver
- Moskewicz, Madigan, et al.
- 2001
(Show Context)
Citation Context ...f the whole system (see e.g., [19, 10] for a discussion). It is currently under development a generic interface to SAT solvers to allow for the use of new state of the art SAT solvers like e.g. CHAFF =-=[16]-=-. The different properties that are checked on a FSM are handled and shown to the user by a property manager, that is independent of the model checking engine used for the verification. This means tha... |

712 | Symbolic Model Checking without BDDs
- Biere, Cimatti, et al.
- 1999
(Show Context)
Citation Context ... functionalities of the previous version, and extend them in several directions. The main novelty in NuSMV2 is the integration of model checking techniques based on propositional satisfiability (SAT) =-=[4]-=-. SAT-based model checking is currently enjoying a substantial success in several industrial fields (see, e.g., [10], but also [5]), and opens up new research directions. BDD-based and SAT-based model... |

112 | NuSMV: a new symbolic model checker
- Cimatti, Clarke, et al.
(Show Context)
Citation Context ... designed to be applicable in technology transfer projects: it is a well structured, open, flexible and documented platform for model checking, and is robust and close to industrial systems standards =-=[6]-=-. The first version of NuSMV, referred with NuSMV1 in the following, basically implements BDD-based symbolic model checking. The new version of NuSMV (NuSMV2 in the following) inherits all the functio... |

84 |
Benefits of Bounded Model Checking in an Industrial Setting
- Copti, Fix, et al.
- 2001
(Show Context)
Citation Context ...integration of model checking techniques based on propositional satisfiability (SAT) [4]. SAT-based model checking is currently enjoying a substantial success in several industrial fields (see, e.g., =-=[10]-=-, but also [5]), and opens up new research directions. BDD-based and SAT-based model checking are often able to solve different classes of problems, and can therefore be seen as complementary techniqu... |

77 | A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions
- Audemard, Bertoli, et al.
(Show Context)
Citation Context ...ntegration between BDD-based and SAT-based technologies. The new internal architecture also opens up the possibility to integrate different boolean encodings (e.g. [8]) and verification engines (e.g. =-=[1]-=-, allowing for Bounded Model Checking of Timed Automata.) NuSMV2 has been used as the starting framework for the implementation and the evaluation of new verification techniques (see, e.g., [9] in thi... |

72 | Model Checking Early Requirements Specification in Tropos
- Fuxman, Pistore, et al.
- 2001
(Show Context)
Citation Context ...tion techniques (see, e.g., [9] in this volume). It has also been used as the verification engine for tools in different application areas, ranging from the formal validation of software requirements =-=[12]-=-, to the verification of StateChart models [11], to automated task planning [3]. Several of these applications have required thedevelopment of new functionalities and improvements to NuSMV2. The code... |

61 | Efficient BDD Algorithms for FSM Synthesis and Verification
- Ranjan, Aziz, et al.
- 1995
(Show Context)
Citation Context ...-based model checking. In the case of BDD-based model checking, a BDDbased representation of the Finite State Machine (FSM) is constructed. In this step, different partitioning methods and strategies =-=[18]-=- can be used. Then, different forms of BDD-based verification can be applied: reachability analysis, fair CTL model checking, LTL model checking via reduction to CTL model checking, computation of qua... |

55 | MBP: a model based planner
- Bertoli, Cimatti, et al.
- 2001
(Show Context)
Citation Context ...rification engine for tools in different application areas, ranging from the formal validation of software requirements [12], to the verification of StateChart models [11], to automated task planning =-=[3]-=-. Several of these applications have required thedevelopment of new functionalities and improvements to NuSMV2. The code for these extensions is currently being included in the mainstream NuSMV2 dist... |

51 | Verification support for workflow design with UML activity graphs
- Eshuis, Wieringa
- 2002
(Show Context)
Citation Context .... It has also been used as the verification engine for tools in different application areas, ranging from the formal validation of software requirements [12], to the verification of StateChart models =-=[11]-=-, to automated task planning [3]. Several of these applications have required thedevelopment of new functionalities and improvements to NuSMV2. The code for these extensions is currently being includ... |

44 | SAT based abstraction-refinement using ILP and machine learning techniques
- Clarke, Gupta, et al.
- 2002
(Show Context)
Citation Context ... (e.g. [1], allowing for Bounded Model Checking of Timed Automata.) NuSMV2 has been used as the starting framework for the implementation and the evaluation of new verification techniques (see, e.g., =-=[9]-=- in this volume). It has also been used as the verification engine for tools in different application areas, ranging from the formal validation of software requirements [12], to the verification of St... |

41 | Tuning sat checkers for bounded model-checking
- Shtrichman
- 2000
(Show Context)
Citation Context ...ver based on the Davis-Logemann-Loveland procedure. The features provided by SIM can produce dramatic speed-ups in the overall performances of the SAT checker, and thus of the whole system (see e.g., =-=[19, 10]-=- for a discussion). It is currently under development a generic interface to SAT solvers to allow for the use of new state of the art SAT solvers like e.g. CHAFF [16]. The different properties that ar... |

40 | Compositional reasoning in model checking
- Berezin, Campos, et al.
- 1997
(Show Context)
Citation Context ... flattener. The same reduction steps are applied to the *.- properties , thus obtaining the corresponding flattened boolean ! / versions . In addition, !0/ by means of the cone of influence reduction =-=[2]-=-, it is possible to restrict the analysis of each property to the relevant parts of the model 1*.-%2 *.- . This reduction can /43 be extremely effective in tackling the state explosion problem. The pr... |

24 | Evaluating search heuristics and optimization techniques in propositional satisfiability
- Giunchiglia, Maratea, et al.
- 2001
(Show Context)
Citation Context ...MV2 enters a loop, interleaving problem generation and solution attempt via a call to the SAT solver, and iterates until a solution is found or the specified maximum bound is reached. NuSMV2 uses SIM =-=[13]-=- as the internal SAT solver. SIM is a SAT solver based on the Davis-Logemann-Loveland procedure. The features provided by SIM can produce dramatic speed-ups in the overall performances of the SAT chec... |

19 | Improving the Encoding of LTL Model Checking into SAT
- Cimatti, Pistore, et al.
(Show Context)
Citation Context ...ing for the stand-alone use of other SAT solvers. With respect to the tableau construction in [4], enhancements have been carried out that can significantly improve the performances of the SAT solver =-=[7]-=-. In bounded model checking, NuSMV2 enters a loop, interleaving problem generation and solution attempt via a call to the SAT solver, and iterates until a solution is found or the specified maximum bo... |

10 |
A Fully Automated Approach for Proving Safety Properties in Interlocking Software Using Automatic Theorem-Proving
- BorÃ¤lv
- 1997
(Show Context)
Citation Context ...model checking techniques based on propositional satisfiability (SAT) [4]. SAT-based model checking is currently enjoying a substantial success in several industrial fields (see, e.g., [10], but also =-=[5]-=-), and opens up new research directions. BDD-based and SAT-based model checking are often able to solve different classes of problems, and can therefore be seen as complementary techniques. Starting f... |

8 |
Level Symbolic Model Checking: A New Approach for Verifying Arithmetic Circuits
- Word
- 1995
(Show Context)
Citation Context ...s are proprietary. Moreover, several important techniques have been implemented only in prototype tools and have not been further maintained or developed (see e.g., the very nice results described in =-=[8]-=-). This is a clear disadvantage in terms of scientific progress, and is slowing down the introduction of model checking in non-traditional application domains. With the OpenSource model [17], a whole ... |