Benedikt Bollig

According to our database1, Benedikt Bollig authored at least 61 papers between 2001 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Identifiers in Registers - Describing Network Algorithms with Logic.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

2018
Communicating Finite-State Machines and Two-Variable Logic.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before".
Proceedings of the 29th International Conference on Concurrency Theory, 2018

Round-Bounded Control of Parameterized Systems.
Proceedings of the Automated Technology for Verification and Analysis, 2018

2017
Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete.
Int. J. Found. Comput. Sci., 2017

The Complexity of Flat Freeze LTL.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
One-Counter Automata with Counter Observability.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015
Automata and Logics for Concurrent Systems: Five Models in Five Pages.
Proceedings of the Implementation and Application of Automata, 2015

Towards Formal Verification of Distributed Algorithms.
Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015

An Automata-Theoretic Approach to the Verification of Distributed Algorithms.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

Automata and Logics for Concurrent Systems: Realizability and Verification.
, 2015

2014
Pebble Weighted Automata and Weighted Logics.
ACM Trans. Comput. Log., 2014

A Robust Class of Data Languages and an Application to Learning.
Logical Methods in Computer Science, 2014

Parameterized Verification of Communicating Automata under Context Bounds.
Proceedings of the Reachability Problems - 8th International Workshop, 2014

Parameterized Communicating Automata: Complementation and Model Checking.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Logical characterization of weighted pebble walking automata.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Logic for communicating automata with parameterized topology.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
Event clock message passing automata: a logical characterization and an emptiness checking algorithm.
Formal Methods in System Design, 2013

The Complexity of Model Checking Multi-stack Systems.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Dynamic Communicating Automata and Branching High-Level MSCs.
Proceedings of the Language and Automata Theory and Applications, 2013

Weighted Specifications over Nested Words.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

A Fresh Approach to Learning Register Automata.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
An optimal construction of Hanf sentences.
J. Applied Logic, 2012

Frequency Linear-time Temporal Logic.
Proceedings of the Sixth International Symposium on Theoretical Aspects of Software Engineering, 2012

Model Checking Languages of Data Words.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

A Probabilistic Kleene Theorem.
Proceedings of the Automated Technology for Verification and Analysis, 2012

2011
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

An Automaton over Data Words That Captures EMSO Logic.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010
Learning Communicating Automata from MSCs.
IEEE Trans. Software Eng., 2010

Propositional Dynamic Logic for Message-Passing Systems
Logical Methods in Computer Science, 2010

Pebble Weighted Automata and Transitive Closure Logics.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Realizability of Dynamic MSC Languages.
Proceedings of the Computer Science, 2010

libalf: The Automata Learning Framework.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

2009
Angluin-Style Learning of NFA.
Proceedings of the IJCAI 2009, 2009

Realizability of Concurrent Recursive Programs.
Proceedings of the Foundations of Software Science and Computational Structures, 2009

Weighted versus Probabilistic Logics.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008
On the Expressive Power of 2-Stack Visibly Pushdown Automata.
Logical Methods in Computer Science, 2008

SMA - The Smyle Modeling Approach.
Proceedings of the Software Engineering Techniques, 2008

Emptiness of Multi-pushdown Automata Is 2ETIME-Complete.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

Distributed Timed Automata with Independently Evolving Clocks.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

2007
Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

Weighted Distributed Systems and Their Logics.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007

Muller Message-Passing Automata and Logics.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Propositional Dynamic Logic for Message-Passing Systems.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Automata and Logics for Timed Message Sequence Charts.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006
MSCan - A Tool for Analyzing MSC Specifications.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2006

Formal Models of Communicating Systems - Languages, Automata, and Monadic Second-Order Logic
Springer, ISBN: 3-540-32922-6, 2006

2005
Automata and logics for message sequence charts.
PhD thesis, 2005

A Hierarchy of Implementable MSC Languages.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2005

On the Expressiveness of Asynchronous Cellular Automata.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004
Verifying Qualitative Properties of Probabilistic Programs.
Proceedings of the Validation of Stochastic Systems - A Guide to Current Research, 2004

Controller Synthesis for Probabilistic Systems.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Message-Passing Automata Are Expressively Equivalent to EMSO Logic.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
Model Checking Probabilistic Distributed Systems.
Proceedings of the Advances in Computing Science, 2003

2002
Local Parallel Model Checking for the Alternation-Free µ-Calculus.
Proceedings of the Model Checking of Software, 2002

Extending Compositional Message Sequence Graphs.
Proceedings of the Logic for Programming, 2002

Generalised Regular MSC Languages.
Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001
Modelling, Specifying, and Verifying Message Passing Systems.
Proceedings of the Eigth International Symposium on Temporal Representation and Reasoning, 2001

Deciding LTL over Mazurkiewicz Traces.
Proceedings of the Eigth International Symposium on Temporal Representation and Reasoning, 2001

Parallel Model Checking for the Alternation Free µ-Calculus.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2001


  Loading...