to appear |
|
6 | Siert Wieringa and Keijo Heljanko. Asynchronous multi-core incremental sat solving. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), to appear. |
|
2012 |
|
5 | Siert Wieringa. Understanding, improving and parallelizing MUS finding using model rotation. In Principles and Practice of Constraint Programming (CP), Lecture Notes in Computer Science, pages 672–687, 2012. |
|
2011 |
|
4 | Marijn J.H. Heule, Oliver Kullmann, Siert Wieringa, and Armin Biere. Cube and conquer: Guiding CDCL SAT solvers by lookaheads. In Haifa Verification Conference (HVC), Lecture Notes in Computer Science, pages 50–56, 2011. |
|
|
3 | Siert Wieringa. On incremental satisfiability and bounded model checking. In First International Workshop on Design and Implementation of Formal Tools and Systems (DIFTS11), 2011. |
|
2009 |
|
2 | Siert Wieringa, Matti Niemenmaa, and Keijo Heljanko. Tarmo: A framework for parallelized bounded model checking. In Lubos Brim and Jaco van der Pol, editors, Proceedings of the 8th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC'09), volume 14 of Electronic Proceedings in Theoretical Computer Science (EPTCS), pages 62–76, 2009. |
|
2008 |
|
1 | Hans van Maaren and Siert Wieringa. Finding guaranteed MUSes fast. In Hans Kleine Büning and Xishun Zhao, editors, Theory and Applications of Satisfiability Testing (SAT), volume 4996 of Lecture Notes in Computer Science, pages 291–304, 2008. |
|
