Titlebook: Computer Aided Verification; 16th International C Rajeev Alur,Doron A. Peled Conference proceedings 2004 Springer-Verlag Berlin Heidelberg

SYN

Deductive Verification of Pipelined Machines Using First-Order Quantification, overlapped execution of different instructions. Nevertheless, we show that if the logic used is sufficiently expressive, then it is possible to relate the executions of the pipelined machine with the corresponding Instruction Set Architecture using (stuttering) simulation. Our methodology uses firs

不能仁慈

resilience

An Efficiently Checkable, Proof-Based Formulation of Vacuity in Model Checking,uire either checking a quadratic size witness formula, or multiple model checking runs; either alternative may be quite expensive in practice. Vacuity is, in its essence, a problem with the justification used by the model checker for deeming the property to be true. We argue that current definitions

Override

Termination of Linear Programs,governing termination, that is, a while loop with linear assignments. We relate the termination of such a simple loop, on all initial values, to the eigenvectors corresponding to only the positive real eigenvalues of the matrix defining the loop assignments. This characterization of termination is r

舞蹈编排

Proving More Properties with Bounded Model Checking, this paper we propose a termination criterion for all of LTL, and we show its effectiveness through experiments. Our approach is based on converting the LTL formula to a Büchi automaton so as to reduce model checking to the verification of a fairness constraint. This reduction leads to one terminat

为现场

ineptitude

Using Interface Refinement to Integrate Formal Verification into the Design Cycle, main verification challenges is to keep up with the changes to the specifications as the design evolves, and in particular, the transformations to the interfaces between the components. Interface changes are usually incremental, and therefore, the verification efforts after each change should also

Paradox

Indexed Predicate Discovery for Unbounded System Verification,cally constructed given a set of predicates. Predicate abstraction coupled with automatic predicate discovery provides for a completely automatic verification scheme. For systems with unbounded integer state variables (e.g. software), counterexample guided predicate discovery has been successful in

忍受

Range Allocation for Separation Logic,type like . or .. Any equality or inequality can be expressed in this logic. We propose a decision procedure for Separation Logic based on allocating small domains (ranges) to the formula’s variables that are sufficient for preserving satisfiability. Given a Separation Logic formula ., our procedure

Hectic

An Experimental Evaluation of Ground Decision Procedures,not well studied. We compare the behavior of ground decision procedures by comparing the performance of a variety of technologies on benchmark suites with differing characteristics. Based on these experimental results, we discuss relative strengths and shortcomings of different systems.