Temporal logic verification of lock-freedom

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

Volumn 6120 LNCS, Issue , 2010, Pages 377-396

  Tofan, Bogdan ^a   Bäumler, Simon ^a   Schellhorn, Gerhard ^a   Reif, Wolfgang ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

Compositional reasoning; Linearizability; Lock freedom; Rely guarantee; Temporal logic; Verification

Indexed keywords

COMPLEX PARTS; COMPOSITIONAL REASONING; INTERACTIVE THEOREM PROVER; LINEARIZABILITY; LIVENESS PROPERTIES; LOCK-FREE; LOCK-FREE ALGORITHMS; LOCK-FREEDOM; LOGIC VERIFICATION; MULTI CORE; PROOF OBLIGATIONS; QUEUE ALGORITHMS; RELY-GUARANTEE; SAFETY PROPERTY; SYMBOLIC EXECUTION;

ALGORITHMS; DATA STRUCTURES; MICROPROCESSOR CHIPS; MODEL PREDICTIVE CONTROL; MULTICORE PROGRAMMING; QUEUEING THEORY; USER INTERFACES;

TEMPORAL LOGIC;

EID: 79956295463     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13321-3_21     Document Type: Conference Paper

References (37)

1. Treiber, R.K.: System programming: Coping with parallelism. Technical Report RJ 5118, IBM Almaden Research Center (1986)
2. Hendler, D., Shavit, N., Yerushalmi, L.: A scalable lock-free stack algorithm. In: SPAA '04: ACM symposium on Parallelism in algorithms and architectures, pp. 206-215. ACM Press, New York (2004)
3. Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proc. 15th ACM Symp. on Principles of Distributed Computing, pp. 267-275 (1996)
4. Michael, M.M.: Cas-based lock-free algorithm for shared deques. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 651-660. Springer, Heidelberg (2003) (Pubitemid 37223898)
5. Michael, M.M.: High performance dynamic lock-free hash tables and list-based sets. In: SPAA 2002, pp. 73-82. ACM, New York (2002)
6. Doherty, S., Detlefs, D.L., Groves, L., Flood, C.H., Luchangco, V., Martin, P.A., Moir, M., Shavit, N., Steele Jr., G.L.: Dcas is not a silver bullet for nonblocking algorithm design. In: SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pp. 216-224. ACM, New York (2004)
7. Doherty, S., Groves, L., Luchangco, V., Moir, M.: Formal verification of a practical lock-free queue algorithm. In: de Frutos-Escrig, D., Núñez, M. (eds.) FORTE 2004. LNCS, vol. 3235, pp. 97-114. Springer, Heidelberg (2004) (Pubitemid 39741570)
8. Groves, L., Colvin, R.: Trace-based derivation of a scalable lock-free stack algorithm. Formal Aspects of Computing (FAC) 21(1-2), 187-223 (2009)
9. Vafeiadis, V., Herlihy, M., Hoare, T., Shapiro, M.: Proving correctness of highlyconcurrent linearisable objects. In: PPoPP '06: Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming, pp. 129-136. ACM, New York (2006) (Pubitemid 44758683)
10. Gao, H., Hesselink, W.H.: A formal reduction for lock-free parallel algorithms. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 305-309. Springer, Heidelberg (2004)
11. Bäumler, S., Schellhorn, G., Tofan, B., Reif, W.: Proving linearizability with temporal logic. In: Formal Aspects of Computing (FAC), (2009), http://www.springerlink.com/content/7507m59834066h04/
12. Colvin, R., Dongol, B.: Verifying lock-freedom using well-founded orders. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol. 4711, pp. 124-138. Springer, Heidelberg (2007)
13. Colvin, R., Dongol, B.: A general technique for proving lock-freedom. Sci. Comput. Program. 74(3), 143-165 (2009)
14. Gotsman, A., Cook, B., Parkinson, M., Vafeiadis, V.: Proving that nonblocking algorithms don't block. In: Principles of Programming Languages, pp. 16-28. ACM, New York (2009)
15. Herlihy, M., Wing, J.: Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12(3), 463-492 (1990) (Pubitemid 20721345)
16. Massalin, H., Pu, C.: A lock-free multiprocessor os kernel. SIGOPS Oper. Syst. Rev. 26(2), 108 (1992)
17. Jones, C.B.: Specification and design of (parallel) programs. In: Proceedings of IFIP'83, pp. 321-332. North-Holland, Amsterdam (1983)
18. Misra, J.: A reduction theorem for concurrent object-oriented programs. In:McIver, A., Morgan, C. (eds.) Programming methodology, pp. 69-92. Springer, New York (2003)
19. Moszkowski, B.: Executing Temporal Logic Programs. Cambridge University Press, Cambridge (1986)
20. Cau, A., Moszkowski, B., Zedan, H.: ITL - Interval Temporal Logic. Software Technology Research Laboratory, SERCentre, De Montfort University, The Gateway, Leicester LE1 9BH, UK (2002), http://www.cms.dmu.ac.uk/~cau/itlhomepage
21. Reif, W., Schellhorn, G., Stenzel, K., Balser, M.: Structured specifications and interactive proofs with KIV. In: Bibel, W., Schmitt, P. (eds.) Automated Deduction-A Basis for Applications. Systems and Implementation Techniques, vol. II, pp. 13-39. Kluwer Academic Publishers, Dordrecht (1998)
22. Gao, H., Groote, J.F., Hesselink, W.H.: Lock-free parallel and concurrent garbage collection by mark&sweep. Sci. Comput. Program. 64(3), 341-374 (2007) (Pubitemid 44828142)
23. Bäumler, S., Balser, M., Nafz, F., Reif, W., Schellhorn, G.: Interactive verification of concurrent systems using symbolic execution. AI Communications 23(2-3), 285-307 (2010)
24. Balser, M.: Verifying Concurrent System with Symbolic Execution. Shaker Verlag, Germany (2006)
25. Collette, P., Knapp, E.: Logical foundations for compositional verification and development of concurrent programs in unity. In: Alagar, V.S., Nivat, M. (eds.) AMAST 1995. LNCS, vol. 936, pp. 353-367. Springer, Heidelberg (1995)
26. Roever,W.P.D., de Boer, F., Hannemann, U., Hooman, J., Lakhnech, Y., Poel, M., Zwiers, J.: Concurrency Verification: Introduction to Compositional and Noncompositional Methods. Cambridge Tracts in Theoretical Computer Science, vol. 54. Cambridge University Press, Cambridge (2001)
27. Online Presentation of the KIV-specifications and the Verification of the Queue (and Stack), http://www.informatik.uni-augsburg.de/swt/projects/lock- free.html
28. Abadi, M., Lamport, L.: Conjoining specifications. ACM Transactions on Programming Languages and Systems (1995)
29. Dongol, B.: Formalising progress properties of non-blocking programs. In: Liu, Z., He, J. (eds.) ICFEM 2006. LNCS, vol. 4260, pp. 284-303. Springer, Heidelberg (2006) (Pubitemid 44860758)
30. Vafeiadis, V.: Modular fine-grained concurrency verification. PhD thesis, University of Cambridge (2007)
31. Gao, H., Groote, J.F., Hesselink, W.H.: Lock-free dynamic hash tables with open addressing. Distrib. Comput. 18(1), 21-42 (2005) (Pubitemid 41660459)
32. Amit, D., Rinetzky, N., Reps, T.W., Sagiv, M., Yahav, E.: Comparison under abstraction for verifying linearizability. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 477-490. Springer, Heidelberg (2007)
33. Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. ACM Trans. Program. Lang. Syst. 24(3), 217-298 (2002)
34. Derrick, J., Schellhorn, G., Wehrheim, H.: Proving linearizability via non-atomic refinement. In: Davies, J., Gibbons, J. (eds.) IFM 2007. LNCS, vol. 4591, pp. 195-214. Springer, Heidelberg (2007)
35. Owicki, S.S., Gries, D.: An Axiomatic Proof Technique for Parallel Programs I. Acta Inf. 6, 319-340 (1976)
36. Colvin, R., Groves, L.: Formal verification of an array-based nonblocking queue. In: ICECCS '05: Proceedings of the 10th IEEE International Conference on Engineering of Complex Computer Systems, Washington, DC, USA, pp. 507-516. IEEE Computer Society Press, Los Alamitos (2005) (Pubitemid 41495779)
37. O'Hearn, P., Reynolds, J., Yang, H.: Local reasoning about programs that alter data structures. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, p. 1. Springer, Heidelberg (2001)