Titlebook: Verified Software: Theories, Tools, Experiments; Second International Natarajan Shankar,Jim Woodcock Conference proceedings 2008 Springer-V

種植,培養(yǎng)

Combining Tests and Proofsain high coverage, it typically suffers from imprecision (and imprecision is needed to scale the analysis to large programs). While dynamic analysis has the potential to be very precise, it typically suffers from poor coverage.

流行

Propositional Dynamic Logic for Recursive Procedureshough PDL with recursive programs is known to be highly undecidable, natural deductive formalisms for it are of substantial interest, because they distill the essential logical components of recursive procedures. We also show that Pratt-Kozen’s .-Calculus, in which fixpoints are taken over formulas rather than programs, is interpretable in . PDL.

BLAZE

Mapped Separation Logiceorem prover and it allows reasoning on properties about page tables, direct physical memory access, virtual memory access, and shared memory. Mapped Separation Logic fully supports all rules of abstract Separation Logic, including the frame rule.

巨頭

Verified Protection Model of the seL4 MicrokernelWe provide an abstract specification of the seL4 access control system together with a formal proof that shows how confined subsystems can be enforced. All proofs and specifications in this paper are developed in the interactive theorem prover Isabelle/HOL.

Anterior

Boogie Meets Regions: A Verification Experience ReportWe use region logic specifications to verify several programs exhbiting the classic hard problem for object-oriented systems: the framing of heap updates. We use BoogiePL and its associated SMT solver, Z3, to prove both implementations and client code.

外觀

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/v/image/981752.jpg

Outmoded

https://doi.org/10.1007/978-3-540-87873-5Action; Benchmark; Java; algorithms; bounded verification; design methods; logic; modal logic; programming l

embolus

chemoprevention

消毒