Static Coverage in Deductive Software Verification

The results of softwarev erification areo nly as within the Dafnyverification-aware programming language [25] trustworthyasthe provided specification.Errors or incompleteness via the Boogie intermediate verification language [27].Our exin the specification can result in unwarranted confidencei nt he perimental results evaluating this implementation demonstrate implementation.Previouswork,particularly in therealm of model modest computational overhead relative to verification, making checking, has investigatedanotion of coverage in verification.Portions of the system that could ber eplaced arbitrarily without it practical to employa si ntegral part of verification.We also causing verification failurea re considered uncovered.We show showh ow this technique can be used to generate actionable that the same notion of coverage used in model checking can be warnings without false positives.applied to deductive softwarev erification, with ar easonable performance penalty when using an implementation based A. Examples on unsatisfiable cores.