B. Steffen. Generating data flow analysis algorithms from modal specifications. Sci. of Comp. Prog., 21(2):115-- 139, 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....they do not offer to the user the same level of abstraction: they take as input the specification of an abstract interpreter rather than the specification of a property. Despite this difference of point of view, all these works are obviously inspired by the same goals. The framework introduced in [15] is closer to the spirit of the work presented in this paper but the technique itself is quite different. Programs are represented as models in a modal logic and a data flow analysis can be specified as a property in the logic. An efficient data flow analyser [TRUE] Gamma p e : True [CONJ] ....

B. Steffen. Generating data flow analysis algorithms from modal specifications. Science of Computer Science, 21(2):115--139, Oct. 1993.

....is offered in order to allow the user to customise the tool to his own needs. In other words, we would like generic analysers allowing the user to specify the properties of interest in a restricted logic language. This is to be compared with the use of temporal logics in model checking [10]. Let us stress that even the problem of producing analysis results that are easy to understand is far from being trivial. Presentations of analysers in terms of type inference (with an algorithm that is supposed to be correct and complete with respect to the inference system) may be a step in ....

B. Steffen, Generating data flow analysis algorithms from modal specifications, Science of Computer Programming, Vol. 21, 1991, pp. 115-139.

....of this example, containing the class declarations Main, A, B , and C , which except for class Main implement a local method m, is complex enough to illustrate the central features and the power of our approach. 1 OO program models are an OO variant of the program models originally introduced in [St]. 2 If necessary, appropriate transitions can always be added. 4 z : nil y : z c : a b y : B new method mainMethod class Main var a, b, c, d, e, x, y, z method m z : C new z : B new instanceOf : B y method m class A method m x : z x : z m nNil Nil 1 2 3 4 9 5 6 7 10 11 12 13 ....

Steffen, B. Generating data flow analysis algorithms from modal specifications. Science of Computer Programming 21 , (1993), 115 - 139.

....of feasibility constraints, and support analysis of a wide class of properties as opposed to just deadlock. The relationship between model checking and flow analysis is very strong; both involve a fix point computation of a relation that encodes a specified property. At an abstract level, Steffen [Ste93] and Schmidt [Sch98] have shown that flow analyses can be formulated as model checking problems and vice versa. Practically speaking, model checking techniques depend on the analyst coming up with an accurate and relatively concise model of the program. Traditionally, flow analyses have relied on ....

Bernhard Steffen. Generating data flow analysis algorithms from modal specifications. International Journal on Science of Computer Programming, 21:115--139, 1993.

....they do not offer to the user the same level of abstraction: they take as input the specification of an abstract interpreter rather than the specification of a property. Despite this difference of point of view, all these works are obviously inspired by the same goals. The framework introduced in [24] is closer to the spirit of the work presented in this paper but the technique itself is quite different. Programs are represented as models in a modal logic and a data flow analysis can be specified as a property in the logic. An efficient data flow analyser can be generated by partially ....

B. Steffen. Generating data flow analysis algorithms from modal specifications. Science of Computer Science, 21(2):115--139, 1993.

....by user specified flow path simplification rules. It is unclear, however, how this feature can be used for higher order programs (where functions are normal values) whose control flow is determined while the analysis proceeds. Sharlit does not have a cost accuracy control mechanism. Steffen [50, 51] has reported a data flow analyzer generator based on model checking. The input specification is modal logic formulae that express program properties. The analysis generator evaluates the underlying model checker to generate codes that will iteratively determine the states of the input program ....

....than the iterative fixpoint method. Constraint based approach can also be a convenient vehicle for separate analysis, as reported in [53] Logical approaches to program analysis (like deduction systems for proving properties of programs [7] or model checking from program property specifications [50, 51]) are also alternatives. It would be ideal if Z1 can support all these techniques, so that the user can choose the most suitable method for his analysis problem and for his target language. For some analysis methods (like the constraintsand logic based) however, it seems difficult to provide as ....

