Marijn Heule

According to our database1, Marijn Heule
  • authored at least 79 papers between 2004 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Solution Validation and Extraction for QBF Preprocessing.
J. Autom. Reasoning, 2017

Static Detection of DoS Vulnerabilities in Programs that use Regular Expressions (Extended Version).
CoRR, 2017

The science of brute force.
Commun. ACM, 2017

Skolem Function Continuation for Quantified Boolean Formulas.
Proceedings of the Tests and Proofs - 11th International Conference, 2017

Static Detection of DoS Vulnerabilities in Programs that Use Regular Expressions.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

A Little Blocked Literal Goes a Long Way.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Efficient, Verified Checking of Propositional Proofs.
Proceedings of the Interactive Theorem Proving - 8th International Conference, 2017

Solving Very Hard Problems: Cube-and-Conquer, a Hybrid SAT Solving Method.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Short Proofs Without New Variables.
Proceedings of the Automated Deduction - CADE 26, 2017

Efficient Certified RAT Verification.
Proceedings of the Automated Deduction - CADE 26, 2017

SAT Competition 2016: Recent Developments.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Solving and Verifying the boolean Pythagorean Triples problem via Cube-and-Conquer.
CoRR, 2016

The DRAT format and DRAT-trim checker.
CoRR, 2016

Efficient Certified RAT Verification.
CoRR, 2016

The Quest for Perfect and Compact Symmetry Breaking for Graph Problems.
Proceedings of the 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2016

Analysis of Computing Policies Using SAT Solvers (Short Paper).
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

Computing Maximum Unavoidable Subgraphs Using SAT Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

2015
A SAT Approach to Clique-Width.
ACM Trans. Comput. Log., 2015

Clause Elimination for SAT and QSAT.
J. Artif. Intell. Res., 2015

The Implication Problem of Computing Policies.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2015

Blocked Literals Are Universal.
Proceedings of the NASA Formal Methods - 7th International Symposium, 2015

Clausal Proof Compression.
Proceedings of the IWIL@LPAR 2015, 2015

Compositional Propositional Proofs.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015

Expressing Symmetry Breaking in DRAT Proofs.
Proceedings of the Automated Deduction - CADE-25, 2015

What's Hot in the SAT and ASP Competitions.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Bridging the gap between easy generation and efficient verification of unsatisfiability proofs.
Softw. Test., Verif. Reliab., 2014

Concurrent Cube-and-Conquer.
CoRR, 2014

Symbiosis of Search and Heuristics for Random 3-SAT.
CoRR, 2014

Towards Ultra Rapid Restarts.
CoRR, 2014

DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers.
Proceedings of the POS-14. Fifth Pragmatics of SAT workshop, 2014

MUS Extraction Using Clausal Proofs.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Efficient extraction of Skolem functions from QRAT proofs.
Proceedings of the Formal Methods in Computer-Aided Design, 2014

A Unified Proof System for QBF Preprocessing.
Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2013
Software model synthesis using satisfiability solvers.
Empirical Software Engineering, 2013

A SAT Approach to Clique-Width
CoRR, 2013

Symmetry in Gardens of Eden.
Electr. J. Comb., 2013

A SAT Approach to Clique-Width.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Blocked Clause Decomposition.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Mechanical Verification of SAT Refutations with Extended Resolution.
Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

Trimming while checking clausal proofs.
Proceedings of the Formal Methods in Computer-Aided Design, 2013

Revisiting Hyper Binary Resolution.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

Verifying Refutations with Extended Resolution.
Proceedings of the Automated Deduction - CADE-24, 2013

2012
Simulating Circuit-Level Simplifications on CNF.
J. Autom. Reasoning, 2012

Guided Merging of Sequence Diagrams.
Proceedings of the Software Language Engineering, 5th International Conference, 2012

Concurrent Cube-and-Conquer - (Poster Presentation).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Automated Reencoding of Boolean Formulas.
Proceedings of the Hardware and Software: Verification and Testing, 2012

Inprocessing Rules.
Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

2011
Introduction to Mathematics of Satisfiability, Victor W. Marek, Chapman & Hall/CRC, 2009. Hardback, ISBN-13: 978-143980167-3, $89.95.
TPLP, 2011

Reusing the Assignment Trail in CDCL Solvers.
JSAT, 2011

Between Restarts and Backjumps.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Efficient CNF Simplification Based on Binary Implication Graphs.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

EagleUP: Solving Random 3-SAT Using SLS with Unit Propagation.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads.
Proceedings of the Hardware and Software: Verification and Testing, 2011

2010
Covered Clause Elimination
CoRR, 2010

Symmetry within Solutions
CoRR, 2010

Blocked Clause Elimination.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

Covered Clause Elimination.
Proceedings of the Short papers for 17th International Conference on Logic for Programming, 2010

Clause Elimination Procedures for CNF Formulas.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Exact DFA Identification Using SAT Solvers.
Proceedings of the Grammatical Inference: Theoretical Results and Applications, 2010

Symmetry in Solutions.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Look-Ahead Based SAT Solvers.
Proceedings of the Handbook of Satisfiability, 2009

Dynamic Symmetry Breaking by Simulating Zykov Contraction.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008
SmArT solving: tools and techniques for satisfiability solvers.
PhD thesis, 2008

Whose side are you on? Finding solutions in a biased search-tree.
JSAT, 2008

Parallel SAT Solving using Bit-level Operations.
JSAT, 2008

Sums of squares based approximation algorithms for MAX-SAT.
Discrete Applied Mathematics, 2008

2007
Solving games: Dependence of applicable solving procedures.
Sci. Comput. Program., 2007

A New Method to Construct Lower Bounds for Van der Waerden Numbers.
Electr. J. Comb., 2007

Prototypes for Automated Architectural 3D-Layout.
Proceedings of the Virtual Systems and Multimedia, 13th International Conference, 2007

Effective Incorporation of Double Look-Ahead Procedures.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

From Idempotent Generalized Boolean Assignments to Multi-bit Search.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

2006
March_dl: Adding Adaptive Heuristics and a New Branching Strategy.
JSAT, 2006

2005
Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005

2004
Aligning CNF- and Equivalence-Reasoning.
Proceedings of the Theory and Applications of Satisfiability Testing, 2004

Aligning CNF- and Equivalence-reasoning.
Proceedings of the SAT 2004, 2004

March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver.
Proceedings of the Theory and Applications of Satisfiability Testing, 2004


  Loading...