 | 2012 |
| 11 |  | Sayak Ray,
Alan Mishchenko,
Niklas Eén,
Robert K. Brayton,
Stephen Jang,
Chao Chen:
Mapping into LUT structures.
DATE 2012: 1579-1584 |
| 2010 |
| 10 |  | Niklas Eén,
Alan Mishchenko,
Nina Amla:
A single-instance incremental SAT formulation of proof- and counterexample-based abstraction.
FMCAD 2010: 181-188 |
| 9 |  | Niklas Eén,
Alan Mishchenko,
Nina Amla:
A Single-Instance Incremental SAT Formulation of Proof- and Counterexample-Based Abstraction
CoRR abs/1008.2021: (2010) |
| 2009 |
| 8 |  | Koen Claessen,
Niklas Eén,
Mary Sheeran,
Niklas Sörensson,
Alexey Voronov,
Knut Åkesson:
SAT-Solving in Practice, with a Tutorial Example from Supervisory Control.
Discrete Event Dynamic Systems 19(4): 495-524 (2009) |
| 2007 |
| 7 |  | Niklas Eén,
Alan Mishchenko,
Niklas Sörensson:
Applying Logic Synthesis for Speeding Up SAT.
SAT 2007: 272-286 |
| 2006 |
| 6 |  | Alan Mishchenko,
Satrajit Chatterjee,
Robert K. Brayton,
Niklas Eén:
Improvements to combinational equivalence checking.
ICCAD 2006: 836-843 |
| 5 |  | Niklas Eén,
Niklas Sörensson:
Translating Pseudo-Boolean Constraints into SAT.
JSAT 2(1-4): 1-26 (2006) |
| 2005 |
| 4 |  | Niklas Eén,
Armin Biere:
Effective Preprocessing in SAT Through Variable and Clause Elimination.
SAT 2005: 61-75 |
| 2003 |
| 3 |  | Niklas Eén,
Niklas Sörensson:
An Extensible SAT-solver.
SAT 2003: 502-518 |
| 2 |  | Niklas Eén,
Niklas Sörensson:
Temporal induction by incremental SAT solving.
Electr. Notes Theor. Comput. Sci. 89(4): 543-560 (2003) |
| 2000 |
| 1 |  | Parosh Aziz Abdulla,
Per Bjesse,
Niklas Eén:
Symbolic Reachability Analysis Based on SAT-Solvers.
TACAS 2000: 411-425 |