| Publication | Date of Publication | Type |
|---|
An adaptive prefix-assignment technique for symmetry reduction
Journal of Symbolic Computation | 2020-01-15 | Paper |
Engineering an efficient canonical labeling tool for large and sparse graphs
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
An adaptive prefix-assignment technique for symmetry reduction
Theory and Applications of Satisfiability Testing – SAT 2017 | 2017-11-15 | Paper |
Simulating parity reasoning
Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
Conflict-driven XOR-clause learning
Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
SMT-based induction methods for timed systems
Lecture Notes in Computer Science | 2012-11-21 | Paper |
Exploiting step semantics for efficient bounded model checking of asynchronous systems
Science of Computer Programming | 2012-07-20 | Paper |
Partitioning search spaces of a randomized search
Fundamenta Informaticae | 2011-11-22 | Paper |
Conflict propagation and component recursion for canonical labeling
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
Extending clause learning DPLL with parity reasoning
| 2011-05-11 | Paper |
Partitioning SAT instances for distributed solving
Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
Incorporating clause learning in grid-based randomized SAT solving
| 2009-10-26 | Paper |
Limitations of restricted branching in clause learning
Constraints | 2009-08-06 | Paper |
Justification-Based Local Search with Adaptive Noise Strategies
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
Strategies for Solving SAT in Grids by Randomized Search
Lecture Notes in Computer Science | 2009-01-27 | Paper |
Incorporating Learning in Grid-Based Randomized SAT Solving
Artificial Intelligence: Methodology, Systems, and Applications | 2008-11-04 | Paper |
Limitations of Restricted Branching in Clause Learning
Principles and Practice of Constraint Programming – CP 2007 | 2008-09-02 | Paper |
Linear Encodings of Bounded LTL Model Checking
Logical Methods in Computer Science | 2007-10-11 | Paper |
Bounded Model Checking for Weak Alternating Büchi Automata
Computer Aided Verification | 2007-09-05 | Paper |
M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures
Journal of Automated Reasoning | 2007-01-24 | Paper |
Efficient theory combination via Boolean search
Information and Computation | 2006-10-25 | Paper |
Formal Methods in Computer-Aided Design
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Unrestricted vs restricted cut in a tableau method for Boolean circuits
Annals of Mathematics and Artificial Intelligence | 2006-01-23 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Applications and Theory of Petri Nets 2004
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science | 2005-12-06 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2005-11-10 | Paper |
scientific article; zbMATH DE number 1696820 (Why is no real title available?)
| 2002-01-28 | Paper |
Computational complexity of the place/transition-net symmetry reduction method
Journal of Universal Computer Science | 2001-10-23 | Paper |
scientific article; zbMATH DE number 1337889 (Why is no real title available?)
| 2000-02-16 | Paper |
