The Calculus of Computation
E260370
The Calculus of Computation is a textbook that introduces the mathematical foundations of verification, focusing on logic-based methods for specifying and proving properties of computational systems.
All labels observed (1)
| Label | Occurrences |
|---|---|
| The Calculus of Computation canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T2384367 — 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: The Calculus of Computation Context triple: [Zohar Manna, authorOf, The Calculus of Computation]
-
A.
Computing with Register Machines
"Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
-
B.
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.
-
C.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
"Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
-
D.
Isabelle proof assistant
Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
-
E.
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.
- 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: The Calculus of Computation Target entity description: The Calculus of Computation is a textbook that introduces the mathematical foundations of verification, focusing on logic-based methods for specifying and proving properties of computational systems.
-
A.
Computing with Register Machines
"Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
-
B.
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.
-
C.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
"Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
-
D.
Isabelle proof assistant
Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
-
E.
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.
- F. None of above. chosen
Statements (45)
| Predicate | Object |
|---|---|
| instanceOf |
computer science book
ⓘ
non-fiction book ⓘ textbook ⓘ |
| aimsTo |
bridge theory and practice in formal verification
ⓘ
provide a rigorous foundation for verification techniques ⓘ |
| coversTopic |
decision procedures
ⓘ
first-order logic ⓘ model checking ⓘ propositional logic ⓘ satisfiability ⓘ temporal logic ⓘ theorem proving ⓘ verification of hardware systems ⓘ verification of software systems ⓘ |
| focusesOn |
logic-based methods for proving properties of computational systems
ⓘ
logic-based methods for specifying properties of computational systems ⓘ mathematical foundations of verification ⓘ |
| hasAuthor |
Aaron R. Bradley
ⓘ
Zohar Manna ⓘ |
| hasCountryOfPublication |
United States of America
ⓘ
surface form:
United States
|
| hasEdition | first edition ⓘ |
| hasField |
computer science
ⓘ
formal methods ⓘ mathematical logic ⓘ program verification ⓘ |
| hasFormat |
eBook
ⓘ
hardcover ⓘ |
| hasISBN | 978-3-540-74112-0 ⓘ |
| hasLanguage | English ⓘ |
| hasPageCount | approximately 400 pages ⓘ |
| hasPublicationYear | 2007 ⓘ |
| hasPublisher | Springer ⓘ |
| hasSubject |
decision procedures
ⓘ
logic in computer science ⓘ verification ⓘ |
| hasSubtitle | Decision Procedures with Applications to Verification ⓘ |
| hasTitle | The Calculus of Computation self-link ⓘ |
| intendedFor |
advanced undergraduate students
ⓘ
graduate students ⓘ practitioners of program verification ⓘ researchers in formal methods ⓘ |
| partOfSeries | Texts in Computer Science ⓘ |
| usesMethod |
automated reasoning techniques
ⓘ
logic-based specification ⓘ proof systems ⓘ |
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: The Calculus of Computation Description of subject: The Calculus of Computation is a textbook that introduces the mathematical foundations of verification, focusing on logic-based methods for specifying and proving properties of computational systems.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.