SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A calculus of mobile processes, I
Information and Computation
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Principal Typing Schemes in a Polyadic pi-Calculus
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Theoretical foundations for compensations in flow composition languages
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Asynchronous Complete Distributed Garbage Collection
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
The transaction concept: virtues and limitations (invited paper)
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
SOCK: a calculus for service oriented computing
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
Foundations of web transactions
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Towards a unifying theory for web services composition
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
A formal semantics for the WS-BPEL recovery framework: the π-calculus way
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
Towards compensation correctness in interactive systems
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
A java inspired semantics for transactions in SOC
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Error handling: from theory to practice
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
Compensation-aware runtime monitoring
RV'10 Proceedings of the First international conference on Runtime verification
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
Failure-divergence semantics and refinement of long running transactions
Theoretical Computer Science
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
Recovery within long-running transactions
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Most business applications rely on the notion of long running transaction as a fundamental building block. This paper presents a calculus for modelling long running transactions within the framework of the *** -calculus, with support for compensation as a recovery mechanism. The underlying model of this calculus is the asynchronous polyadic *** -calculus, with transaction scopes and dynamic installation of compensation processes. We add to the framework a type system which guarantees that transactions are unequivocally identified, ensuring that upon a failure the correct compensation process is invoked. Moreover, the operational semantics of the calculus ensures both installation and activation of the compensation of a transaction.