Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. SpringerVerlag, 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....more operational setting of Unity [CM88] specifications. Alur and Henzinger [AH96] and McMillan [McM97] present assume guarantee proof rules for hardware components. A number of other compositional proof rules not based on assume guarantee reasoning have also been proposed, such as [BKP84, CM88, MP95] Yahav [Yah01] describes a method to model check multithreaded programs using a 3 valued logic [SRW99, LAS00] to abstract the store. This technique can verify interesting properties of small programs. Pasareanu et al. PDH99] also describe a model checking tool for compositional checking of ....

Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. SpringerVerlag, 1995.

....(close to functional requirements) expresses reactive types of behaviour. However, combinations of pro active and reactive behaviour can require more complicated requirements expressions. Most types of behaviour of this type can be expressed using rather standard forms of temporal logic; e.g. [13], 7] 8] Further complications arise if the evolution of a system over time is taken into account; then temporal logics of the more standard types do not suffice. Examples of behaviour of this type are relative adaptive behaviour (e.g. exercise improves skill ) in which two different ....

Manna, Z., and Pnueli, A.. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, 1995.

....years, model checking is still computationally infeasible for systems which are represented at a lower abstraction level (with a faithful representation of the real system) Table VI. General comparison of our model. Ref. Name Appl. O O TL [6] DisCo DS A yes yes [33] Promela DS D no yes [34] SPL FTS DS D no yes [5] N A DS D yes yes [35]N A DB yes yes [2]TChimera DB yes no [3]TROLL IS A yesyes [4]TRIO IS A yesyes [7]OSL IS A yesyes [9] Templar DS AD no yes [36]Rapide DS ADyes no Our model DS D yes yes Even though there are a few success stories of temporal logic in the ....

....though there are a few success stories of temporal logic in the industry, e.g. 19]and[20] a survey on the use of formal methods [32] revealed that temporal logic receives only marginal attention. Most current temporal logic based proposals for the design stage of software development (e.g. [34]) do not consider object systems. The application of research stemming from protocol design (e.g. research based on LOTOS, Estelle and Promela) to object oriented systems is often based on assumptions and restrictions which put these proposals beyond the reach of industrial software development. ....

[Article contains additional citation context not shown here]

Manna Z, Pnueli A. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, 1995.

.... programs from [6] Temporal properties of concurrent heap manipulating programs: We have used the framework to verify temporal properties of concurrent heap manipulating programs in particular, liveness properties, such as the absence of starvation in programs using mutual exclusion, and response [14] properties. We have also applied the framework to programs with an unbounded number of threads. Specification of general heap evolution properties: The framework has been used to specify in a general manner, various properties of heap evolution, such as properties of garbage collection ....

....over individuals of the configuration in which it is evaluated. The individuals that are allocated in the current configuration are related to some future configuration in which they will be deallocated. The tempo ral structure of this property could be classified as a Response structure [14], in which allocations have deallocation responses. Response properties are very commonly used in specifications of finite state systems [7] Properties 2 and 3 establish a ranking function for linked data structures based on transitive reachability. These properties require that the set of ....

Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.

....As a computational model for reactive systems, we take the model of fair discrete system (fds) The computational model is used for modeling both the verified system and the temporal properties. The fds model replaces the earlier model of fair transition system (fts) presented in [MP91b] and [MP95] The main difference between these two models is in the representation of fairness constraints. The advantage of the new representation is that it enables a unified representation of fairness constraints arising from both the system being verified, and the temporal property. An fds D : hV; ....

....a symbolic construction of a tableau by assigning a new auxiliary variable to each temporal sub formula of the property we wish to verify. In that, our approach resembles very much the reduction method used in [CGH97] which, in turn, is an extension of the statification method used in [MP91a] and [MP95] to deal with the past fragment of ltl. The model checking problem is then reduced into the question of feasibility of an fds, which is presented in section 6.2. The symbolic feasibility algorithm, similar to the enumerative algorithm of [LP85] identifies all computations satisfying a given set ....

[Article contains additional citation context not shown here]

Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.

No context found.

Z. Manna and A. Pnueli, "Temporal Verification of Reactive Systems: Safety", SpringerVerlag, 1995.

Documents 51 to 100  Previous 50  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