Titlebook: Interactive Theorem Proving; 4th International Co Sandrine Blazy,Christine Paulin-Mohring,David Pich Conference proceedings 2013 Springer-V

惹人反感

pacific

Light-Weight Containers for Isabelle: Efficient, Extensible, Nestableefinement during code generation, our light-weight framework is flexible, extensible, and easy to use. To support arbitrary nesting of containers, we devise an efficient linear order on sets that can even compare complements and non-complements. Our evaluation shows that it is both efficient and usa

監(jiān)禁

Mechanising Turing Machines and Computability Theory in Isabelle/HOLs and relate them to abacus machines and recursive functions. We “tie the know” between these three computational models by formalising a universal function and obtaining from it a universal Turing machine by our verified translation from recursive functions to abacus programs and from abacus progra

花費

A Machine-Checked Proof of the Odd Order Theorem the . proof assistant. The formalized proof is constructive, and relies on nothing but the axioms and rules of the foundational framework implemented by .. To support the formalization, we developed a comprehensive set of reusable libraries of formalized mathematics, including results in finite gro

Integrate

circuit

flavonoids

光明正大

Mechanical Verification of SAT Refutations with Extended Resolutionof increasingly complex satisfiability (SAT) solver techniques, including those based on extended resolution. A common approach to assure the correctness of SAT solvers is to emit a proof of unsatisfiability when no solution is reported to exist. Contemporary proof checkers only check logical equiva

Mercurial

從屬