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 × Estonia
1 × Germany
1 × Japan
1 × Portugal
1 × Spain
1 × Sweden
1 × USA
2 × Austria
2 × Italy
2 × United Kingdom
3 × France
Collaborated with:
P.Gastin M.Leucker B.Monmege P.Habermehl D.Kuske C.Kern M.Zeitoun A.Cyriac J.Katoen R.Mennicke M.Grindei M.F.Atig T.Noll M.Weber K.N.Kumar M.Schlütter V.Stolz L.Hélouët A.Kara T.Schwentick D.Neider D.R.Piegdon
Talks about:
automata (9) logic (6) model (5) weight (4) learn (3) check (3) communic (2) languag (2) concurr (2) system (2)

Person: Benedikt Bollig

DBLP DBLP: Bollig:Benedikt

Contributed to:

CIAA 20152015
CSL-LICS 20142014
DLT 20132013
FOSSACS 20132013
LATA 20132013
LICS 20132013
FOSSACS 20122012
CAV 20102010
ICALP (2) 20102010
DLT 20092009
FOSSACS 20092009
DLT 20082008
LATA 20072007
TACAS 20072007
TACAS 20062006
FoSSaCS 20022002
TACAS 20012001

Wrote 18 papers:

CIAA-2015-Bollig #automaton #concurrent #logic #modelling
Automata and Logics for Concurrent Systems: Five Models in Five Pages (BB), pp. 3–12.
LICS-CSL-2014-Bollig #automaton #communication #logic
Logic for communicating automata with parameterized topology (BB), p. 10.
LICS-CSL-2014-BolligGMZ #automaton #logic
Logical characterization of weighted pebble walking automata (BB, PG, BM, MZ), p. 10.
DLT-2013-BolligHLM #approach #automaton #learning
A Fresh Approach to Learning Register Automata (BB, PH, ML, BM), pp. 118–130.
FoSSaCS-2013-BolligGM #specification #word
Weighted Specifications over Nested Words (BB, PG, BM), pp. 385–400.
LATA-2013-BolligCHKS #automaton #branch #communication
Dynamic Communicating Automata and Branching High-Level MSCs (BB, AC, LH, AK, TS), pp. 177–189.
LICS-2013-BolligKM #complexity #model checking #multi
The Complexity of Model Checking Multi-stack Systems (BB, DK, RM), pp. 163–172.
FoSSaCS-2012-BolligCGK #model checking #word
Model Checking Languages of Data Words (BB, AC, PG, KNK), pp. 391–405.
CAV-2010-BolligKKLNP #automaton #framework #learning #named
libalf: The Automata Learning Framework (BB, JPK, CK, ML, DN, DRP), pp. 360–364.
ICALP-v2-2010-BolligGMZ #automaton #logic #transitive
Pebble Weighted Automata and Transitive Closure Logics (BB, PG, BM, MZ), pp. 587–598.
DLT-2009-BolligG #logic #probability
Weighted versus Probabilistic Logics (BB, PG), pp. 18–38.
FoSSaCS-2009-BolligGH #concurrent #recursion #source code
Realizability of Concurrent Recursive Programs (BB, MLG, PH), pp. 410–424.
DLT-2008-AtigBH #automaton #multi
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete (MFA, BB, PH), pp. 121–133.
LATA-2007-BolligK #automaton #logic #message passing
Muller Message-Passing Automata and Logics (BB, DK), pp. 163–174.
TACAS-2007-BolligKKL #design #game studies #learning #modelling #synthesis
Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning (BB, JPK, CK, ML), pp. 435–450.
TACAS-2006-BolligKSS #named #specification
MSCan — A Tool for Analyzing MSC Specifications (BB, CK, MS, VS), pp. 455–458.
FoSSaCS-2002-BolligLN
Generalised Regular MSC Languages (BB, ML, TN), pp. 52–66.
TACAS-2001-BolligLW #calculus #model checking #parallel #μ-calculus
Parallel Model Checking for the Alternation Free μ-Calculus (BB, ML, MW), pp. 543–558.

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.