A transaction defines a locus of computation that satisfies important concurrency and failure properties; these so-called ACID properties provide strong serialization guarantees that allow us to reason about concurrent and distributed programs in terms of higher-level units of computation (e.g., transactions) rather than lower-level data structures (e.g., mutual-exclusion locks). This paper presents a framework for specifying the semantics of a transactional facility integrated within a host programming language. The TFJ calculus supports nested and multi-threaded transactions. We give a semantics to TFJ that is parameterized by the definition of the transactional mechanism that permits the study of different transaction models. © Springer-Verlag 2004.
CITATION STYLE
Vitek, J., Jagannathan, S., Welc, A., & Hosking, A. L. (2004). A semantic framework for designer transactions. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2986, 249–263. https://doi.org/10.1007/978-3-540-24725-8_18
Mendeley helps you to discover research relevant for your work.