Triple
T10197237
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Gerard J. Holzmann |
E238792
|
entity |
| Predicate | developed |
P73
|
FINISHED |
| Object | SPIN model checker |
E846885
|
NE FINISHED |
How this triple was built (2 steps)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: SPIN model checker | Statement: [Gerard J. Holzmann, developed, SPIN model checker]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: SPIN model checker Context triple: [Gerard J. Holzmann, developed, SPIN model checker]
-
A.
SPIN model checker
chosen
SPIN is a widely used open-source model checker designed for the formal verification of distributed software systems and communication protocols.
-
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.
PRISM probabilistic model checker
PRISM probabilistic model checker is a formal verification tool used to model, analyze, and verify systems that exhibit probabilistic behavior, such as randomized algorithms and communication or security protocols.
-
D.
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.
-
E.
FDR model checker
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 batches)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69ca84e1ea088190b38162e43d4cfa8f |
completed | March 30, 2026, 2:12 p.m. |
| NER | Named-entity recognition | batch_69cdedcaf6688190938d8e56e29493eb |
completed | April 2, 2026, 4:17 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d35512ab2c8190b2802c7bb22e7323 |
completed | April 6, 2026, 6:39 a.m. |
Created at: March 30, 2026, 9:13 p.m.