Abstract. Transactions are commonly described as being ACID: Allor-nothing, Consistent, Isolated and Durable. However, although these words convey a powerful intuition, the ACID pr...
Andrew P. Black, Vincent Cremet, Rachid Guerraoui,...
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Flat transactions with savepoints are a variation of the classical flat transactions that allows the user to go undo work done so far back to a certain point within the transacti...
We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can...
Roberto Bruni, Fabio Gadducci, Alberto Lluch-Lafue...
In recent years, an increasing amount of attention has been paid to information systems (IS) outsourcing by practitioners as well as academics. However, our understanding of the fa...