{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:16:02Z","timestamp":1771024562933,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319415390","type":"print"},{"value":"9783319415406","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41540-6_9","type":"book-chapter","created":{"date-parts":[[2016,7,12]],"date-time":"2016-07-12T09:34:07Z","timestamp":1468316047000},"page":"157-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Hitting Families of Schedules for Asynchronous Programs"],"prefix":"10.1007","author":[{"given":"Dmitry","family":"Chistikov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rupak","family":"Majumdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filip","family":"Niksic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,13]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470277331","volume-title":"The Probabilistic Method","author":"N Alon","year":"2008","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, 3rd edn. Wiley, New York (2008)","edition":"3"},{"key":"9_CR2","first-page":"37","volume":"95","author":"C Amb\u00fchl","year":"2008","unstructured":"Amb\u00fchl, C., Mastrolilli, M., Mutsanas, N., Svensson, O.: Precedence constraint scheduling and connections to dimension theory of partial orders. Bull. EATCS 95, 37\u201358 (2008)","journal-title":"Bull. EATCS"},{"key":"9_CR3","unstructured":"Burckhardt, S., Kothari, P., Musuvathi, M., Nagarakatte, S.: A randomized scheduler with probabilistic guarantees of finding bugs. In: Proceedings of the 15th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2010, Pittsburgh, Pennsylvania, USA, March 13\u201317, 2010, pp. 167\u2013178 (2010)"},{"key":"9_CR4","unstructured":"Chalermsook, P., Laekhanukit, B., Nanongkai, D.: Graph products revisited: Tight approximation hardness of induced matching, poset dimension and more. In: Sanjeev Khanna, editor, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6\u20138, 2013, pp. 1557\u20131576. SIAM (2013)"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"600","DOI":"10.2307\/2371374","volume":"63","author":"B Dushnik","year":"1941","unstructured":"Dushnik, B., Miller, E.W.: Partially ordered sets. Am. J. Math. 63(3), 600\u2013610 (1941)","journal-title":"Am. J. Math."},{"key":"9_CR6","unstructured":"Emmi, M., Qadeer, S., Rakamaric, Z.: Delay-bounded scheduling. In: Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, January 26\u201328, 2011, pp. 411\u2013422 (2011)"},{"key":"9_CR7","unstructured":"Fomin, F.V., Lokshtanov, D., Misra, N., Saurabh, S.: Planar $$\\cal {F}$$-deletion: Approximation, kernelization and optimal FPT algorithms. In: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20\u201323, 2012, pp. 470\u2013479. IEEE Computer Society (2012)"},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/2160910.2160915","volume":"34","author":"P Ganty","year":"2012","unstructured":"Ganty, P., Majumdar, R.: Algorithmic verification of asynchronous programs. ACM Trans. Program. Lang. Syst. 34(1), 6 (2012)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.endm.2007.07.084","volume":"29","author":"R Hegde","year":"2007","unstructured":"Hegde, R., Jain, K.: The hardness of approximating poset dimension. Electron. Notes Discrete Math. 29, 435\u2013443 (2007)","journal-title":"Electron. Notes Discrete Math."},{"key":"9_CR10","unstructured":"Jensen, C.S., M\u00f8ller, A., Raychev, V., Dimitrov, D., Vechev, M.T.: Stateless model checking of event-driven applications. In: Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2015, part of SLASH 2015, Pittsburgh, PA, USA, October 25\u201330, 2015, pp. 57\u201373 (2015)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Jhala, R., Majumdar, R.: Interprocedural analysis of asynchronous programs. In: POPL 2007: Proceedings 34th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 339\u2013350. ACM Press (2007)","DOI":"10.1145\/1190215.1190266"},{"issue":"4","key":"9_CR12","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Math. 13(4), 383\u2013390 (1975)","journal-title":"Discrete Math."},{"key":"9_CR13","unstructured":"Lu, S., Park, S., Seo, E., Zhou, Y.: Learning from mistakes: a comprehensive study on real world concurrency bug characteristics. In: Proceedings of the 13th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2008, Seattle, WA, USA, March 1\u20135, 2008, pp. 329\u2013339 (2008)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-71410-1_2","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M Musuvathi","year":"2007","unstructured":"Musuvathi, M., Qadeer, S.: CHESS: systematic stress testing of concurrent software. In: Puebla, G. (ed.) LOPSTR 2006. LNCS, vol. 4407, pp. 15\u201316. Springer, Heidelberg (2007)"},{"key":"9_CR15","unstructured":"Petrov, B., Vechev, M.T., Sridharan, M., Dolby, J.: Race detection for web applications. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2012, Beijing, China - June 11\u201316, 2012, pp. 251\u2013262 (2012)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-31980-1_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Qadeer","year":"2005","unstructured":"Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 93\u2013107. Springer, Heidelberg (2005)"},{"key":"9_CR17","unstructured":"Raychev, V., Vechev, M.T., Sridharan, M.: Effective race detection for event-driven programs. In: Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages & Applications, OOPSLA 2013, part of SPLASH 2013, Indianapolis, IN, USA, October 26\u201331, 2013, pp. 151\u2013166 (2013)"},{"key":"9_CR18","unstructured":"Sapozhenko, A.A.: On the complexity of disjunctive normal forms obtained with a gradient algorithm. In: Diskretnyj Analiz (Discrete Analysis), vol. 21, pp. 62\u201371. Institute for Mathematics in the Siberian Section of the Academy of Sciences, Novosibirsk (1972, In Russian)"},{"key":"9_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0053-6","volume-title":"Ordered Sets: An Introduction","author":"BSW Schr\u00f6der","year":"2003","unstructured":"Schr\u00f6der, B.S.W.: Ordered Sets: An Introduction. Springer, New York (2003)"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/11817963_29","volume-title":"Computer Aided Verification","author":"K Sen","year":"2006","unstructured":"Sen, K., Viswanathan, M.: Model checking multithreaded programs with asynchronous atomic methods. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 300\u2013314. Springer, Heidelberg (2006)"},{"issue":"3","key":"9_CR21","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0097-3165(74)90062-4","volume":"16","author":"SK Stein","year":"1974","unstructured":"Stein, S.K.: Two combinatorial covering theorems. J. Comb. Theory Ser. A 16(3), 391\u2013397 (1974)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"9_CR22","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/0097-3165(76)90081-9","volume":"20","author":"WT Trotter","year":"1976","unstructured":"Trotter, W.T.: A generalization of Hiraguchi\u2019s: Inequality for posets. J. Comb. Theory Ser. A 20(1), 114\u2013123 (1976)","journal-title":"J. Comb. Theory Ser. A"},{"key":"9_CR23","series-title":"Johns Hopkins Studies in the Mathematical Sciences","volume-title":"Combinatorics and Partially Ordered Sets: Dimension Theory","author":"WT Trotter","year":"2001","unstructured":"Trotter, W.T.: Combinatorics and Partially Ordered Sets: Dimension Theory. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore (2001)"},{"issue":"3","key":"9_CR24","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"M Yannakakis","year":"1982","unstructured":"Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Algebraic Discrete Methods 3(3), 351\u2013358 (1982)","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41540-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T00:07:45Z","timestamp":1594685265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41540-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319415390","9783319415406"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41540-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"13 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toronto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}