Software verification has emerged as a key concern for ensuring the continued progress of
information technology. Full verification generally requires, as a crucial step, equip** each …

Designing and implementing distributed systems correctly is a very challenging task.
Recently, formal verification has been successfully used to prove the correctness of …

Considerable progress has been made towards automatic support for one of the principal
techniques available to enhance program reliability: equip** programs with extensive …

Loops are challenging structures for program analysis, especially when loops contain
multiple paths with complex interleaving executions among these paths. In this paper, we …

Current static verification techniques do not provide good support for incrementality, making
it difficult for developers to focus on specifying and verifying the properties and components …

Lazy abstraction with interpolation-based refinement has been shown to be a powerful
technique for verifying imperative programs. In presence of arrays, however, the method …

Structural coverage metrics, and in particular branch coverage, are popular approaches to
measure the thoroughness of test suites. Unfortunately, the presence of elements that are …

Verifiers that can prove programs correct against their full functional specification require, for
programs with loops, additional annotations in the form of loop invariants-properties that …

Design by Contract represents an established, lightweight paradigm for engineering reliable
and robust software systems by specifying verifiable expectations and obligations between …

Invariants are the predominant approach to verify the correctness of loops. As an alternative,
loop contracts, which make explicit the premise and conclusion of the underlying induction …