A unified framework for DPLL(T) + certificates (Q2375732): 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: SMT-LIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PicoSAT / 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.1155/2013/964682 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1517540595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of backtrack search satisfiability algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4399249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving SAT and SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3604000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SMT proof checking using a logical framework / 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 Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rocket-Fast Proof Checking for SMT Solvers / rank
 
Normal rank

Latest revision as of 13:35, 6 July 2024

scientific article
Language Label Description Also known as
English
A unified framework for DPLL(T) + certificates
scientific article

    Statements

    A unified framework for DPLL(T) + certificates (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 June 2013
    0 references
    Summary: Satisfiability modulo theories (SMT) techniques are widely used nowadays. SMT solvers are typically used as verification backends. When an SMT solver is invoked, it is quite important to ensure the correctness of its results. To address this problem, we propose a unified certificate framework based on DPLL(T), including a uniform certificate format, a unified certificate generation procedure, and a unified certificate checking procedure. The certificate format is shown to be simple, clean, and extensible to different background theories. The certificate generation procedure is well adapted to most DPLL(T)-based SMT solvers. The soundness and completeness for DPLL(T) + certificates were established. The certificate checking procedure is straightforward and efficient. Experimental results show that the overhead for certificates generation is only 10\%, which outperforms other methods, and the certificate checking procedure is quite time saving.
    0 references
    satisfiability modulo theory
    0 references
    SMT solvers
    0 references
    DPLL(T)
    0 references
    certificate format
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers