Nemos: A framework for axiomatic and executable specifications of memory consistency models

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 433-441

  Yang, Yue ^a   Gopalakrishnan, Ganesh ^a   Lindstrom, Gary ^a   Slind, Konrad ^a  

^a University of Utah   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MEMORY MODELS; MULTIPROCESSOR PROGRAMS; REMOTE MEMORY ACCESS (RMA); SEQUENTIAL CONSISTENCY (SC);

ALGORITHMS; BOOLEAN ALGEBRA; DATA ACQUISITION; INTERCONNECTION NETWORKS; LOGIC PROGRAMMING; MATHEMATICAL MODELS; PROGRAM COMPILERS; RANDOM ACCESS STORAGE; SEMANTICS; SYNCHRONIZATION;

STORAGE ALLOCATION (COMPUTER);

EID: 12444330392     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. Leslie Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9):690-691, 1979.
2. S. V. Adve and K. Gharachorloo. Shared memory consistency models: A tutorial. IEEE Computer, 29(12):66-76, 1996.
3. Kourosh Gharachorloo. Memory consistency models for shared-memory multiprocessors. Technical report, CSL-TR-95-685.
4. R. J. Lipton and J. S. Sandberg. PRAM: A scalable shared memory. Technical Report CS-TR-180-88, 1988.
5. Mustaque Ahamad, Gil Neigher, James Burns, Prince Kohli, and Philip Hutto. Causal memory: Definitions, implementation and programming. Technical report, GIT-CC-93/55, Georgia Institute of Technology, July 1994.
6. Mustaque Ahamad, Rida Bazzi, Ranjit John, Prince Kohli, and Gil Neiger. The power of processor consistency. In 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 93), 1993.
7. Kourosh Gharachorloo, Daniel Lenoski, James Laudon, Phillip B. Gibbons, Anoop Gupta, and John L. Hennessy. Memory consistency and event ordering in scalable shared-memory multiprocessors. In 25 Years ISCA: Retrospectives and Reprints, pages 376-387, 1998.
8. Brian N. Bershad and Matthew J. Zekauskas. Midway: Shared memory parallel programming with entry consistency for distributed memory multiprocessors. Technical Report CMU-CS-91-170, Pittsburgh, PA (USA), 1991.
9. Guang Gao and Vivek Sarkar. Location consistency - a new memory model and cache consistency protocol. Technical report, 16, CAPSL, University of Delaware, 1998.
10. G. L. Peterson. Myths about the mutual exclusion problem. In Information Processing Letters, volume 12, June 1981.
11. A formal specification of Intel Itanium processor family memory ordering. Application Note, Document Number: 251429-001, October, 2002.
12. J. Jaffar and J-L. Lassez. Constraint logic programming. In Principles Of Programming Languages, Munich, Germany, January 1987.
13. Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, and Konrad Slind. Analyzing the Intel Itanium memory ordering rules using logic programming and SAT. In the 12th Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME'03), LNCS 2860, October 2003.
14. Sicstus prolog. http://www.sics.se/sicstus.
15. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient sat solver. In 39th Design Automation Conference, Las Vegas, June 2001.
16. E. Goldberg and Y. Novikov. Berkmin: a fast and robust satsolver. In Design, Automation and Test in Europe Conference and Exhibition, Paris, France, 2002.
17. William W. Collier. Reasoning about Parallel Architectures. Prentice-Hall, 1992.
18. S. V. Adve and M. D. Hill. A unified formalization of four shared-memory models. IEEE Trans. on Parallel and Distributed Systems, 4(6):613-624, 1993.
19. David Mosberger. Memory consistency models. Operating Systems Review, 27(l):18-26, 1993.
20. Prince Kohli, Git Neiger, and Mustaque Ahamad. A characterization of scalable shared memories. In Proceedings of the 1993 International Conference on Parallel Processing, volume I - Architecture, pages I-332-I-335, Boca Raton, FL, 1993. CRC Press.
21. M. Raynal and A. Schiper. A suite of formal definitions for consistency criteria in distributed shared memories. In Proceedings Int Conf on Parallel and Distributed Computing (PDCS'96), pages 125-130, Dijon, France, 1996.
22. Jos M. Bernabu-Aubn and Vicente Cholvi-Juan. Formalizing memory coherency models. Journal of Computing and Information, May 1994.
23. Lisa Higham, Jalal Kawash, and Nathaly Verwaal. Defining and comparing memory consistency models. In Proceedings of the International Conference on Parallel and Distributed Computing Systems (PDCS), pages 349-356, 1997.
24. Alba Cristina Magalhes and Alves de Melo. Defining uniform and hybrid memory consistency models on a unified framework.
25. Alba Cristina Melo and Simone Cintra Chagas. Visual-MCM: Visualising execution histories on multiple memory consistency models. Lecture Notes in Computer Science, 1557:500-509, 1999.
26. Tla+. http://research.microsoft.com/users/lamport/tla/tla.html.
27. Rajeev Joshi, Leslie Lamport, John Matthews, Serdar Tasiran, Mark Tuttle, and Yuan Yu. Checking cache-coherence protocols with tla+. In Formal Methods in System Design, number 2, pages 125-131, March 2003.
28. Seungjoon Park and David L. Dill. An executable specification and verifier for Relaxed Memory Order. IEEE Transactions on Computers, 48(2):227-235, 1999.
29. Yue Yang, Ganesh Gopalakrishnan, and Gary Lindstrom. Analyzing the CRF Java Memory Model. In the 8th Asia-Pacific Software Engineering Conference, 2001.
30. Abhik Roychoudhury and Tulika Mitra. Specifying multithreaded Java semantics for program verification. In International Conference on Software Engineering, 2002.
31. Yue Yang, Ganesh Gopalakrishnan, and Gary Lindstrom. Specifying Java thread semantics using a uniform memory model. In Joint ACM Java Grande - ISCOPE Conference, 2002.
32. Yue Yang, Ganesh Gopalakrishnan, and Gary Lindstrom. UMM: An operational memory model specification framework with integrated model checking capability. Concurrency and Computation: Practice and Experience, to appear.
33. M. J. C. Gordon and T. F. Melham. Introduction to HOL: A theorem mproving environment for higher order logic. Cambridge University Press, 1993.