Rapid Prototyping of Specification Language Implementations
Title | Rapid Prototyping of Specification Language Implementations |
Publication Type | Conference Paper |
Year of Publication | 1999 |
Authors | Leucker, M, Noll, T |
Conference Name | Proceedings of the 10th IEEE International Workshop on Rapid System Prototyping |
Publisher | IEEE Computer Society Press |
Abstract | Specification languages such as LOTOS and SDL play an important rôle in the design and implementation of distributed systems. Their for\-mal syntax and semantics supports the development of compilers and of verification tools. This paper introduces a generic and uniform approach to support such languages in verification tools. We present a compiler generator which, given the description of a specification language, automatically generates a corresponding implementation. More specifically, the syntax and semantics of the specification language has to be defined using Meseguer's Rewriting Logic formalism, a unified semantic framework for concurrency. From this description a compiler is derived which parses a given system specification and computes the corresponding semantic object, such as a labelled transition system. The latter can be processed further in subsequent analysis and verification phases. Thus we propose some kind of ``meta–pro\-to\-typing'' approach in the sense that new specification formalisms for distributed systems can easily be tested without the need to develop an implementation by hand. |
@inproceedings {LN99, title = {Rapid Prototyping of Specification Language Implementations}, booktitle = {Proceedings of the 10th IEEE International Workshop on Rapid System Prototyping}, year = {1999}, pages = {60{\textendash}65}, publisher = {IEEE Computer Society Press}, organization = {IEEE Computer Society Press}, abstract = {Specification languages such as LOTOS and SDL play an important r{\^o}le in the design and implementation of distributed systems. Their for\-mal syntax and semantics supports the development of compilers and of verification tools. This paper introduces a generic and uniform approach to support such languages in verification tools. We present a compiler generator which, given the description of a specification language, automatically generates a corresponding implementation. More specifically, the syntax and semantics of the specification language has to be defined using Meseguer{\textquoteright}s Rewriting Logic formalism, a unified semantic framework for concurrency. From this description a compiler is derived which parses a given system specification and computes the corresponding semantic object, such as a labelled transition system. The latter can be processed further in subsequent analysis and verification phases. Thus we propose some kind of {\textquoteleft}{\textquoteleft}meta{\textendash}pro\-to\-typing{\textquoteright}{\textquoteright} approach in the sense that new specification formalisms for distributed systems can easily be tested without the need to develop an implementation by hand.}, author = {Martin Leucker and T. Noll} }
- News
- Research
- Teaching
- Staff
- Martin Leucker
- Diedrich Wolter
- Ulrike Schräger-Ahrens
- Aliyu Ali
- Mahmoud Abdelrehim
- Phillip Bende
- Juljan Bouchagiar
- Marc Bätje
- Tobias Braun
- Gerhard Buntrock
- Anja Grotrian
- Hannes Hesse
- Raik Hipler
- Elaheh Hosseinkhani
- Hannes Kallwies
- Frauke Kerlin
- Karam Kharraz
- Mohammad Khodaygani
- Ludwig Pechmann
- Waqas Rehan
- Martin Sachenbacher
- Andreas Schuldei
- Annette Stümpel
- Gesina Schwalbe
- Tobias Schwartz
- Daniel Thoma
- Lars Vosteen
- Open Positions
- Contact