物件導向軟體之架構(Object-Oriented Software Construction)探討

ing WS1S Systems to Verify Parameterized Networks . . . . . . . . . . . . 188 Kai Baukus, Saddek Bensalem, Yassine Lakhnech and Karsten Stahl FMona: A Tool for Expressing Validation Techniques over Infinite State Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 204 J.-P. Bodeveix and M. Filali Transitive Closures of Regular Relations for Verifying Infinite-State Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 220 Bengt Jonsson and Marcus Nilsson Diagnostic and Test Generation Using Static Analysis to Improve Automatic Test Generation . . . . . . . . . . . . . 235 Marius Bozga, Jean-Claude Fernandez and Lucian Ghirvu Efficient Diagnostic Generation for Boolean Equation Systems . . . . . . . . . . . . 251 Radu Mateescu Efficient Model-Checking Compositional State Space Generation with Partial Order Reductions for Asynchronous Communicating Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 266 Jean-Pierre Krimm and Laurent Mounier Checking for CFFD-Preorder with Tester Processes . . . . . . . . . . . . . . . . . . . . . . . 283 Juhana Helovuo and Antti Valmari Fair Bisimulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299 Thomas A. Henzinger and Sriram K. Rajamani Integrating Low Level Symmetries into Reachability Analysis . . . . . . . . . . . . . 315 Karsten Schmidt Model-Checking Tools Model Checking Support for the ASM High-Level Language . . . . . . . . . . . . . . 331 Giuseppe Del Castillo and Kirsten Winter Table of

Tools and Algorithms for the Construction and Analysis of Systems. Proc. TACAS 2009

Traditionally, the full verification of a program's functional correctness has been obtained with pen and paper or with interactive proof assistants, whereas only reduced verification tasks, such as extended static checking, have enjoyed the automation offered by satisfiability-modulo-theories (SMT) solvers. More recently, powerful SMT solvers and well-designed program verifiers are starting to break that tradition, thus reducing the effort involved in doing full verification.

This paper gives a tour of the language and verifier Dafny, which has been used to verify the functional correctness of a number of challenging pointer-based programs. The paper describes the features incorporated in Dafny, illustrating their use by small examples and giving a taste of how they are coded for an SMT solver. As a larger case study, the paper shows the full functional specification of the Schorr-Waite algorithm in Dafny.

/pdf/dafny-an-automatic-program-verifier-for-functional-2trag0l49s.pdf

Dafny: an automatic program verifier for functional correctness

Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT are used as back-end engines in model-checking applications such as bounded, interpolation-based, and predicate-abstraction-based model checking. After a brief illustration of these uses, we survey the predominant techniques for solving SMT problems with an emphasis on the lazy approach, in which a propositional satisfiability (SAT) solver is combined with one or more theory solvers. We discuss the architecture of a lazy SMT solver, give examples of theory solvers, show how to combine such solvers modularly, and mention several extensions of the lazy approach. We also briefly describe the eager approach in which the SMT problem is reduced to a SAT problem. Finally, we discuss how the basic framework for determining satisfiability can be extended with additional functionality such as producing models, proofs, unsatisfiable cores, and interpolants.

Satisfiability Modulo Theories

OBJECTIVE To establish an indirect immunofluorescent test so as to improve the sensitivity and specificity of examination of antibodies to beta(2)-glycoprotein METHODS Full-length beta(2)GP cDNA was obtained from human hepatocellular cancer cell line HepG2 by RT-PCR and cloned into the mammalian expression vector pEGFP-C1 The recombinant plasmid pEGFP-beta(2)GP was transfected into HEp-2 cells RT-PCR, immunoblotting (IBT), confocal fluorescence microscopy, and indirect immunofluorescent test (IIF) were used to confirm the expression, localization, and antigenicity of fusion protein of green fluorescent protein (GFP) Serum specimens from 19 patients suspected as with secondary antiphospholipid syndrome (APS), 1 patient diagnosed as with primary APS, and 10 normal persons were detected with IIF-IgG-beta(2)GP1, ELISA-IgG-ACL, and ELISA-IgG-beta(2)GP I simultaneously RESULTS (1) The HEp-beta(2)GP I cells thus obtained retained their ability of expression of beta(2)GP-I-GFP for more than ten generations This beta(2)GP-I-GFP showed the antigenicity of beta(2)GP-I with a characteristic feature (2) Seven of the 20 serum specimens from APS patients showed characteristic immunofluorescent pattern No serum specimen from normal persons showed immunofluorescent staining The comparison of results of the three methods showed that the concordance between IIF-IgG-beta(2)GP I and ELISA-IgG-beta(2)GP I was the most perfect (Kappa = 0886) (3) HEp-beta(2)GP I retained the immunofluorescent property of HEp-2 cell CONCLUSION As a new kind of substrate of IIF, beta(2)GP I transfectant can be used to detect anti-beta(2)GP-I antibodies Transfeted HEp-2 cells keep the immunofluorescent property of HEp-2 cells in IFANA test and can be used as substrate for routine IFANA detection

