Benedikt Bollig
Full-time Researcher, CNRS
include.html
Research interests
- Formal languages, automata theory, logic
- Concurrency theory
Recent Publications
-
The Complexity of Model Checking Multi-Stack Systems
(with D. Kuske and R. Mennicke)
LICS 2013, to appear
-
A Fresh Approach to Learning Register Automata
(with P. Habermehl, M. Leucker, and B. Monmege)
DLT 2013, to appear
-
Dynamic Communicating Automata and Branching High-Level MSCs
(with A. Cyriac, L. Hélouët, A. Kara, and Th. Schwentick)
LATA 2013
-
Quantitative Specifications over Nested Words
(with P. Gastin and B. Monmege)
FoSSaCS 2013
-
A Probabilistic Kleene Theorem
(with P. Gastin, B. Monmege, and M. Zeitoun)
ATVA 2012
-
An optimal construction of Hanf sentences (with D. Kuske)
Journal of Applied Logic, 2012
( Slides )
-
Model Checking Languages of Data Words
(with A. Cyriac, P. Gastin, and K. Narayan Kumar)
FoSSaCS 2012
More publications
DBLP entry
Google Scholar
Recent talks
More talks
Other activities
Teaching
Book

Tools
- libalf -
The Automata Learning Framework
- Smyle -
Synthesizing Models by Learning from Examples
- MSCan -
A Tool for Analyzing MSC Specifications