Nitpicking C++ concurrency

PPDP'11 - Proceedings of the 2011 Symposium on Principles and Practices of Declarative Programming

Volumn , Issue , 2011, Pages 113-123

  Blanchette, Jasmin Christian ^a   Weber, Tjark ^b   Batty, Mark ^b   Owens, Scott ^b   Sarkar, Susmit ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

C++ memory model; Concurrency; Higher order logic; Isabelle HOL; Kodkod; Model finding; Nitpick; SAT solving

Indexed keywords

CONCURRENCY; HIGHER ORDER LOGIC; ISABELLE/HOL; KODKOD; MEMORY MODELS; MODEL FINDING; NITPICK; SAT-SOLVING;

COMPUTER PROGRAMMING LANGUAGES; SEMANTICS;

MODEL CHECKING;

EID: 80052137438     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2003476.2003493     Document Type: Conference Paper

References (33)

1. Programming languages-C++. Technical Report N3290, ISO IEC JTC1/SC22/WG21, 2011. http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/ n3290.pdf.
2. P. B. Andrews. An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof (2nd Ed.), volume 27 of Applied Logic. Springer, 2002.
3. M. Batty, S. Owens, S. Sarkar, P. Sewell, and T. Weber. Mathematizing C++ concurrency: The post-Rapperswil model. Technical Report N3132, ISO IEC JTC1/SC22/WG21, 2010. http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/ n3132.pdf.
4. M. Batty, S. Owens, S. Sarkar, P. Sewell, and T. Weber. Mathematizing C++ concurrency. In T. Ball and M. Sagiv, editors, POPL 2011, pages 55-66. ACM, 2011.
5. J. C. Blanchette. Relational analysis of (co)inductive predicates, (co)inductive datatypes, and (co)recursive functions. Softw. Qual. J. To appear.
6. J. C. Blanchette and T. Nipkow. Nitpick: A counterexample generator for higher-order logic based on a relational model finder. In M. Kaufmann and L. Paulson, editors, ITP 2010, volume 6172 of LNCS, pages 131-146. Springer, 2010.
7. P. Cenciarelli, A. Knapp, and E. Sibilio. The Java memory model: Operationally, denotationally, axiomatically. In R. de Nicola, editor, ESOP 2007, volume 4421 of LNCS, pages 331-346. Springer, 2007. (Pubitemid 350259501)
8. A. Church. A formulation of the simple theory of types. J. Symb. Log., 5:56-68, 1940.
9. W.-P. de Roever, F. de Boer, U. Hannemann, J. Hooman, Y. Lakhnech, M. Poel, and J. Zwiers. Concurrency Verification: Introduction to Compositional and Noncompositional Methods, volume 54 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2001.
10. N. Eén and N. Sörensson. An extensible SAT-solver. In E. Giunchiglia and A. Tacchella, editors, SAT 2003, volume 2919 of LNCS, pages 502-518. Springer, 2004.
11. M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.
12. M. J. C. Gordon, R. Milner, and C. P. Wadsworth. Edinburgh LCF: A Mechanised Logic of Computation, volume 78 of LNCS. Springer, 1979.
13. D. Jackson. Software Abstractions: Logic, Language, and Analysis. MIT Press, 2006.
14. J. Jürjens and T. Weber. Finite models in FOL-based crypto-protocol verification. In P. Degano and L. Viganò, editors, ARSPA-WITS 2009, volume 5511 of LNCS, pages 155-172. Springer, 2009.
15. K. Kim, T. Yavuz-Kahveci, and B. A. Sanders. Precise data race detection in a relaxed memory model using heuristic-based model checking. In ASE 2009, pages 495-499. IEEE, 2009.
16. V. Kuncak and D. Jackson. Relational analysis of algebraic datatypes. In H. C. Gall, editor, ESEC/FSE 2005. ACM, 2005.
17. C. Lameter. Effective synchronization on Linux/NUMA systems. Presented at the Gelato Conference 2005.
18. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput., 28(9):690-691, 1979. (Pubitemid 10420526)
19. A. Lochbihler. Verifying a compiler for Java threads. In A. D. Gordon, editor, ESOP 2010, volume 6012 of LNCS, pages 427-447. Springer, 2010.
20. J. Manson and W. Pugh. The Java memory model simulator. In Formal Techniques for Java-like Programs (FTfJP) 2002.
21. A. McIver and T. Weber. Towards automated proof support for probabilistic distributed systems. In G. Sutcliffe and A. Voronkov, editors, LPAR 2005, number 3835 in LNAI, pages 534-548. Springer, 2005. (Pubitemid 43955337)
22. A. C. Melo and S. C. Chagas. Visual-MCM: Visualising execution histories on multiple memory consistency models. In P. Zinterhof, M. Vajtersic, and A. Uhl, editors, ACPC 1999, volume 1557 of LNCS, pages 500-509. Springer, 1999.
23. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL: A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer, 2002.
24. S. Owens, P. Böhm, F. Zappa Nardelli, and P. Sewell. Lightweight tools for heavyweight semantics. In ITP 2011. Springer. To appear.
25. W. Pugh. The Java memory model is fatally flawed. Concurrency-Practice and Experience, 12(6):445-455, 2000.
26. S. Sarkar, P. Sewell, F. Zappa Nardelli, S. Owens, T. Ridge, T. Braibant, M. O. Myreen, and J. Alglave. The semantics of x86-CC multiprocessor machine code. In Z. Shao and B. C. Pierce, editors, POPL 2009, pages 379-391. ACM, 2009.
27. J. Sevcík and D. Aspinall. on validity of program transformations in the Java memory model. In J. Vitek, editor, ECOOP 2008, volume 5142 of LNCS, pages 27-51. Springer, 2008.
28. E. Torlak and D. Jackson. Kodkod: A relational model finder. In O. Grumberg and M. Huth, editors, TACAS 2007, volume 4424 of LNCS, pages 632-647. Springer, 2007. (Pubitemid 350259325)
29. E. Torlak, M. Vaziri, and J. Dolby. MemSAT: Checking axiomatic specifications of memory models. In B. G. Zorn and A. Aiken, editors, PLDI 2010, pages 341-350. ACM, 2010.
30. W. Visser, K. Havelund, G. Brat, S. Park, and F. Lerda. Model checking programs. Autom. Softw. Eng. J., 10(2):203-232, 2003.
31. T. Weber. A SAT-based Sudoku solver. In G. Sutcliffe and A. Voronkov, editors, LPAR 2005 (Short Papers), pages 11-15, 2005.
32. T. Weber. SAT-Based Finite Model Generation for Higher-Order Logic. Ph.D. thesis, Dept. of Informatics, T.U. München, 2008.
33. Y. Yang, G. Gopalakrishnan, G. Lindstrom, and K. Slind. Nemos: A framework for axiomatic and executable specifications of memory consistency models. In IPDPS 2004. IEEE, 2004.