Abstract. Houdini is a simple yet scalable technique for annotation in-ference 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 assis-tant 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. ...
In the long run, programs should be written from the start with verification in mind. Programs writt...
AbstractProbabilistic annotations generalise standard Hoare Logic [20] to quantitative properties of...
Investigating soundness and completeness of verification calculi for imperative programming language...
A static program checker that performs modular checking can check one program module for errors with...
With the years, program complexity has increased dramatically: ensuring program correctness has beco...
This paper presents a general approach to annotation inference for a given static program checker. T...
In systems verification we are often concerned with multiple, inter-dependent properties that a pro-...
Static checking can verify the absence of errors in a program, but often requires written annotation...
International audienceContracts expressed by logic formulas allow one to formally specify expected b...
We investigate information hiding in object-based programs and the associated mismatch. While client...
Abstract. With the years, program complexity has increased dramati-cally: ensuring program correctne...
Large-scale annotation efforts typically involve several experts who may disagree with each other. W...
Probabilistic annotations generalise standard Hoare Logic [20] to quantitative properties of probabi...
Enabling Hoare-style reasoning for low-level code is attractive since it opens the way to regain str...
Design-by-contract is a development best practice that requires the interactions between software co...
In the long run, programs should be written from the start with verification in mind. Programs writt...
AbstractProbabilistic annotations generalise standard Hoare Logic [20] to quantitative properties of...
Investigating soundness and completeness of verification calculi for imperative programming language...
A static program checker that performs modular checking can check one program module for errors with...
With the years, program complexity has increased dramatically: ensuring program correctness has beco...
This paper presents a general approach to annotation inference for a given static program checker. T...
In systems verification we are often concerned with multiple, inter-dependent properties that a pro-...
Static checking can verify the absence of errors in a program, but often requires written annotation...
International audienceContracts expressed by logic formulas allow one to formally specify expected b...
We investigate information hiding in object-based programs and the associated mismatch. While client...
Abstract. With the years, program complexity has increased dramati-cally: ensuring program correctne...
Large-scale annotation efforts typically involve several experts who may disagree with each other. W...
Probabilistic annotations generalise standard Hoare Logic [20] to quantitative properties of probabi...
Enabling Hoare-style reasoning for low-level code is attractive since it opens the way to regain str...
Design-by-contract is a development best practice that requires the interactions between software co...
In the long run, programs should be written from the start with verification in mind. Programs writt...
AbstractProbabilistic annotations generalise standard Hoare Logic [20] to quantitative properties of...
Investigating soundness and completeness of verification calculi for imperative programming language...