Christoph Scholl

Bernd Becker, Christoph Scholl, Thomas M. Weis, 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

Fully Symbolic TCTL Model Checking for Incomplete Timed Systems

Christoph Scholl, Georges Morbé, 2013, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

Checking equivalence for partial implementations

Bernd Becker, Christoph Scholl, 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

Modular Optical Sensor System for Fluidic Online Analysis Applications

Christoph Scholl, Philipp Hartmann, M. K. Garbos, 2015 .

Symbolic CTL Model Checking for Incomplete Designs by Selecting Property-Specific Subsets of Local Component Assumptions

Christoph Scholl, Tobias Nopper, Christian Miller, 2009, MBMV.

Verifying Incomplete Networks of Timed Automata

Bernd Becker, Christoph Scholl, Christian Miller, 2011, MBMV.

Improving Interpolants for Linear Arithmetic

Ernst Althaus, Christoph Scholl, Björn Beber, 2015, ATVA.

BDD minimization using symmetries

Rolf Drechsler, Christoph Scholl, Paul Molitor, 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

Advanced SAT-Techniques for Bounded Model Checking of Blackbox Designs

Bernd Becker, Christoph Scholl, Marc Herbstritt, 2006, Seventh International Workshop on Microprocessor Test and Verification (MTV'06).

Localizing Quantifiers for DQBF

Christoph Scholl, Ralf Wimmer, Aile Ge-Ernst, 2019, 2019 Formal Methods in Computer Aided Design (FMCAD).

Filter Based Diagnosis for Multiple Design Errors

Christoph Scholl, Matthias Büche, Matthias Büche, 2004, MBMV.

Preprocessing for DQBF

Bernd Becker, Christoph Scholl, Ralf Wimmer, 2015, SAT.

Dependency Schemes for DQBF

Bernd Becker, Christoph Scholl, Ralf Wimmer, 2016, SAT.

The (D)QBF Preprocessor HQSpre - Underlying Theory and Its Implementation

Christoph Scholl, Bernd Becker, Ralf Wimmer, 2019, J. Satisf. Boolean Model. Comput..

Automatic Verification of Hybrid Systems with Large Discrete State Space

Hardi Hungar, Jun Pang, Christoph Scholl, 2006, ATVA.

Don't Care Minimization of BMDs: Complexity and Algorithms

Bernd Becker, Christoph Scholl, Marc Herbstritt, 2001, MBMV.

Exploiting don't cares to minimize *BMDs

Bernd Becker, Christoph Scholl, Marc Herbstritt, 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).

Proving QBF-hardness in Bounded Model Checking for Incomplete Designs

Bernd Becker, Christoph Scholl, Christian Miller, 2013, 2013 14th International Workshop on Microprocessor Test and Verification.

Fully Symbolic Model Checking for Incomplete Systems of Timed Automata

Christoph Scholl, Georges Morbé, Georges Morbé, 2012, MBMV.

Counterexample Generation for Incomplete Designs

Christoph Scholl, Tobias Nopper, Tobias Nopper, 2007, MBMV.

Sequential Verification Using Reverse PDR

Christoph Scholl, Tobias Seufert, 2017, MBMV.

From DQBF to QBF by Dependency Elimination

Bernd Becker, Christoph Scholl, Ralf Wimmer, 2017, SAT.

The QBF Solver AIGSolve

Christoph Scholl, Florian Pigorsch, 2016, QBF@SAT.

State Traversal guided by Hamming Distance Profiles

Bernd Becker, Christoph Scholl, Andreas Hett, 2000, MBMV.

On the generation of multiplexer circuits for pass transistor logic

Bernd Becker, Christoph Scholl, 2000, DATE '00.

Multi-output functional decomposition with exploitation of don't cares

Christoph Scholl, 1998, Proceedings Design, Automation and Test in Europe.

Communication based FPGA synthesis for multi-output Boolean functions

Christoph Scholl, Paul Molitor, C. Scholl, 1995, ASP-DAC '95.

Functional simulation using binary decision diagrams

Rolf Drechsler, Bernd Becker, Christoph Scholl, 1997, ICCAD 1997.

Checking equivalence for circuits containing incompletely specified boxes

Bernd Becker, Christoph Scholl, 2002, Proceedings. IEEE International Conference on Computer Design: VLSI in Computers and Processors.

Fully Symbolic Model Checking for Timed Automata

Christoph Scholl, Georges Morbé, 2011, MBMV.

Incremental Inprocessing in SAT Solving

