An Axiomatic Basis for Computer Programming
E459518
"An Axiomatic Basis for Computer Programming" is a seminal 1969 paper by C.A.R. Hoare that introduced the formal logical system now known as Hoare logic for reasoning about program correctness.
All labels observed (1)
| Label | Occurrences |
|---|---|
| An Axiomatic Basis for Computer Programming canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T4596165 — 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: An Axiomatic Basis for Computer Programming Context triple: [Hoare logic, describedIn, An Axiomatic Basis for Computer Programming]
-
A.
The Logic of Computer Programming
The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
-
B.
A Discipline of Programming
A Discipline of Programming is a seminal 1976 book by Edsger W. Dijkstra that rigorously develops program construction using formal mathematical reasoning and correctness proofs.
-
C.
"The Complexity of Theorem-Proving Procedures"
"The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
-
D.
Notes on Structured Programming
Notes on Structured Programming is a seminal work by Edsger W. Dijkstra that advocates for disciplined, mathematically grounded program design and helped popularize the principles of structured programming.
-
E.
Böhm–Jacopini theorem
The Böhm–Jacopini theorem is a foundational result in computer science stating that any computer program can be written using only sequence, selection, and iteration constructs, without requiring goto statements.
- 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: An Axiomatic Basis for Computer Programming Target entity description: "An Axiomatic Basis for Computer Programming" is a seminal 1969 paper by C.A.R. Hoare that introduced the formal logical system now known as Hoare logic for reasoning about program correctness.
-
A.
The Logic of Computer Programming
The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
-
B.
A Discipline of Programming
A Discipline of Programming is a seminal 1976 book by Edsger W. Dijkstra that rigorously develops program construction using formal mathematical reasoning and correctness proofs.
-
C.
"The Complexity of Theorem-Proving Procedures"
"The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
-
D.
Notes on Structured Programming
Notes on Structured Programming is a seminal work by Edsger W. Dijkstra that advocates for disciplined, mathematically grounded program design and helped popularize the principles of structured programming.
-
E.
Böhm–Jacopini theorem
The Böhm–Jacopini theorem is a foundational result in computer science stating that any computer program can be written using only sequence, selection, and iteration constructs, without requiring goto statements.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
computer science paper
ⓘ
scientific paper ⓘ seminal work ⓘ |
| approach |
axiomatic
ⓘ
logic-based reasoning about programs ⓘ |
| author |
C. A. R. Hoare
NERFINISHED
ⓘ
Tony Hoare NERFINISHED ⓘ |
| citedAs | Hoare 1969 NERFINISHED ⓘ |
| coreConcept |
assertion
ⓘ
assignment axiom ⓘ composition rule ⓘ conditional rule ⓘ consequence rule ⓘ inference rule ⓘ iteration rule ⓘ loop invariant ⓘ partial correctness ⓘ postcondition ⓘ precondition ⓘ proof of program correctness ⓘ total correctness ⓘ |
| defines | Hoare triple NERFINISHED ⓘ |
| field |
computer science
ⓘ
formal methods ⓘ program verification ⓘ programming languages ⓘ |
| goal | provide logical foundations for proving program correctness ⓘ |
| historicalSignificance |
helped establish program verification as a research area
ⓘ
one of the earliest formal systems for reasoning about imperative programs ⓘ |
| HoareTripleForm | {P} C {Q} ⓘ |
| influenced |
design of verification tools
ⓘ
formal verification ⓘ programming language theory ⓘ software engineering ⓘ |
| introduced |
Hoare logic
NERFINISHED
ⓘ
axiomatic approach to program verification ⓘ |
| language | English ⓘ |
| publicationYear | 1969 ⓘ |
| publishedIn | Communications of the ACM NERFINISHED ⓘ |
| publisher | Association for Computing Machinery NERFINISHED ⓘ |
| relatedConcept |
Dijkstra weakest precondition calculus
NERFINISHED
ⓘ
axiomatic semantics of programming languages ⓘ |
| relatedWork | Communicating Sequential Processes NERFINISHED ⓘ |
| topic |
Hoare logic
NERFINISHED
ⓘ
axiomatic semantics ⓘ program correctness ⓘ |
| usesNotation | Hoare triple 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: An Axiomatic Basis for Computer Programming Description of subject: "An Axiomatic Basis for Computer Programming" is a seminal 1969 paper by C.A.R. Hoare that introduced the formal logical system now known as Hoare logic for reasoning about program correctness.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.