| A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science 13, (1981), pages 45--60. 5 |
....the classical temporal logics. 9.1 Temporal Logics Temporal logics were designed by philosophers to study linguistic construct involving the ow of time. Later, in [Pri67] Prior revived the temporal logic theory. The idea was rst introduced into the computer science eld by Amir Pnueli [Pnu77, Pnu79] to be used to formally verify concurrent systems. In these rst works it was showed that it is not sucient to formally prove properties such as termination in order to guarantee the correctness of a program. Temporal properties such as liveness properties must be also checked (see [Pnu79] ....
....[Pnu77, Pnu79] to be used to formally verify concurrent systems. In these rst works it was showed that it is not sucient to formally prove properties such as termination in order to guarantee the correctness of a program. Temporal properties such as liveness properties must be also checked (see [Pnu79] Temporal logic can be seen as an instance of modal logic. Modal logic (see [HC68, Che80] can be de ned as the study of context dependent properties such as necessity and possibility. The meaning of expressions depends on a speci c context. Modal operators are de ned in order to combine ....
A. Pnueli. The Temporal Semantics of Concurrent Programs. In G. Kahn, editor, Semantics of Concurrent Computations, volume 70 of Lecture Notes in Computer Science, pages 1-20. Springer-Verlag, 1979.
....semantical models, and refinements, respectively. 1. 1 Proof logic: background and proposal When dealing with concurrent, reactive, or open systems, it is essential to be able to directly discuss what is happening during program execution, and temporal logic is particularly suited to this purpose [99, 100]. The two main constructs in temporal logic are 2A (henceforth A) and 3A (eventually A) The former states that A is true from now on in the computation, while the latter states that A will become true in some point in the future. Girard s linear logic [62] starts from the desire to have a logic ....
....tailored to describe computations. The set of worlds is discrete and the accessibility relation is interpreted as the transitive closure of a next state relation. In this perspective, temporal logic formulae make statements about the truth of assertions as time goes by during program execution [98, 99, 100]. Moreover, in temporal logic worlds are called states as they represent computation states. 3.1 Modal Logic The syntax of modal logic is based on a denumerable set P rop of propositional symbols, classical logic connectives, and modal operators [72, 63, 120] The set of well formed formulae is ....
[Article contains additional citation context not shown here]
A. Pnueli. The Temporal Semantics of Concurrent Programs. Theoretical Computer Science, 13:45--60, 1981.
No context found.
A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science 13, (1981), pages 45--60. 5
No context found.
A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13(1), 45--60, 1981.
No context found.
A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45--60, 1981.
No context found.
Pnueli, A. 1981. The temporal semantics of concurrent programs. Theor. Comput. Sci. 13, 45--60.
No context found.
Amir Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45--80, 1981.
No context found.
A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45--60, 1982.
No context found.
A. Pnueli. The Temporal Semantics of Concurrent Programs. Theoretical Computer Science, 13:45--60, 1981.
No context found.
Pnueli, A. "The Temporal Semantics of Concurrent Programs." Theoretical Computer Science, 13:1-20, 1981.
No context found.
A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45--60, 1981.
No context found.
A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13(1):45-60, 1981.
No context found.
A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45--60, 1981.
No context found.
Pnueli, A., The Temporal Semantics of Concurrent Programs, Theoretical Computer Science, 13:45--60, 1981.
No context found.
A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45--60, 1981.
No context found.
Amir Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45--80, 1981.
No context found.
A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45--60, 1981.
No context found.
A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13(1), 45--60, 1981.
No context found.
A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45--60, 1981.
No context found.
A. Pnueli. The temporal semantics of concurrent programs, 1977. Tel-Aviv University.
No context found.
A. Pnueli. The Temporal Semantics of Concurrent Programs. Theoretical Computer Science, 13:45--60, 1981.
No context found.
A. Pnueli, Temporal semantics of concurrent programs. Theoret. Comput. Sci. 27 333-354 (1983).
No context found.
Amir Pnueli. The temporal semantics of concurrent programs. In Gilles Kahn, editor, Semantics of Concurrent Computation,volume 70 of Lecture Notes in Computer Science, pages 1--20. Springer-Verlag, July 1979.
No context found.
A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45--60, 1981.
No context found.
Amir Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45--60, 1981.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC