Formal verification of a lazy concurrent list-based set algorithm

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

Volumn 4144 LNCS, Issue , 2006, Pages 475-488

  Colvin, Robert ^a   Groves, Lindsay ^b   Luchangco, Victor ^c   Moir, Mark ^c  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^c SUN MICROSYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER OPERATING SYSTEMS; COMPUTER SIMULATION; CONCURRENT ENGINEERING; LINEAR SYSTEMS; OPTIMIZATION;

COARSE GRAINED LOCKING ALGORITHMS; FORMAL VERIFICATION;

SET THEORY;

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

References (15)

1. Heller, S., Herlihy, M., Luchangco, V., Moir, M., Scherer, W., Shavit, N.: A lazy concurrent list-based set algorithm. In: 9th International Conference on Principles of Distributed Systems (OPODIS). (2005)
2. Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. TOPLAS 12(3) (1990) 463-492
3. Crow, J., Owre, S., Rushby, J., Shankar, N., Srivas, M.: A tutorial introduction to PVS. In: Workshop on Industrial-Strength Formal Specification Techniques, Boca Raton, Florida (1995)
4. Doherty, S.: Modelling and verifying non-blocking algorithms that use dynamically allocated memory. Master's thesis, School of Mathematical and Computing Sciences, Victoria University of Wellington (2003)
5. 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.: Formal Techniques for Networked and Distributed Systems -FORTE 2004, 24th IFIP WG 6.1 International Conference, Madrid Spain, September 27-30, 2004, Proceedings. Volume 3235 of Lecture Notes in Computer Science., Springer (2004) 97-114
6. Colvin, R., Doherty, S., Groves, L.: Verifying concurrent data structures by simulation. In Boiten, E., Derrick, J., eds.: Proc. Refinement Workshop 2005 (REFINE 2005). Volume 137(2) of Electronic Notes in Theoretical Computer Science., Guildford, UK, Elsevier (2005)
7. Colvin, R., Groves, L.: Formal verification of an array-based nonlocking queue. In: ICECCS 2005: Proceedings of the 10th IEEE International Conference on Engineering of Complex Computer Systems, Shanghai, Chin (2005) 507-516
8. Lynch, N., Tuttle, M.: An Introduction to Input/Output automata. CWI-Quarterly 2(3) (1989) 219-246
9. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann (1996)
10. Lynch, N.A., Vaandrager, F.W.: Forward and backward simulations - part I: untimed systems. Information and Computation 121(2) (1995) 214 - 233
11. Holzmann, G.J.: The model checker SPIN. IEEE Trans. Softw. Eng. 23(5) (1997) 279-295
12. de Moura, L., Owre, S., Rueß, H., Rushby, J., Shankar, N., Sorea, M., Tiwari, A.: SAL 2. In Alur, R., Peled, D., eds.: Computer-Aided Verification, CAV 2004. Volume 3114 of Lecture Notes in Computer Science., Boston, MA, Springer-Verlag (2004) 496-500
13. Vafeiadis, V., Herlihy, M., Hoare, T., Shapiro, M.: Proving correctness of highly-concurrent linearisable objects. In: PPoPP '06: Proc. 11th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, New York, NY, USA, ACM Press (2006) 129-136
14. Jones, C.B.: Specification and design of (parallel) programs. In: 9th IFIP World Computer Congress (Information Processing 83). Volume 9 of FIP Congress Series., IFIP, North-Holland (1983) 321-332
15. Xu, Q., de Roever, W.P., He, J.: The rely-guarantee method for verifying shared variable concurrent programs. Formal Aspects of Computing 9(2) (1997) 149-174