| Publication | Date of Publication | Type |
|---|
Some remarks on the test complexity of iterative logic arrays (extended abstract)
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Synthesis for testability: Binary Decision Diagrams
STACS 92 | 2022-08-18 | Paper |
On the relation between BDDs and FDDs (extended abstract)
LATIN '95: Theoretical Informatics | 2022-08-16 | Paper |
The (D)QBF preprocessor HQSpre -- underlying theory and its implementation
Journal on Satisfiability, Boolean Modeling and Computation | 2021-12-09 | Paper |
| On preprocessing for weighted MaxSAT | 2021-10-18 | Paper |
Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions
IEEE Transactions on Automatic Control | 2021-05-28 | Paper |
Integrating algebraic and SAT solvers
Mathematical Aspects of Computer and Information Sciences | 2019-03-14 | Paper |
OKFDDs versus OBDDs and OFDDs
Automata, Languages and Programming | 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
AI Communications | 2017-11-07 | Paper |
Cost vs. time in stochastic games and Markov automata
Formal Aspects of Computing | 2017-09-08 | Paper |
Cost vs. Time in Stochastic Games and Markov Automata
Dependable Software Engineering: Theories, Tools, and Applications | 2017-08-31 | Paper |
Satisfiability checking and symbolic computation
ACM Communications in Computer Algebra | 2017-06-21 | Paper |
Satisfiability checking and symbolic computation
ACM Communications in Computer Algebra | 2017-06-21 | Paper |
PHAETON: A SAT-Based Framework for Timing-Aware Path Sensitization
IEEE Transactions on Computers | 2017-05-16 | Paper |
Dependency schemes for DQBF
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
\textsf{SC}\(^2\): satisfiability checking meets symbolic computation. (Project paper)
Lecture Notes in Computer Science | 2016-08-30 | Paper |
Incremental Encoding and Solving of Cardinality Constraints
Automated Technology for Verification and Analysis | 2015-12-17 | Paper |
Laissez-faire caching for parallel \#SAT solving
Lecture Notes in Computer Science | 2015-11-20 | Paper |
Preprocessing for DQBF
Lecture Notes in Computer Science | 2015-11-20 | Paper |
Counterexample generation for discrete-time Markov models: an introductory survey
Lecture Notes in Computer Science | 2015-02-25 | Paper |
Abstraction-based computation of reward measures for Markov automata
Lecture Notes in Computer Science | 2015-02-04 | Paper |
Minimal counterexamples for linear-time probabilistic verification
Theoretical Computer Science | 2014-08-27 | Paper |
Bounded model checking with parametric data structures
Electronic Notes in Theoretical Computer Science | 2013-12-06 | Paper |
Accurate computation of sensitizable paths using answer set programming
Logic Programming and Nonmonotonic Reasoning | 2013-10-10 | Paper |
A symbiosis of interval constraint propagation and cylindrical algebraic decomposition
Automated Deduction – CADE-24 | 2013-06-14 | Paper |
ALLQBF solving by computational learning
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
Incremental preprocessing methods for use in BMC
Formal Methods in System Design | 2012-09-27 | Paper |
Minimal Critical Subsystems for Discrete-Time Markov Models
Tools and Algorithms for the Construction and Analysis of Systems | 2012-06-29 | Paper |
Hierarchical counterexamples for discrete-time Markov chains
Automated Technology for Verification and Analysis | 2011-10-07 | Paper |
Craig interpolation in the presence of non-linear constraints
Lecture Notes in Computer Science | 2011-10-07 | Paper |
Integration of an LP solver into interval constraint propagation
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Parallel SAT solving in bounded model checking
Journal Of Logic And Computation | 2011-02-02 | Paper |
Encoding techniques, Craig interpolants and bounded model checking for incomplete designs
Theory and Applications of Satisfiability Testing – SAT 2010 | 2010-09-29 | Paper |
Thread-parallel integrated test pattern generator utilizing satisfiability analysis
International Journal of Parallel Programming | 2010-08-13 | Paper |
| scientific article; zbMATH DE number 5620835 (Why is no real title available?) | 2009-10-26 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2009-07-24 | Paper |
| Technische Informatik | 2009-04-09 | Paper |
Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking
Lecture Notes in Computer Science | 2009-02-10 | Paper |
Orthogonal Hypergraph Drawing for Improved Visibility
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Orthogonal Hypergraph Drawing for Improved Visibility
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Orthogonal Hypergraph Drawing for Improved Visibility
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
| The demand for reliability in probabilistic verification | 2008-10-17 | Paper |
Sigref – A Symbolic Bisimulation Tool Box
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science | 2005-12-06 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
| scientific article; zbMATH DE number 2168228 (Why is no real title available?) | 2005-05-13 | Paper |
| scientific article; zbMATH DE number 2080104 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2044679 (Why is no real title available?) | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 1974128 (Why is no real title available?) | 2003-09-03 | Paper |
| scientific article; zbMATH DE number 1775523 (Why is no real title available?) | 2002-08-04 | Paper |
On WLCDs and the complexity of word-level decision diagrams --- A lower bound for division
Formal Methods in System Design | 2002-06-16 | Paper |
Testing with decision diagrams
Integration | 1999-01-12 | Paper |
| scientific article; zbMATH DE number 1216154 (Why is no real title available?) | 1998-10-29 | Paper |
On the testability of iterative logic arrays
Integration | 1997-02-28 | Paper |
| scientific article; zbMATH DE number 910732 (Why is no real title available?) | 1996-11-04 | Paper |
| scientific article; zbMATH DE number 910729 (Why is no real title available?) | 1996-08-22 | Paper |
On the relation between BDDs and FDDs
Information and Computation | 1996-03-19 | Paper |
Computations over finite monoids and their test complexity
Theoretical Computer Science | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 4181296 (Why is no real title available?) | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4176990 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4102994 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4057452 (Why is no real title available?) | 1988-01-01 | Paper |
How robust is the n-cube?
Information and Computation | 1988-01-01 | Paper |
On the Optimal Layout of Planar Graphs with Fixed Boundary
SIAM Journal on Computing | 1987-01-01 | Paper |
An easily testable optimal-time VLSI-multiplier
Acta Informatica | 1987-01-01 | Paper |
Layouts with wires of balanced length
Information and Computation | 1987-01-01 | Paper |
A logic-topological calculus for the construction of integrated circuits. I
Informatik. Forschung und Entwicklung | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3976938 (Why is no real title available?) | 1986-01-01 | Paper |
A logic-topological calculus for the construction of integrated circuits. II.
Informatik. Forschung und Entwicklung | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3906407 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3782398 (Why is no real title available?) | 1982-01-01 | Paper |
