Schurr, A., Winter, A., Zundorf, A.: Graph grammar engineering with PROGRES. In: Proceedings 5th European Software Engineering Conference ESEC. Volume LNCS 989., Springer (1995) 219--234  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the process modeler [26] Internally, AHEAD is based on a formal specification as a programmed graph rewriting system. To this end, we use the specification language PROGRES as well as its development environment, which offers a graphical editor, an analyzer, an interpreter and a code generator [28]. Both the process meta model and process model definitions are specified in PROGRES. The former was created once by the tool builders of AHEAD; the latter ones are generated automatically by the transformation tool. That is, the process modeler shown in Figure 10 is not aware of the PROGRES ....

A. Schurr, A. Winter, and A. Zundorf. Graph grammar engineering with PROGRES. In W. Schafer and P. Botella, editors, Proceedings of the European Software Engineering Conference (ESEC `95), LNCS 989, pages 219--234, Barcelona, Spain, Sept. 1995. SpringerVerlag.

....in a different programming language, e.g. C . To reduce the effort of implementing the E CARES prototype, we make extensive use of generators and reusable frameworks [14] Scanners and parsers are generated with the help of JLex and jay, respectively. Graph algorithms are written in PROGRES [19], a specification language based on programmed graph transformations. From the specification, code is generated which constitutes the application logic of the E CARES prototype. The user interface is implemented with the help of UPGRADE [1] a framework for building interactive tools for visual ....

A. Schurr, A. J. Winter, and A. Zundorf. Graph grammar engineering with PROGRES. In Proceedings 5th European Software Engineering Conference ESEC 1995.

....Q(r) according to the attribute transfer clauses specified in T. We denote G# for the graph that is produced by the application of a production r to a graph G (in a match m) Note that graph productions are typically represented graphically, e.g. using the notation proposed by Schurr et al. [19]. In the following, we will discuss the sample graph production shown in Figure 3. Operations viewed as graph productions In principle, any tool for software design recovery can be viewed as specific graph transformation systems, where each modifying operation offered to the user is represented ....

....have a super class . In this case, Node 4 will become the super class of the new generalization Note, that both nodes (2 and 3) are determined by the user s selection, parameter a. The dashed border of Node 4 specifies that a match for this node is optional. We adopted this notation from [19]. This notation is merely an abbreviation since productions with optional graph elements can always be presented by a set of productions without optional graph elements. Node 5) The transfer clause at the bottom of Figure 3 specifies that the new class is abstract by assigning the true value ....

[Article contains additional citation context not shown here]

Schurr, A., A. Winter, and A. Zundorf. Graph Grammar Engineering with PROGRES. in European Software Engineering Conference (ESEC). 1995: Springer Verlag.

....stereotypical code patterns. Code patterns are specified on a high level of abstraction using layered graph grammars (LGG) 22] They are stored in a pattern library that can easily be extended. The actual pattern recognition algorithm is implemented in the graphical programming language Progres [23]. Module Schema Extraction provides functionality to extract information about the meta data of the legacy DB, while module Extension Extraction allows to access the available legacy data. We use an abstract interface to facilitate the adaption of the Varlet Analyst to different DB platforms. The ....

A. Schrr, A. J. Winter, and A. Zndorf. Graph Grammar Engineering with PROGRES. In W. Schfer, editor, Software Engineering - ESEC '95. Springer Verlagar Engineering with PROGRES, 1995.

....technical development tools are integrated into the environment and can be activated on selected documents provided by the workspace tool. For the internal operational definition of dynamic task nets we utilize the graph transformation system PROGRES (PROgrammed Graph REwriting Systems [24]) Graph transformations are a suitable approach because task nets form complex graph data structures and operations to manipulate and enact task nets can be specified using a uniform mechanism. This enables intertwined editing and enacting of task nets as was presented in Section 2. In a PROGRES ....

A. Schfirr, A. Winter, and A. Zfindorf. Graph grammar engineering with PROGRES. In Proc. ESEC '95, LNCS 989, pages 219-234, Barcelona, Spain, Sept. 1995.

....source code PROGRES specification of the transformaon f TXL rules or source code transformation visualization for Object COBOL Figure 3. Realization with the help of generators. At the design level, REforDI employs graphs rather than trees. Here, we make use of the PROGRES environment [8, 9]. PROGRES is a speci cation language which is based on attributed graphs. In PROGRES, both graph structures and graph operations may be speci ed at a high level of abstraction. The PROGRES environment offers tools for editing, analyzing, and interpreting speci cations, as well as a compiler which ....

Scharr A, Winter AJ, Zndorf A. Graph grammar engineering with PROGRES. Schler W, Botella P (eds.): Proceedings 5th European Software Engineering Conference ESEC 1995, LNCS 989. Springer: Heidelberg, Germany, 1995; 219 234.

....between version sets. 1: m and 1: n relationships are modeled through non functional features called roles [50] This extension will introduce and unify versioning concepts in graph structured applications such as computer aided design (CAD) 26] or graph based software development environments [13, 48]; first results are given in [63] Support of the SCM process. On the conceptual level, we must find out if and how SCM processes might be formalized using the version set model and whether SCM tool behaviour may be verified against the SCM process. We imagine organizing the SCM process entirely ....

Schrr, A., Winter, A. J., and Zndorf, A. Graph grammar engineering with PROGRES. In Proc. 5th European Software Engineering Conference (Sitges, Spain, Sept. 1995), W. Schfer and P. Botella, Eds., vol. 989 of Lecture Notes in Computer Science, Springer-Verlag, pp. 219--234.

....we refer to such graphs as MSC graphs. The formal specification of such a complex language clearly requires an expressive graph grammar formalism. At this moment, the most expressive specification formalism based on graph rewriting is Schurr s programmed graph rewriting system language PROGRES [13]. An additional motivation for choosing the PROGRES formalism was the availability of an integrated set of language specific tools supporting editing, analyzing, and debugging of specifications. Space limits prevent us from discussing the full ten page PROGRES specification for MSC. We therefore ....

A. Schurr, A. Winter, and A. Zundorf. Graph grammar engineering with PROGRES. In Proceedings 5th European Software Engineering Conference (ESEC '95), LNCS 989, pages 219--234, 1995.

....the execution semantics of the underlying language, we rather define the semantics of task nets explicitly by means of programmed graph transformations. The graph schema restricts the evolving graph structure. A tool environment for dynamic task nets can be generated from a PROGRES specification [19]. On the process definition enactment level, process definitions are used to instantiate the process. In rule based approaches, the inference machine is working on its fact and rule base. The structure of task nets is constructed implicitly by forward and backward chaining [12, 3, 2] Changes in ....

A. Schurr, A. J. Winter, and A. Zundorf. Graph Grammar Engineering with PROGRES. In W. Schafer and P. Botella, editors, Proc. of the 5 th European Software Engineering Conference (ESEC), volume 989 of Lecture Notes in Computer Science, pages 219--234, Sitges, Spain, 1995. Springer-Verlag.

....Chomsky grammars on one hand and of term rewriting systems on the other hand about 25 years ago. Meanwhile there is a well established theory of graph transformations (cf. EKR91,CEER96] which has a number of useful applications to system modelling and software engineering (cf. Nag96,Zam96,AE96,SWZ95] based on concrete specification languages and supporting tools (cf. Sch91,LB93] The main idea of our specification approach using graph transformations is to model object structures and their interrelationships by graphs and modifying operations by graph transformations. This specification ....

A. Schurr, A.J. Winter, and A. Zundorf. Graph grammar engineering with PROGRES. In W. Schafer and P. Botella, editors, 5th European Software Engineering Conference (ESEC'95), Sitges, pages 219--234. Springer LNCS 989, September 1995.

....of applications which are based on graphs, hyper graphs or network like structures. Such structures are predominant in tools of many application domains, e.g. CAD, electronic design automation, system level design, or workflow. Unfortunately existing graph oriented software environments, e.g. [5], do not support structuring concepts like multi port components, instance and interface components, channelbased connectivity, macro construction and hierarchical component structures. These structuring concepts require a conceptual model on a higher level of abstraction than simple graphs ....

....oriented idioms [2] Our abstract graph pattern contains several design patterns. In this, it may be considered a composite design pattern. In contrast to work on design patterns we cover the generative tool aspect very intensively. Specific graph oriented software environments like PROGRES [5] focus on formal specification of graph transformations. They are based on graph grammars which allow to define graph transformations using graph rewriting systems. Work in this domain does not concentrate on higher level functionality as needed by graphbased applications in the EDA domain. ....

A. Schrr, A. Winter, A. Zndorf, "Graph Grammar Engineering with PROGRES", in Proceedings of the 4th Software Engineering Conference (ESEC), pp. 119-234, 1995

....make this scheme work, all specified and hand written algorithms have to refer to a uniform data model of the intermediate representation. Therefore the first step of the method consists RR no2955 6 Uwe Amann of developing a data model or graph schema for the intermediate representation [Sch91] SWZ95] We have to model the following: 1. the types of graph nodes. Among these are intermediate code instructions such as expressions, statements, loops, and procedures. Also previously analyzed information can be encoded in nodes of graphs, e.g. variable definitions, or expression equivalence ....

Andreas Schurr, Andreas J. Winter, and Albert Zurndorf. Graph Grammar Engineering with PROGRES. In European Software Engineering Conference ESEC 5, volume 989 of Lecture Notes in Computer Science, pages 219--234. Springer, September 1995.

....specifications of the general case. In addition, we are able to translate story diagrams automatically into executable prototypes. This enables the validation and implementation of specifications. For this purpose we make extensive use of the PROGRES graph grammar engineering environment [SWZ95]. The SDM methodology has been applied to develop several sample applications which deal with complex and highly dynamic object structures, e.g. a distributed planning and information system for courses at Paderborn University and an information system for the local public transportation system. ....

....outlined in the story boards of the previous phases are elaborated. Now we look at the concrete object structures and algorithms that realize the desired system. In SDM this is done using so called story diagrams. Story diagrams are an adaption and enhancement of programmed graph rewriting systems [SWZ95] to the UML (acitivity diagram) notation and the object oriented data model. Story diagrams use a high level graphical notation very similar to story boards. However, while story boards describe particular sample situations, story diagrams specify the general case. In other words story diagrams ....

[Article contains additional citation context not shown here]

A. Schrr, A. J. Winter, A. Zndorf. Graph grammar engineering with PROGRES. In W. Schfer, editor, Software Engineering - ESEC '95. Springer Verlag, 1995.

....we are not interested in defining particular instances of migration graphs but we aim on defining a schema for a graph class that contains all valid migration graphs. We call such a schema a graph model. We have used the formal specification language Progres (PROgrammed Graph REplacement Systems) [41] to define and implement the graph models discussed in this paper. Figure 8 shows the most important parts of this graph model in a diagrammatic Progres notation that is similar to UML [38] To avoid confusion with classes and associations which are modeled within a conceptual database schema, we ....

....has to be converted as such. Hence, our special focus is on providing a catalog of transformations that is easily extensible rather than trying to create a catalog that is complete. The combination of the expressive power of graph grammar productions with the Progres code generation mechanism [41] enables us to achieve this goal: the catalog of redesign transformations that are provided by our schema migration tool can easily be extended and customized on a high level of abstraction. Many approaches in the domain of database evolution allow to reorganize the data after a redesign ....

A. Schrr, A. J. Winter, and A. Zndorf. Graph Grammar Engineering with PROGRES. In W. Schfer, editor, Software Engineering - ESEC '95. Springer Verlag, 1995.

.... visual language for specifying systems based on internal graph structures [35] Together with the ability to generate stand alone prototypes from specifications we have already demonstrated the suitability of our Graph Grammar Engineering approach with PROGRES for some application areas (cf. [11, 34]) The example in this paper stresses the visual character of graph rewrite rules rather than the usefulness of graphs as an underlying data model. Red black trees have been selected in order to demonstrate the advantages of PROGRES in contrast to conventional programming languages. The data ....

A. Schurr, A. Winter, and A. Zundorf. Graph Grammar Engineering with PROGRES. In W. Schafer and P. Botella, editors, Proc. 5 th European Software Engineering Conference (ESEC `95), volume 989 of Lecture Notes in Computer Science, pages 219--234, Sitges, Spain, Sept. 1995. Springer-Verlag, Berlin.

