Model Checking (book)
E241708
"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.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Model Checking (book) canonical | 2 |
| Model Checking | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2169591 — 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: Model Checking (book) Context triple: [Edmund M. Clarke, notableWork, Model Checking (book)]
-
A.
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.
-
B.
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.
-
C.
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.
-
D.
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.
-
E.
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.
- 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: Model Checking (book) Target entity description: "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.
-
A.
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.
-
B.
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.
-
C.
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.
-
D.
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.
-
E.
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.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
book
ⓘ
textbook ⓘ |
| aim | to present theory and practice of model checking ⓘ |
| author |
Doron A. Peled
ⓘ
linked to:
Doron Peled
Edmund M. Clarke ⓘ Orna Grumberg ⓘ |
| covers | both theory and practice of model checking ⓘ |
| describes |
model checking algorithms
ⓘ
state explosion problem ⓘ symbolic representations of state spaces ⓘ temporal logic semantics ⓘ verification of communication protocols ⓘ verification of concurrent systems ⓘ |
| emphasizes | automated verification techniques ⓘ |
| field |
computer science
ⓘ
formal methods ⓘ model checking ⓘ verification ⓘ |
| focus | finite-state model checking ⓘ |
| influenced | research in formal verification ⓘ |
| language | English ⓘ |
| publisher | MIT Press ⓘ |
| topic |
CTL
ⓘ
linked to:
CTL*
LTL ⓘ abstraction techniques ⓘ automata-theoretic model checking ⓘ automated verification ⓘ binary decision diagrams ⓘ branching-time temporal logic ⓘ compositional verification ⓘ fairness constraints ⓘ fairness properties ⓘ finite-state systems ⓘ hardware verification ⓘ linear-time temporal logic ⓘ liveness properties ⓘ mu-calculus ⓘ partial order reduction ⓘ safety properties ⓘ software verification ⓘ specification languages ⓘ state-space exploration ⓘ symbolic model checking ⓘ temporal logic ⓘ |
| use |
to prove correctness properties of hardware systems
ⓘ
to prove correctness properties of software systems ⓘ |
| usedAs |
graduate-level textbook
ⓘ
reference for researchers in model checking ⓘ |
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: Model Checking (book) Description of subject: "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.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.