Christoph Scholl

Tobias Nopper, Christoph Scholl: Symbolic Model Checking for Incomplete Designs with Flexible Modeling of Unknowns. IEEE Trans. Computers 62(6): 1234-1254 (2013)

Florian Pigorsch, Christoph Scholl: Lemma localization: a practical method for downsizing SMT-interpolants. DATE 2013: 1405-1410

Karina Gitina, Sven Reimer, Matthias Sauer, Ralf Wimmer, Christoph Scholl, Bernd Becker: Equivalence Checking for Partial Implementations Revisited. MBMV 2013: 61-70

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): 1122-1150 (2012)

Georges Morbé, Christoph Scholl: Fully Symbolic Model Checking for Incomplete Systems of Timed Automata. MBMV 2012: 97-108

Sven Reimer, Florian Pigorsch, Christoph Scholl, Bernd Becker: Enhanced Integration of QBF Solving Techniques. MBMV 2012: 133-143

Georges Morbé, Florian Pigorsch, Christoph Scholl: Fully Symbolic Model Checking for Timed Automata. CAV 2011: 616-632

Sven Reimer, Florian Pigorsch, Christoph Scholl, Bernd Becker: Integration of orthogonal QBF solving techniques. DATE 2011: 149-154

Georges Morbé, Christoph Scholl: Fully Symbolic Model Checking for Timed Automata. MBMV 2011: 9-18

Christian Miller, Christoph Scholl, Bernd Becker: Verifying Incomplete Networks of Timed Automata. MBMV 2011: 113-122

Thorsten Zitterell, Christoph Scholl: A probabilistic and energy-efficient scheduling approach for online application in real-time systems. DAC 2010: 42-47

Florian Pigorsch, Christoph Scholl: An AIG-Based QBF-solver using SAT for preprocessing. DAC 2010: 170-175

Tobias Nopper, Christian Miller, Matthew D. T. Lewis, Bernd Becker, Christoph Scholl: SAT Modulo BDD -- A Combined Verification Approach for Incomplete Designs. MBMV 2010: 107-116

Christian Miller, Karina Gitina, Christoph Scholl, Bernd Becker: Bounded Model Checking of Incomplete Networks of Timed Automata. MTV 2010: 61-66

Florian Pigorsch, Christoph Scholl: Exploiting structure in an AIG based QBF solver. DATE 2009: 1596-1601

Florian Pigorsch, Christoph Scholl: Using Implications for Optimizing State Set Representations of Linear Hybrid Systems. MBMV 2009: 77-86

Christian Miller, Tobias Nopper, Christoph Scholl: Symbolic CTL Model Checking for Incomplete Designs by Selecting Property-Specific Subsets of Local Component Assumptions. MBMV 2009: 87-96

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: 383-397

Thorsten Zitterell, Christoph Scholl: Improving energy-efficient real-time scheduling by exploiting code instrumentation. IMCSIT 2008: 763-771

Martin Böhnert, Thorsten Zitterell, Christoph Scholl: Dynamische Verwaltung Virtuellen Speichers für Echtzeitsysteme. Echtzeit 2008: 101-110

Christoph Scholl, Stefan Disch (Eds.): Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV), Freiburg, Germany, March 3-5, 2008. Shaker 2008

Stefan Disch, Christoph Scholl: Combinational Equivalence Checking Using Incremental SAT Solving, Output Ordering, and Resets. ASP-DAC 2007: 938-943

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: 425-440

Axel Rottmann, Matthias Sippel, Thorsten Zitterell, Wolfram Burgard, Leonhard M. Reindl, Christoph Scholl: Towards an Experimental Autonomous Blimp Platform. EMCR 2007

Tobias Nopper, Christoph Scholl, Bernd Becker: Computation of minimal counterexamples by using black box techniques and symbolic methods. ICCAD 2007: 273-280

Tobias Nopper, Christoph Scholl: Counterexample Generation for Incomplete Designs. MBMV 2007: 193-202

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: 276-291

