| 2025 | FMCAD | FastPoly: An Efficient Polynomial Package for the Verification of Integer Arithmetic Circuits. | Alexander Konrad, Christoph Scholl |
| 2024 | FMCAD | Symbolic Computer Algebra for Multipliers Revisited - It's All About Orders and Phases. | Alexander Konrad, Christoph Scholl |
| 2024 | SAT | Hierarchical Stochastic SAT and Quality Assessment of Logic Locking. | Christoph Scholl, Tobias Seufert, Fabian Siegwolf |
| 2022 | DAC | Formal verification of modular multipliers using symbolic computer algebra and boolean satisfiability. | Alireza Mahzoon, Daniel Groe, Christoph Scholl, Alexander Konrad, Rolf Drechsler |
| 2022 | FMCAD | Divider Verification Using Symbolic Computer Algebra and Delayed Don't Care Optimization. | Alexander Konrad, Christoph Scholl, Alireza Mahzoon, Daniel Groe, Rolf Drechsler |
| 2022 | SAT | Quantifier Elimination in Stochastic Boolean Satisfiability. | Hao-Ren Wang, Kuan-Hua Tu, Jie-Hong Roland Jiang, Christoph Scholl |
| 2022 | VMCAI | Making PROGRESS in Property Directed Reachability. | Tobias Seufert, Christoph Scholl, Arun Chandrasekharan, Sven Reimer, Tobias Welp |
| 2021 | DATE | ICP and IC3. | Karsten Scheibler, Felix Winterer, Tobias Seufert, Tino Teige, Christoph Scholl, Bernd Becker |
| 2021 | DATE | Verifying Dividers Using Symbolic Computer Algebra and Don't Care Optimization. | Christoph Scholl, Alexander Konrad, Alireza Mahzoon, Daniel Groe, Rolf Drechsler |
| 2020 | DAC | Symbolic Computer Algebra and SAT Based Information Forwarding for Fully Automatic Divider Verification. | Christoph Scholl, Alexander Konrad |
| 2020 | DATE | Towards Formal Verification of Optimized and Industrial Multipliers. | Alireza Mahzoon, Daniel Groe, Christoph Scholl, Rolf Drechsler |
| 2019 | AAAI | A PSPACE Subclass of Dependency Quantified Boolean Formulas and Its Effective Solving. | Christoph Scholl, Jie-Hong Roland Jiang, Ralf Wimmer, Aile Ge-Ernst |
| 2019 | DATE | fbPDR: In-depth combination of forward and backward analysis in Property Directed Reachability. | Tobias Seufert, Christoph Scholl |
| 2019 | FMCAD | Localizing Quantifiers for DQBF. | Aile Ge-Ernst, Christoph Scholl, Ralf Wimmer |
| 2019 | SAT | Incremental Inprocessing in SAT Solving. | Katalin Fazekas, Armin Biere, Christoph Scholl |
| 2018 | DATE | Combining PDR and reverse PDR for hardware model checking. | Tobias Seufert, Christoph Scholl |
| 2018 | SAT | Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications - Extended Abstract. | Christoph Scholl, Ralf Wimmer |
| 2017 | SAT | From DQBF to QBF by Dependency Elimination. | Ralf Wimmer, Andreas Karrenbauer, Ruben Becker, Christoph Scholl, Bernd Becker |
| 2016 | AAAI | Clauses Versus Gates in CEGAR-Based 2QBF Solving. | Valeriy Balabanov, Jie-Hong Roland Jiang, Alan Mishchenko, Christoph Scholl |
| 2016 | ATVA | Skolem Functions for DQBF. | Karina Wimmer, Ralf Wimmer, Christoph Scholl, Bernd Becker |
| 2016 | SAT | 2QBF: Challenges and Solutions. | Valeriy Balabanov, Jie-Hong Roland Jiang, Christoph Scholl, Alan Mishchenko, Robert K. Brayton |
| 2016 | SAT | The QBF Solver AIGSolve. | Christoph Scholl, Florian Pigorsch |
| 2016 | SAT | Dependency Schemes for DQBF. | Ralf Wimmer, Christoph Scholl, Karina Wimmer, Bernd Becker |
| 2015 | ATVA | Improving Interpolants for Linear Arithmetic. | Ernst Althaus, Bjrn Beber, Joschka Kupilas, Christoph Scholl |
| 2015 | DATE | Solving DQBF through quantifier elimination. | Karina Gitina, Ralf Wimmer, Sven Reimer, Matthias Sauer, Christoph Scholl, Bernd Becker |
| 2015 | SAT | Preprocessing for DQBF. | Ralf Wimmer, Karina Gitina, Jennifer Nist, Christoph Scholl, Bernd Becker |
| 2014 | DATE | Simple interpolants for linear arithmetic. | Christoph Scholl, Florian Pigorsch, Stefan Disch, Ernst Althaus |
| 2014 | RTCSA | A dynamic virtual memory management under real-time constraints. | Martin Bhnert, Christoph Scholl |
| 2013 | DATE | Lemma localization: a practical method for downsizing SMT-interpolants. | Florian Pigorsch, Christoph Scholl |
| 2013 | ICCD | Equivalence checking of partial designs using dependency quantified Boolean formulae. | Karina Gitina, Sven Reimer, Matthias Sauer, Ralf Wimmer, Christoph Scholl, Bernd Becker |
| 2011 | CAV | Fully Symbolic Model Checking for Timed Automata. | Georges Morb, Florian Pigorsch, Christoph Scholl |
| 2011 | DATE | Integration of orthogonal QBF solving techniques. | Sven Reimer, Florian Pigorsch, Christoph Scholl, Bernd Becker |
| 2010 | DAC | An AIG-Based QBF-solver using SAT for preprocessing. | Florian Pigorsch, Christoph Scholl |
| 2010 | DAC | A probabilistic and energy-efficient scheduling approach for online application in real-time systems. | Thorsten Zitterell, Christoph Scholl |
| 2009 | DATE | Exploiting structure in an AIG based QBF solver. | Florian Pigorsch, Christoph Scholl |
| 2009 | TACAS | Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints. | Christoph Scholl, Stefan Disch, Florian Pigorsch, Stefan Kupferschmid |
| 2007 | ASPDAC | Combinational Equivalence Checking Using Incremental SAT Solving, Output Ordering, and Resets. | Stefan Disch, Christoph Scholl |
| 2007 | ATVA | Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space. | Werner Damm, Stefan Disch, Hardi Hungar, Swen Jacobs, Jun Pang, Florian Pigorsch, Christoph Scholl, Uwe Waldmann, Boris Wirtz |
| 2007 | ICCAD | Computation of minimal counterexamples by using black box techniques and symbolic methods. | Tobias Nopper, Christoph Scholl, Bernd Becker |
| 2006 | ATVA | Automatic Verification of Hybrid Systems with Large Discrete State Space. | Werner Damm, Stefan Disch, Hardi Hungar, Jun Pang, Florian Pigorsch, Christoph Scholl, Uwe Waldmann, Boris Wirtz |
| 2006 | FMCAD | Advanced Unbounded Model Checking Based on AIGs, BDD Sweeping, And Quantifier Scheduling. | Florian Pigorsch, Christoph Scholl, Stefan Disch |
| 2004 | FMCAD | Approximate Symbolic Model Checking for Incomplete Designs. | Tobias Nopper, Christoph Scholl |
| 2002 | ICCD | Checking Equivalence for Circuits Containing Incompletely Specified Boxes. | Christoph Scholl, Bernd Becker |
| 2001 | ASPDAC | The multiple variable order problem for binary decision diagrams: theory and practical application. | Christoph Scholl, Bernd Becker, Andreas Brogle |
| 2001 | DAC | Checking Equivalence for Partial Implementations. | Christoph Scholl, Bernd Becker |
| 2001 | ISCAS | Exploiting don't cares to minimize *BMDs. | Christoph Scholl, Marc Herbstritt, Bernd Becker |
| 2000 | DAC | Distance driven finite state machine traversal. | Andreas Hett, Christoph Scholl, Bernd Becker |
| 2000 | DATE | On the Generation of Multiplexer Circuits for Pass Transistor Logic. | Christoph Scholl, Bernd Becker |
| 1998 | DATE | Multi-output Functional Decomposition with Exploitation of Don't Cares. | Christoph Scholl |
| 1998 | ICCAD | Word-level decision diagrams, WLCDs and division. | Christoph Scholl, Bernd Becker, Thomas M. Weis |
| 1997 | DATE | Minimizing ROBDD sizes of incompletely specified Boolean functionsby exploiting strong symmetries. | Christoph Scholl, S. Melchior, Gnter Hotz, Paul Molitor |
| 1997 | ICCAD | Functional simulation using binary decision diagrams. | Christoph Scholl, Rolf Drechsler, Bernd Becker |
| 1995 | ASPDAC | Communication based FPGA synthesis for multi-output Boolean functions. | Christoph Scholl, Paul Molitor |