Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
A relational approach to support software architecture analysis
Software—Practice & Experience
The PROGRES approach: language and environment
Handbook of graph grammars and computing by graph transformation
A faster solver for general systems of equations
Science of Computer Programming
A unified approach to global program optimization
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Non-monotone Fixpoint Iterations to Resolve Second Order Effects
CC '96 Proceedings of the 6th International Conference on Compiler Construction
A Generic Worklist Algorithm for Graph Reachability Problems in Program Analysis
CSMR '02 Proceedings of the 6th European Conference on Software Maintenance and Reengineering
Using Graph Rewriting to Specify Software Architectural Transformations
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
Automatic Detection of Design Problems in Object-Oriented Reengineering
TOOLS '99 Proceedings of the Technology of Object-Oriented Languages and Systems
Structural Manipulations of Software Architecture Using Tarski Relational Algebra
WCRE '98 Proceedings of the Working Conference on Reverse Engineering (WCRE'98)
GXL: Toward a Standard Exchange Format
WCRE '00 Proceedings of the Seventh Working Conference on Reverse Engineering (WCRE'00)
A Two-Phase Process for Software Architecture Improvement
ICSM '99 Proceedings of the IEEE International Conference on Software Maintenance
Wins and Losses of Algebraic Transformations of Software Architectures
Proceedings of the 16th IEEE international conference on Automated software engineering
Refining code-design mapping with flow analysis
Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
| Hi-index | 0.00 |
The past three decades have seen the creation of several tools that extract, visualize, and manipulate graph-structured representations of program information. To facilitate interconnection and exchange of information between these tools, and to support the prototyping and development of new tools, it is desirable to have some generic support for the specification of graph transformations and exchanges between them.GenSet is a generic programmable tool for transformation of graph-structured data. The implementation of the GenSet system and the programming paradigm of its language are both based on the view of a directed graph as a binary relation. Rather than use traditional relational algebra to specify transformations, however, we opt instead for the more expressive class of flow equations. Flow equations---or, more generally, systems of simultaneous fixpoint equations---have seen fruitful applications in several areas, including data and control flow analysis, formal verification, and logic programming. In GenSet, they provide the fundamental construct for the programmer to use in defining new transformations.