Z. Manna and A. Pnueli. Verification of concurrent programs: The temporal framework. In R. S. Boyer and J. S. Moore, editors, The Correctness Problem in Computer Science, pages 215--273, Academic Press, New York, 1981. 2  Home/Search   Document Not in Database   Summary   Related Articles   Check

....what happens between states of a computation [41] Logics reflecting what happens at states, rather than between them, fall into two general classes: linear time temporal logics and branching time temporal logics. Lineartime temporal logics view time as having a single future, or execution path [59]. Branching time temporal logics view time as having many possible futures [29] These views of futures are reflected in the formulas of the respective logics. Good surveys of temporal logic appear in [28] and [67] HHL includes the branching time logic CTL as one sentential representation. ....

Z. Manna and A. Pnueli. Verification of concurrent programs: The temporal framework. In R.S. Boyer and J.S. Moore, editors, Correctness Problem in Computer Science, pages 215--273. Academic Press, 1982.

....to be made explicit. Formulas of temporal logic can be interpreted as predicates on sequences of states, and various formulations of such temporal logics have been used for specifying properties called temporal propertiesf interest to designers of concurrent programs amport 83a] Lamport 83b] Manna Pnueli 81a] Wolper 83] While there is not general agreement on the details of such a specification language, there is agreement that temporal logic provides a good basis for such a language and it, or something close to it, is sufficiently expressive. Temporal logic has also been used in proving temporal ....

Manna, Z. and A. Pnueli. Verification of concurrent programs: The temporal framework. The Correctness Problem in Computer Science (R.S. Boyer and J.S. Moore, eds.), International Lecture Series in Computer Science, Academic Press, London, 1981, 141-154.

....essence of that property to be made explicit. Formulas of temporal logic can be interpreted as predicates on sequences of states, and various formulations of such temporal logics have been used for specifying properties called temporal properties of interest to designers of concurrent programs [15, 16, 21, 35]. While there is not general agreement on the details of such a specification language, there is agreement that temporal logic provides a good basis for such a language, and it, or something close to it, is sufficiently expressive. Temporal logic has also been used in proving temporal properties ....

MANNA, Z., AND PNUELI, A. Verification of concurrent programs: The temporal framework. In The Correctness Problem in Computer Science, R. S. Boyer and J. S. Moore, Eds. International Lecture Series in Computer Science. Academic Press, London, 1981, pp. 141-154.

....utilizzati sono molteplici ma possono essere raggruppati come segue: Formalismi basati sulla Logica. Logica del primo ordine [Hat82, Men64] Logica di Boyer Moore [BM84, BM88] Logica di ordine superiore [Rei83, Gor87] Logica Temporale [Eme90, RU71] Logica Temporale Lineare [MP82] Logica Temporale ad Intervalli [HKP82] Mu Calcolo [Koz83] con molteplici varianti. Formalismi basati sulla Teoria degli Automi. Macchine di Moore [HU79] Macchine di Dill [Dil88] Formalismi ibridi. Logica temporale lineare ed Automi a stati finiti [Wol85] Logica ....

Z. Manna, A. Pnueli. "Verification of Concurrent Programs: the Temporal Framework". Correctness Problem in Computer Science. (Eds. R. S. Boyer, J. S. Moore), Academic Press, London, 1982.

....e#ecting the computation. Formally, these are Kripke models over a linear flow of time represented by #N, #. Here we shall present a natural and useful temporal logic to reason about computations. It was proposed by Pnueli in his seminal paper [Pnu77] axiomatized and studied in [GPSS80] and [MP81] and since then in many more works, and has become the most well known temporal logic used in computer science nowadays. 3.1.1 Language and syntax The language of LPTL is a propositional language containing a set of atomic propositions AP, the Boolean constant # and connective #, and the ....

....axiomatic system for LPTL is sound and (weakly) complete i.e. a formula is LPTL consistent i# it is satisfiable in a linear temporal model. Proof (sketch) There are various completeness proofs for LPTL in the literature, most of them based on semantic tableau constructions. See e.g. GPSS80] MP81] GHR94] LP00] Here is a sketch of a traditional modal completeness proof, for details on which see [Gol92] The soundness is straightforward, as usual. For the completeness, take a generated canonical model satisfying given formula #. It is a reflexive, transitive, linear, functional ....

Z. Manna and A. Pnueli. Verification of concurrent programs: The temporal framework. In R. Boyer and J. Moore, editors, The Correctness Problem in Computer Science, pages 215--273, London, 1981. Academic Press.

....of verifying for every step in a process model whether it violates the given global constraints. On the other hand temporal logics have been successfully introduced in various areas of computer science in order to specify and automatically verify abstract global properties of finite state systems [19, 5, 18, 32, 25, 9, 6, 33, 26]. Less frequent is their application as a basis for synthesis problems [20, 8] In this paper we present PM MetaFrame, a tool tailored for the automatic synthesis of linear 1 sequences of process model (PM) components from temporal constraints that can be expressed by means of linear time ....

Z. Manna, A. Pnueli: "Verification of concurrent programs: the temporal framework", in R. Boyer, J. Moore eds., "The Correctness Problem in Computer Science", pp.215-273, Academic Press, 1981.

