A. Schurr. Introduction to PROGRESS, an Attribute Graph Grammar Based Specification Language. In Graph-Theoretic Concepts in Computer Science, LNCS 441, pages 444--458, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of B2 is the successor of the last instruction of B1 (fall through case) This can be visualized by the graph rewrite system in figure 2, let us call it BB. Left hand sides match if their pattern is found existentially in the graph (partial match as in graph rewrite systems like PROGRES [Sch90]) Nodes with same numbers are identical. Newly entered edges are drawn fat. Note that the left hand sides contain some special pattern matching conditions on node attributes, i.e. in rule BB 1 label L has to be the same in node 2 and 3. Let us explain what the rules mean. BB adds edges of sorts ....

A. Schurr. Introduction to PROGRESS, an Attribute Graph Grammar Based Specification Language. In Graph-Theoretic Concepts in Computer Science, LNCS 441, pages 444--458, 1990.

....rules for rewriting portions of a host graph which can be used to define semantic equivalences of sub graphs. The algorithmic attributed graph grammar approach was selected as the type of graph grammar to use because it operated at the appropriate level of abstraction and tools were available [44, 29, 8]. Using this approach, a complex query is formulated as a host graph traversal and a complex graph update operation as a graph rewrite rule. The algorithmic attributed graph grammar approach was implemented by the PROgrammed Graph REwriting System language (PROGRES) toolset [45] Figure 4: MMAP ....

A. Schrr. Introduction to PROGRES, an attribute graph grammar based specification language. In M. Nagl, editor, Graph-Theoretic Concepts in Computer Science, volume 411 of Lecture Notes in Computer Science, pages 151--165, 1990.

....al. 81] The goal here was to give formal methods for software development, using graph grammars as a specification system. This project spawned the well known PROGRESS (PROgrammed Graph Rewriting SyStems) language of Schurr, a graph rewriting formalism intended for generic software development [94,95]. This is a complete system, including language and (textual) editing environment. As with the original IPSEN project, though, many of its constructs, such as the use of directed edges and matching rules through an (unrestrained) graph query sublanguage, make partitioning di# cult, and so they ....

Andy Schurr. Introduction to PROGRESS, an attribute graph grammar based specification language. In M. Nagl, editor, Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '89), number 411 in Lecture Notes in Computer Science, pages 151--165, Castle Rolduc, The Netherlands, June 1989. Springer-Verlag.

.... character as opposed to line position. Graphs have been widely explored as a technique for the representation of information extracted from programs. GRAS [3, 27] a graph oriented database system explicitly designed for software engineering, uses a formal specification language called PROGRES [35, 36] to describe attributed graphs. GRAS has been used in Rigi [38] and can be represented in ASCII using Rigi Standard Format (RSF) GraX [17] relies on directed graphs with attributed and typed edges (TGraphs) GUPRO [25] is a repository system based on GraX with a customized query language called ....

A. Schurr. Introduction to PROGRES, an attribute graph grammar based specification language. In Workshop on Graph-Theoretic Concepts in Computer Science, number 411 in LNCS, pages 151--165. Springer-Verlag, 1989.

....very easily to specify general transformations, which is not the case for Datalog. The algorithmic approach to graph rewrite systems is the most similar to ours. However, there seems to be few work on the efficient automatic execution of terminating or convergent systems. The language PROGRES [Sch90] Zur95] is its most advanced representative. However, PROGRES is designed for an interactive user environment and not for batch processing. Currently it does not allow for fixpoint computations, it is tied to an underlying database, and does not provide mechanisms for rule overlapped execution, ....

Andreas Schurr. Introduction to PROGRES, an Attribute Graph Grammar Based Specification Language. In Graph-Theoretic Concepts in Computer Science, volume 541 of Lecture Notes in Computer Science, pages 444--458, Heidelberg, 1990. Springer.

....graphs. To be more precise, attributed graphs serve as their fundamental data structure and attributed graph grammars are used to model the manipulation of attributed graphs. Such approaches are, e.g. the attributed NLC graph grammars [KGC87, KG89] and the attributed graph grammars used by Schurr [Sch90]. More recently, a more general framework, called programmed logic based structure replacement has been proposed as definition language for programmed graph replacement systems. More details on this subject can be found in the survey [Sch97] All above mentioned models of attributed graph ....

A. Schurr. Introduction to PROGRES, an attribute graph grammar based specification language. In M. Nagl, editor, 15th International Workshop WG '89 on Graph-Theoretic Concepts in Computer Science, volume 411 of LNCS, pages 151--165, 1990.

