The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Chaff: engineering an efficient SAT solver
Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., & Malik, S. (2001) · Proceedings of the 38th conference on Design automation - DAC '01 · doi:10.1145/378239.379017 · Cited by 2,940
Clarke, E., McMillan, K., Campos, S., & Hartonas-Garmhausen, V. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61474-5_93 · Cited by 2,839
Self-citationSymbolic Model Checking without BDDs
Biere, A., Cimatti, A., Clarke, E., & Zhu, Y. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49059-0_14 · Cited by 2,150
Self-citationMcMillan, K. L. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3190-6 · Cited by 1,677
NUSMV: a new symbolic model checker
Cimatti, A., Clarke, E. M., Giunchiglia, F., et al. (2000) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s100090050046 · Cited by 726
Self-citationSymbolic Model Checking without BDDs
Biere, A., Cimatti, A., Clark, E., & Zhu, Y. (1999) · doi:10.21236/ada360973 · Cited by 537
Self-citationBenefits of Bounded Model Checking at an Industrial Setting
Copty, F., Fix, L., Fraer, R., Giunchiglia, E., Kamhi, G., Tacchella, A., & Vardi, M. Y. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44585-4_43 · Cited by 189
Self-citationTuning SAT Checkers for Bounded Model Checking
Shtrichman, O. (2000) · Lecture notes in computer science · doi:10.1007/10722167_36 · Cited by 167
SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques
Clarke, E. M., Gupta, A., Kukula, J. H., & Strichman, O. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45657-0_20 · Cited by 148
Self-citation
Cited by
Biere, A., Cimatti, A., Clarke, E. M., Strichman, O., & Zhu, Y. (2003) · Advances in Computers · doi:10.1016/s0065-2458(03)58003-2 · Cited by 952
Self-citationAbstractions for network update
Reitblatt, M., Foster, N., Rexford, J., Schlesinger, C., & Walker, D. (2012) · Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/2342356.2342427 · Cited by 584
The nuXmv Symbolic Model Checker
Cavada, R., Cimatti, A., Dorigatti, M., Griggio, A., Mariotti, A., Micheli, A., Mover, S., Roveri, M., & Tonetta, S. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-08867-9_22 · Cited by 545
Self-citationSynthesis of interface specifications for Java classes
Alur, R., Černý, P., Madhusudan, P., & Nam, W. (2005) · Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1040305.1040314 · Cited by 316
The Quest for Efficient Boolean Satisfiability Solvers
Zhang, L., & Malik, S. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45657-0_2 · Cited by 279
Best Practices for Making Reproducible Biochemical Models
Porubsky, V. L., Goldberg, A. P., Rampadarath, A. K., Nickerson, D. P., Karr, J. R., & Sauro, H. M. (2020) · Cell Systems · doi:10.1016/j.cels.2020.06.012 · Cited by 45
Jutge.org: Characteristics and Experiences
Petit, J., Roura, S., Carmona, J., Cortadella, J., Duch, J., Gimenez, O., Mani, A., Mas, J., Rodriguez-Carbonell, E., Rubio, E., et al. (2018) · IEEE Transactions on Learning Technologies · doi:10.1109/tlt.2017.2723389 · Cited by 33
“The technology behind NuSMV is based on the theory and algorithms for sequential equivalence checking that were proposed and developed during the nineties [21].”
BackgroundFormal Methods for Autonomous Systems
Wongpiromsarn, T., Ghasemi, M., Cubuktepe, M., Bakirtzis, G., Carr, S., Karabag, M. O., Neary, C., Gohari, P., & Topcu, U. (2023) · Foundations and Trends® in Systems and Control · doi:10.1561/2600000029 · Cited by 17
Metadata
- Authors
- Cimatti, A., Clarke, E., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., & Tacchella, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 359-364
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1489391022
- Cited by
- 1,654
- References
- 9
- FWCI
- 26.60
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.