The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin Leucker: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Benedikt Bollig, Martin Leucker
    Model Checking Probabilistic Distributed Systems. [Citation Graph (0, 0)][DBLP]
    ASIAN, 2003, pp:291-304 [Conf]
  2. Martin Leucker
    On Model Checking Synchronised Hardware Circuits. [Citation Graph (0, 0)][DBLP]
    ASIAN, 2000, pp:182-198 [Conf]
  3. Andreas Bauer 0002, Martin Leucker, Christian Schallhart
    Model-based runtime analysis of distributed reactive systems. [Citation Graph (0, 0)][DBLP]
    ASWEC, 2006, pp:243-252 [Conf]
  4. Olga Grinchtein, Martin Leucker, Nir Piterman
    Inferring Network Invariants Automatically. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:483-497 [Conf]
  5. Martin Leucker, Thomas Noll
    Truth/SLC - A Parallel Verification Platform for Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    CAV, 2001, pp:255-259 [Conf]
  6. Benedikt Bollig, Martin Leucker
    Message-Passing Automata Are Expressively Equivalent to EMSO Logic. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:146-160 [Conf]
  7. Martin Leucker
    Prefix-Recognizable Graphs and Monadic Logic. [Citation Graph (0, 0)][DBLP]
    Automata, Logics, and Infinite Games, 2001, pp:263-284 [Conf]
  8. Alexander Pretschner, Martin Leucker
    Model-Based Testing - A Glossary. [Citation Graph (0, 0)][DBLP]
    Model-Based Testing of Reactive Systems, 2004, pp:607-609 [Conf]
  9. Therese Berg, Olga Grinchtein, Bengt Jonsson, Martin Leucker, Harald Raffelt, Bernhard Steffen
    On the Correspondence Between Conformance Testing and Regular Inference. [Citation Graph (0, 0)][DBLP]
    FASE, 2005, pp:175-189 [Conf]
  10. Olga Grinchtein, Bengt Jonsson, Martin Leucker
    Learning of Event-Recording Automata. [Citation Graph (0, 0)][DBLP]
    FORMATS/FTRTFT, 2004, pp:379-396 [Conf]
  11. Benedikt Bollig, Martin Leucker
    A Hierarchy of Implementable MSC Languages. [Citation Graph (0, 0)][DBLP]
    FORTE, 2005, pp:53-67 [Conf]
  12. Benedikt Bollig, Martin Leucker, Thomas Noll
    Generalised Regular MSC Languages. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:52-66 [Conf]
  13. Andreas Bauer 0002, Martin Leucker, Christian Schallhart
    Monitoring of Real-Time Properties. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:260-272 [Conf]
  14. Martin Leucker, P. Madhusudan, Supratik Mukhopadhyay
    Dynamic Message Sequence Charts. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:253-264 [Conf]
  15. Andreas Bauer 0002, Martin Leucker, Jonathan Streit
    SALT - Structured Assertion Language for Temporal Logic. [Citation Graph (0, 0)][DBLP]
    ICFEM, 2006, pp:757-775 [Conf]
  16. Olga Grinchtein, Martin Leucker
    Learning Finite-State Machines from Inexperienced Teachers. [Citation Graph (0, 0)][DBLP]
    ICGI, 2006, pp:344-345 [Conf]
  17. Christel Baier, Marcus Größer, Martin Leucker, Benedikt Bollig, Frank Ciesinski
    Controller Synthesis for Probabilistic Systems. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:493-506 [Conf]
  18. Benedikt Bollig, Martin Leucker, Philipp Lucas
    Extending Compositional Message Sequence Graphs. [Citation Graph (0, 0)][DBLP]
    LPAR, 2002, pp:68-85 [Conf]
  19. Martin Leucker
    Model Checking Games for the Alternation-Free µ-Calculus and Alternating Automata. [Citation Graph (0, 0)][DBLP]
    LPAR, 1999, pp:77-91 [Conf]
  20. Martin Leucker, Thomas Noll
    Rapid Prototyping of Specification Language Implementations. [Citation Graph (0, 0)][DBLP]
    IEEE International Workshop on Rapid System Prototyping, 1999, pp:60-65 [Conf]
  21. Benedikt Bollig, Martin Leucker, Michael Weber 0002
    Local Parallel Model Checking for the Alternation-Free µ-Calculus. [Citation Graph (0, 0)][DBLP]
    SPIN, 2002, pp:128-147 [Conf]
  22. Harald Fecher, Martin Leucker, Verena Wolf
    Don't Know in Probabilistic Systems. [Citation Graph (0, 0)][DBLP]
    SPIN, 2006, pp:71-88 [Conf]
  23. Benedikt Bollig, Martin Leucker, Michael Weber 0002
    Parallel Model Checking for the Alternation Free µ-Calculus. [Citation Graph (0, 0)][DBLP]
    TACAS, 2001, pp:543-558 [Conf]
  24. Benedikt Bollig, Martin Leucker
    Deciding LTL over Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    TIME, 2001, pp:189-197 [Conf]
  25. Benedikt Bollig, Martin Leucker
    Modelling, Specifying, and Verifying Message Passing Systems. [Citation Graph (0, 0)][DBLP]
    TIME, 2001, pp:240-247 [Conf]
  26. Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham
    Don't Know in the µ-Calculus. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:233-249 [Conf]
  27. Benedikt Bollig, Martin Leucker
    Verifying Qualitative Properties of Probabilistic Programs. [Citation Graph (0, 0)][DBLP]
    Validation of Stochastic Systems, 2004, pp:124-146 [Conf]
  28. Benedikt Bollig, Martin Leucker
    Deciding LTL over Mazurkiewicz traces. [Citation Graph (0, 0)][DBLP]
    Data Knowl. Eng., 2003, v:44, n:2, pp:219-238 [Journal]
  29. Therese Berg, Bengt Jonsson, Martin Leucker, Mayank Saksena
    Insights to Angluin's Learning. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:118, n:, pp:3-18 [Journal]
  30. Lubos Brim, Martin Leucker
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:128, n:3, pp:1-2 [Journal]
  31. Olga Grinchtein, Bengt Jonsson, Martin Leucker
    Inference of Timed Transition Systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:138, n:3, pp:87-99 [Journal]
  32. Olga Grinchtein, Martin Leucker
    Network Invariants for Real-Time Systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:98, n:, pp:57-74 [Journal]
  33. Fredrik Holmén, Martin Leucker, Marcus Lindström
    UppDMC: A Distributed Model Checker for Fragments of the mu-Calculus. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:128, n:3, pp:91-105 [Journal]
  34. Martin Leucker, Thomas Noll
    Rewriting Logic as a Framework for Generic Verification Tools. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:36, n:, pp:- [Journal]
  35. Martin Leucker, Jaco van de Pol
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:135, n:2, pp:1-2 [Journal]
  36. Martin Leucker, Rafal Somla, Michael Weber 0002
    Parallel Model Checking for LTL, CTL*, and Lµ2. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:89, n:1, pp:- [Journal]
  37. Lubos Brim, Martin Leucker
    Foreword. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2006, v:29, n:2, pp:115-116 [Journal]
  38. Martin Leucker, Thomas Noll, Perdita Stevens, Michael Weber 0002
    Functional programming languages for verification tools: a comparison of Standard ML and Haskell. [Citation Graph (0, 0)][DBLP]
    STTT, 2005, v:7, n:2, pp:184-194 [Journal]
  39. Benedikt Bollig, Martin Leucker
    Message-passing automata are expressively equivalent to EMSO logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:358, n:2-3, pp:150-172 [Journal]
  40. Joost-Pieter Katoen, Daniel Klink, Martin Leucker, Verena Wolf
    Three-Valued Abstraction for Continuous-Time Markov Chains. [Citation Graph (0, 0)][DBLP]
    CAV, 2007, pp:311-324 [Conf]
  41. Jiri Barnat, Lubos Brim, Martin Leucker
    Parallel Model Checking and the FMICS-jETI Platform. [Citation Graph (0, 0)][DBLP]
    ICECCS, 2007, pp:330-339 [Conf]
  42. Tiziana Margaria, Harald Raffelt, Bernhard Steffen, Martin Leucker
    The LearnLib in FMICS-jETI. [Citation Graph (0, 0)][DBLP]
    ICECCS, 2007, pp:340-352 [Conf]
  43. Martin Leucker, César Sánchez
    Regular Linear Temporal Logic. [Citation Graph (0, 0)][DBLP]
    ICTAC, 2007, pp:291-305 [Conf]
  44. Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker
    Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning. [Citation Graph (0, 0)][DBLP]
    TACAS, 2007, pp:435-450 [Conf]
  45. Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham
    When not losing is better than winning: Abstraction and refinement for the full mu-calculus. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:8, pp:1130-1148 [Journal]

  46. Learning Workflow Petri Nets. [Citation Graph (, )][DBLP]


  47. Impartial Anticipation in Runtime-Verification. [Citation Graph (, )][DBLP]


  48. Don't Know for Multi-valued Systems. [Citation Graph (, )][DBLP]


  49. libalf: The Automata Learning Framework. [Citation Graph (, )][DBLP]


  50. Abstraction for Stochastic Systems by Erlang's Method of Stages. [Citation Graph (, )][DBLP]


  51. Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning. [Citation Graph (, )][DBLP]


  52. Learning Meets Verification. [Citation Graph (, )][DBLP]


  53. Modeling and Model Checking Software Product Lines. [Citation Graph (, )][DBLP]


  54. Lightweight Verification 2008. [Citation Graph (, )][DBLP]


  55. Angluin-Style Learning of NFA. [Citation Graph (, )][DBLP]


  56. Äquivalenzklassen mit Zeit und Zuständen. [Citation Graph (, )][DBLP]


  57. Don't care in SMT-Building flexible yet efficient abstraction/refinement solvers. [Citation Graph (, )][DBLP]


  58. The Shortest Path Problem Revisited: Optimal Routing for Electric Vehicles. [Citation Graph (, )][DBLP]


  59. Calculating and Modeling Common Parts of Software Product Lines. [Citation Graph (, )][DBLP]


  60. Regular Linear Temporal Logic with Past. [Citation Graph (, )][DBLP]


  61. The Good, the Bad, and the Ugly, But How Ugly Is Ugly? [Citation Graph (, )][DBLP]


Search in 0.036secs, Finished in 0.039secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002