Modelling parametric contracts and the state space of composite components by graph grammars

Authors:
Ralf H. Reussner;Jens Happe;Annegret Habel
Affiliations:
Software Engineering Group;Software Engineering Group;Formal Languages Group, University of Oldenburg, Germany
Venue:
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Year:
2005

Citing 16
Cited 6

Design and validation of computer protocols

Design and validation of computer protocols
Hypergraph grammars: transformational and algorithmic aspects

Journal of Information Processing and Cybernetics
Regular types for active objects

OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Protocol specifications and component adaptors

ACM Transactions on Programming Languages and Systems (TOPLAS)
Object-oriented software construction (2nd ed.)

Object-oriented software construction (2nd ed.)
Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution

Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools

Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools
Interface automata

Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Hyperedge Replacement: Grammars and Languages

Hyperedge Replacement: Grammars and Languages
The Theory of Parsing, Translation, and Compiling

The Theory of Parsing, Translation, and Compiling
Applying "Design by Contract"

Computer
Hierarchical graph transformation

Journal of Computer and System Sciences
Object Interoperability

Proceedings of the Workshop on Object-Oriented Technology
Automatic component protocol adaptation with the CoConut/J tool suite

Future Generation Computer Systems - Tools for program development and analysis
Double-pushout graph transformation revisited

Mathematical Structures in Computer Science

On Compatibility and Behavioural Substitutability of Component Protocols

SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Functionality configuration for eHome systems

CASCON '06 Proceedings of the 2006 conference of the Center for Advanced Studies on Collaborative research
Component behavior relativity analysis

ACM SIGSOFT Software Engineering Notes
Component simulation-based substitutivity managing QoS and composition issues

Science of Computer Programming
Formalizing compatibility and substitutability of rolebased interactions components in multi-agent systems

CEEMAS'05 Proceedings of the 4th international Central and Eastern European conference on Multi-Agent Systems and Applications
The ehomeconfigurator tool suite

OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modeling the dependencies between provided and required services within a software component is necessary for several reasons, such as automated component adaptation and architectural dependency analysis. Parametric contracts for software components specify such dependencies and were successfully used for automated protocol adaptation and quality of service prediction. In this paper, a novel model for parametric contracts based on graph grammars is presented and a first definition of the compositionality of parametric contracts is given. Compared to the previously used finite state machine based formalism, the graph grammar formalism allows a more elegant formulation of parametric contract applications and considerably simpler implementations.