Refactoring Long Running Transactions

Authors:
Gian Luigi Ferrari;Roberto Guanciale;Daniele Strollo;Emilio Tuosto
Affiliations:
Dipartimento di Informatica, Università degli Studi di Pisa, Italy;Institute for Advanced Studies IMT Lucca, Italy;Dipartimento di Informatica, Università degli Studi di Pisa, Italy and Institute for Advanced Studies IMT Lucca, Italy;Computer Science Department, University of Leicester, UK
Venue:
Web Services and Formal Methods
Year:
2009

Citing 9
Cited 3

Sagas

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
An Object Calculus for Asynchronous Communication

ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
Transactions and Web services

Communications of the ACM - Service-oriented computing
Theoretical foundations for compensations in flow composition languages

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The transaction concept: virtues and limitations (invited paper)

VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Coordination Via Types in an Event-Based Framework

FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Event-Based Service Coordination

Concurrency, Graphs and Models
Program refactoring, program synthesis, and model-driven development

CC'07 Proceedings of the 16th international conference on Compiler construction
JSCL: a middleware for service coordination

FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems

Choreography rehearsal

WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
Model-driven development of long running transactions

Rigorous software engineering for service-oriented systems
SENSORIA results applied to the case studies

Rigorous software engineering for service-oriented systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sagas calculi have been proposed to specify distributed Long Running Transactions (LRT) and, in previous work, a subset of naive sagas has been encoded in the Signal Calculus (SC) to enable their use in service-oriented systems. Here, we promote a formal approach to the refactoring of LRT represented in SC so that distributed LRT designed in the Business Process Modelling Notation (BPMN) can be faithfully represented. Firstly, we complete the initial encoding of naive sagas into SC. Secondly, on top of SC, we define a few refactoring transformations for distributed LRT. Finally, we prove that the given refactoring rules are sound by showing that they preserve (weak) bisimilarity.