B. Steffen, T. Margaria, A. Claen: "Heterogeneous Analysis and Verification for Distributed Systems", In "SOFTWARE: Concepts and Tools", vol. 17, N.1, pp. 13-25, Springer Verlag, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of pkI 2 onto p (Fig. 4, right) Following Definition 3.3, Pi I2 (p) can now be derived by inserting some additional undefinednesses indicating a transition of p which is preempted by the interface. The result of the computation, which we have obtained running the MetaFrame environment [SMC96], can be investigated using the Graph Inspector of our tool: the field node syntax in Fig. 4 shows that the highlighted state (p12kb2) has an rb2 undefinedess. A further investigation would reveal the tk1 undefinedness of (p11kb3) and the rb2 undefinedness of (p13kb1) 3.2. Theoretical View In ....

....until a fixed point is reached. In terms of DFA, the Language Labelling Procedure computes the minimal fixed point solution with respect to the start information L(I) The Language Labelling Procedure 3. 20 has been implemented by means of a workset al..gorithm, as part of the MetaFrame environment [SMC96]. Its time and space complexity can be estimated by the product of the number of transitions of p and the number of states of I . As the algorithm does not exploit the structure of the representation of interface specifications; this proves Theorem 3.5. 4. Minimisation Method In this section we ....

[Article contains additional citation context not shown here]

Steffen, B., Margaria, T. and Claßen, A.: Heterogeneous analysis and verification for distributed systems. Software---Concepts and Tools, 17:13--25, 1996.

....[7] In the SD IN setting: ffl the properties express correctness or consistency constraints the target IN service is required to respect. They are expressed in a user friendly, natural language like macro language, which is based on the temporal logic SLTL (Semantic Linear Time Logic, cf. [18]) This is a linear time variant of Kozen s mu calculus [7] which comes together with efficient verification tools# ffl the models are directly the service logic graphs, where SIB names correspond to atomic propositions, and branching conditions correspond to action names in the SLTL formulas. ....

B. Steffen, T. Margaria, A. Claen: "Heterogeneous Analysis and Verification for Distributed Systems", In "SOFTWARE: Concepts and Tools", vol. 17, N.1, pp. 13-25, Springer Verlag, 1996.

