Christoph Scholl

Publication Activity (10 Years)

Years Active: 1994-2022
Publications (10 Years): 30

Top Topics

Quantified Boolean Formulae

Quantifier Elimination

Top Venues

Sci. Comput. Program.

Publications

Tobias Seufert, Christoph Scholl, Arun Chandrasekharan, Sven Reimer, Tobias Welp
Making PROGRESS in Property Directed Reachability. VMCAI (2022)
Tobias Seufert, Felix Winterer, Christoph Scholl, Karsten Scheibler, Tobias Paxian, Bernd Becker
Everything You Always Wanted to Know About Generalization of Proof Obligations in PDR. CoRR (2021)
Karsten Scheibler, Felix Winterer, Tobias Seufert, Tino Teige, Christoph Scholl, Bernd Becker
ICP and IC3. DATE (2021)
Christoph Scholl, Alexander Konrad, Alireza Mahzoon, Daniel Große, Rolf Drechsler
Verifying Dividers Using Symbolic Computer Algebra and Don't Care Optimization. DATE (2021)
Christoph Scholl, Andreas Tobola, Klaus Ludwig, Dario Zanca, Bjoern M. Eskofier
A Smart Capacitive Sensor Skin with Embedded Data Quality Indication for Enhanced Safety in Human-Robot Interaction. Sensors 21 (21) (2021)
Christoph Scholl, Alexander Konrad
Symbolic Computer Algebra and SAT Based Information Forwarding for Fully Automatic Divider Verification. DAC (2020)
Alireza Mahzoon, Daniel Große, Christoph Scholl, Rolf Drechsler
Towards Formal Verification of Optimized and Industrial Multipliers. DATE (2020)
Aile Ge-Ernst, Christoph Scholl, Ralf Wimmer
Quantifier Localization for DQBF. CoRR (2019)
Christoph Scholl, Jie-Hong Roland Jiang, Ralf Wimmer, Aile Ge-Ernst
A PSPACE Subclass of Dependency Quantified Boolean Formulas and Its Effective Solving. AAAI (2019)
Aile Ge-Ernst, Christoph Scholl, Ralf Wimmer
Localizing Quantifiers for DQBF. FMCAD (2019)
Ralf Wimmer, Christoph Scholl, Bernd Becker
The (D)QBF Preprocessor HQSpre - Underlying Theory and Its Implementation. J. Satisf. Boolean Model. Comput. 11 (1) (2019)
Tobias Seufert, Christoph Scholl
fbPDR: In-depth combination of forward and backward analysis in Property Directed Reachability. DATE (2019)
Katalin Fazekas, Armin Biere, Christoph Scholl
Incremental Inprocessing in SAT Solving. SAT (2019)
Tobias Seufert, Christoph Scholl
Combining PDR and reverse PDR for hardware model checking. DATE (2018)
Christoph Scholl, Ralf Wimmer
Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications - Extended Abstract. SAT (2018)
Ralf Wimmer, Andreas Karrenbauer, Ruben Becker, Christoph Scholl, Bernd Becker
From DQBF to QBF by Dependency Elimination. MBMV (2018)
Ralf Wimmer, Andreas Karrenbauer, Ruben Becker, Christoph Scholl, Bernd Becker
From DQBF to QBF by Dependency Elimination. SAT (2017)
Tobias Seufert, Christoph Scholl
Sequential Verification Using Reverse PDR. MBMV (2017)
Ernst Althaus, Björn Beber, Werner Damm, Stefan Disch, Willem Hagemann, Astrid Rakow, Christoph Scholl, Uwe Waldmann, Boris Wirtz
Verification of linear hybrid systems with large discrete state spaces using counterexample-guided abstraction refinement. Sci. Comput. Program. 148 (2017)
Valeriy Balabanov, Jie-Hong Roland Jiang, Christoph Scholl, Alan Mishchenko, Robert K. Brayton
2QBF: Challenges and Solutions. SAT (2016)
Karina Wimmer, Ralf Wimmer, Christoph Scholl, Bernd Becker
Skolem Functions for DQBF. ATVA (2016)
Ralf Wimmer, Christoph Scholl, Karina Wimmer, Bernd Becker
Dependency Schemes for DQBF. SAT (2016)
Valeriy Balabanov, Jie-Hong Roland Jiang, Alan Mishchenko, Christoph Scholl
Clauses Versus Gates in CEGAR-Based 2QBF Solving. AAAI Workshop: Beyond NP (2016)
Christoph Scholl, Florian Pigorsch
The QBF Solver AIGSolve. QBF@SAT (2016)
Martin Böhnert, Christoph Scholl
Task Variants with Different Scratchpad Memory Consumption in Multi-Task Environments. ARCS (2016)
Bernd Becker, Matthias Sauer, Christoph Scholl, Ralf Wimmer
Modeling Unknown Values in Test and Verification. SyDe Summer School (2015)
Karina Gitina, Ralf Wimmer, Sven Reimer, Matthias Sauer, Christoph Scholl, Bernd Becker
Solving DQBF through quantifier elimination. DATE (2015)
Ernst Althaus, Björn Beber, Joschka Kupilas, Christoph Scholl
Improving Interpolants for Linear Arithmetic. ATVA (2015)
Georges Morbé, Christoph Scholl
Fully symbolic TCTL model checking for complete and incomplete real-time systems. Sci. Comput. Program. 111 (2015)
Ralf Wimmer, Karina Gitina, Jennifer Nist, Christoph Scholl, Bernd Becker
Preprocessing for DQBF. SAT (2015)
Georges Morbé, Christian Miller, Christoph Scholl, Bernd Becker
Combined Bounded and Symbolic Model Checking for Incomplete Timed Systems. Haifa Verification Conference (2014)
Christoph Scholl, Florian Pigorsch, Stefan Disch, Ernst Althaus
Simple interpolants for linear arithmetic. DATE (2014)
Martin Böhnert, Christoph Scholl
A dynamic virtual memory management under real-time constraints. RTCSA (2014)
Karina Gitina, Sven Reimer, Matthias Sauer, Ralf Wimmer, Christoph Scholl, Bernd Becker
Equivalence checking of partial designs using dependency quantified Boolean formulae. ICCD (2013)
Christian Miller, Christoph Scholl, Bernd Becker
Proving QBF-hardness in Bounded Model Checking for Incomplete Designs. MTV (2013)
Karina Gitina, Sven Reimer, Matthias Sauer, Ralf Wimmer, Christoph Scholl, Bernd Becker
Equivalence Checking for Partial Implementations Revisited. MBMV (2013)
Florian Pigorsch, Christoph Scholl
Lemma localization: a practical method for downsizing SMT-interpolants. DATE (2013)
Tobias Nopper, Christoph Scholl
Symbolic Model Checking for Incomplete Designs with Flexible Modeling of Unknowns. IEEE Trans. Computers 62 (6) (2013)
Georges Morbé, Christoph Scholl
Fully Symbolic TCTL Model Checking for Incomplete Timed Systems. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 66 (2013)
Georges Morbé, Christoph Scholl
Guaranteeing Termination of Fully Symbolic Timed Forward Model Checking. MTV (2012)
Sven Reimer, Florian Pigorsch, Christoph Scholl, Bernd Becker
Enhanced Integration of QBF Solving Techniques. MBMV (2012)
Werner Damm, Henning Dierks, Stefan Disch, Willem Hagemann, Florian Pigorsch, Christoph Scholl, Uwe Waldmann, Boris Wirtz
Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces. Sci. Comput. Program. 77 (10-11) (2012)
Georges Morbé, Christoph Scholl
Fully Symbolic Model Checking for Incomplete Systems of Timed Automata. MBMV (2012)
Christian Miller, Christoph Scholl, Bernd Becker
Verifying Incomplete Networks of Timed Automata. MBMV (2011)
Sven Reimer, Florian Pigorsch, Christoph Scholl, Bernd Becker
Integration of orthogonal QBF solving techniques. DATE (2011)
Georges Morbé, Christoph Scholl
Fully Symbolic Model Checking for Timed Automata. MBMV (2011)
Georges Morbé, Florian Pigorsch, Christoph Scholl
Fully Symbolic Model Checking for Timed Automata. CAV (2011)
Christian Miller, Karina Gitina, Christoph Scholl, Bernd Becker
Bounded Model Checking of Incomplete Networks of Timed Automata. MTV (2010)
Florian Pigorsch, Christoph Scholl
An AIG-Based QBF-solver using SAT for preprocessing. DAC (2010)
Thorsten Zitterell, Christoph Scholl
A probabilistic and energy-efficient scheduling approach for online application in real-time systems. DAC (2010)
Tobias Nopper, Christian Miller, Matthew Lewis, Bernd Becker, Christoph Scholl
SAT Modulo BDD -- A Combined Verification Approach for Incomplete Designs. MBMV (2010)
Florian Pigorsch, Christoph Scholl
Using Implications for Optimizing State Set Representations of Linear Hybrid Systems. MBMV (2009)
Christian Miller, Tobias Nopper, Christoph Scholl
Symbolic CTL Model Checking for Incomplete Designs by Selecting Property-Specific Subsets of Local Component Assumptions. MBMV (2009)
Christoph Scholl, Stefan Disch, Florian Pigorsch, Stefan Kupferschmid
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints. TACAS (2009)
Florian Pigorsch, Christoph Scholl
Exploiting structure in an AIG based QBF solver. DATE (2009)
Martin Böhnert, Thorsten Zitterell, Christoph Scholl
Dynamische Verwaltung Virtuellen Speichers für Echtzeitsysteme. Echtzeit (2008)
Thorsten Zitterell, Christoph Scholl
Improving energy-efficient real-time scheduling by exploiting code instrumentation. IMCSIT (2008)
Stefan Disch, Christoph Scholl
Combinational Equivalence Checking Using Incremental SAT Solving, Output Ordering, and Resets. ASP-DAC (2007)
Tobias Nopper, Christoph Scholl
Counterexample Generation for Incomplete Designs. MBMV (2007)
Werner Damm, Stefan Disch, Hardi Hungar, Swen Jacobs, Jun Pang, Florian Pigorsch, Christoph Scholl, Uwe Waldmann, Boris Wirtz
Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space. ATVA (2007)
Tobias Nopper, Christoph Scholl, Bernd Becker
Computation of minimal counterexamples by using black box techniques and symbolic methods. ICCAD (2007)
Axel Rottmann, Matthias Sippel, Thorsten Zitterell, Wolfram Burgard, Leonhard M. Reindl, Christoph Scholl
Towards an Experimental Autonomous Blimp Platform. EMCR (2007)
Werner Damm, Stefan Disch, Hardi Hungar, Jun Pang, Florian Pigorsch, Christoph Scholl, Uwe Waldmann, Boris Wirtz
Automatic Verification of Hybrid Systems with Large Discrete State Space. ATVA (2006)
Florian Pigorsch, Christoph Scholl, Stefan Disch
Advanced Unbounded Model Checking Based on AIGs, BDD Sweeping, And Quantifier Scheduling. FMCAD (2006)
Marc Herbstritt, Bernd Becker, Christoph Scholl
Advanced SAT-Techniques for Bounded Model Checking of Blackbox Designs. MTV (2006)
Florian Pigorsch, Christoph Scholl, Stefan Disch
Advanced Unbounded CTL Model Checking By Using AIGs, BDD Sweeping, and Quantifier Scheduling. MBMV (2006)
Tobias Nopper, Christoph Scholl
Approximate Symbolic Model Checking for Incomplete Designs. FMCAD (2004)
Christoph Scholl, Matthias Büche
Filter Based Diagnosis for Multiple Design Errors. MBMV (2004)
Christoph Scholl, Bernd Becker, Thomas M. Weis
On WLCDs and the Complexity of Word-Level Decision Diagrams-A Lower Bound for Division. Formal Methods Syst. Des. 20 (3) (2002)
Christoph Scholl, Bernd Becker
Checking Equivalence for Circuits Containing Incompletely Specified Boxes. ICCD (2002)
Christoph Scholl, Bernd Becker
Equivalence Checking in the Presence of Incompletely Specified Boxes. MBMV (2002)
Christoph Scholl, Marc Herbstritt, Bernd Becker
Don't Care Minimization of BMDs: Complexity and Algorithms. MBMV (1) (2001)
Christoph Scholl, Bernd Becker
Checking Equivalence for Partial Implementations. DAC (2001)
Christoph Scholl, Marc Herbstritt, Bernd Becker
Exploiting don't cares to minimize *BMDs. ISCAS (5) (2001)
Christoph Scholl, Bernd Becker, Andreas Brogle
The multiple variable order problem for binary decision diagrams: theory and practical application. ASP-DAC (2001)
Christoph Scholl, Bernd Becker
Checking Equivalence for Partial Implementations. MBMV (1) (2001)
Andreas Hett, Christoph Scholl, Bernd Becker
Distance driven finite state machine traversal. DAC (2000)
Christoph Scholl, Bernd Becker
On the Generation of Multiplexer Circuits for Pass Transistor Logic. DATE (2000)
Andreas Hett, Christoph Scholl, Bernd Becker
State Traversal guided by Hamming Distance Profiles. MBMV (2000)
Christoph Scholl, Dirk Möller, Paul Molitor, Rolf Drechsler
BDD minimization using symmetries. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18 (2) (1999)
Christoph Scholl, Bernd Becker, Thomas M. Weis
Word-level decision diagrams, WLCDs and division. ICCAD (1998)
Christoph Scholl
Multi-output Functional Decomposition with Exploitation of Don't Cares. DATE (1998)
Christoph Scholl, Rolf Drechsler, Bernd Becker
Functional simulation using binary decision diagrams. ICCAD (1997)
Christoph Scholl, S. Melchior, Günter Hotz, Paul Molitor
Minimizing ROBDD sizes of incompletely specified Boolean functionsby exploiting strong symmetries. ED&TC (1997)
Christoph Scholl, Paul Molitor
Communication based FPGA synthesis for multi-output Boolean functions. ASP-DAC (1995)
Paul Molitor, Christoph Scholl
Communication based multilevel synthesis for multi-output Boolean functions. Great Lakes Symposium on VLSI (1994)