Armin Biere, Christoph Scholl, Katalin Fazekas, 2019, SAT.

Towards an Experimental Autonomous Blimp Platform

Wolfram Burgard, Christoph Scholl, Axel Rottmann, 2007, EMCR.

Task Variants with Different Scratchpad Memory Consumption in Multi-Task Environments

Christoph Scholl, Martin Böhnert, 2016, ARCS.

An AIG-based QBF-solver using SAT for preprocessing

Christoph Scholl, Florian Pigorsch, 2010, Design Automation Conference.

Combinational Equivalence Checking Using Incremental SAT Solving, Output Ordering, and Resets

Christoph Scholl, Stefan Disch, Stefan Disch, 2007, 2007 Asia and South Pacific Design Automation Conference.

Symbolic Model Checking for Incomplete Designs

Christoph Scholl, Tobias Nopper, Tobias Nopper, 2004 .

Advanced Unbounded Model Checking Based on AIGs, BDD Sweeping, And Quantifier Scheduling

Christoph Scholl, Stefan Disch, Florian Pigorsch, 2006, 2006 Formal Methods in Computer Aided Design.

Clauses Versus Gates in CEGAR-Based 2QBF Solving

Jie-Hong Roland Jiang, Alan Mishchenko, Christoph Scholl, 2016, AAAI Workshop: Beyond NP.

SAT Modulo BDD -- A Combined Verification Approach for Incomplete Designs

Bernd Becker, Matthew D. T. Lewis, Christoph Scholl, 2010, MBMV.

Equivalence Checking in the Presence of Incompletely Specified Boxes

Bernd Becker, Christoph Scholl, 2002, MBMV.

Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints

Christoph Scholl, Stefan Kupferschmid, Stefan Disch, 2009, TACAS.

Lemma localization: A practical method for downsizing SMT-interpolants

Christoph Scholl, Florian Pigorsch, 2013, 2013 Design, Automation & Test in Europe Conference & Exhibition (DATE).

On WLCDs and the Complexity of Word-Level Decision Diagrams—A Lower Bound for Division

Christoph Scholl, Bernd Becker, Thomas M. Weis, 2002, Formal Methods Syst. Des..

Improving energy-efficient real-time scheduling by exploiting code instrumentation

Christoph Scholl, Thorsten Zitterell, 2008, 2008 International Multiconference on Computer Science and Information Technology.

Computation of minimal counterexamples by using black box techniques and symbolic methods

Bernd Becker, Christoph Scholl, Tobias Nopper, 2007, ICCAD 2007.

The multiple variable order problem for binary decision diagrams: theory and practical application

Bernd Becker, Christoph Scholl, Andreas Brogle, 2001, ASP-DAC '01.

Functional decomposition with applications to FPGA synthesis

Christoph Scholl, 2001 .

Quantifier Localization for DQBF pdf

Christoph Scholl, Ralf Wimmer, Aile Ge-Ernst, 2019, ArXiv.

A PSPACE Subclass of Dependency Quantified Boolean Formulas and Its Effective Solving

Jie-Hong Roland Jiang, Christoph Scholl, Ralf Wimmer, 2019, AAAI.

Symbolic Computer Algebra and SAT Based Information Forwarding for Fully Automatic Divider Verification

Christoph Scholl, Alexander Konrad, 2020, 2020 57th ACM/IEEE Design Automation Conference (DAC).

Solving DQBF through quantifier elimination

Bernd Becker, Matthias Sauer, Christoph Scholl, 2015, 2015 Design, Automation & Test in Europe Conference & Exhibition (DATE).

Distance driven finite state machine traversal

Bernd Becker, Christoph Scholl, Andreas Hett, 2000, Proceedings 37th Design Automation Conference.

Realizations of Boolean Functions

Christoph Scholl, 2001 .

Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces

Henning Dierks, Christoph Scholl, Werner Damm, 2012, Sci. Comput. Program..

Functional Decomposition for Incompletely Specified Functions

Christoph Scholl, 2001 .

Verification of linear hybrid systems with large discrete state spaces using counterexample-guided abstraction refinement

Ernst Althaus, Christoph Scholl, Werner Damm, 2017, Sci. Comput. Program..

fbPDR: In-depth combination of forward and backward analysis in Property Directed Reachability

Christoph Scholl, Tobias Seufert, 2019, 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE).

Analysis of Incomplete Circuits Using Dependency Quantified Boolean Formulas

Bernd Becker, Christoph Scholl, Ralf Wimmer, 2018, Advanced Logic Synthesis.

