{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:49:23Z","timestamp":1725702563452},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642340253"},{"type":"electronic","value":"9783642340260"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34026-0_28","type":"book-chapter","created":{"date-parts":[[2012,9,25]],"date-time":"2012-09-25T21:07:20Z","timestamp":1348607240000},"page":"372-387","source":"Crossref","is-referenced-by-count":3,"title":["Bounded-Interference Sequentialization for Testing Concurrent Programs"],"prefix":"10.1007","author":[{"given":"Niloofar","family":"Razavi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azadeh","family":"Farzan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Holzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"http:\/\/csparser.codeplex.com\/"},{"key":"28_CR2","unstructured":"http:\/\/research.microsoft.com\/en-us\/projects\/poirot\/"},{"key":"28_CR3","unstructured":"http:\/\/research.microsoft.com\/en-us\/um\/redmond\/projects\/z3\/"},{"key":"28_CR4","unstructured":"http:\/\/sourceforge.net\/projects\/ftpnet\/"},{"key":"28_CR5","unstructured":"http:\/\/www.epcc.ed.ac.uk\/research\/java-grande\/"},{"key":"28_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1455518.1455522","volume":"12","author":"C. Cadar","year":"2008","unstructured":"Cadar, C., Ganesh, V., Pawlowski, P.M., Dill, D.L., Engler, D.R.: Exe: Automatically generating inputs of death. ACM Trans. Inf. Syst. Secur.\u00a012, 10:1\u201310:38 (2008)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/1839676.1839699","volume":"53","author":"C. Flanagan","year":"2010","unstructured":"Flanagan, C., Freund, S.N.: Fasttrack: efficient and precise dynamic race detection. Commun. ACM\u00a053, 93\u2013101 (2010)","journal-title":"Commun. ACM"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Klarlund, N., Sen, K.: Dart: directed automated random testing. In: PDLI, pp. 213\u2013223. ACM (2005)","DOI":"10.1145\/1064978.1065036"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-642-02658-4_38","volume-title":"Computer Aided Verification","author":"S.K. Lahiri","year":"2009","unstructured":"Lahiri, S.K., Qadeer, S., Rakamari\u0107, Z.: Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol.\u00a05643, pp. 509\u2013524. Springer, Heidelberg (2009)"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10703-009-0078-9","volume":"35","author":"A. Lal","year":"2009","unstructured":"Lal, A., Reps, T.: Reducing concurrent analysis under a context bound to sequential analysis. Form. Methods Syst. Des.\u00a035, 73\u201397 (2009)","journal-title":"Form. Methods Syst. Des."},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/366246.366248","volume":"6","author":"J.C. Miller","year":"1963","unstructured":"Miller, J.C., Maloney, C.J.: Systematic mistake analysis of digital computer programs. Commun. ACM\u00a06, 58\u201363 (1963)","journal-title":"Commun. ACM"},{"key":"28_CR12","unstructured":"Musuvathi, M., Qadeer, S., Ball, T., Basler, G., Nainar, P.A., Neamtiu, I.: Finding and reproducing heisenbugs in concurrent programs. In: OSDI, pp. 267\u2013280 (2008)"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/1453101.1453121","volume-title":"Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of Software Engineering, SIGSOFT 2008\/FSE-16","author":"C.-S. Park","year":"2008","unstructured":"Park, C.-S., Sen, K.: Randomized active atomicity violation detection in concurrent programs. In: Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of Software Engineering, SIGSOFT 2008\/FSE-16, pp. 135\u2013145. ACM, New York (2008)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Park, S., Lu, S., Zhou, Y.: Ctrigger: exposing atomicity violation bugs from their hiding places. In: ASPLOS, pp. 25\u201336 (2009)","DOI":"10.1145\/1508284.1508249"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1002\/cpe.1064","volume":"19","author":"E. Pozniansky","year":"2007","unstructured":"Pozniansky, E., Schuster, A.: Multirace: efficient on-the-fly data race detection in multithreaded c++ programs: Research articles. Concurr. Comput.: Pract. Exper.\u00a019, 327\u2013340 (2007)","journal-title":"Concurr. Comput. : Pract. Exper."},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/996893.996845","volume":"39","author":"S. Qadeer","year":"2004","unstructured":"Qadeer, S., Wu, D.: Kiss: keep it simple and sequential. SIGPLAN Not.\u00a039, 14\u201324 (2004)","journal-title":"SIGPLAN Not."},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Sen, K.: Race directed random testing of concurrent programs. In: PLDI, pp. 11\u201321 (2008)","DOI":"10.1145\/1379022.1375584"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/11817963_38","volume-title":"Computer Aided Verification","author":"K. Sen","year":"2006","unstructured":"Sen, K., Agha, G.: CUTE and jCUTE: Concolic Unit Testing and Explicit Path Model-Checking Tools. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 419\u2013423. Springer, Heidelberg (2006)"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Sorrentino, F., Farzan, A., Madhusudan, P.: Penelope: weaving threads to expose atomicity violations. In: FSE 2010, pp. 37\u201346. ACM (2010)","DOI":"10.1145\/1882291.1882300"},{"key":"28_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-79124-9_10","volume-title":"Tests and Proofs","author":"N. Tillmann","year":"2008","unstructured":"Tillmann, N., de Halleux, J.: Pex\u2013White Box Test Generation for.NET. In: Beckert, B., H\u00e4hnle, R. (eds.) TAP 2008. LNCS, vol.\u00a04966, pp. 134\u2013153. Springer, Heidelberg (2008)"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-642-02658-4_36","volume-title":"Computer Aided Verification","author":"S. Torre La","year":"2009","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: Reducing Context-Bounded Concurrent Reachability to Sequential Reachability. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol.\u00a05643, pp. 477\u2013492. Springer, Heidelberg (2009)"},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-12002-2_27","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C. Wang","year":"2010","unstructured":"Wang, C., Limaye, R., Ganai, M., Gupta, A.: Trace-Based Symbolic Analysis for Atomicity Violations. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 328\u2013342. Springer, Heidelberg (2010)"},{"key":"28_CR23","volume-title":"PADTAD 2009","author":"J. Yi","year":"2009","unstructured":"Yi, J., Sadowski, C., Flanagan, C.: Sidetrack: generalizing dynamic atomicity analysis. In: PADTAD 2009, pp. 8:1\u20138:10. ACM, New York (2009)"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, W., Lim, J., Olichandran, R., Scherpelz, J., Jin, G., Lu, S., Reps, T.: Conseq: detecting concurrency bugs through sequential errors. In: ASPLOS, pp. 251\u2013264 (2011)","DOI":"10.1145\/1961295.1950395"}],"container-title":["Lecture Notes in Computer Science","Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34026-0_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:41:20Z","timestamp":1620117680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34026-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642340253","9783642340260"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34026-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}