Automatically verifying concurrent queue algorithms

Electronic Notes in Theoretical Computer Science

Volumn 89, Issue 3, 2003, Pages 450-463

  Yahav, Eran ^a   Sagiv, Mooly ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE; ERROR ANALYSIS; JAVA PROGRAMMING LANGUAGE; MATHEMATICAL MODELS; PERSONAL COMPUTERS; QUEUEING NETWORKS; SYNCHRONIZATION;

CONCURRENT SYSTEMS; QUEUE ALGORITHMS; QUEUE MANIPULATIONS; TVLA;

ALGORITHMIC LANGUAGES;

EID: 18744406005     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80006-4     Document Type: Article

References (20)

1. Abdulla P.A., Annichini A., Bensalem S., Bouajjani A. Verification of infinite-state systems by combining abstraction and reachability analysis. Lecture Notes in Computer Science. 1633;. 1999
2. Bensalem S., Ganesh V., Lakhnech Y., Muñoz C., Owre S., Rueß H., Rushby J., Rusu V., Saïdi H., Shankar N., Singerman E., Tiwari A. An overview of SAL. LFM 2000: Fifth NASA Langley Formal Methods Workshop. June 2000;187-196. Proceedings available at http://shemesh.larc.nasa.gov/fm/Lfm2000/Proc/
3. Bensalem S., Lakhnech Y., Owre S. InVeSt: A tool for the verification of invariants. LNCS. 1427:1998
4. Cousot P., Cousot R. Systematic design of program analysis frameworks. POPL. 1979;269-282 ACM Press, New York, NY
5. Das S., Dill D.L., Park S. Experience with predicate abstraction. 11th Int. Conf. on Computer-Aided Verification. July 1999;Springer-Verlag, Trento, Italy
6. Field J., Goyal D., Ramalingam G., Yahav E. Typestate verification: Abstraction techniques and complexity results. Proc. Static Analysis Symposium. 2003
7. Graf S., Saidi H. Construction of abstract state graphs with PVS. LNCS. 1254:1997;72-83
8. Jones N.D., Muchnick S.S. Flow analysis and optimization of Lisp-like structures. Program Flow Analysis: Theory and Applications, chapter 4. 1981;102-131 Prentice-Hall, Englewood Cliffs, NJ
9. Michael M.M., Scott M.L. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC '96). May 1996;267-275 ACM, New York, USA
10. Prakash S., Lee Y, Johnson T. A non-blocking algorithm for shared queues using Compare-and-Swap. Proceedings of the 1991 International Conference on Parallel Processing. 1991;68-75
11. Reps T., Sagiv M., Loginov A. Finite differencing of logical formulas for static analysis. In Proc. European Symp. on Programming. 2003
12. Sagiv M., Reps T., Wilhelm R. Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems (TOPLAS). 24:(3):2002;217-298
13. Saidi H. Model checking guided abstraction and analysis. Proceedings of the 7th International Static Analysis Symposium (SAS '00). 2000
14. Stone J.M. A simple and correct shared-queue algorithm using Compare-and-Swap. Proceedings of Supercomputing '90. 1990;495-504
15. Stone J.M. A non-blocking Compare-and-Swap algorithm for a shared circular queue. Tzafestas S., et al. Parallel and Distributed Computing in Engineering Systems. 1992;147-152 Elsevier Science Publishers
16. Strom R.E. Mechanisms for compile-time enforcement of security. Proc. of the 10th Annual ACM Symposium on Principles of Programming Lanuages. January 1983;276-284 Austin, TX
17. Strom R.E., Yemini S. Typestate: A programming language concept for enhancing software reliability. tose. SE-12:(1):January 1986;157-171
18. Wing J.M., Gong C. A library of concurrent objects and their proofs of correctness. Technical Report CMU-CS-90-151, Carnegie-Mellon University. 1990
19. E. Yahav. http://www.cs.tau.ac.il/~yahave.
20. Yahav E. Verifying safety properties of concurrent Java programs using 3-valued logic. Proc. of 27th POPL. March 2001;27-40