{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:19Z","timestamp":1725663859167},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571827"},{"type":"electronic","value":"9783540479277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57182-5_51","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:11:04Z","timestamp":1330258264000},"page":"598-607","source":"Crossref","is-referenced-by-count":1,"title":["Ignoring nonessential interleavings in assertional reasoning on concurrent programs"],"prefix":"10.1007","author":[{"given":"Pawel","family":"Paczkowski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"51_CR1","first-page":"250","volume":"267","author":"I. J. Aalbersberg","year":"1987","unstructured":"I.J. Aalbersberg, H.J. Hoogeboom, Decision problems for regular trace languages, in: Proceedings ICALP 87, pp. 250\u2013259, LNCS 267, 1987.","journal-title":"LNCS"},{"key":"51_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(88)90051-5","volume":"60","author":"I. J. Aalbersberg","year":"1988","unstructured":"I.J. Aalbersberg, G. Rozenberg, Theory of traces, Theoretical Computer Science 60, pp. 1\u201382 (1988).","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"51_CR3","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1145\/357103.357110","volume":"2","author":"K. R. Apt","year":"1980","unstructured":"K.R. Apt, N. Francez, W.P. de Roever, A proof system for communicating sequential processes, ACM TOPLAS 2(3), pp. 359\u2013384 (1980).","journal-title":"ACM TOPLAS"},{"key":"51_CR4","first-page":"61","volume":"140","author":"A. Bertoni","year":"1982","unstructured":"A. Bertoni, G. Mauri, N. Sabadini, Equivalence and membership problems for regular trace languages, in: LNCS 140, pp. 61\u201371, 1982.","journal-title":"LNCS"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"E.W. Dijkstra, A correctness proof for communicating processes \u2014 A small exercise, in: Selected writings on Computing: A Personal Perspective. Springer-Verlag, 1982.","DOI":"10.1007\/978-1-4612-5695-3_47"},{"key":"51_CR6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","volume-title":"Mathematical Aspects of Computer Science","author":"R. W. Floyd","year":"1967","unstructured":"R. W. Floyd, Assigning meanings to programs, in: Mathematical Aspects of Computer Science. (J.T. Schwartz, Ed.), pp. 19\u201332, Proceedings Symposium in Applied Mathematics, vol. 19, American Math. Soc., Providence, 1967."},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"P. Godefroid, Using partial orders to improve automatic verification methods, in: Proc. Workshop on Computer Aided Verification, Rutgers, 1990.","DOI":"10.1090\/dimacs\/003\/21"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"P. Godefroid, P. Wolper, A partial approach to model checking in: Proceedings of the 6th LICS, pp. 406\u2013415, 1991.","DOI":"10.1109\/LICS.1991.151664"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"P. Godefroid, P. Wolper, Using partial orders for the efficient verification of deadlock freedom and safety properties, in: Proc. Workshop on Computer Aided Verification, 1991.","DOI":"10.1007\/3-540-55179-4_32"},{"key":"51_CR10","first-page":"279","volume":"255","author":"A. Mazurkiewicz","year":"1987","unstructured":"A. Mazurkiewicz, Trace semantics, in: Advances in Petri Nets 1986, Part II, pp. 279\u2013324, LNCS 255, 1987.","journal-title":"LNCS"},{"key":"51_CR11","first-page":"416","volume":"458","author":"P. P\u0105czkowski","year":"1990","unstructured":"P. P\u0105czkowski, Proving termination of communicating programs, in: Proceedings CONCUR'90, pp. 416\u2013426, LNCS 458, 1990.","journal-title":"LNCS"},{"key":"51_CR12","unstructured":"P. P\u0105czkowski, Annotated Transition Systems for Verifying Concurrent Programs, PhD Thesis, CST-78\u201391 University of Edinburgh, 1991."},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"P. P\u0105czkowski, Ignoring Nonessential Interleavings in Assertional Reasoning on Concurrent Programs, Preprint No. 90, Institute of Mathematics, University of Gda\u0144sk, 1993.","DOI":"10.1007\/3-540-57182-5_51"},{"key":"51_CR14","doi-asserted-by":"crossref","unstructured":"A. Valmari, M. Clegg, Reduced labelled transition systems save verification effort, in: Proceedings of CONCUR'91, 1991.","DOI":"10.1007\/3-540-54430-5_111"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1993"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57182-5_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:45Z","timestamp":1605647325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57182-5_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571827","9783540479277"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-57182-5_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}