Modular SMT Proofs for Fast Reflexive Checking Inside Coq (Q3100210): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: cvc3 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Gandalf / 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-642-25379-9_13 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W92909155 / 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: Extending Coq with Imperative Features and Its Application to SAT Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Reflexive Arithmetic Tactics the Linear Case and Beyond / 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: Automated Deduction – CADE-20 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Effectively Propositional Logic Using DPLL and Substitution Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2848059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplify: a theorem prover for program checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compiled implementation of strong reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal certification of a compiler back-end or / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2848688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplification by Cooperating Decision Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Source-Level Proof Reconstruction for Interactive Theorem Proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nullstellensatz and a Positivstellensatz in semialgebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently checking propositional refutations in HOL theorem provers / rank
 
Normal rank

Latest revision as of 16:51, 4 July 2024

scientific article
Language Label Description Also known as
English
Modular SMT Proofs for Fast Reflexive Checking Inside Coq
scientific article

    Statements

    Modular SMT Proofs for Fast Reflexive Checking Inside Coq (English)
    0 references
    0 references
    0 references
    0 references
    22 November 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references