| 2005 |
| DOI | Erika Ábrahám, Frank S. de Boer, Marcello Bonsangue, Andreas Grüner, Martin Steffen.
Observability, Connectivity, and Replay in a Sequential Calculus of Classes,
Volume 3657 : Tutorial of LNCS, pages 296-316, Springer, 2005. |
| DOI | Frank S. de Boer, Marcello Bonsangue, Martin Steffen, Erika Ábrahám.
A Fully Abstract Trace Semantics for UML Components,
Volume 3657 : Tutorial of LNCS, pages 49-69, Springer, 2005. |
| DOI | Erika Ábrahám, Bernd Becker, Felix Klaedtke, Martin Steffen.
Optimizing Bounded Model Checking for Linear Hybrid Systems,
Volume 3385 of LNCS, pages 396-412, Springer, 2005. |
| Erika Ábrahám, Andreas Grüner, Martin Steffen.
Dynamic Heap-Abstraction for Open, Object-Oriented Systems with Thread Classes,
Volume RR-05-04 of Research report / Queen Mary, University of London, Department of Computer Science, pages 47-61, Queen Mary, University of London, Department of Computer Science, 2005. |
| DOI | Benedikt Bollig, Martin Leucker.
A hierarchy of implementable MSC languages,
Volume 3731 of LNCS, pages 53-67, Springer, 2005. |
| DOI | Benedikt Bollig.
On the expressiveness of asynchronous cellular automata,
Volume 3623 of LNCS, pages 528-539, Springer, 2005. |
| DOI | Martin Leucker, Thomas Noll, Perdita Stevens, Michael Weber.
Functional programming languages for verification tools,
pages 184-194, Springer, 2005. |
| DOI | Pedro R. D'Argenio, Joost-Pieter Katoen.
A theory of stochastic systems. Part I,
pages 1-38, Elsevier, 2005. |
| DOI | Christel Baier, Joost-Pieter Katoen, Holger Hermanns, Verena Wolf.
Comparative branching-time semantics for Markov chains,
pages 149-214, Elsevier, 2005. |
| DOI | Pedro R. D'Argenio, Joost-Pieter Katoen.
A theory of stochastic systems. Part II,
pages 39-74, Elsevier, 2005. |
| DOI | Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen.
Model checking meets performance evaluation,
pages 10-15, Association for Computing Machinery, 2005. |
| DOI | Erika Ábrahám, Frank S. de Boer, Willem-Paul de Roever, Martin Steffen.
An Assertion-Based Proof System for Multithreaded Java,
pages 251-290, Elsevier, 2005. |
| 2003 |
| DOI | Benedikt Bollig, Martin Leucker.
Model checking probabilistic distributed systems,
Volume 2896 of LNCS, pages 291-304, Springer, 2003. |
| DOI | Benedikt Bollig, Martin Leucker.
Deciding LTL over Mazurkiewicz traces,
North-Holland, 2003. |
| 2002 |
| DOI | .
Implementation of functional languages,
Volume 2312 of LNCS, pages VI, 185 S. : graph. Darst., Springer, 2002. |
| Frank Günter Huch, Volker Stolz.
Implementation of port-based distributed Haskell,
Volume 2312 of LNCS, Springer, 2002. |
| Frank Günter Huch.
Model checking Erlang programs,
Volume 2312 of LNCS, Springer, 2002. |
| DOI | Boudewijn R. Haverkort, Lucia Cloth, Holger Hermanns, Joost-Pieter Katoen, Christel Baier.
Model checking performability properties,
pages 103-112, IEEE Computer Society, 2002. |
| DOI | Benedikt Bollig, Martin Leucker, Thomas Noll.
Generalised regular MSC languages,
Volume 2303 of LNCS, pages 52-66, Springer, 2002. |
| DOI | Pankaj K. Garg, Kave Eshghi, Thomas Gschwind, Boudewijn R. Haverkort, Katinka Wolter.
Enabling network caching of dynamic Web objects,
Volume 2324 of LNCS, pages 329-338, Springer, 2002. |
| DOI | Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen.
Automated performance and dependability evaluation using model checking,
Volume 2459 of LNCS, pages 261-289, Springer, 2002. |
| DOI | Markus Mohnen.
A graph-free approach to data-flow analysis,
Volume 2304 of LNCS, pages 46-61, Springer, 2002. |
| DOI | Benedikt Bollig, Martin Leucker, Philipp Lucas.
Extending compositional message sequence graphs,
Volume 2514 of LNCS, pages 68-85, Springer, 2002. |
| DOI | Gianfranco Ciardo, Reinhard German, Boudewijn R. Haverkort.
Introduction to the special section on Petri Nets and Performance Models,
pages 913-914, IEEE, 2002. |
| 2001 |
| Full Text | .
Kolloquium programmiersprachen und Grundlagen der Programmierung ; 11 (Simmerath-Rurberg),
Volume 2001,11 of Aachener Informatik-Berichte, pages 128 Bl.. : graph. Darst., RWTH, Department of Computer Science, 2001. |