Triple
T17674750
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Spec# |
E440617
|
entity |
| Predicate | hasComponent |
P35
|
FINISHED |
| Object | Spec# static program verifier |
—
|
NE NERFINISHED |
How this triple was built (3 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: Spec# static program verifier | Statement: [Spec#, hasComponent, Spec# static program verifier]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Spec# static program verifier Context triple: [Spec#, hasComponent, Spec# static program verifier]
-
A.
Program Verification: Approaches and Tools
"Program Verification: Approaches and Tools" is a foundational work in computer science that systematically presents methods and practical techniques for proving the correctness of software programs.
-
B.
Verification of Concurrent Programs
"Verification of Concurrent Programs" is a foundational computer science text that presents formal methods and techniques for proving the correctness of programs that execute concurrently.
-
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.
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.
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.
- 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: Spec# static program verifier Target entity description: Spec# static program verifier is a formal verification tool that automatically checks Spec# programs for correctness properties such as type safety, null dereferences, and contract compliance using logical reasoning.
-
A.
Program Verification: Approaches and Tools
"Program Verification: Approaches and Tools" is a foundational work in computer science that systematically presents methods and practical techniques for proving the correctness of software programs.
-
B.
Verification of Concurrent Programs
"Verification of Concurrent Programs" is a foundational computer science text that presents formal methods and techniques for proving the correctness of programs that execute concurrently.
-
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.
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.
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.
- F. None of above. chosen
Provenance (2 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_69d8b9e87e18819087104a44dc4dc5b1 |
completed | April 10, 2026, 8:50 a.m. |
| NER | Named-entity recognition | batch_69e46f6ba22081909e2099490c047378 |
completed | April 19, 2026, 6 a.m. |
Created at: April 10, 2026, 10 a.m.