Reasoning about optimistic concurrency using a program logic for history

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

Volumn 6269 LNCS, Issue , 2010, Pages 388-402

  Fu, Ming ^a   Li, Yong ^a   Feng, Xinyu ^a,b   Shao, Zhong ^c   Zhang, Yu ^a  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^c YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXECUTION HISTORY; HISTORY VARIABLES; MODULAR PROGRAMS; NON-BLOCKING; OPTIMISTIC CONCURRENCY; PARALLEL PROGRAM; PROGRAM LOGIC; PROGRAM STATE; SEPARATION LOGIC; STACK ALGORITHM; TEMPORAL OPERATORS;

ALGORITHMS; FORMAL LOGIC; PARALLEL ARCHITECTURES;

MATHEMATICAL OPERATORS;

EID: 78249234389     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15375-4_27     Document Type: Conference Paper

References (19)

1. Dice, D., Shalev, O., Shavit, N.: Transactional locking II. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 194-208. Springer, Heidelberg (2006)
2. Feng, X.: Local rely-guarantee reasoning. In: Proc. 36th ACM Symp. on Principles of Prog. Lang., pp. 315-327. ACM Press, New York (January 2009)
3. Feng, X., Ferreira, R., Shao, Z.: On the relationship between concurrent separation logic and assume-guarantee reasoning. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 173-188. Springer, Heidelberg (2007)
4. Fu, M., Li, Y., Feng, X., Shao, Z., Zhang, Y.: Reasoning about optimistic concurrency using a program logic for history. Technical Report YALEU/DCS/TR- 1428, Dept. of Computer Science, Yale University, New Haven, CT (June 2010), http://flint.cs.yale.edu/publications/roch.html
5. Gotsman, A., Cook, B., Parkinson, M.J., Vafeiadis, V.: Proving that non-blocking algorithms don't block. In: Proc. 36th ACM Symp. on Principles of Prog. Lang., pp. 16-28. ACM, New York (2009)
6. Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124-149 (1991)
7. Herlihy, M., Moss, J.E.B.: Transactional memory: Architectural support for lock-free data structures. In: Proc. 20th Annual Int'l Symp. on Computer Architecture (ISCA), pp. 289-300 (1993)
8. Jones, C.B.: Tentative steps toward a development method for interfering programs. ACM Trans. on Programming Languages and Systems 5(4), 596-619 (1983)
9. Lamport, L., Schneider, F.B.: The "Hoare Logic" of CSP, and all that. ACM Trans. Program. Lang. Syst. 6(2), 281-296 (1984)
10. Lichtenstein, O., Pnueli, A., Zuck, L.D.: The glory of the past. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol. 193, pp. 196-218. Springer, Heidelberg (1985)
11. Michael, M.M.: Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Trans. Parallel Distrib. Syst. 15(6), 491-504 (2004)
12. Misra, J., Chandy, K.M.: Proofs of networks of processes. IEEE Trans. Software Eng. 7(4), 417-426 (1981)
13. O'Hearn, P.W.: Resources, concurrency and local reasoning. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 49-67. Springer, Heidelberg (2004)
14. Parkinson, M., Bornat, R., O'Hearn, P.: Modular verification of a non-blocking stack. In: Proc. 34th ACM Symp. on Principles of Prog. Lang, pp. 297-302. ACM Press, New York (January 2007)
15. Parkinson, M.J., Bornat, R., Calcagno, C.: Variables as resource in hoare logics. In: Proc. 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pp. 137-146. IEEE Computer Society, Los Alamitos (August 2006)
16. Pnueli, A.: In transition from global to modular temporal resoning about programs. In: Apt, K.R. (ed.) Logics and Models of Concurrent Systems. NATO ASI Series, pp. 123-144. Springer, Heidelberg (1984)
17. Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: Proc. 17th Annual IEEE Symposium on Logic in Computer Science (LICS 2002), pp. 55-74. IEEE Computer Society, Los Alamitos (July 2002)
18. Vafeiadis, V.: Modular fine-grained concurrency verification. PhD thesis, Computer Laboratory. University of Cambridge, Cambridge, UK (July 2007)
19. Vafeiadis, V., Parkinson, M.: A marriage of rely/guarantee and separation logic. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 256-271. Springer, Heidelberg (2007)