The following pages link to Christoph Scholl (Q436416):
Displaying 20 items.
- Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (Q436418) (← links)
- On WLCDs and the complexity of word-level decision diagrams --- A lower bound for division (Q1600657) (← links)
- From DQBF to QBF by dependency elimination (Q1680263) (← links)
- Skolem functions for DQBF (Q1990517) (← links)
- Solving dependency quantified Boolean formulas using quantifier localization (Q2148900) (← links)
- Incremental inprocessing in SAT solving (Q2181926) (← links)
- (Q2770065) (← links)
- 2QBF: Challenges and Solutions (Q2818033) (← links)
- Dependency Schemes for DQBF (Q2818034) (← links)
- Preprocessing for DQBF (Q3453223) (← links)
- Improving Interpolants for Linear Arithmetic (Q3460545) (← links)
- Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space (Q3510811) (← links)
- Automatic Verification of Hybrid Systems with Large Discrete State Space (Q3522915) (← links)
- Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints (Q3617770) (← links)
- (Q4230678) (← links)
- The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 (Q5015602) (← links)
- Symbolic Model Checking for Incomplete Designs with Flexible Modeling of Unknowns (Q5274431) (← links)
- Formal Methods in Computer-Aided Design (Q5492987) (← links)
- Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications (Q5889312) (← links)
- Quantifier elimination in stochastic Boolean satisfiability (Q6572038) (← links)
