Titlebook: Interactive Theorem Proving; 5th International Co Gerwin Klein,Ruben Gamboa Conference proceedings 2014 Springer International Publishing S

Mirage

A Formal Library for Elliptic Curves in the Coq Proof Assistanttral contribution is a library containing many of the objects and core properties related to elliptic curve theory. We demonstrate the applicability of our library by formally proving a non-trivial property of elliptic curves: the existence of an isomorphism between a curve and its Picard group of divisors.

CRASS

Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Codet some key abstract interpretation techniques that automatically extract memory safety properties from binary code. Our analyzer is formally proved correct and has been run on several self-modifying challenges, provided by Caiet al.in their PLDI 2007 paper.

Gudgeon

From Operational Models to Information Theory; Side Channels in pGCL with Isabellegrams, and the information-theoretic view, where the attacker solves an optimal-decoding problem, viewing the system as a noisy channel. Our practical contribution is to illustrate the selection of probabilistic loop invariants to verify such security properties, and the demonstration of a mechanical proof linking traditionally distinct domains.

Defraud

Formalized, Effective Domain Theory in Coqinted profinite domains. Standard constructions (e.g., products, sums, the function space, and powerdomains) are all developed. In addition, I build the machinery necessary to compute solutions to recursive domain equations.

Axon895

CON

interior

mechanical

Implicational Rewriting Tactics in HOLovide solutions to deal with these situations automatically, which we implemented as HOL Light and HOL4 tactics. We find these tactics to be extremely useful in practice, both for their automation and for the feedback they provide to the user.

填料

Showing Invariance Compositionally for a Process Algebra for Network Protocols that relate states across multiple processes (entire networks). To this end, we propose a novel compositional technique for lifting global invariants stated at the level of individual nodes to networks of nodes.

魔鬼在游行

A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extractionied implementation of this framework in the Coq proof assistant: efficient bulk synchronous parallel functional programs can be extracted from naive GTA specifications. We show how to apply this framework on an example, including performance experiments on parallel machines.