An automata-based symbolic approach for verifying programs on relaxed memory models

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

Volumn 6349 LNCS, Issue , 2010, Pages 212-226

  Linden, Alexander ^a   Wolper, Pierre ^a  

^a UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

MODERN PROCESSORS; RELAXED MEMORY MODELS; TOTAL STORE ORDER; BUFFER CONTENTS; EVEN DESIGNS;

MODEL CHECKING;

FINITE AUTOMATA;

EID: 78149369679     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16164-3_16     Document Type: Conference Paper

References (17)

1. Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Computers 28(9), 690-691 (1979)
2. SPARC International, Inc., C.: The SPARC architecture manual: version 8. Prentice-Hall, Inc., Upper Saddle River (1992)
3. SPARC International, Inc., C.: The SPARC architecture manual (version 9). Prentice-Hall, Inc., Upper Saddle River (1994)
4. Owens, S., Sarkar, S., Sewell, P.: A better x86 memory model: x86-TSO. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 391-407. Springer, Heidelberg (2009)
5. Mador-Haim, S., Alur, R., Martin, M.: Plug and play components for the exploration of memory consistency models. Technical report, University of Pennsylvania (2010)
6. Burckhardt, S., Alur, R., Martin, M.M.K.: Checkfence: checking consistency of concurrent data types on relaxed memory models. In: Ferrante, J., McKinley, K.S. (eds.) Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, San Diego, California, USA, June 10-13, pp. 12-21. ACM, New York (2007)
7. Boigelot, B., Godefroid, P., Willems, B., Wolper, P.: The power of QDDs (extended abstract). In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol. 1302, pp. 172-186. Springer, Heidelberg (1997)
8. Møller, A.: Package dk.brics.automaton (2001-2009) (DFA/NFA Java implementation), http://www.brics.dk/automaton/
9. Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems. LNCS, vol. 1032. Springer, Heidelberg (1996)
10. Park, S., Dill, D.L.: An executable specification, analyzer and verifier for rmo (relaxed memory order). In: SPAA 1995: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 34-41. ACM, New York (1995)
11. Burckhardt, S., Musuvathi, M.: Effective program verification for relaxed memory models. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 107-120. Springer, Heidelberg (2008)
12. Atig, M.F., Bouajjani, A., Burckhardt, S., Musuvathi, M.: On the verification problem for weak memory models. In: Hermenegildo, M.V., Palsberg, J. (eds.) Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Madrid, Spain, January 17-23, pp. 7-18. ACM, New York (2010)
13. Intel Corporation: Intel R®64 and IA-32 Architectures Software Developer's Manual. Specification (2007), http://www.intel.com/products/ processor/manuals/index.htm.
14. Loewenstein, P., Chaudhry, S., Cypher, R., Manovit, C.: Multiprocessor memory model verification. In: AFM (Automated Formal Methods), FLOC Workshop (2006), http://fm.csl.sri.com/AFM06/, http://www.scientificcommons.org/43465152
15. Boigelot, B., Wolper, P.: Symbolic verification with periodic sets. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 55-67. Springer, Heidelberg (1994)
16. Hangal, S., et al.: TSOtool: A program for verifying memory systems using the memory consistency model. In: 31st International Symposium on Computer Architecture (ISCA 2004), Munich, Germany, June 19-23, pp. 114-123. IEEE Computer Society, Los Alamitos (2004)
17. Yang, Y., Gopalakrishnan, G., Lindstrom, G., Slind, K.: Analyzing the intel itanium memory ordering rules using logic programming and sat. In: Geist, D., Tronci, E. (eds.) CHARME 2003. LNCS, vol. 2860, pp. 81-95. Springer, Heidelberg (2003)