....constructed software system configuration step by step such that all selected implementation variants fulfill certain properties. For further details concerning the specification language PROGRES, our graph grammar engineering methodology, and the selected MIL example, the reader is referred to [6, 16, 20]. 5. The IPSEN Framework Architecture As was already mentioned, the code generated from the different input sources is embedded into a framework architecture, cf. box 13 in fig. 2. This framework is invariant with respect to the languages and tools the system eventually supports and contains ....

A. Schrr, A.J. Winter, A. Zndorf: "Graph Grammar Engineering with PROGRES", in W. Schfer/P. Botella (Eds.): Proceedings of the 5th ESEC, LNCS 989, Springer--Verlag, 1995, pp. 219--234

....and to [35] as well as to [44] and to [58] the two Ph.D. thesises that present a formal definition of a PROGRES language kernel and the design of its programming environment, respectively. Further details concerning the evolution of an accompanying graph grammar engineering method may be found in [17,16,50]. 13.2. SPECIFICATION AND VHL PROGRAMMING LANGUAGES 491 13.2 Specification and VHL Programming Languages Writing a compact comparison of PROGRES with related work is a rather challenging job. There are too many aspects which have to be taken into account due to the fact that PROGRES is an ....

....its compiler and runtime system. A description of the 13.6. PROGRAMMING AND PROTOTYPING ENVIRONMENT 535 Figure 13.23: Graphical and textual view on the graph schema. problem s solution is beyond the scope of this book, but may be found in [58] Following the Graph Grammar Engineering approach in [50], we will now present the tools of the PROGRES environment and their support for various phases of specification development. 13.6.2 Editing and Analyzing Specifications A specification for a certain system is initiated by considering different scenarios. They help to identify node objects, ....

