{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T02:04:22Z","timestamp":1776305062498,"version":"3.50.1"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030255428","type":"print"},{"value":"9783030255435","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25543-5_30","type":"book-chapter","created":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T12:03:09Z","timestamp":1562932989000},"page":"534-546","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Violat: Generating Tests of Observational Refinement for Concurrent Objects"],"prefix":"10.1007","author":[{"given":"Michael","family":"Emmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Constantin","family":"Enea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"issue":"2","key":"30_CR1","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/2627752","volume":"36","author":"J Alglave","year":"2014","unstructured":"Alglave, J., Maranget, L., Tautschnig, M.: Herding cats: modelling, simulation, testing, and data mining for weak memory. ACM Trans. Program. Lang. Syst. 36(2), 7:1\u20137:74 (2014). \n                      https:\/\/doi.org\/10.1145\/2627752","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"30_CR2","doi-asserted-by":"publisher","unstructured":"Batty, M., Owens, S., Sarkar, S., Sewell, P., Weber, T.: Mathematizing C++ concurrency. In: Ball, T., Sagiv, M. (eds.) Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, 26\u201328 January 2011, pp. 55\u201366. ACM (2011). \n                      https:\/\/doi.org\/10.1145\/1926385.1926394","DOI":"10.1145\/1926385.1926394"},{"key":"30_CR3","doi-asserted-by":"publisher","unstructured":"Bouajjani, A., Emmi, M., Enea, C., Hamza, J.: Tractable refinement checking for concurrent objects. In: Rajamani, S.K., Walker, D. (eds.) Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, Mumbai, India, 15\u201317 January 2015, pp. 651\u2013662. ACM (2015). \n                      https:\/\/doi.org\/10.1145\/2676726.2677002","DOI":"10.1145\/2676726.2677002"},{"key":"30_CR4","doi-asserted-by":"publisher","unstructured":"Burckhardt, S., Dern, C., Musuvathi, M., Tan, R.: Line-up: a complete and automatic linearizability checker. In: Zorn, B.G., Aiken, A. (eds.) Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2010, Toronto, Ontario, Canada, 5\u201310 June 2010, pp. 330\u2013340. ACM (2010). \n                      https:\/\/doi.org\/10.1145\/1806596.1806634","DOI":"10.1145\/1806596.1806634"},{"key":"30_CR5","doi-asserted-by":"publisher","unstructured":"Chen, Y., et al.: Fast complete memory consistency verification. In: 15th International Conference on High-Performance Computer Architecture (HPCA-15 2009), 14\u201318 February 2009, Raleigh, North Carolina, USA, pp. 381\u2013392. IEEE Computer Society (2009). \n                      https:\/\/doi.org\/10.1109\/HPCA.2009.4798276","DOI":"10.1109\/HPCA.2009.4798276"},{"key":"30_CR6","doi-asserted-by":"publisher","unstructured":"Choudhary, A., Lu, S., Pradel, M.: Efficient detection of thread safety violations via coverage-guided generation of concurrent tests. In: Uchitel, S., Orso, A., Robillard, M.P. (eds.) Proceedings of the 39th International Conference on Software Engineering, ICSE 2017, Buenos Aires, Argentina, 20\u201328 May 2017, pp. 266\u2013277. IEEE\/ACM (2017). \n                      https:\/\/doi.org\/10.1109\/ICSE.2017.32","DOI":"10.1109\/ICSE.2017.32"},{"key":"30_CR7","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press (2001). \n                      http:\/\/books.google.de\/books?id=Nmc4wEaLXFEC"},{"key":"30_CR8","doi-asserted-by":"publisher","unstructured":"Elver, M., Nagarajan, V.: McVerSi: a test generation framework for fast memory consistency verification in simulation. In: 2016 IEEE International Symposium on High Performance Computer Architecture, HPCA 2016, Barcelona, Spain, 12\u201316 March 2016, pp. 618\u2013630. IEEE Computer Society (2016). \n                      https:\/\/doi.org\/10.1109\/HPCA.2016.7446099","DOI":"10.1109\/HPCA.2016.7446099"},{"key":"30_CR9","unstructured":"Emmi, M., Enea, C.: Exposing non-atomic methods of concurrent objects. CoRR abs\/1706.09305 (2017). \n                      http:\/\/arxiv.org\/abs\/1706.09305"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-319-96145-3_26","volume-title":"Computer Aided Verification","author":"M Emmi","year":"2018","unstructured":"Emmi, M., Enea, C.: Monitoring weak consistency. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 487\u2013506. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-96145-3_26"},{"issue":"POPL","key":"30_CR11","doi-asserted-by":"publisher","first-page":"25:1","DOI":"10.1145\/3158113","volume":"2","author":"M Emmi","year":"2018","unstructured":"Emmi, M., Enea, C.: Sound, complete, and tractable linearizability monitoring for concurrent collections. PACMPL 2(POPL), 25:1\u201325:27 (2018). \n                      https:\/\/doi.org\/10.1145\/3158113","journal-title":"PACMPL"},{"issue":"POPL","key":"30_CR12","first-page":"60:1","volume":"3","author":"M Emmi","year":"2019","unstructured":"Emmi, M., Enea, C.: Weak-consistency specification via visibility relaxation. PACMPL 3(POPL), 60:1\u201360:28 (2019). \n                      https:\/\/dl.acm.org\/citation.cfm?id=3290373","journal-title":"PACMPL"},{"key":"30_CR13","doi-asserted-by":"publisher","unstructured":"Emmi, M., Enea, C., Hamza, J.: Monitoring refinement via symbolic reasoning. In: Grove, D., Blackburn, S. (eds.) Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, Portland, OR, USA, 15\u201317 June 2015, pp. 260\u2013269. ACM (2015). \n                      https:\/\/doi.org\/10.1145\/2737924.2737983","DOI":"10.1145\/2737924.2737983"},{"issue":"51\u201352","key":"30_CR14","doi-asserted-by":"publisher","first-page":"4379","DOI":"10.1016\/j.tcs.2010.09.021","volume":"411","author":"I Filipovic","year":"2010","unstructured":"Filipovic, I., O\u2019Hearn, P.W., Rinetzky, N., Yang, H.: Abstraction for concurrent objects. Theor. Comput. Sci. 411(51\u201352), 4379\u20134398 (2010). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2010.09.021","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"30_CR15","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.1137\/S0097539794279614","volume":"26","author":"PB Gibbons","year":"1997","unstructured":"Gibbons, P.B., Korach, E.: Testing shared memories. SIAM J. Comput. 26(4), 1208\u20131244 (1997). \n                      https:\/\/doi.org\/10.1137\/S0097539794279614","journal-title":"SIAM J. Comput."},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60761-7","volume-title":"Partial-Order Methods for the Verification of Concurrent Systems","year":"1996","unstructured":"Godefroid, P. (ed.): Partial-Order Methods for the Verification of Concurrent Systems. LNCS, vol. 1032. Springer, Heidelberg (1996). \n                      https:\/\/doi.org\/10.1007\/3-540-60761-7"},{"key":"30_CR17","doi-asserted-by":"publisher","unstructured":"Hangal, S., Vahia, D., Manovit, C., Lu, J.J., Narayanan, S.: TSOtool: a program for verifying memory systems using the memory consistency model. In: 31st International Symposium on Computer Architecture (ISCA 2004), 19\u201323 June 2004, Munich, Germany, pp. 114\u2013123. IEEE Computer Society (2004). \n                      https:\/\/doi.org\/10.1109\/ISCA.2004.1310768","DOI":"10.1109\/ISCA.2004.1310768"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-16442-1_14","volume-title":"ESOP 86","author":"J He","year":"1986","unstructured":"He, J., Hoare, C.A.R., Sanders, J.W.: Data refinement refined resume. In: Robinet, B., Wilhelm, R. (eds.) ESOP 1986. LNCS, vol. 213, pp. 187\u2013196. Springer, Heidelberg (1986). \n                      https:\/\/doi.org\/10.1007\/3-540-16442-1_14"},{"key":"30_CR19","volume-title":"The Art of Multiprocessor Programming","author":"M Herlihy","year":"2008","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann, San Mateo (2008)"},{"issue":"3","key":"30_CR20","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990). \n                      https:\/\/doi.org\/10.1145\/78969.78972","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"30_CR21","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0020-0190(87)90224-9","volume":"25","author":"CAR Hoare","year":"1987","unstructured":"Hoare, C.A.R., He, J., Sanders, J.W.: Prespecification in data refinement. Inf. Process. Lett. 25(2), 71\u201376 (1987). \n                      https:\/\/doi.org\/10.1016\/0020-0190(87)90224-9","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"30_CR22","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1145\/505145.505149","volume":"11","author":"D Jackson","year":"2002","unstructured":"Jackson, D.: Alloy: a lightweight object modelling notation. ACM Trans. Softw. Eng. Methodol. 11(2), 256\u2013290 (2002). \n                      https:\/\/doi.org\/10.1145\/505145.505149","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"issue":"6","key":"30_CR23","doi-asserted-by":"publisher","first-page":"1811","DOI":"10.1145\/197320.197383","volume":"16","author":"B Liskov","year":"1994","unstructured":"Liskov, B., Wing, J.M.: A behavioral notion of subtyping. ACM Trans. Program. Lang. Syst. 16(6), 1811\u20131841 (1994). \n                      https:\/\/doi.org\/10.1145\/197320.197383","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"30_CR24","doi-asserted-by":"publisher","unstructured":"Lowe, G.: Testing for linearizability. Concurrency Comput. Pract. Exp. 29(4) (2017). \n                      https:\/\/doi.org\/10.1002\/cpe.3928","DOI":"10.1002\/cpe.3928"},{"key":"30_CR25","doi-asserted-by":"publisher","unstructured":"Lu, S., Park, S., Seo, E., Zhou, Y.: Learning from mistakes: a comprehensive study on real world concurrency bug characteristics. In: Eggers, S.J., Larus, J.R. (eds.) Proceedings of the 13th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2008, Seattle, WA, USA, 1\u20135 March 2008, pp. 329\u2013339. ACM (2008). \n                      https:\/\/doi.org\/10.1145\/1346281.1346323","DOI":"10.1145\/1346281.1346323"},{"key":"30_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-642-14295-6_26","volume-title":"Computer Aided Verification","author":"S Mador-Haim","year":"2010","unstructured":"Mador-Haim, S., Alur, R., Martin, M.M.K.: Generating litmus tests for contrasting memory consistency models. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 273\u2013287. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-14295-6_26"},{"key":"30_CR27","doi-asserted-by":"publisher","unstructured":"Mador-Haim, S., Alur, R., Martin, M.M.K.: Litmus tests for comparing memory consistency models: how long do they need to be? In: Stok, L., Dutt, N.D., Hassoun, S. (eds.) Proceedings of the 48th Design Automation Conference, DAC 2011, San Diego, California, USA, 5\u201310 June 2011, pp. 504\u2013509. ACM (2011). \n                      https:\/\/doi.org\/10.1145\/2024724.2024842","DOI":"10.1145\/2024724.2024842"},{"key":"30_CR28","doi-asserted-by":"publisher","unstructured":"Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Burns, J.E., Moses, Y. (eds.) Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, Philadelphia, Pennsylvania, USA, 23\u201326 May 1996, pp. 267\u2013275. ACM (1996). \n                      https:\/\/doi.org\/10.1145\/248052.248106","DOI":"10.1145\/248052.248106"},{"key":"30_CR29","doi-asserted-by":"publisher","unstructured":"Moir, M., Shavit, N.: Concurrent data structures. In: Mehta, D.P., Sahni, S. (eds.) Handbook of Data Structures and Applications. Chapman and Hall\/CRC (2004). \n                      https:\/\/doi.org\/10.1201\/9781420035179.ch47","DOI":"10.1201\/9781420035179.ch47"},{"key":"30_CR30","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). \n                      https:\/\/doi.org\/10.1007\/978-3-540-71410-1_2"},{"key":"30_CR31","doi-asserted-by":"publisher","unstructured":"Nistor, A., Luo, Q., Pradel, M., Gross, T.R., Marinov, D.: Ballerina: automatic generation and clustering of efficient random unit tests for multithreaded code. In: Glinz, M., Murphy, G.C., Pezz\u00e8, M. (eds.) 34th International Conference on Software Engineering, ICSE 2012, 2\u20139 June 2012, Zurich, Switzerland, pp. 727\u2013737. IEEE Computer Society (2012). \n                      https:\/\/doi.org\/10.1109\/ICSE.2012.6227145","DOI":"10.1109\/ICSE.2012.6227145"},{"issue":"3","key":"30_CR32","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"GD Plotkin","year":"1977","unstructured":"Plotkin, G.D.: LCF considered as a programming language. Theor. Comput. Sci. 5(3), 223\u2013255 (1977). \n                      https:\/\/doi.org\/10.1016\/0304-3975(77)90044-5","journal-title":"Theor. Comput. Sci."},{"key":"30_CR33","doi-asserted-by":"publisher","unstructured":"Pradel, M., Gross, T.R.: Fully automatic and precise detection of thread safety violations. In: Vitek, J., Lin, H., Tip, F. (eds.) ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2012, Beijing, China, 11\u201316 June 2012, pp. 521\u2013530. ACM (2012). \n                      https:\/\/doi.org\/10.1145\/2254064.2254126","DOI":"10.1145\/2254064.2254126"},{"key":"30_CR34","doi-asserted-by":"publisher","unstructured":"Pradel, M., Gross, T.R.: Automatic testing of sequential and concurrent substitutability. In: Notkin, D., Cheng, B.H.C., Pohl, K. (eds.) 35th International Conference on Software Engineering, ICSE 2013, San Francisco, CA, USA, 18\u201326 May 2013, pp. 282\u2013291. IEEE Computer Society (2013). \n                      https:\/\/doi.org\/10.1109\/ICSE.2013.6606574","DOI":"10.1109\/ICSE.2013.6606574"},{"key":"30_CR35","doi-asserted-by":"publisher","unstructured":"Samak, M., Ramanathan, M.K.: Multithreaded test synthesis for deadlock detection. In: Black, A.P., Millstein, T.D. (eds.) Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications, OOPSLA 2014, Part of SPLASH 2014, Portland, OR, USA, 20\u201324 October 2014, pp. 473\u2013489. ACM (2014). \n                      https:\/\/doi.org\/10.1145\/2660193.2660238","DOI":"10.1145\/2660193.2660238"},{"key":"30_CR36","doi-asserted-by":"publisher","unstructured":"Samak, M., Ramanathan, M.K.: Omen+: a precise dynamic deadlock detector for multithreaded java libraries. In: Cheung, S., Orso, A., Storey, M.D. (eds.) Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering, (FS-22), Hong Kong, China, 16\u201322 November 2014, pp. 735\u2013738. ACM (2014). \n                      https:\/\/doi.org\/10.1145\/2635868.2661670","DOI":"10.1145\/2635868.2661670"},{"key":"30_CR37","doi-asserted-by":"publisher","unstructured":"Samak, M., Ramanathan, M.K.: Omen: a tool for synthesizing tests for deadlock detection. In: Black, A.P. (ed.) Conference on Systems, Programming, and Applications: Software for Humanity, SPLASH 2014, Portland, OR, USA, 20\u201324 October 2014, Companion Volume, pp. 37\u201338. ACM (2014). \n                      https:\/\/doi.org\/10.1145\/2660252.2664663","DOI":"10.1145\/2660252.2664663"},{"key":"30_CR38","doi-asserted-by":"publisher","unstructured":"Samak, M., Ramanathan, M.K.: Trace driven dynamic deadlock detection and reproduction. In: Moreira, J.E., Larus, J.R. (eds.) ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2014, Orlando, FL, USA, 15\u201319 February 2014, pp. 29\u201342. ACM (2014). \n                      https:\/\/doi.org\/10.1145\/2555243.2555262","DOI":"10.1145\/2555243.2555262"},{"key":"30_CR39","doi-asserted-by":"publisher","unstructured":"Samak, M., Ramanathan, M.K.: Synthesizing tests for detecting atomicity violations. In: Nitto, E.D., Harman, M., Heymans, P. (eds.) Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering, ESEC\/FSE 2015, Bergamo, Italy, 30 August\u20134 September 2015, pp. 131\u2013142. ACM (2015). \n                      https:\/\/doi.org\/10.1145\/2786805.2786874","DOI":"10.1145\/2786805.2786874"},{"key":"30_CR40","doi-asserted-by":"publisher","unstructured":"Samak, M., Ramanathan, M.K., Jagannathan, S.: Synthesizing racy tests. In: Grove, D., Blackburn, S. (eds.) Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, Portland, OR, USA, 15\u201317 June 2015, pp. 175\u2013185. ACM (2015). \n                      https:\/\/doi.org\/10.1145\/2737924.2737998","DOI":"10.1145\/2737924.2737998"},{"key":"30_CR41","doi-asserted-by":"publisher","unstructured":"Samak, M., Tripp, O., Ramanathan, M.K.: Directed synthesis of failing concurrent executions. In: Visser, E., Smaragdakis, Y. (eds.) Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2016, Part of SPLASH 2016, Amsterdam, The Netherlands, 30 October\u20134 November 2016, pp. 430\u2013446. ACM (2016). \n                      https:\/\/doi.org\/10.1145\/2983990.2984040","DOI":"10.1145\/2983990.2984040"},{"key":"30_CR42","unstructured":"Shipilev, A.: The java concurrency stress tests (2018). \n                      https:\/\/wiki.openjdk.java.net\/display\/CodeTools\/jcstress"},{"key":"30_CR43","doi-asserted-by":"publisher","unstructured":"Steenbuck, S., Fraser, G.: Generating unit tests for concurrent classes. In: Sixth IEEE International Conference on Software Testing, Verification and Validation, ICST 2013, Luxembourg, Luxembourg, 18\u201322 March 2013, pp. 144\u2013153. IEEE Computer Society (2013). \n                      https:\/\/doi.org\/10.1109\/ICST.2013.33","DOI":"10.1109\/ICST.2013.33"},{"key":"30_CR44","doi-asserted-by":"publisher","unstructured":"Terragni, V., Cheung, S.: Coverage-driven test code generation for concurrent classes. In: Dillon, L.K., Visser, W., Williams, L. (eds.) Proceedings of the 38th International Conference on Software Engineering, ICSE 2016, Austin, TX, USA, 14\u201322 May 2016, pp. 1121\u20131132. ACM (2016). \n                      https:\/\/doi.org\/10.1145\/2884781.2884876","DOI":"10.1145\/2884781.2884876"},{"key":"30_CR45","doi-asserted-by":"publisher","unstructured":"Terragni, V., Pezz\u00e8, M.: Effectiveness and challenges in generating concurrent tests for thread-safe classes. In: Huchard, M., K\u00e4stner, C., Fraser, G. (eds.) Proceedings of the 33rd ACM\/IEEE International Conference on Automated Software Engineering, ASE 2018, Montpellier, France, 3\u20137 September 2018, pp. 64\u201375. ACM (2018). \n                      https:\/\/doi.org\/10.1145\/3238147.3238224","DOI":"10.1145\/3238147.3238224"},{"key":"30_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-642-14295-6_40","volume-title":"Computer Aided Verification","author":"V Vafeiadis","year":"2010","unstructured":"Vafeiadis, V.: Automatically proving linearizability. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 450\u2013464. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-14295-6_40"},{"key":"30_CR47","doi-asserted-by":"publisher","unstructured":"Visser, W., Pasareanu, C.S., Khurshid, S.: Test input generation with java pathfinder. In: Avrunin, G.S., Rothermel, G. (eds.) Proceedings of the ACM\/SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2004, Boston, Massachusetts, USA, 11\u201314 July 2004, pp. 97\u2013107. ACM (2004). \n                      https:\/\/doi.org\/10.1145\/1007512.1007526","DOI":"10.1145\/1007512.1007526"},{"key":"30_CR48","unstructured":"Wickerson, J., Batty, M., Sorensen, T., Constantinides, G.A.: Automatically comparing memory consistency models. In: Castagna, G., Gordon, A.D. (eds.) Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, 18\u201320 January 2017, pp. 190\u2013204. ACM (2017). \n                      http:\/\/dl.acm.org\/citation.cfm?id=3009838"},{"issue":"1\u20132","key":"30_CR49","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/jpdc.1993.1015","volume":"17","author":"JM Wing","year":"1993","unstructured":"Wing, J.M., Gong, C.: Testing and verifying concurrent objects. J. Parallel Distrib. Comput. 17(1\u20132), 164\u2013182 (1993). \n                      https:\/\/doi.org\/10.1006\/jpdc.1993.1015","journal-title":"J. Parallel Distrib. Comput."}],"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-030-25543-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T12:10:55Z","timestamp":1562933455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-25543-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030255428","9783030255435"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25543-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","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":"New York City, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/i-cav.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"258","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}