Using Static Analysis to Reduce Dynamic Analysis Overhead

Authors:
Suan Hsi Yong;Susan Horwitz
Affiliations:
Computer Sciences Department, University of Wisconsin-Madison, Madison, USA 53706;Computer Sciences Department, University of Wisconsin-Madison, Madison, USA 53706
Venue:
Formal Methods in System Design
Year:
2005

Citing 15
Cited 6

Global tagging optimization by type inference

LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Optimizing array bound checks using flow analysis

ACM Letters on Programming Languages and Systems (LOPLAS)
Efficient detection of all pointer and array access errors

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Points-to analysis in almost linear time

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Low-cost, concurrent checking of pointer and array accesses in C programs

Software—Practice & Experience
Pointer analysis for programs with structures and casting

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Coping with type casts in C

ESEC/FSE-7 Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering
Unification-based pointer analysis with directional assignments

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
ABCD: eliminating array bounds checks on demand

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
CCured: type-safe retrofitting of legacy code

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Implementation of an array bound checker

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Elimination of Java array bounds checks in the presence of indirection

JGI '02 Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande
Debugging via Run-Time Type Checking

FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering
Cyclone: A Safe Dialect of C

ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Optimization of range checking

SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction

Automatic detection of previously-unseen application states for deployment environment testing and analysis

Proceedings of the 5th Workshop on Automation of Software Test
Custom-made instrumentation based on static analysis

Proceedings of the Ninth International Workshop on Dynamic Analysis
Continuation equivalence: a correctness criterion for static optimizations of dynamic analyses

Proceedings of the Ninth International Workshop on Dynamic Analysis
Challenges in defining a programming language for provably correct dynamic analyses

ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
SAM: self-adaptive dynamic analysis for multithreaded programs

HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
Software verification and graph similarity for automated evaluation of students' assignments

Information and Software Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dynamic analysis (instrumenting programs with code to detect and prevent errors during program execution) can be an effective approach to debugging, as well as preventing harm from being caused by malicious code. One problem with this approach is the runtime overhead introduced by the instrumentation. We define several techniques that involve using the results of static analysis to identify some cases where instrumentation can safely be removed. While we have designed the techniques with a specific dynamic analysis in mind (that used by the Runtime Type-Checking tool), the ideas may be of more general applicability.