....since the synthesis core is independent of the direct physical availability of the tools and can work on a library including virtual components. MetaFrame [15] has been successfully used since 1995 both in house, e.g. for the construction of heterogenous analysis and verification algorithms [13], but also in several joint projects with industrial partners (Siemens Nixdorf Munich [16,14] Siemens AG, Telemedia Bertelsmann, and the Springer Verlag [12] 3 Synthesizing Plans in CAP MetaFrame The novelty of our approach consists of introducing a declarative specification layer, which is ....

....highlighting the reason of failure of other plans. We will illustrate the features of our tool in Section 5 along the lines of the motivating example for Cadweld [4] This allows a direct comparison with the most similar approach. A more detailed discussion of related work can be found in [1,13]. Our synthesis component works by model construction roughly along the lines of [9] In general global constraints lead to an exponential worst case complexity, which is not surprising for a global search problem. However, as confirmed by our experience in a joint project with Siemens Nixdorf, ....

B. Ste#en, T. Margaria, A. Claen: "Heterogeneous Analysis and Verification for Distributed Systems", Software: Concepts and Tools 17(1), pp.13-25, March 1996, Springer Verl.

....of domain specific complex components from collections of reusable components. MetaFrame turned out to be flexible enough to capture areas like flow graph based dataflow analysis [16] library based organization of software reuse [24] as well as simulation and verification of distributed systems [35]. All these applications make use of the automatic synthesis facility illustrated in the current paper on a much simpler example. In particular, the application specific model structures dealt with in the different domains mentioned above share the characteristic of being constructed as linear ....

.... the set of all solutions to specifications given in terms of local and temporal constraints formulated within the temporal logic SLTL (Semantic Linear time Temporal Logic) This logic combines type, activity, and ordering constraints to a specification language with a coherent semantics (see [35] for details) Figure 2: Hypertext browser the type taxonomy Process models are finite sequences of components. Components are interpreted as activities that take an input and produce the corresponding output. Thus they can abstractly be described as triples (input type; activity; ....

B. Steffen, T. Margaria, A. Claen: "Heterogeneous Analysis and Verification for Distributed Systems", Software - Concept and Tools, vol. 17, 1996, pp. 13-25.

....by a variety of support components to provide input format translations, visualization, and interfaces to other logics and other analysis, verification, and synthesis tools. The availability and construction of composite, even heterogeneous tools is supported by the MetaFrame R fl1 concept [25,26], a system level programming environment, and it is actively promoted in projects like the MetaFrame based Electronic Tool Integration platform which will be available in the coming Springer Journal on Software Tools for Technology Transfer. From these and other project experiences it has clearly ....

....designed to support the systematic and structured computer aided generation, analysis, verification, and testing of application specific complex systems from collections (repositories) of reusable components. In particular, it offers a large grain synthesis approach through its synthesis component [26]. To this end we have extended MetaFrame s repository of available tools by checking in the Mosel dpfs decision procedure and each of the new logic translation and output processing modules. Example: Synthesis of a generic M2L(Str) checker in MetaFrame We show on a simple but concrete example ....

B. Steffen, T. Margaria, A. Claen: "Heterogeneous Analysis and Verification for Distributed Systems", In "SOFTWARE: Concepts and Tools", vol. 17, N.1, pp. 1325, Springer Verlag, 1996.

....a method for the compositional minimisation of finite state distributed systems which is intended to avoid the state explosion problem. This method can be used to support the verification of any property that is consistent with d and is implemented as part of the MetaFrame environment [SMC96] and the Aldebaran verification tool [Fer88] The effect of this method depends on interface specifications, which we assume to be given by the program designer. However, the correctness of our method does not depend on the correctness of these interface specifications. This is very important, ....

B. Steffen, T. Margaria, and A. Claen. Heterogeneous analysis and verification for distributed systems. Software---Concepts and Tools, 17:13--25, 1996.

....and modules as elementary building blocks on the basis of a specifically instantiated repository. Originally, the need arose from the problem of the construction of application specific heterogeneous analysis and verifications tools on the basis of a repository of elementary tools and algorithms [MaCS95, StMC95b]. In the meantime it turned out that META Frame has a much wider application profile, as will be illustrated by means of a completely different application: the construction of intelligent network (IN) services. This application, which is described in detail in Section 3, led to a very successful ....

....complex user interaction based on detailed knowledge of the involved algorithms. In contrast, our specification language allows fully automatic checking and even synthesis procedures ( StMF93] shifting the user interaction to the object level, i.e. the level where the user s intuition lies [StMC95b]. In our experience this feature drastically increases the acceptance by practitioners. 7 Standard Features of the SLE Service Definition environments for the design of IN services are usually based on classical Clipboard Architecture environments, where services are graphically constructed, ....

[Article contains additional citation context not shown here]

B. Steffen, T. Margaria, A. Claßen: "Heterogeneous Analysis and Verification for Distributed Systems", Techn. Rep. MIP 95-09, Fakultat fur Mathematik und Informatik, Universitat Passau (Germany), July 1995.

....and modules as elementary building blocks on the basis of a specifically instantiated repository. Originally, the need arose from the problem of the construction of application specific heterogeneous analysis and verifications tools on the basis of a repository of elementary tools and algorithms [MaCS95, StMC96]. In the meantime it turned out that MetaFrame has a much wider application profile, as will be illustrated by means of a completely different application: the construction of intelligent 1 Other systems fitting this description are: CAPS [Luqi93] ControlH and MetaH [Vest94] AMPHION [SWLP94] ....

....that takes a property and a model as inputs, and checks whether the model satisfies the constraint. Here ffl properties express correctness or consistency constraints the target IN service is required to respect. They are compiled into the temporal logic SLTL (Semantic Linear Time Logic, cf. [StMC96, StMF93]) which is a sublogic of the mu calculus, and ffl models are the service logic graphs, where SIB names correspond to atomic propositions and branching conditions correspond to action names in the SLTL formulas. 7 I) Thou shalt choose an appropriate notation 8 II) Thou shalt formalize but not ....

[Article contains additional citation context not shown here]

B. Steffen, T. Margaria, A. Claßen: "Heterogeneous Analysis and Verification for Distributed Systems", "SOFTWARE: Concepts and Tools" N. 17, pp. 13-25, March 1996, Springer Verlag.

....in several areas of application, which we briefly sketched in the following. CATS. This application concerns the Computer Aided Tool Synthesis via automatic composition of heterogeneous verification algorithms for hardware and software systems from basic transformation and analysis components [4, 10]. It supports the automatic generation of complex tools from a repository of components including equivalence checkers, model checkers, theorem provers, and a variety of decision procedures for application specific problems. The number of basic components and infrastructure modules is steadily ....

