ExplainHoudini: making Houdini inference transparent

Authors:
Shuvendu K. Lahiri;Julien Vanegue
Affiliations:
Microsoft Research;Microsoft Corporation
Venue:
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Year:
2011

Citing 13
Cited 1

Extended static checking for Java

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
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
Houdini, an Annotation Assistant for ESC/Java

FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Abstractions from proofs

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Generating error traces from verification-condition counterexamples

Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
Unifying type checking and property checking for low-level code

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Intra-module Inference

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Complexity and Algorithms for Monomial and Clausal Predicate Abstraction

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
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
Towards scalable modular checking of user-defined properties

VSTTE'10 Proceedings of the Third international conference on Verified software: theories, tools, experiments
Boogie: a modular reusable verifier for object-oriented programs

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
The spec# programming system: an overview

CASSIS'04 Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices

SMT solvers for software security

WOOT'12 Proceedings of the 6th USENIX conference on Offensive Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Houdini is a simple yet scalable technique for annotation inference for modular contract checking. The input to Houdini is a set of candidate annotations, and the output is a consistent subset of these candidates. Since this technique is most useful as an annotation assistant for user-guided refinement of annotations, understanding the reason for the removal of annotations is crucial for a user to refine the set of annotations, and classify false errors easily. This is especially true for applying Houdini to large legacy modules with thousands of procedures and deep call chains. In this work we present a method ExplainHoudini that explains the reason why a given candidate was removed, purely in terms of the existing candidates. We have implemented this algorithm and provide preliminary experience of applying it on large modules.