A Model of Components with Non-regular Protocols

Südholt, Mario

doi:10.1007/11550679_8

Cited by 18 publications

(13 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However we can build on the experiences gained with these works. Most of the approaches that integrate behavioural specifications to components [17,16,18] work at a protocol (or component) level while our approach is mainly based on the services, the protocol level is handled by a constraint in our model. Moreover, their communication actions refer only to messages and not to services (no service call or result).…”

Section: Discussion and Perspectivesmentioning

confidence: 99%

“…Moreover, their communication actions refer only to messages and not to services (no service call or result). The non-regular protocols of [18] may be represented in Kmelia using guards and nested states, but using algebraic grammar provides a more efficient solution for the given applications. The work of [16] addresses assemblies and implementation issues in Java but does not deal with composition.…”

Section: Discussion and Perspectivesmentioning

confidence: 99%

“…Therefore, in Kmelia, component services interact with synchronous communication supported by message exchanges or service calls/responses via communication channels. Related works [17,18,16] associate dynamic behaviours (or protocols) to components and services are atomic operations (messages). Unlike these approaches, we consider services as units of interaction and they are equipped with dynamic behaviours (service behaviours).…”

Section: A Component Model Based On Services: Kmeliamentioning

confidence: 99%

See 2 more Smart Citations

Checking Component Composability

Attiogbé

André

Ardourel

2006

Software Composition

View full text Add to dashboard Cite

Abstract. Component-Based Software Engineering (CBSE) is one of the approaches to master the development of large scale software. In this setting, the verification concern is still a challenge. The current work addresses the composability of components and their services. A component model (Kmelia) is introduced; an associated formalism, simple but expressive is introduced; it describes the services as extended LTSs and their structuring as components. The composability of components is defined on the basis of the composability of services. To ensure the correctness of component composition, we check that an assembly is possible via the checking of the composability of the linked services, and their behavioural compatibility. In order to mechanize our approach, the services and the components are translated into the Lotos formalism. Finally the Lotos CADP toolbox is used to perform experiments.

show abstract

Section: Discussion and Perspectivesmentioning

confidence: 99%

Section: Discussion and Perspectivesmentioning

confidence: 99%

Section: A Component Model Based On Services: Kmeliamentioning

confidence: 99%

See 1 more Smart Citation

Checking Component Composability

Attiogbé

André

Ardourel

2006

Software Composition

View full text Add to dashboard Cite

show abstract

“…Recently, Thiemann and Vasconcelos [22] have proposed context-free session types to enhance the expressiveness of conventional session types. Protocols that benefit from such enhancement include the serialization of tree-like data structures and XML documents [22], interactions with non-uniform objects such as stacks and reentrant locks [17,6], and recursive protocols for trust management [21]. Thiemann and Vasconcelos [22] study the metatheory of context-free session types, leaving the definition of a type checking algorithm for future work.…”

Section: Introductionmentioning

confidence: 99%

Context-Free Session Type Inference

Padovani

2017

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. Some interesting communication protocols can be precisely described only by context-free session types, an extension of conventional session types with a general form of sequential composition. The complex metatheory of context-free session types, however, hinders the definition of corresponding checking and inference algorithms. In this work we address and solve these problems introducing a new type system for context-free session types of which we provide two OCaml embeddings.

show abstract

“…Currently, almost all componentbased systems with interaction protocols have used finite-state protocols, including all of the previously cited ones. Recently, however, approaches using more expressive non-regular protocols have been proposed [3,19].…”

Section: Introductionmentioning

confidence: 99%

Property-Preserving Evolution of Components Using VPA-Based Aspects

Nguyen

Südholt

2007

On the Move to Meaningful Internet Systems 2007: CoopIS, DOA, ODBASE, GADA, and IS

Self Cite

View full text Add to dashboard Cite

Abstract. Protocols that govern the interactions between software components are a popular means to support the construction of correct component-based systems. Previous studies have, however, almost exclusively focused on static component systems that are not subject to evolution. Evolution of component-based systems with explicit interaction protocols can be defined quite naturally using aspects (in the sense of AOP) that modify component protocols. A major question then is whether aspect-based evolutions preserve fundamental correctness properties, such as compatibility and substitutability relations between software components.In this paper we discuss how such correctness properties can be proven in the presence of aspect languages that allow matching of traces satisfying interaction protocols and enable limited modifications to protocols. We show how common evolutions of distributed components can be modeled using VPA-based aspects [14] and be proven correct directly in terms of properties of operators of the aspect language. We first present several extensions to an existing language for VPA-based aspects that facilitate the evolution of component systems. We then discuss different proof techniques for the preservation of composition properties of component-based systems that are subject to evolution using protocol-modifying aspects.

show abstract

A Model of Components with Non-regular Protocols

Cited by 18 publications

References 23 publications

Checking Component Composability

Checking Component Composability

Context-Free Session Type Inference

Property-Preserving Evolution of Components Using VPA-Based Aspects

Contact Info

Product

Resources

About