Causal atomicity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4144 LNCS, Issue , 2006, Pages 315-328

  Farzan, Azadeh ^a   Madhusudan, P ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; BLOCK CODES; DATA ACQUISITION; INTERACTIVE COMPUTER SYSTEMS; MATHEMATICAL MODELS; PETRI NETS; ROBUSTNESS (CONTROL SYSTEMS); STATE SPACE METHODS;

CAUSAL ATOMICITY; DATA ABSTRACTION; PROGRAM CONTROL FLOW; ROBUST NOTION;

COMPUTER SYSTEMS PROGRAMMING;

EID: 33749849953     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_30     Document Type: Conference Paper

References (23)

1. R. Alur, K. McMillan, and D. Peled. Model-checking of correctness conditions for concurrent objects. Inf. Comput., 160(1-2):167-188, 2000.
2. P. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency control and recovery in database systems. Addison-Wesley Longman., 1987.
3. S. Chaki, E. Clarke, N. Kidd, T. Reps, and T. Touili. Verifying concurrent message-passing C programs with recursive calls. In TACAS, volume 3920 of LNCS, pages 334-349, 2006.
4. V. Diekert and G. Rozenberg. The Book of Traces. World Scientific Publishing Co., 1995.
5. J. Esparza, S. Romer, and W. Vogler. An improvement of McMillan's unfolding algorithm. In TACAS, volume 1055 of LNCS, pages 87-106, 1996.
6. K. Eswaran, J. Gray, R. Lorie, and I. Traiger. The notions of consistency and predicate locks in a database system. Commun. ACM, 19(11):624-633, 1976.
7. C. Flanagan. Verifying commit-atomicity using model-checking. In SPIN, pages 252-266, 2004.
8. C. Flanagan and S. Freund. Atomizer: a dynamic atomicity checker for multi-threaded programs. In POPL, pages 256-267, 2004.
9. C. Flanagan, S. Freund, and S. Qadeer. Exploiting purity for atomicity. IEEE Trans. Software Eng., 31(4):275-291, 2005.
10. C. Flanagan and S. Qadeer. Types for atomicity. In TLDI, pages 1-12, 2003.
11. M. Fié and G. Roucairol. On serializability of iterated transactions. In PODC, pages 194-200, 1982.
12. B. Grahlmann. The PEP tool. In CAV, pages 440-443, 1997.
13. J. Hatcliff, Robby, and M. Dwyer. Verifying atomicity specifications for concurrent object-oriented software using model-checking. In VMCAI, pages 175-190, 2004.
14. K. Jensen. Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1. Springer-Verlag, London, UK, 1996.
15. R. Lipton. Reduction: A method of proving properties of parallel programs. Commun. ACM, 18(12):717-721, 1975.
16. K. Lodaya, M. Mukund, R. Ramanujam, and P. S. Thiagarajan. Models and logics for true concurrency. Technical Report TCS-90-3, School of Mathematics Internal, 1990.
17. K. McMillan. A technique of state space search based on unfolding. Formal Methods in System Design, 6(1):45-65, 1995.
18. M. Nielsen, G. Plotkin, and G. Winsker. Peri nets, event structures and domains - part i. Theoretical Computer Science, 13:85-108, 1981.
19. C. Papadimitriou. The theory of database concurrency control. Computer Science Press, Inc., New York, NY, USA, 1986.
20. S. Qadeer and D. Wu. KISS: keep it simple and sequential. In PLDI, pages 14-24, 2004.
21. A. Silberschatz, H. Korth, and S. Sudarshan. Database Systems Concepts. McGraw-Hill, 5th edition, 2005.
22. L. Wang and S. Stoller. Run-time analysis for atomicity. Electr. Notes Theor. Comput. Sci., 89(2), 2003.
23. L. Wang and S. Stoller. Static analysis of atomicity for programs with non-blocking synchronization. In PPOPP, pages 61-71, 2005.