| | |
- CSB - MetaPress - Google - Bing - Yahoo
Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo
| 85 |       | Benedikt Bollig, Normann Decker, Martin Leucker: Frequency Linear-time Temporal Logic. TASE 2012: 85-92 |
| 75 | | Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker, Daniel Neider, David R. Piegdon: libalf: The Automata Learning Framework. CAV 2010: 360-364 |
| 70 | | Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker: SMA - The Smyle Modeling Approach. Computing and Informatics 29(1): 45-72 (2010) |
| 69 | | Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker: Learning Communicating Automata from MSCs. IEEE Trans. Software Eng. 36(3): 390-408 (2010) |
| 63 | | Benedikt Bollig, Peter Habermehl, Carsten Kern, Martin Leucker: Angluin-Style Learning of NFA. IJCAI 2009: 1004-1009 |
| 58 | | Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker: SMA - The Smyle Modeling Approach. CEE-SET 2008: 103-117 |
| 57 | | Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker: Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning. CONCUR 2008: 162-166 |
| 43 | | Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker: Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning. TACAS 2007: 435-450 |
| 32 | | Benedikt Bollig, Martin Leucker: Message-passing automata are expressively equivalent to EMSO logic. Theor. Comput. Sci. 358(2-3): 150-172 (2006) |
| 29 | | Benedikt Bollig, Martin Leucker: A Hierarchy of Implementable MSC Languages. FORTE 2005: 53-67 |
| 22 | | Benedikt Bollig, Martin Leucker: Message-Passing Automata Are Expressively Equivalent to EMSO Logic. CONCUR 2004: 146-160 |
| 20 |  | Christel Baier, Marcus Größer, Martin Leucker, Benedikt Bollig, Frank Ciesinski: Controller Synthesis for Probabilistic Systems. IFIP TCS 2004: 493-506 |
| 18 | | Benedikt Bollig, Martin Leucker: Verifying Qualitative Properties of Probabilistic Programs. Validation of Stochastic Systems 2004: 124-146 |
| 16 | | Benedikt Bollig, Martin Leucker: Model Checking Probabilistic Distributed Systems. ASIAN 2003: 291-304 |
| 15 | | Benedikt Bollig, Martin Leucker: Deciding LTL over Mazurkiewicz traces. Data Knowl. Eng. 44(2): 219-238 (2003) |
| 12 | | Benedikt Bollig, Martin Leucker, Thomas Noll: Generalised Regular MSC Languages. FoSSaCS 2002: 52-66 |
| 11 | | Benedikt Bollig, Martin Leucker, Philipp Lucas: Extending Compositional Message Sequence Graphs. LPAR 2002: 68-85 |
| 10 | | Benedikt Bollig, Martin Leucker, Michael Weber: Local Parallel Model Checking for the Alternation-Free µ-Calculus. SPIN 2002: 128-147 |
| 7 | | Benedikt Bollig, Martin Leucker, Michael Weber: Parallel Model Checking for the Alternation Free µ-Calculus. TACAS 2001: 543-558 |
| 6 | | Benedikt Bollig, Martin Leucker: Deciding LTL over Mazurkiewicz Traces. TIME 2001: 189-197 |
| 5 | | Benedikt Bollig, Martin Leucker: Modelling, Specifying, and Verifying Message Passing Systems. TIME 2001: 240-247 |
Selection of 21 from 86 records - Martin Leucker has 69 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page