BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Germany
1 × United Kingdom
5 × USA
7 × France
Collaborated with:
F.Pigorsch B.Becker S.Disch T.Zitterell S.Reimer K.Gitina R.Wimmer G.Morbé A.Hett E.Althaus S.Kupferschmid S.Melchior G.Hotz P.Molitor J.Nist M.Sauer
Talks about:
exploit (3) qbf (3) preprocess (2) interpol (2) solver (2) linear (2) check (2) time (2) solv (2) dqbf (2)

Person: Christoph Scholl

DBLP DBLP: Scholl:Christoph

Contributed to:

DATE 20152015
SAT 20152015
DATE 20142014
DATE 20132013
CAV 20112011
DATE 20112011
DAC 20102010
DATE 20092009
TACAS 20092009
DAC 20012001
DAC 20002000
DATE 20002000
DATE 19981998
ED&TC 19971997

Wrote 15 papers:

DATE-2015-GitinaWRSSB #quantifier
Solving DQBF through quantifier elimination (KG, RW, SR, MS, CS, BB), pp. 1617–1622.
SAT-2015-WimmerGNSB #preprocessor
Preprocessing for DQBF (RW, KG, JN, CS, BB), pp. 173–190.
DATE-2014-SchollPDA #linear
Simple interpolants for linear arithmetic (CS, FP, SD, EA), pp. 1–6.
DATE-2013-PigorschS #locality
Lemma localization: a practical method for downsizing SMT-interpolants (FP, CS), pp. 1405–1410.
CAV-2011-MorbePS #automaton #model checking
Fully Symbolic Model Checking for Timed Automata (GM, FP, CS), pp. 616–632.
DATE-2011-ReimerPSB #integration #orthogonal
Integration of orthogonal QBF solving techniques (SR, FP, CS, BB), pp. 149–154.
DAC-2010-PigorschS #preprocessor #satisfiability #using
An AIG-Based QBF-solver using SAT for preprocessing (FP, CS), pp. 170–175.
DAC-2010-ZitterellS #approach #energy #online #probability #realtime #scheduling
A probabilistic and energy-efficient scheduling approach for online application in real-time systems (TZ, CS), pp. 42–47.
Exploiting structure in an AIG based QBF solver (FP, CS), pp. 1596–1601.
TACAS-2009-SchollDPK #constraints #detection #linear
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints (CS, SD, FP, SK), pp. 383–397.
DAC-2001-SchollB #equivalence #implementation
Checking Equivalence for Partial Implementations (CS, BB), pp. 238–243.
DAC-2000-HettSB #distance #finite #state machine #traversal
Distance driven finite state machine traversal (AH, CS, BB), pp. 39–42.
DATE-2000-SchollB #generative #logic #multi #on the
On the Generation of Multiplexer Circuits for Pass Transistor Logic (CS, BB), pp. 372–378.
DATE-1998-Scholl #composition #functional #multi
Multi-output Functional Decomposition with Exploitation of Don’t Cares (CS), pp. 743–748.
EDTC-1997-SchollMHM #symmetry
Minimizing ROBDD sizes of incompletely specified Boolean functionsby exploiting strong symmetries (CS, SM, GH, PM), pp. 229–234.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.