(Enter summary)
Abstract: We present trace-based program analysis, a semantics-based framework for statically analyzing and
transforming programs with loops, assignments, and nested record structures. Trace-based analyses
are based on transfer transition systems, which define the small-step operational semantics of
programming languages. Intuitively, transfer transition systems provide direct support for reasoning
about the possible execution traces of a program, instead of just individual program states.
The traces in... (Update)
Context of citations to this paper: More
.... to the specialization time we have to approximate the program point sets after; for trace based abstract interpretations see [Col95, CL96] The simplest synchronization removal algorithm is a naive greedy algorithm that removes one redundant synchronization at a time and...
...relations as a common back end for many different analyses. The language TR and composition algorithm Phi are a generalization of [1]. The only other work of which we are aware that uses a similar technical idea is the work in [7] on graph transductions [2] A graph...
Cited by: More
Watchpoint Semantics: A Tool for Compositional and Focussed Static .. - Spoto (2001)
(Correct)
Symbolic Transfer Function-based Approaches to Certified Compilation - Rival (2004)
(Correct)
Parametric Regular Path Queries - Tom
(Correct)
Active bibliography (related documents): More All
1.4: Trace-Based Program Analysis - Colby, Lee (1996)
(Correct)
0.4: Analysis of Synchronization and Aliasing with Abstract.. - Colby
(Correct)
0.3: Determining Storage Properties of Sequential and Concurrent.. - Colby (1995)
(Correct)
Similar documents based on text:
96.0: Unknown -
(Correct)
Related documents from co-citation: More All
2: Abstract interpretation: a unified lattice model for static analysis of programs.. (context) - Cousot, Cousot - 1977
2: Systematic design of program analysis frameworks (context) - Cousot, Cousot - 1979
2: Communicating Sequential Processes (context) - Hoare - 1985
BibTeX entry: (Update)
C. Colby and P. Lee. Trace-based program analysis. In The 23th Annual ACM Symposium on Principles of Programming Languages, pages 195--207, 1996. http://citeseer.ist.psu.edu/colby96tracebased.html More
@inproceedings{ colby96tracebased,
author = "Christopher Colby and Peter Lee",
title = "Trace-Based Program Analysis",
booktitle = "Symposium on Principles of Programming Languages",
pages = "195-207",
year = "1996",
url = "citeseer.ist.psu.edu/colby96tracebased.html" }
Citations (may not include all citations):
1399
Compilers: Principles (context) - Aho, Sethi et al. - 1986
906
A structural approach to operational semantics
- Plotkin - 1981
815
Abstract interpretation: A unified lattice model for static .. (context) - Cousot, Cousot - 1977
353
Software pipelining: An effective scheduling technique for V.. (context) - Lam - 1988
346
Denotational Semantics : The Scott-Strachey Approach to Prog.. (context) - Stoy - 1977
252
Analysis of pointers and structures (context) - Chase, Wegman et al. - 1990
207
Flow analysis and optimization of LISP-like structures (context) - Jones, Muchnick - 1979
176
Control-flow Analysis of Higher-Order Languages (context) - Shivers - 1991
94
Projections for strictness analysis
- Wadler, Hughes - 1987
75
semantics and abstract interpretation (context) - Cousot, Cousot - 1992
71
Abstract Interpretation and Optimising Transformations for A.. (context) - Mycroft - 1981
55
A unified treatment of flow analysis in higherorder language..
- Jagannathan, Weeks - 1995
51
Perfect pipelining: A new loop parallelization technique
- Aiken, Nicolau - 1988
51
grammar and set-constraint-based program analysis by abstrac.. (context) - Cousot, Cousot - 1995
35
Affine relationships among variables of a program (context) - Karr - 1976
33
The interprocedural analysis and automatic parallelisation o.. (context) - Harrison - 1989
32
ACM Transactions on Programming Languages and Systems (context) - Hudak, Young et al. - 1991
28
Polyvariant binding-time analysis for applicative languages
- Consel - 1991
27
and application to comportment analysis generalizing strictn.. (context) - Cousot, Cousot et al. - 1994
25
Binding time analysis for polymorphically typed higher order.. (context) - Mogensen - 1989
25
Static analysis on linear congruence equalities among variab.. (context) - Granger - 1991
23
and the lambda-calculus (context) - Felleisen, Friedman et al. - 1986
23
Analyzing the communication topology of concurrent programs
- Colby - 1995
15
Operational Models of Programming Languages and Representati.. (context) - Deutsch - 1992
7
Strictness analysis and denotational abstract interpretation (context) - Nielson - 1988
5
Analysis of synchronization and aliasing with abstract inter..
- Colby
4
Determining storage properties of sequential and concurrent ..
- Colby - 1995
3
Semantic design of program analysis frameworks (context) - Cousot, Cousot - 1979
Documents on the same site (http://www.cs.cmu.edu/afs/cs.cmu.edu/project/fox/member/petel/www/papers/mess.html): More
Lightweight Run-Time Code Generation - Leone, Lee (1994)
(Correct)
Optimizing ML with Run-Time Code Generation - Leone, Lee (1995)
(Correct)
A Modular Implementation of Partial Evaluation - Christopher Colby Peter (1992)
(Correct)
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