interpretation. Theo. Comp. Sci. 277, 1–2, 47–103. Cousot, P. and Cousot, R. 1977. Abstract interpretation: a unified lattice model for staticanalysis of programs by construction or approximation of fixpoints. In ACM Symp. on Prin. of Prog. Lang. 238–252. Cousot, P. and Cousot, R. 1992. Inductive definitions, semantics and abstract interpretation. In ACM Symp. on Prin. of Prog. Lang. 83–94....

Deductive Software Verification is characterized by three ingredients: first, target programs as well as the properties to be verified are represented as logical formulae that must be proven to be valid; second, validity is proven by deduction in a logic calculus; third, computer assistance is used for proof search and bookkeeping. In contrast to static analysis and model checking it is possibl...

Many software systems exhibit probabilistic behaviour, either added explicitly, to improve performance or to break symmetry, or implicitly, through interaction with unreliable networks or faulty hardware. When employed in safety-critical applications, it is important to rigorously analyse the behaviour of these systems. This can be done with a formal verification technique called model checking...

Validation and verification techniques have been identified as suitable mechanisms to determine if the software meets the needs of the user and to verify if the software works correctly. However, the existing verification techniques do not support friendly visualization. Also, validation techniques with friendly visualization mechanisms do not allow the verification of the system’s correctness....

We report on our experiences with formal specification and verification of variable and customizable software realized in a software product family architecture using the Java Modeling Language (JML) and the KeY verification system. Software product families can be adapted to different deployment scenarios and provide instantiable feature sets as requested by the customer. Along a small case st...

It is important to note that in most cases, software correctness verification, as described by Richard Linger is informed by correctness questions where mathematical verification follows (if necessary). A popular approach in software correctness verification is the translation of a specific program as well as its criteria of correctness into a mathematical logical formula and in this regard all...

Existing tests employed by the county including version number examination and parallel testing may be circumvented by malicious software. Any virus-infected PC still makes the same start-up chime and any compromised voting machine can still print “9.1.4.1.” Similarly, a skilled virus can detect a predefined pattern of voting, be signaled by inside actors, or use a variety of other methods to d...

With the steady increase in computational power of general purpose computers, our ability to analyze routine software artifacts is also steadily increasing. As a result, we are witnessing a shift in emphasis from the verification of abstract hand-built models of code, towards the direct verification of implementation level code. This change in emphasis poses a new set of challenges in software ...

ion of C programs. In PLDI 01: Programming Language Design and Implementation, pages 203–213. ACM, 2001. 2. S. Das, D. L. Dill, and S. Park. Experience with predicate abstraction. In CAV 99: Computer-Aided Verification, LNCS 1633, pages 160–171. Springer-Verlag, 1999. 3. D. Detlefs, G. Nelson, and J. Saxe. Simplify theorem prover. 4. T.A. Henzinger, R. Jhala, R. Majumdar, G.C. Necula, G. Sutre,...

We define the substitutability problem in the context of evolving software systems as the verification of the following two criteria: (i) previously established system correctness properties must remain valid for the new version of a system, and (ii) the updated portion of the system must continue to provide all (and possibly more) services offered by its earlier counterpart. We present a compl...