{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:10:44Z","timestamp":1754482244835,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540008989"},{"type":"electronic","value":"9783540365778"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36577-x_36","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:12:04Z","timestamp":1269897124000},"page":"489-504","source":"Crossref","is-referenced-by-count":17,"title":["Optimistic Synchronization-Based State-Space Reduction"],"prefix":"10.1007","author":[{"given":"Scott D.","family":"Stoller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ernie","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"issue":"11","key":"36_CR1","first-page":"56","volume":"36","author":"C. Boyapati","year":"2001","unstructured":"C. Boyapati and M. C. Rinard. A parameterized type system for racefree Java programs. In Proc. 16th ACM Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA), volume 36(11) of SIGPLAN Notices, pages 56\u201369. ACM Press, November 2001.","journal-title":"A parameterized type system for racefree Java programs"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"G. Brat, K. Havelund, S. Park, and W. Visser. Model checking programs. In IEEE Int\u2019l. Conference on Automated Software Engineering (ASE), pages 3\u201312, September 2000.","DOI":"10.1109\/ASE.2000.873645"},{"key":"36_CR3","unstructured":"Edmund M. Clarke, Jr., Orna Grumberg, and Doron A. Peled. Model Checking. MIT Press, 1999."},{"key":"36_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BFb0055631","volume-title":"Reduction in TLA","author":"E. Cohen","year":"1998","unstructured":"E. Cohen and L. Lamport. Reduction in TLA. In Proc. 9th Int\u2019l. Conference on Concurrency Theory (CONCUR), volume 1466 of Lecture Notes in Computer Science, pages 317\u2013331. Springer-Verlag, 1998."},{"key":"36_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Separation and reduction","author":"E. Cohen","year":"2000","unstructured":"E. Cohen. Separation and reduction. In Proc. 5th Int\u2019l. Conference on Mathematics of Program Construction, volume 1837 of Lecture Notes in Computer Science. Springer-Verlag, 2000."},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Cormac Flanagan and Stephen Freund. Detecting race conditions in large programs. In Workshop on Program Analysis for Software Tools and Engineering (PASTE), pages 90\u201396. ACM Press, June 2001.","DOI":"10.1145\/379605.379687"},{"key":"36_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/3-540-45657-0_14","volume-title":"A modular checker for multithreaded programs","author":"C. Flanagan","year":"2002","unstructured":"Cormac Flanagan, Shaz Qadeer, and Sanjit Seshia. A modular checker for multithreaded programs. In Proc. 14th Int\u2019l. Conference on Computer-Aided Verification (CAV), volume 2404 of Lecture Notes in Computer Science, pages 180\u2013194. Springer-Verlag, 2002."},{"key":"36_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60761-7","volume-title":"Partial-Order Methods for the Verification of Concurrent Systems","author":"P. Godefroid","year":"1996","unstructured":"Patrice Godefroid. Partial-Order Methods for the Verification of Concurrent Systems, volume 1032 of Lecture Notes in Computer Science. Springer-Verlag, 1996."},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Patrice Godefroid. Model checking for programming languages using VeriSoft. In Proc. 24th ACM Symposium on Principles of Programming Languages (POPL), pages 174\u2013186. ACM Press, 1997.","DOI":"10.1145\/263699.263717"},{"issue":"5","key":"36_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"G. J. Holzmann","year":"1997","unstructured":"Gerard J. Holzmann. The Spin model checker. IEEE Transactions on Software Engineering, 23(5):279\u2013295, May 1997.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"2","key":"36_CR11","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110(2):366\u2013390, 1994.","journal-title":"Information and Computation"},{"issue":"12","key":"36_CR12","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1145\/361227.361234","volume":"18","author":"R. J. Lipton","year":"1975","unstructured":"R. J. Lipton. Reduction: A method of proving properties of parallel programs. Communications of the ACM, 18(12):717\u2013721, 1975.","journal-title":"Communications of the ACM"},{"issue":"4","key":"36_CR13","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1145\/265924.265927","volume":"15","author":"S. Savage","year":"1997","unstructured":"S. Savage, M. Burrows, G. Nelson, P. Sobalvarro, and T. E. Anderson. Eraser: A dynamic data race detector for multi-threaded programs. ACM Transactions on Computer Systems, 15(4):391\u2013411, November 1997.","journal-title":"ACM Transactions on Computer Systems"},{"key":"36_CR14","unstructured":"S. D. Stoller and E. Cohen. Optimistic synchronization-based state-space reduction. Technical Report DAR-02-8, SUNY at Stony Brook, Computer Science Dept., August 2002. Available at http:\/\/www.cs.sunysb.edu\/~stoller\/optimistic.html ."},{"key":"36_CR15","unstructured":"S. D. Stoller. Model-checking multi-threaded distributed Java programs. International Journal on Software Tools for Technology Transfer, to appear."},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"Antti Valmari. Stubborn set methods for process algebras. In D. Peled, V. R. Pratt, and G. J. Holzmann, editors, Proc. Workshop on Partial Order Methods in Verification, volume 29 of DIMACS Series, pages 213\u2013231. American Mathematical Society, 1997.","DOI":"10.1090\/dimacs\/029\/12"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"J. Whaley and M. C. Rinard. Compositional pointer and escape analysis for Java programs. In Proc. ACM Conf. on Object-Oriented Systems, Languages and Applications (OOPSLA), pages 187\u2013206. ACM Press, October 1999.","DOI":"10.1145\/320384.320400"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36577-X_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T19:12:35Z","timestamp":1739992355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36577-X_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008989","9783540365778"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36577-x_36","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}