Environment analysis via ΔCFA

Authors:
Matthew Might;Olin Shivers
Affiliations:
Georgia Institute of Technology;Georgia Institute of Technology
Venue:
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
2006

Citing 9
Cited 15

ORBIT: an optimizing compiler for scheme

SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Control-flow analysis of higher-order languages of taming lambda

Control-flow analysis of higher-order languages of taming lambda
Selective and lightweight closure conversion

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Constraint systems for useless variable elimination

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A semantic model of reference counting and its abstraction (detailed summary)

LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Rabbit: A Compiler for Scheme

Rabbit: A Compiler for Scheme
Multi-return function call

Journal of Functional Programming

Continuations and transducer composition

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Improving flow analyses via ΓCFA: abstract garbage collection and counting

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Type-sensitive control-flow analysis

Proceedings of the 2006 workshop on ML
Logic-flow analysis of higher-order programs

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Posteriori Soundness for Non-deterministic Abstract Interpretations

VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Exploiting reachability and cardinality in higher-order flow analysis

Journal of Functional Programming
Control-flow analysis of function calls and returns by abstract interpretation

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Context-sensitive analysis of obfuscated x86 executables

Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Resolving and exploiting the k-CFA paradox: illuminating functional vs. object-oriented program analysis

PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Context-sensitive analysis without calling-context

Higher-Order and Symbolic Computation
Beyond iteration vectors: instancewise relational abstract domains

SAS'06 Proceedings of the 13th international conference on Static Analysis
Shape analysis in the absence of pointers and structure

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Control-flow analysis of function calls and returns by abstract interpretation

Information and Computation
Control-flow analysis of functional programs

ACM Computing Surveys (CSUR)
Introspective pushdown analysis of higher-order programs

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a new program-analysis framework, based on CPS and procedure-string abstractions, that can handle critical analyses which the k-CFA framework cannot. We present the main theorems concerning correctness, show an application analysis, and describe a running implementation.