Verifying Compensating Transactions
Abstract elided by the publisher.
Related papers
- Theoretical foundations for compensations in flow composition languages POPL 2005
- Composable, nestable, pessimistic atomic statements OOPSLA 2011
- Comparing Tail Duplication with Compensation Code in Single Path Global Instruction Scheduling CC 2001
- On the Expressive Power of Primitives for Compensation Handling ESOP 2010
- Avoidance and Suppression of Compensation Code in a Trace Scheduling Compiler TOPLAS 1994
- C4: verified transactional objects OOPSLA 2022
- Pushing the Limit: Verified Performance-Optimal Causally-Consistent Database Transactions TACAS 2025
- Implementing and verifying release-acquire transactional memory in C11 OOPSLA 2022