NuSMV
E824080
NuSMV is an open-source symbolic model checker designed for the formal verification of finite-state systems using temporal logic specifications.
All labels observed (1)
| Label | Occurrences |
|---|---|
| NuSMV canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9838525 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: NuSMV Context triple: [Symbolic Model Checking, usedInTool, NuSMV]
-
A.
Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
-
B.
Z3 SMT solver
Z3 SMT solver is a high-performance Satisfiability Modulo Theories (SMT) solver developed at Microsoft Research, widely used in program verification, formal methods, and automated reasoning.
-
C.
Symbolic Model Checking
Symbolic Model Checking is a formal verification technique that uses symbolic representations, such as binary decision diagrams, to efficiently verify properties of hardware and software systems with very large state spaces.
-
D.
Z3: An Efficient SMT Solver
Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
-
E.
Model Checking (book)
"Model Checking" is a foundational textbook that systematically presents the theory and practice of using automated verification techniques to prove correctness properties of hardware and software systems.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: NuSMV Target entity description: NuSMV is an open-source symbolic model checker designed for the formal verification of finite-state systems using temporal logic specifications.
-
A.
Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
-
B.
Z3 SMT solver
Z3 SMT solver is a high-performance Satisfiability Modulo Theories (SMT) solver developed at Microsoft Research, widely used in program verification, formal methods, and automated reasoning.
-
C.
Symbolic Model Checking
Symbolic Model Checking is a formal verification technique that uses symbolic representations, such as binary decision diagrams, to efficiently verify properties of hardware and software systems with very large state spaces.
-
D.
Z3: An Efficient SMT Solver
Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
-
E.
Model Checking (book)
"Model Checking" is a foundational textbook that systematically presents the theory and practice of using automated verification techniques to prove correctness properties of hardware and software systems.
- F. None of above. chosen
Statements (51)
| Predicate | Object |
|---|---|
| instanceOf |
formal verification tool
ⓘ
open-source software ⓘ software tool ⓘ symbolic model checker ⓘ |
| basedOn | SMV NERFINISHED ⓘ |
| developedAt |
Fondazione Bruno Kessler (FBK)
NERFINISHED
ⓘ
IRST (Istituto per la Ricerca Scientifica e Tecnologica) NERFINISHED ⓘ |
| developedInCollaborationWith | Carnegie Mellon University (CMU) NERFINISHED ⓘ |
| hasInputLanguage | SMV-like modeling language ⓘ |
| hasOutput |
counterexample traces
ⓘ
witness traces ⓘ |
| hasSuccessor | nuXmv NERFINISHED ⓘ |
| implements | symbolic model checking ⓘ |
| isOpenSource | true ⓘ |
| license | GNU General Public License ⓘ |
| supportsFeature |
CTL model checking
ⓘ
LTL model checking ⓘ bounded model checking ⓘ computation of counterexamples ⓘ computation of reachable states ⓘ computation of strongly connected components ⓘ computation of witnesses ⓘ fairness constraints ⓘ invariants checking ⓘ language for specifying transition systems ⓘ modules and hierarchical modeling ⓘ non-determinism ⓘ non-deterministic assignments ⓘ processes and concurrency ⓘ symbolic reachability analysis ⓘ |
| supportsLogic |
CTL
NERFINISHED
ⓘ
CTL* (partially via encodings) ⓘ LTL ⓘ |
| supportsModelType |
asynchronous systems
ⓘ
finite-state systems ⓘ hardware systems ⓘ protocols ⓘ software systems ⓘ synchronous systems ⓘ |
| supportsPlatform |
Linux
ⓘ
Windows ⓘ macOS ⓘ |
| usedFor |
formal verification
ⓘ
research in model checking ⓘ teaching formal methods ⓘ verification of communication protocols ⓘ verification of hardware designs ⓘ verification of software systems ⓘ |
| usesTechnique |
Binary Decision Diagrams (BDDs)
NERFINISHED
ⓘ
SAT-based model checking ⓘ |
| writtenInLanguage | C ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: NuSMV Description of subject: NuSMV is an open-source symbolic model checker designed for the formal verification of finite-state systems using temporal logic specifications.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.