{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T03:01:44Z","timestamp":1783393304022,"version":"3.54.6"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031308192","type":"print"},{"value":"9783031308208","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T00:00:00Z","timestamp":1681948800000},"content-version":"vor","delay-in-days":109,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper describes the design and implementation of the open-source tool <jats:inline-formula><jats:tex-math>$$\\textsc {Coyote} $$<\/jats:tex-math><\/jats:inline-formula> for testing concurrent programs written in the <jats:inline-formula><jats:tex-math>$$\\textsc {C}{} \\texttt {\\#} $$<\/jats:tex-math><\/jats:inline-formula> language. <jats:inline-formula><jats:tex-math>$$\\textsc {Coyote} $$<\/jats:tex-math><\/jats:inline-formula> provides algorithmic capabilities to explore the state-space of interleavings of a concurrent program, with deterministic repro for any bug that it finds. <jats:inline-formula><jats:tex-math>$$\\textsc {Coyote} $$<\/jats:tex-math><\/jats:inline-formula> encapsulates multiple ideas from the research community to offer state-of-the-art testing for <jats:inline-formula><jats:tex-math>$$\\textsc {C}{} \\texttt {\\#} $$<\/jats:tex-math><\/jats:inline-formula> programs, as well as an efficiently engineered implementation that has been shown robust enough to support industrial use.\n<\/jats:p>","DOI":"10.1007\/978-3-031-30820-8_26","type":"book-chapter","created":{"date-parts":[[2023,4,19]],"date-time":"2023-04-19T19:02:36Z","timestamp":1681930956000},"page":"433-452","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Industrial-Strength Controlled Concurrency Testing for $$\\textsc {C}{} \\texttt {\\#} $$ Programs with $$\\textsc {Coyote} $$"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7582-4520","authenticated-orcid":false,"given":"Pantazis","family":"Deligiannis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aditya","family":"Senthilnathan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fahad","family":"Nayyar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chris","family":"Lovett","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Akash","family":"Lal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,20]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Atig, M.F., Jonsson, B., L\u00e5ng, M., Ngo, T.P., Sagonas, K.: Optimal stateless model checking for reads-from equivalence under sequential consistency. Proc. ACM Program. Lang. 3(OOPSLA), 150:1\u2013150:29 (2019)","DOI":"10.1145\/3360576"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Atig, M.F., Jonsson, B., Ngo, T.P.: Dynamic partial order reduction under the release-acquire semantics (tutorial). In: Atig, M.F., Schwarzmann, A.A. (eds.) Networked Systems - 7th International Conference, NETYS 2019, Marrakech, Morocco, June 19-21, 2019, Revised Selected Papers. Lecture Notes in Computer Science, vol. 11704, pp. 3\u201318. Springer (2019)","DOI":"10.1007\/978-3-030-31277-0_1"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Agarwal, U., Deligiannis, P., Huang, C., Jung, K., Lal, A., Naseer, I., Parkinson, M., Thangamani, A., Vedurada, J., Xiao, Y.: Nekara: Generalized concurrency testing. In: 36th IEEE\/ACM International Conference on Automated Software Engineering, ASE 2021, Melbourne, Australia, November 15-19, 2021. pp. 679\u2013691. IEEE (2021)","DOI":"10.1109\/ASE51524.2021.9678838"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Agha, G.: Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, Cambridge, MA, USA (1986)","DOI":"10.7551\/mitpress\/1086.001.0001"},{"key":"26_CR5","unstructured":"Amazon, Microsoft, Berkeley: P: Formal Modeling and Analysis of Distributed (Event-Driven) Systems. https:\/\/github.com\/p-org\/P (2022)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Andrews, T., Qadeer, S., Rajamani, S.K., Rehof, J., Xie, Y.: Zing: A model checker for concurrent software. In: Computer Aided Verification, 16th International Conference, CAV 2004, Boston, MA, USA, July 13-17, 2004, Proceedings. pp. 484\u2013487 (2004)","DOI":"10.1007\/978-3-540-27813-9_42"},{"key":"26_CR7","unstructured":"Anonymous: Coyote: Fearless coding for reliable asynchronous software. https:\/\/github.com\/microsoft\/coyote (2020)"},{"key":"26_CR8","unstructured":"Anonymous: Coyote Documentation, Tutorials and References. https:\/\/microsoft.github.io\/coyote\/ (2022)"},{"key":"26_CR9","unstructured":"Anonymous: Telemetry in Coyote. https:\/\/microsoft.github.io\/coyote\/#get-started\/telemetry\/ (2022)"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Burckhardt, S., Kothari, P., Musuvathi, M., Nagarakatte, S.: A randomized scheduler with probabilistic guarantees of finding bugs. In: ASPLOS. pp. 167\u2013178 (2010)","DOI":"10.1145\/1735971.1736040"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Deligiannis, P., Donaldson, A.F., Ketema, J., Lal, A., Thomson, P.: Asynchronous programming, analysis and testing with state machines. In: PLDI. pp. 154\u2013164 (2015)","DOI":"10.1145\/2813885.2737996"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Deligiannis, P., Ganapathy, N., Lal, A., Qadeer, S.: Building reliable cloud services using coyote actors. In: Curino, C., Koutrika, G., Netravali, R. (eds.) SoCC \u201921: ACM Symposium on Cloud Computing, Seattle, WA, USA, November 1 - 4, 2021. pp. 108\u2013121. ACM (2021)","DOI":"10.1145\/3472883.3486983"},{"key":"26_CR13","unstructured":"Deligiannis, P., McCutchen, M., Thomson, P., Chen, S., Donaldson, A.F., Erickson, J., Huang, C., Lal, A., Mudduluru, R., Qadeer, S., Schulte, W.: Uncovering bugs in distributed storage systems during testing (not in production!). In: FAST. pp. 249\u2013262 (2016)"},{"key":"26_CR14","doi-asserted-by":"publisher","unstructured":"Deligiannis, P., Senthilnathan, A., Nayyar, F., Lovett, C., Lal, A.: Industrial-Strength Controlled Concurrency Testing for C# Programs with Coyote - Artifact (Nov 2022). https:\/\/doi.org\/10.5281\/zenodo.7311192, https:\/\/zenodo.org\/record\/7311192#.Y8ru2EHMJaa","DOI":"10.5281\/zenodo.7311192"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Desai, A., Gupta, V., Jackson, E.K., Qadeer, S., Rajamani, S.K., Zufferey, D.: P: safe asynchronous event-driven programming. In: PLDI. pp. 321\u2013332 (2013)","DOI":"10.1145\/2499370.2462184"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Desai, A., Qadeer, S., Seshia, S.A.: Systematic testing of asynchronous reactive systems. In: FSE. pp. 73\u201383 (2015)","DOI":"10.1145\/2786805.2786861"},{"key":"26_CR17","unstructured":"Ecma International: ECMA-335, Common Language Infrastructure (CLI), 6th edition. https:\/\/www.ecma-international.org\/publications-and-standards\/standards\/ecma-335\/ (2012)"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Edelstein, O., Farchi, E., Goldin, E., Nir, Y., Ratsaby, G., Ur, S.: Framework for testing multi-threaded java programs. Concurrency and Computation: Practice and Experience 15(3-5), 485\u2013499 (2003)","DOI":"10.1002\/cpe.654"},{"key":"26_CR19","doi-asserted-by":"crossref","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-28, 2011. pp. 411\u2013422 (2011)","DOI":"10.1145\/1926385.1926432"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Fiedor, J., Hrub\u00e1, V., Krena, B., Letko, Z., Ur, S., Vojnar, T.: Advances in noise-based testing of concurrent software. Softw. Test. Verification Reliab. 25(3), 272\u2013309 (2015)","DOI":"10.1002\/stvr.1546"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Fiedor, J., Muzikovsk\u00e1, M., Smrcka, A., Vas\u00edcek, O., Vojnar, T.: Advances in the ANaConDA framework for dynamic analysis and testing of concurrent C\/C++ programs. In: Tip, F., Bodden, E. (eds.) Proceedings of the 27th ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2018, Amsterdam, The Netherlands, July 16-21, 2018. pp. 356\u2013359. ACM (2018)","DOI":"10.1145\/3213846.3229505"},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Freund, S.N.: Atomizer: a dynamic atomicity checker for multithreaded programs. In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2004, Venice, Italy, January 14-16, 2004. pp. 256\u2013267 (2004)","DOI":"10.1145\/964001.964023"},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Freund, S.N.: Fasttrack: efficient and precise dynamic race detection. In: Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2009, Dublin, Ireland, June 15-21, 2009. pp. 121\u2013133 (2009)","DOI":"10.1145\/1543135.1542490"},{"key":"26_CR24","doi-asserted-by":"crossref","unstructured":"Godefroid, P.: Software model checking: The verisoft approach. Formal Methods in System Design 26(2), 77\u2013101 (2005)","DOI":"10.1007\/s10703-005-1489-x"},{"key":"26_CR25","unstructured":"Gray, J.: Why do computers stop and what can be done about it? In: Proceedings of the 5th Symposium on Reliability in Distributed Software and Database Systems. pp. 3\u201312. IEEE (1986)"},{"key":"26_CR26","unstructured":"Holzmann, G.: The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley Professional, 1st edn. (2011)"},{"key":"26_CR27","unstructured":"Killian, C.E., Anderson, J.W., Jhala, R., Vahdat, A.: Life, death, and the critical transition: Finding liveness bugs in systems code (awarded best paper). In: Balakrishnan, H., Druschel, P. (eds.) 4th Symposium on Networked Systems Design and Implementation (NSDI 2007), April 11-13, 2007, Cambridge, Massachusetts, USA, Proceedings. USENIX (2007)"},{"key":"26_CR28","doi-asserted-by":"crossref","unstructured":"Kokologiannakis, M., Marmanis, I., Gladstein, V., Vafeiadis, V.: Truly stateless, optimal dynamic partial order reduction. Proc. ACM Program. Lang. 6(POPL), 1\u201328 (2022)","DOI":"10.1145\/3498711"},{"key":"26_CR29","doi-asserted-by":"crossref","unstructured":"Kokologiannakis, M., Raad, A., Vafeiadis, V.: Effective lock handling in stateless model checking. Proc. ACM Program. Lang. 3(OOPSLA), 173:1\u2013173:26 (2019)","DOI":"10.1145\/3360599"},{"key":"26_CR30","doi-asserted-by":"crossref","unstructured":"Kokologiannakis, M., Vafeiadis, V.: Genmc: A model checker for weak memory models. In: Silva, A., Leino, K.R.M. (eds.) Computer Aided Verification - 33rd International Conference, CAV 2021, Virtual Event, July 20-23, 2021, Proceedings, Part I. Lecture Notes in Computer Science, vol. 12759, pp. 427\u2013440. Springer (2021)","DOI":"10.1007\/978-3-030-81685-8_20"},{"key":"26_CR31","doi-asserted-by":"crossref","unstructured":"Lam, W., Godefroid, P., Nath, S., Santhiar, A., Thummalapenta, S.: Root causing flaky tests in a large-scale industrial setting. In: Zhang, D., M\u00f8ller, A. (eds.) Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2019, Beijing, China, July 15-19, 2019. pp. 101\u2013111. ACM (2019)","DOI":"10.1145\/3293882.3330570"},{"key":"26_CR32","unstructured":"Leesatapornwongsa, T., Hao, M., Joshi, P., Lukman, J.F., Gunawi, H.S.: SAMC: Semantic-aware model checking for fast discovery of deep bugs in cloud systems. In: OSDI. pp. 399\u2013414 (2014)"},{"key":"26_CR33","doi-asserted-by":"crossref","unstructured":"Li, G., Lu, S., Musuvathi, M., Nath, S., Padhye, R.: Efficient scalable thread-safety-violation detection: finding thousands of concurrency bugs during testing. In: Brecht, T., Williamson, C. (eds.) Proceedings of the 27th ACM Symposium on Operating Systems Principles, SOSP 2019, Huntsville, ON, Canada, October 27-30, 2019. pp. 162\u2013180. ACM (2019)","DOI":"10.1145\/3341301.3359638"},{"key":"26_CR34","doi-asserted-by":"crossref","unstructured":"Luo, Q., Hariri, F., Eloussi, L., Marinov, D.: An empirical analysis of flaky tests. In: Cheung, S., Orso, A., Storey, M.D. (eds.) Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering, (FSE-22), Hong Kong, China, November 16 - 22, 2014. pp. 643\u2013653. ACM (2014)","DOI":"10.1145\/2635868.2635920"},{"key":"26_CR35","unstructured":"Mazurkiewicz, A.W.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986, Part II, Proceedings of an Advanced Course, Bad Honnef, Germany, 8-19 September 1986. Lecture Notes in Computer Science, vol.\u00a0255, pp. 279\u2013324. Springer (1986)"},{"key":"26_CR36","unstructured":"Microsoft: CCI: Common Compiler Infrastructure. https:\/\/github.com\/microsoft\/cci (2015)"},{"key":"26_CR37","unstructured":"Microsoft: Asynchronous programming in C#. https:\/\/docs.microsoft.com\/en-us\/dotnet\/csharp\/programming-guide\/concepts\/async\/ (2019)"},{"key":"26_CR38","unstructured":"Microsoft: Task Asynchronous Programming Model. https:\/\/learn.microsoft.com\/en-us\/dotnet\/csharp\/programming-guide\/concepts\/async\/task-asynchronous-programming-model (2022)"},{"key":"26_CR39","doi-asserted-by":"crossref","unstructured":"Mudduluru, R., Deligiannis, P., Desai, A., Lal, A., Qadeer, S.: Lasso detection using partial-state caching. In: FMCAD. pp. 84\u201391 (2017)","DOI":"10.23919\/FMCAD.2017.8102245"},{"key":"26_CR40","doi-asserted-by":"crossref","unstructured":"Mukherjee, S., Deligiannis, P., Biswas, A., Lal, A.: Learning-based controlled concurrency testing. Proc. ACM Programming Languages 4(OOPSLA), 230:1\u2013230:31 (2020)","DOI":"10.1145\/3428298"},{"key":"26_CR41","doi-asserted-by":"crossref","unstructured":"Musuvathi, M., Qadeer, S.: Iterative context bounding for systematic testing of multithreaded programs. In: Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, San Diego, California, USA, June 10-13, 2007. pp. 446\u2013455 (2007)","DOI":"10.1145\/1273442.1250785"},{"key":"26_CR42","doi-asserted-by":"crossref","unstructured":"Musuvathi, M., Qadeer, S.: Fair stateless model checking. In: PLDI. pp. 362\u2013371. ACM (2008)","DOI":"10.1145\/1379022.1375625"},{"key":"26_CR43","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. USENIX (2008)"},{"key":"26_CR44","unstructured":".Net Documentation: TaskScheduler Class. https:\/\/learn.microsoft.com\/en-us\/dotnet\/api\/system.threading.tasks.taskscheduler?view=net-6.0 (2022)"},{"key":"26_CR45","unstructured":".Net Documentation: ValueTask Class. https:\/\/learn.microsoft.com\/en-us\/dotnet\/api\/system.threading.tasks.valuetask-1?view=net-6.0 (2022)"},{"key":"26_CR46","unstructured":".NET Foundation: Mono.Cecil: inspect, modify and create .NET programs and libraries. https:\/\/github.com\/jbevain\/cecil (2022)"},{"key":"26_CR47","doi-asserted-by":"crossref","unstructured":"Norris, B., Demsky, B.: Cdschecker: checking concurrent data structures written with C\/C++ atomics. In: Hosking, A.L., Eugster, P.T., Lopes, C.V. (eds.) 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-31, 2013. pp. 131\u2013150. ACM (2013)","DOI":"10.1145\/2509136.2509514"},{"key":"26_CR48","doi-asserted-by":"crossref","unstructured":"Ozkan, B.K., Majumdar, R., Niksic, F., Befrouei, M.T., Weissenbacher, G.: Randomized testing of distributed systems with probabilistic guarantees. PACMPL 2(OOPSLA), 160:1\u2013160:28 (2018)","DOI":"10.1145\/3276530"},{"key":"26_CR49","doi-asserted-by":"crossref","unstructured":"Park, S., Lu, S., Zhou, Y.: Ctrigger: exposing atomicity violation bugs from their hiding places. In: Proceedings of the 14th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2009, Washington, DC, USA, March 7-11, 2009. pp. 25\u201336 (2009)","DOI":"10.1145\/1508244.1508249"},{"key":"26_CR50","doi-asserted-by":"crossref","unstructured":"Savage, S., Burrows, M., Nelson, G., Sobalvarro, P., Anderson, T.E.: Eraser: A dynamic data race detector for multi-threaded programs. In: Proceedings of the Sixteenth ACM Symposium on Operating System Principles, SOSP 1997, St. Malo, France, October 5-8, 1997. pp. 27\u201337 (1997)","DOI":"10.1145\/269005.266641"},{"key":"26_CR51","doi-asserted-by":"crossref","unstructured":"Sen, K.: Race directed random testing of concurrent programs. In: Proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation, Tucson, AZ, USA, June 7-13, 2008. pp. 11\u201321 (2008)","DOI":"10.1145\/1379022.1375584"},{"key":"26_CR52","unstructured":"Tepliakov, S.: Microsoft DevBlogs: Dissecting the async methods in C#. https:\/\/devblogs.microsoft.com\/premier-developer\/dissecting-the-async-methods-in-c\/ (2017)"},{"key":"26_CR53","doi-asserted-by":"crossref","unstructured":"Thomson, P., Donaldson, A.F., Betts, A.: Concurrency testing using controlled schedulers: An empirical study. TOPC 2(4), 23:1\u201323:37 (2016)","DOI":"10.1145\/2858651"},{"key":"26_CR54","doi-asserted-by":"crossref","unstructured":"\u0160im\u0161a, J., Bryant, R., Gibson, G.: dBug: Systematic testing of unmodified distributed and multi-threaded systems. In: SPIN. pp. 188\u2013193. Springer-Verlag (2011)","DOI":"10.1007\/978-3-642-22306-8_14"},{"key":"26_CR55","unstructured":"Yang, J., Chen, T., Wu, M., Xu, Z., Liu, X., Lin, H., Yang, M., Long, F., Zhang, L., Zhou, L.: MODIST: Transparent model checking of unmodified distributed systems. In: NSDI. pp. 213\u2013228 (2009)"},{"key":"26_CR56","doi-asserted-by":"crossref","unstructured":"Yuan, X., Yang, J., Gu, R.: Partial order aware concurrency sampling. In: Chockler, H., Weissenbacher, G. (eds.) Computer Aided Verification - 30th International Conference, CAV 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings, Part II. Lecture Notes in Computer Science, vol. 10982, pp. 317\u2013335. Springer (2018)","DOI":"10.1007\/978-3-319-96142-2_20"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30820-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T11:06:27Z","timestamp":1690974387000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30820-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031308192","9783031308208"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30820-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"20 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2023\/tacas","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":"169","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":"56","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":"6","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":"33% - 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":"11","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}