[Expression of fusion proteins in beta(2)GP I gene-transfected HEp-2 cells and its clinical application].

First-order logic modulo the theory of integer arithmetic is the basis for reasoning in many areas, including deductive software verification and software model checking. While satisfiability checking for ground formulae in this logic is well understood, it is still an open question how the general case of quantified formulae can be handled in an efficient and systematic way. As a possible answer, we introduce a sequent calculus that combines ideas from free-variable constraint tableaux with the Omega quantifier elimination procedure. The calculus is complete for theorems of first-order logic (without functions, but with arbitrary uninterpreted predicates), can decide Presburger arithmetic, and is complete for a substantial fragment of the combination of both.

/pdf/a-constraint-sequent-calculus-for-first-order-logic-with-17dftna5b7.pdf

A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic

Regression verification is an approach complementing regression testing with formal verification. The goal is to formally prove that two versions of a program behave either equally or differently in a precisely specified way. In this paper, we present a novel automatic approach for regression verification that reduces the equivalence of two related imperative integer programs to Horn constraints over uninterpreted predicates. Subsequently, state-of-the-art SMT solvers are used to solve the constraints. We have implemented the approach, and our experiments show non-trivial integer programs that can now be proved equivalent without further user input.

/pdf/automating-regression-verification-4o7im35ewv.pdf

Automating regression verification

One of the main challenges in software verification is efficient and precise compositional analysis of programs with procedures and loops. Interpolation methods remains one of the most promising techniques for such verification, and are closely related to solving Horn clause constraints. We introduce a new notion of interpolation, disjunctive interpolation, which solves a more general class of problems in one step compared to previous notions of interpolants, such as tree interpolants or inductive sequences of interpolants. We present algorithms and complexity for construction of disjunctive interpolants, as well as their use within an abstraction-refinement loop. We have implemented Horn clause verification algorithms that use disjunctive interpolants and evaluate them on benchmarks expressed as Horn clauses over the theory of integer linear arithmetic.

/pdf/disjunctive-interpolants-for-horn-clause-verification-4pos2ur36p.pdf

Disjunctive Interpolants for Horn-Clause Verification

Intermediate languages are a paradigm to separate concerns in software verification systems when bridging the gap between programming languages and the logics understood by theorem provers. While such intermediate languages traditionally only offer rather simple type systems, this paper argues that it is both advantageous and feasible to integrate richer type systems with features like (higher-ranked) polymorphism and quantification over types. As a concrete solution, the paper presents the type system of Boogie 2, an intermediate verification language that is used in several program verifiers. The paper gives two encodings of types and formulae in simply typed logic such that SMT solvers and other theorem provers can be used to discharge verification conditions.

/pdf/a-polymorphic-intermediate-verification-language-design-and-29d6nt45zp.pdf

A polymorphic intermediate verification language: design and logical encoding

We present combined-case k-induction, a novel technique for verifying software programs. This technique draws on the strengths of the classical inductive-invariant method and a recent application of k-induction to program verification. In previous work, correctness of programs was established by separately proving a base case and inductive step. We present a new k-induction rule that takes an unstructured, reducible control flow graph (CFG), a natural loop occurring in the CFG, and a positive integer k, and constructs a single CFG in which the given loop is eliminated via an unwinding proportional to k. Recursively applying the proof rule eventually yields a loop-free CFG, which can be checked using SAT-/SMT-based techniques. We state soundness of the rule, and investigate its theoretical properties. We then present two implementations of our technique: K-INDUCTOR, a verifier for C programs built on top of the CBMC model checker, and K-BOOGIE, an extension of the Boogie tool. Our experiments, using a large set of benchmarks, demonstrate that our k-induction technique frequently allows program verification to succeed using significantly weaker loop invariants than are required with the standard inductive invariant approach.

/pdf/software-verification-using-k-induction-5cuwucgm7m.pdf

Philipp Rümmer

Papers

A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic

Automating regression verification

Disjunctive Interpolants for Horn-Clause Verification

A polymorphic intermediate verification language: design and logical encoding

Software verification using k-induction