S. S. Muchnick and N. D. Jones. Program Flow Analysis: Theory and Application. Prentice Hall, 1981.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of abstraction. The framework is provided as a set of APIs for Java. Through the extensive use of Java interface concept, we established an open framework: For instance, specific implementations of abstract domains can easily be used in our framework. 1 Introduction Data flow analysis (DFA) [17] is the basic technique used for the static analysis of (imperative) programs. Research project in this field are typically concerned with the development of specific analyses or the improvement of the basic technique. In this paper, we describe the current state of a framework for DFA based ....

....bit vector functions. In addition, the package contains classes for constructing implementations of structures, like dual partially ordered sets, flat complete lattices, and composed functions. de.rwth.dfa: The core of this package is an implementation of the classical iterative algorithm [17, 1, 16] for DFA. Since it uses de.rwth.graph for the graph representation, it is not important where the graphs come from: They can be flow graph, basic block graphs (see [10] for comments on the adequateness of this choice) or something completely different. Since we use the interfaces from ....

[Article contains additional citation context not shown here]

S. S. Muchnick and N. D. Jones. Program Flow Analysis: Theory and Applications. Prentice--Hall, 1981.

.... complete Yes No No EXP TIME complete No Yes No EXP SPACE complete Yes Yes No DEXP TIME complete Yes Undecidable It should be said that all of these results are subject to the standard hypothesis of static analysis, namely, that all paths in the program flow graph are possible [B78, MJ81]. In the absence of this, the problem is trivially undecidable. In addition, our results can only characterize algorithms that give an exact answer relative to some simplifying assumptions. Heuristics that give some conservative approximation are much more difficult to deal with rigorously. Even ....

Muchnick S. S., and N. D. Jones eds., Program Flow Analysis: Theory and Applications, Prentice Hall 1981.

....Version 4.0 of the Sun SPARCompiler language systems to be released at the end of 1995. 4. 1 Data Flow Analysis: Workset al..gorithms Data flow analysis (DFA) is concerned with the static analysis of programs in order to support the generation of efficient object code by optimizing compilers (cf. [Hec77, MJ81]) For imperative languages, it provides information about the program states that may occur at a given program point during execution. Usually, this information is computed by means of some iterative workset al..gorithm, which can elegantly be modelled by the vector iteration approach. In DFA and ....

S. S. Muchnick and N. D. Jones, editors. Program Flow Analysis: Theory and Applications. Prentice Hall, Englewood Cliffs, NJ, 1981.

....multiple inheritance and generic functions as in OCaml, or type based method resolution as in Java. Remarkably, all other approximation functions, including those for evaluation AEow and a stack approximation, are derived from the lookup and approximation functions. 1 Introduction Static analysis [9, 11] is a collection of compile time techniques to predict program properties and a prerequisite for many program transformations compiler optimisations (e.g. dead code elimination, partial evaluation or parallelisation) and program verications (e.g. array bound checking, pointer analysis or ....

S. S. Muchnick and N. D. Jones, editors. Program Flow Analysis: Theory and Applications. Prenctice Hall, 1981.

....of the ASSIGN object from the taxonomy of programming constructs. Control flow links are also generated at the moment of each creation of a new object. A first control abstraction of sequences of statements is also fulfilled during this phase. As a result of this abstraction, basic blocks [1,15] are generated as clones of the object that describe the sequence control abstraction. Between objects describing statements and the surrounding basic block a link is maintained. Preprocessed code Generated object Basic block (EXPR VAR0 1) INITIALIZ 82 BSEQ 850 (EXPR VAR1 0) INITIALIZ 830 ....

....CONTINUE 844 4 JOIN 845 (OUTPUT VAR0) OUTPUT 846 (EXPR VAR0 VAR0 1) INC 847 (IFNOT ( VAR0 GT 10) 1. 1) IFNOT 848 (STOP) STOP 849 BSEQ 855 17 The network of objects is further enhanced with data flow information computed with an algorithm similar to those used in some compilers [1,15]. The description of the program is now a network of objects (for statements in the preprocessed code and for basic blocks) with links reflecting the control and data flow. This description is the starting point for several types of abstractions. 4.3 Abstractions All of the abstractions in this ....

A. Muchnick, N.D. Jones, "Program Flow Analysis: Theory and Applications", Prentice-Hall, 1981.

....the correctness proof for the algorithm. We also illustrate an algorithm for computing k limited CFA. 1 Introduction Many optimisations are based on some representation of the control ow in a program. This is explicitly recognised in the standard presentations of classical data ow analyses [10, 3, 11, 21]. For higher order languages, or languages with concurrency primitives, it is not easy to determine the control ow: control ow analysis (CFA) aims to determine which closures appear at which points in the execution of the program. Examples of the use of CFA include: e ect analysis [14] that ....

Muchnick S. S. and Jones N. D. (eds). Program Flow Analysis: Theory and Applications. Prentice-Hall, 1981.

.... grammars, Constraints, Program analysis, Slicing 1 Introduction Dead computations produce values that never get used [1] While programmers are not likely to write code that performs dead computations, such code appears often as the result of program optimization, modi cation, and reuse [45,1]. There are also other programming activities that do not explicitly involve live or dead code but rely on similar notions. Examples are program slicing [64,50] specialization [50] incrementalization [39,38] and This work was supported in part by NSF under grant CCR 9711253 and ONR under ....

S. S. Muchnick and N. D. Jones, editors. Program Flow Analysis: Theory and Applications. Prentice-Hall, Englewood Clis, N.J., 1981.

....flow analysis used in compilers to perform code optimization. Research in program flow analysis has been in progress, probably, ever since the first compiler was written. As a result it is beyond the scope of this document to perform an exhaustive survey of the field. The reader is referred to [2, 18, 28] for a detailed survey. The work in interprocedural data flow analysis [3, 6, 7, 11, 25, 27, 38] is of interest from the point of view of this paper. Interprocedural analyses answer questions such as if the value of a variable is changed at statement in procedure will it affect the ....

S. Muchnick and N. Jones. Program Flow Analysis: Theory and Applications. Prentice-Hall,Inc., 1981.

....be sufficient to extract a software s architecture. To argue in favor of the ARTs, it is worth observing that maintenance programmers find the cross reference data as one of the most important source of information [Par86] The alternative is to use information from control and data flow analyses [Hec77, MJ81] . But such information would be insufficient since the notion of information hiding is defined on the basis of scope and operations on symbols [Par76] not the information they generate and propagate. Besides, 75 80 of the code currently under maintenance is in languages such as COBOL, FORTRAN, ....

Steven Muchnick and Neil Jones. Program Flow Analysis: Theory and Applications. Prentice-Hall,Inc., 1981.

....flow graph to obtain a reducible one. Many workers in the 1970s and 80s besides those just mentioned identified SETL, directly or indirectly, as a language 8 Introduction 1. 2 A Brief History of SETL whose implementation was greatly in need of solutions to difficult compiler optimization problems [80, 84, 85, 143, 82, 86, 123, 83, 148, 149, 174, 208, 3, 209]. SETL, while still far from the celestial sphere of pure mathematics, was nonetheless seen as occupying a very high orbit relative to other languages. It was SETL s distance from pure machines that made optimizing its implementations so important and at the same time so difficult. The synergy ....

Steven S. Muchnick and Neil D. Jones. Program Flow Analysis: Theory and Applications. Prentice-Hall, Englewood Cliffs, NJ, 1981.

....being analyzed. Therefore, such an executable representation of the environment has to be developed with care. Systematic state space exploration is complementary to other approaches to concurrent reactive program testing and analysis. For instance, static analysis techniques (e.g. CC77, MJ81, ASU86] automatically extract information about the dynamic behavior of a sequential program by examining its text. Variants of these techniques have also been proposed for the analysis of programs written in concurrent programming languages such as Ada (e.g. Tay83, LC91, MR93, Cor96] For ....

S.S. Muchnick and N.D. Jones. Program Flow Analysis: Theory and Applications. PrenticeHall, 1981.

.... Much has happened in this field since the path breaking 1977 Cousot paper [5] and 1980 conference [11] The field of abstract interpretation [1, 5, 6, 13, 23, 25] arose as a mainly European, theory based counterpart to the welldeveloped more pragmatic North American approach to program analysis [2, 10, 21]. The goal of semantics based program manipulation ( 12] and the PEPM conference series) is to place program analysis and transformation on a solid foundation in the semantics of programming languages, making it possible to prove that analyses are sound and that transformations do not change ....

