A calculus of mobile processes, II
Information and Computation
Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
A Formal Approach to Recovery by Compensating Transactions
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
A Process Compensation Language
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Theoretical foundations for compensations in flow composition languages
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Disciplining Orchestration and Conversation in Service-Oriented Computing
SEFM '07 Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods
Sessions and Pipelines for Structured Service Programming
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Dynamic Fault Handling Mechanisms for Service-Oriented Applications
ECOWS '08 Proceedings of the 2008 Sixth European Conference on Web Services
The conversation calculus: a model of service-oriented computation
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Foundations of web transactions
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
SCC: a service centered calculus
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
A trace semantics for long-running transactions
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Towards compensation correctness in interactive systems
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Compensation-aware runtime monitoring
RV'10 Proceedings of the First international conference on Runtime verification
Liveness of communicating transactions
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
Advanced mechanisms for service combination and transactions
Rigorous software engineering for service-oriented systems
On the expressive power of primitives for compensation handling
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
A new strategy for distributed compensations with interruption in long-running transactions
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
Analysis of service oriented software systems with the conversation calculus
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
Time and exceptional behavior in multiparty structured interactions
WS-FM'11 Proceedings of the 8th international conference on Web Services and Formal Methods
First-Order dynamic logic for compensable processes
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
Safer asynchronous runtime monitoring using compensations
Formal Methods in System Design
Fault tolerance via idempotence
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Recovery within long-running transactions
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Conversations in service-oriented computation are frequently long running. In such a setting, traditional ACID properties of transactions cannot be reasonably implemented, and compensation mechanisms seem to provide convenient techniques to, at least, approximate them. In this paper, we investigate the representation and analysis of structured compensating transactions within a process calculus model, by embedding in the Conversation Calculus certain structured compensation programming abstractions inspired by the ones proposed by Butler, Ferreira, and Hoare. We prove the correctness of the embedding after developing a general notion of stateful model for structured compensations and related results, and showing that the embedding induces such a model.