On modularizing triple graph grammars with rule refinement
| dc.contributor.author | Anjorin, Anthony | |
| dc.contributor.author | Saller, Karsten | |
| dc.contributor.author | Lochau, Malte | |
| dc.contributor.author | Schürr, Andy | |
| dc.contributor.editor | Aßmann, Uwe | |
| dc.contributor.editor | Demuth, Birgit | |
| dc.contributor.editor | Spitta, Thorsten | |
| dc.contributor.editor | Püschel, Georg | |
| dc.contributor.editor | Kaiser, Ronny | |
| dc.date.accessioned | 2017-06-30T20:56:09Z | |
| dc.date.available | 2017-06-30T20:56:09Z | |
| dc.date.issued | 2015 | |
| dc.description.abstract | A Triple Graph Grammar (TGG) is a set of declarative rules describing how consistent triples of graph structures in a source, target, and correspondence domain are to be generated. This generative and high-level specification of consistency can be automatically operationalized and used to derive model generators for test case generation, forward and backward translators, and incremental model synchronizers. As with any domain specific language, a means to modularize TGG specifications is an important requirement, especially for practical applications. We formalized an extended concept of rule refinement for TGGs in previous work and now report on our experience from using rule refinements intensively in a recent industrial project. | en |
| dc.identifier.isbn | 978-3-88579-633-6 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | Software-engineering and management 2015 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-239 | |
| dc.title | On modularizing triple graph grammars with rule refinement | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 96 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 95 | |
| gi.conference.date | 17.-20. März 2015 | |
| gi.conference.location | Dresden |
Dateien
Originalbündel
1 - 1 von 1