| Publication | Date of Publication | Type |
|---|
| Some remarks on the test complexity of iterative logic arrays | 2022-08-18 | Paper |
| Synthesis for testability: Binary Decision Diagrams | 2022-08-18 | Paper |
| On the relation between BDDs and FDDs | 2022-08-16 | Paper |
| The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 | 2021-12-09 | Paper |
| On preprocessing for weighted MaxSAT | 2021-10-18 | Paper |
| Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions | 2021-05-28 | Paper |
| Integrating Algebraic and SAT Solvers | 2019-03-14 | Paper |
| OKFDDs versus OBDDs and OFDDs | 2019-01-10 | Paper |
| Skolem functions for DQBF | 2018-10-25 | Paper |
| Dynamic polynomial watchdog encoding for solving weighted MaxSAT | 2018-08-10 | Paper |
| From DQBF to QBF by dependency elimination | 2017-11-15 | Paper |
| Verification of partial designs using incremental QBF | 2017-11-07 | Paper |
| Cost vs. time in stochastic games and Markov automata | 2017-09-08 | Paper |
| Cost vs. Time in Stochastic Games and Markov Automata | 2017-08-31 | Paper |
| Satisfiability checking and symbolic computation | 2017-06-21 | Paper |
| PHAETON: A SAT-Based Framework for Timing-Aware Path Sensitization | 2017-05-16 | Paper |
| Dependency Schemes for DQBF | 2016-09-05 | Paper |
| $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation | 2016-08-30 | Paper |
| Incremental Encoding and Solving of Cardinality Constraints | 2015-12-17 | Paper |
| Laissez-Faire Caching for Parallel #SAT Solving | 2015-11-20 | Paper |
| Preprocessing for DQBF | 2015-11-20 | Paper |
| Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey | 2015-02-25 | Paper |
| Abstraction-Based Computation of Reward Measures for Markov Automata | 2015-02-04 | Paper |
| Minimal counterexamples for linear-time probabilistic verification | 2014-08-27 | Paper |
| Bounded model checking with parametric data structures | 2013-12-06 | Paper |
| Accurate Computation of Sensitizable Paths Using Answer Set Programming | 2013-10-10 | Paper |
| A Symbiosis of Interval Constraint Propagation and Cylindrical Algebraic Decomposition | 2013-06-14 | Paper |
| ALLQBF Solving by Computational Learning | 2012-11-21 | Paper |
| Incremental preprocessing methods for use in BMC | 2012-09-27 | Paper |
| Minimal Critical Subsystems for Discrete-Time Markov Models | 2012-06-29 | Paper |
| Hierarchical Counterexamples for Discrete-Time Markov Chains | 2011-10-07 | Paper |
| Craig Interpolation in the Presence of Non-linear Constraints | 2011-10-07 | Paper |
| Integration of an LP Solver into Interval Constraint Propagation | 2011-08-12 | Paper |
| Parallel SAT Solving in Bounded Model Checking | 2011-02-02 | Paper |
| Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs | 2010-09-29 | Paper |
| Thread-parallel integrated test pattern generator utilizing satisfiability analysis | 2010-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3639754 | 2009-10-26 | Paper |
| Theory and Applications of Satisfiability Testing | 2009-07-24 | Paper |
| Technische Informatik | 2009-04-09 | Paper |
| Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking | 2009-02-10 | Paper |
| Orthogonal Hypergraph Drawing for Improved Visibility | 2009-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3528912 | 2008-10-17 | Paper |
| Sigref – A Symbolic Bisimulation Tool Box | 2008-09-04 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-15 | Paper |
| Verification, Model Checking, and Abstract Interpretation | 2005-12-06 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4677783 | 2005-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472315 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448597 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422288 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4544352 | 2002-08-04 | Paper |
| On WLCDs and the complexity of word-level decision diagrams --- A lower bound for division | 2002-06-16 | Paper |
| Testing with decision diagrams | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4215790 | 1998-10-29 | Paper |
| On the testability of iterative logic arrays | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4885894 | 1996-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4885887 | 1996-08-22 | Paper |
| On the relation between BDDs and FDDs | 1996-03-19 | Paper |
| Computations over finite monoids and their test complexity | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3204432 | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3200996 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3827942 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3792636 | 1988-01-01 | Paper |
| How robust is the n-cube? | 1988-01-01 | Paper |
| On the Optimal Layout of Planar Graphs with Fixed Boundary | 1987-01-01 | Paper |
| An easily testable optimal-time VLSI-multiplier | 1987-01-01 | Paper |
| Layouts with wires of balanced length | 1987-01-01 | Paper |
| A logic-topological calculus for the construction of integrated circuits. I | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3743252 | 1986-01-01 | Paper |
| A logic-topological calculus for the construction of integrated circuits. II. | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3684050 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3960132 | 1982-01-01 | Paper |
