Titlebook: Verified Software: Theorie, Tools, Experiments; 5th International Co Ernie Cohen,Andrey Rybalchenko Conference proceedings 2014 Springer-Ve

古老

An Improved Unrolling-Based Decision Procedure for Algebraic Data Types,this paper, we present a decision procedure for reasoning about data types using abstractions that are provided by .: fold functions that map instances of algebraic data types into values in a decidable domain. We show that the procedure is sound and complete for a class of . catamorphisms..Our work

不感興趣

樹膠

Verified Calculations,style, often employed on paper, in the context of mechanized reasoning, and in particular, program verification..This work leverages the power of SMT solvers to machine-check calculational proofs at the level of detail they are usually written by hand. It builds the support for calculations into the

Lethargic

Preserving User Proofs across Specification Changes,oop invariant gets strengthened when additional properties are added to the specification. This causes all the related proof obligations to change; thus previous user verifications become invalid. Yet it is often the case that most of previous proof attempts (goal transformations, calls to interacti

強(qiáng)壯

An Automatic Encoding from VeriFast Predicates into Implicit Dynamic Frames,ation, which employs specifications in implicit dynamic frames. Recently, theoretical work has shown how the cores of these two verification logics can be formally related. However, the mechanisms for abstraction in the two tools are not obviously comparable; VeriFast employs parameterised recursive

深陷

Noisome

Verification of a Virtual Filesystem Switch,Linux. As all file systems in Linux, UBIFS implements the Virtual Filesystem Switch (VFS) interface. VFS in turn implements top-level POSIX operations. This paper bridges the gap between an abstract specification of POSIX and a realistic model of VFS by ASM refinement. The models and proofs are mech