February 2002 - tr-announce - lists.rwth-aachen.de

[tr-announce] AIB: Modelling Requirements and Architectures for Software Product Lines
by Volker Stolz 26 Feb '02

26 Feb '02

The following technical report is available from http://aib.informatik.rwth-aachen.de/: Horst Lichter, Thomas von der Maßen, Thomas Weiler Modelling Requirements and Architectures for Software Product Lines 2002-05 Abstract: The development of software product lines has become a new and promising field in software development in the last few years. Market asks for faster development of new software products which also must be cheap and of high quality. Here software product line engineering offers software companies the possibility to adress this market needs by also reducing the development costs. Software product line engineering is based on the domain engineering which provides a basis of core assets (also called platform), which in turn can be reused by thereon based applications in the application engineering. Thereby it is essential to model the variability which occurs among different applications derived from the platform. Within requirements engineering the specification of requirements only in natural language isn't adequate to obtain a most possible complete and consistent description of requirements. Because existing notations aren't adequat for modeling requirements for software product lines a new approach is required. Also architecture modeling for software product lines requires new concepts for modeling the common and variable parts of a software product line. Therefore software architectures for software product lines can be described by means of feature components which represent a specific characteristic of the system to be modeled. This report adresses these problems and offers new concepts for their solution. -- Wonderful \hbox (0.80312pt too nice) in paragraph at lines 16--18 Volker Stolz * stolz(a)i2.informatik.rwth-aachen.de Please use PGP or S/MIME for correspondence!

1 0

[tr-announce] AIB: Innermost Termination of Context-Sensitive Rewriting
by Volker Stolz 19 Feb '02

19 Feb '02

The following technical report is available from http://aib.informatik.rwth-aachen.de/: Jürgen Giesl, Aart Middeldorp Innermost Termination of Context-Sensitive Rewriting 2002-04 Abstract: Context-sensitive rewriting is a term rewriting strategy used to model evaluation strategies in functional programming and in programming languages like OBJ. For example, under certain conditions termination of an OBJ program is equivalent to innermost termination of the corresponding context-sensitive rewrite system [Lucas, 2001]. To prove termination of context-sensitive rewriting, several methods have been proposed in the literature which transform context-sensitive rewrite systems into ordinary rewrite systems such that termination of the transformed ordinary system implies termination of the original context-sensitive system. None of these transformation methods is very satisfactory when it comes to proving innermost termination. We present a simple transformation which is both sound and complete for innermost termination. -- Wonderful \hbox (0.80312pt too nice) in paragraph at lines 16--18 Volker Stolz * stolz(a)i2.informatik.rwth-aachen.de Please use PGP or S/MIME for correspondence!

1 0

[tr-announce] AIB: Generalised Regular MSC Languages
by Volker Stolz 19 Feb '02

19 Feb '02

[The web pages finally moved to a new layout and automated generation of HTML code. Please report any problems to tr-admin(a)informatik.rwth-aachen.de!] The following technical report is available from http://aib.informatik.rwth-aachen.de/: Benedikt Bollig, Martin Leucker, Thomas Noll Generalised Regular MSC Languages 2002-03 Abstract: We establish the concept of regularity for languages consisting of Message Sequence Charts (MSCs). To this aim, we formalise their behaviour by string languages and give a natural definition of regularity in terms of an appropriate Nerode right congruence. Moreover, we present a class of accepting automata and establish several decidability and closure properties of MSC languages. We also provide a logical characterisation by a monadic second-order logic interpreted over MSCs. In contrast to existing work on regular MSC languages, our approach is neither restricted to a certain class of MSCs nor tailored to a fixed communication medium (such as a FIFO channel). It explicitly allows MSCs with message overtaking and is thus applicable to a broad range of channel types like mixtures of stacks and FIFOs. Regards, Volker Stolz -- Wonderful \hbox (0.80312pt too nice) in paragraph at lines 16--18 Volker Stolz * stolz(a)i2.informatik.rwth-aachen.de Please use PGP or S/MIME for correspondence!

1 0