메뉴 건너뛰기




Volumn 3086, Issue , 2004, Pages 519-542

Transactional monitors for concurrent objects

Author keywords

[No Author keywords available]

Indexed keywords


EID: 35048884255     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article
Times cited : (54)

References (41)
  • 5
    • 18244395833 scopus 로고    scopus 로고
    • The Two-Phase Commitment Protocol in an Extended piCalculus
    • Luca Aceto and Bjorn Victor, editors, Elsevier
    • Martin Berger and Kohei Honda. The Two-Phase Commitment Protocol in an Extended piCalculus. In Luca Aceto and Bjorn Victor, editors, Electronic Notes in Theoretical Computer o Science, volume 39. Elsevier, 2003.
    • (2003) Electronic Notes in Theoretical Computer O Science , vol.39
    • Berger, M.1    Honda, K.2
  • 6
    • 21344458338 scopus 로고    scopus 로고
    • An equational theory for transactions
    • DepartmentofComputerScience,OGISchool of Science and Engineering
    • Andrew Black, Vincent Cremet, Rachid Guerraoui, and Martin Odersky. An equational theory for transactions. Technical Report CSE03-007, DepartmentofComputerScience,OGISchool of Science and Engineering, 2003.
    • (2003) Technical Report CSE03-007
    • Black, A.1    Cremet, V.2    Guerraoui, R.3    Odersky, M.4
  • 8
    • 0035551906 scopus 로고    scopus 로고
    • A parameterized type system for race-free Java programs
    • Chandrasekhar Boyapati and Martin Rinard. A parameterized type system for race-free Java programs. In OOPSLA'Ol [33], pages 56-69.
    • OOPSLA'Ol [33] , pp. 56-69
    • Boyapati, C.1    Rinard, M.2
  • 10
    • 84874714120 scopus 로고    scopus 로고
    • Orchestrating transactions in the join calculus
    • Lubos Brim, Mojmír Kretíský Petr Jancar, and Antonín Kucera, editors, International Conference on Concurrency Theory
    • R. Bruni, C. Laneve, and U. Montanari. Orchestrating transactions in the join calculus. In Lubos Brim, Mojmír Kretíský Petr Jancar, and Antonín Kucera, editors, International Conference on Concurrency Theory, volume 2421 of Lecture Notes in Computer Science, pages 321-337,2002.
    • (2002) Lecture Notes in Computer Science , vol.2421 , pp. 321-337
    • Bruni, R.1    Laneve, C.2    Montanari, U.3
  • 12
    • 84945289545 scopus 로고    scopus 로고
    • Temporary Data in Shared Dataspace Coordination Languages
    • Springer-Verlag
    • Nadia Busi, Roberto Gorrieri, and Gianluigi Zavattaro. Temporary Data in Shared Dataspace Coordination Languages. In FOSSACS'01, pages 121-136. Springer-Verlag, 2001.
    • (2001) FOSSACS'01 , pp. 121-136
    • Busi, N.1    Gorrieri, R.2    Zavattaro, G.3
  • 15
    • 21344469440 scopus 로고    scopus 로고
    • Abstractions for fault-tolerant computing
    • Department of Computer Science, Stevens Institute of Technology
    • Tom Choithia and Dominic Duggan. Abstractions for fault-tolerant computing. Technical Report 2003-3, Department of Computer Science, Stevens Institute of Technology, 2003.
    • (2003) Technical Report 2003-3
    • Choithia, T.1    Duggan, D.2
  • 27
    • 33646148764 scopus 로고    scopus 로고
    • Optimistic Concurrency Semantics for Transactions in Coordination Languages
    • Coordination Models and Languages
    • Suresh Jagannathan and Jan Vitek. Optimistic Concurrency Semantics for Transactions in Coordination Languages. In Coordination Models and Languages, volume 2949 of Lecture Notes in Computer Science, pages 183-198,2004.
    • (2004) Lecture Notes in Computer Science , vol.2949 , pp. 183-198
    • Jagannathan, S.1    Vitek, J.2
  • 28
    • 0004177551 scopus 로고
    • A new approach to exclusive data access in shared memory multiprocessors
    • Lawrence Livermore National Laboratories
    • E. H. Jensen, G. W. Hagensen, and J. M. Broughton. A new approach to exclusive data access in shared memory multiprocessors. Technical report, Lawrence Livermore National Laboratories, 1987.
    • (1987) Technical Report
    • Jensen, E.H.1    Hagensen, G.W.2    Broughton, J.M.3
  • 29
  • 31
    • 0005595913 scopus 로고    scopus 로고
    • Nested algorithmic skeletons from higher order functions
    • Special issue on High Level Models and Languages for Parallel Processing
    • G. Michaelson, N. Scaife, P. Bristow, and P. King. Nested algorithmic skeletons from higher order functions. Parallel Algorithms and Applications, 2000. Special issue on High Level Models and Languages for Parallel Processing.
    • (2000) Parallel Algorithms and Applications
    • Michaelson, G.1    Scaife, N.2    Bristow, P.3    King, P.4
  • 37
    • 0000151487 scopus 로고    scopus 로고
    • Effective fine-grained synchronization for automatically parallelized programs using optimistic synchronization primitives
    • November
    • Martin Rinard. Effective fine-grained synchronization for automatically parallelized programs using optimistic synchronization primitives. A CM Transactions on Computer Systems, 17(4):337-371, November 1999.
    • (1999) A CM Transactions on Computer Systems , vol.17 , Issue.4 , pp. 337-371
    • Rinard, M.1
  • 40
    • 35048845164 scopus 로고    scopus 로고
    • A semantic framework for designer transactions
    • David E. Schmidt, editor, Proceedings of the European Symposium on Programming
    • Jan Vitek, Suresh Jagannathan, Adam Welc, and Antony L. Hosking. A semantic framework for designer transactions. In David E. Schmidt, editor, Proceedings of the European Symposium on Programming, volume 2986 of Lecture Notes in Computer Science, pages 249-263,2004.
    • (2004) Lecture Notes in Computer Science , vol.2986 , pp. 249-263
    • Vitek, J.1    Jagannathan, S.2    Welc, A.3    Hosking, A.L.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.