Publications by topic

Testing

Bibliography generated from testing.aux

Olga Grinchtein, Bengt Jonsson, and Martin Leucker. Learning of event-recording automata. Theoretical Computer Science, 411(47):4029–4054, October 2010. (PostScript) (PDF) (bibtex)
Andreas Bauer, Martin Leucker, and Christian Schallhart. Runtime verification for LTL and TLTL. ACM Transactions on Software Engineering and Methodology (TOSEM), 2009. in press. (PDF) (bibtex)
Benedikt Bollig, Peter Habermehl, Carsten Kern, and Martin Leucker. Angluin-style learning of NFA. Research Report LSV-08-28, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2008. 30 pages. (bibtex)
Martin Leucker, editor. Proceedings of the 8^th International Workshop on Runtime Verification (RV'08), volume 5289 of Lecture Notes in Computer Science. Springer, March 2008. (bibtex)
Martin Leucker and Christian Schallhart. A brief account of runtime verification. Journal of Logic and Algebraic Programming, 78(5):293–303, may/june 2009. (PDF) (bibtex)
Wei Dong, Martin Leucker, and Christian Schallhart. Impartial anticipation in runtime verification. In Moonzoo Kim and Mahesh Viswanathan, editors, Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis (ATVA'08), volume 5311 of Lecture Notes in Computer Science. Springer, 2008. (PostScript) (PDF) (bibtex)
Andreas Bauer, Martin Leucker, and Christian Schallhart. Comparing LTL semantics for runtime verification. Journal of Logic and Computation, 20(3):651–674, 2010. (PostScript) (PDF) (bibtex). see also [LeuckerBS08TR]
Andreas Bauer, Martin Leucker, and Christian Schallhart. The good, the bad, and the ugly—but how ugly is ugly?. Technical Report TUM-I0803, TU München, 2008. (PostScript) (PDF) (bibtex)
Andreas Bauer, Martin Leucker, and Christian Schallhart. Runtime verification for LTL and TLTL. Technical Report TUM-I0724, TU München, 2007. (PostScript) (PDF) (bibtex)
Andreas Bauer, Martin Leucker, Christian Schallhart, and Michael Tautschnig. Don't care in SMT—building flexible yet efficient abstraction/refinement solvers. In Proceedings of the 2007 ISoLA Workshop On Leveraging Applications of Formal Methods, Verification and Validation (ISoLA'07), RNTI, Revue des Nouvelles Technologies de l'Information, France, December 2007. (PostScript) (PDF) (bibtex)
Martin Leucker. Learning meets verification. volume 4709 of Lecture Notes in Computer Science, pages 127–151. Springer, 2007. (PostScript) (PDF) (bibtex)
Andreas Bauer, Martin Leucker, and Christian Schallhart. The good, the bad, and the ugly—but how ugly is ugly?. In Proceedings of the 7th International Workshop on Runtime Verification (RV'07), volume 4839 of Lecture Notes in Computer Science, pages 126–138, Vancouver, Canada, December 2007. Springer-Verlag. (PostScript) (PDF) (bibtex)
Andreas Bauer, Martin Leucker, and Christian Schallhart. Monitoring of real-time properties. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), volume 4337 of Lecture Notes in Computer Science, Kolkata, India, December 2006. Springer-Verlag. (PostScript) (PDF) (bibtex)
Andreas Bauer, Martin Leucker, and Jonathan Streit. SALT—structured assertion language for temporal logic. In Proceedings of the Eighth International Conference on Formal Engineering Methods, volume 4260 of Lecture Notes in Computer Science, September 2006. (PostScript) (PDF) (bibtex) (abstract)
Andreas Bauer, Martin Leucker, and Christian Schallhart. Model-based runtime analysis of distributed reactive systems. In Proceedings of the Australian Software Engineering Conference (ASWEC'06), pages 243–252. IEEE, 2006. (PostScript) (PDF) (bibtex) (abstract)
Manfred Broy, Bengt Jonsson, Joost-Pieter Katoen, Martin Leucker, and Alexander Pretschner, editors. Model-based Testing of Reactive Systems, volume 3472 of Lecture Notes in Computer Science. Springer, 2005. (bibtex)
Therese Berg, Olga Grinchtein, Bengt Jonsson, Martin Leucker, Harald Raffelt, and Bernhard Steffen. On the correspondence between conformance testing and regular inference. In Maura Cerioli, editor, Fundamental Approaches to Software Engineering, FASE'05, volume 3442 of Lecture Notes in Computer Science, pages 175–189. Springer, 2005. (PostScript) (PDF) (bibtex)
Olga Grinchtein, Bengt Jonsson, and Martin Leucker. Inference of timed transition systems. In 6th International Workshop on Verification of Infinite-State Systems, volume 138/4 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2004. (PostScript) (PDF) (bibtex) (abstract)
Olga Grinchtein, Bengt Jonsson, and Martin Leucker. Learning of event-recording automata. In Proceedings of the Joint Conferences FORMATS and FTRTFT, volume 3253 of Lecture Notes in Computer Science, September 2004. (PostScript) (PDF) (bibtex) (abstract)
Therese Berg, Bengt Jonsson, Martin Leucker, and Mayank Saksena. Insights to Angluin's learning. In Proceedings of the International Workshop on Software Verification and Validation (SVV 2003), volume 118 of Electronic Notes in Theoretical Computer Science, pages 3–18, December 2003. (PostScript) (PDF) (bibtex) (abstract)
Therese Berg, Bengt Jonsson, Martin Leucker, and Mayank Saksena. Insights to Angluin's learning. Technical Report 2003-039, Department of Information Technology, Uppsala University, August 2003. (PostScript) (PDF) (bibtex) (abstract)

Message Passing Systems

Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, and Martin Leucker. Learning communicating automata from MSCs. IEEE Transactions on Software Engineering (TSE), 36(3):390–408, May/June 2010. (PDF) (bibtex)
Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, and Martin Leucker. SMA—the smyle modeling approach. Computing and Informatics, 29(1):45–72, 2010. (PDF) (bibtex)
Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, and Martin Leucker. SMA—the Smyle modeling approach. In 3rd IFIP TC2 Central and East European Conference on Software Engineering Techniques (CEE-SET'08), 2008. nominated for best-paper award, to appear. (bibtex). see also [BKKL08TR]
Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, and Martin Leucker. SMA—the Smyle modeling approach. Technical Report TUM-I0820, TU München, 2008. (PostScript) (PDF) (bibtex)
Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, and Martin Leucker. Smyle: a tool for synthesizing distributed models from scenarios by learning. In Proceedings of the 19th International Conference on Concurrency Theory (CONCUR'08), volume 5201 of Lecture Notes in Computer Science, Toronto, Canada, August 2008. Springer. (PDF) (bibtex)
Tiziana Margaria, Harald Raffelt, Bernhard Steffen, and Martin Leucker. The LearnLib in FMICS-jETI. In The Twelfth IEEE International Conference on Engineering of Complex Computer Systems (ICECCS 2007), pages 340–352. IEEE Computer Society Press, 2007. (PostScript) (PDF) (bibtex)
Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, and Martin Leucker. Replaying play in and play out: Synthesis of design models from scenarios by learning. In Orna Grumberg and Michael Huth, editors, Proceedings of the 13th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'07), volume 4424 of Lecture Notes in Computer Science, Braga, Portugal, March 2007. Springer. (PostScript) (PDF) (bibtex)
Benedikt Bollig and Martin Leucker. A hierarchy of implementable MSC languages. In Proceedings of the 25th IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE'05), volume 3731 of Lecture Notes in Computer Science, National Taiwan University, October 2005. Springer. (PostScript) (PDF) (bibtex) (abstract)
Benedikt Bollig and Martin Leucker. Message-passing automata are expressively equivalent to EMSO logic. Theoretical Computer Science, 358(2-3):150–172, 2006. (PostScript) (PDF) (bibtex)
Benedikt Bollig and Martin Leucker. Message-passing automata are expressively equivalent to EMSO logic. In Proceedings of the 15th International Conference on Concurrency Theory (CONCUR'04), Lecture Notes in Computer Science, London, UK, August 2004. Springer. (PDF) (bibtex)
Benedikt Bollig and Martin Leucker. Model checking probabilistic distributed systems. In Proceedings of the 8th Asian Computing Science Conference (ASIAN'03), volume 2896 of Lecture Notes in Computer Science, pages 291–304, Mumbai, India, December 2003. Springer. (PostScript) (PDF) (bibtex) (abstract)
Martin Leucker, P. Madhusudan, and Supratik Mukhopadhyay. Dynamic message sequence charts. In M. Agrawal and A. Seth, editors, Proceedings of 22nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'02), volume 2556 of Lecture Notes in Computer Science. Springer, December 2002. (PostScript) (PDF) (bibtex)
Benedikt Bollig, Martin Leucker, and Philipp Lucas. Extending compositional message sequence graphs. In Matthias Baaz and Andrei Voronkov, editors, Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'02), volume 2514 of Lecture Notes in Artificial Intelligence, pages 68–85. Springer, 2002. (PostScript) (PDF) (bibtex)
Benedikt Bollig, Martin Leucker, and Philipp Lucas. Extending compositional message sequence graphs. Technical Report MS-CIS-02-09, University of Pennsylvania, April 2002. (PDF) (bibtex)
Benedikt Bollig, Martin Leucker, and Thomas Noll. Generalised regular MSC languages. In Mogens Nielsen, editor, Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures (FOSSACS '02), volume 2303 of Lecture Notes in Computer Science, pages 52–66. Springer-Verlag Inc., 2002. (bibtex)
Benedikt Bollig, Martin Leucker, and Thomas Noll. Generalised Regular MSC Languages. Technical Report AIB-03-2002, RWTH Aachen, January 2002. (PostScript) (bibtex)
Benedikt Bollig, Martin Leucker, and Thomas Noll. Regular MSC Languages. Technical Report AIB-05-2001, RWTH Aachen, April 2001. (PostScript) (bibtex)
Benedikt Bollig and Martin Leucker. Modelling, Specifying, and Verifying Message Passing Systems. In Claudio Bettini and Angelo Montanari, editors, Proceedings of the Symposium on Temporal Representation and Reasoning (TIME'01), pages 240–248. IEEE Computer Society Press, June 2001. (PostScript) (bibtex)

Model Checking

Bibliography generated from modelchecking.aux

Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker, Daniel Neider, and David Piegdon. libalf: the automata learning framework. In Proceedings of the 22nd International Conference on Computer-Aided Verification (CAV'10), volume 6174 of Lecture Notes in Computer Science, pages 360–364. Springer, 2010. (bibtex)
César Sánchez and Martin Leucker. Regular linear temporal logic with past. In Gilles Barthe and Manuel Hermenegildo, editors, Proceedings of the 11th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'10), volume 5944 of Lecture Notes in Computer Science, pages 295–311. Springer, 2010. (PDF) (bibtex)
Alarico Campetelli, Alexander Gruler, Martin Leucker, and Daniel Thoma. Don't know for multi-valued systems. In Zhiming Liu and Anders P. Ravn, editors, Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis (ATVA'09), volume 5799 of Lecture Notes in Computer Science, pages 289–305. Springer, 2009. (PDF) (bibtex)
Joost-Pieter Katoen, Daniel Klink, Martin Leucker, and Verena Wolf. Abstraction for stochastic systems by Erlang's method of stages. In Proceedings of the 19th International Conference on Concurrency Theory (CONCUR'08), volume 5201 of Lecture Notes in Computer Science, Toronto, Canada, August 2008. Springer. (PDF) (bibtex)
Alexander Gruler, Martin Leucker, and Kathrin Scheidemann. Modeling and model checking software product lines. In Proceedings of the 10th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS'08), volume 5051 of Lecture Notes in Computer Science, pages 113–131, Oslo, Norway, June 2008. Springer-Verlag. (PostScript) (PDF) (bibtex)
Andreas Bauer, Martin Leucker, Christian Schallhart, and Michael Tautschnig. Don't care in SMT—building flexible yet efficient abstraction/refinement solvers. In Proceedings of the 2007 ISoLA Workshop On Leveraging Applications of Formal Methods, Verification and Validation (ISoLA'07), RNTI, Revue des Nouvelles Technologies de l'Information, France, December 2007. (PostScript) (PDF) (bibtex)
Martin Leucker. Learning meets verification. volume 4709 of Lecture Notes in Computer Science, pages 127–151. Springer, 2007. (PostScript) (PDF) (bibtex)
Martin Leucker and César Sánchez. Regular linear temporal logic. In C. B. Jones, Z. Liu, and J. Woodcock, editors, Proceedings of the 4th International Colloquium on Theoretical Aspects of Computing (ICTAC'07), volume 4711 of Lecture Notes in Computer Science, pages 291–305. Springer, 2007. (PostScript) (PDF) (bibtex)
Joost-Pieter Katoen, Daniel Klink, Martin Leucker, and Verena Wolf. Three-valued abstraction for continuous-time Markov chains. In Werner Damm and Holger Herrmanns, editors, Proceedings of 19th International Conference on Computer-Aided Verification (CAV'07), volume 4590 of Lecture Notes in Computer Science, pages 316–329. Springer, 2007. (PostScript) (PDF) (bibtex)
Jirí Barnat, Lubos Brim, and Martin Leucker. Parallel model checking and the FMICS-jETI platform. In The Twelfth IEEE International Conference on Engineering of Complex Computer Systems (ICECCS 2007), pages 330–339. IEEE Computer Society Press, 2007. (PostScript) (PDF) (bibtex)
Orna Grumberg, Martin Lange, Martin Leucker, and Sharon Shoham. When not losing is better than winning: Abstraction and refinement for the full μ-calculus. Information and Computation, 205(8):1130–1148, aug 2007. (PostScript) (PDF) (bibtex)
Andreas Bauer, Martin Leucker, and Jonathan Streit. SALT—structured assertion language for temporal logic. In Proceedings of the Eighth International Conference on Formal Engineering Methods, volume 4260 of Lecture Notes in Computer Science, September 2006. (PostScript) (PDF) (bibtex) (abstract)
Olga Grinchtein, Martin Leucker, and Nir Piterman. Inferring network invariants automatically. In Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR'06), volume 4130 of Lecture Notes in Artificial Itelligence, September 2006. (PostScript) (PDF) (bibtex) (abstract)
Martin Leucker and Jaco van de Pol, editors. Proceedings of the 4th Workshop on Parallel and Distributed Methods for Verification, volume 135/2 of Electronic Notes in Computer Science. Elsevier Science Publishers, 2006. (bibtex)
Harald Fecher, Martin Leucker, and Verena Wolf. Don't know in probabilistic systems. In Antti Valmari, editor, 13th International SPIN Workshop on Model Checking of Software (SPIN'06), volume 3925 of Lecture Notes in Computer Science. Springer, 2006. (PostScript) (PDF) (bibtex). see also [LeuckerFW06TR]
Olga Grinchtein and Martin Leucker. Network invariants for real-time systems. Formal Aspects of Computing, 20:619–635, 2008. (PDF) (bibtex). see also [GrinchteinL03]
Lubos Brim and Martin Leucker, editors. Proceedings of the 3rd Workshop on Parallel and Distributed Methods for Verification, volume 128/3 of Electronic Notes in Computer Science. Elsevier Science Publishers, 2005. (bibtex)
Orna Grumberg, Martin Lange, Martin Leucker, and Sharon Shoham. Don't know in the μ-calculus. In Proceedings of the 6th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'05), volume 3385 of Lecture Notes in Computer Science. Springer, 2005. (PostScript) (PDF) (bibtex)
Christel Baier, Marcus Größer, Martin Leucker, Benedikt Bollig, and Frank Ciesinski. Controller synthesis for probabilistic systems. In Proceedings of the IFIP International Conference on Theoretical Computer Science, IFIP TCS2004. Kluwer, August 2004. (bibtex)
Benedikt Bollig and Martin Leucker. Model checking probabilistic distributed systems. In Proceedings of the 8th Asian Computing Science Conference (ASIAN'03), volume 2896 of Lecture Notes in Computer Science, pages 291–304, Mumbai, India, December 2003. Springer. (PostScript) (PDF) (bibtex) (abstract)
Olga Grinchtein and Martin Leucker. Network invariants for real-time systems. In 5th International Workshop on Verification of Infinite-State Systems, volume 98 of Electronic Notes in Theoretical Computer Science, pages 57–74. Elsevier Science Publishers, 2004. (PostScript) (PDF) (bibtex). see also [GrinchteinL06]
Martin Leucker, Rafal Somla, and Michael Weber. Parallel model checking for LTL, CTL* and L_μ². In Lubos Brim and Orna Grumberg, editors, Electronic Notes in Theoretical Computer Science, volume 89. Elsevier Science Publishers, 2003. (PostScript) (PDF) (bibtex)
Benedikt Bollig and Martin Leucker. Verifying qualitative properties of probabilistic programs. In Validation of Stochastic Systems, volume 2925 of Lecture Notes in Computer Science, pages 124–146. Springer, 2004. (PostScript) (PDF) (bibtex) (abstract)
Benedikt Bollig, Martin Leucker, and Michael Weber. Local parallel model checking for the alternation-free mu-calculus. In Proceedings of the 9th International SPIN Workshop on Model checking of Software (SPIN '02), volume 2318 of Lecture Notes in Computer Science. Springer-Verlag Inc., 2002. (PDF) (bibtex). see also [BolligLeuckerWeber01]
Martin Leucker. Logics for Mazurkiewicz traces. PhD thesis, Lehrstuhl für Informatik II, RWTH Aachen, 2002. (PostScript) (PDF) (bibtex)
Martin Leucker. Prefix-recognizable graphs and monadic logic. In Erich Grädel, Wolfgang Thomas, and Thomas Wilke, editors, Automata, Logics and Infinite Games, volume 2500 of Lecture Notes in Computer Science, pages 263–283. Springer, 2002. (PDF) (bibtex)
Benedikt Bollig and Martin Leucker. Deciding LTL over Mazurkiewicz traces. Data & Knowledge Engineering, 44/2:221–240, February 2003. (PDF) (bibtex)
Benedikt Bollig and Martin Leucker. Modelling, Specifying, and Verifying Message Passing Systems. In Claudio Bettini and Angelo Montanari, editors, Proceedings of the Symposium on Temporal Representation and Reasoning (TIME'01), pages 240–248. IEEE Computer Society Press, June 2001. (PostScript) (bibtex)
Benedikt Bollig and Martin Leucker. Deciding LTL over Mazurkiewicz traces. In Claudio Bettini and Angelo Montanari, editors, Proceedings of the Symposium on Temporal Representation and Reasoning (TIME'01), pages 189–197. IEEE Computer Society Press, June 2001. (PostScript) (bibtex)
B. Bollig, J. Henriksen, and M. Leucker. Deciding LTL over Mazurkiewicz traces. In R. Freund, editor, Theorietag 2000 mit Workshop ``New Computing Paradigms: Molecular Computing and Quantum Computing'', pages 167–174. Vienna University of Technology, 2000. (PostScript) (bibtex)
Benedikt Bollig, Martin Leucker, and Michael Weber. Local parallel model checking for the alternation free μ–calculus. Technical Report AIB-04-2001, RWTH Aachen, March 2001. (PostScript) (bibtex)
Benedikt Bollig and Martin Leucker. Deciding LTL over Mazurkiewicz traces. Technical Report AIB-02-2001, RWTH Aachen, February 2001. (PostScript) (bibtex)
Martin Leucker. On model checking synchronised hardware circuits. In Jifeng He and Masahiko Sato, editors, Proceedings of the 6th Asian Computing Science Conference (ASIAN'00), volume 1961 of Lecture Notes in Computer Science, pages 182–198, Penang, Malaysia, November 2000. Springer. (PostScript) (bibtex)
M. Leucker. Erfüllbarkeit globaler spurlogiken mittels alternierender automaten. In F. Otto and G. Niemann, editors, 9. Theorietag der GI–Fachgruppe 0.1.5 ``Automaten und Formale Sprachen'', volume 12/99 of Preprint, pages 46–47. University of Kassel, 1999. (bibtex)
J. Henriksen and M. Leucker. The automata-theoretic approach works for global trace logics. In Proceedings of the 11th Nordic Workshop on Programming Theory. Uppsala University, October 1999. (bibtex)
M. Leucker. Model checking games for the alternation free mu-calculus and alternating automata. In Harald Ganzinger, David McAllester, and Andrei Voronkov, editors, Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning "(LPAR'99)", volume 1705 of Lecture Notes in Artificial Intelligence, pages 77–91. Springer, 1999. (PostScript) (bibtex) (abstract)
Martin Lange and Martin Leucker. Effizientes spielbasiertes model checking für den alternierungsfreien mu-kalkül. In H. Seidl, editor, 8. Theorietag der GI–Fachgruppe 0.1.5 ``Automaten und Formale Sprachen'', volume 98–17 of Forschungsbericht. University of Trier, 1998. (bibtex)

Verification Tools

Bibliography generated from verificationtools.aux

Andreas Bauer and Martin Leucker. The theory and practice of SALT. In Mihaela Gheorghiu Bobaru, Klaus Havelund, Gerard J. Holzmann, and Rajeev Joshi, editors, NASA Formal Methods, volume 6617 of Lecture Notes in Computer Science, pages 13–40. Springer, 2011. (bibtex)
Andreas Bauer, Martin Leucker, Christian Schallhart, and Michael Tautschnig. Don't care in SMT—building flexible yet efficient abstraction/refinement solvers. Software Tools for Technology Transfer (STTT), 12(1):23–37, 2010. (bibtex)
Fredrik Holmén, Martin Leucker, and Marcus Lindström. UppDMC – a distributed model checker for fragments of the μ-calculus. In Lubos Brim and Martin Leucker, editors, Proceedings of the 3rd Workshop on Parallel and Distributed Methods for Verification, volume 128/3 of Electronic Notes in Computer Science. Elsevier Science Publishers, 2004. (PostScript) (PDF) (bibtex) (abstract)
Martin Leucker, Thomas Noll, Perdita Stevens, and Michael Weber. Functional programming languages for verification tools: A comparison of ML and Haskell. Software Tools for Technology Transfer (STTT), 7(2):184–194, 2005. (PDF) (bibtex)
Benedikt Bollig, Martin Leucker, and Michael Weber. Local parallel model checking for the alternation-free mu-calculus. In Proceedings of the 9th International SPIN Workshop on Model checking of Software (SPIN '02), volume 2318 of Lecture Notes in Computer Science. Springer-Verlag Inc., 2002. (PDF) (bibtex). see also [BolligLeuckerWeber01]
Martin Leucker, Thomas Noll, Perdita Stevens, and Michael Weber. Functional programming languages for verification tools: experiences with ML and Haskell. In Proceedings of the 3rd Scottish Functional Programming Workshop, University of Stirling, 2001. (PostScript) (bibtex)
Martin Leucker and Thomas Noll. A distributed model checking tool tailored to Erlang. In Proceedings of the Erlang Workshop, 2001. (bibtex)
Benedikt Bollig, Martin Leucker, and Michael Weber. Parallel model checking for the alternation free μ-calculus. In Tiziana Margaria and Wang Yi, editors, Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'01), volume 2031 of Lecture Notes in Computer Science, pages 543–558. Springer, April 2001. (bibtex). see also [BLW02]
Benedikt Bollig, Martin Leucker, and Michael Weber. Local parallel model checking for the alternation free μ–calculus. Technical Report AIB-04-2001, RWTH Aachen, March 2001. (PostScript) (bibtex)
Martin Leucker and Thomas Noll. Truth/SLC - A parallel verification platform for concurrent systems. In Gérard Berry, Hubert Comon, and Alain Finkel, editors, Proceedings of the 13th Conference on Computer-Aided Verification (CAV'01), volume 2102 of Lecture Notes in Computer Science, pages 255–259. Springer, July 2001. (PostScript) (bibtex)
Martin Leucker and Thomas Noll. Truth - A real-world application in Haskell. In Markus Mohnen, editor, Proceedings of the 12th International Workshop on Implementation of Functional Languages (IFL'00), number AIB-00-7 in Aachener Informatik Berichte, pages 363–380. RWTH Aachen, September 2000. (PostScript) (bibtex)
Martin Leucker. Parallel model checking for the alternation-free mu-calculus. In Gerhard Schellhorn and Wolfgang Reif, editors, FM-TOOLS 2000, The 4th Workshop on Tools for System Design and Verification, volume 2000-07, pages 135–140. Ulmer Informatik Berichte, May 2000. Extended Abstract. (bibtex). see also [BLW02]
Martin Leucker and Thomas Noll. Rewriting logic as a framework for generic verification tools. In Proceedings of the Third International Workshop on Rewriting Logic and its Applications (WRLA'00), volume 36 of Electronic Notes in Theoretical Computer Science. Elsevier, 2000. (bibtex)
M. Leucker and T. Noll. Rapid prototyping of specification language implementations. In Proceedings of the 10th IEEE International Workshop on Rapid System Prototyping, pages 60–65. IEEE Computer Society Press, 1999. (bibtex) (abstract)
M. Lange, M. Leucker, T. Noll, and S. Tobies. Truth – a verification platform for concurrent systems. In Tool Support for System Specification, Development, and Verification, Advances in Computing Science. Springer, Wien New York, 1999. (bibtex) (abstract)
M. Lange, M. Leucker, T. Noll, and S. Tobies. Truth – a verification platform for concurrent systems. In Proceedings of Tools'98. Christian-Albrechts University of Kiel, 1998. (PostScript) (bibtex) (abstract)
Martin Leucker. Rewriting logic as a framework for building generic tools for verifying concurrent systems. Unpublished, 1998. (PostScript) (bibtex)
Martin Leucker and Stephan Tobies. Truth—a platform for verification of distributed systems. Technical Report 98-05, RWTH Aachen, May 1998. (PostScript) (bibtex) (abstract)

Miscellaneous

Bibliography generated from miscellaneous.aux

Martin Sachenbacher, Martin Leucker, Andreas Artmeier, and Julian Haselmayr. Efficient energy-optimal routing for electric vehicles. In AAAI Conference on Artificial Intelligence, Special Track on Computational Sustainability. AAAI, 2011. to appear. (bibtex)
Andreas Artmeier, Julian Haselmayr, Martin Leucker, and Martin Sachenbacher. The shortest path problem revisited: Optimal routing for electric vehicles. In Rüdiger Dillmann, Jürgen Beyerer, Uwe D. Hanebeck, and Tanja Schultz, editors, KI, volume 6359 of Lecture Notes in Computer Science, pages 309–316. Springer, 2010. (bibtex)
Javier Esparza, Martin Leucker, and Maximilian Schlund. Learning workflow Petri nets. In Proceedings of the 31st International Conference on Application and Theory of Petri Nets and Other Models of Concurrency (Petri Nets'10), volume 6128 of Lecture Notes in Computer Science. Springer, 2010. (bibtex)
Martin Leucker and Carroll Morgan, editors. Proceedings of the 6^th International Colloquium on Theoretical Aspects of Computing (ICTAC'09), volume 5684 of Lecture Notes in Computer Science. Springer, August 2009. (bibtex)
Benedikt Bollig, Peter Habermehl, Carsten Kern, and Martin Leucker. Angluin-style learning of NFA. In 21st International Joint Conference on Artifical Intelligence (IJCAI'09), July 2009. (bibtex). see also [LSV:08:28]
Benedikt Bollig, Peter Habermehl, Carsten Kern, and Martin Leucker. Angluin-style learning of NFA. Research Report LSV-08-28, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2008. 30 pages. (bibtex)
Alexander Gruler, Martin Leucker, and Kathrin Scheidemann. Calculating and modeling common parts of software product lines. In Proceedings of the 12th International Software Productlines Conference (SPLC'08), Limerick, Ireland, September 2008. IEEE. (bibtex) (abstract)
Lubos Brim and Martin Leucker. Foreword—special issue on parallel and distributed model checking. Formal Methods in System Design, 29(2), 2006. (bibtex)
Olga Grinchtein and Martin Leucker. Learning finite-state machines from inexperienced teachers. In Grammatical Inference: Algorithms and Applications, 8th International Colloquium, ICGI 2006, volume 4201 of Lecture Notes in Computer Science, September 2006. (PostScript) (PDF) (bibtex) (abstract)
Martin Leucker and Thomas Noll. Truth - A real-world application in Haskell. In Markus Mohnen, editor, Proceedings of the 12th International Workshop on Implementation of Functional Languages (IFL'00), number AIB-00-7 in Aachener Informatik Berichte, pages 363–380. RWTH Aachen, September 2000. (PostScript) (bibtex)
F. Baader and M. Leucker. Comparison of two semantic approaches to unification. In Proceedings of the 12th International Workshop on Unification, number SI-98/8 in Research Report, Universita di Roma, La Sapienza, June 1998. (PostScript) (bibtex)
Martin Leucker. Comparison of two semantic approaches to unification. Master's thesis, RWTH Aachen, 1996. (PostScript) (bibtex) (abstract)