Verifying the conversion into CNF in dafny

DOI10.1007/978-3-030-88853-4_10OpenAlexW3202267117MaRDI QIDQ2148786

Ştefan Ciobâcă, Viorel Iordache

Publication date: 24 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-88853-4_10

Mathematics Subject Classification ID

Logic in computer science (03B70)

Uses Software

• Coq
• Dafny
• Why3
• VCC
• versat
• GNATprove
• Archive Formal Proofs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formalization and implementation of modern SAT solvers
• An optimality result for clause form translation
• A verified SAT solver framework with learn, forget, restart, and incrementality
• versat: A Verified Modern SAT Solver
• Formalization of Abstract State Transition Systems for SAT
• Extracting verified decision procedures: DPLL and Resolution
• The Mechanical Verification of a DPLL-Based Satisfiability Solver

This page was built for publication: Verifying the conversion into CNF in dafny