Advanced Unbounded CTL Model Checking By Using AIGs, BDD Sweeping, and Quantifier Scheduling

Christoph Scholl, Stefan Disch, Florian Pigorsch, 2006, MBMV.

Bounded Model Checking of Incomplete Networks of Timed Automata

Bernd Becker, Christoph Scholl, Christian Miller, 2010, 2010 11th International Workshop on Microprocessor Test and Verification.

Functional simulation using binary decision diagrams

Rolf Drechsler, Bernd Becker, Christoph Scholl, 1997, 1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

Exploiting structure in an AIG based QBF solver

Christoph Scholl, Florian Pigorsch, 2009, 2009 Design, Automation & Test in Europe Conference & Exhibition.

Mehrstufige Logiksynthese unter Ausnutzung funktionaler Eigenschaften

Christoph Scholl, 1996 .

Guaranteeing Termination of Fully Symbolic Timed Forward Model Checking

Christoph Scholl, Georges Morbé, 2012, 2012 13th International Workshop on Microprocessor Test and Verification (MTV).

Datenstrukturen und effiziente Algorithmen für die Logiksynthese kombinatorischer Schaltungen

Christoph Scholl, Paul Molitor, P. Molitor, 1999 .

Approximate Symbolic Model Checking for Incomplete Designs

Christoph Scholl, Tobias Nopper, Tobias Nopper, 2004, FMCAD.

Modeling Unknown Values in Test and Verification

Bernd Becker, Matthias Sauer, Christoph Scholl, 2015, SyDe Summer School.

Integration of orthogonal QBF solving techniques

Bernd Becker, Christoph Scholl, Florian Pigorsch, 2011, 2011 Design, Automation & Test in Europe.

Equivalence Checking for Partial Implementations Revisited

Bernd Becker, Matthias Sauer, Christoph Scholl, 2013, MBMV.

Minimization of BDDs

Christoph Scholl, 2001 .

Towards Formal Verification of Optimized and Industrial Multipliers

Rolf Drechsler, Christoph Scholl, Daniel Große, 2020, 2020 Design, Automation & Test in Europe Conference & Exhibition (DATE).

Symbolic Model Checking for Incomplete Designs with Flexible Modeling of Unknowns

Christoph Scholl, Tobias Nopper, Tobias Nopper, 2013, IEEE Transactions on Computers.

Simple interpolants for linear arithmetic

Ernst Althaus, Christoph Scholl, Stefan Disch, 2014, 2014 Design, Automation & Test in Europe Conference & Exhibition (DATE).

Combining PDR and reverse PDR for hardware model checking

Christoph Scholl, Tobias Seufert, 2018, 2018 Design, Automation & Test in Europe Conference & Exhibition (DATE).

Minimizing ROBDD sizes of incompletely specified functions by exploiting strong symmetries

Christoph Scholl, 1997 .

Combined Bounded and Symbolic Model Checking for Incomplete Timed Systems

Bernd Becker, Christoph Scholl, Georges Morbé, 2014, Haifa Verification Conference.

Equivalence checking of partial designs using dependency quantified Boolean formulae

Bernd Becker, Matthias Sauer, Christoph Scholl, 2013, 2013 IEEE 31st International Conference on Computer Design (ICCD).

ICP and IC3 with Stronger Generalization

Bernd Becker, Christoph Scholl, Tino Teige, 2021 .

ICP and IC3

Bernd Becker, Christoph Scholl, Tino Teige, 2021, 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE).

Everything You Always Wanted to Know About Generalization of Proof Obligations in PDR pdf

Bernd Becker, Christoph Scholl, Karsten Scheibler, 2021, ArXiv.

Verifying Dividers Using Symbolic Computer Algebra and Don't Care Optimization

Rolf Drechsler, Daniel Große, Christoph Scholl, 2021, 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE).

2 QBF : Challenges and Solutions

Robert K. Brayton, Jie-Hong Roland Jiang, Alan Mishchenko, 2016 .

Efficient ROBDD based computation of common decomposition functions of multi-output boolean functions

Christoph Scholl, Paul Molitor, 1995 .

Solving the Multiple Variable Order Problem for Binary Decision Diagrams by Use of Dynamic Reordering Techniques

Bernd Becker, Christoph Scholl, B. Becker, 1999 .

Using an SMT solver and Craig interpolation to detect and remove redundant linear constraints in representations of non-convex polyhedra

Christoph Scholl, Stefan Kupferschmid, Stefan Disch, 2008, SMT '08/BPR '08.