Bernhard Steffen. Generating data flow analysis algorithms from modal specifications. Science of Computer Programming, 21:115--139, 1993.

No context found.

B. Steffen. Generating Data Flow Analysis Algorithms from Modal Specifications. To appear in Science of Computer Programming, 1993.

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

B. Steffen: "Generating Data Flow Analysis Algorithms from Modal Specifications", International Journal on Science of Computer Programming, N. 21, 1993, pp. 115-139.

.... solution refine relax specification User Interaction Specification Transformation into Target Language Selected Solution Execution Classification Taxonomy Database Component Repository Retrieval Figure 1: The DaCapo system 2 both finite and infinite state programs (see [Stef91, Stef93, KnRS92, KnRS94a, KnRS94b, Knoo93]) The paper is organized as follows: Section 2 introduces our UNIX application, Section 3 defines the metalevel specification language SLTL, Section 4 illustrates the full DaCapo lifecycle by means of a typical user session, Section 5 discusses the relations with other approaches, and Section 6 ....

B. Steffen. Generating data flow analysis algorithms from modal specifications. Science of Computer Programming, N. 21, pp. 115-139, 1993. 1993. 16

....kinds of model checkers. Intraprocedural dataflow analysis : algorithms of this kind can be realized efficiently and at almost no implementation cost on our analysis machine via a data flow analysis generator which automatically produces fixpoint machine code from high level specifications [Stef91, Stef93, Stef94]. We will discuss this implementation and its performance in Section 6. Regular MC Macro MC CFR PDA MC Equational Systems Solving FIXPOINT ANALYSIS MACHINE Intraprocedural DFA Higher Order DFA Interprocedural DFA Behavioural Relations hardwiring compilation logical characterization [Stef91] ....

....We will discuss this implementation and its performance in Section 6. Regular MC Macro MC CFR PDA MC Equational Systems Solving FIXPOINT ANALYSIS MACHINE Intraprocedural DFA Higher Order DFA Interprocedural DFA Behavioural Relations hardwiring compilation logical characterization [Stef91] [Stef93] [Stef89] StIn94] Knoo93] Hung94] Ande92] Lars92] BuSt92] BuSt94] Stef93] KnRS94] Fig. 1. Setup of the Analysis Environment Interprocedural data flow analysis : in this setting we are able to cover a wide class of programs that contain recursive procedures with value parameters. The ....

[Article contains additional citation context not shown here]

B. Steffen: "Generating Data Flow Analysis Algorithms from Modal Specifications ", Science of Computer Programming N.21, 1993, pp.115-139.

....the elementary tools. Our environment can manage repositories of some hundreds of tools. Currently, a great deal of such components are taken from other existing systems, some are optimized versions of algorithms taken from the Concurrency Workbench [ClPS93] others come from a compiler project [Stef93] or are imported from the OTTER [McCu90] resolution based and the TIP [Frau93] induction based theorem provers. Of course, the design, implementation and integration of new elementary algorithms still goes on. The small fragment of our repository of reusable components which will be used in the ....

B. Steffen: "Generating Data Flow Analysis Algorithms from Modal Specifications ," Science of Computer Programming N. 21, 1993, pp. 115-139.

....[2, 3] Moreover, in cases where there is not yet consensus about sensible orderings, MetaFrame supports the corresponding investigation through its rapid prototyping facility. One should note here that the number of individual algorithms, many of which can be automatically generated (see[9]) may, like in the CATS case, grow very large. 3 Evaluation and Perspectives Our approach exactly meets the demands recently expressed by Goguen and Luqi in [1] for the emerging paradigm of Domain Specific Formal Methods: the essence of their proposal is to use formal methods on a large or huge ....

B. Steffen: "Generating Data Flow Analysis Algorithms from Modal Specifications," Science of Computer Programming N.21, 1993, pp.115-139.

No context found.

