Incremental False Path Elimination for Static Software Analysis

Authors:
Ansgar Fehnker;Ralf Huuck;Sean Seefried
Affiliations:
National ICT Australia Ltd.(NICTA), Locked Bag 6016, University of New South Wales, Sydney, Australia 1466;National ICT Australia Ltd.(NICTA), Locked Bag 6016, University of New South Wales, Sydney, Australia 1466;National ICT Australia Ltd.(NICTA), Locked Bag 6016, University of New South Wales, Sydney, Australia 1466
Venue:
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Year:
2009

Citing 10
Cited 1

Model Checking Software at Compile Time

TASE '07 Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering
Precise fixpoint computation through strategy iteration

ESOP'07 Proceedings of the 16th European conference on Programming
Software verification with BLAST

SPIN'03 Proceedings of the 10th international conference on Model checking software
Using counterexamples for improving the precision of reachability computation with polyhedra

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Orion: high-precision methods for static error analysis of c and c++ programs

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Counterexamples with loops for predicate abstraction

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
SATABS: SAT-Based predicate abstraction for ANSI-C

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Refining abstractions of hybrid systems using counterexample fragments

HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
A practical and complete approach to predicate refinement

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Counterexample driven refinement for abstract interpretation

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

SMT-based optimization for synchronous programs

Proceedings of the 14th International Workshop on Software and Compilers for Embedded Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we introduce a novel approach for removing false positives in static program analysis. We present an incremental algorithm that investigates paths to failure locations with respect to feasibility. The feasibility test it done by interval constraint solving over a semantic abstraction of program paths. Sets of infeasible paths can be ruled out by enriching the analysis incrementally with observers. Much like counterexample guided abstraction refinement for software verification our approach enables to start static program analysis with a coarse syntactic abstraction and use richer semantic information to rule out false positives when necessary and possible. Moreover, we present our implementation in the Goanna static analyzer and compare it to other tools for C/C++ program analysis.