{"day":"01","ec_funded":1,"publisher":"Springer","year":"2013","editor":[{"last_name":"Piterman","full_name":"Piterman, Nir","first_name":"Nir"},{"first_name":"Scott","full_name":"Smolka, Scott","last_name":"Smolka"}],"date_published":"2013-03-01T00:00:00Z","publist_id":"3947","language":[{"iso":"eng"}],"intvolume":"      7795","title":"Structural Counter Abstraction","scopus_import":1,"series_title":"Lecture Notes in Computer Science","quality_controlled":"1","main_file_link":[{"url":"http://arise.or.at/pubpdf/Structural_Counter_Abstraction.pdf","open_access":"1"}],"oa_version":"Submitted Version","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T11:59:54Z","month":"03","citation":{"apa":"Bansal, K., Koskinen, E., Wies, T., &#38; Zufferey, D. (2013). Structural Counter Abstraction. (N. Piterman &#38; S. Smolka, Eds.). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Rome, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-642-36742-7_5\">https://doi.org/10.1007/978-3-642-36742-7_5</a>","chicago":"Bansal, Kshitij, Eric Koskinen, Thomas Wies, and Damien Zufferey. “Structural Counter Abstraction.” Edited by Nir Piterman and Scott Smolka. Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-36742-7_5\">https://doi.org/10.1007/978-3-642-36742-7_5</a>.","ista":"Bansal K, Koskinen E, Wies T, Zufferey D. 2013. Structural Counter Abstraction (eds. N. Piterman &#38; S. Smolka). 7795, 62–77.","ieee":"K. Bansal, E. Koskinen, T. Wies, and D. Zufferey, “Structural Counter Abstraction,” vol. 7795. Springer, pp. 62–77, 2013.","mla":"Bansal, Kshitij, et al. <i>Structural Counter Abstraction</i>. Edited by Nir Piterman and Scott Smolka, vol. 7795, Springer, 2013, pp. 62–77, doi:<a href=\"https://doi.org/10.1007/978-3-642-36742-7_5\">10.1007/978-3-642-36742-7_5</a>.","ama":"Bansal K, Koskinen E, Wies T, Zufferey D. Structural Counter Abstraction. Piterman N, Smolka S, eds. 2013;7795:62-77. doi:<a href=\"https://doi.org/10.1007/978-3-642-36742-7_5\">10.1007/978-3-642-36742-7_5</a>","short":"K. Bansal, E. Koskinen, T. Wies, D. Zufferey, 7795 (2013) 62–77."},"page":"62 - 77","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"status":"public","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","volume":7795,"date_updated":"2023-09-07T11:36:36Z","alternative_title":["LNCS"],"related_material":{"record":[{"status":"public","id":"1405","relation":"dissertation_contains"}]},"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Rome, Italy","start_date":"2013-03-16","end_date":"2013-03-24"},"author":[{"first_name":"Kshitij","full_name":"Bansal, Kshitij","last_name":"Bansal"},{"last_name":"Koskinen","full_name":"Koskinen, Eric","first_name":"Eric"},{"last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","full_name":"Wies, Thomas"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","first_name":"Damien"}],"doi":"10.1007/978-3-642-36742-7_5","_id":"2847","abstract":[{"lang":"eng","text":"Depth-Bounded Systems form an expressive class of well-structured transition systems. They can model a wide range of concurrent infinite-state systems including those with dynamic thread creation, dynamically changing communication topology, and complex shared heap structures. We present the first method to automatically prove fair termination of depth-bounded systems. Our method uses a numerical abstraction of the system, which we obtain by systematically augmenting an over-approximation of the system’s reachable states with a finite set of counters. This numerical abstraction can be analyzed with existing termination provers. What makes our approach unique is the way in which it exploits the well-structuredness of the analyzed system. We have implemented our work in a prototype tool and used it to automatically prove liveness properties of complex concurrent systems, including nonblocking algorithms such as Treiber’s stack and several distributed processes. Many of these examples are beyond the scope of termination analyses that are based on traditional counter abstractions."}],"publication_status":"published"}