{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:11:41Z","timestamp":1774987901292,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,1,26]],"date-time":"2011-01-26T00:00:00Z","timestamp":1296000000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,1,26]]},"DOI":"10.1145\/1926385.1926433","type":"proceedings-article","created":{"date-parts":[[2011,1,24]],"date-time":"2011-01-24T09:58:22Z","timestamp":1295863102000},"page":"423-434","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["On interference abstractions"],"prefix":"10.1145","author":[{"given":"Nishant","family":"Sinha","sequence":"first","affiliation":[{"name":"NEC Labs America, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Wang","sequence":"additional","affiliation":[{"name":"NEC Labs America, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,1,26]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz A.W.: Trace theory. In: Advances in Petri Nets. (1986) 279--324   Mazurkiewicz A.W.: Trace theory. In: Advances in Petri Nets. (1986) 279--324","DOI":"10.1007\/3-540-17906-2_30"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60761-7","volume-title":"Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem","author":"Godefroid P.","year":"1996","unstructured":"Godefroid , P. : Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem . Springer-Verlag New York, Inc. , Secaucus, NJ, USA ( 1996 ) Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem. Springer-Verlag New York, Inc., Secaucus, NJ, USA (1996)"},{"key":"e_1_3_2_2_3_1","volume-title":"Partial order reduction: Model-checking using representatives","author":"Peled D.","year":"1996","unstructured":"Peled , D. : Partial order reduction: Model-checking using representatives . In : MFCS. ( 1996 ) 93--112 Peled, D.: Partial order reduction: Model-checking using representatives. In: MFCS. (1996) 93--112"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040316"},{"key":"e_1_3_2_2_5_1","volume-title":"Neamtiu","author":"Musuvathi M.","year":"2008","unstructured":"Musuvathi , M. , Qadeer , S. , Ball , T. , Basler , G. , Nainar , P.A. , Neamtiu , I. : Finding and reproducing heisenbugs in concurrent programs. In : OSDI. ( 2008 ) 267--280 Musuvathi, M., Qadeer, S., Ball, T., Basler, G., Nainar, P.A., Neamtiu, I.: Finding and reproducing heisenbugs in concurrent programs. In: OSDI. (2008) 267--280"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_31"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_7"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250785"},{"key":"e_1_3_2_2_9_1","volume-title":"Reps","author":"Lal A.","year":"2008","unstructured":"Lal , A. , Touili , T. , Kidd , N. , Reps , T.W. : Interprocedural analysis of concurrent programs under a context bound. In : TACAS. ( 2008 ) 282--298 Lal, A., Touili, T., Kidd, N., Reps, T.W.: Interprocedural analysis of concurrent programs under a context bound. In: TACAS. (2008) 282--298"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.546611"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250737"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806635"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1882291.1882301"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675439"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353536.1346323"},{"key":"e_1_3_2_2_16_1","volume-title":": Computer-aided verification of coordinating processes: the automata-theoretic approach","author":"Kurshan R.P.","year":"1994","unstructured":"Kurshan , R.P. : Computer-aided verification of coordinating processes: the automata-theoretic approach . Princeton University Press ( 1994 ) Kurshan, R.P.: Computer-aided verification of coordinating processes: the automata-theoretic approach. Princeton University Press (1994)"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/876638.876643"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378846"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964021"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1595696.1595702"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05089-3_17"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12002-2_27"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_39"},{"key":"e_1_3_2_2_24_1","volume-title":"F.: A tool for checking ANSI-C programs","author":"Clarke E.","year":"2004","unstructured":"Clarke , E. , Kroening , D. , Lerda , F.: A tool for checking ANSI-C programs . In Jensen, K., Podelski, A., eds.: TACAS. Volume 2988 of LNCS., Springer ( 2004 ) 168--176 Clarke, E., Kroening, D., Lerda, F.: A tool for checking ANSI-C programs. In Jensen, K., Podelski, A., eds.: TACAS. Volume 2988 of LNCS., Springer (2004) 168--176"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_31"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_38"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/93542.93578"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_11"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"de Moura L. Bj\u00f8rner N.: Z3: An efficient smt solver. In: TACAS. (2008) 337--340   de Moura L. Bj\u00f8rner N.: Z3: An efficient smt solver. In: TACAS. (2008) 337--340","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168857.1168864"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_21"},{"key":"e_1_3_2_2_32_1","volume-title":"Slind","author":"Yang Y.","year":"2004","unstructured":"Yang , Y. , Gopalakrishnan , G. , Lindstrom , G. , Slind , K. : Nemos: A framework for axiomatic and executable specifications of memory consistency models. In : IPDPS. ( 2004 ) Yang, Y., Gopalakrishnan, G., Lindstrom, G., Slind, K.: Nemos: A framework for axiomatic and executable specifications of memory consistency models. In: IPDPS. (2004)"},{"key":"e_1_3_2_2_33_1","unstructured":"http:\/\/www.javagrande.org\/: The Java Grande Forum Benchmark Suite.  http:\/\/www.javagrande.org\/: The Java Grande Forum Benchmark Suite."},{"key":"e_1_3_2_2_34_1","volume-title":"Pressburger","author":"Havelund K.","year":"2000","unstructured":"Havelund , K. , Pressburger , T. : Model checking Java programs using Java PathFinder. International Journal on Software Tools for Technology Transfer (STTT) 2(4)( 2000 ) Havelund, K., Pressburger, T.: Model checking Java programs using Java PathFinder. International Journal on Software Tools for Technology Transfer (STTT) 2(4)(2000)"},{"key":"e_1_3_2_2_35_1","volume-title":"Gross","author":"von Praun C.","year":"2004","unstructured":"von Praun , C. , Gross , T.R. : Static detection of atomicity violations in object-oriented programs. Object Technology 3(6) ( 2004 ) von Praun, C., Gross, T.R.: Static detection of atomicity violations in object-oriented programs. Object Technology 3(6) (2004)"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73595-3_13"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040315"},{"key":"e_1_3_2_2_38_1","volume-title":"Peled","author":"Clarke E.","unstructured":"Clarke , E. , Grumberg , O. , Peled , D. : Model Checking. MIT Press . Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press."},{"key":"e_1_3_2_2_39_1","volume-title":"Qadeer","author":"Flanagan C.","year":"2003","unstructured":"Flanagan , C. , Qadeer , S. : Thread-modular model checking. In : SPIN. ( 2003 ) 213--224 Flanagan, C., Qadeer, S.: Thread-modular model checking. In: SPIN. (2003) 213--224"},{"key":"e_1_3_2_2_40_1","volume-title":"Qadeer","author":"Henzinger T.A.","year":"2003","unstructured":"Henzinger , T.A. , Jhala , R. , Majumdar , R. , Qadeer , S. : Thread-modular abstraction refinement. In : CAV. Volume 2725., Springer-Verlag ( 2003 ) 262--274 Henzinger, T.A., Jhala, R., Majumdar, R., Qadeer, S.: Thread-modular abstraction refinement. In: CAV. Volume 2725., Springer-Verlag (2003) 262--274"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-008-0063-8"},{"key":"e_1_3_2_2_42_1","volume-title":"Ro\u015fu","author":"\u015eerb\u01cenu\u0163\u0103 T.F.","year":"2010","unstructured":"\u015eerb\u01cenu\u0163\u0103 , T.F. , Chen , F. , Ro\u015fu , G. : Maximal causal models for sequentially consistent multithreaded systems. Technical report, University of Illinois ( 2010 ) \u015eerb\u01cenu\u0163\u0103, T.F., Chen, F., Ro\u015fu, G.: Maximal causal models for sequentially consistent multithreaded systems. Technical report, University of Illinois (2010)"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-93900-9_28"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706307"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-009-0101-x"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066100.1066102"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_22"}],"event":{"name":"POPL '11: The 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Austin Texas USA","acronym":"POPL '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1926385.1926433","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1926385.1926433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:59:51Z","timestamp":1750229991000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1926385.1926433"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,26]]},"references-count":47,"alternative-id":["10.1145\/1926385.1926433","10.1145\/1926385"],"URL":"https:\/\/doi.org\/10.1145\/1926385.1926433","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1925844.1926433","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,1,26]]},"assertion":[{"value":"2011-01-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}