A. Sch urr, A. Winter, and A. Z undorf. The PROGRES approach: Language and environment. In [11].  Home/Search   Document Details and Download   Summary   Related Articles   Check

....conditions on nested graphs. Shape rules are similar to algebraic data type de nitions in functional languages, but more powerful as sharing of substructures may be speci ed as well; they also go beyond typing concepts of other programming languages based on graph transformation like ProGres [24], which merely restrict the labelling and degree of nodes and edges. Nested graph transformation is re ned to shapely nested graph transformation, by using shapes as a consistent and decidable type discipline that rules out illshaped graphs. Finally, we demonstrate that shapely nested graph ....

....ow graphs with recursive calls. Then results concerning the cyclic representations of in nite terms could be employed [14] Shapes are just a structural way of classifying values according to their (graph ical) representation. More type discipline would be useful, for instance as in Progres [24]. Also, context free graph languages might be too restricted for specifying the shapes of graphs that occur in certain applications. Then Church Rosser graph languages [17] could be considered. The Perspective. Shapely graph transformation shall become the computational model for the rule based ....

A. Schurr, A. Winter, and A. Zundorf. The Progres approach: Language and environment. In Rozenberg [21], chapter 13, pages 487-550. 15

....employed. Lists of typed attributes of objects and typed program variables have been mentioned above as most simple examples. Di erent kinds of graphs, like labelled, typed and or attributed graphs or graph like structures are used in graph transformation based approaches like AGG [19] PROGRESS [16, 17] and others [3] In the standard version of transformation systems partial algebras are used as data state models. This allows us to include and reason about static data types explicitly, to represent parameterized attributes as partial functions, and to use mutable sets, for example to represent ....

A. Schurr, A. Winter, and A. Zundorf. The PROGRES-approach: Language and environment. In H. Ehrig, G. Engels, J.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages and Tools. World Scienti c, 1999.

....conditions on nested graphs. Shape rules are similar to algebraic data type definitions in functional languages, but more powerful as sharing of substructures may be specified as well; they also go beyond typing concepts of other programming languages based on graph transformation like PROGRES [24], which merely restrict the labelling and degree of nodes and edges. Nested graph transformation is refined to shapely nested graph transformation, by using shapes as a consistent and decidable type discipline that rules out illshaped graphs. Finally, we demonstrate that shapely nested graph ....

....flow graphs with recursive calls. Then results concerning the cyclic representations of infinite terms could be employed [14] Shapes are just a structural way of classifying values according to their (graph ical) representation. More type discipline would be useful, for instance as in PROGRES [24]. Also, context free graph languages might be too restricted for specifying the shapes of graphs that occur in certain applications. Then Church Rosser graph languages [17] could be considered. The Perspective. Shapely graph transformation shall become the computational model for the rule based ....

A. Sch/irr, A. Winter, and A. Z/indorf. The PROGRES approach: Language and environment. In Rozenberg [21], chapter 13, pages 487-550. 15

....by a tool for implementing the semantics of diagrams. Shapely nested graph transformation [14] has been devised as the computational model of DiaPlan. This model is rather intuitive, although it supports powerful concepts that are not found in other graph transformation languages like Progres [23] and Agg [9] Edges may contain graphs in a nested fashion, for a compositional structuring of graphs. Graph variables allow subgraphs of arbitrary size to be duplicated, compared, or deleted in a single transformation step. The admissible shape of graphs can be speci ed by syntactic ....

A. Schurr, A. Winter, and A. Zundorf. The Progres approach: Language and environment. In Engels et al. [7], chapter 13, pages 487-550.

....The task shown on the top represents the process as a whole. The incoming requirements are passed down to the subtasks on the left hand side; conversely, the developed application is passed upwards by the subtask on the right hand side. Development starts with writing a PROGRES speci cation [20] de ning the underlying graph and its operations. The speci cation is debugged within the PROGRES environment which o ers an interpreter for executing graph transformations. In the case of an error, feedback occurs (represented by a feedback ow) and the writer of the speci cation receives an ....

....the menus, view elements and lters is presented in Figure 9. The task net displayed by the tool now very much resembles the manually drawn task net of Figure 1. Figure 9: Customized application 5 Related Work UPGRADE and PROGRES the latter of which has been described extensively elsewhere [20] jointly constitute a meta CASE tool, i.e. a CASE tool for developing CASE tools. Usually, the term meta CASE refers to CASE tools supporting graphical methods for requirements engineering and design. However, it can also be applied to environment generators for textual programming languages, ....

A. Schurr, A. Winter, and A. Zundorf. The PROGRES approach: Language and environment. In Ehrig et al. [5], pages 487-550. 16

