Backtrackable Inprocessing enables sound inprocessing at arbitrary decision levels in incremental SAT solving and solves about 1.5 times as many difficult bounds on 2017 BMC benchmarks compared to global-level preprocessing.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Quokka# is a Python library that converts quantum circuit analysis tasks into #SAT problems, offering multiple encodings, approximate equivalence checking, and depth-optimal synthesis.
An encoding of Solidity contracts and first-order Hennessy-Milner logic into Lustre enables Kind 2 model checking of complex temporal properties in smart contracts.
citing papers explorer
-
Backtrackable Inprocessing
Backtrackable Inprocessing enables sound inprocessing at arbitrary decision levels in incremental SAT solving and solves about 1.5 times as many difficult bounds on 2017 BMC benchmarks compared to global-level preprocessing.
-
Quokka#: Quantum Computing with #SAT
Quokka# is a Python library that converts quantum circuit analysis tasks into #SAT problems, offering multiple encodings, approximate equivalence checking, and depth-optimal synthesis.
-
KindHML: formal verification of smart contracts based on Hennessy-Milner logic
An encoding of Solidity contracts and first-order Hennessy-Milner logic into Lustre enables Kind 2 model checking of complex temporal properties in smart contracts.