Formal Verification of Lock-Free Algorithms

[37] H. Gao, J.F. Groote, and W. H. Hesselink,“Lock-free parallel
and concurrent garbage collection by mark&sweep,” Sci.
Comput. Program., vol. 64, no. 3, pp. 341–374, 2007.
[38] R. Colvin, S. Doherty, and L. Groves, “Verifying concurrent
data structures by simulation,” ENTCS, vol. 137, pp. 93–110,
2005.
[39] L. Groves and R. Colvin, “Derivation of a scalable lock-free
stack algorithm,” Electron. Notes Theor. Comput. Sci., vol.
187, pp. 55–74, 2007.
[40] L. Groves and R. Colvin, “Trace-based derivation of a scalable
lock-free stack algorithm,” Formal Aspects of Computing
(FAC), vol. 21, no. 1–2, pp. 187–223, 2009.
[41] R. Colvin and B. Dongol, “A general technique for proving
lock-freedom,” Sci. Comput. Program., vol. 74, no. 3, pp.
143–165, 2009.
[42] V. Vafeiadis, M. Herlihy, T. Hoare, and M. Shapiro, “Proving
correctness of highly-concurrent linearisable objects,” in
PPoPP ’06: Proceedings of the eleventh ACM SIGPLAN symposium
on Principles and practice of parallel programming.
New York, NY, USA: ACM, 2006, pp. 129–136.
[43] C. Calcagno, M. J. Parkinson, and V. Vafeiadis, “Modular
safety checking for fine-grained concurrency,” in SAS, ser.
Lecture Notes in Computer Science, H. R. Nielson and
G. Filé, Eds., vol. 4634. Springer, 2007, pp. 233–248.
[44] V. Vafeiadis and M. J. Parkinson, “A marriage of
rely/guarantee and separation logic,” in CONCUR, ser. Lecture
Notes in Computer Science, L. Caires and V. T. Vasconcelos,
Eds., vol. 4703. Springer, 2007, pp. 256–271.
[45] V. Vafeiadis, “Shape-value abstraction for verifying linearizability,”
in Proceedings VMCAI 2009, ser. LNCS, vol. 5403.
Springer, 2009.
[46] A. Gotsman, B. Cook, M. Parkinson, and V. Vafeiadis, “Proving
that nonblocking algorithms don’t block,” in Principles of
Programming Languages. ACM, 2009, pp. 16–28.
[47] J. C. Reynolds, “Separation logic: A logic for shared mutable
data structures,” in LICS ’02: Proceedings of the 17th Annual
IEEE Symposium on Logic in Computer Science. Washington,
DC, USA: IEEE Computer Society, 2002, pp. 55–74.
[48] D. Distefano, P. O’Hearn, and H. Yang, “A local shape
analysis based on separation logic,” in TACAS, vol. 3920.
Springer, 2006, pp. 287–302.
[49] D. Amit, N. Rinetzky, T. W. Reps, M. Sagiv, and E. Yahav,
“Comparison under abstraction for verifying linearizability,”
in CAV, ser. Lecture Notes in Computer Science, W. Damm
and H. Hermanns, Eds., vol. 4590. Springer, 2007, pp. 477–
490.
[50] J. Berdine, T. Lev-Ami, R. Manevich, G. Ramalingam, and
M. Sagiv, “Thread quantification for concurrent shape analysis,”
in CAV’08: 20th International Conference on Computer
Aided Verification. Springer, 2008.
18
Authorized licensed use limited to: Technische Universitat Kaiserslautern. Downloaded on January 18, 2010 at 11:43 from IEEE Xplore. Restrictions apply.