....assertions is often an unintuitive formulation. A more natural expression of such properties is possible with temporal logic. Temporal logic was introduced by Pnueli in [Pnu77] as an adaptation of classical modal logic suitable for reasoning about concurrent programs. The two paper series [MP81b] and [MP81a] by Manna and Pnueli is a thorough introduction to the expression of properties of concurrent programs, and the verification of these properties, using temporal logic. Here the meaning of a system computation is a sequence of system states. The fundamental temporal operators are the ....

Zohar Manna and Amir Pnueli. Verification of concurrent programs: The temporal framework. In Robert S. Boyer and J. Strother Moore, editors, The Correctness Problem in Computer Science, International Lecture Series in Computer Science, pages 215--273. Academic Press, London, 1981. 83

....this partition, we are able to define a simple notion of fair computation. It is clear that most verification methods, such as the Hoare logic of Owicki and Gries in [OG76] the use of invariant assertions advocated by Lamport and Schneider in [LS84b] the temporal logic of Manna and Pnueli in [MP81b] and [MP81a] and the method of deriving proof obligations of Alpern and Schneider in [AS87] can be used to verify the correctness of algorithms expressed in terms of input output automata. We do not fix on a particular methodology for reasoning about the behavior of individual automata. Instead, ....

Zohar Manna and Amir Pnueli. Verification of concurrent programs: The temporal framework. In Robert S. Boyer and J. Strother Moore, editors, The Correctness Problem in Computer Science, International Lecture Series in Computer Science, pages 215--273. Academic Press, London, 1981.

.... the constraints, where z i is the value to be assigned to v i ; namely, for each (v i ; v j ) 2 E, it results z j Gamma z i 2 S I2L(v i ;v j ) I (assuming j i) Problems involving temporal constraints arise in several areas of computer science such as scheduling [2,9] program verification [11,3,12], real time systems [17] temporal databases [18] and artificial intelligence (see [6] for an extensive bibliography) In [5] it is proved that the problem of deciding whether a given network admits a solution is NP hard, also if we restrict each constraint to consist of no more than two ....

Z. Manna and A. Pnueli. Verification of concurrent programs: the temporal framework. In R.S. Boyer and J.S. Moore, editors, The Correctness Problem in Computer Science, pages 215--273. Academic Press, 1981.

....axioms and rules for reasoning about specific data domains to which both the program and the specification refer, and (3) a program part that restricts the set of considered models to those that correspond to the behaviour of the specific program being verified. The classical temporal logic [15, 16] provides a powerful tool for global specification and non compositional verification of existing concurrent programs. However, this logic offers very poor support for modular specification and verification and, consequently, systematic design of concurrent programs is hard (if not impossible) to ....

....systems can be derived from their abstract specifications in a systematic way. 3 What s the problem with TL The linear discrete temporal logic TL has been perceived to be an appropriate tool for both the semantic description of concurrent (and sequential) programs and the reasoning about them [15, 16]. It relies on the fact that concurrent program behaviour can be easily modeled by all possible totally ordered execution sequences arising from interleavings of actions in the separate sequential processes of the concurrent program (interleaving semantics) However, serious problems arise when ....

Z. Manna and A. Pnueli. Verification of concurrent programs: The temporal framework. In R.S. Boyer and J.S. Moore, editors, Correctness Problem in Computer science, pages 215--273, London, 1982. Academic Press.

....constraints can be expressed by temporal logic formulae which are interpreted just in such state sequences. Temporal logic is an extension of classic predicate logic by temporal quantifiers and operators like always , sometime , next , etc. It has primarily been used for program verification [MaP81, Wo83, MaW84, ClES86, Kr87], but has also been applied to database specifications by many authors in the last decade [Se80, CaCF82, EhLG84, Ku84, LiEG85, CaS87, LiS87, FiS88, Li90, Sa91] 1 Temporal formulae, however, usually are interpreted in infinite state sequences. Since in practice only a partial, finite prefix of ....

Manna, Z. and Pnueli, A.: Verification of Concurrent Programs: The Temporal Framework. The Correctness Problem in Computer Science (R.S.Boyer, J.S.Moore, eds.), Academic Press, London 1981, 215--273.

....a concise and precise means of describing complex properties of dynamic systems. It possesses a well founded semantics based on that of modal logic which has already been exploited to support the design of process control applications (Sakuragawa 1987) It supports reasoning about concurrency (Manna and Pnueli 1981). It provides the designer with proof techniques through Kripke semantics. Temporal logic extends first order logic to include the following operators: 3 (read as eventually ) fl (read as next ) 2 (read as always ) and U (read as until ) The use of this formalism relieves the designer from ....

