Symbolic Model Checking
E239161
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.
All labels observed (4)
How this entity was disambiguated
This entity first appeared as the object of triple T2169590 — 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: Symbolic Model Checking Context triple: [Edmund M. Clarke, notableWork, Symbolic Model Checking]
-
A.
Temporal Logic of Actions
Temporal Logic of Actions is a formal framework for specifying and reasoning about concurrent and distributed systems using temporal logic to describe system behaviors over time.
-
B.
CCS (Calculus of Communicating Systems)
CCS (Calculus of Communicating Systems) is a formal process calculus introduced by Robin Milner for modeling, specifying, and reasoning about concurrent, communicating systems in computer science.
-
C.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
"Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
-
D.
Hoare logic
Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
-
E.
A Symbolic Analysis of Relay and Switching Circuits
A Symbolic Analysis of Relay and Switching Circuits is Claude Shannon’s landmark 1937 master’s thesis that founded modern digital circuit design by applying Boolean algebra to relay and switching 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: Symbolic Model Checking Target entity description: 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.
-
A.
Temporal Logic of Actions
Temporal Logic of Actions is a formal framework for specifying and reasoning about concurrent and distributed systems using temporal logic to describe system behaviors over time.
-
B.
CCS (Calculus of Communicating Systems)
CCS (Calculus of Communicating Systems) is a formal process calculus introduced by Robin Milner for modeling, specifying, and reasoning about concurrent, communicating systems in computer science.
-
C.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
"Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
-
D.
Hoare logic
Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
-
E.
A Symbolic Analysis of Relay and Switching Circuits
A Symbolic Analysis of Relay and Switching Circuits is Claude Shannon’s landmark 1937 master’s thesis that founded modern digital circuit design by applying Boolean algebra to relay and switching systems.
- F. None of above. chosen
Statements (51)
| Predicate | Object |
|---|---|
| instanceOf |
formal verification technique
ⓘ
model checking technique ⓘ |
| addresses | state space explosion problem ⓘ |
| aimsTo |
verify properties of hardware systems
ⓘ
verify properties of software systems ⓘ |
| associatedWithInstitution |
CMU
ⓘ
surface form:
Carnegie Mellon University
|
| associatedWithResearcher |
E. Allen Emerson
ⓘ
Edmund M. Clarke ⓘ Kenneth L. McMillan ⓘ |
| checksPropertyType |
fairness properties
ⓘ
liveness properties ⓘ safety properties ⓘ |
| comparedTo | explicit-state model checking ⓘ |
| coreConcept |
symbolic encoding of state sets as Boolean formulas
ⓘ
symbolic encoding of transition relations as Boolean formulas ⓘ |
| hasAdvantage |
can handle extremely large state spaces compactly
ⓘ
often more memory-efficient than explicit-state methods ⓘ |
| hasLimitation |
BDD size can blow up for some systems
ⓘ
performance depends on variable ordering ⓘ |
| inspired | development of SAT-based model checking ⓘ |
| introducedIn | late 1980s ⓘ |
| notablePublication |
Symbolic Model Checking
self-linksurface differs
ⓘ
surface form:
Symbolic Model Checking: 10^20 States and Beyond
|
| operatesOn | very large state spaces ⓘ |
| relatedTechnique |
SAT-based model checking
ⓘ
SMT-based model checking ⓘ bounded model checking ⓘ |
| represents |
sets of states symbolically
ⓘ
transition relations symbolically ⓘ |
| supportsLogic |
CTL
ⓘ
LTL ⓘ temporal logic ⓘ µ-calculus ⓘ |
| usedInDomain |
embedded systems verification
ⓘ
hardware verification ⓘ protocol verification ⓘ |
| usedInTool |
Cadence SMV
ⓘ
NuSMV ⓘ SMV ⓘ |
| usesAlgorithmicTechnique |
backward reachability
ⓘ
fixed-point computation ⓘ forward reachability ⓘ reachability analysis ⓘ |
| usesDataStructure |
OBDDs
ⓘ
ordered binary decision diagrams ⓘ |
| usesRepresentation |
BDDs
ⓘ
binary decision diagrams ⓘ symbolic representation ⓘ |
| verificationTarget |
communication protocols
ⓘ
concurrent software ⓘ finite-state systems ⓘ synchronous hardware circuits ⓘ |
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: Symbolic Model Checking Description of subject: 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.
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Symbolic Model Checking: 10^20 States and Beyond
subject surface form:
Edmund M. Clarke
this entity surface form:
Symbolic Model Checking (paper)
this entity surface form:
Symbolic Model Checking: An Approach to the State Explosion Problem