Florian Pigorsch, Christoph Scholl, Stefan Disch: Advanced Unbounded Model Checking Based on AIGs, BDD Sweeping, And Quantifier Scheduling. FMCAD 2006: 89-96

Florian Pigorsch, Christoph Scholl, Stefan Disch: Advanced Unbounded CTL Model Checking By Using AIGs, BDD Sweeping, and Quantifier Scheduling. MBMV 2006: 135-144

Marc Herbstritt, Bernd Becker, Christoph Scholl: Advanced SAT-Techniques for Bounded Model Checking of Blackbox Designs. MTV 2006: 37-44

Tobias Nopper, Christoph Scholl: Approximate Symbolic Model Checking for Incomplete Designs. FMCAD 2004: 290-305

Christoph Scholl, Matthias Büche: Filter Based Diagnosis for Multiple Design Errors. MBMV 2004: 270-279

Christoph Scholl, Bernd Becker, Thomas M. Weis: On WLCDs and the Complexity of Word-Level Decision Diagrams-A Lower Bound for Division. Formal Methods in System Design 20(3): 311-326 (2002)

Christoph Scholl, Bernd Becker: Checking Equivalence for Circuits Containing Incompletely Specified Boxes. ICCD 2002: 56-63

Christoph Scholl, Bernd Becker: Equivalence Checking in the Presence of Incompletely Specified Boxes. MBMV 2002: 239-248

Christoph Scholl: Functional decomposition with applications to FPGA synthesis. Kluwer 2001, isbn 978-0-7923-7585-2, pp. I-XXIII, 1-263

Christoph Scholl, Bernd Becker, Andreas Brogle: The multiple variable order problem for binary decision diagrams: theory and practical application. ASP-DAC 2001: 85-90

Christoph Scholl, Bernd Becker: Checking Equivalence for Partial Implementations. DAC 2001: 238-243

Christoph Scholl, Marc Herbstritt, Bernd Becker: Exploiting don't cares to minimize *BMDs. ISCAS (5) 2001: 191-194

Christoph Scholl, Bernd Becker: Checking Equivalence for Partial Implementations. MBMV (1) 2001: 31-43

Christoph Scholl, Marc Herbstritt, Bernd Becker: Don't Care Minimization of BMDs: Complexity and Algorithms. MBMV (1) 2001: 45-57

Andreas Hett, Christoph Scholl, Bernd Becker: Distance driven finite state machine traversal. DAC 2000: 39-42

Christoph Scholl, Bernd Becker: On the Generation of Multiplexer Circuits for Pass Transistor Logic. DATE 2000: 372-378

Andreas Hett, Christoph Scholl, Bernd Becker: State Traversal guided by Hamming Distance Profiles. MBMV 2000: 57-66

Paul Molitor, Christoph Scholl: Datenstrukturen und effiziente Algorithmen für die Logiksynthese kombinatorischer Schaltungen. Teubner 1999, isbn 978-3-519-02945-8, pp. 1-298

Christoph Scholl, Dirk Möller, Paul Molitor, Rolf Drechsler: BDD minimization using symmetries. IEEE Trans. on CAD of Integrated Circuits and Systems 18(2): 81-100 (1999)

Christoph Scholl: Multi-output Functional Decomposition with Exploitation of Don't Cares. DATE 1998: 743-748

Christoph Scholl, Bernd Becker, Thomas M. Weis: Word-level decision diagrams, WLCDs and division. ICCAD 1998: 672-677

Christoph Scholl, S. Melchior, Günter Hotz, Paul Molitor: Minimizing ROBDD sizes of incompletely specified Boolean functionsby exploiting strong symmetries. ED&TC 1997: 229-234

Christoph Scholl, Rolf Drechsler, Bernd Becker: Functional simulation using binary decision diagrams. ICCAD 1997: 8-12

Christoph Scholl, Paul Molitor: Communication based FPGA synthesis for multi-output Boolean functions. ASP-DAC 1995