2012
DOI: 10.1007/978-3-642-32211-2_12
|View full text |Cite
|
Sign up to set email alerts
|

A Strategy Language for Graph Rewriting

Abstract: Abstract. We give a formal semantics for a graph-based programming language, where a program consists of a collection of graph rewriting rules, a user-defined strategy to control the application of rules, and an initial graph to be rewritten. The traditional operators found in strategy languages for term rewriting have been adapted to deal with the more general setting of graph rewriting, and some new constructs have been included in the language to deal with graph traversal and management of rewriting positio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(16 citation statements)
references
References 37 publications
(55 reference statements)
0
16
0
Order By: Relevance
“…About the next steps in our work, we plan to increase the tool support to both hierarchies and MCMTs specification, as well as test their feasibility in new scenarios. In addition, we plan to use, or adapt, strategy languages like [88,89] in order to coordinate the execution of MCMTs, allowing for even richer semantics for the execution of behavioural DSLs [61].…”
Section: Discussionmentioning
confidence: 99%
“…About the next steps in our work, we plan to increase the tool support to both hierarchies and MCMTs specification, as well as test their feasibility in new scenarios. In addition, we plan to use, or adapt, strategy languages like [88,89] in order to coordinate the execution of MCMTs, allowing for even richer semantics for the execution of behavioural DSLs [61].…”
Section: Discussionmentioning
confidence: 99%
“…The syntax presented here extends the one in [14] by including a language to define subgraphs of a given graph by selecting nodes that satisfy some simple properties (see Table 2).…”
Section: Strategic Graph Programsmentioning
confidence: 99%
“…PORGY and its strategy language were first presented in [1,14]. Unlike those papers, the notion of port graph considered in this paper includes attributes for nodes, ports and also edges, which are taken into account in the definition of port graph morphism.…”
Section: Introductionmentioning
confidence: 99%
“…Designing formal languages to specify rewriting strategies is beyond the scope of this paper and forms a whole chapter of port graph rewriting. More details on PORGY's rewriting strategy language developed by our partners may be found in [FKN12].…”
Section: Data and Task Abstractionmentioning
confidence: 99%
“…Choosing a rule is accomplished by dragging and dropping the involved rules onto the strategy panel and combining them with proper operators (A2). The development of the underlying formal language [FKN12] to describe strategies evolved as users (biologists and computer scientists) experimented with our environment. Several iterations were necessary, reasoning about the system and testing several different combinations of rules, to design adequate rulesets and strategies.…”
Section: Case Studiesmentioning
confidence: 99%