Reliable reconstruction of fine-grained proofs in a proof assistant (Q2055877): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SMTCoq / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Isabelle/HOL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Sledgehammer / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-79876-5_26 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3180619128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable reconstruction of fine-grained proofs in a proof assistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Isabelle/HOL Formalisation of Green’s Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Isabelle/HOL formalisation of Green's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable fine-grained proofs for formula processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congruence Closure with Free Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending SMT solvers to higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-intelligible Isar proofs from machine-generated proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending Sledgehammer with SMT Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sledgehammer: Judgement Day / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast LCF-Style Proof Reconstruction for Z3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SMTCoq: a plug-in for integrating SMT solvers into Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edinburgh LCF. A mechanized logic of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: MaSh: Machine Learning for Sledgehammer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2848688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lightweight relevance filtering for machine-generated resolution problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting enumerative instantiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalizing Bachmair and Ganzinger's ordered resolution prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SMT proof checking using a logical framework / rank
 
Normal rank

Latest revision as of 08:49, 27 July 2024

scientific article
Language Label Description Also known as
English
Reliable reconstruction of fine-grained proofs in a proof assistant
scientific article

    Statements

    Reliable reconstruction of fine-grained proofs in a proof assistant (English)
    0 references
    0 references
    0 references
    0 references
    1 December 2021
    0 references
    automatic theorem provers
    0 references
    proof assistants
    0 references
    proof verification
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers