Program partitioning: a framework for combining static and dynamic analysis

Authors:
Pankaj Jalote;Vipindeep Vangala;Taranbir Singh;Prateek Jain
Affiliations:
Indian Institute of Technology Kanpur, Kanpur, India;Indian Institute of Technology Kanpur, Kanpur, India;Indian Institute of Technology Kanpur, Kanpur, India;Indian Institute of Technology Kanpur, Kanpur, India
Venue:
Proceedings of the 2006 international workshop on Dynamic systems analysis
Year:
2006

Citing 9
Cited 2

Partition Testing Does Not Inspire Confidence (Program Testing)

IEEE Transactions on Software Engineering
Static detection of dynamic memory errors

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Bandera: extracting finite-state models from Java source code

Proceedings of the 22nd international conference on Software engineering
A static analyzer for finding dynamic programming errors

Software—Practice & Experience
Using redundancies to find errors

ACM SIGSOFT Software Engineering Notes
Using Runtime Analysis to Guide Model Checking of Java Programs

Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
ICSE Workshop on Dynamic Analysis (WODA 2003)

Proceedings of the 25th International Conference on Software Engineering
Finding bugs is easy

OOPSLA '04 Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Efficient static analysis with path pruning using coverage data

WODA '05 Proceedings of the third international workshop on Dynamic analysis

Comparative study of partitioning methods for program testing

SEA '07 Proceedings of the 11th IASTED International Conference on Software Engineering and Applications
A systematic mapping study on the combination of static and dynamic quality assurance techniques

Information and Software Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

For higher quality software, static analysis and dynamic analysis should be used in a complementary manner. In this work, we explore the concept of partitioning a program such that the partitions can be analyzed separately. With such partitioning, potentially different analysis techniques can be applied to different program partitions, with each analysis having to deal with reduced code which can increase its effectiveness. Our experiments show that partitioning can indeed increase the effectiveness of static analysis. Our initial experience in using testing data for partitioning and applying static analysis only on the complementary partition, indicates that it results in detection of more errors which might have gone unnoticed otherwise.