Titlebook: Certified Programs and Proofs; First International Jean-Pierre Jouannaud,Zhong Shao Conference proceedings 2011 Springer-Verlag GmbH Berli

DEAF

consent

睨視

A Decision Procedure for Regular Expression Equivalence in Type Theorygnize the same language. Our approach to this problem is inspired by Brzozowski’s algorithm using derivatives of regular expressions, with a new definition of finite sets. In this paper, we detail a complete formalization of Brzozowki’s derivatives, a new definition of finite sets along with its bas

Culpable

A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesseso answer, but also a proof witness that can be independently rechecked. We present such a checker, written and fully certified in .. It is conceived in a modular way, in order to tame the proofs’ complexity and to be extendable. It can currently check witnesses from the SAT solver . and from the SMT

哎呦

Modular SMT Proofs for Fast Reflexive Checking Inside Coqapabilities like Coq. We advocate modular SMT proofs that separate boolean reasoning and theory reasoning; and structure the communication between theories using Nelson-Oppen combination scheme. We present the design and implementation of a Coq reflexive verifier that is modular and allows for fine-

武器

Tactics for Reasoning Modulo AC in Coqding blocks: first, an extensible reflexive decision procedure for equality modulo AC; second, an OCaml plug-in for pattern matching modulo AC. We handle associative only operations, neutral elements, uninterpreted function symbols, and user-defined equivalence relations. By relying on type-classes

革新

Reconstruction of Z3’s Bit-Vector Proofs in HOL4 and Isabelle/HOLproofs for bit-vector theories in the theorem provers HOL4 and Isabelle/HOL. Our work shows that LCF-style proof reconstruction for the theory of fixed-size bit-vectors, although difficult because Z3’s proofs provide limited detail, is often possible. We thereby obtain high correctness assurances fo

Trabeculoplasty

Teaching Experience: Logic and Formal Methods with Coqur goals for adding mechanized provers to the course, and illustrate how we have integrated the provers into our syllabus to meet those goals. We also document some of the teaching materials we have developed for the course to date, and what our experiences have been like.

凌辱

The Teaching Tool , A Proof-Checker for Gries and Schneider’s “Logical Approach to Discrete Math” good?”.We now report on the development of a proof-checker designed to answer exactly that question, while intentionally not helping to find the solutions in the first place. . provides detailed feedback to . -formatted calculational proofs, and thus helps students to develop confidence in their ow

Maximizer