B. Steffen, A. Claen, M. Klein, J. Knoop, and T. Margaria. The fixpoint-analysis machine. In Proceedings of CONCUR'95, volume 962 of LNCS, pages 72--87. Springer, 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....Data Flow Analysis Pushdown systems provide a very natural formal model for programs with recursive procedures. Hence, it should not be surprising that efficient analysis techniques for pushdown automata can be applied to some problems of interprocedural data flow analysis (see, e.g. [7, 11]) Here we briefly discuss the convenience of regular valuations in this application area. We do not present any detailed results about the complexity of concrete problems, because this would necessarily lead to a quite complicated and lengthy development which is beyond the scope of our work ....

B. Steffen, A. Claen, M. Klein, J. Knoop, and T. Margaria. The fixpoint-analysis machine. In Proceedings of CONCUR'95, volume 962 of LNCS, pages 72--87. Springer, 1995.

....Control Control Service Logic Libraries Selection Figure 1: The Service Creation Process ffl Formal verification allows designers to check for global consistency of each design step with implementation related or service dependent frame conditions. Being based on model checking techniques [3], it is fully automatic and does not require any particular technical knowledge of the user. This simplifies the service design since sources for typical failures are detected immediately. ffl Abstract or thematic views concentrate on the required global context and hide unnecessary details. ....

....to include in the design environment for future automatic reuse. In the presented environment, such properties are gathered in a Constraint Library, which can be easily updated and which is automatically accessed by the model checker during the verification [5] Here the model checker of [3] is used, which verifies whether a given model satisfies properties expressed in a modal logic called the modal mu calculus [1] In the SCE IN setting: ffl the properties express correctness or consistency constraints the target IN service is required to respect. They are expressed in a user ....

B. Steffen, A. Claßen, M. Klein, J. Knoop. T. Margaria: "The Fixpoint Analysis Machine ", (invited paper) to CONCUR'95, Pittsburgh (USA), August 1995, LNCS 962, Springer Verlag.

No context found.

