GReAT

Graph Rewrite And Transformation (GReAT) is a graph-transformation based language that supports the high-level specification of complex model transformation programs. In this language, one describes the transformations as sequenced graph rewriting rules that operate on the input models and construct an output model. The rules specify complex rewriting operations in a concise, yet precise manner, in the form of a matching pattern and a subgraph to be created as the result of the application of the rule. The rules (1) always operate in a context: a specific subgraph of the input, and (2) are explicitly sequenced for efficient execution. The rules are specified visually using a graphical model builder tool.

Documents

Documentation:

Papers:

Developer Information

Developer: Vanderbilt University (ISIS)

Contact: Gabor Karsai

Tool Website: GReAT Website

Tool Mailing List: list.isis.vanderbilt.edu

Tool Bug Reporting: JIRA

Tool License: GReAT License

ESCHER Qualification

Evaluation Summary:
Intellectual Property	License	Open Source
Dependencies	Adjunct Tools
	Platform Requirements	GME
Functional Integrity	Functional Specifications	None Available
	Interfaces	GME
	Scalability	Not verified
	Test Suites	Available
Integratability	Integration Frameworks
Documentation	User Manuals	Available
	Reference Manuals	Available
	Documented Examples	some examples in source/installation
User Support	Versioning	Visual SourceSafe
	Bug Reports	JIRA
	FAQs, Mailing Lists, tutorial, training, etc.	Mailing List Available
Quality Assurance	Development Process	None

ESCHER Research Institute

Sections

Personal tools

Navigation

GReAT

GReAT

Documents

Developer Information

ESCHER Qualification

Downloads

Dependencies

Feedback