English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Paper

Triggered Clause Pushing for IC3

MPS-Authors
/persons/resource/persons45573

Suda,  Martin
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

arXiv:1307.4966.pdf
(Preprint), 241KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Suda, M. (2013). Triggered Clause Pushing for IC3. Retrieved from http://arxiv.org/abs/1307.4966.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-9F0F-1
Abstract
We propose an improvement of the famous IC3 algorithm for model checking safety properties of finite state systems. We collect models computed by the SAT-solver during the clause propagation phase of the algorithm and use them as witnesses for why the respective clauses could not be pushed forward. It only makes sense to recheck a particular clause for pushing when its witnessing model falsifies a newly added clause. Since this trigger test is both computationally cheap and sufficiently precise, we can afford to keep clauses pushed as far as possible at all times. Experiments indicate that this strategy considerably improves IC3's performance.
-