A Proof Based Approach for Modelling and VerifyingWeb Services Compositions

Aït-Sadoune, Idir; Aït‐Ameur, Yamine

doi:10.1109/iceccs.2009.48

Cited by 19 publications

(9 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our approach relies on proof-based methodologies (Event-B); it overcomes this problem. It follows the same method as the one performed on orchestration [5,6] where refinement adaptation and evolution aspects is one of the main extensions of this work. This study can be dealt with at two levels: i) a bottom-up approach to study the effect, on the CP, of changes in the projected peers.…”

Section: Discussionmentioning

confidence: 99%

A correct-by-construction model for asynchronously communicating systems

Farah

Aït‐Ameur

Ouederni

et al. 2016

Int J Softw Tools Technol Transfer

Self Cite

View full text Add to dashboard Cite

Open Archive Toulouse Archive OuverteOATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible To cite this version: Farah, Zoubeyr and Ait Ameur, Yamine and Ouederni, Meriem and Tari, Kamel A correct-by-construction model for asynchronously communicating systems.Abstract The design and verification of distributed software systems is often hindered by their ever-increasing com-plexity and their asynchronous operational semantics. This article considers choreography specifications for distributed systems to reduce that complexity. We use labelled state-transitions systems as ground model for both choreographies and the corresponding distributed systems. Based on Event-B method, we propose a stepwise correctby-construction model to build asynchronous distributed systems which a pri-ori realise their choreographies. We rely on a sufficient and necessary realisability condition and we apply several refine-ment steps w.r.t. that condition to generate the distributed peers. The first refinement returns peer behaviours obtained by synchronous projection. The previously computed system is then refined into its asynchronous version using unbounded FIFO buffers. We prove, thanks to invariant preservation, that a sequence of exchanged messages is preserved at each refinement step. We provide a formalised proof of a realis-ability algorithm for deterministic choreographies. Besides that, our contribution is twofold: the approach is a priori and the problackposed solution scales up to any number of peers communicating with each other.

show abstract

Section: Discussionmentioning

confidence: 99%

A correct-by-construction model for asynchronously communicating systems

Farah

Aït‐Ameur

Ouederni

et al. 2016

Int J Softw Tools Technol Transfer

Self Cite

View full text Add to dashboard Cite

show abstract

“…Then, the obtained CRESS descriptions are translated automatically into formal specifications (e.g., LOTOS, SDL). Ait-Sadoune and Ait-Ameur (2009a, 2009b propose an approach based on proof and refinement methods. This approach is enriched by the BPEL2B platform that automates the transformation process of BPEL to Event-B.…”

Section: Related Workmentioning

confidence: 99%

A timed semantics for web services composition

Chama

Belala

Saïdouni

2017

IJBPIM

View full text Add to dashboard Cite

This paper introduces a method to analyse and verify the BPEL language. We propose a transformation approach based on the translation of BPEL descriptions to the communicating durational action timed automata (C-DATA) model which is a distributed, real-time semantic model that is based on true-concurrency semantics and supports the distributed and the communicating aspects. In order to handle compositions of multiple web services and exchanged messages between them we represent each BPEL service by a local C-DATA, while the global system is represented by all these local C-DATAs. These local C-DATAs communicate with each other by exchanging messages through communication channels. This approach considers both timing constraints and interaction durations between web services.

show abstract

“…The closest work to our own is perhaps that of Aït-Sadoune and Aït-Ameur [22] which presents an Event-B translation of the BPEL language including fault handling. This allows for proof-based validation of properties such as deadlock-freeness.…”

Section: Related Workmentioning

confidence: 99%

“…To this end we are investigating ways of representing these processes in a formal language like Event-B, similar to the general approach of Aït-Sadoune and Aït-Ameur [22]. Automating and providing tool support for the translation into a formal language and for the application of the error recovery pattern may give business process designers the most convenient support for their work.…”

Section: Conclusion and Further Workmentioning

confidence: 99%

Patterns for Modelling Time and Consistency in Business Information Systems

Bryans

Fitzgerald

Romanovsky

et al. 2010

2010 15th IEEE International Conference on Engineering of Complex Computer Systems

View full text Add to dashboard Cite

Maintaining semantic consistency of data is a significant problem in distributed information systems, particularly those on which a business may depend. Our current work aims to use Event-B and the Rodin tools to support the specification and design of such systems in a way that integrates well into existing development processes. This paper presents Event-B patterns that may be used to represent recovery from time-bounded inconsistency and illustrates their use in a model derived from industrial applications. AbstractMaintaining semantic consistency of data is a significant problem in distributed information systems, particularly those on which a business may depend. Our current work aims to use Event-B and the Rodin tools to support the specification and design of such systems in a way that integrates well into existing development processes. This paper presents Event-B patterns that may be used to represent recovery from time-bounded inconsistency and illustrates their use in a model derived from industrial applications. About the authorsJeremy received his BSc in Mathematics and Computer Science from Reading University in 1993, and his PhD in 1997, also from Reading University. He has worked in a number of university departments, including Royal Holloway, Kent and Stirling, and has been at Newcastle since December 2002. His research is in the security of information within large computer-based systems. A particular area of current interest is access control the development and maintenance of access control policies within dynamic coalitions. In the past at Newcastle he has worked on including DIRC (the Interdisciplinary Research Collaboration on Dependability) and GOLD (Grid Oriented Lifecycle Development) He is currently employed on the User Friendly Grid Security project and TrAmS (Trustworthy Ambient Systems). He is part of the RESIST network, and a member of RESIST's working group on Verification.John Fitzgerald is a specialist in the engineering of resilient computing systems, particularly in rigorous analysis and design tools. He is perhaps most closely associated with the Vienna Development Method (VDM). A particular area of interest is predictable dynamic resilience: the design of systems that reconfigure in response to threats while retaining predictability. John is currently seconded to the Deploy project, leading its work on achieving and demonstrating dependability through the deployment of formal methods in four industry sectors. He recently initiated work on resilience-explicit computing in the ReSIST European Network of Excellence on Resilience in Information Society technologies, a concept taken up in the two projects that he leads jointly within the UK Software Systems Engineering Initiative SSEI. His newest project on the use of formal models to support collaborative modelling and simulation in the design of embedded systems (DESTECS), starts in early 2010. John studied formal proof (PhD, Manchester Univ.), before joining Newcastle, where he worked on formal design techniques for a...

show abstract

A Proof Based Approach for Modelling and VerifyingWeb Services Compositions

Cited by 19 publications

References 12 publications

A correct-by-construction model for asynchronously communicating systems

A correct-by-construction model for asynchronously communicating systems

A timed semantics for web services composition

Patterns for Modelling Time and Consistency in Business Information Systems

Contact Info

Product

Resources

About