[{"ec_funded":1,"publist_id":"1068","date_published":"2010-07-01T00:00:00Z","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"},{"last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","full_name":"Radhakrishna, Arjun"}],"date_updated":"2024-10-09T20:54:00Z","title":"GIST: A solver for probabilistic games","article_processing_charge":"No","external_id":{"arxiv":["1004.2367"]},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Springer","pubrep_id":"43","abstract":[{"lang":"eng","text":"GIST is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with ω-regular objectives; and (b) synthesizes reasonable environment assumptions for synthesis of unrealizable specifications. Our tool provides the first and efficient implementations of several reduction-based techniques to solve turn-based probabilistic games, and uses the analysis of turn-based probabilistic games for synthesizing environment assumptions for unrealizable specifications."}],"project":[{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373"}],"oa":1,"language":[{"iso":"eng"}],"month":"07","year":"2010","page":"665 - 669","alternative_title":["LNCS"],"type":"conference","conference":{"start_date":"2010-07-15","name":"CAV: Computer Aided Verification","location":"Edinburgh, UK","end_date":"2010-07-17"},"oa_version":"Submitted Version","status":"public","related_material":{"record":[{"relation":"earlier_version","id":"5393","status":"public"}]},"corr_author":"1","arxiv":1,"date_created":"2018-12-11T12:08:36Z","has_accepted_license":"1","ddc":["004"],"scopus_import":1,"_id":"4388","publication_status":"published","intvolume":"      6174","day":"01","citation":{"ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, “GIST: A solver for probabilistic games,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 665–669.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. “GIST: A Solver for Probabilistic Games,” 6174:665–69. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">https://doi.org/10.1007/978-3-642-14295-6_57</a>.","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Radhakrishna, A. (2010). GIST: A solver for probabilistic games (Vol. 6174, pp. 665–669). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">https://doi.org/10.1007/978-3-642-14295-6_57</a>","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, in:, Springer, 2010, pp. 665–669.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2010. GIST: A solver for probabilistic games. CAV: Computer Aided Verification, LNCS, vol. 6174, 665–669.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. GIST: A solver for probabilistic games. In: Vol 6174. Springer; 2010:665-669. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">10.1007/978-3-642-14295-6_57</a>","mla":"Chatterjee, Krishnendu, et al. <i>GIST: A Solver for Probabilistic Games</i>. Vol. 6174, Springer, 2010, pp. 665–69, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">10.1007/978-3-642-14295-6_57</a>."},"volume":6174,"doi":"10.1007/978-3-642-14295-6_57","file":[{"file_size":293605,"date_updated":"2020-07-14T12:46:28Z","checksum":"0b2ef8c4037ffccc6902d93081af24f7","content_type":"application/pdf","relation":"main_file","file_id":"5221","access_level":"open_access","date_created":"2018-12-12T10:16:33Z","creator":"system","file_name":"IST-2012-43-v1+1_GIST-_A_solver_for_probabilistic_games.pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:28Z"},{"oa":1,"page":"77 - 84","month":"08","year":"2010","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Digital components play a central role in the design of complex embedded systems. These components are interconnected with other, possibly analog, devices and the physical environment. This environment cannot be entirely captured and can provide inaccurate input data to the component. It is thus important for digital components to have a robust behavior, i.e. the presence of a small change in the input sequences should not result in a drastic change in the output sequences. In this paper, we study a notion of robustness for sequential circuits. However, since sequential circuits may have parts that are naturally discontinuous (e.g., digital controllers with switching behavior), we need a flexible framework that accommodates this fact and leaves discontinuous parts of the circuit out from the robustness analysis. As a consequence, we consider sequential circuits that have their input variables partitioned into two disjoint sets: control and disturbance variables. Our contributions are (1) a definition of robustness for sequential circuits as a form of continuity with respect to disturbance variables, (2) the characterization of the exact class of sequential circuits that are robust according to our definition, (3) an algorithm to decide whether a sequential circuit is robust or not."}],"pubrep_id":"44","publisher":"IEEE","date_updated":"2021-01-12T07:56:36Z","title":"Robustness of sequential circuits","author":[{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Legay, Axel","last_name":"Legay","first_name":"Axel"},{"full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan","last_name":"Nickovic"}],"publist_id":"1069","date_published":"2010-08-23T00:00:00Z","department":[{"_id":"ToHe"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"content_type":"application/pdf","relation":"main_file","file_id":"4733","file_size":159920,"date_updated":"2020-07-14T12:46:28Z","checksum":"42b2952bfc6b6974617bd554842b904a","date_created":"2018-12-12T10:09:10Z","creator":"system","file_name":"IST-2012-44-v1+1_Robustness_of_sequential_circuits.pdf","access_level":"open_access"}],"file_date_updated":"2020-07-14T12:46:28Z","quality_controlled":"1","citation":{"ieee":"L. Doyen, T. A. Henzinger, A. Legay, and D. Nickovic, “Robustness of sequential circuits,” presented at the ACSD: Application of Concurrency to System Design, 2010, pp. 77–84.","chicago":"Doyen, Laurent, Thomas A Henzinger, Axel Legay, and Dejan Nickovic. “Robustness of Sequential Circuits,” 77–84. IEEE, 2010. <a href=\"https://doi.org/10.1109/ACSD.2010.26\">https://doi.org/10.1109/ACSD.2010.26</a>.","short":"L. Doyen, T.A. Henzinger, A. Legay, D. Nickovic, in:, IEEE, 2010, pp. 77–84.","apa":"Doyen, L., Henzinger, T. A., Legay, A., &#38; Nickovic, D. (2010). Robustness of sequential circuits (pp. 77–84). Presented at the ACSD: Application of Concurrency to System Design, IEEE. <a href=\"https://doi.org/10.1109/ACSD.2010.26\">https://doi.org/10.1109/ACSD.2010.26</a>","ista":"Doyen L, Henzinger TA, Legay A, Nickovic D. 2010. Robustness of sequential circuits. ACSD: Application of Concurrency to System Design, 77–84.","ama":"Doyen L, Henzinger TA, Legay A, Nickovic D. Robustness of sequential circuits. In: IEEE; 2010:77-84. doi:<a href=\"https://doi.org/10.1109/ACSD.2010.26\">10.1109/ACSD.2010.26</a>","mla":"Doyen, Laurent, et al. <i>Robustness of Sequential Circuits</i>. IEEE, 2010, pp. 77–84, doi:<a href=\"https://doi.org/10.1109/ACSD.2010.26\">10.1109/ACSD.2010.26</a>."},"doi":"10.1109/ACSD.2010.26","scopus_import":1,"ddc":["004"],"has_accepted_license":"1","day":"23","publication_status":"published","_id":"4389","status":"public","oa_version":"Submitted Version","conference":{"name":"ACSD: Application of Concurrency to System Design"},"type":"conference","date_created":"2018-12-11T12:08:36Z"},{"volume":6174,"citation":{"chicago":"Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. “Model Checking of Linearizability of Concurrent List Implementations,” 6174:465–79. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">https://doi.org/10.1007/978-3-642-14295-6_41</a>.","ieee":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, “Model checking of linearizability of concurrent list implementations,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 465–479.","ama":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. Model checking of linearizability of concurrent list implementations. In: Vol 6174. Springer; 2010:465-479. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">10.1007/978-3-642-14295-6_41</a>","apa":"Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., &#38; Alur, R. (2010). Model checking of linearizability of concurrent list implementations (Vol. 6174, pp. 465–479). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">https://doi.org/10.1007/978-3-642-14295-6_41</a>","ista":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. 2010. Model checking of linearizability of concurrent list implementations. CAV: Computer Aided Verification, LNCS, vol. 6174, 465–479.","short":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, in:, Springer, 2010, pp. 465–479.","mla":"Cerny, Pavol, et al. <i>Model Checking of Linearizability of Concurrent List Implementations</i>. Vol. 6174, Springer, 2010, pp. 465–79, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">10.1007/978-3-642-14295-6_41</a>."},"doi":"10.1007/978-3-642-14295-6_41","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"creator":"dernst","file_name":"2010_CAV_Cerny.pdf","date_created":"2020-05-19T16:31:56Z","access_level":"open_access","file_id":"7873","content_type":"application/pdf","relation":"main_file","checksum":"2eb211ce40b3c4988bce3a3592980704","file_size":3633276,"date_updated":"2020-07-14T12:46:28Z"}],"file_date_updated":"2020-07-14T12:46:28Z","quality_controlled":"1","oa_version":"Submitted Version","status":"public","conference":{"end_date":"2010-07-17","location":"Edinburgh, UK","start_date":"2010-07-15","name":"CAV: Computer Aided Verification"},"type":"conference","alternative_title":["LNCS"],"date_created":"2018-12-11T12:08:36Z","related_material":{"record":[{"id":"5391","status":"public","relation":"earlier_version"}]},"corr_author":"1","scopus_import":"1","ddc":["000"],"has_accepted_license":"1","day":"01","intvolume":"      6174","publication_status":"published","_id":"4390","abstract":[{"text":"Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations does not stem from the number of variables or the program size, but rather from the large number of possible interleavings. These implementations are therefore prime candidates for model checking. We introduce an algorithm for verifying linearizability of singly-linked heap-based concurrent data structures. We consider a model consisting of an unbounded heap where each vertex stores an element from an unbounded data domain, with a restricted set of operations for testing and updating pointers and data elements. Our main result is that linearizability is decidable for programs that invoke a fixed number of methods, possibly in parallel. This decidable fragment covers many of the common implementation techniques — fine-grained locking, lazy synchronization, and lock-free synchronization. We also show how the technique can be used to verify optimistic implementations with the help of programmer annotations. We developed a verification tool CoLT and evaluated it on a representative sample of Java implementations of the concurrent set data structure. The tool verified linearizability of a number of implementations, found a known error in a lock-free implementation and proved that the corrected version is linearizable.","lang":"eng"}],"pubrep_id":"27","publisher":"Springer","oa":1,"year":"2010","page":"465 - 479","month":"07","language":[{"iso":"eng"}],"title":"Model checking of linearizability of concurrent list implementations","date_updated":"2024-10-21T06:03:05Z","author":[{"full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny"},{"first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"},{"orcid":"0000-0002-3197-8736","last_name":"Zufferey","first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien"},{"full_name":"Chaudhuri, Swarat","first_name":"Swarat","last_name":"Chaudhuri"},{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"}],"publist_id":"1066","date_published":"2010-07-01T00:00:00Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No"},{"year":"2010","page":"42 - 60","month":"07","language":[{"iso":"eng"}],"project":[{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"abstract":[{"lang":"eng","text":"While a boolean notion of correctness is given by a preorder on systems and properties, a quantitative notion of correctness is defined by a distance function on systems and properties, where the distance between a system and a property provides a measure of “fit” or “desirability.” In this article, we explore several ways how the simulation preorder can be generalized to a distance function. This is done by equipping the classical simulation game between a system and a property with quantitative objectives. In particular, for systems that satisfy a property, a quantitative simulation game can measure the “robustness” of the satisfaction, that is, how much the system can deviate from its nominal behavior while still satisfying the property. For systems that violate a property, a quantitative simulation game can measure the “seriousness” of the violation, that is, how much the property has to be modified so that it is satisfied by the system. These distances can be computed in polynomial time, since the computation reduces to the value problem in limit average games with constant weights. Finally, we demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes. "}],"publisher":"Springer","department":[{"_id":"ToHe"}],"series_title":"Essays in Memory of Amir Pnueli","date_updated":"2024-10-09T20:53:58Z","title":"Quantitative Simulation Games","author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna"}],"publist_id":"1064","date_published":"2010-07-29T00:00:00Z","ec_funded":1,"quality_controlled":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-642-13754-9_3","citation":{"mla":"Cerny, Pavol, et al. “Quantitative Simulation Games.” <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, edited by Zohar Manna and Doron Peled, vol. 6200, Springer, 2010, pp. 42–60, doi:<a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">10.1007/978-3-642-13754-9_3</a>.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010.Quantitative Simulation Games. In: Time For Verification: Essays in Memory of Amir Pnueli. LNCS, vol. 6200, 42–60.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2010). Quantitative Simulation Games. In Z. Manna &#38; D. Peled (Eds.), <i>Time For Verification: Essays in Memory of Amir Pnueli</i> (Vol. 6200, pp. 42–60). Springer. <a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">https://doi.org/10.1007/978-3-642-13754-9_3</a>","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Z. Manna, D. Peled (Eds.), Time For Verification: Essays in Memory of Amir Pnueli, Springer, 2010, pp. 42–60.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Quantitative Simulation Games. In: Manna Z, Peled D, eds. <i>Time For Verification: Essays in Memory of Amir Pnueli</i>. Vol 6200. Essays in Memory of Amir Pnueli. Springer; 2010:42-60. doi:<a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">10.1007/978-3-642-13754-9_3</a>","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative Simulation Games,” in <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, vol. 6200, Z. Manna and D. Peled, Eds. Springer, 2010, pp. 42–60.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Simulation Games.” In <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, edited by Zohar Manna and Doron Peled, 6200:42–60. Essays in Memory of Amir Pnueli. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">https://doi.org/10.1007/978-3-642-13754-9_3</a>."},"volume":6200,"day":"29","intvolume":"      6200","publication_status":"published","_id":"4392","scopus_import":1,"editor":[{"first_name":"Zohar","last_name":"Manna","full_name":"Manna, Zohar"},{"full_name":"Peled, Doron","last_name":"Peled","first_name":"Doron"}],"date_created":"2018-12-11T12:08:37Z","corr_author":"1","oa_version":"None","publication":"Time For Verification: Essays in Memory of Amir Pnueli","status":"public","type":"book_chapter","alternative_title":["LNCS"]},{"ec_funded":1,"department":[{"_id":"ToHe"}],"publist_id":"1065","date_published":"2010-11-01T00:00:00Z","author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"title":"Simulation distances","date_updated":"2026-06-18T18:41:23Z","project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"214373","name":"Design for Embedded Systems"}],"pubrep_id":"42","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","abstract":[{"text":"Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the implementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes.","lang":"eng"}],"language":[{"iso":"eng"}],"month":"11","page":"235 - 268","year":"2010","oa":1,"related_material":{"record":[{"relation":"earlier_version","id":"5389","status":"public"},{"relation":"later_version","status":"public","id":"3249"}]},"corr_author":"1","date_created":"2018-12-11T12:08:37Z","alternative_title":["LNCS"],"type":"conference","conference":{"name":"CONCUR: Concurrency Theory","start_date":"2010-08-31","location":"Paris, France","end_date":"2010-09-03"},"status":"public","oa_version":"Submitted Version","_id":"4393","publication_status":"published","intvolume":"      6269","day":"01","acknowledgement":"This work was partially supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","has_accepted_license":"1","ddc":["005"],"scopus_import":1,"doi":"10.1007/978-3-642-15375-4_18","volume":6269,"citation":{"mla":"Cerny, Pavol, et al. <i>Simulation Distances</i>. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–68, doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">10.1007/978-3-642-15375-4_18</a>.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2010). Simulation distances (Vol. 6269, pp. 235–268). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">https://doi.org/10.1007/978-3-642-15375-4_18</a>","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–268.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances. CONCUR: Concurrency Theory, LNCS, vol. 6269, 235–268.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Simulation distances. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:235-268. doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">10.1007/978-3-642-15375-4_18</a>","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 235–268.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances,” 6269:235–68. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">https://doi.org/10.1007/978-3-642-15375-4_18</a>."},"quality_controlled":"1","file_date_updated":"2020-07-14T12:46:28Z","file":[{"file_id":"5130","content_type":"application/pdf","relation":"main_file","checksum":"ea567903676ba8afe0507ee11313dce5","file_size":198913,"date_updated":"2020-07-14T12:46:28Z","creator":"system","file_name":"IST-2012-42-v1+1_Simulation_distances.pdf","date_created":"2018-12-12T10:15:12Z","access_level":"open_access"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"department":[{"_id":"ToHe"}],"date_published":"2010-04-21T00:00:00Z","publist_id":"1061","author":[{"full_name":"Beyer, Dirk","last_name":"Beyer","first_name":"Dirk"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Grégory","last_name":"Théoduloz","full_name":"Théoduloz, Grégory"},{"full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien"}],"date_updated":"2021-01-12T07:56:40Z","title":"Shape refinement through explicit heap analysis","language":[{"iso":"eng"}],"month":"04","year":"2010","page":"263 - 277","oa":1,"project":[{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"pubrep_id":"41","publisher":"Springer","abstract":[{"lang":"eng","text":"Shape analysis is a promising technique to prove program properties about recursive data structures. The challenge is to automatically determine the data-structure type, and to supply the shape analysis with the necessary information about the data structure. We present a stepwise approach to the selection of instrumentation predicates for a TVLA-based shape analysis, which takes us a step closer towards the fully automatic verification of data structures. The approach uses two techniques to guide the refinement of shape abstractions: (1) during program exploration, an explicit heap analysis collects sample instances of the heap structures, which are used to identify the data structures that are manipulated by the program; and (2) during abstraction refinement along an infeasible error path, we consider different possible heap abstractions and choose the coarsest one that eliminates the infeasible path. We have implemented this combined approach for automatic shape refinement as an extension of the software model checker BLAST. Example programs from a data-structure library that manipulate doubly-linked lists and trees were successfully verified by our tool."}],"_id":"4396","publication_status":"published","day":"21","intvolume":"      6013","editor":[{"full_name":"Rosenblum, David","first_name":"David","last_name":"Rosenblum"},{"full_name":"Taenzer, Gabriele","first_name":"Gabriele","last_name":"Taenzer"}],"has_accepted_license":"1","ddc":["004"],"scopus_import":1,"date_created":"2018-12-11T12:08:38Z","type":"conference","alternative_title":["LNCS"],"conference":{"location":"Paphos, Cyprus","name":"FASE: Fundamental Approaches To Software Engineering","start_date":"2010-03-20","end_date":"2010-03-28"},"oa_version":"Submitted Version","status":"public","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:29Z","file":[{"content_type":"application/pdf","relation":"main_file","file_id":"5332","file_size":312147,"date_updated":"2020-07-14T12:46:29Z","checksum":"7d26e59a9681487d7283eba337292b2c","date_created":"2018-12-12T10:18:13Z","creator":"system","file_name":"IST-2012-41-v1+1_Shape_refinement_through_explicit_heap_analysis.pdf","access_level":"open_access"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-642-12029-9_19","volume":6013,"citation":{"ama":"Beyer D, Henzinger TA, Théoduloz G, Zufferey D. Shape refinement through explicit heap analysis. In: Rosenblum D, Taenzer G, eds. Vol 6013. Springer; 2010:263-277. doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">10.1007/978-3-642-12029-9_19</a>","apa":"Beyer, D., Henzinger, T. A., Théoduloz, G., &#38; Zufferey, D. (2010). Shape refinement through explicit heap analysis. In D. Rosenblum &#38; G. Taenzer (Eds.) (Vol. 6013, pp. 263–277). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">https://doi.org/10.1007/978-3-642-12029-9_19</a>","ista":"Beyer D, Henzinger TA, Théoduloz G, Zufferey D. 2010. Shape refinement through explicit heap analysis. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 6013, 263–277.","short":"D. Beyer, T.A. Henzinger, G. Théoduloz, D. Zufferey, in:, D. Rosenblum, G. Taenzer (Eds.), Springer, 2010, pp. 263–277.","mla":"Beyer, Dirk, et al. <i>Shape Refinement through Explicit Heap Analysis</i>. Edited by David Rosenblum and Gabriele Taenzer, vol. 6013, Springer, 2010, pp. 263–77, doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">10.1007/978-3-642-12029-9_19</a>.","chicago":"Beyer, Dirk, Thomas A Henzinger, Grégory Théoduloz, and Damien Zufferey. “Shape Refinement through Explicit Heap Analysis.” edited by David Rosenblum and Gabriele Taenzer, 6013:263–77. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">https://doi.org/10.1007/978-3-642-12029-9_19</a>.","ieee":"D. Beyer, T. A. Henzinger, G. Théoduloz, and D. Zufferey, “Shape refinement through explicit heap analysis,” presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus, 2010, vol. 6013, pp. 263–277."}},{"file_date_updated":"2020-07-14T12:46:35Z","quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file":[{"date_created":"2018-12-12T10:08:29Z","file_name":"IST-2018-948-v1+1_2011_Cerny_Expressiveness_of.pdf","creator":"system","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"4690","date_updated":"2020-07-14T12:46:35Z","file_size":492344,"checksum":"5845be5aa19791830f7407d8853f2df0"}],"doi":"10.4230/LIPIcs.FSTTCS.2010.1","volume":8,"citation":{"ieee":"R. Alur and P. Cerny, “Expressiveness of streaming string transducers,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 1–12.","chicago":"Alur, Rajeev, and Pavol Cerny. “Expressiveness of Streaming String Transducers,” 8:1–12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1</a>.","mla":"Alur, Rajeev, and Pavol Cerny. <i>Expressiveness of Streaming String Transducers</i>. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">10.4230/LIPIcs.FSTTCS.2010.1</a>.","apa":"Alur, R., &#38; Cerny, P. (2010). Expressiveness of streaming string transducers (Vol. 8, pp. 1–12). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1</a>","short":"R. Alur, P. Cerny, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12.","ista":"Alur R, Cerny P. 2010. Expressiveness of streaming string transducers. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 1–12.","ama":"Alur R, Cerny P. Expressiveness of streaming string transducers. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:1-12. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">10.4230/LIPIcs.FSTTCS.2010.1</a>"},"intvolume":"         8","day":"01","publication_status":"published","_id":"488","scopus_import":"1","ddc":["005"],"has_accepted_license":"1","date_created":"2018-12-11T11:46:45Z","corr_author":"1","oa_version":"Published Version","status":"public","conference":{"start_date":"2010-12-15","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","location":"Chennai, India","end_date":"2010-12-18"},"alternative_title":["LIPIcs"],"type":"conference","page":"1 - 12","month":"01","year":"2010","language":[{"iso":"eng"}],"isi":1,"oa":1,"abstract":[{"text":"Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and uses a finite set of variables that range over strings from the output alphabet. At every step, the transducer processes an input symbol, and updates all the variables in parallel using assignments whose right-hand-sides are concatenations of output symbols and variables with the restriction that a variable can be used at most once in a right-hand-side expression. It has been shown that streaming string transducers operating on strings over infinite data domains are of interest in algorithmic verification of list-processing programs, as they lead to PSPACE decision procedures for checking pre/post conditions and for checking semantic equivalence, for a well-defined class of heap-manipulating programs. In order to understand the theoretical expressiveness of streaming transducers, we focus on streaming transducers processing strings over finite alphabets, given the existence of a robust and well-studied class of &quot;regular&quot; transductions for this case. Such regular transductions can be defined either by two-way deterministic finite-state transducers, or using a logical MSO-based characterization. Our main result is that the expressiveness of streaming string transducers coincides exactly with this class of regular transductions. ","lang":"eng"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","pubrep_id":"948","department":[{"_id":"ToHe"}],"external_id":{"isi":["000310361000001"]},"article_processing_charge":"No","date_updated":"2025-09-30T09:49:32Z","title":"Expressiveness of streaming string transducers","author":[{"last_name":"Alur","first_name":"Rajeev","full_name":"Alur, Rajeev"},{"first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","full_name":"Cerny, Pavol"}],"publist_id":"7331","date_published":"2010-01-01T00:00:00Z","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"}},{"quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.1007/s10703-010-0102-0","citation":{"ieee":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, and T. Wies, “Doomed program points,” <i>Formal Methods in System Design</i>, vol. 37, no. 2–3. Springer, pp. 171–199, 2010.","chicago":"Hoenicke, Jochen, Kari Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “Doomed Program Points.” <i>Formal Methods in System Design</i>. Springer, 2010. <a href=\"https://doi.org/10.1007/s10703-010-0102-0\">https://doi.org/10.1007/s10703-010-0102-0</a>.","ista":"Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. 2010. Doomed program points. Formal Methods in System Design. 37(2–3), 171–199.","apa":"Hoenicke, J., Leino, K., Podelski, A., Schäf, M., &#38; Wies, T. (2010). Doomed program points. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-010-0102-0\">https://doi.org/10.1007/s10703-010-0102-0</a>","short":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, T. Wies, Formal Methods in System Design 37 (2010) 171–199.","ama":"Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. Doomed program points. <i>Formal Methods in System Design</i>. 2010;37(2-3):171-199. doi:<a href=\"https://doi.org/10.1007/s10703-010-0102-0\">10.1007/s10703-010-0102-0</a>","mla":"Hoenicke, Jochen, et al. “Doomed Program Points.” <i>Formal Methods in System Design</i>, vol. 37, no. 2–3, Springer, 2010, pp. 171–99, doi:<a href=\"https://doi.org/10.1007/s10703-010-0102-0\">10.1007/s10703-010-0102-0</a>."},"volume":37,"publication_status":"published","intvolume":"        37","day":"01","_id":"533","scopus_import":"1","date_created":"2018-12-11T11:47:01Z","corr_author":"1","publication":"Formal Methods in System Design","oa_version":"None","status":"public","type":"journal_article","page":"171 - 199","year":"2010","month":"12","language":[{"iso":"eng"}],"isi":1,"abstract":[{"lang":"eng","text":"Any programming error that can be revealed before compiling a program saves precious time for the programmer. While integrated development environments already do a good job by detecting, e.g., data-flow abnormalities, current static analysis tools suffer from false positives (&quot;noise&quot;) or require strong user interaction. We propose to avoid this deficiency by defining a new class of errors. A program fragment is doomed if its execution will inevitably fail, regardless of which state it is started in. We use a formal verification method to identify such errors fully automatically and, most significantly, without producing noise. We report on experiments with a prototype tool."}],"publisher":"Springer","department":[{"_id":"ToHe"}],"article_processing_charge":"No","external_id":{"isi":["000286631700004"]},"title":"Doomed program points","issue":"2-3","date_updated":"2025-09-30T09:48:58Z","publist_id":"7284","date_published":"2010-12-01T00:00:00Z","author":[{"full_name":"Hoenicke, Jochen","first_name":"Jochen","last_name":"Hoenicke"},{"last_name":"Leino","first_name":"Kari","full_name":"Leino, Kari"},{"full_name":"Podelski, Andreas","last_name":"Podelski","first_name":"Andreas"},{"last_name":"Schäf","first_name":"Martin","full_name":"Schäf, Martin"},{"full_name":"Wies, Thomas","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","last_name":"Wies"}]},{"status":"public","oa_version":"Published Version","alternative_title":["IST Austria Technical Report"],"type":"technical_report","date_created":"2018-12-12T11:39:03Z","related_material":{"record":[{"relation":"later_version","id":"3366","status":"public"}]},"date_updated":"2025-04-15T08:12:00Z","title":"Quantitative synthesis for concurrent programs","has_accepted_license":"1","date_published":"2010-10-07T00:00:00Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"},{"full_name":"Singh, Rohit","last_name":"Singh","first_name":"Rohit"}],"ddc":["000","005"],"publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"day":"07","_id":"5388","publication_identifier":{"issn":["2664-1690"]},"citation":{"chicago":"Chatterjee, Krishnendu, Pavol Cerny, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. <i>Quantitative Synthesis for Concurrent Programs</i>. IST Austria, 2010. <a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">https://doi.org/10.15479/AT:IST-2010-0004</a>.","ieee":"K. Chatterjee, P. Cerny, T. A. Henzinger, A. Radhakrishna, and R. Singh, <i>Quantitative synthesis for concurrent programs</i>. IST Austria, 2010.","ama":"Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. <i>Quantitative Synthesis for Concurrent Programs</i>. IST Austria; 2010. doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">10.15479/AT:IST-2010-0004</a>","apa":"Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., &#38; Singh, R. (2010). <i>Quantitative synthesis for concurrent programs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">https://doi.org/10.15479/AT:IST-2010-0004</a>","ista":"Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p.","short":"K. Chatterjee, P. Cerny, T.A. Henzinger, A. Radhakrishna, R. Singh, Quantitative Synthesis for Concurrent Programs, IST Austria, 2010.","mla":"Chatterjee, Krishnendu, et al. <i>Quantitative Synthesis for Concurrent Programs</i>. IST Austria, 2010, doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">10.15479/AT:IST-2010-0004</a>."},"abstract":[{"text":"We present an algorithmic method for the synthesis of concurrent programs that are optimal with respect to quantitative performance measures. The input consists of a sequential sketch, that is, a program that does not contain synchronization constructs, and of a parametric performance model that assigns costs to actions such as locking, context switching, and idling. The quantitative synthesis problem is to automatically introduce synchronization constructs into the sequential sketch so that both correctness is guaranteed and worst-case (or average-case) performance is optimized. Correctness is formalized as race freedom or linearizability.\r\n\r\nWe show that for worst-case performance, the problem can be modeled\r\nas a 2-player graph game with quantitative (limit-average) objectives, and\r\nfor average-case performance, as a 2 1/2 -player graph game (with probabilistic transitions). In both cases, the optimal correct program is derived from an optimal strategy in the corresponding quantitative game. We prove that the respective game problems are computationally expensive (NP-complete), and present several techniques that overcome the theoretical difficulty in cases of concurrent programs of practical interest.\r\n\r\nWe have implemented a prototype tool and used it for the automatic syn- thesis of programs that access a concurrent list. For certain parameter val- ues, our method automatically synthesizes various classical synchronization schemes for implementing a concurrent list, such as fine-grained locking or a lazy algorithm. For other parameter values, a new, hybrid synchronization style is synthesized, which uses both the lazy approach and coarse-grained locks (instead of standard fine-grained locks). The trade-off occurs because while fine-grained locking tends to decrease the cost that is due to waiting for locks, it increases cache size requirements.","lang":"eng"}],"pubrep_id":"24","publisher":"IST Austria","doi":"10.15479/AT:IST-2010-0004","oa":1,"file":[{"access_level":"open_access","date_created":"2018-12-12T11:53:53Z","file_name":"IST-2010-0004_IST-2010-0004.pdf","creator":"system","date_updated":"2020-07-14T12:46:42Z","file_size":429101,"checksum":"da38782d2388a6fa32109d10bb9bad67","relation":"main_file","content_type":"application/pdf","file_id":"5515"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"17","file_date_updated":"2020-07-14T12:46:42Z","year":"2010","month":"10","language":[{"iso":"eng"}]},{"title":"Simulation distances","date_updated":"2026-06-18T18:41:23Z","date_published":"2010-06-04T00:00:00Z","has_accepted_license":"1","author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","full_name":"Radhakrishna, Arjun"}],"ddc":["005"],"publication_status":"published","day":"04","department":[{"_id":"ToHe"}],"_id":"5389","publication_identifier":{"issn":["2664-1690"]},"oa_version":"Published Version","status":"public","type":"technical_report","alternative_title":["IST Austria Technical Report"],"date_created":"2018-12-12T11:39:03Z","related_material":{"record":[{"status":"public","id":"4393","relation":"later_version"},{"status":"public","id":"3249","relation":"later_version"}]},"oa":1,"file":[{"file_name":"IST-2010-0003_IST-2010-0003.pdf","creator":"system","date_created":"2018-12-12T11:54:25Z","access_level":"open_access","file_id":"5547","relation":"main_file","content_type":"application/pdf","checksum":"284ded99764e32a583a8ea83fcea254b","date_updated":"2020-07-14T12:46:42Z","file_size":367246}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","year":"2010","file_date_updated":"2020-07-14T12:46:42Z","page":"24","language":[{"iso":"eng"}],"citation":{"mla":"Cerny, Pavol, et al. <i>Simulation Distances</i>. IST Austria, 2010, doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0003\">10.15479/AT:IST-2010-0003</a>.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, Simulation Distances, IST Austria, 2010.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances, IST Austria, 24p.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2010). <i>Simulation distances</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2010-0003\">https://doi.org/10.15479/AT:IST-2010-0003</a>","ama":"Cerny P, Henzinger TA, Radhakrishna A. <i>Simulation Distances</i>. IST Austria; 2010. doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0003\">10.15479/AT:IST-2010-0003</a>","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, <i>Simulation distances</i>. IST Austria, 2010.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. <i>Simulation Distances</i>. IST Austria, 2010. <a href=\"https://doi.org/10.15479/AT:IST-2010-0003\">https://doi.org/10.15479/AT:IST-2010-0003</a>."},"abstract":[{"text":"Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the im- plementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes.","lang":"eng"}],"pubrep_id":"25","publisher":"IST Austria","doi":"10.15479/AT:IST-2010-0003"},{"related_material":{"record":[{"relation":"later_version","status":"public","id":"4390"}]},"date_created":"2018-12-12T11:39:04Z","type":"technical_report","alternative_title":["IST Austria Technical Report"],"status":"public","oa_version":"Published Version","publication_identifier":{"issn":["2664-1690"]},"_id":"5391","department":[{"_id":"ToHe"}],"day":"19","publication_status":"published","ddc":["004"],"author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"},{"first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien"},{"first_name":"Swarat","last_name":"Chaudhuri","full_name":"Chaudhuri, Swarat"},{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"}],"date_published":"2010-04-19T00:00:00Z","has_accepted_license":"1","date_updated":"2024-10-21T06:03:05Z","title":"Model checking of linearizability of concurrent list implementations","doi":"10.15479/AT:IST-2010-0001","publisher":"IST Austria","pubrep_id":"27","abstract":[{"lang":"eng","text":"Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations does not stem from the number of variables or the program size, but rather from the large number of possible interleavings. These implementations are therefore prime candidates for model checking. We introduce an algorithm for verifying linearizability of singly-linked heap-based concurrent data structures. We consider a model consisting of an unbounded heap where each node consists an element from an unbounded data domain, with a restricted set of operations for testing and updating pointers and data elements. Our main result is that linearizability is decidable for programs that invoke a fixed number of methods, possibly in parallel. This decidable fragment covers many of the common implementation techniques — fine-grained locking, lazy synchronization, and lock-free synchronization. We also show how the technique can be used to verify optimistic implementations with the help of programmer annotations. We developed a verification tool CoLT and evaluated it on a representative sample of Java implementations of the concurrent set data structure. The tool verified linearizability of a number of implementations, found a known error in a lock-free imple- mentation and proved that the corrected version is linearizable."}],"citation":{"mla":"Cerny, Pavol, et al. <i>Model Checking of Linearizability of Concurrent List Implementations</i>. IST Austria, 2010, doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0001\">10.15479/AT:IST-2010-0001</a>.","ama":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. <i>Model Checking of Linearizability of Concurrent List Implementations</i>. IST Austria; 2010. doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0001\">10.15479/AT:IST-2010-0001</a>","short":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, Model Checking of Linearizability of Concurrent List Implementations, IST Austria, 2010.","apa":"Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., &#38; Alur, R. (2010). <i>Model checking of linearizability of concurrent list implementations</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2010-0001\">https://doi.org/10.15479/AT:IST-2010-0001</a>","ista":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. 2010. Model checking of linearizability of concurrent list implementations, IST Austria, 27p.","chicago":"Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. <i>Model Checking of Linearizability of Concurrent List Implementations</i>. IST Austria, 2010. <a href=\"https://doi.org/10.15479/AT:IST-2010-0001\">https://doi.org/10.15479/AT:IST-2010-0001</a>.","ieee":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, <i>Model checking of linearizability of concurrent list implementations</i>. IST Austria, 2010."},"language":[{"iso":"eng"}],"month":"04","page":"27","file_date_updated":"2020-07-14T12:46:43Z","year":"2010","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","date_created":"2018-12-12T11:53:44Z","creator":"system","file_name":"IST-2010-0001_IST-2010-0001.pdf","file_size":372286,"date_updated":"2020-07-14T12:46:43Z","checksum":"986645caad7dd85a6a091488f6c646dc","content_type":"application/pdf","relation":"main_file","file_id":"5505"}],"oa":1},{"file_date_updated":"2020-07-14T12:46:14Z","quality_controlled":"1","file":[{"date_created":"2019-01-31T12:09:09Z","file_name":"Lumpability_abstractions_of_rule-based_systems.pdf","creator":"kschuh","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5904","date_updated":"2020-07-14T12:46:14Z","file_size":907155,"checksum":"eaaba991a86fff37606b0eb5196878e8"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":40,"citation":{"mla":"Feret, Jérôme, et al. <i>Lumpability Abstractions of Rule-Based Systems</i>. Vol. 40, Open Publishing Association, 2010, pp. 142–61.","ista":"Feret J, Henzinger TA, Koeppl H, Petrov T. 2010. Lumpability abstractions of rule-based systems. MECBIC: Membrane Computing and Biologically Inspired Process Calculi, EPTCS, vol. 40, 142–161.","apa":"Feret, J., Henzinger, T. A., Koeppl, H., &#38; Petrov, T. (2010). Lumpability abstractions of rule-based systems (Vol. 40, pp. 142–161). Presented at the MECBIC: Membrane Computing and Biologically Inspired Process Calculi, Jena, Germany: Open Publishing Association.","short":"J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, in:, Open Publishing Association, 2010, pp. 142–161.","ama":"Feret J, Henzinger TA, Koeppl H, Petrov T. Lumpability abstractions of rule-based systems. In: Vol 40. Open Publishing Association; 2010:142-161.","ieee":"J. Feret, T. A. Henzinger, H. Koeppl, and T. Petrov, “Lumpability abstractions of rule-based systems,” presented at the MECBIC: Membrane Computing and Biologically Inspired Process Calculi, Jena, Germany, 2010, vol. 40, pp. 142–161.","chicago":"Feret, Jérôme, Thomas A Henzinger, Heinz Koeppl, and Tatjana Petrov. “Lumpability Abstractions of Rule-Based Systems,” 40:142–61. Open Publishing Association, 2010."},"publication_status":"published","intvolume":"        40","day":"30","_id":"3719","scopus_import":1,"has_accepted_license":"1","acknowledgement":"Jérôme Feret’s contribution was partially supported by the ABSTRACTCELL ANR-Chair of Excellence. Heinz Koeppl acknowledges the support from the Swiss National Science Foundation, grant no. 200020-117975/1. Tatjana Petrov acknowledges the support from SystemsX.ch, the Swiss Initiative in Systems Biology.","ddc":["570"],"arxiv":1,"date_created":"2018-12-11T12:04:47Z","related_material":{"record":[{"id":"3168","status":"public","relation":"later_version"}]},"status":"public","oa_version":"Submitted Version","type":"conference","alternative_title":["EPTCS"],"conference":{"location":"Jena, Germany","start_date":"2010-08-23","name":"MECBIC: Membrane Computing and Biologically Inspired Process Calculi","end_date":"2010-08-23"},"year":"2010","page":"142-161","month":"10","language":[{"iso":"eng"}],"oa":1,"abstract":[{"text":"The induction of a signaling pathway is characterized by transient complex formation and mutual posttranslational modification of proteins. To faithfully capture this combinatorial process in a math- ematical model is an important challenge in systems biology. Exploiting the limited context on which most binding and modification events are conditioned, attempts have been made to reduce the com- binatorial complexity by quotienting the reachable set of molecular species, into species aggregates while preserving the deterministic semantics of the thermodynamic limit. Recently we proposed a quotienting that also preserves the stochastic semantics and that is complete in the sense that the semantics of individual species can be recovered from the aggregate semantics. In this paper we prove that this quotienting yields a sufficient condition for weak lumpability and that it gives rise to a backward Markov bisimulation between the original and aggregated transition system. We illustrate the framework on a case study of the EGF/insulin receptor crosstalk.","lang":"eng"}],"publisher":"Open Publishing Association","department":[{"_id":"ToHe"},{"_id":"CaGu"}],"external_id":{"arxiv":["1011.0496"]},"title":"Lumpability abstractions of rule-based systems","date_updated":"2026-06-18T18:39:27Z","publist_id":"2511","date_published":"2010-10-30T00:00:00Z","author":[{"last_name":"Feret","first_name":"Jérôme","full_name":"Feret, Jérôme"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Koeppl","first_name":"Heinz","full_name":"Koeppl, Heinz"},{"first_name":"Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9041-0905","last_name":"Petrov","full_name":"Petrov, Tatjana"}]},{"citation":{"mla":"Wolf, Verena, et al. “Solving the Chemical Master Equation Using Sliding Windows.” <i>BMC Systems Biology</i>, vol. 4, no. 42, BioMed Central, 2010, pp. 1–19, doi:<a href=\"https://doi.org/10.1186/1752-0509-4-42\">10.1186/1752-0509-4-42</a>.","short":"V. Wolf, R. Goel, M. Mateescu, T.A. Henzinger, BMC Systems Biology 4 (2010) 1–19.","apa":"Wolf, V., Goel, R., Mateescu, M., &#38; Henzinger, T. A. (2010). Solving the chemical master equation using sliding windows. <i>BMC Systems Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1752-0509-4-42\">https://doi.org/10.1186/1752-0509-4-42</a>","ista":"Wolf V, Goel R, Mateescu M, Henzinger TA. 2010. Solving the chemical master equation using sliding windows. BMC Systems Biology. 4(42), 1–19.","ama":"Wolf V, Goel R, Mateescu M, Henzinger TA. Solving the chemical master equation using sliding windows. <i>BMC Systems Biology</i>. 2010;4(42):1-19. doi:<a href=\"https://doi.org/10.1186/1752-0509-4-42\">10.1186/1752-0509-4-42</a>","ieee":"V. Wolf, R. Goel, M. Mateescu, and T. A. Henzinger, “Solving the chemical master equation using sliding windows,” <i>BMC Systems Biology</i>, vol. 4, no. 42. BioMed Central, pp. 1–19, 2010.","chicago":"Wolf, Verena, Rushil Goel, Maria Mateescu, and Thomas A Henzinger. “Solving the Chemical Master Equation Using Sliding Windows.” <i>BMC Systems Biology</i>. BioMed Central, 2010. <a href=\"https://doi.org/10.1186/1752-0509-4-42\">https://doi.org/10.1186/1752-0509-4-42</a>."},"volume":4,"doi":"10.1186/1752-0509-4-42","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file":[{"file_name":"IST-2012-72-v1+1_Solving_the_chemical_master_equation_using_sliding_windows.pdf","creator":"system","date_created":"2018-12-12T10:16:29Z","access_level":"open_access","file_id":"5217","relation":"main_file","content_type":"application/pdf","checksum":"220239fae76f7b03c4d7f05d74ef426f","date_updated":"2020-07-14T12:46:16Z","file_size":1919130}],"file_date_updated":"2020-07-14T12:46:16Z","quality_controlled":"1","publication":"BMC Systems Biology","oa_version":"Published Version","status":"public","type":"journal_article","date_created":"2018-12-11T12:05:25Z","corr_author":"1","scopus_import":"1","ddc":["005"],"has_accepted_license":"1","acknowledgement":"This research has been partially funded by the Swiss National Science Foundation under grant 205321-111840 and by the Cluster of Excellence on Multimodal Computing and Interaction at Saarland University.","intvolume":"         4","day":"08","publication_status":"published","_id":"3834","abstract":[{"text":"Background\r\n\r\nThe chemical master equation (CME) is a system of ordinary differential equations that describes the evolution of a network of chemical reactions as a stochastic process. Its solution yields the probability density vector of the system at each point in time. Solving the CME numerically is in many cases computationally expensive or even infeasible as the number of reachable states can be very large or infinite. We introduce the sliding window method, which computes an approximate solution of the CME by performing a sequence of local analysis steps. In each step, only a manageable subset of states is considered, representing a &quot;window&quot; into the state space. In subsequent steps, the window follows the direction in which the probability mass moves, until the time period of interest has elapsed. We construct the window based on a deterministic approximation of the future behavior of the system by estimating upper and lower bounds on the populations of the chemical species.\r\nResults\r\n\r\nIn order to show the effectiveness of our approach, we apply it to several examples previously described in the literature. The experimental results show that the proposed method speeds up the analysis considerably, compared to a global analysis, while still providing high accuracy.\r\n\r\n\r\nConclusions\r\n\r\nThe sliding window method is a novel approach to address the performance problems of numerical algorithms for the solution of the chemical master equation. The method efficiently approximates the probability distributions at the time points of interest for a variety of chemically reacting systems, including systems for which no upper bound on the population sizes of the chemical species is known a priori.","lang":"eng"}],"pubrep_id":"72","publisher":"BioMed Central","oa":1,"month":"04","year":"2010","page":"1 - 19","isi":1,"language":[{"iso":"eng"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2025-09-30T09:37:27Z","issue":"42","title":"Solving the chemical master equation using sliding windows","author":[{"last_name":"Wolf","first_name":"Verena","full_name":"Wolf, Verena"},{"full_name":"Goel, Rushil","first_name":"Rushil","last_name":"Goel"},{"id":"3B43276C-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","last_name":"Mateescu","full_name":"Mateescu, Maria"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"2374","date_published":"2010-04-08T00:00:00Z","department":[{"_id":"ToHe"}],"external_id":{"isi":["000277612700001"]},"article_processing_charge":"No"},{"status":"public","oa_version":"Submitted Version","type":"conference","conference":{"end_date":"2010-10-01","start_date":"2010-09-29","name":"CMSB: Computational Methods in Systems Biology","location":"Trento, Italy"},"date_created":"2018-12-11T12:05:27Z","scopus_import":1,"has_accepted_license":"1","ddc":["004"],"publication_status":"published","day":"29","_id":"3838","citation":{"chicago":"Henzinger, Thomas A, Maria Mateescu, Linar Mikeev, and Verena Wolf. “Hybrid Numerical Solution of the Chemical Master Equation,” 55–65. Springer, 2010. <a href=\"https://doi.org/10.1145/1839764.1839772\">https://doi.org/10.1145/1839764.1839772</a>.","ieee":"T. A. Henzinger, M. Mateescu, L. Mikeev, and V. Wolf, “Hybrid numerical solution of the chemical master equation,” presented at the CMSB: Computational Methods in Systems Biology, Trento, Italy, 2010, pp. 55–65.","mla":"Henzinger, Thomas A., et al. <i>Hybrid Numerical Solution of the Chemical Master Equation</i>. Springer, 2010, pp. 55–65, doi:<a href=\"https://doi.org/10.1145/1839764.1839772\">10.1145/1839764.1839772</a>.","ama":"Henzinger TA, Mateescu M, Mikeev L, Wolf V. Hybrid numerical solution of the chemical master equation. In: Springer; 2010:55-65. doi:<a href=\"https://doi.org/10.1145/1839764.1839772\">10.1145/1839764.1839772</a>","short":"T.A. Henzinger, M. Mateescu, L. Mikeev, V. Wolf, in:, Springer, 2010, pp. 55–65.","apa":"Henzinger, T. A., Mateescu, M., Mikeev, L., &#38; Wolf, V. (2010). Hybrid numerical solution of the chemical master equation (pp. 55–65). Presented at the CMSB: Computational Methods in Systems Biology, Trento, Italy: Springer. <a href=\"https://doi.org/10.1145/1839764.1839772\">https://doi.org/10.1145/1839764.1839772</a>","ista":"Henzinger TA, Mateescu M, Mikeev L, Wolf V. 2010. Hybrid numerical solution of the chemical master equation. CMSB: Computational Methods in Systems Biology, 55–65."},"doi":"10.1145/1839764.1839772","file":[{"date_created":"2018-12-12T10:15:55Z","file_name":"IST-2012-68-v1+1_Hybrid_Numerical_Solution_of_the_Chemical_Master_Equation.pdf","creator":"system","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5179","date_updated":"2020-07-14T12:46:16Z","file_size":671790,"checksum":"81cb6f0babd97151b171d1ce86582831"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:16Z","quality_controlled":"1","title":"Hybrid numerical solution of the chemical master equation","date_updated":"2021-01-12T07:52:33Z","date_published":"2010-09-29T00:00:00Z","publist_id":"2356","author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Mateescu","first_name":"Maria","full_name":"Mateescu, Maria"},{"full_name":"Mikeev, Linar","last_name":"Mikeev","first_name":"Linar"},{"first_name":"Verena","last_name":"Wolf","full_name":"Wolf, Verena"}],"department":[{"_id":"ToHe"}],"abstract":[{"text":"We present a numerical approximation technique for the analysis of continuous-time Markov chains that describe net- works of biochemical reactions and play an important role in the stochastic modeling of biological systems. Our approach is based on the construction of a stochastic hybrid model in which certain discrete random variables of the original Markov chain are approximated by continuous deterministic variables. We compute the solution of the stochastic hybrid model using a numerical algorithm that discretizes time and in each step performs a mutual update of the transient prob- ability distribution of the discrete stochastic variables and the values of the continuous deterministic variables. We im- plemented the algorithm and we demonstrate its usefulness and efficiency on several case studies from systems biology.","lang":"eng"}],"publisher":"Springer","pubrep_id":"68","oa":1,"page":"55 - 65","month":"09","year":"2010","language":[{"iso":"eng"}]},{"citation":{"ieee":"T. A. Henzinger, T. Hottelier, L. Kovács, and A. Voronkov, “Invariant and type inference for matrices,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain, 2010, vol. 5944, pp. 163–179.","chicago":"Henzinger, Thomas A, Thibaud Hottelier, Laura Kovács, and Andrei Voronkov. “Invariant and Type Inference for Matrices,” 5944:163–79. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-11319-2_14\">https://doi.org/10.1007/978-3-642-11319-2_14</a>.","short":"T.A. Henzinger, T. Hottelier, L. Kovács, A. Voronkov, in:, Springer, 2010, pp. 163–179.","apa":"Henzinger, T. A., Hottelier, T., Kovács, L., &#38; Voronkov, A. (2010). Invariant and type inference for matrices (Vol. 5944, pp. 163–179). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-642-11319-2_14\">https://doi.org/10.1007/978-3-642-11319-2_14</a>","ista":"Henzinger TA, Hottelier T, Kovács L, Voronkov A. 2010. Invariant and type inference for matrices. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 5944, 163–179.","ama":"Henzinger TA, Hottelier T, Kovács L, Voronkov A. Invariant and type inference for matrices. In: Vol 5944. Springer; 2010:163-179. doi:<a href=\"https://doi.org/10.1007/978-3-642-11319-2_14\">10.1007/978-3-642-11319-2_14</a>","mla":"Henzinger, Thomas A., et al. <i>Invariant and Type Inference for Matrices</i>. Vol. 5944, Springer, 2010, pp. 163–79, doi:<a href=\"https://doi.org/10.1007/978-3-642-11319-2_14\">10.1007/978-3-642-11319-2_14</a>."},"volume":5944,"doi":"10.1007/978-3-642-11319-2_14","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2018-12-12T10:13:09Z","creator":"system","file_name":"IST-2012-69-v1+1_Invariant_and_type_inference_for_matrices.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"4989","file_size":251265,"date_updated":"2020-07-14T12:46:16Z","checksum":"da69b13a2d9a7a316c909e09c1090cef"}],"file_date_updated":"2020-07-14T12:46:16Z","quality_controlled":"1","status":"public","oa_version":"Submitted Version","conference":{"end_date":"2010-01-19","location":"Madrid, Spain","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","start_date":"2010-01-17"},"alternative_title":["LNCS"],"type":"conference","date_created":"2018-12-11T12:05:27Z","scopus_import":1,"ddc":["005"],"acknowledgement":"The research was supported by the Swiss NSF.","has_accepted_license":"1","day":"01","intvolume":"      5944","publication_status":"published","_id":"3839","abstract":[{"lang":"eng","text":"We present a loop property generation method for loops iterating over multi-dimensional arrays. When used on matrices, our method is able to infer their shapes (also called types), such as upper-triangular, diagonal, etc. To gen- erate loop properties, we first transform a nested loop iterating over a multi- dimensional array into an equivalent collection of unnested loops. Then, we in- fer quantified loop invariants for each unnested loop using a generalization of a recurrence-based invariant generation technique. These loop invariants give us conditions on matrices from which we can derive matrix types automatically us- ing theorem provers. Invariant generation is implemented in the software package Aligator and types are derived by theorem provers and SMT solvers, including Vampire and Z3. When run on the Java matrix package JAMA, our tool was able to infer automatically all matrix types describing the matrix shapes guaranteed by JAMA’s API."}],"pubrep_id":"69","publisher":"Springer","oa":1,"month":"01","page":"163 - 179","year":"2010","language":[{"iso":"eng"}],"title":"Invariant and type inference for matrices","date_updated":"2021-01-12T07:52:33Z","author":[{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Hottelier, Thibaud","first_name":"Thibaud","last_name":"Hottelier"},{"last_name":"Kovács","first_name":"Laura","full_name":"Kovács, Laura"},{"full_name":"Voronkov, Andrei","last_name":"Voronkov","first_name":"Andrei"}],"publist_id":"2357","date_published":"2010-01-01T00:00:00Z","department":[{"_id":"ToHe"}]},{"abstract":[{"lang":"eng","text":"Classical formalizations of systems and properties are boolean: given a system and a property, the property is either true or false of the system. Correspondingly, classical methods for system analysis determine the truth value of a property, preferably giving a proof if the property is true, and a counterexample if the property is false; classical methods for system synthesis construct a system for which a property is true; classical methods for system transformation, composition, and abstraction aim to preserve the truth of properties. The boolean view is prevalent even if the system, the property, or both refer to numerical quantities, such as the times or probabilities of events. For example, a timed automaton either satisfies or violates a formula of a real-time logic; a stochastic process either satisfies or violates a formula of a probabilistic logic. The classical black-and-white view partitions the world into \"correct\" and \"incorrect\" systems, offering few nuances. In reality, of several systems that satisfy a property in the boolean sense, often some are more desirable than others, and of the many systems that violate a property, usually some are less objectionable than others. For instance, among the systems that satisfy the response property that every request be granted, we may prefer systems that grant requests quickly (the quicker, the better), or we may prefer systems that issue few unnecessary grants (the fewer, the better); and among the systems that violate the response property, we may prefer systems that serve many initial requests (the more, the better), or we may prefer systems that serve many requests in the long run (the greater the fraction of served to unserved requests, the better). Formally, while a boolean notion of correctness is given by a preorder on systems and properties, a quantitative notion of correctness is defined by a directed metric on systems and properties, where the distance between a system and a property provides a measure of \"fit\" or \"desirability.\" There are many ways how such distances can be defined. In a linear-time framework, one assigns numerical values to individual behaviors before assigning values to systems and properties, which are sets of behaviors. For example, the value of a single behavior may be a discounted value, which is largely determined by a prefix of the behavior, e.g., by the number of requests that are granted before the first request that is not granted; or a limit value, which is independent of any finite prefix. A limit value may be an average, such as the average response time over an infinite sequence of requests and grants, or a supremum, such as the worst-case response time. Similarly, the value of a set of behaviors may be an extremum or an average across the values of all behaviors in the set: in this way one can measure the worst of all possible average-case response times, or the average of all possible worst-case response times, etc. Accordingly, the distance between two sets of behaviors may be defined as the worst or average difference between the values of corresponding behaviors. In summary, we propagate replacing boolean specifications for the correctness of systems with quantitative measures for the desirability of systems. In quantitative analysis, the aim is to compute the distance between a system and a property (or between two systems, or two properties); in quantitative synthesis, the objective is to construct a system that has minimal distance from a given property. Multiple quantitative measures can be prioritized (e.g., combined lexicographically into a single measure) or studied along the Pareto curve. Quantitative transformations, compositions, and abstractions of systems are useful if they allow us to bound the induced change in distance from a property. We present some initial results in some of these directions. We also give some potential applications, which not only generalize tradiditional correctness concerns in the functional, timed, and probabilistic domains, but also capture such system measures as resource use, performance, cost, reliability, and robustness."}],"publisher":"ACM","month":"01","page":"157 - 158","year":"2010","language":[{"iso":"eng"}],"isi":1,"issue":"1","date_updated":"2025-09-30T09:36:44Z","title":"From boolean to quantitative notions of correctness","date_published":"2010-01-17T00:00:00Z","publist_id":"2354","author":[{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"ToHe"}],"article_processing_charge":"No","external_id":{"isi":["000281053800014"]},"citation":{"ama":"Henzinger TA. From boolean to quantitative notions of correctness. In: Vol 45. ACM; 2010:157-158. doi:<a href=\"https://doi.org/10.1145/1706299.1706319\">10.1145/1706299.1706319</a>","short":"T.A. Henzinger, in:, ACM, 2010, pp. 157–158.","ista":"Henzinger TA. 2010. From boolean to quantitative notions of correctness. POPL: Principles of Programming Languages vol. 45, 157–158.","apa":"Henzinger, T. A. (2010). From boolean to quantitative notions of correctness (Vol. 45, pp. 157–158). Presented at the POPL: Principles of Programming Languages, Madrid, Spain: ACM. <a href=\"https://doi.org/10.1145/1706299.1706319\">https://doi.org/10.1145/1706299.1706319</a>","mla":"Henzinger, Thomas A. <i>From Boolean to Quantitative Notions of Correctness</i>. Vol. 45, no. 1, ACM, 2010, pp. 157–58, doi:<a href=\"https://doi.org/10.1145/1706299.1706319\">10.1145/1706299.1706319</a>.","chicago":"Henzinger, Thomas A. “From Boolean to Quantitative Notions of Correctness,” 45:157–58. ACM, 2010. <a href=\"https://doi.org/10.1145/1706299.1706319\">https://doi.org/10.1145/1706299.1706319</a>.","ieee":"T. A. Henzinger, “From boolean to quantitative notions of correctness,” presented at the POPL: Principles of Programming Languages, Madrid, Spain, 2010, vol. 45, no. 1, pp. 157–158."},"volume":45,"doi":"10.1145/1706299.1706319","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","status":"public","oa_version":"None","type":"conference","conference":{"location":"Madrid, Spain","name":"POPL: Principles of Programming Languages","start_date":"2010-01-17","end_date":"2010-01-23"},"date_created":"2018-12-11T12:05:27Z","corr_author":"1","scopus_import":"1","acknowledgement":"This talk surveys joint work with Roderick Bloem, Krishnendu Chatterjee, Laurent Doyen, and Barbara Jobstmann.","publication_status":"published","day":"17","intvolume":"        45","_id":"3840"},{"oa":1,"page":"441 - 452","month":"11","year":"2010","language":[{"iso":"eng"}],"isi":1,"abstract":[{"lang":"eng","text":"Within systems biology there is an increasing interest in the stochastic behavior of biochemical reaction networks. An appropriate stochastic description is provided by the chemical master equation, which represents a continuous-time Markov chain (CTMC). The uniformization technique is an efficient method to compute probability distributions of a CTMC if the number of states is manageable. However, the size of a CTMC that represents a biochemical reaction network is usually far beyond what is feasible. In this paper we present an on-the-fly variant of uniformization, where we improve the original algorithm at the cost of a small approximation error. By means of several examples, we show that our approach is particularly well-suited for biochemical reaction networks."}],"pubrep_id":"66","publisher":"Institution of Engineering and Technology","date_updated":"2025-09-30T09:54:51Z","title":"Fast adaptive uniformization of the chemical master equation","issue":"6","author":[{"first_name":"Frédéric","last_name":"Didier","full_name":"Didier, Frédéric"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Maria","last_name":"Mateescu","full_name":"Mateescu, Maria"},{"first_name":"Verena","last_name":"Wolf","full_name":"Wolf, Verena"}],"publist_id":"2349","date_published":"2010-11-15T00:00:00Z","department":[{"_id":"ToHe"}],"external_id":{"isi":["000284108800011"]},"article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file":[{"access_level":"open_access","file_name":"IST-2012-66-v1+1_Fast_adaptive_uniformization_of_the_chemical_master_equation.pdf","creator":"system","date_created":"2018-12-12T10:17:02Z","checksum":"9a3bde48f43203991a0b3c6a277c2f5b","date_updated":"2020-07-14T12:46:16Z","file_size":222890,"file_id":"5254","relation":"main_file","content_type":"application/pdf"}],"file_date_updated":"2020-07-14T12:46:16Z","quality_controlled":"1","volume":4,"citation":{"chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Fast Adaptive Uniformization of the Chemical Master Equation.” <i>IET Systems Biology</i>. Institution of Engineering and Technology, 2010. <a href=\"https://doi.org/10.1049/iet-syb.2010.0005\">https://doi.org/10.1049/iet-syb.2010.0005</a>.","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Fast adaptive uniformization of the chemical master equation,” <i>IET Systems Biology</i>, vol. 4, no. 6. Institution of Engineering and Technology, pp. 441–452, 2010.","mla":"Didier, Frédéric, et al. “Fast Adaptive Uniformization of the Chemical Master Equation.” <i>IET Systems Biology</i>, vol. 4, no. 6, Institution of Engineering and Technology, 2010, pp. 441–52, doi:<a href=\"https://doi.org/10.1049/iet-syb.2010.0005\">10.1049/iet-syb.2010.0005</a>.","ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. Fast adaptive uniformization of the chemical master equation. <i>IET Systems Biology</i>. 2010;4(6):441-452. doi:<a href=\"https://doi.org/10.1049/iet-syb.2010.0005\">10.1049/iet-syb.2010.0005</a>","apa":"Didier, F., Henzinger, T. A., Mateescu, M., &#38; Wolf, V. (2010). Fast adaptive uniformization of the chemical master equation. <i>IET Systems Biology</i>. Institution of Engineering and Technology. <a href=\"https://doi.org/10.1049/iet-syb.2010.0005\">https://doi.org/10.1049/iet-syb.2010.0005</a>","ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2010. Fast adaptive uniformization of the chemical master equation. IET Systems Biology. 4(6), 441–452.","short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, IET Systems Biology 4 (2010) 441–452."},"doi":"10.1049/iet-syb.2010.0005","scopus_import":"1","ddc":["570"],"has_accepted_license":"1","intvolume":"         4","day":"15","publication_status":"published","_id":"3842","oa_version":"Submitted Version","publication":"IET Systems Biology","status":"public","type":"journal_article","date_created":"2018-12-11T12:05:28Z","related_material":{"record":[{"relation":"earlier_version","id":"3843","status":"public"}]}},{"doi":"10.1007/978-3-642-16242-8_25","citation":{"ieee":"T. A. Henzinger, T. Hottelier, L. Kovács, and A. Rybalchenko, “Aligators for arrays,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia, 2010, vol. 6397, pp. 348–356.","chicago":"Henzinger, Thomas A, Thibaud Hottelier, Laura Kovács, and Andrey Rybalchenko. “Aligators for Arrays,” 6397:348–56. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-16242-8_25\">https://doi.org/10.1007/978-3-642-16242-8_25</a>.","mla":"Henzinger, Thomas A., et al. <i>Aligators for Arrays</i>. Vol. 6397, Springer, 2010, pp. 348–56, doi:<a href=\"https://doi.org/10.1007/978-3-642-16242-8_25\">10.1007/978-3-642-16242-8_25</a>.","apa":"Henzinger, T. A., Hottelier, T., Kovács, L., &#38; Rybalchenko, A. (2010). Aligators for arrays (Vol. 6397, pp. 348–356). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-16242-8_25\">https://doi.org/10.1007/978-3-642-16242-8_25</a>","short":"T.A. Henzinger, T. Hottelier, L. Kovács, A. Rybalchenko, in:, Springer, 2010, pp. 348–356.","ista":"Henzinger TA, Hottelier T, Kovács L, Rybalchenko A. 2010. Aligators for arrays. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 6397, 348–356.","ama":"Henzinger TA, Hottelier T, Kovács L, Rybalchenko A. Aligators for arrays. In: Vol 6397. Springer; 2010:348-356. doi:<a href=\"https://doi.org/10.1007/978-3-642-16242-8_25\">10.1007/978-3-642-16242-8_25</a>"},"volume":6397,"quality_controlled":"1","file_date_updated":"2020-07-14T12:46:17Z","file":[{"access_level":"open_access","creator":"system","file_name":"IST-2012-64-v1+1_Aligators_for_arrays.pdf","date_created":"2018-12-12T10:10:05Z","checksum":"913af269da6710f2174f470b48ab7a82","file_size":186143,"date_updated":"2020-07-14T12:46:17Z","file_id":"4790","content_type":"application/pdf","relation":"main_file"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","corr_author":"1","date_created":"2018-12-11T12:05:29Z","alternative_title":["LNCS"],"type":"conference","conference":{"end_date":"2010-10-15","start_date":"2010-10-10","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","location":"Yogyakarta, Indonesia"},"status":"public","oa_version":"Submitted Version","_id":"3845","publication_status":"published","day":"01","intvolume":"      6397","has_accepted_license":"1","ddc":["005"],"scopus_import":"1","pubrep_id":"64","publisher":"Springer","abstract":[{"text":"This paper presents Aligators, a tool for the generation of universally quantified array invariants. Aligators leverages recurrence solving and algebraic techniques to carry out inductive reasoning over array content. The Aligators’ loop extraction module allows treatment of multi-path loops by exploiting their commutativity and serializability properties. Our experience in applying Aligators on a collection of loops from open source software projects indicates the applicability of recurrence and algebraic solving techniques for reasoning about arrays.","lang":"eng"}],"language":[{"iso":"eng"}],"isi":1,"year":"2010","page":"348 - 356","month":"10","oa":1,"article_processing_charge":"No","external_id":{"isi":["000288062700025"]},"department":[{"_id":"ToHe"}],"date_published":"2010-10-01T00:00:00Z","publist_id":"2342","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Thibaud","last_name":"Hottelier","full_name":"Hottelier, Thibaud"},{"first_name":"Laura","last_name":"Kovács","full_name":"Kovács, Laura"},{"first_name":"Andrey","last_name":"Rybalchenko","full_name":"Rybalchenko, Andrey"}],"date_updated":"2025-09-30T09:35:47Z","title":"Aligators for arrays"},{"department":[{"_id":"ToHe"},{"_id":"CaGu"}],"author":[{"last_name":"Didier","first_name":"Frédéric","full_name":"Didier, Frédéric"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Maria","last_name":"Mateescu","full_name":"Mateescu, Maria"},{"first_name":"Verena","last_name":"Wolf","full_name":"Wolf, Verena"}],"publist_id":"2339","date_published":"2010-10-14T00:00:00Z","date_updated":"2021-01-12T07:52:37Z","title":"SABRE: A tool for the stochastic analysis of biochemical reaction networks","publisher":"IEEE","pubrep_id":"63","abstract":[{"lang":"eng","text":"The importance of stochasticity within biological systems has been shown repeatedly during the last years and has raised the need for efficient stochastic tools. We present SABRE, a tool for stochastic analysis of biochemical reaction networks. SABRE implements fast adaptive uniformization (FAU), a direct numerical approximation algorithm for computing transient solutions of biochemical reaction networks. Biochemical reactions networks represent biological systems studied at a molecular level and these reactions can be modeled as transitions of a Markov chain. SABRE accepts as input the formalism of guarded commands, which it interprets either as continuous-time or as discrete-time Markov chains. Besides operating in a stochastic mode, SABRE may also perform a deterministic analysis by directly computing a mean-field approximation of the system under study. We illustrate the different functionalities of SABRE by means of biological case studies."}],"language":[{"iso":"eng"}],"year":"2010","month":"10","page":"193 - 194","oa":1,"date_created":"2018-12-11T12:05:29Z","conference":{"end_date":"2010-09-18","location":"Williamsburg, USA","start_date":"2010-09-15","name":"QEST: Quantitative Evaluation of Systems"},"type":"conference","status":"public","oa_version":"Submitted Version","_id":"3847","day":"14","publication_status":"published","ddc":["004"],"has_accepted_license":"1","scopus_import":1,"doi":"10.1109/QEST.2010.33","citation":{"short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, IEEE, 2010, pp. 193–194.","apa":"Didier, F., Henzinger, T. A., Mateescu, M., &#38; Wolf, V. (2010). SABRE: A tool for the stochastic analysis of biochemical reaction networks (pp. 193–194). Presented at the QEST: Quantitative Evaluation of Systems, Williamsburg, USA: IEEE. <a href=\"https://doi.org/10.1109/QEST.2010.33\">https://doi.org/10.1109/QEST.2010.33</a>","ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2010. SABRE: A tool for the stochastic analysis of biochemical reaction networks. QEST: Quantitative Evaluation of Systems, 193–194.","ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. SABRE: A tool for the stochastic analysis of biochemical reaction networks. In: IEEE; 2010:193-194. doi:<a href=\"https://doi.org/10.1109/QEST.2010.33\">10.1109/QEST.2010.33</a>","mla":"Didier, Frédéric, et al. <i>SABRE: A Tool for the Stochastic Analysis of Biochemical Reaction Networks</i>. IEEE, 2010, pp. 193–94, doi:<a href=\"https://doi.org/10.1109/QEST.2010.33\">10.1109/QEST.2010.33</a>.","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “SABRE: A tool for the stochastic analysis of biochemical reaction networks,” presented at the QEST: Quantitative Evaluation of Systems, Williamsburg, USA, 2010, pp. 193–194.","chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “SABRE: A Tool for the Stochastic Analysis of Biochemical Reaction Networks,” 193–94. IEEE, 2010. <a href=\"https://doi.org/10.1109/QEST.2010.33\">https://doi.org/10.1109/QEST.2010.33</a>."},"quality_controlled":"1","file_date_updated":"2020-07-14T12:46:17Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"creator":"system","file_name":"IST-2012-63-v1+1_SABRE-A_tool_for_the_stochastic_analysis_of_biochemical_reaction_networks.pdf","date_created":"2018-12-12T10:09:03Z","access_level":"open_access","file_id":"4726","content_type":"application/pdf","relation":"main_file","checksum":"38707b149d2174f01be406e794ffa849","file_size":433824,"date_updated":"2020-07-14T12:46:17Z"}]},{"file":[{"access_level":"open_access","date_created":"2018-12-12T10:15:41Z","creator":"system","file_name":"IST-2012-62-v1+1_Mean-payoff_automaton_expressions.pdf","file_size":233260,"date_updated":"2020-07-14T12:46:17Z","checksum":"4f753ae99d076553fb8733e2c8b390e2","content_type":"application/pdf","relation":"main_file","file_id":"5163"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:17Z","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Mean-Payoff Automaton Expressions</i>. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–83, doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">10.1007/978-3-642-15375-4_19</a>.","apa":"Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., &#38; Rannou, P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">https://doi.org/10.1007/978-3-642-15375-4_19</a>","short":"K. Chatterjee, L. Doyen, H. Edelsbrunner, T.A. Henzinger, P. Rannou, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–283.","ista":"Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.","ama":"Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. Mean-payoff automaton expressions. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:269-283. doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">10.1007/978-3-642-15375-4_19</a>","ieee":"K. Chatterjee, L. Doyen, H. Edelsbrunner, T. A. Henzinger, and P. Rannou, “Mean-payoff automaton expressions,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 269–283.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Herbert Edelsbrunner, Thomas A Henzinger, and Philippe Rannou. “Mean-Payoff Automaton Expressions,” 6269:269–83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">https://doi.org/10.1007/978-3-642-15375-4_19</a>."},"volume":6269,"doi":"10.1007/978-3-642-15375-4_19","has_accepted_license":"1","ddc":["000","005"],"scopus_import":1,"_id":"3853","publication_status":"published","intvolume":"      6269","day":"18","alternative_title":["LNCS"],"type":"conference","conference":{"start_date":"2010-08-31","name":"CONCUR: Concurrency Theory","location":"Paris, France","end_date":"2010-09-03"},"oa_version":"Submitted Version","status":"public","corr_author":"1","date_created":"2018-12-11T12:05:31Z","oa":1,"language":[{"iso":"eng"}],"year":"2010","month":"11","page":"269 - 283","pubrep_id":"62","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","abstract":[{"lang":"eng","text":"Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on transitions that assign to each infinite path the long-run average of the transition weights. When the mode of branching of the automaton is deterministic, nondeterministic, or alternating, the corresponding class of quantitative languages is not robust as it is not closed under the pointwise operations of max, min, sum, and numerical complement. Nondeterministic and alternating mean-payoff automata are not decidable either, as the quantitative generalization of the problems of universality and language inclusion is undecidable. We introduce a new class of quantitative languages, defined by mean-payoff automaton expressions, which is robust and decidable: it is closed under the four pointwise operations, and we show that all decision problems are decidable for this class. Mean-payoff automaton expressions subsume deterministic meanpayoff automata, and we show that they have expressive power incomparable to nondeterministic and alternating mean-payoff automata. We also present for the first time an algorithm to compute distance between two quantitative languages, and in our case the quantitative languages are given as mean-payoff automaton expressions."}],"project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"214373","name":"Design for Embedded Systems"}],"publist_id":"2328","date_published":"2010-11-18T00:00:00Z","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Rannou, Philippe","first_name":"Philippe","last_name":"Rannou"}],"title":"Mean-payoff automaton expressions","date_updated":"2024-10-09T20:54:08Z","department":[{"_id":"KrCh"},{"_id":"HeEd"},{"_id":"ToHe"}],"ec_funded":1}]