#### Filter Results:

- Full text PDF available (42)

#### Publication Year

2005

2017

- This year (10)
- Last 5 years (41)
- Last 10 years (64)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Christoph Eichner, Hans Fleischhack, Roland Meyer, Ulrik Schrimpf, Christian Stehno
- SDL Forum
- 2005

With the introduction of UML 2.0, many improvements to diagrams have been incorporated into the language. Some of the major changes were applied to sequence diagrams, which were enhanced with most of the concepts from ITU-T’s Message Sequence Charts, and more. In this paper, we introduce a formal semantics for most concepts of sequence diagrams by means of… (More)

- Ahmed Bouajjani, Egor Derevenetc, Roland Meyer
- ESOP
- 2013

We present algorithms for checking and enforcing robustness of concurrent programs against the Total Store Ordering (TSO) memory model. A program is robust if all its TSO computations correspond to computations under the Sequential Consistency (SC) semantics. We provide a complete characterization of non-robustness in terms of so-called attacks: a… (More)

- Johannes Faber, Roland Meyer
- 2006 Formal Methods in Computer Aided Design
- 2006

The behavior of embedded hardware and software systems is determined by at least three dimensions: control flow, data aspects, and real-time requirements. To specify the different dimensions of a system with the best-suited techniques, the formal language CSP-OZ-DC (Hoenicke and Maier, 2005) integrates communicating sequential processes (CSP) (Hoare, 1985),… (More)

- Zhenyue Long, Georgel Calin, Rupak Majumdar, Roland Meyer
- FASE
- 2012

- Roland Meyer
- IFIP TCS
- 2008

- Roland Meyer
- 2008

We investigate the class PBD of π-Calculus processes that are bounded in the function depth. First, we show that boundedness in depth has an intuitive characterisation when we understand processes as graphs: a process is bounded in depth if and only if the length of the simple paths is bounded. The proof is based on a new normal form for the π-Calculus… (More)

- Steffen Becker, Wilhelm Hasselbring, +13 authors Timo Warns
- ACM SIGSOFT Software Engineering Notes
- 2006

Basic concepts and terminology for trustworthy software systems are discussed. Our discussion of definitions for terms in the domain of trustworthy software systems is based on former achievements in dependable, trustworthy and survivable systems. We base our discussion on the established literature and on approved standards. These concepts are discussed in… (More)

- Roland Meyer, Tim Strazny
- CAV
- 2010

We introduce Petruchio, a tool for computing Petri net translations of dynamic networks. To cater for unbounded architectures beyond the capabilities of existing implementations, the principle fixedpoint engine runs interleaved with coverability queries. We discuss algorithmic enhancements and provide experimental evidence that Petruchio copes with models… (More)

- Roland Meyer, Johannes Faber, Andrey Rybalchenko
- Formal Aspects of Computing
- 2006

Model checking of real-time systems against Duration Calculus (DC) specifications requires the translation of DC formulae into automata-based semantics. The existing algorithms provide a limited DC coverage and do not support compositional verification. We propose a translation algorithm that advances the applicability of model checking tools to realistic… (More)

- Ahmed Bouajjani, Roland Meyer, Eike Möhlmann
- ICALP
- 2011