Operational reasoning for concurrent Caml programs and weak memory models

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

Volumn 4732 LNCS, Issue , 2007, Pages 278-293

  Ridge, Tom ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; MATHEMATICAL MODELS; SEMANTICS; SPECIFICATIONS;

OPERATIONAL REASONING; WEAK MEMORY MODELS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 38049048618     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74591-4_21     Document Type: Conference Paper

References (18)

1. Burckhardt, S., Alur, R., Martin, M.M.K.: Bounded model checking of concurrent data types on relaxed memory models: A case study. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 489-502. Springer, Heidelberg (2006)
2. Compton, M.: Stenning's protocol implemented in UDP and verified in Isabelle. In: Atkinson, M.D., Dehne, F.K.H.A. (eds.) CATS. CRPIT, vol. 41, pp. 21-30. Australian Computer Society (2005)
3. Gonthier, G.: A computer-checked proof of the Four Colour Theorem (2005), http://research.microsoft.com/~gonthier/4colproof.pdf
4. Gopalakrishnan, G., Yang, Y., Sivaraj, H.: An efficient execution verification tool for memory orderings. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 401-413. Springer, Heidelberg (2004)
5. Holzmann, G.J., Bosnacki, D.: The design of a multi-core extension of the Spin Model Checker. In: FMCAD. Formal Methods in Computer Aided Design (November 2006)
6. Homeier, P.V., Martin, D.F.: A mechanically verified verification condition generator. Comput. J. 38(2), 131-141 (1995)
7. Hoare, C.A.R.: An axiomatic basis for computer programming. Communications of the ACM, 12 (1969)
8. Jones, C.B.: Development methods for computer programs including a notion of interference. Technical Report PRG-25, Programming Research Group, Oxford University Computing Laboratory (1981)
9. Kawash, J.Y.: Limitations and capabilities of weak memory consistency systems. PhD thesis, Computer Science, University of Calgary (2000)
10. Liu, H., Moore, J.S.: Java program verification via a JVM deep embedding in ACL2. In: Slind, K., Bunker, A., Gopalakrishnan, G.C. (eds.) TPHOLs 2004. LNCS, vol. 3223, pp. 184-200. Springer, Heidelberg (2004)
11. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)
12. Morris, F.L., Jones, C.B.: An early program proof by Alan Turing. Annals of the History of Computing 6(2), 143-193 (1984)
13. Midkiff, S.P., Lee, J., Padua, D.A.: A compiler for multiple memory models. Concurrency and Computation: Practice and Experience 16(2-3), 197-220 (2004)
14. Mehta, F., Nipkow, T.: Proving pointer programs in higher-order logic. Information and Computation 199, 200-227 (2005)
15. Peterson, G.L.: Myths about the mutual exclusion problem. Information Processing Letters 12(3), 115-116 (1981)
16. Ridge, T.: Simpson's four slot algorithm in Isabelle/HOL, available online, at http://www.cl.cam.ac.uk/~tjr22
17. Ridge, T., Margetson, J.: A mechanically verified, sound and complete theorem prover for FOL. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol. 3603, Springer, Heidelberg (2005)
18. Sewell, P., Nardelli, F.Z., Owens, S., Peskine, G., Ridge, T., Sarkar, S., Strniša, R.: Ott: Effective tool support for the working semanticist. In: ICFP 2007. The 12th ACM SIGPLAN International Conference on Functional Programming (accepted, 2007)