BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
2 × Germany
2 × United Kingdom
3 × USA
Collaborated with:
∅ M.Lange V.Raman S.A.Seshia H.Kress-Gazit H.Peter R.Mattmüller
Talks about:
synthesi (6) automata (3) symbol (2) bound (2) determinist (1) increment (1) identifi (1) approxim (1) unbeast (1) synthia (1)

Person: Rüdiger Ehlers

DBLP DBLP: Ehlers:R=uuml=diger

Contributed to:

IJCAR 20142014
VMCAI 20142014
CAV 20122012
CAV 20112011
TACAS 20112011
CAV 20102010
LATA 20102010
SAT 20102010
CAV (2) 20162016

Wrote 9 papers:

IJCAR-2014-EhlersL #approximate #finite #incremental #logic #satisfiability
A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic (RE, ML), pp. 360–366.
VMCAI-2014-EhlersSK #identifier #synthesis
Synthesis with Identifiers (RE, SAS, HKG), pp. 415–433.
CAV-2012-Ehlers #ltl #synthesis
ACTL ∩ LTL Synthesis (RE), pp. 39–54.
CAV-2011-PeterEM #automaton #named #synthesis #verification
Synthia: Verification and Synthesis for Timed Automata (HJP, RE, RM), pp. 649–655.
TACAS-2011-Ehlers #bound #named #synthesis
Unbeast: Symbolic Bounded Synthesis (RE), pp. 272–275.
CAV-2010-Ehlers #bound #synthesis
Symbolic Bounded Synthesis (RE), pp. 365–379.
LATA-2010-Ehlers #automaton
Short Witnesses and Accepting Lassos in ω-Automata (RE), pp. 261–272.
SAT-2010-Ehlers #automaton #satisfiability #using
Minimising Deterministic Büchi Automata Precisely Using SAT Solving (RE), pp. 326–332.
CAV-2016-EhlersR #named #synthesis
Slugs: Extensible GR(1) Synthesis (RE, VR), pp. 333–339.
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.