Analyzing the Intel Itanium memory ordering rules using logic programming and SAT

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

Volumn 2860, Issue , 2003, Pages 81-95

  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

COMPUTER AIDED ANALYSIS; COMPUTER PROGRAMMING LANGUAGES; DESIGN; FORMAL LOGIC; PROGRAM PROCESSORS; SEMANTICS;

BOOLEAN SATISFIABILITY; CONSTRAINT LOGIC PROGRAMMING LANGUAGES; CONSTRAINT SOLVING; HIGHER ORDER LOGIC; MEMORY MODELING; MEMORY ORDERING; OPERATIONAL METHODS; ORDERING CONSTRAINTS;

LOGIC PROGRAMMING;

EID: 0142214509     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39724-3_9     Document Type: Article

References (21)

1. Intel Itanium Architecture Software Developer's Manual, http://developer.intel.com/design/itanium/manuals.htm
2. A Formal Specification of Intel Itanium Processor Family Memory Ordering, Application Note, Document Number: 251429-001 (October, 2002)
3. K. Gharachorloo: Memory consistency models for shared-memory multiprocessors. Technical Report CSL-TR-95-685, Stanford University (December 1995)
4. D. Dill, S. Park, A. Nowatzyk: Formal Specification of Abstract Memory Models. Research on Integrated Systems: Proceedings of the 1993 Symposium
5. Prosenjit Chatterjee, Ganesh Gopalakrishnan: Towards a Formal Model of Shared Memory Consistency for Intel Itanium. ICCD 2001, Austin,TX (Sept 2001)
6. Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom: Specifying Java Thread Semantics Using a Uniform Memory Model. Joint ACM Java Grande - ISCOPE Conference (2002)
7. The SPARC Architecture Manual, Version 9, Prentice Hall (1993)
8. Leslie Lamport: How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs. IEEE Transactions on Computers, 28(9): 690-691 (1979)
9. M. Ahamad, G. Neiger, James Burns, Prince Kohli, Philip Hutto: Causal Memory: Definitions, Implementation and Programming. Technical Report: GIT_CC-93/95
10. Yuan Yu, through personal communication
11. Simplify, http://research.compaq.com/SRC/esc/Simplify.html
12. TLA+, http://research.microsoft.com/users/lamport/tla/tla.html
13. Rajeev Joshi, Leslie Lamport, John Matthews, Serdar Tasiran, Mark Tuttle, Yuan Yu: Checking Cache-Coherence Protocols with TLA+ Formal Methods in System Design. Formal Methods in System Design, 22(2): 125-131 (Mar 2003)
14. M. J. C. Gordon, T. F. Melham: Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press (1993)
15. R. J. Lipton, J. S. Sandberg: PRAM: A Scalable Shared Memory. CS-TR-180-88
16. Mustaque Ahamad, Rida Bazzi, Ranjit John, Prince Kohli, Gil Neiger: The Power of Processor Consistency. 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 93) (1993)
17. J. Jaffar, J-L. Lassez: Constraint Logic Programming. Principles Of Programming Languages, Munich, Germany (January 1987)
18. SICStus Prolog, http://www.sics.se/sicstus
19. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik: Chaff: Engineering an Efficient SAT Solver. 39th Design Automation Conference, Las Vegas (June 2001)
20. E. Goldberg, Y. Novikov: BerkMin: a Fast and Robust Sat-Solver. Design, Automation and Test in Europe Conference and Exhibition Paris, France (2002)
21. Sanjit A. Seshia, Shuvendu K. Lahiri, Randal E. Bryant: A Hybrid SAT-Based Decision Procedure for Separation Logic with Uninterpreted Functions. 40th Design Automation Conference (DAC), pages 425-430 (June 2003)