[Article contains additional citation context not shown here]

Andy Schurr, Andreas J. Winter, and Albert Zundorf. Graph Grammar Engineering with PROGRES. In Wilhelm Schafer and P. Botella, editors, Proc. 5th European Software Engineering Conf. (ESEC'95), volume 989 of Lecture Notes in Computer Science, pages 219--234, Berlin, 1995. 550 CHAPTER 13. PROGRES: LANGUAGE AND ENVIRONMENT Springer Verlag.

....and to [8] as well as to [9] and to [10] the two Ph.D. thesises that present a formal definition of a PROGRES language kernel and the design of its programming environment, respectively. Further details concerning the evolution of an accompanying graph grammar engineering method may be found in [11,12,13]. 4 1.2 Specification and VHL Programming Languages Writing a compact comparison of PROGRES with related work is a rather challenging job. There are too many aspects which have to be taken into account due to the fact that PROGRES is an object oriented data modeling language, a kind of formal ....

....problem is to reverse a conventional program s flow of control without having access to the internal details of its compiler and runtime system. A description of the problem s solution is beyond the scope of this book, but may be found in [10] Following the Graph Grammar Engineering approach in [13], we will now present the tools of the PROGRES environment and their support for various phases of specification development. 1.7.1 Editing and Analyzing Specifications A specification for a certain system is initiated by considering different scenarios. They help to identify node objects, their ....

Andy Schurr, Andreas J. Winter, and Albert Zundorf. Graph grammar engineering with PROGRES. In Wilhelm Schafer and P. Botella, editors, Proc. 5th European Software Engineering Conf. (ESEC'95), volume 989 of Lecture Notes in Computer Science, pages 219--234, Berlin, 1995. Springer Verlag.

No context found.

Schurr, A., Winter, A., Zundorf, A.: Graph grammar engineering with PROGRES. In: Proceedings 5th European Software Engineering Conference ESEC. Volume LNCS 989., Springer (1995) 219--234

No context found.

Schurr, A., Winter, A.J., Zundorf, A.: Graph grammar engineering with PROGRES. In Schafer, W., Botella, P., eds.: Proc. European Conf. Software Engineering. Volume 989 of Lecture Notes in Computer Science., Springer-Verlag (1995) 219--234

No context found.

A. Schurr, A. Winter, and A. Zundorf. Graph grammar engineering with PROGRES. In Botella and Schafer, editors, ESEC'95 Proceedings of the 5th European Software Engineering Conference, volume 989 of Lecture Notes in Computer Science, pages 219--234, Berlin, 1995. Springer-Verlag.

No context found.

A. Schurr, A.J. Winter, and A. Zundorf. Graph grammar engineering with PROGRES. In 5th European Software Engineering Conference (ESEC '95), Sitges, LNCS 989, pages 219--234. Springer Verlag, 1995.

No context found.

A. Schurr, A.J. Winter, and A. Zundorf. Graph grammar engineering with PROGRES. In W. Schafer and P. Botella, editors, 5th European Software Engineering Conference (ESEC'95), Sitges, pages 219--234. Springer LNCS 989, September 1995.

No context found.

A. Schuerr, A.J. Winter, and A. Zuendorf. Graph grammar engineering with progres. In W. Schaefer and P. Botella, editors, 5th European Software Engineering Conference (ESEC'95), Sitges, pages 219-234. Springer LNCS 989, September 1995.

No context found.

A. Schrr, A. J. Winter, A. Zndorf. Graph grammar engineering with PROGRES. In W. Schfer, Editor, Software Engineering - ESEC '95, LNCS 989, Springer Verlag, 1995.

First 50 documents

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