Author of the publication

A Generic Framework for Connector Architectures based on Components and Transformations.

, , , , , , and . Electron. Notes Theor. Comput. Sci., (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Controlling Reuse in Pattern-Based Model-to-Model Transformations., , and . Graph Transformations and Model-Driven Engineering, volume 5765 of Lecture Notes in Computer Science, page 175-201. Springer, (2010)Abstract Constraint Data Types., and . Software, Services, and Systems, volume 8950 of Lecture Notes in Computer Science, page 155-170. Springer, (2015)Clausal Rewriting: Applications and Implementation., and . ADT, volume 534 of Lecture Notes in Computer Science, page 204-219. Springer, (1990)A General Algebraic Framework for Studying Modular Systems., and . WADT, volume 1827 of Lecture Notes in Computer Science, page 271-290. Springer, (1999)A Transformational Semantics of Static Embedded Implications of Normal Logic Programs., , , and . LOPSTR, volume 3901 of Lecture Notes in Computer Science, page 133-146. Springer, (2005)A Proof System for Verifying Composability of Abstract Implementations.. Semantics of Data Types, volume 173 of Lecture Notes in Computer Science, page 357-374. Springer, (1984)Algebraic Implementation of Abstract Data Types: A Survey of Concepts and New Compositionality Results., , and . Math. Struct. Comput. Sci., 6 (1): 33-67 (1996)Categorical Foundations of Distributed Graph Transformation., , and . ICGT, volume 4178 of Lecture Notes in Computer Science, page 215-229. Springer, (2006)Initial Conflicts for Transformation Rules with Nested Application Conditions., and . ICGT, volume 12150 of Lecture Notes in Computer Science, page 109-127. Springer, (2020)Passing Compatibility is almost Persistency.. ADT, volume 116 of Informatik-Fachberichte, page 196-206. Springer, (1984)