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

DOI

10.1109/sfcs.1977.32

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

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

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