B. Steffen, A. Claen, M. Klein, J. Knoop, and T. Margaria. The fixpoint-analysis machine. In Proc. 6th Int. Conf. on Concurrency Theory (CONCUR'95), LNCS 962, pages 72 -- 87. Springer-V., 1995. Invited contribution.

....constraint library is supported by ahypertext system. Figure 4: The Corresponding Error View Global correctness and consistency of the service under developmentisprovided in our environment through automatic verification via model checking in a push button fashion. We use the model checker of [SCKK95], which is optimized for dealing with large numbers of constraints, in order to allowverification in real time. If the model checker detects an inconsistency, a plain text explanation of the violated constraint appears in a window as shown in Figure 3, and an error view is automatically generated, ....

B. Steffen, A. Claen, M. Klein, J. Knoop. T. Margaria: "The Fixpoint Analysis Machine", (invited paper) to CONCUR'95, Pittsburgh (USA), August 1995, LNCS 962, Springer Verlag.

....due the impact of formal verification and abstract views on service creation [13, 14] In fact, ffl Formal verification allows designers to check for global consistency of each design step with implementation related or service dependent frame conditions. Being based on model checking techniques [10], it is fully automatic and does not require any particular technical knowledge of the user. This simplifies the service design since sources for typical failures are detected immediately. ffl Abstract or thematic views concentrate on the required global context and hide unnecessary details. They ....

....are expressed in a user friendly specification language (see [14] and gathered in a constraint library which is automatically accessed by the model checker during the verification. The maintenance of the constraint library is supported by the hypertext system. We use the model checker of [10], which is optimized for dealing with large numbers of constraints, in order to allow verification in real time. The algorithm verifies whether a given model satisfies properties expressed in a modal logic called the modal mu calculus [7] In the SD IN setting: ffl the properties express ....

[Article contains additional citation context not shown here]

B. Steffen, A. Claen, M. Klein, J. Knoop. T. Margaria: "The Fixpoint Analysis Machine", (invited paper) to CONCUR'95, Pittsburgh (USA), August 1995, LNCS 962, Springer Verlag.

....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 ....

....correctness by construction, and requires subsequent verification only for complex non linear PM component compositions. PM MetaFrame also supports the verification (model checking) for arbitrary sequential process models with respect to the full calculus 2 which is realized along the lines of [26, 31]. 1.1 Technical Contributions Our approach for the synthesis of linear process models from constraints is novel in its intent and its solution. Intuitively, our synthesis procedure can be regarded as a mechanism to explore the future development of processes prior to any enaction, in a depth ....

B. Steffen, A. Claen, M. Klein, J. Knoop. T. Margaria: "The Fixpoint Analysis Machine", (invited paper) to CONCUR'95, Pittsburgh (USA), LNCS 962, Springer, 1995.

....be tailored individually to each tool s needs. A variety of tool integrations was already applied successfully in practice, spanning the whole spectrum between deep and shallow integration, and manual to synthesis supported coordination. ffl Tools like the Fixpoint Analysis Machine model checker [22] or the automatic Synthesis Tool (used for coordination support itself) being implemented in C, C or even PASCAL or Fortran, can be incorporated directly into the MetaFrame executable via dynamic linking. The advantage of such tight integration is that the control and data passing mechanism ....

B. Steffen, A. Claen, M. Klein, J. Knoop. T. Margaria: "The Fixpoint Analysis Machine", (invited paper) to CONCUR'95, Pittsburgh (USA), August 1995, LNCS 962, Springer Verlag.

....automatatheoretic approach to model checking beyond the class of finite state processes finds a natural application in the area of interprocedural dataflow analysis. Keywords: Interprocedural data flow analysis, model checking, automata theory, program optimisation. 1 Introduction Recent work [15, 24] has shown that model checking algorithms for abstract classes of infinite state systems, like context free processes [1, 5] and pushdown processes [6] find a natural application in the area of data flow analysis (DFA) for programming languages with procedures [16] usually called interprocedural ....

....large variety of DFA problems, whose solution is required by optimising compilers in order to apply performance improving transformations, can be solved by means of a unique model checking technique. The techniques of [5, 6] are based on what could be called the fixpoint approach to model checking [24], in which the set of states satisfying a temporal property is defined and computed as a fixpoint in an adequate lattice. Some years ago, Vardi and Wolper presented in a seminal paper [25] an alternative automata theoretic approach in which loosely speaking verification problems are reduced to ....

B. Steffen, A. Claßen, M. Klein, J. Knoop, and T. Margaria. The fixpoint-analysis machine. In Proc. 6th Int. Conf. on Concurrency Theory (CONCUR'95), LNCS 962, pages 72 -- 87. Springer-V., 1995. Invited contribution.

....to make this inherent knowledge precise and available to an automatic checking procedure, which forces untrained designers to obey the essential rules of the game . The library of such constraints is expected to grow soon to a size of up to 500 or even 1000 constraints. Using the model checker of [SCKK95], consistency of a service with the constraints can be checked fully automatically in real time. Of course, the efficiency of the checking procedure also reveals that the specification language is less expressive than most of the specification languages usually used in software engineering: they ....

....are expressed in a user friendly specification language (see Sec. 6) and gathered in a constraint library, which is automatically accessed by the model checker during the verification. The maintenance of the constraint library is supported by the hypertext system. We use the model checker of [SCKK95], which is optimized for dealing with large numbers of constraints, in order to allow verification in real time. If the model checker detects Figure 7: The Corresponding Error View an inconsistency, a plain text explanation of the violated constraint appears in a window as shown in Figure 6, and ....

B. Steffen, A. Claßen, M. Klein, J. Knoop. T. Margaria: "The FixpointAnalysis Machine", Proc. 6th Int. Conference on Concurrency (CONCUR'95), Philadelphia (PA), August 21-24, 1995, LNCS N. 962, pp.72-87.

....precise and available to an automatic checking procedure, which forces untrained designers to obey the essential rules of the game . The library, which currently contains about 100 constraints, is expected to grow soon to a size of up to 500 or even 1000 constraints. Using the model checker of [SCKK95], consistency of a service with the constraints can be checked fully automatically in real time. Of course, the efficiency of the checking procedure also reveals that the specification language is much less expressive than most of the specification languages usually used in software engineering: ....

....are expressed in a user friendly specification language (see Sec. 6) and gathered in a constraint library which is automatically accessed by the model checker during the verification. The maintenance of the constraint library is supported by the hypertext system. We use the model checker of [SCKK95], which is optimized for dealing with large numbers of constraints, in order to allow verification in real time. If the model checker detects an inconsistency, a plain text explanation of the violated constraint appears in a window as shown in Figure 5, and an error view is automatically ....

B. Steffen, A. Claßen, M. Klein, J. Knoop. T. Margaria: "The Fixpoint-Analysis Machine ", Proc. 6th Int. Conference on Concurrency (CONCUR'95), Philadelphia (PA), August 21-24, 1995, LNCS N. 962, pp.72-87.

....2 ; es 1 ) where ts 2 is the transition system corresponding to the expression ccs expr 2 , and es 1 is the characteristic formula for ccs expr 1 . This yields the most efficient preorder checker currently known [CeCl93, ClSt91] 6 . A fast suitable model checker is e.g. the one introduced in [SCKK95]. The synthesis problem ( additionally requires that each of the argument processes is minimized before the model checker is applied 7 . This induces two independent linear synthesis subproblems, which we solve automatically along the lines of the previous section. 1. The optimized solution for ....

B. Steffen, A. Claßen, M. Klein, J. Knoop. T. Margaria: "The Fixpoint Analysis Machine," (invited paper) to CONCUR'95, Pittsburgh (USA), August 1995, LNCS 962, Springer Verlag.

....unique in offering automatic check of global correctness and consistency conditions of the service prototype, concerning the interplay between the SIBs of a service. This can be verified at any time in a push button fashion [24] by means of the model checker for the modal mu calculus described in [21]. In case of hierarchical structures, verification is always done relative to the fully unfolded or decapsulated 5 graph (see [1] This design decision is consistent with the principle that macros are an (auxiliary) means to structure complex services, but do not have any semantic impact. 3 ....

B. Steffen, A. Claßen, M. Klein, J. Knoop. T. Margaria: "The Fixpoint Analysis Machine", (invited paper) to CONCUR'95, Pittsburgh (USA), August 1995, LNCS 962, Springer Verlag.

....restriction to bitvector analysis constrains the possible ways of interference in such a way, that we could construct a fixed point algorithm that directly works on the parallel program without taking any interleavings into account. The algorithm is implemented on the Fixpoint Analysis Machine of [SBCKKMR]. ....

Steffen, B., Burkart, O., Claßen, A., Klein, M., Knoop, J., Margaria, T., and Ruthing, O. The fixpoint analysis machine. Submitted for publication.

....the two right most windows showing the program procedures: all program points where a b is interprocedurally available are coulored red . In the grey scaled reproduction here, these nodes are highlighted by a grey ring. Currently, the tool kit generates code for our fixed point analysis machine [54]. However, it can easily be modified to produce other target code. Moreover, as in the hosting DFA OPT MetaFrame tool kit results of different DFAs can be combined for the purpose of program optimization. Necessary high level language commands can directly be executed by an interpreter, which is ....

B. Steffen, A. Claßen, M. Klein, J. Knoop, and T. Margaria. The fixpoint-analysis machine. In Proceedings of the 6 th International Conference on Concurrency Theory (CONCUR'95), Lecture Notes in Computer Science 962, pages 72 -- 87, Philadelphia, Pennsylvania, 1995. Springer-Verlag.

....worthwhile to include in the design environment for future automatic reuse. In the presented environment, such properties are gathered in a Constraint Library, which can be easily updated and which is automatically accessed by the model checker during the verification. Here the model checker of [SCKK95] is used, which verifies whether a given model satisfies properties expressed in a modal logic called the modal mu calculus [Koze83] In the IN setting: ffl the properties express correctness or consistency constraints the target IN service is required to respect. They are expressed in a user ....

B. Steffen, A. Claßen, M. Klein, J. Knoop. T. Margaria: "The Fixpoint Analysis Machine", to be presented at the 6th Int. Conference on Concurrency (CONCUR'95), Philadelphia (PA), August 21-24, 1995.

....userfirendly version of the specification language of the previous section and gathered in a constraint library that is automatically accessed by the model checker during the verification. The maintenance of the constraint library is supported by the hypertext system. We use the model checker of [SCKK95], which is optimized for dealing with large numbers of constraints, in order to allow verification in real time. If the model checker detects an inconsistency, a plain text explanation of the violated constraint appears in a window as shown in Figure 3, and an error view is automatically ....

B. Steffen, A. Claßen, M. Klein, J. Knoop. T. Margaria: "The Fixpoint Analysis Machine", (invited paper) to CONCUR'95, Pittsburgh (USA), August 1995, LNCS 962, Springer Verlag.

....2 ; es 1 ) where ts 2 is the transition system corresponding to the expression ccs expr 2 , and es 1 is the characteristic formula for ccs expr 1 . This yields the most efficient preorder checker currently known [CeCl93, ClSt91] 6 . A fast suitable model checker is e.g. the one introduced in [SCKK95]. The synthesis problem ( additionally requires that each of the argument processes is minimized before the model checker is applied 7 . This induces two independent linear synthesis subproblems, which we solve automatically along the lines of the previous section. 6 A similar algorithm was ....

B. Steffen, A. Claßen, M. Klein, J. Knoop. T. Margaria: "The Fixpoint Analysis Machine", to be presented at the 6th Int. Conference on Concurrency (CONCUR'95), Philadelphia (PA), August 21-24, 1995.

No context found.

B. Steffen, A. Claen, M. Klein, J. Knoop, and T. Margaria. The fixpoint-analysis machine. In Proceedings of CONCUR'95, volume 962 of LNCS, pages 72--87. Springer, 1995.

No context found.

B. Steffen, A. Classen, M. Klein, J. Knoop, and T. Margaria. The fixpointanalysis machine. In I. Lee and S. A. Smolka, editors, Proceedings of the Sixth International Conference on Concurrency Theory (CONCUR '95), Vol. 962 of Lecture Notes in Computer Science, pages 72--87. Springer-Verlag, 1995.

No context found.

B. Steffen, A. Classen, M. Klein, J. Knoop, and T. Margaria. The fixpointanalysis machine. In I. Lee and S. A. Smolka, editors, Proceedings of the Sixth International Conference on Concurrency Theory (CONCUR '95), Vol. 962 of Lecture Notes in Computer Science, pages 72--87. Springer-Verlag, 1995.

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