Titlebook: Interactive Theorem Proving; Second International Marko Eekelen,Herman Geuvers,Freek Wiedijk Conference proceedings 2011 Springer-Verlag Gm

effrontery

alcohol-abuse

Three Chapters of Measure Theory in Isabelle/HOL this restriction by introducing the extended real numbers. We define the Borel .-algebra for an arbitrary type forming a topological space. Then, we introduce measure spaces with extended real numbers as measure values. After defining the Lebesgue integral and verifying its linearity and monotone c

MITE

Termination of Isabelle Functions via Termination of Rewritingand invoking an external termination prover. Our link to the external prover includes full proof reconstruction, where all necessary properties are derived inside Isabelle/HOL without oracles. Apart from the certification of the imported proof, the main challenge is the formal reduction of the proof

Watemelon

Validating QBF Validity in HOL4 of these certificates in the HOL4 theorem prover. This enables HOL4 users to benefit from Squolem’s automation for valid QBF problems. Detailed performance data shows that LCF-style checking of validity certificates is often (but not always) feasible even for large QBF instances. Additionally, our

剥皮

Proving Valid Quantified Boolean Formulas in HOL Lightrates certificates of validity which are based on witness functions. The certificates are checked in HOL Light by constructing proofs based on these certificates. The presented approach allows HOL Light users to prove larger valid QBF problems than before and provides correctness checking of Squolem

NAV

Applying ACL2 to the Formalization of Algebraic Topology: Simplicial Polynomialsre exists a homotopy equivalence between the chain complex of a simplicial set, and a smaller chain complex for the same simplicial set, called the normalized chain complex. The interest of this work stems from three sources. First, the normalization theorem is the basis for some design decisions in

invulnerable

Animating the Formalised Semantics of a Java-Like Languagese techniques to the large . formalisation. It models a substantial subset of multithreaded Java source and bytecode in Isabelle/HOL and focuses on proofs and modularity whereas code generation was of little concern in its design. Employing Isabelle’s code generation facilities, we obtain a verified

背信

手铐

On the Generation of Positivstellensatz Witnesses in Degenerate Casesolutions, to finding polynomials that are sums of squares of polynomials and satisfy some linear equality .. This produces a . for the desired property, from which it is reasonably easy to obtain a formal proof of the property suitable for a proof assistant such as Coq..The problem of finding a witn

Reclaim

Michael Kishinevsky,Alexander Gotmanov,Yuriy Viktorov