Steffen, B. Generating data flow analysis algorithms from modal specifications. Science of Computer Programming 21 , (1993), 115 - 139.

....completely unchanged. In contrast, the general treatment of value parameters, which intuitively are much simpler, requires some modification of the whole setting. Fortunately, such modifications are not required for large classes of practically relevant applications [KnRS92, KnRS94, Knoo93] In [Stef91, Stef93], the framework is illustrated by means of an example of practical relevance: an improved version of Morel Renvoise s algorithm for eliminating partial redundancies [MoRe79] The algorithm generated there from a one line specification 3 is as efficient as the standard uni directional algorithms, ....

....kinds of model checkers. ffl Intraprocedural dataflow analysis: algorithms of this kind can be realized efficiently and at almost no implementation cost on our analysis machine via a data flow analysis generator, which automatically produces fixpoint machine code from high level specifications [Stef91, Stef93]. ffl Interprocedural data flow analysis: in this setting we are able to cover a wide class of programs that contain recursive procedures with value parameters. The corresponding data flow analysis generator, which uses the same high level specifications as the intraprocedural version, is under ....

[Article contains additional citation context not shown here]

B. Steffen: "Generating Data Flow Analysis Algorithms from Modal Specifications," Science of Computer Programming N.21, 1993, pp.115-139.

....lines described in this article as a subcomponent of the DFA OPT MetaFrame tool kit [3] which supports both global program analysis and program optimization. In the hosting tool kit sketched in [3] DFA algorithms are automatically generated from concise specifications given in a modal logic (cf. [52]) In essence, the DFA generator of the tool kit works by partially evaluating an appropiate model checker with respect to the modal formula specifying the data flow property of interest. The result is a usual iterative DFA algorithm, which runs on the machine the model checker is implemented on. ....

....currently supports program analyses and optimizations based on bit vector problems like code motion, dead code elimination or strength reduction. Besides intraprocedural and interprocedural programs with global variables, the tool kit also applies to parallel (intraprocedural) programs (cf. [2, 52, 53, 55]) First experiences show that the Towards a tool kit for the automatic generation of interprocedural DFAs 25 Figure 6: Second Screen Shot generated DFA algorithms are as efficient as their hand coded counterparts. While an extension to local variables by integrating return functions into the ....

B. Steffen. Generating data flow analysis algorithms from modal specifications. Science of Computer Programming, 21:115 -- 139, 1993.

No context found.

B. Steffen: "Generating Data Flow Analysis Algorithms from Modal Specifications, Science of Computer Programming, N. 21, 1993, pp. 115-139.

....the elementary tools. Our environment can manage repositories of some hundreds of tools. Currently, a great deal of such components are taken from other existing systems, some are optimized versions of algorithms taken from the Concurrency Workbench [ClPS93] others come from a compiler project [Stef93] or are imported from the OTTER [McCu90] resolution based and the TIP [Frau93] induction based theorem provers. Of course, the design, implementation and integration of new elementary algorithms still goes on. The small fragment of our repository of reusable components which will be used in the ....

B. Steffen: "Generating Data Flow Analysis Algorithms from Modal Specifications, " Science of Computer Programming N. 21, 1993, pp. 115-139.

....fi are allowed as long as we only traverse actions from fl . The given abbreviations are in fact formulae of a parameterized version of CTL. As we cannot discuss the relationship between CTL and modal transition systems here, the interested reader is referred to [CES83] for standard CTL and to [Ste93] to learn about an extension of CTL which is powerful enough to capture the considered modal transition systems. 3 The Remote Procedure Call Problem We demonstrate our method by applying it to a specification problem given by Broy and Lamport. Due to space limitations we can only present part of ....

B. Steffen. Generating data flow analysis algorithms from modal specifications. in: Science of Computer Programming 21, (1993), 115 - 139.

No context found.

B. Steffen. Generating data flow analysis algorithms from modal specifications. Sci. of Comp. Prog., 21(2):115-- 139, 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