{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:53:02Z","timestamp":1725569582392},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642166891"},{"type":"electronic","value":"9783642166907"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16690-7_14","type":"book-chapter","created":{"date-parts":[[2010,11,8]],"date-time":"2010-11-08T05:06:32Z","timestamp":1289192792000},"page":"271-285","source":"Crossref","is-referenced-by-count":1,"title":["Towards a Pomset Semantics for a Shared-Variable Parallel Language"],"prefix":"10.1007","author":[{"given":"Yongxin","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Xu","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Huibiao","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(93)90151-I","volume":"114","author":"M. Abadi","year":"1993","unstructured":"Abadi, M., Plotkin, G.: A Logical View of Composition. Theoretical Computer Science\u00a0114, 1 (1993)","journal-title":"Theoretical Computer Science"},{"key":"14_CR2","unstructured":"Gischer, J.: Partial Orders and the Axiomatic Theory of shuffle, Ph.D. Thesis, Computer Science Dept., Stanford University (December 1984)"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V.R. Pratt","year":"1986","unstructured":"Pratt, V.R.: Modeling concurrency with partial orders. Int. J. of Parallel Programming\u00a015(1), 33\u201371 (1986)","journal-title":"Int. J. of Parallel Programming"},{"key":"14_CR4","unstructured":"Adve, S.V.: Designing Memory Consistency Models for Shared-Memory Multiprocessors. PhD thesis, Computer Sciences Department, University of Wisconsin-Madison (December 1993), Available as Technical Report #1198"},{"key":"14_CR5","volume-title":"Proc., 8th Annual IEEE Symposium on Logic in Computer Science","author":"S. Brookes","year":"1993","unstructured":"Brookes, S.: Full abstraction for a shared variable parallel language. In: Proc., 8th Annual IEEE Symposium on Logic in Computer Science. IEEE Comput. Soc. Press, Los Alamitos (1993)"},{"issue":"2","key":"14_CR6","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1006\/inco.1996.0056","volume":"127","author":"S.D. Brookes","year":"1996","unstructured":"Brookes, S.D.: Full Abstraction for a Shared-Variable Parallel Language. Inf. Comput.\u00a0127(2), 145\u2013163 (1996)","journal-title":"Inf. Comput."},{"issue":"12","key":"14_CR7","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. IEEE Computer\u00a029(12), 66\u201376 (1996)","journal-title":"IEEE Computer"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/3-540-45694-5_31","volume-title":"CONCUR 2002 - Concurrency Theory","author":"S.D. Brookes","year":"2002","unstructured":"Brookes, S.D.: Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 466\u2013482. Springer, Heidelberg (2002)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Separation Logic: A Logic for Shared Mutable Data Structures. In: LICS 2002, pp. 55\u201374 (2002)","DOI":"10.1109\/LICS.2002.1029817"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-28644-8_2","volume-title":"CONCUR 2004 - Concurrency Theory","author":"S.D. Brookes","year":"2004","unstructured":"Brookes, S.D.: A Semantics for Concurrent Separation Logic. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 16\u201334. Springer, Heidelberg (2004)"},{"issue":"1-3","key":"14_CR11","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.tcs.2006.12.035","volume":"375","author":"P.W. O\u2019Hearn","year":"2007","unstructured":"O\u2019Hearn, P.W.: Resources, concurrency, and local reasoning. Theor. Comput. Sci.\u00a0375(1-3), 271\u2013307 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0304-3975(00)00336-4","volume":"278","author":"P. Gastin","year":"2002","unstructured":"Gastin, P., Teodosiu, D.: Resource traces: a domain for processes sharing exclusive resources. Theor. Comput. Sci.\u00a0278(1-2), 195\u2013221 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","first-page":"279","volume-title":"Advances in Petri Nets 1986. Proceedings of an Advanced Course, Bad Honnef, 8.-19. September 1986","author":"A. Mazurkiewicz","year":"1987","unstructured":"Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol.\u00a0255, pp. 279\u2013324. Springer, Heidelberg (1987)"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0304-3975(92)90054-J","volume":"101","author":"S. Katz","year":"1992","unstructured":"Katz, S., Peled, D.: Defining conditional independence using collapses. Theoretical Computer Science\u00a0101, 337\u2013359 (1992); a preliminary version appeared in BCS-FACS Workshop on Semantics for Concurrency, Leicester, England, pp. 262\u2013280. Springer, Heidelberg (July 1990)","journal-title":"Theoretical Computer Science"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Godefroid, P.: Dynamic Partial-Order Reduction for Model Checking Software. In: Proceedings of POPL 2005 (32nd ACM symposium on Principles of Programming Languages), Long beach (January 2005)","DOI":"10.1145\/1040305.1040315"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/11901433_9","volume-title":"Formal Methods and Software Engineering","author":"X. Yi","year":"2006","unstructured":"Yi, X., Wang, J., Yang, X.: Stateful dynamic partial-order reduction. In: Liu, Z., He, J. (eds.) ICFEM 2006. LNCS, vol.\u00a04260, pp. 149\u2013167. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Unifying Theories of Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16690-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T03:43:53Z","timestamp":1553226233000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16690-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642166891","9783642166907"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16690-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}