{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:25:29Z","timestamp":1743071129615,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031199912"},{"type":"electronic","value":"9783031199929"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-19992-9_23","type":"book-chapter","created":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T09:12:06Z","timestamp":1666429926000},"page":"354-370","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Repair for\u00a0Omega-Regular Properties"],"prefix":"10.1007","author":[{"given":"Vrunda","family":"Dave","sequence":"first","affiliation":[]},{"given":"Shankara Narayanan","family":"Krishna","sequence":"additional","affiliation":[]},{"given":"Vishnu","family":"Murali","sequence":"additional","affiliation":[]},{"given":"Ashutosh","family":"Trivedi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,21]]},"reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-319-89366-2_23","volume-title":"Foundations of Software Science and Computation Structures","author":"S Bansal","year":"2018","unstructured":"Bansal, S., Chaudhuri, S., Vardi, M.Y.: Comparator automata in quantitative verification. In: Baier, C., Dal Lago, U. (eds.) FoSSaCS 2018. LNCS, vol. 10803, pp. 420\u2013437. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89366-2_23"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Cern\u00fd, P., Henzinger, T.A.: From boolean to quantitative synthesis. In: International Conference on Embedded Software, EMSOFT 2011, pp. 149\u2013154 (2011)","DOI":"10.1145\/2038642.2038666"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-87531-4_28","volume-title":"Computer Science Logic","author":"K Chatterjee","year":"2008","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 385\u2013400. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87531-4_28"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-02930-1_1","volume-title":"Automata, Languages and Programming","author":"K Chatterjee","year":"2009","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: A Survey of stochastic games with limsup and liminf objectives. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 1\u201315. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02930-1_1"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.ic.2016.10.006","volume":"254","author":"K Chatterjee","year":"2017","unstructured":"Chatterjee, K., Henzinger, T.A., Otop, J., Velner, Y.: Quantitative fair simulation games. Inf. Comput. 254, 143\u2013166 (2017)","journal-title":"Inf. Comput."},{"key":"23_CR6","unstructured":"Chatterjee, K., Henzinger, T.A., Piterman, N.: Algorithms for B\u00fcchi games. arXiv preprint. arXiv:0805.2620 (2008)"},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3078622","volume":"2","author":"SR Chhetri","year":"2017","unstructured":"Chhetri, S.R., Canedo, A., Faruque, M.A.A.: Confidentiality breach through acoustic side-channel in cyber-physical additive manufacturing systems. ACM Trans. Cyber-Phys. Syst. 2(1), 1\u201325 (2017)","journal-title":"ACM Trans. Cyber-Phys. Syst."},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-319-41540-6_21","volume-title":"Computer Aided Verification","author":"L D\u2019Antoni","year":"2016","unstructured":"D\u2019Antoni, L., Samanta, R., Singh, R.: Qlose: program repair with quantitative objectives. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 383\u2013401. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_21"},{"key":"23_CR9","unstructured":"Dave, V., Krishna, S., Murali, V., Trivedi, A.: Optimal repair for omega-regular properties (2022). arxiv.org\/abs\/2207.13416"},{"key":"23_CR10","unstructured":"Filiot, E., Mazzocchi, N., Raskin, J., Sankaranarayanan, S., Trivedi, A.: Weighted transducers for robustness verification. In: International Conference on Concurrency Theory, CONCUR 2020, pp. 17:1\u201317:21 (2020)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Doyen, L., Chatterjee, K.: Expressiveness and closure properties for quantitative languages. In: Logic in Computer Science, Symposium on, pp. 199\u2013208 (2009)","DOI":"10.1109\/LICS.2009.16"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-642-40184-8_20","volume-title":"CONCUR 2013 \u2013 Concurrency Theory","author":"TA Henzinger","year":"2013","unstructured":"Henzinger, T.A., Otop, J.: From model checking to model measuring. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013. LNCS, vol. 8052, pp. 273\u2013287. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40184-8_20"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11513988_23","volume-title":"Computer Aided Verification","author":"B Jobstmann","year":"2005","unstructured":"Jobstmann, B., Griesmayer, A., Bloem, R.: Program repair as a game. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 226\u2013238. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11513988_23"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2011.10.009","volume":"210","author":"O Kupferman","year":"2012","unstructured":"Kupferman, O., Tamir, T.: Coping with selfish on-going behaviors. Inf. Comput. 210, 1\u201312 (2012)","journal-title":"Inf. Comput."},{"key":"23_CR15","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"ML Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming, 1st edn. John Wiley & Sons Inc., USA (1994)","edition":"1"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-319-10936-7_17","volume-title":"Static Analysis","author":"R Samanta","year":"2014","unstructured":"Samanta, R., Olivo, O., Emerson, E.A.: Cost-aware automatic program repair. In: M\u00fcller-Olm, M., Seidl, H. (eds.) SAS 2014. LNCS, vol. 8723, pp. 268\u2013284. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10936-7_17"},{"key":"23_CR17","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proceedings of the First Symposium on Logic in Computer Science, pp. 322\u2013331. IEEE Computer Society (1986)"},{"issue":"1","key":"23_CR18","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/s10703-015-0223-6","volume":"47","author":"C von Essen","year":"2015","unstructured":"von Essen, C., Jobstmann, B.: Program repair without regret. Formal Methods Syst. Des. 47(1), 26\u201350 (2015). https:\/\/doi.org\/10.1007\/s10703-015-0223-6","journal-title":"Formal Methods Syst. Des."},{"issue":"1","key":"23_CR19","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U Zwick","year":"1996","unstructured":"Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theoret. Comput. Sci. 158(1), 343\u2013359 (1996)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19992-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T10:00:52Z","timestamp":1728208852000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19992-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031199912","9783031199929"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19992-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/atva-conference.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"81","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":"21","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":"5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic, the conference was held virtually. Additional to the 26 papers, 1 invited talk is included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}