Codebook: discovering and exploiting relationships in software repositories
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1
EASY meta-programming with Rascal
GTTSE'09 Proceedings of the 3rd international summer school conference on Generative and transformational techniques in software engineering III
Reverse engineering using graph queries
Graph transformations and model-driven engineering
Scripting a refactoring with Rascal and Eclipse
Proceedings of the Fifth Workshop on Refactoring Tools
Journal of Systems and Software
Bridging the divide between software developers and operators using logs
Proceedings of the 34th International Conference on Software Engineering
Program analysis scenarios in rascal
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
| Hi-index | 0.00 |
This paper is a retrospective arising from a WCRE paper published in 1998 promoting a relational approach to manipulate software architecture and to help solve various problems in software analysis. That paper explains how Tarski’s binary relational algebra, embedded in a language such as Grok, can solve such problems. Tarski’s notation is elegant and often efficiently executable when the subject at hand is characterized by parts with binary relations between them. Software architecture, especially as-built architecture, is such a subject. This paper concentrates on the following three questions. What impact can a relational approach have on our understanding of software architecture? What Grok-languages exist and what are their strengths? How have Grok-like languages been used to solve problems in software architecture or software analysis?