S. Graf and C. Loiseaux. Program verification using compositional abstraction. In TAPSOFT 93, joint conference CAAP/FASE. LNCS 668, Springer Verlag, April 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....explode during verification, and it is not yet fully clear when this happens. All these techniques can be accompanied by abstraction: depending on the particular property under investigation, systems may be dramatically reduced by suppressing details that are irrelevant for verification, see e.g. [CC77, CGL92, GL93]. Summarizing, all these methods cover very specific cases, and there is no hope for a uniform approach. Thus more application specific approaches are required, extending the practicality of formal methods. for concurrent software systems which exploits compositionality and abstraction for the ....

S. Graf, C. Loiseaux. Program Verification using Compositional Abstraction. in: Proceedings FASE/TAPSOFT'93.

....explode during verification, and it is not yet fully clear when this happens. All these techniques can be accompanied by abstraction: depending on the particular property under investigation, systems may be dramatically reduced by suppressing details that are irrelevant for verification, see e.g. [CC77, CGL92, GL93]. Summarizing, all these methods cover very specific cases, and there is no hope for a uniform approach. Thus more application specific approaches are required, extending the practicality of formal methods. In this paper, we present a constraint oriented state based proof methodology for ....

S. Graf, C. Loiseaux. Program Verification using Compositional Abstraction. in: Proceedings FASE/TAPSOFT'93.

.... work for an interesting class of practically relevant systems [Brya86, BCMD90, EnFT91] All these techniques can be accompanied by abstraction: depending on the particular property under investigation, systems may be dramatically reduced by suppressing details that are irrelevant for verification [CoCo77, ClGL92, ClRi93, DaGG93, GrLo93]. This list of references and approaches is by far not exhaustive and still increasing. Thus we are faced with an almost unmanageable variety of approaches and algorithms asking for meta tools managing this diversity. The DaCapo environment applied to the organization of UNIX commands in [SFCM94] ....

S. Graf, C. Loiseaux: "Program Verification using Compositional Abstraction," Proceedings FASE/TAPSOFT'93.

.... are unfortunately rarely applicable, partial order methods ( GW91, Val93, GP93] which try to avoid the state explosion problem by suppressing unnecessary interleavings of actions, Binary Decision Diagram based codings of the state graph (e.g. Br86, BCMDH90, EFT91] and abstraction( CC77, CGL92, GL93] depending on the particular property under investigation, systems may be dramatically reduced by suppressing details that are irrelevant for verification. All This author has been partially supported by the European Communities under CONCUR2, BRA 7166. y Basic Research in Computer ....

....abstraction. Whereas complex data dependencies may exclude any possibility of horizontal decomposition, our approach elegantly includes real time systems, even over dense time. Using real time does not affect the reduction steps. To model real time systems, we use Timed Modal Specifications [CGL93] for which (weak) refinement is decidable and the Epsilon tool can be used to verify refinements. To model the general case of Fischer s protocol, we use parametrized timed modal specifications. Parameters may appear either in actions (parametrized actions) or in timing constraints. While ....

[Article contains additional citation context not shown here]

S. Graf, C. Loiseaux. Program Verification using Compositional Abstraction. in: Proceedings FASE/TAPSOFT'93.

....explode during verification, and it is not yet fully clear when this happens. All these techniques can be accompanied by abstraction: depending on the particular property under investigation, systems may be dramatically reduced by suppressing details that are irrelevant for verification, see e.g. [CC77, CGL92, GL93]. Summarizing, all these methods cover very specific cases, and there is no hope for a uniform approach. Thus more application specific approaches are required, extending the practicality of formal methods. We present a constraint oriented state based proof methodology for concurrent software ....

S. Graf, C. Loiseaux. Program Verification using Compositional Abstraction. in: Proceedings FASE/TAPSOFT'93.

....by the construction. Hence, by the previously established preservation results, if S satisfies an invariant satisfies its concretisation, ff ) We do not want to fix a parallel operator here, as the method builds abstractions of the individual transition relations, and in [GL93a] has been shown that abstraction is preserved by most useful notions of parallel composition. An important point is that the produced abstract system S is given in a symbolic manner, which still allows to apply all the known methods for avoiding the state explosion problem, while analyzing ....