....focuses particularly on understanding the behavior by visualizing and animating traces, constructing state diagrams, etc. Internally, telecommunication systems are represented by various kinds of graphs. The structure of these graphs and the effects of graph operations are formally in PROGRES [2], a specification language which is based on programmed graph transformations. From the specification, code is generated which constitutes the core part of the application logic. In addition, the E CARES prototype includes various parsers and scripts to process textual information, e.g. source ....

Sch/irr, A., Winter, A., Z/indorf, A.: The PROGRES approach: Language and environment. [24] 487-550

....the framework. The first step in building an application based on UPGRADE is to provide the application logic. This can be done by implementing it manually using for example an OODB as a storage device. However, this may be a tedious and error prone task. Rather, we use the PROGRES environment [26] for generating the application logic from a formal specification. PROGRES is a visual language based on programmed graph transformations. Here, we use PROGRES as a meta language for defining visual languages. In the AHEAD system introduced in Section , visual languages for activities, products, ....

A. Sch urr, A. Winter, and A. Z undorf. The PROGRES approach: Language and environment. In Ehrig et al. [7], pages 487--550.

....In this paper, we will content ourselves to software engineering. Figure 1 provides an overview of our graph based management system. The management model is defined in PROGRES, which denotes both a language and an environment for the development of programmed graph rewriting sys tems [26]. Various kinds of tools are generated from the specification. A project management tool offers graphical views on management data and provides commands for planning and controlling development projects. Developers are supported by an agenda tool which displays a list tasks to be executed. ....

....and queries are performed on the internal data structure. We have chosen programmed graph rewriting in order to specify these complex operations on a high level of abstraction. In particular, we have used the specification language PROGRES, which is based on programmed graph rewriting [26]. Below, we will present small cutouts of the specification of the management submodels and their integration. Due to the lack of space, we will discuss only the base models, i.e. the model cores shared by all application domains. In order to use the models in different domains such as software, ....

A. Sch//rr, A. Winter, and A. Z//ndorf. The PROGRES approach: Language and environment. In Ehrig et al. [6], pages 487-550.

....Werkzeuge entstehen und wie die Modelle der zu unterst utzenden Entwicklungsprozesse definiert werden (Definitionszeit) Managementwerkzeuge werden aus einer formalen Spezifikation generiert, die auf programmierten Graphersetzungsregeln basiert. Zu diesem Zweck wird die PROGRESUmgebung [60, 61] verwendet (oben links) PROGRES bezeichnet zum einen eine Spezifikationssprache und zum anderen eine Umgebung, die integrierte Werkzeuge zum syntaxgest utzten Edieren, Analysieren und Interpretieren anbietet. Aus einer mit der PROGRES Umgebung erstellten Spezifikation wird mit Hilfe eines ....

....oder Aufgabennetze werden in einheitlicher Weise als Graphen modelliert. Die von der Manager und der Entwicklerumgebung angebotenen Operationen werden mit Hilfe von Graphersetzungsregeln auf einer hohen Abstraktionsebene formal spezifiziert. Als Spezifikationssprache wird PROGRES [60, 61] benutzt. In einem Graphschema wird die Struktur von Graphen einer bestimmten Klasse statisch beschrieben. Ein Graphschema definiert Knotenklassen, die in einer Vererbungshierarchie angeordnet sind. Den Knoten k onnen sowohl ei B. Westfechtel: Ein graphbasiertes Managementsystem f ur dynamische ....

[Article contains additional citation context not shown here]

Sch urr, A., Winter, A., Z undorf, A.: The PROGRES Approach: Language and Environment. In: Ehrig, H. et al. [12], pp. 487--550

....conditions on nested graphs. Shape rules are similar to algebraic data type definitions in functional languages, but more powerful as sharing of substructures may be speci ed as well; they also go beyond typing concepts of other programming languages based on graph transformation like ProGres [24], which merely restrict the labelling and degree of nodes and edges. Nested graph transformation is re ned to shapely nested graph transformation, by using shapes as a consistent and decidable type discipline that rules out ill shaped graphs. Finally, we demonstrate that shapely nested graph ....

....ow graphs with recursive calls. Then results concerning the cyclic representations of in nite terms could be employed [14] Shapes are just a structural way of classifying values according to their (graph ical) representation. More type discipline would be useful, for instance as in Progres [24]. Also, context free graph languages might be too restricted for specifying the shapes of graphs that occur in certain applications. Then ChurchRosser graph languages [17] could be considered. The Perspective. Shapely graph transformation shall become the computational model for the rule based ....

A. Schurr, A. Winter, and A. Zundorf. The Progres approach: Language and environment. In Rozenberg [21], chapter 13, pages 487-550. 15

No context found.

A. Sch urr, A. Winter, and A. Z undorf. The PROGRES approach: Language and environment. In [11].

No context found.

A. Schurr, A. Winter, and A. Zundorf. The Progres approach: Language and environment. In Engels et al. [5], chapter 13, pages 487-550.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC