Filters








24,483 Hits in 4.5 sec

Tau Be or not Tau Be? - A Perspective on Service Compatibility and Substitutability

Meriem Ouederni, Gwen Salaün
2010 Electronic Proceedings in Theoretical Computer Science  
Another related problem is to check the substitutability of one service with another.  ...  transition is traversed in one interface, whereas the latter requires a precise analysis of tau branchings in order to make the substitution preserve the properties (e.g., a compatibility notion) which  ...  The authors thank Radu Mateescu for interesting comments on an earlier version of this paper, and Francisco Durán for fruitful discussions on this topic.  ... 
doi:10.4204/eptcs.37.5 fatcat:53hwy5dcibbkpgtyyl76cehy5u

Conformance notions for the coordination of interaction components

Rodrigo Ramos, Augusto Sampaio, Alexandre Mota
2010 Science of Computer Programming  
We illustrate the application of these notions through a systematic composition strategy of software frameworks, and we mechanically verify the preservation of behavioural component properties in these  ...  These notions are formalised in terms of the denotational semantics of the process algebra CSP, and assist the designer in common activities during integration, such as the substitution of component specifications  ...  The constructive constraints for this model are based on the notions of substitutability and compatibility of software components.  ... 
doi:10.1016/j.scico.2009.12.005 fatcat:zlz2i5apljhudlo6xc6fsldxo4

Typing the Behavior of Objects and Components using Session Types

Antonio Vallecillo, Vasco T. Vasconcelos, António Ravara
2003 Electronical Notes in Theoretical Computer Science  
are also concerned about compatibility and substitutability of components (see [8] for a comprehensive survey on these proposals).  ...  Therefore, the notions of substitutability and compatibility of software components play a critical role in CBSD, since we need to be able to check whether a given component can successfully replace another  ...  of one of the components is substitutable for (or compatible with) some session in the protocol of the other component.  ... 
doi:10.1016/s1571-0661(05)80382-2 fatcat:epmuocu2tbb6nb7boib2n7k3fm

Web Service Protocols: Compatibility and Adaptation

Marlon Dumas, Boualem Benatallah, Hamid R. Motahari Nezhad
2008 IEEE Data Engineering Bulletin  
This paper discusses the notion of protocol compatibility between Web services, and reviews a number of techniques for detecting incompatibilities and for synthesizing adapters for otherwise incompatible  ...  The paper also reviews related notions such as realizability, substitutability and controllability.  ...  The adapter's protocol is said to be compatible with protocols P 1 and P 2 of the adapted components, if their interactions have no unspecified reception and are deadlock free.  ... 
dblp:journals/debu/DumasBN08 fatcat:dk2jyvv7dvacrevb53goxkp6kq

Checking Protocol Compatibility using Maude

Francisco Durán, Meriem Ouederni, Gwen Salaün
2009 Electronical Notes in Theoretical Computer Science  
are compatible, and return a counterexample if they are not. 4 In the remainder of this paper, we will refer to both software component and Web service using the generic term service.  ...  Checking compatibility of services accessed through their behavioural interfaces is a crucial issue in Service Oriented Computing which aims at building new systems from existing software services.  ...  Acknowledgement This work has been partially supported by the RESCUE (TIN2008-05932) and MDD-MERTS (TIN2008-03107) projects funded by the Spanish Ministry of Innovation and Science (MICINN).  ... 
doi:10.1016/j.entcs.2009.10.025 fatcat:cpd6hmkreffexiewoe72vgjel4

A Practical Approach to Incremental Specification [chapter]

Charles Lakos, Glenn Lewis
2000 IFIP Advances in Information and Communication Technology  
A variety of constraints has been imposed in order to guarantee substitutability in one form or another.  ...  The object-oriented specification of concurrent and distributed systems has tended to emphasise the aspect of substitutability at the expense of code reuse.  ...  In such a situation, the original server would deadlock, and this behaviour would be expected of a compatible substitute.  ... 
doi:10.1007/978-0-387-35520-7_12 fatcat:mocegrcsh5cgzl74rbbpgtfhom

Testing-based Process for Evaluating Component Replaceability

Andres Flores, Macario Polo
2009 Electronical Notes in Theoretical Computer Science  
Replacing pieces of component-based systems carries a serious risk on the expected stability. Substitutability of components must then be carefully identified.  ...  For a component under substitution, a Component Behaviour Test Suite is built to be later applied on candidate replacement components. This approach is also known as Back-to-Back testing.  ...  (Mixed Center of R&D) and projects: CyTED-CompetiSoft (506AC0287), UNCo-ISUCSoft (04-E072), and JCCM-PRALIN (PAC-08-0121-1374).  ... 
doi:10.1016/j.entcs.2009.03.017 fatcat:mmkvnxlcebdsvhtovmuyhdtqv4

Enhanced Type-based Component Compatibility Using Deployment Context Information

Premek Brada
2011 Electronical Notes in Theoretical Computer Science  
Consistency and compatibility in component-based applications have been the subject of many methods and approaches, from formally sound ones with difficult practical implementation to pragmatic rules for  ...  In this paper we contribute a formal description of a method which ensures application run-time type consistency, by performing type-based substitutability checks as part of the component binding and update  ...  An example of an advanced kind of component interface element for which our method could be applied is the behaviour protocol [19] originated in the SOFA component model.  ... 
doi:10.1016/j.entcs.2011.11.009 fatcat:zw6lyzpeyfgcvl6xjdy3xjh2ga

Formalizing Web Service Choreographies

Antonio Brogi, Carlos Canal, Ernesto Pimentel, Antonio Vallecillo
2004 Electronical Notes in Theoretical Computer Science  
In this paper we present the formalization of one of these Web service choreography proposals (WSCI), and discuss the benefits that can be obtained by such formalization.  ...  However, such proposals remain at the descriptive level, without providing any kind of reasoning mechanisms or tool support for checking the compatibility of Web services based on the proposed notations  ...  Our present goal is to make use of the fair amount of work currently available on the behavioural descriptions of objects and components at the protocol level (e.g., [1, 2] ), in order to apply many of  ... 
doi:10.1016/j.entcs.2004.05.007 fatcat:zoshzfmnxbcrflobmp3gc4io2i

Adapting Components with Mismatching Behaviours [chapter]

Andrea Bracciali, Antonio Brogi, Carlos Canal
2002 Lecture Notes in Computer Science  
Component adaptation is widely recognised to be one of the crucial problems in Component-Based Software Engineering.  ...  The three main ingredients of the methodology are: (1) The inclusion of behaviour specifications in component interfaces, (2) a simple, high-level notation for expressing adaptor specifications, and (3  ...  The main advantage of FSMs is that their simplicity supports a simple and efficient verification of protocol compatibility.  ... 
doi:10.1007/3-540-45440-3_13 fatcat:iwef5wuhyjanxnnx57xpwofi4m

Typing Multi-Agent Systems via Commitments [chapter]

Matteo Baldoni, Cristina Baroglio, Federico Capuzzimati
2014 Lecture Notes in Computer Science  
The proposed typing includes a notion of compatibility, based on subtyping, which allows for the safe substitution of agents to roles along an interaction that is ruled by a commitmentbased protocol.  ...  This work presents an agent typing system, that differently than most of other proposals relies on notions that are typical of agent systems instead of relying on a functional approach.  ...  and of compliance, reasoning about programs and components.  ... 
doi:10.1007/978-3-319-14484-9_20 fatcat:acq3auk5nfhxbaluku4y34sddi

Analysis and Verification of Service Interaction Protocols - A Brief Survey

Gwen Salaün
2010 Electronic Proceedings in Theoretical Computer Science  
Second, we give a brief survey of verification techniques that can be used to analyse services and their interaction. Last, we focus on the realizability and conformance of choreographies.  ...  Modeling and analysis of interactions among services is a crucial issue in Service-Oriented Computing.  ...  The author would like to thank Meriem Ouederni for her comments on a former version of this paper.  ... 
doi:10.4204/eptcs.35.7 fatcat:k57itzmpoff3dn7n744wmxxo7m

Composing Distributed Systems: Overcoming the Interoperability Challenge [chapter]

Valérie Issarny, Amel Bennaceur
2013 Lecture Notes in Computer Science  
This chapter introduces the fundamental principles and solutions underlaying interoperability in software systems with a special focus on protocols.  ...  In order to enable components to interoperate despite these differences, mediators that perform the necessary data translations and coordinate the components' behaviours appropriately, have been introduced  ...  This work is carried out as part of the European FP7 ICT FET Connect (http://connect-forever.eu/) project.  ... 
doi:10.1007/978-3-642-40615-7_6 fatcat:z47fcxkekjbabh3qbg5bmanffu

Safe Composition of Linda-based Components

Ana M. Roldan, Ernesto Pimentel, Antonio Brogi
2003 Electronical Notes in Theoretical Computer Science  
When constructing component-based systems, we must be sure that the cooperative behaviour of the components and their interaction will be successful.  ...  In this paper, we use Linda to specify the interactive behaviour of software components.  ...  Indeed, mismatches may also occur at the protocol level, because of the ordering of exchanged messages and of blocking conditions, that is, because of differences in the component behaviours.  ... 
doi:10.1016/s1571-0661(04)81036-3 fatcat:g4dno6g2jbe7foge77u5ami6nq

Systematic component adaptation

Andrea Bracciali, Antonio Brogi, Carlos Canal
2002 Electronical Notes in Theoretical Computer Science  
Component adaptation is widely recognised to be one of the crucial problems in Component-Based Software Engineering.  ...  The four main ingredients of the methodology are: (1) The inclusion of behaviour specifications in component interfaces, (2) a simple, high-level notation for expressing adaptor specifications, (3) a fully  ...  The main advantage of finite state machines is that their simplicity supports a simple and efficient verification of protocol compatibility.  ... 
doi:10.1016/s1571-0661(04)80452-3 fatcat:hidr2d3hubai5koopniiqp7xhi
« Previous Showing results 1 — 15 out of 24,483 results