Graph grammar engineering: A software specification method

Engels, Gregor; Lewerentz, Claus; Schäfer, Wilhelm

doi:10.1007/3-540-18771-5_53

Cited by 21 publications

(4 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The second one, PROgrammed Graph REplacement Systems (PROGRES), is tightly coupled to the development of software engineering tools 51,63,64,74]. PROGRES and its predecessors were and are used within the project IPSEN for specifying internal data structures and tools of Integrated Project Support ENvironments 19,20,45,46]. At the beginning, pure algorithmic graph replacement systems were used 43].…”

Section: Programmed Graph Replacement Systems In Practicementioning

confidence: 99%

“…Nowadays, they are a fundamental concept of the graph grammar speci cation languages PAGG 24,26] and PROGRES 64,69]. Experiences with using these languages and their predecessors for the speci cation of software engineering tools 19,20,36,73] showed that their control structures should possess the following properties:…”

Section: Requirements For Rule Controlling Programsmentioning

confidence: 99%

See 1 more Smart Citation

Programmed Graph Replacement Systems

Schürr

1997

Handbook of Graph Grammars and Computing by Graph Transformation

View full text Add to dashboard Cite

Section: Programmed Graph Replacement Systems In Practicementioning

confidence: 99%

Section: Requirements For Rule Controlling Programsmentioning

confidence: 99%

Programmed Graph Replacement Systems

Schürr

1997

Handbook of Graph Grammars and Computing by Graph Transformation

View full text Add to dashboard Cite

“…652]. (These semantics evolved over time: an earlier PROGRES reference describes the removal from host-graph of the complete subgraph corresponding to the non-induced g l host [EnLS87,p. 192]).…”

Section: Mr Maggraphenmentioning

confidence: 99%

Issues in the practical use of graph rewriting

Blostein

Fahmy

Grbavec

1996

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Graphs are a popular data structure, and graph-manipulation programs are common. Graph manipulations can be cleanly, compactly, and explicitly described using graph-rewriting notation.However, when a software developer is persuaded to try graph rewriting, several problems commonly arise. Primarily, it is difficult for a newcomer to develop a feel for how computations are expressed via graph rewriting. Also, graph-rewriting is not convenient for solving all aspects of a problem: better mechanisms are needed for interfacing graph rewriting with other styles of computation. Efficiency considerations and the limited availability of development tools further limit practical use of graph rewriting. The inaccessible appearance of the graph-rewriting literature is an additional hindrance. These problems can be addressed through a combination of "public relations" work, and further research and development, thereby promoting the widespread use of graph rewriting.

show abstract

“…Software engineering using graph grammar concepts (graph engineering [3]) has already led to various implementations of graph rewriting systems, e.g. PROGRES -PROgrammed Graph REwriting Systems [14].…”

Section: Introductionmentioning

confidence: 99%

Formal specification and simulation of software through graph grammars: a general but minimal approach

Freund

Potzl²,

Stary³

et al.

Proceedings. The Twenty-Second Annual International Computer Software and Applications Conference (Compsac '98) (Cat. No.98CB 3

View full text Add to dashboard Cite

High quality software components require a representation that allows the implementation-independent description of the structure and behavior of software components. Hence, the static as well as the dynamic structure of the system has to be represented in a structured way. Graph transformation systems support static and dynamic modeling through a single computational framework for the sake of correctness, maintainability, and integrity. In this paper, not only the framework is introduced, but also the corresponding tool, UPGraDE (Universal Programmed Graph Grammar Development Environment), which is based on the universal graph language GRASP (GRAph grammar with Set Productions). Any type of system can be specified through a minimal set of operations (syntax) and rules to specify the behavior of any type of software (semantics). The UPGraDE Environment, consisting of several totally transparent interconnected modules, performing well defined tasks, is a highly modular and extensible environment suited for nearly every GRASP development purpose.

show abstract

Graph grammar engineering: A software specification method

Cited by 21 publications

References 5 publications

Programmed Graph Replacement Systems

Programmed Graph Replacement Systems

Issues in the practical use of graph rewriting

Formal specification and simulation of software through graph grammars: a general but minimal approach

Contact Info

Product

Resources

About