B. Steffen, T. Margaria, A. Claßen: "Heterogeneous Analysis and Verification for Distributed Systems," "SOFTWARE: Concepts and Tools" N. 17, pp. 13-25, March

....of pkI 2 onto p (Figure 4, right) Following Definition 3.3, Pi I2 (p) can now be derived by inserting some additional undefinednesses indicating a transition of p which is preempted by the interface. The result of the computation, which we have obtained running the MetaFrame environment [SMC96] can be investigated using the Graph Inspector of our tool: the field node syntax in Figure 4 shows that the highlighted state (p12kb2) has an rb2 undefinedess. A further investigation would reveal the tk1 undefinedness of (p11kb3) and the rb2 undefinedness of (p13kb1) 3.2. Theoretical View ....

....DFA, the Language Labelling Procedure computes the minimal fixed point solution with respect to the start information L(I) 20 S. Graf, B. Steffen, and G. Luttgen The Language Labelling Procedure 3. 20 has been implemented by means of a workset al..gorithm, as part of the MetaFrame environment [SMC96] Its time and space complexity can be estimated by the product of the number of transitions of p and the number of states of I . As the algorithm does not exploit the structure of the representation of interface specifications; this proves Theorem 3.5. 4. Minimisation Method In this section we ....

[Article contains additional citation context not shown here]

B. Steffen, T. Margaria, and A. Claßen. Heterogeneous analysis and verification for distributed systems. Software---Concepts and Tools, 17:13--25, 1996.

.... node representation, turned out to be flexible enough to capture application areas like flow graphbased dataflow analysis [11] hierarchical specifications in SDL [17] library based organization of software reuse [22] process modelling [27] and simulation and verification of distributed systems [28]. Particularly interesting is an industrial 1 Label may be as simple as action names used in an automata representation or as complex as execution codes for large tools and procedures. 2 MetaFrame is a meta level environment for the construction, analysis and verification of systems [26] ....

....level in a virtual window as shown in Fig. 6, or disjointly, by opening an autonomous window. In both cases the labels are automatically displayed appropriately. 3.2 Automatic Synthesis of Design Plans in CAD MetaFrame Fig. 7. Synthesis Result and Corresponding Constraints The CAD MetaFrame [28] application is an environment supporting the flexible integration of CAD tools for VLSI and advanced workflow organization through the application specific construction of design plans, which avoids the insurgence of unsuccessful design plans at design time. CAD MetaFrame can be regarded as a ....

B. Steffen, T. Margaria, A. Claßen: "Heterogeneous Analysis and Verification for Distributed Systems", "SOFTWARE: Concepts and Tools", N. 17, pp. 13-25, March 1996, Springer Verlag.

....and construction of adequately designed tools for specific problem structures. The current experience has shown the practicability and the flexibility of the MetaFrame approach in several other areas of application: ffl CATS: automatic generation of complex tools from a repository of components [MaCS95, StMC95b], ffl CompGen: determination of the correct ordering of the individual analyses and optimizing transformations in a data flow analysis program optimization setting [KnRS95] ffl CUTIP: automatic configuration of complex UNIX R fl4 piping sequences for text and image processing [SFCM94, SFCM95] ....

B. Steffen, T. Margaria, A. Claßen: "Heterogeneous Analysis and Verification for Distributed Systems", Techn. Rep. MIP 95-09, Fakultat fur Mathematik und Informatik, Universitat Passau (Germany), July 1995.

....of flexibility since the synthesis core is independent of the direct physical availability of the tools and can work on a library including virtual components. MetaFrame [StMC95, SMCB96b] was already successfully used for the construction of heterogenous analysis and verification algorithms [StMC96], and in a joint project with Siemens Nixdorf Munich [SMCB95, SMCB96] for the design and implementation of IN MetaFrame, an environment for the creation of advanced telephone services (Intelligent Network Services) The corresponding product was presented by Siemens Nixdorf at the Telecom 95 in ....

....highlighting the reason of failure of other plans. We will illustrate the features of our tool in Section 5 along the lines of the motivating example for Cadweld [DaDi91] This allows a direct comparison with the most similar approach. A more detailed discussion of related work can be found in [BrDi95, StMC96]. Our synthesis component works by model construction roughly along the lines of [MaWo84] In general global constraints lead to an exponential worst case complexity, which is not surprising for a global search problem. However, typical specifications consist of a number of well defined subgoals ....

B. Steffen, T. Margaria, A. Claßen: "Heterogeneous Analysis and Verification for Distributed Systems", "SOFTWARE: Concepts and Tools" N. 17, pp. 1325, March 1996, Springer Verlag.

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