We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
The usability of model transformation languages depends on the abstractions one can work with in rules to perform complex operations on models. Recently, we have introduced a novel...
Daniel Balasubramanian, Anantha Narayanan, Sandeep...
In re-engineering object-oriented legacy code, it is frequently useful to introduce a design pattern in order to improve specific non-functional requirements (e.g., maintainabili...
High-level synthesis (HLS) requires more designer interaction to better meet the needs of experienced designers. However, attempts to create a highly interactive synthesis process...
XMorph is a new, shape polymorphic, domain-specific XML query language. A query in a shape polymorphic language adapts to the shape of the input, freeing the user from having to k...
Curtis E. Dyreson, Sourav S. Bhowmick, Kirankanth ...