Formalization of Abstract State Transition Systems for SAT
From MaRDI portal
Publication:3224685
DOI10.2168/LMCS-7(3:19)2011zbMath1237.68179arXiv1108.4368OpenAlexW3102087768MaRDI QIDQ3224685
Publication date: 2 April 2012
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.4368
Related Items (5)
A proof system for graph (non)-isomorphism verification ⋮ Verifying the conversion into CNF in dafny ⋮ A verified SAT solver framework with learn, forget, restart, and incrementality ⋮ Verified verifying: SMT-LIB for strings in Isabelle ⋮ Functional Encryption for Inner Product with Full Function Privacy
Uses Software
This page was built for publication: Formalization of Abstract State Transition Systems for SAT
