Titlebook: Computer Aided Verification; 18th International C Thomas Ball,Robert B. Jones Conference proceedings 2006 Springer-Verlag Berlin Heidelberg

摇晃

HOWL

Alexandra Egorova,Herman Petrov-Nerlingallenge project to construct a program verifier, based on a sound and complete theory of programming, and evaluated by experimental application to a large and representative sample of useful computer software.

lactic

清真寺

高兴去去

sclera

Counterexamples with Loops for Predicate Abstractiontrack of predicates over the data. In many cases, the technique suffers from the fact that it requires at least one predicate for each iteration of a loop construct in the program. We propose to extract . from the abstract model, and to parameterize the simulation instance in the number of loop iterations.

Trypsin

痛恨

https://doi.org/10.1007/978-81-322-2151-7We present the tool . (.). In ., a component interface describes both the behavior of a component, and the component’s assumptions on the environment’s behavior. . can check the compatibility of such interfaces, and analyze their emergent behavior, via a symbolic implementation of game-theoretic algorithms.

Lumbar-Spine

Systemic Functional Language TypologyWe describe a model checker for infinite-state sequential programs, based on Craig interpolation and the lazy abstraction paradigm. On device driver benchmarks, we observe a speedup of up to two orders of magnitude relative to a similar tool using predicate abstraction.

珠宝

Systemic Governance and AccountabilityWe present a SAT-based algorithm for assisting users of Symbolic Trajectory Evaluation (STE) in manual abstraction refinement. As a case study, we demonstrate the usefulness of the algorithm by showing how to refine and verify an STE specification of a CAM.