Isolation-only transactions by typing and versioning

PPDP'05 - Proceedings of the Seventh ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn 2005, Issue , 2005, Pages 70-81

  Wojciechowski, Paweł T ^a  

^a EPFL   (Switzerland)

Author keywords

Abstract types; Concurrency; Declarative synchronization; Isolation; Lambda calculus; Programming languages; Singleton kinds; Transactions; Type theory

Indexed keywords

ALGORITHMS; CONCURRENCY CONTROL; CONTROL SYSTEMS; ENCODING (SYMBOLS); MULTITASKING; SEMANTICS; SYNCHRONIZATION;

ABSTRACT TYPES; CONCURRENCY; DECLARATIVE SYNCHRONIZATION'S; ISOLATION; LAMBDA CALCULUS; SINGLETON KINDS; TRANSACTIONS; TYPE THEORY;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33746095439     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1069774.1069781     Document Type: Conference Paper

References (35)

1. M. Berger and K. Honda. The two-phase commitment protocol in an. extended pi-calculus. Electronic Notes in Theoretical Computer Science, 39(1), 2000.
2. P. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
3. A. Bestavros. Advances in real-time database systems research. ACM SIGMOD Record, 25(1):3-8, 1996.
4. A. P. Black, V. Cremet;, R. Guerraoui, and M. Odersky. An equational theory for transactions. In Proc. FSTTCS '03, Dec, 2003.
5. R. Bruni, H. Melgratti, and U. Montanari. Theoretical foundations for compensations in flow composition languages. In Proc. POPL '05, Jan. 2005.
6. P. K. Chrysanthis and K. Ramamritham. ACTA: A framework for specifying and reasoning about transaction structure and behavior. In ACM SIGMOD Conference on 'Management of Data, 1990.
7. D. Detlefs, M. Herlihy, and J. Wing. Inheritance of synchronization and recovery properties in Avalon / C++. IEEE Computer, 21(12):57-69, Dec. 1988.
8. J. L. Eppinger, L. B. Mummert, and A. Z. Spector, editors. Camelot and Avalon: A Distributed Transaction Facility. Morgan Kaufmann, 1991.
9. C. Flanagan and M. Abadi. Types for safe locking. In Proc. ESOP '99, LNCS 1576, Mar. 1999.
10. C. Flanagan and S. Qadeer. A type and effect system for atomicity. In Proc. PLDI '03, June 2003.
11. C. Fournet and G. Gonthier. The reflexive chemical abstract machine and the join-calculus. In Proc. POPL '96, Jan. 1996.
12. J. Gosling, B. Joy, G. Steele, and G. Bracha. The Java Language Specification, end Ed. Addison Wesley, 2000.
13. M. H. Graham. Issues in real-time data management. Technical Report SEI-TR-17, Carnegie-Mellon University, July 1991.
14. N. Haines, D. Kindred, J. G. Morrisett, S. M. Nettles, and J. M. Wing. Composing first-class transactions. ACM TOPLAS, 16(6): 1719-1736, Nov. 1994.
15. T. Harris arid K. Fraser. Language support for lightweight transactions. In Proc. OOPSLA '03, 2003.
16. T. Harris, S. Marlow, S. Peyton Jones, and M. Herlihy. Composable memory transactions. In Proc. PPoPP '05, June 2005.
17. M. P. Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems (TOPLAS), 12(3):463-492, 1990.
18. C. A. R. Hoare. Towards a theory of parallel programming. In Operating Systems Techniques, volume 9 of A.P.I.C. Studies in Data Processing, pages 61-71, 1972.
19. S. Jagannathan and J. Vitek. Optimistic concurrency semantics for transactions in coordination languages. In Proc. Coordination '04, LNCS 2949, Feb. 2004.
20. K.-J. Lin and C.-S. Peng. Enhancing external consistency in real-time transactions. ACM SIGMOD Record, 25(1):26-28, 1996.
21. S. Mena, A. Schiper, and P. T. Wojciechowski. A step towards a new generation of group communication systems. In Proc. Middleware '03, LNCS 2672, 2003.
22. Microsoft. MTS. http://www.microsoft.com/.
23. P. Panangaden and J. Reppy. The Essence of Concurrent ML. In ML with Concurrency: Design, Analysis, Implementation, and Application., pages 5-29. Springer, 1997.
24. S. Peyton Jones, A. Gordon, and S. Finno. Concurrent Haskell. In Proc. POPL '96, Jan. 1996.
25. B. C. Pierce and D. N. Turner. Pict: A programming language based on the pi-calculus. In Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 2000.
26. G. D. Plotkin. Call-by-name, call-by-value and the A-calculus, TCS, 1:125-159, 1975.
27. SAMOA, http://lsrwww.epil.ch/samoa.
28. P. Sewell, P. T. Wojciechowski, and B. C. Pierce. Location-independent communication for mobile agents: a two-level architecture. In Internet Programming Languages, LNCS 1686, 1999.
29. L. Shu and M. Young. Correctness criteria and concurrency control for real-time systems: a survey. Technical Report SERC-TR-131-P, Purdue University, Nov. 1992.
30. Sun Microsystems. EJB. http://java.sun.com/.
31. J. Vitek, S. Jagannathan, A. Welc, and A. L. Hosking. A semantic framework for designer transactions. In Proc. ESOP '04, LNCS 2986, March/April 2004.
32. G. Weikum and G. Vossen. Transactional Information Systems. Morgan Kaufmann, 2002.
33. J. M. Wing, M. Faehndrich, J. G. Morrisett, and S. Nettles. Extensions to Standard ML to support; transactions. In Proc. ACM Workshop on ML and its Applications, 1992.
34. P. Wojciechowski, O. Rütti, and A. Schiper. SAMOA: A framework for a synchronisation-augmented microprotocol approach. In Proc. IPDPS '04, 2004.
35. P. T. Wojciechowski. Isolation-only transactions by typing and versioning. Technical Report IC-2004-104, EPFL, School of Computer and Communication Sciences, Dec. 2004.