S.S. Muchnick and N.D. Jones (eds.) Program Flow Analysis: Theory and Applications. Englewood Cli#s, NJ: Prentice Hall, 1981.

.... Much has happened in this eld since the path breaking 1977 Cousot paper [5] and 1980 conference [9] The eld of abstract interpretation [1, 5, 6, 11, 17, 19] arose as a mainly European, theory based counterpart to the welldeveloped more pragmatic North American approach to pro gram analysis [2, 8, 16]. The goal of semantics based program manipulation ( 10] and the PEPM conference series) is to place program analysis and transformation on a solid foundation in the semantics of programming languages, making it possible to prove that analyses are sound and that transformations do not change ....

S.S. Muchnick and N.D. Jones (eds.) Program Flow Analysis: Theory and Applications. Englewood Clis, NJ: Prentice Hall, 1981.

No context found.

S. S. Muchnick and N. D. Jones. Program Flow Analysis: Theory and Application. Prentice Hall, 1981.

No context found.

S. Muchnick and N.D. Jones, editors. Program Flow Analysis: Theory and Applications. Prentice-Hall, 1981.

No context found.

S. S. Muchnick and N. D. Jones, editors. Program Flow Analysis: Theory and Applications. Prentice-Hall, Inc., 1981.

No context found.

N. D. Jones and S. S. Muchnik. Program Flow Analysis: Theory and Applications, chapter Chapter 4: Flow Analysis and Optimization of LISP-like Structures. Prentice Hall, 1981.

No context found.

Steven S. Muchnick & Neil D. Jones, eds., Program Flow Analysis: Theory and Applications, Prentice Hall, Englewood Cliffs, NJ, 1981.

No context found.

S. S. Muchnick and N. D. Jones, editors. Program Flow Analysis: Theory and Applications. Prenctice Hall, 1981.

No context found.

Neil D. Jones and Steven S. Muchnick. Program Flow Analysis: Theory and Applications, chapter Complexity of Flow Analysis, Inductive Assertion Synthesis, and a Language due to Dijkstra, pages 380--393. Prentice-Hall, 1981.

No context found.

S. S. Muchnick and N. D. Jones, Program Flow Analysis: Theory and Applications, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1981.

No context found.

S. S. Muchnick and N. D. Jones, editors. Program Flow Analysis: Theory and Applications. Prentice Hall, Engelwood Cliffs, New Jersey, 1981.

No context found.

S. S Muchnick and N. D. Jones. Program flow analysis: theory and applications. Prentice-Hall, Englewood Cliffs, NJ, 1981. (pp 3, 12)

No context found.

S. S. Muchnick and N. D. Jones, editors. Program Flow Analysis: Theory and Applications. Prentice Hall, Engelwood Cliffs, New Jersey, 1981.

No context found.

S. S. Muchnick and N. D. Jones. Program Flow Analysis : Theory and Applications. Prentice-Hall Inc., 1981.

First 50 documents  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