S. Graf and C. Loiseaux. Program verification using compositional abstraction. In TAPSOFT 93, joint conference CAAP/FASE. LNCS 668, Springer Verlag, April 1993.

....system which is an abstraction of it. We show also under which conditions abstraction of concurrent systems can be computed from the abstraction of their components. This allows a compositional application of the proposed verification method. This is a revised version of the papers [2] and [16]; the results are fully developed in [28] Keywords: abstract interpretation, simulation, property preservation, model checking. 1. Introduction The growing complexity of distributed and reactive systems requires rigorous development methodologies and automatic verification techniques. A ....

S. Graf and C. Loiseaux. Program verification using compositional abstraction. In TAPSOFT 93, joint conference CAAP/FASE. LNCS 668, Springer Verlag, April 1993.

....problem: the state space of a distributed system potentially increases exponentially in the number of its parallel components. To overcome this problem techniques have been developed in order to avoid the construction of the complete state graph (cf. BFH90, CLM89, CR94, CS90b, DGG93, Fer88, GL93, GP93, Jos87, KM89, Kru89, LSW94, LT88, LX90, Pnu90, SG89, SG90, Val93, Wal88, Win90, WL89] In this paper we present a method for the compositional minimization of finite state distributed systems, which is practically motivated by the following observation: For the verification of a system ....

S. Graf and C. Loiseaux. Program verification using compositional abstraction. In Proceedings FASE/TAPSOFT'93, 1993.

....problem: the state space of a distributed system potentially increases exponentially in the number of its parallel components. To overcome this problem techniques have been developed in order to avoid the construction of the complete state graph (cf. BFH90, CLM89, CR94, CS90b, DGG93, Fer88, GL93, Jos87, KM89, Kru89, LSW94, LT88, LX90, Pel93, Pnu90, SG89, SG90, Vaa90, Val93, Wal88, Win90, WL89] In this paper we present Correspondence and offprint requests to: Gerald Luttgen. 2 S. Graf, B. Steffen, and G. Luttgen a method for the compositional minimisation of finite state distributed ....

S. Graf and C. Loiseaux. Program verification using compositional abstraction. In Proceedings FASE/TAPSOFT'93, 1993.

No context found.

Graf, S. and Loiseaux, C.: Program verification using compositional abstraction. In Proceedings FASE/TAPSOFT'93, 1993.

....simpler system which is an abstraction of it. We show also under which conditions abstraction of concurrent systems can be computed from the abstraction of their components. This allows a compositional application of the proposed verification method. This is a revised version of the papers [2] and [16]; the results are fully developed in [28] Keywords: abstract interpretation, simulation, property preservation, model checking. 1. Introduction The growing complexity of distributed and reactive systems requires rigorous development methodologies and automatic verification techniques. A ....

S. Graf and C. Loiseaux. Program verification using compositional abstraction. In TAPSOFT 93, joint conference CAAP/FASE. LNCS 668, Springer Verlag, April 1993.

....i.e. we have to know which properties holding on the abstract program hold also on the concrete one. The investigation of property preserving abstractions of reactive systems has been the object of intensive research during the last years. Results have been given e.g. in [Kur89, CGL92, BBLS92, GL93] One way to define abstractions is via a behavioral equivalence, such as observational equivalence [Mil80] in this case, an abstract program can be calculated by constructing an equivalent program which is minimal with respect to the used equivalence by using for example the algorithm of ....

....partially supported by ESPRIT Basic Research Actions SPEC and REACT y Verimag is a joint laboratory of CNRS, Institut National Polytechnique de Grenoble, Universite J. Fourier and Verilog SA associated with IMAG Here, we present a tool implementing the ideas presented recently in [BBLS92, GL93] and before in [Sif83] and in some sense also in [CC77] Instead of calculating the largest partition on the domain of the concrete program, such that the obtained abstraction is equivalent, we give an arbitrary partition by defining a relation ae between the concrete and some new abstract ....

[Article contains additional citation context not shown here]

S. Graf and C. Loiseaux. Program verification using compositional abstraction. In TAPSOFT 93, joint conference CAAP/FASE. LNCS 668, Springer Verlag, April 1993.

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