The reflective Milawa theorem prover is sound (down to the machine code that runs it)
From MaRDI portal
(Redirected from Publication:286790)
Recommendations
Cites work
- scientific article; zbMATH DE number 1614710 (Why is no real title available?)
- scientific article; zbMATH DE number 193479 (Why is no real title available?)
- scientific article; zbMATH DE number 3248792 (Why is no real title available?)
- A Brief Overview of HOL4
- A verified runtime for a verified theorem prover
- An axiomatic basis for computer programming
- Automated testing and debugging of SAT and QBF solvers
- CakeML
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Edinburgh LCF. A mechanized logic of computation
- Efficiently checking propositional refutations in HOL theorem provers
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
- Formalization and implementation of modern SAT solvers
- HOL Light: An Overview
- HOL with definitions: semantics, soundness, and a verified implementation
- Inprocessing rules
- Integrating external deduction tools with ACL2
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Isabelle/HOL. A proof assistant for higher-order logic
- Linear and nonlinear arithmetic in ACL2
- Meta Reasoning in ACL2
- Metamathematics, Machines and Gödel's Proof
- Partial functions in ACL2
- Proof Pearl: Wellfounded Induction on the Ordinals Up to ε 0
- Reconstruction of Z3's bit-vector proofs in HOL4 and Isabelle/HOL
- Recursive functions of symbolic expressions and their computation by machine, Part I
- Rewriting with equivalence relations in ACL2
- Steps towards Verified Implementations of HOL Light
- Structured theory development for a mechanized logic
- The challenge of computer mathematics
- Theorem Proving in Higher Order Logics
- Towards Self-verification of HOL Light
- Unified QBF certification and its applications
- Verified just-in-time compiler on x86
Cited in
(11)- Milestones from the Pure Lisp Theorem Prover to ACL2
- A verified runtime for a verified theorem prover
- A verified generational garbage collector for CakeML
- Verifying a concurrent garbage collector with a rely-guarantee methodology
- A verified generational garbage collector for CakeML
- Milawa
- Formalization of the resolution calculus for first-order logic
- A formalization and proof checker for Isabelle's metalogic
- A verified proof checker for higher-order logic
- HOL Zero's solutions for Pollack-inconsistency
- The reflective Milawa theorem prover is sound (down to the machine code that runs it)
Describes a project that uses
Uses Software
This page was built for publication: The reflective Milawa theorem prover is sound (down to the machine code that runs it)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286790)
