Name
Affiliation
Papers
CHRISTOPH SCHOLL
Albert-Ludwigs-Universitat Freiburg, Institut fur Informatik, Germany
62
Collaborators
Citations 
PageRank 
68
346
32.07
Referers 
Referees 
References 
401
831
854
Search Limit
100831
Title
Citations
PageRank
Year
ICP and IC3.00.342021
Verifying Dividers Using Symbolic Computer Algebra and Don't Care Optimization.00.342021
Towards Formal Verification of Optimized and Industrial Multipliers10.362020
Quantifier Localization for DQBF.00.342019
The (D)QBF Preprocessor HQSpre - Underlying Theory and Its Implementation.00.342019
Localizing Quantifiers for DQBF00.342019
Incremental Inprocessing in SAT Solving.00.342019
Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications - Extended Abstract.00.342018
Sequential Verification Using Reverse PDR.00.342017
From DQBF to QBF by Dependency Elimination.20.362017
Dependency Schemes for DQBF.30.372016
Clauses Versus Gates in CEGAR-Based 2QBF Solving.20.362016
2QBF: Challenges and Solutions.30.402016
The QBF Solver AIGSolve.20.362016
Task Variants with Different Scratchpad Memory Consumption in Multi-Task Environments.00.342016
Skolem Functions for DQBF.20.392016
Preprocessing for DQBF80.512015
Improving Interpolants for Linear Arithmetic.10.352015
Fully symbolic TCTL model checking for complete and incomplete real-time systems20.372015
Modeling Unknown Values in Test and Verification00.342015
Solving DQBF through quantifier elimination110.492015
Combined Bounded and Symbolic Model Checking for Incomplete Timed Systems.00.342014
A dynamic virtual memory management under real-time constraints10.362014
Simple interpolants for linear arithmetic40.462014
Symbolic Model Checking for Incomplete Designs with Flexible Modeling of Unknowns40.412013
Proving QBF-hardness in Bounded Model Checking for Incomplete Designs40.402013
Lemma localization: a practical method for downsizing SMT-interpolants30.382013
Fully Symbolic TCTL Model Checking for Incomplete Timed Systems.10.352013
Equivalence Checking for Partial Implementations Revisited.20.392013
Fully Symbolic Model Checking for Incomplete Systems of Timed Automata.00.342012
Enhanced Integration of QBF Solving Techniques.40.402012
Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces160.622012
Verifying Incomplete Networks of Timed Automata.30.402011
Fully symbolic model checking for timed automata100.542011
Bounded Model Checking of Incomplete Networks of Timed Automata80.532010
A probabilistic and energy-efficient scheduling approach for online application in real-time systems60.522010
SAT Modulo BDD -- A Combined Verification Approach for Incomplete Designs.00.342010
An AIG-Based QBF-solver using SAT for preprocessing210.822010
Exploiting structure in an AIG based QBF solver140.682009
Using Implications for Optimizing State Set Representations of Linear Hybrid Systems.20.382009
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints141.312009
Symbolic CTL Model Checking for Incomplete Designs by Selecting Property-Specific Subsets of Local Component Assumptions.10.352009
Improving energy-efficient real-time scheduling by exploiting code instrumentation00.342008
Dynamische Verwaltung Virtuellen Speichers für Echtzeitsysteme.00.342008
Counterexample Generation for Incomplete Designs.00.342007
Computation of minimal counterexamples by using black box techniques and symbolic methods140.702007
Towards an Experimental Autonomous Blimp Platform70.582007
Exact state set representations in the verification of linear hybrid systems with large discrete state space271.752007
Advanced Unbounded Model Checking Based on AIGs, BDD Sweeping, And Quantifier Scheduling180.932006
Automatic verification of hybrid systems with large discrete state space70.612006
  • 1
  • 2