The Temporal Logic of Programs
E900195
The Temporal Logic of Programs is a landmark 1977 paper by Amir Pnueli that introduced temporal logic as a formal framework for specifying and verifying the behavior of concurrent and reactive computer programs.
All labels observed (4)
| Label | Occurrences |
|---|---|
| "The Temporal Logic of Programs" | 1 |
| "The Temporal Logic of Programs" (original publication) | 1 |
| The Temporal Logic of Programs canonical | 1 |
| temporal logic of programs | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T11016093 — 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 Temporal Logic of Programs Context triple: [Amir Pnueli, notableWork, The Temporal Logic of Programs]
-
A.
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.
-
B.
An Axiomatic Basis for Computer Programming
"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.
-
C.
Temporal Logic of Actions
Temporal Logic of Actions is a formal framework for specifying and reasoning about concurrent and distributed systems using temporal logic to describe system behaviors over time.
-
D.
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.
-
E.
Dijkstra weakest precondition calculus
Dijkstra weakest precondition calculus is a formal method for reasoning about program correctness by computing the weakest conditions that must hold before execution to guarantee a desired postcondition.
- 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 Temporal Logic of Programs Target entity description: The Temporal Logic of Programs is a landmark 1977 paper by Amir Pnueli that introduced temporal logic as a formal framework for specifying and verifying the behavior of concurrent and reactive computer programs.
-
A.
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.
-
B.
An Axiomatic Basis for Computer Programming
"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.
-
C.
Temporal Logic of Actions
Temporal Logic of Actions is a formal framework for specifying and reasoning about concurrent and distributed systems using temporal logic to describe system behaviors over time.
-
D.
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.
-
E.
Dijkstra weakest precondition calculus
Dijkstra weakest precondition calculus is a formal method for reasoning about program correctness by computing the weakest conditions that must hold before execution to guarantee a desired postcondition.
- F. None of above. chosen
Statements (32)
| Predicate | Object |
|---|---|
| instanceOf |
computer science paper
ⓘ
scientific paper ⓘ |
| appliesTo |
concurrent programs
ⓘ
reactive programs ⓘ |
| author | Amir Pnueli ⓘ |
| describedBySource |
"The Temporal Logic of Programs" (original publication)
ⓘ
linked to:
The Temporal Logic of Programs
|
| field |
computer science
ⓘ
formal methods ⓘ program verification ⓘ temporal logic ⓘ |
| focusesOn |
liveness properties of programs
ⓘ
safety properties of programs ⓘ |
| hasAward | Turing Award recognition of its contribution ⓘ |
| hasImpactOn |
design of temporal logics used in verification tools
ⓘ
development of temporal specification formalisms ⓘ |
| influencedField |
concurrent program verification
ⓘ
formal specification languages ⓘ model checking ⓘ reactive system verification ⓘ |
| introducedConcept |
temporal logic of programs
ⓘ
linked to:
The Temporal Logic of Programs
use of temporal logic for program specification ⓘ use of temporal logic for program verification ⓘ |
| language | English ⓘ |
| mainTopic |
concurrent programs
ⓘ
program verification ⓘ reactive systems ⓘ temporal logic ⓘ |
| notableAs | landmark paper in temporal logic for programs ⓘ |
| proposes |
temporal-logic-based framework for specifying program behavior
ⓘ
temporal-logic-based framework for verifying program behavior ⓘ |
| publicationYear | 1977 ⓘ |
| usesLogic | linear-time temporal logic ⓘ |
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 Temporal Logic of Programs Description of subject: The Temporal Logic of Programs is a landmark 1977 paper by Amir Pnueli that introduced temporal logic as a formal framework for specifying and verifying the behavior of concurrent and reactive computer programs.
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: The Temporal Logic of Programs
linked to: The Temporal Logic of Programs
The Temporal Logic of Programs
→
describedBySource
→
"The Temporal Logic of Programs" (original publication)
ⓘ
linked to: The Temporal Logic of Programs