A unified framework for DPLL(T) + certificates (Q2375732)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6175991
Language Label Description Also known as
default for all languages
No label defined
    English
    A unified framework for DPLL(T) + certificates
    scientific article; zbMATH DE number 6175991

      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