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.
In: International Con ference on The- ory and Applications of Satisfiability Testing
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2verdicts
UNVERDICTED 2representative citing papers
Predicate abstraction of max-plus linear systems enables bounded model checking for time-difference specifications with an explicit completeness threshold bound based on transient and cyclicity.
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.
-
Bounded Model Checking of Max-Plus Linear Systems via Predicate Abstractions
Predicate abstraction of max-plus linear systems enables bounded model checking for time-difference specifications with an explicit completeness threshold bound based on transient and cyclicity.