Interpolation and SAT-based model checking
E909018
"Interpolation and SAT-based model checking" is a seminal research work by Kenneth McMillan that introduced the use of logical interpolation with SAT solvers to improve the efficiency and scalability of formal hardware and software verification.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Interpolation and SAT-based model checking canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T11173122 — 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: Interpolation and SAT-based model checking Context triple: [Kenneth McMillan, notableWork, Interpolation and SAT-based model checking]
-
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.
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.
-
C.
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.
-
D.
Temporal Verification of Reactive Systems
"Temporal Verification of Reactive Systems" is a foundational book in formal methods that presents rigorous techniques for specifying and verifying the correctness of reactive and concurrent systems using temporal logic.
-
E.
SPIN model checker
SPIN is a widely used open-source model checker designed for the formal verification of distributed software systems and communication protocols.
- 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: Interpolation and SAT-based model checking Target entity description: "Interpolation and SAT-based model checking" is a seminal research work by Kenneth McMillan that introduced the use of logical interpolation with SAT solvers to improve the efficiency and scalability of formal hardware and software verification.
-
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.
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.
-
C.
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.
-
D.
Temporal Verification of Reactive Systems
"Temporal Verification of Reactive Systems" is a foundational book in formal methods that presents rigorous techniques for specifying and verifying the correctness of reactive and concurrent systems using temporal logic.
-
E.
SPIN model checker
SPIN is a widely used open-source model checker designed for the formal verification of distributed software systems and communication protocols.
- F. None of above. chosen
Statements (42)
| Predicate | Object |
|---|---|
| instanceOf |
research paper
ⓘ
scientific publication ⓘ |
| appliesTo |
finite-state systems
ⓘ
hardware designs ⓘ sequential circuits ⓘ software models ⓘ |
| author |
Ken McMillan
NERFINISHED
ⓘ
Kenneth L. McMillan NERFINISHED ⓘ |
| basedOn | Craig interpolation theorem NERFINISHED ⓘ |
| contribution |
improved scalability of model checking using SAT solvers
ⓘ
introduced an interpolation-based refinement loop ⓘ introduced the use of interpolation in SAT-based model checking ⓘ showed how to derive interpolants from resolution proofs of SAT solvers ⓘ |
| enables |
automatic invariant generation
ⓘ
property-directed reachability analysis ⓘ |
| field |
computer-aided verification
ⓘ
formal verification ⓘ model checking ⓘ |
| focusesOn |
SAT-based model checking
ⓘ
hardware verification ⓘ software verification ⓘ symbolic model checking ⓘ |
| goal |
improve efficiency of model checking
ⓘ
improve scalability of verification ⓘ |
| hasMainConcept |
SAT solver proof logging
ⓘ
abstraction refinement ⓘ interpolant ⓘ safety property verification ⓘ state-space exploration ⓘ unsatisfiable proof ⓘ |
| hasTitle | Interpolation and SAT-based model checking NERFINISHED ⓘ |
| influenced |
industrial hardware verification tools
ⓘ
software model checking techniques ⓘ subsequent research on interpolation-based verification ⓘ |
| relatedTo |
bounded model checking
ⓘ
counterexample-guided abstraction refinement ⓘ symbolic reachability analysis ⓘ temporal logic model checking ⓘ |
| usesMethod |
Craig interpolation
NERFINISHED
ⓘ
SAT solving ⓘ logical interpolation ⓘ |
| writtenInLanguage | English NERFINISHED ⓘ |
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: Interpolation and SAT-based model checking Description of subject: "Interpolation and SAT-based model checking" is a seminal research work by Kenneth McMillan that introduced the use of logical interpolation with SAT solvers to improve the efficiency and scalability of formal hardware and software verification.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.