Infeasible code detection

Authors:
Cristiano Bertolini;Martin Schäf;Pascal Schweitzer
Affiliations:
United Nations University, IIST, Macau, China;United Nations University, IIST, Macau, China;Australian National University, Australia
Venue:
VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
Year:
2012

Citing 18
Cited 2

Efficiently computing static single assignment form and the control dependence graph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Unconstrained edges and their application to branch analysis and testing of programs

Journal of Systems and Software
Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs

IEEE Transactions on Software Engineering
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A Discipline of Programming

A Discipline of Programming
Finding bugs is easy

OOPSLA '04 Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
A Comparison of Bug Finding Tools for Java

ISSRE '04 Proceedings of the 15th International Symposium on Software Reliability Engineering
Weakest-precondition of unstructured programs

PASTE '05 Proceedings of the 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Reachability analysis for annotated code

Proceedings of the 2007 conference on Specification and verification of component-based systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering
A Comparative Study of Industrial Static Analysis Tools

Electronic Notes in Theoretical Computer Science (ENTCS)
Strongest postcondition of unstructured programs

Proceedings of the 11th International Workshop on Formal Techniques for Java-like Programs
It's Doomed; We Can Prove It

FM '09 Proceedings of the 2nd World Congress on Formal Methods
Efficient weakest preconditions

Information Processing Letters
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences
The Why/Krakatoa/Caduceus platform for deductive program verification

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Z3: an efficient SMT solver

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Doomed program points

Formal Methods in System Design
A polymorphic intermediate verification language: design and logical encoding

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

Joogie: infeasible code detection for java

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Explaining inconsistent code

Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

A piece of code in a computer program is infeasible if it cannot be part of any normally-terminating execution of the program. We develop an algorithm for the automatic detection of all infeasible code in a program. We first translate the task of determining all infeasible code into the problem of finding all statements that can be covered by a feasible path. We prove that in order to identify all coverable statements, it is sufficient to find all coverable statements within a certain minimal subset. For this, our algorithm repeatedly queries an oracle, asking for the infeasibility of specific sets of control-flow paths. We present a sound implementation of the proposed algorithm on top of the Boogie program verifier utilizing a theorem prover to provide the oracle required by the algorithm. We show experimentally a drastic decrease in the number of theorem prover queries compared to existing approaches, resulting in an overall speedup of the entire computation.