Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th POPL, 1977. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Termination Proofs for a Lazy Functional Language by Abstract.. - Panitz (1996) (Correct)
....variables; or, to get more detailed information, for a subclass of all possible input values. A good means for such an analysis is by way of abstract interpretation. A set of values becomes represented by some abstract value. The initial formal framework for abstract interpretation is presented in [CC77]. Abstract interpretation is extensively used in strictness analysis [Myc80, BHA85, Bur87] To analyze the termination behavior of a program it is furthermore necessary to detect potential loops in the program execution. Such potential loops are to be found as recursive calls in a functional ....
Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, pages 252--252. ACM Press, 1977.
Precise Analysis of String Expressions - Christensen, Møller.. (2003) (3 citations) (Correct)
....or set constraints. In both of those approaches, our work in obtaining a flow graph for string operations in Java programs would essentially have to be duplicated; the di#erences lie in the subsequent analysis of this flow graph. Using the standard monotone framework for abstract interpretation [7, 13], the lattice of regular languages would be used to model abstract string values and all string operations would be given an abstract semantics. The standard fixedpoint iteration over the flow graph would, however, fail to provide a solution since the lattice of regular languages has infinite ....
Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '77, pages 238--252, 1977.
Pointer ANalysis and its Applications for Java Programs - Salcianu (2001) (3 citations) (Correct)
....layer beneath it. We split the proof in two parts: one set of invariants that relate the abstract semantics to the concrete semantics and another set of results that relate the pointer analysis to the abstract semantics. Our proof has many things in common with the abstract semantics framework [7]. The main similarity is our view of the analysis, at least in an intermediate form of it, as an abstract execution of the program over a finite lattice. However, our proof is not based on the techniques specific to the abstract semantics framework. Instead, it uses simulation invariants, which is ....
....issue. Among the recently published analyses, only two have been proved correct: the flow insensitive analysis of Blanchet [4] and the flow sensitive analysis of Sagiv, Reps and Wilhelm [20, 19] The correctness proofs of both of them use the abstract interpretation framework of Cousot and Cousot [7]. In this section, we briefly discuss these two analyses and their correctness proofs. The analysis proposed by Blanchet [4] is a pure escape analysis aimed at discovering stack allocation opportunities in Java programs. The analysis is flow insensitive; it computes a result for each method. It ....
[Article contains additional citation context not shown here]
Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th ACM POPL, pages 238--252, 1977.
Automatically Proving the Correctness of Compiler.. - Lerner, Millstein.. (2002) (5 citations) (Correct)
....have a substantial impact on the time to run an optimization. The best solution would be to prove the compiler sound, meaning that for any input program, the compiler always produces an equivalent output program. Optimizations, and sometimes even complete compilers, have been proven sound by hand [1, 2, 15, 13, 8, 23, 3, 11]. However, manually proving large parts of a compiler sound requires a lot of e#ort and theoretical skill on the part of the compiler writer. In addition, these proofs are usually done for optimizations as written on paper, and bugs may still arise when the algorithms are implemented from the ....
....language were augmented with pointers) or optimizations like PRE would instead require writing more complicated guards, and some optimizations we support may not be expressible by Lacey. As mentioned in the introduction, much other work has been done on manually proving optimizations correct [13, 15, 1, 2, 8, 23, 3]. Transformations have also been proven correct mechanically, but not automatically: the transformation is proven sound using an interactive theorem prover, which requires user involvement. For example, Young [34] has proven a code generator correct using the Boyer Moore theorem prover enhanced ....
Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, pages 238--252, Los Angeles CA, January 1977.
On Combining Program Improvers - Veldhuizen, Siek (2003) (Correct)
....the use of x. However, CCP is able to transform this program to return 0 because it performs both analyses simultaneously using what are called optimistic assumptions. The observation that combined analyses can be stronger than separate analyses goes back to early work of Cousot and Cousot [CC77,CC79] who considered combined abstract interpretation domains and showed that automatic combination of domains would not yield optimal results, and introduced the idea of a reduced product. More recent work on combining abstract interpretations can be found in [CMB 93,CCH94] In the ....
....example of the pessimistic approach, in the sense that a term is transformed via a sequence of semantics preserving steps. The second, more common approach is to perform a program analysis followed by a transformation. Analyses are usually lattice based, and are usually abstract interpretations [CC77,JN95] in the functional community, and dataflow analyses (or more generally, monotone analysis frameworks e.g. KU77] in the imperative community. 2.1 Unreachable code elimination To illustrate the di#erence between pessimism and optimism we consider the problem of unreachable code ....
Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. Principles of Programming Languages, pages 238--252, January 1977.
On Generalized Records and Spatial Conjunction in Role Logic - Kuncak, Rinard (2004) (Correct)
No context found.
Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th POPL, 1977.
On the Boolean Algebra of Shape Analysis Constraints - Kuncak, Rinard (2003) (Correct)
No context found.
Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th ACM POPL, pages 238--252, 1977.
On Role Logic - Kuncak, Rinard (2003) (Correct)
No context found.
Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th POPL, 1977.
A Logic for Information Flow Analysis with an Application to .. - Amtoft, Banerjee (2005) (Correct)
No context found.
Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In ACM Symposium on Principles of Programming Languages (POPL), pages 238--252. ACM Press, New York, NY, 1977.
On Role Logic - Kuncak, Rinard (2003) (Correct)
No context found.
Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th POPL, 1977.
On the Boolean Algebra of Shape Analysis Constraints - Kuncak, Rinard (2003) (Correct)
No context found.
Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th ACM POPL, pages 238--252, 1977. 1
Approximate Modeling for Debugging of Program Loops - Mayer, Stumptner (Correct)
No context found.
Patrick Cousot and Radhia Cousot, `Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixpoints', in POPL'77, pp. 238--252, Los Angeles, (1977).
On Generalized Records and Spatial Conjunction in Role Logic - Kuncak, Rinard (2004) (Correct)
No context found.
Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th POPL, 1977.
A Combined Pointer and Purity Analysis for Java Programs - Salcianu, Rinard (2004) (2 citations) (Correct)
No context found.
Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th POPL, 1977.
HOIST: A System for Automatically Deriving Static Analyzers.. - Regehr, Reid (2004) (Correct)
No context found.
Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. of the 4th Symp. on Principles of Programming Languages (POPL), pages 238--252, Los Angeles, CA, January 1977.
Unknown - Dimensions And Tradeoffs (Correct)
No context found.
Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixpoints. In ACM Symposium on Principles of Programming Languages, pages 238--252, Los Angeles, CA, January 1977.
Safe Programming at the C Level of Abstraction - Grossman (2003) (Correct)
No context found.
Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th ACM Symposium on Principles of Programming Languages, pages 238--252, Los Angeles, CA, January 1977.
A Type System for Lock-Free Processes - Kobayashi (2002) (1 citation) (Correct)
No context found.
Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 238--252, 1977.
On Role Logic - Kuncak, Rinard (2003) (Correct)
No context found.
Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th POPL, 1977.
On the Boolean Algebra of Shape Analysis Constraints - Kuncak, Rinard (2004) (Correct)
No context found.
Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th ACM POPL, pages 238--252, 1977.
Extracting a Data Flow Analyser in Constructive Logic - Cachera, Jensen, Pichardie.. (2004) (3 citations) (Correct)
No context found.
Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixpoints. In Proc. of 4th ACM Symposium on Principles of Programming Languages, pages 238--252. ACM Press, New York, 1977.
The Spec# Programming System: An Overview - Barnett, Leino, Schulte (Correct)
No context found.
Patrick Cousot and Rhadia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth Annual ACM Symposium on Principles of Programming Languages, pages 238--252. ACM, January 1977.
On Generalized Records and Spatial Conjunction in Role Logic - Kuncak, Rinard (2004) (Correct)
No context found.
Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th POPL, 1977.
Model Checking - Merz (2000) (Correct)
No context found.
Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th ACM Symposium on Principles of Programming Languages, pages 238--252, Los Angeles, California, 1977. ACM Press.
Active Libraries and Universal Languages - Veldhuizen (2004) (1 citation) (Correct)
No context found.
Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. Principles of Programming Languages, pages 238--252, January 1977.
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