Formalising progress properties of non-blocking programs

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

Volumn 4260 LNCS, Issue , 2006, Pages 284-303

  Dongol, Brijesh ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORMAL LOGIC; SYNCHRONIZATION;

NON-BLOCKING PROGRAMS;

COMPUTER PROGRAMMING;

EID: 33845274916     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11901433_16     Document Type: Article

References (20)

1. [CG05] R. Colvin and L. Groves. Formal verification of an array-based nonblocking queue. In 10th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), pages 507-516. IEEE Computer Society, 2005.
2. [CM88] K. M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley Longman Publishing Co., Inc., 1988.
3. [DG06] B. Dongol and D. Goldson. Extending the theory of Owicki and Gries with a logic of progress. Logical Methods in Computer Science, 2(6):1-25, March 2006.
4. [DGLM04] S. Doherty, L. Groves, V. Luchangco, and M. Moir. Formal verification of a practical lock-free queue algorithm. In FORTE, volume 3235 of Lecture Notes in Computer Science, pages 97-114. Springer, 2004.
5. [Dij76] E. W. Dijkstra. A Discipline of Programming. Prentice Hall, 1976.
6. [DM06] B. Dongol and A. J. Mooij. Progress in deriving concurrent programs: Emphasizing the role of stable guards. In Tarmo Uustalu, editor, Proceedings of the 8th International Conference on Mathematics of Program Construction, volume 4014, pages 140-161. Lecture Notes in Computer Science, Jun 2006.
7. [Doh03] S. Doherty. Modelling and verifying non-blocking algorithms that use dynamically allocated memory. Master's thesis, Victoria University of Wellington, 2003.
8. [FvG99] W. H. J. Feijen and A. J. M. van Gasteren. On a Method of Multiprogramming. Springer Verlag, 1999.
9. [GC96] Michael Greenwald and David R. Cheriton. The synergy between non-blocking synchronization and operating system structure. In Operating Systems Design and Implementation, pages 123-136. ACM Press, 1996.
10. [GD05] D. Goldson and B. Dongol. Concurrent program design in the extended theory of Owicki and Gries. In M. Atkinson and F. Dehne, editors, CATS, volume 41, pages 41-50, Newcastle, Australia, 2005. Conferences in Research and Practice in Information Technology.
11. [Her88] M. Herlihy. Impossibility and universality results for wait-free synchronization. In PODC '88: Proceedings of the 7th annual ACM Symposium on Principles of Distributed Computing, pages 276-290, New York, NY, USA, 1988. ACM Press.
12. [HLM03] M. Herlihy, V. Luchangco, and M. Moir. Obstruction-free synchronization: Double-ended queues as an example. In 23rd IEEE International Conference on Distributed Computing Systems, page 522, 2003.
13. [HW90] M. P. Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst., 12(3):463-492, 1990.
14. [Mic04] M. M. Michael. Practical lock-free and wait-free LL/SC/VL implementations using 64-bit CAS. In Rachid Guerraoui, editor, DISC, volume 3274 of Lecture Notes in Computer Science, pages 144-158, Amsterdam, The Netherlands, October 2004. Springer.
15. [Moo02] A. J. Mooij. Formal derivations of non-blocking multiprograms. Master's thesis, Technische Universiteit Eindhoven, 2002.
16. [MP91] H. Massalin and C. Pu. A lock-free multiprocessor OS kernel. Technical Report CUCS-005-91, Columbia University, New York, 1991.
17. [MP92] Z. Manna and P. Pnueli. Temporal Verification of Reactive and Concurrent Systems: Specification. Springer-Verlag New York, Inc., 1992.
18. [OG76] S. Owicki and D. Gries. Verifying properties of parallel programs: An axiomatic approach. Commun. ACM, 19(5):279-285, 1976.
19. [SS05] W. N. Scherer and M. L. Scott. Advanced contention management for dynamic software transactional memory. In PODC, pages 240-248. ACM Press, 2005.
20. [Sun04] H. Sundell. Efficient and practical non-blocking data structures. PhD thesis, Department of Computer Science, Chalmers University of Technology and Göteborg University, 2004.