{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T11:15:30Z","timestamp":1761822930050},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540374060"},{"type":"electronic","value":"9783540374114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11817963_46","type":"book-chapter","created":{"date-parts":[[2006,8,5]],"date-time":"2006-08-05T05:07:51Z","timestamp":1154754471000},"page":"503-516","source":"Crossref","is-referenced-by-count":31,"title":["Fast and Generalized Polynomial Time Memory Consistency Verification"],"prefix":"10.1007","author":[{"given":"Amitabha","family":"Roy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Zeisset","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles J.","family":"Fleckenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John C.","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1109\/ISCA.2004.1310768","volume-title":"ISCA 2004: Proceedings of the 31st annual international symposium on Computer architecture","author":"S. Hangal","year":"2004","unstructured":"Hangal, S., Vahia, D., Manovit, C., Lu, J.-Y.J.: Tsotool: A program for verifying memory systems using the memory consistency model. In: ISCA 2004: Proceedings of the 31st annual international symposium on Computer architecture, Washington, DC, USA, p. 114. IEEE Computer Society, Los Alamitos (2004)"},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"Gibbons, P.B., Korach, E.: The complexity of sequential consistency. In: SPDP: Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, pp. 317\u2013325 (1992)","DOI":"10.1109\/SPDP.1992.242728"},{"key":"46_CR3","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1145\/777412.777457","volume-title":"SPAA 2003: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures","author":"J.F. Cantin","year":"2003","unstructured":"Cantin, J.F., Lipasti, M.H., Smith, J.E.: The complexity of verifying memory coherence. In: SPAA 2003: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, pp. 254\u2013255. ACM Press, New York (2003)"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Cantin, J.F., Lipasti, M.H., Smith, J.E.: The Complexity of Verifying Memory Coherence. In: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures (SPAA), San Diego, pp. 254\u2013255 (2003)","DOI":"10.1145\/777412.777457"},{"key":"46_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/1073970.1074011","volume-title":"SPAA 2005: Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures","author":"C. Manovit","year":"2005","unstructured":"Manovit, C., Hangal, S.: Efficient algorithms for verifying memory consistency. In: SPAA 2005: Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures, pp. 245\u2013252. ACM Press, New York (2005)"},{"issue":"12","key":"46_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/2.546611","volume":"29","author":"S.V. Adve","year":"1996","unstructured":"Adve, S.V., Gharachorloo, K.: Shared memory consistency models: A tutorial. Computer\u00a029(12), 66\u201376 (1996)","journal-title":"Computer"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Gharachorloo, K., Lenoski, D., Laudon, J., Gibbons, P.B., Gupta, A., Hennessy, J.L.: Memory consistency and event ordering in scalable shared-memory multiprocessors. In: 25 Years ISCA: Retrospectives and Reprints, pp. 376\u2013387 (1998)","DOI":"10.1145\/285930.285997"},{"key":"46_CR8","unstructured":"IA-32 Intel Architecture Software Developer\u2019s Manual, vol. 3: System Programming Guide. Intel Corporation (2005), http:\/\/www.intel.com\/design\/pentium4\/manuals\/index_new.htm"},{"key":"46_CR9","unstructured":"Intel Itanium Architecture, vol. 1: Application Architecture. Intel Corporation (2005), http:\/\/www.intel.com\/design\/itanium\/manuals\/iiasdmanual.htm"},{"key":"46_CR10","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/PACT.2003.1237997","volume-title":"PACT 2003: Proceedings of the 12th International Conference on Parallel Architectures and Compilation Techniques","author":"H.W. Cain","year":"2003","unstructured":"Cain, H.W., Lipasti, M.H., Nair, R.: Constraint graph analysis of multithreaded programs. In: PACT 2003: Proceedings of the 12th International Conference on Parallel Architectures and Compilation Techniques, Washington, DC, USA, p. 4. IEEE Computer Society, Los Alamitos (2003)"},{"key":"46_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-27813-9_31","volume-title":"Computer Aided Verification","author":"G. Gopalakrishnan","year":"2004","unstructured":"Gopalakrishnan, G., Yang, Y., Sivaraj, H.: Qb or not qb: An efficient execution verification tool for memory orderings. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 401\u2013413. Springer, Heidelberg (2004)"},{"key":"46_CR12","unstructured":"A Formal Specification of Intel Itanium Processor Family Memory Ordering. Intel Corporation (2005), http:\/\/www.intel.com\/design\/itanium\/downloads\/251429.htm"},{"issue":"1","key":"46_CR13","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"Warshall, S.: A theorem on boolean matrices. J. ACM\u00a09(1), 11\u201312 (1962)","journal-title":"J. ACM"},{"key":"46_CR14","unstructured":"Fleckenstein, C.J., Huang, J.C., Roy, A., Zeisset, S.: Fast and Generalized Polynomial Time Memory Consistency Verification. Technical Report arXiv:cs.AR\/0605039 (May 2006)"},{"key":"46_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5676-0","volume-title":"Loop Parallelization","author":"U.K. Banerjee","year":"1994","unstructured":"Banerjee, U.K.: Loop Parallelization. Kluwer Academic, Norwell (1994)"},{"key":"46_CR16","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/378239.378473","volume-title":"DAC 2001: Proceedings of the 38th conference on Design automation","author":"B. Bentley","year":"2001","unstructured":"Bentley, B.: Validating the intel pentium 4 microprocessor. In: DAC 2001: Proceedings of the 38th conference on Design automation, pp. 244\u2013248. ACM Press, New York (2001)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11817963_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:16:01Z","timestamp":1605644161000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11817963_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540374060","9783540374114"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11817963_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}