.... image processing, pattern recognition, semantics of programming languages has led to the theory of graph grammars (see [CER79, ENR83, ENRR87, EKR91] for a survey) A wide spectrum of graph grammar approaches exists within this theory and some of them are implemented like for example PROGRES ([Sch90, Sch91a, Sch91b], Graph Ed [Him91] Dactl [GKS91] and AGG [LB93, TB93] The new graph and rule based language GRACE is intended to be a specification and programming language that supports integration of different approaches of graph grammars as well as modularity (see also [EE93] Therefore it is supposed ....

A. Schurr. Introduction to PROGRES, an attribute graph grammar based specification language. In M. Nagl, ed., Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 411, 151--165, 1990.

....generated phases use this interface so that a uniform data access is given. 3 Designing the data model Before developing graph rewrite systems for program analysis and transformations, we have to say how the intermediate graphs look like. This amounts to specifying a data model or graph schema [Sch90]. We have to layout the following: 1. model the graph node types: among these are intermediate code instructions such as expressions, statements, loops, procedures. Also already analyzed information can be encoded in nodes of graphs, e.g. definitions, or expression equivalence classes. 2. model ....

....logic. However, because fixpoint computations cannot be specified, generation of data flow analysis is not possible. Also it seems that the code generation scheme is quite ad hoc. Also the existing tools for graph rewrite systems could be used for generation of program optimizers. PROGRES [Sch90] is the most advanced. However, it is designed for an interactive user environment and not for batch processing. Currently it does not allow for fixpoint computations and is tied to an underlying database, although it provides an excellent user interface. UBS systems [Dor95] provide a subclass ....

A. Schurr. Introduction to PROGRES, an Attribute Graph Grammar Based Specification Language. In Graph-Theoretic Concepts in Computer Science, volume 541 of Lecture Notes in Computer Science, pages 444--458. Springer Verlag, 1990.

....1 context, i.e. the direct neighbourhood of the occurrence, and additional application conditions. The double pushout approach [Ehr79, CMR 97] the single pushout approach [Low93, EHK 97] the node replacement approach [Roz87, ER97] as well as the set theoretic approach used in Progres [Sch90] can be seen as special cases of this framework. To make this more transparent, let us consider some special cases. 1. Choose Check. In general, the occurrences of L in G are allowed to identify nodes or edges. In practice, one often uses the injectivity condition which requires the occurrence ....

....and its integrated programming environment have been developed by the graph grammar group of M. Nagl at RWTH Aachen. They are the first attempt to define and implement a graph transformation based, strongly typed programming language with well defined syntax, and static and dynamic semantics [Sch90, Sch91b] Being a mixed textual and diagrammatic language, it permits quite different styles of programming, and supports 1. graphical as well as textual definition of graph (database) schemata with declaration of derived graph properties, 2. rule oriented and diagrammatic specification of atomic ....

[Article contains additional citation context not shown here]

Andy Schurr. Introduction to PROGRES, an attribute graph grammar based specification language. In Manfred Nagl, editor, Proc. GraphTheoretic Concepts in Computer Science, Lecture Notes in Computer Science 411, 151--165, 1990.

....approach ( Ehr79, Low93] and the embedding aspects of the set theoretic approach ( Roz87] Nag87] in the 1 context, i.e. the direct neighbourhood of the occurrence. The double pushout approach [Ehr79] the single pushout approach [Low93] as well as the set theoretic approach used in PROGRES [Sch90] can be seen as special cases of the framework. To make this more transparent, let us consider some special cases. 1. CHOOSE. In practice, an occurrence of L in G often is required to be injective, i.e. the occurrence is isomorphic to L. In general, the occurrences of L in G are allowed to be ....

....Systems . PROGRES and its integrated programming environment are developed by the graph grammar group of M. Nagl at the RWTH Aachen. They are the first attempt to define and implement a graph grammar based strongly typed programming language with welldefined syntax, static and dynamic semantics [Sch90, Sch91b] Being a mixed textual and diagrammatic language, it permits quite different styles of programming and supports ffl graphical as well as textual definition of graph (database) schemes with declaration of derived graph properties, ffl rule oriented and diagrammatic specification of ....

[Article contains additional citation context not shown here]

Andy Schurr. Introduction to PROGRESS, an attribute graph grammar based specification language. In M. Nagl, ed., Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 411, 151--165, 1990.

....[Nag87, Roz87] in the 1 context, i.e. the direct neighbourhood of the occurrence, and additional application conditions. The double pushout approach [Ehr79] the single pushout approach [Low93] the node replacement approach [Roz87] as well as the set theoretic approach used in Progres [Sch90] can be seen as special cases of this framework. To make this more transparent, let us consider some special cases. 1. Choose Check. In general, the occurrences of L in G are allowed to identify nodes or edges. In practice, one often uses the injectivity condition which requires the occurrence ....

....Progres and its integrated programming environment have been developed by the graph grammar group of M. Nagl at RWTH Aachen. They are the first attempt to define and implement a graph transformation based, strongly typed programming language with well defined syntax, static and dynamic semantics [Sch90, Sch91b] Being a mixed textual and diagrammatic language, it permits quite different styles of programming, and supports 1. graphical as well as textual definition of graph (database) schemata with declaration of derived graph properties, 2. rule oriented and diagrammatic specification of atomic ....

[Article contains additional citation context not shown here]

Andy Schurr. Introduction to PROGRES, an attribute graph grammar based specification language. In Manfred Nagl, editor, Proc. GraphTheoretic Concepts in Computer Science, Lecture Notes in Computer Science 411, 151--165, 1990.

No context found.

A. Schrr : Introduction to PROGRESS, an Attribute Graph Grammar Based Specification Language, in : M. Nagl (Ed.) : Proceedings of the WG '89 Workshop on Graph--Theoretic Concepts in Computer Science, LNCS 411, 151--165 (1989)

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