FDR model checker
E440674
FDR model checker is a refinement-based verification tool used to analyze and prove properties of systems specified in the Communicating Sequential Processes (CSP) formalism.
All labels observed (1)
| Label | Occurrences |
|---|---|
| FDR model checker canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T4443709 — 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: FDR model checker Context triple: [CSP (Communicating Sequential Processes), hasToolSupport, FDR model checker]
-
A.
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.
-
B.
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.
-
C.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
-
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.
branching-time temporal logic CTL*
Branching-time temporal logic CTL* is a highly expressive formalism in computer science used to specify and reason about the behavior of concurrent and reactive systems over branching time structures.
- 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: FDR model checker Target entity description: FDR model checker is a refinement-based verification tool used to analyze and prove properties of systems specified in the Communicating Sequential Processes (CSP) formalism.
-
A.
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.
-
B.
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.
-
C.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
-
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.
branching-time temporal logic CTL*
Branching-time temporal logic CTL* is a highly expressive formalism in computer science used to specify and reason about the behavior of concurrent and reactive systems over branching time structures.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
formal verification tool
ⓘ
model checker ⓘ refinement checker ⓘ software tool ⓘ |
| abbreviationOf | Failures-Divergence Refinement ⓘ |
| analyzes | finite-state CSP models ⓘ |
| basedOn | refinement checking ⓘ |
| canGenerate |
counterexample traces
ⓘ
refinement counterexamples ⓘ |
| checksRelation | implementation refines specification ⓘ |
| developedFor | formal methods community ⓘ |
| domain |
concurrency theory
ⓘ
formal verification ⓘ |
| hasFeature |
assertion-based verification
ⓘ
command-line interface ⓘ compositional verification ⓘ compression and reduction techniques ⓘ counterexample generation ⓘ data independence analysis ⓘ graphical user interface ⓘ state space exploration ⓘ support for CSPM (machine-readable CSP) ⓘ |
| implements |
CSP refinement semantics
ⓘ
failures semantics ⓘ failures-divergences semantics ⓘ stable failures semantics ⓘ traces semantics ⓘ |
| inputLanguage | CSPM ⓘ |
| originatesFrom | CSP research community ⓘ |
| supportsFormalism |
Communicating Sequential Processes
ⓘ
linked to:
CSP (Communicating Sequential Processes)
|
| supportsProperty |
deadlock freedom
ⓘ
divergence freedom ⓘ failures refinement ⓘ failures-divergences refinement ⓘ trace refinement ⓘ |
| usedFor |
checking deadlock freedom
ⓘ
checking livelock freedom ⓘ checking liveness properties ⓘ checking refinement between CSP processes ⓘ checking safety properties ⓘ verification of communication protocols ⓘ verification of concurrent systems ⓘ verification of distributed systems ⓘ |
| usedIn |
academic research
ⓘ
industrial case studies ⓘ teaching of formal methods ⓘ |
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: FDR model checker Description of subject: FDR model checker is a refinement-based verification tool used to analyze and prove properties of systems specified in the Communicating Sequential Processes (CSP) formalism.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.