The Temporal Logic of Programs.¶

Pnueli, A. (1977). The Temporal Logic of Programs. Proceedings of the 18th Annual Symposium on Foundations of Computer Science (FOCS), 46-57.

Type: Conference paper
Intellectual base: Primary research
Year: 1977
Pages: 46-57
DOI: 10.1109/sfcs.1977.32
DOI registrant: Institute of Electrical and Electronics Engineers
Link: https://doi.org/10.1109/SFCS.1977.32
Cited from: mathematics

Cited by¶

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes¶

Quantifier
- In software specifications "for every request, eventually a response" is a universal-existential, and temporal logics build their entire specification language around quantifier scope over states and paths.
  This sourceFounds temporal logic for program specification; 'for every request, eventually a response' is a universal-existential over states and paths.

Verification¶

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:81cbb0207f8a · see in the full table