....the screen is refreshed: 3(view(off; errordisp) 3(view(on; errordisp) It is true that eventually errordisp is a view of the off state and eventually errordisp is a view of the on state. This is a violation of our previous requirement because we know that for any formula w: 2( w) j : 3(w) (Manna and Pnueli 1981). The user may not be able to determine the whether the system is on, off or in error from the errordisp alone. If the user cannot determine whether the state of the system they may not be able to predict the effect of their commands. For instance, attempts to start a system may have very ....

Manna, Z. and Pnueli, A. (1981), Verification of concurrent programs: The temporal framework. In R.S. Boyer and J. Strother Moore, editors, The Correctness Problem In Computer Science, pages 215-273. London, United Kingdom: Academic Press.

....These notions give, in a way, a semantics for the concepts of permission and obligation. As is well known, temporal logic has been found to be quite suitable for reasoning about safety ( something bad will never happen ) and liveness properties ( something good will eventually happen ) eg Manna and Pnueli 81] In [Fiadeiro and Maibaum 89a] we have already shown how it is possible to reason about such temporal properties of systems from a specification of their behaviour given in terms of permissions and obligations as above. Basically, we can introduce an additional consequence relation and ....

Z.Manna and A.Pnueli, "Verification of Concurrent Programs: The Temporal Framework", in R.Boyer and J.Moore (eds) The Correctness Problem in Computer Science, Academic Press 1981, 215-273

....a (finite) trace u is the projection of a life cycle of L to the proper events of the process then, after u, there is no commitment for the process to perform any other event. That is, we work only with quiescent traces in the sense of [Misra 84] In the traditional temporal specification jargon [Manna and Pnueli 81] this means that we are interested in processes that satisfy the liveness requirements that may be specified. Whereas safety properties ( nothing bad will ever happen ) are compatible with prefixclosure (the prefix of a safe trace is still safe) liveness requirements ( something good will ....

Z.Manna and A.Pnueli, "Verification of Concurrent Programs: The Temporal Framework", in R.Boyer and J.Moore (eds) The Correctness Problem in Computer Science, Academic Press 1981, 215-273

....programming. Key Words: Temporal logic programming, operational semantics, context parallelism, warehouse, dataflow computation. 1 Introduction Temporal logic has been widely used as a formalism for program specification and verification, modelling temporal databases and reasoning about time [6, 7, 13]. In temporal logic, the meanings of formulas depend on an implicit time parameter and elements from different moments in time can be combined through the use of temporal operators. Therefore, temporal logic can model time dependent and dynamic properties of certain problems in the real world in a ....

Z. Manna and A. Pnueli. Verification of concurrent programs: the temporal framework. In Boyer and Moore, editors, Correctness Problem in Computer Science, pages 215--273. Academic Press, 1981.

....development of real world systems. Users must be able to express the properties of the systems about which they wish to reason as naturally as possible and to confirm mechanically that the specifications, designs, testing criteria and sample executions have the required properties. Temporal logics [2, 19, 21, 32] are well suited for specifying temporal properties of concurrent systems. Experience has shown, however, that specifications of even moderate sized systems are too complex to be readily understood. This complexity stems chiefly from the need to establish the temporal context within which ....

Z. Manna and A. Pnueli. Verification of concurrent programs: The temporal framework. In R. S. Boyer and J. S. Moore, eds., The Correctness Problem in Computer Science, pp. 215--273. Academic Press, 1981.

No context found.

Z. Manna and A. Pnueli. Verification of concurrent programs: The temporal framework. In R. S. Boyer and J. S. Moore, editors, The Correctness Problem in Computer Science, pages 215--273, Academic Press, New York, 1981. 2

No context found.

Z. Manna and A. Pnueli. Verification of Concurrent Programs: The Temporal Framework. In R. Boyer and J. Moore, editors, The Correctness Problem in Computer Science, pages 215--273. Academic Press, London, 1981.

No context found.

Z. Manna and A. Pnueli. Verification of concurrent programs: The temporal framework. In R. Boyer and J. Moore, editors, The Correctness Problem in Computer Science, pages 215--273, London, 1981. Academic Press.

No context found.

Zohar Manna and Amir Pnueli. Verification of concurrent programs: the temporal framework. In R.S. Boyer and J.S. Moore, editors, The Correctness Problem in Computer Science, pages 215--273. Academic Press, London, 1982.

No context found.

Manna, Z., and Pnueli, A. Verification of concurrent programs: the temporal framework. In The Correctness Problem in Computer Science,R.S.Boyer and J. S. Moore, Eds. Academic Press, 1981, pp. 215--273.

No context found.

Manna, Z., and Pnueli, A., Verification of Concurrent Programs: The Temporal Framework, in The Correctness Problem in Computer Science, Boyer & Moore (eds.), Academic Press, pp. 215-273, 1982.

No context found.

Manna, Z., Pnueli, A. (1981). Verification of concurrent programs: the temporal framework. In Boyer and Moore, editors, Correctness Problem in Computer Science, pages 215--273. Academic Press.

No context found.

Z.Manna and A.Pnueli, "Verification of Concurrent Programs: The Temporal Framework", in R.Boyer and J.Moore (eds) The Correctness Problem in Computer Science, Academic Press 1981, 215-273

No context found.

Z.Manna and A.Pnueli, "Verification of Concurrent Programs: The Temporal Framework", in R.Boyer and J.Moore (eds) The Correctness Problem in Computer Science, Academic Press 1981, 215-273

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