[{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Zufferey, Damien, et al. Ideal Abstractions for Well Structured Transition Systems. Vol. 7148, Springer, 2012, pp. 445–60, doi:10.1007/978-3-642-27940-9_29.","short":"D. Zufferey, T. Wies, T.A. Henzinger, in:, Springer, 2012, pp. 445–460.","ieee":"D. Zufferey, T. Wies, and T. A. Henzinger, “Ideal abstractions for well structured transition systems,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 445–460.","ama":"Zufferey D, Wies T, Henzinger TA. Ideal abstractions for well structured transition systems. In: Vol 7148. Springer; 2012:445-460. doi:10.1007/978-3-642-27940-9_29","apa":"Zufferey, D., Wies, T., & Henzinger, T. A. (2012). Ideal abstractions for well structured transition systems (Vol. 7148, pp. 445–460). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_29","chicago":"Zufferey, Damien, Thomas Wies, and Thomas A Henzinger. “Ideal Abstractions for Well Structured Transition Systems,” 7148:445–60. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_29.","ista":"Zufferey D, Wies T, Henzinger TA. 2012. Ideal abstractions for well structured transition systems. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 445–460."},"title":"Ideal abstractions for well structured transition systems","publist_id":"3406","author":[{"first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736"},{"full_name":"Wies, Thomas","last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"day":"01","year":"2012","has_accepted_license":"1","date_created":"2018-12-11T12:02:16Z","date_published":"2012-01-01T00:00:00Z","doi":"10.1007/978-3-642-27940-9_29","page":"445 - 460","acknowledgement":"This research was supported in part by the European Research Council (ERC) Advanced Investigator Grant QUAREM and by the Austrian Science Fund (FWF) project S11402-N23.","oa":1,"quality_controlled":"1","publisher":"Springer","ddc":["000","005"],"date_updated":"2023-09-07T11:36:36Z","file_date_updated":"2020-07-14T12:46:05Z","department":[{"_id":"ToHe"}],"_id":"3251","pubrep_id":"100","status":"public","conference":{"end_date":"2012-01-24","location":"Philadelphia, PA, USA","start_date":"2012-01-22","name":"VMCAI: Verification, Model Checking and Abstract Interpretation"},"type":"conference","language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:09:35Z","file_name":"IST-2012-100-v1+1_Ideal_abstractions_for_well-structured_transition_systems.pdf","creator":"system","date_updated":"2020-07-14T12:46:05Z","file_size":217104,"checksum":"f2f0d55efa32309ad1fe65a5fcaad90c","file_id":"4759","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"publication_status":"published","ec_funded":1,"volume":7148,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"1405"}]},"oa_version":"Submitted Version","abstract":[{"text":"Many infinite state systems can be seen as well-structured transition systems (WSTS), i.e., systems equipped with a well-quasi-ordering on states that is also a simulation relation. WSTS are an attractive target for formal analysis because there exist generic algorithms that decide interesting verification problems for this class. Among the most popular algorithms are acceleration-based forward analyses for computing the covering set. Termination of these algorithms can only be guaranteed for flattable WSTS. Yet, many WSTS of practical interest are not flattable and the question whether any given WSTS is flattable is itself undecidable. We therefore propose an analysis that computes the covering set and captures the essence of acceleration-based algorithms, but sacrifices precision for guaranteed termination. Our analysis is an abstract interpretation whose abstract domain builds on the ideal completion of the well-quasi-ordered state space, and a widening operator that mimics acceleration and controls the loss of precision of the analysis. We present instances of our framework for various classes of WSTS. Our experience with a prototype implementation indicates that, despite the inherent precision loss, our analysis often computes the precise covering set of the analyzed system.","lang":"eng"}],"intvolume":" 7148","month":"01","alternative_title":["LNCS"]},{"intvolume":" 7078","month":"12","publisher":"Springer","quality_controlled":"1","alternative_title":["LNCS"],"oa_version":"None","abstract":[{"lang":"eng","text":"Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively au- tomated using abstraction and refinement schemes that rely on spurious counterexamples for abstraction discovery. The analysis of counterexam- ples can be automated by a series of interpolation queries, or, alterna- tively, as a constraint solving query expressed by a set of recursion free Horn clauses. (A set of interpolation queries can be formulated as a single constraint over Horn clauses with linear dependency structure between the unknown relations.) In this paper we present an algorithm for solving recursion free Horn clauses over a combined theory of linear real/rational arithmetic and uninterpreted functions. Our algorithm performs resolu- tion to deal with the clausal structure and relies on partial solutions to deal with (non-local) instances of functionality axioms."}],"ec_funded":1,"date_created":"2018-12-11T12:02:20Z","volume":7078,"doi":"10.1007/978-3-642-25318-8_16","date_published":"2011-12-05T00:00:00Z","page":"188 - 203","language":[{"iso":"eng"}],"day":"05","year":"2011","publication_status":"published","status":"public","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"conference":{"name":"APLAS: Asian Symposium on Programming Languages and Systems","end_date":"2011-12-07","location":"Kenting, Taiwan","start_date":"2011-12-05"},"type":"conference","_id":"3264","department":[{"_id":"ToHe"}],"editor":[{"first_name":"Hongseok","last_name":"Yang","full_name":"Yang, Hongseok"}],"title":"Solving recursion-free Horn clauses over LI+UIF","publist_id":"3383","author":[{"first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","full_name":"Gupta, Ashutosh"},{"first_name":"Corneliu","full_name":"Popeea, Corneliu","last_name":"Popeea"},{"last_name":"Rybalchenko","full_name":"Rybalchenko, Andrey","first_name":"Andrey"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:42:15Z","citation":{"ista":"Gupta A, Popeea C, Rybalchenko A. 2011. Solving recursion-free Horn clauses over LI+UIF. APLAS: Asian Symposium on Programming Languages and Systems, LNCS, vol. 7078, 188–203.","chicago":"Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Solving Recursion-Free Horn Clauses over LI+UIF.” edited by Hongseok Yang, 7078:188–203. Springer, 2011. https://doi.org/10.1007/978-3-642-25318-8_16.","ama":"Gupta A, Popeea C, Rybalchenko A. Solving recursion-free Horn clauses over LI+UIF. In: Yang H, ed. Vol 7078. Springer; 2011:188-203. doi:10.1007/978-3-642-25318-8_16","apa":"Gupta, A., Popeea, C., & Rybalchenko, A. (2011). Solving recursion-free Horn clauses over LI+UIF. In H. Yang (Ed.) (Vol. 7078, pp. 188–203). Presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan: Springer. https://doi.org/10.1007/978-3-642-25318-8_16","short":"A. Gupta, C. Popeea, A. Rybalchenko, in:, H. Yang (Ed.), Springer, 2011, pp. 188–203.","ieee":"A. Gupta, C. Popeea, and A. Rybalchenko, “Solving recursion-free Horn clauses over LI+UIF,” presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan, 2011, vol. 7078, pp. 188–203.","mla":"Gupta, Ashutosh, et al. Solving Recursion-Free Horn Clauses over LI+UIF. Edited by Hongseok Yang, vol. 7078, Springer, 2011, pp. 188–203, doi:10.1007/978-3-642-25318-8_16."}},{"oa":1,"publisher":"USENIX","quality_controlled":"1","month":"06","abstract":[{"text":"Cloud computing aims to give users virtually unlimited pay-per-use computing resources without the burden of managing the underlying infrastructure. We present a new job execution environment Flextic that exploits scal- able static scheduling techniques to provide the user with a flexible pricing model, such as a tradeoff between dif- ferent degrees of execution speed and execution price, and at the same time, reduce scheduling overhead for the cloud provider. We have evaluated a prototype of Flextic on Amazon EC2 and compared it against Hadoop. For various data parallel jobs from machine learning, im- age processing, and gene sequencing that we considered, Flextic has low scheduling overhead and reduces job du- ration by up to 15% compared to Hadoop, a dynamic cloud scheduler.","lang":"eng"}],"oa_version":"Submitted Version","page":"1 - 6","date_created":"2018-12-11T12:02:33Z","date_published":"2011-06-14T00:00:00Z","publication_status":"published","year":"2011","has_accepted_license":"1","language":[{"iso":"eng"}],"day":"14","file":[{"file_id":"5333","checksum":"21a461ac004bb535c83320fe79b30375","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:18:14Z","file_name":"IST-2012-90-v1+1_Static_scheduling_in_clouds.pdf","date_updated":"2020-07-14T12:46:06Z","file_size":232770,"creator":"system"}],"conference":{"name":"HotCloud: Workshop on Hot Topics in Cloud Computing","start_date":"2011-06-14","end_date":"2011-06-15"},"type":"conference","pubrep_id":"90","status":"public","_id":"3302","publist_id":"3338","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Anmol","id":"72A86902-E99F-11E9-9F62-915534D1B916","full_name":"Singh, Anmol","last_name":"Singh"},{"full_name":"Singh, Vasu","last_name":"Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu"},{"full_name":"Wies, Thomas","last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas"},{"full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien"}],"file_date_updated":"2020-07-14T12:46:06Z","title":"Static scheduling in clouds","department":[{"_id":"ToHe"}],"citation":{"ista":"Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. 2011. Static scheduling in clouds. HotCloud: Workshop on Hot Topics in Cloud Computing, 1–6.","chicago":"Henzinger, Thomas A, Anmol Singh, Vasu Singh, Thomas Wies, and Damien Zufferey. “Static Scheduling in Clouds,” 1–6. USENIX, 2011.","ama":"Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. Static scheduling in clouds. In: USENIX; 2011:1-6.","apa":"Henzinger, T. A., Singh, A., Singh, V., Wies, T., & Zufferey, D. (2011). Static scheduling in clouds (pp. 1–6). Presented at the HotCloud: Workshop on Hot Topics in Cloud Computing, USENIX.","ieee":"T. A. Henzinger, A. Singh, V. Singh, T. Wies, and D. Zufferey, “Static scheduling in clouds,” presented at the HotCloud: Workshop on Hot Topics in Cloud Computing, 2011, pp. 1–6.","short":"T.A. Henzinger, A. Singh, V. Singh, T. Wies, D. Zufferey, in:, USENIX, 2011, pp. 1–6.","mla":"Henzinger, Thomas A., et al. Static Scheduling in Clouds. USENIX, 2011, pp. 1–6."},"date_updated":"2021-01-12T07:42:31Z","ddc":["000","005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"language":[{"iso":"eng"}],"day":"01","file":[{"date_updated":"2020-07-14T12:46:06Z","file_size":240820,"creator":"system","date_created":"2018-12-12T10:18:12Z","file_name":"IST-2012-91-v1+1_Tail_approximation_for_the_chemical_master_equation.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5331","checksum":"aa4d7a832a5419e6c0090650ebff2b9a"}],"publication_status":"published","year":"2011","has_accepted_license":"1","date_created":"2018-12-11T12:02:33Z","date_published":"2011-01-01T00:00:00Z","oa_version":"Submitted Version","abstract":[{"text":"The chemical master equation is a differential equation describing the time evolution of the probability distribution over the possible “states” of a biochemical system. The solution of this equation is of interest within the systems biology field ever since the importance of the molec- ular noise has been acknowledged. Unfortunately, most of the systems do not have analytical solutions, and numerical solutions suffer from the course of dimensionality and therefore need to be approximated. Here, we introduce the concept of tail approximation, which retrieves an approximation of the probabilities in the tail of a distribution from the total probability of the tail and its conditional expectation. This approximation method can then be used to numerically compute the solution of the chemical master equation on a subset of the state space, thus fighting the explosion of the state space, for which this problem is renowned.","lang":"eng"}],"month":"01","oa":1,"quality_controlled":"1","publisher":"Tampere International Center for Signal Processing","ddc":["005","570"],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"short":"T.A. Henzinger, M. Mateescu, in:, Tampere International Center for Signal Processing, 2011.","ieee":"T. A. Henzinger and M. Mateescu, “Tail approximation for the chemical master equation,” presented at the WCSB: Workshop on Computational Systems Biology (TICSP), 2011.","ama":"Henzinger TA, Mateescu M. Tail approximation for the chemical master equation. In: Tampere International Center for Signal Processing; 2011.","apa":"Henzinger, T. A., & Mateescu, M. (2011). Tail approximation for the chemical master equation. Presented at the WCSB: Workshop on Computational Systems Biology (TICSP), Tampere International Center for Signal Processing.","mla":"Henzinger, Thomas A., and Maria Mateescu. Tail Approximation for the Chemical Master Equation. Tampere International Center for Signal Processing, 2011.","ista":"Henzinger TA, Mateescu M. 2011. Tail approximation for the chemical master equation. WCSB: Workshop on Computational Systems Biology (TICSP).","chicago":"Henzinger, Thomas A, and Maria Mateescu. “Tail Approximation for the Chemical Master Equation.” Tampere International Center for Signal Processing, 2011."},"date_updated":"2021-01-12T07:42:30Z","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:06Z","title":"Tail approximation for the chemical master equation","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Maria","last_name":"Mateescu","full_name":"Mateescu, Maria"}],"publist_id":"3339","_id":"3301","pubrep_id":"91","status":"public","conference":{"name":"WCSB: Workshop on Computational Systems Biology (TICSP)"},"type":"conference"},{"conference":{"name":"CMSB: Computational Methods in Systems Biology","start_date":"2011-09-21","location":"Paris, France","end_date":"2011-09-23"},"type":"conference","pubrep_id":"92","status":"public","_id":"3299","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:06Z","date_updated":"2021-01-12T07:42:29Z","ddc":["000","004"],"scopus_import":1,"month":"09","abstract":[{"lang":"eng","text":"We introduce propagation models, a formalism designed to support general and efficient data structures for the transient analysis of biochemical reaction networks. We give two use cases for propagation abstract data types: the uniformization method and numerical integration. We also sketch an implementation of a propagation abstract data type, which uses abstraction to approximate states."}],"oa_version":"Submitted Version","publication_status":"published","language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:07:50Z","file_name":"IST-2012-92-v1+1_Propagation_models_for_computing_biochemical_reaction_networks.pdf","creator":"system","date_updated":"2020-07-14T12:46:06Z","file_size":255780,"file_id":"4649","checksum":"7f5c65509db1a9fb049abedd9663ed06","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Mateescu","full_name":"Mateescu, Maria","first_name":"Maria"}],"publist_id":"3341","title":"Propagation models for computing biochemical reaction networks","citation":{"ama":"Henzinger TA, Mateescu M. Propagation models for computing biochemical reaction networks. In: Springer; 2011:1-3. doi:10.1145/2037509.2037510","apa":"Henzinger, T. A., & Mateescu, M. (2011). Propagation models for computing biochemical reaction networks (pp. 1–3). Presented at the CMSB: Computational Methods in Systems Biology, Paris, France: Springer. https://doi.org/10.1145/2037509.2037510","ieee":"T. A. Henzinger and M. Mateescu, “Propagation models for computing biochemical reaction networks,” presented at the CMSB: Computational Methods in Systems Biology, Paris, France, 2011, pp. 1–3.","short":"T.A. Henzinger, M. Mateescu, in:, Springer, 2011, pp. 1–3.","mla":"Henzinger, Thomas A., and Maria Mateescu. Propagation Models for Computing Biochemical Reaction Networks. Springer, 2011, pp. 1–3, doi:10.1145/2037509.2037510.","ista":"Henzinger TA, Mateescu M. 2011. Propagation models for computing biochemical reaction networks. CMSB: Computational Methods in Systems Biology, 1–3.","chicago":"Henzinger, Thomas A, and Maria Mateescu. “Propagation Models for Computing Biochemical Reaction Networks,” 1–3. Springer, 2011. https://doi.org/10.1145/2037509.2037510."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa":1,"quality_controlled":"1","publisher":"Springer","page":"1 - 3","date_created":"2018-12-11T12:02:32Z","doi":"10.1145/2037509.2037510","date_published":"2011-09-21T00:00:00Z","year":"2011","has_accepted_license":"1","day":"21"},{"title":"Specification-centered robustness","publist_id":"3323","author":[{"full_name":"Bloem, Roderick","last_name":"Bloem","first_name":"Roderick"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Karin","last_name":"Greimel","full_name":"Greimel, Karin"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Specification-centered robustness,” in 6th IEEE International Symposium on Industrial and Embedded Systems, Vasteras, Sweden, 2011, pp. 176–185.","short":"R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, 6th IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–185.","apa":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann, B. (2011). Specification-centered robustness. In 6th IEEE International Symposium on Industrial and Embedded Systems (pp. 176–185). Vasteras, Sweden: IEEE. https://doi.org/10.1109/SIES.2011.5953660","ama":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. Specification-centered robustness. In: 6th IEEE International Symposium on Industrial and Embedded Systems. IEEE; 2011:176-185. doi:10.1109/SIES.2011.5953660","mla":"Bloem, Roderick, et al. “Specification-Centered Robustness.” 6th IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–85, doi:10.1109/SIES.2011.5953660.","ista":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2011. Specification-centered robustness. 6th IEEE International Symposium on Industrial and Embedded Systems. SIES: International Symposium on Industrial Embedded Systems, 176–185.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Specification-Centered Robustness.” In 6th IEEE International Symposium on Industrial and Embedded Systems, 176–85. IEEE, 2011. https://doi.org/10.1109/SIES.2011.5953660."},"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S11402-N23"},{"grant_number":"214373","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"doi":"10.1109/SIES.2011.5953660","date_published":"2011-07-14T00:00:00Z","date_created":"2018-12-11T12:02:38Z","page":"176 - 185","day":"14","publication":"6th IEEE International Symposium on Industrial and Embedded Systems","year":"2011","quality_controlled":"1","publisher":"IEEE","oa":1,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2021-01-12T07:42:36Z","status":"public","type":"conference","conference":{"name":" SIES: International Symposium on Industrial Embedded Systems","location":"Vasteras, Sweden","end_date":"2011-06-17","start_date":"2011-06-15"},"_id":"3316","ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","month":"07","scopus_import":1,"main_file_link":[{"url":"https://openlib.tugraz.at/download.php?id=5cb57c8a49344&location=browse","open_access":"1"}],"oa_version":"Published Version","abstract":[{"text":"In addition to being correct, a system should be robust, that is, it should behave reasonably even after receiving unexpected inputs. In this paper, we summarize two formal notions of robustness that we have introduced previously for reactive systems. One of the notions is based on assigning costs for failures on a user-provided notion of incorrect transitions in a specification. Here, we define a system to be robust if a finite number of incorrect inputs does not lead to an infinite number of incorrect outputs. We also give a more refined notion of robustness that aims to minimize the ratio of output failures to input failures. The second notion is aimed at liveness. In contrast to the previous notion, it has no concept of recovery from an error. Instead, it compares the ratio of the number of liveness constraints that the system violates to the number of liveness constraints that the environment violates.","lang":"eng"}]},{"has_accepted_license":"1","year":"2011","day":"01","publication":"ACM Transactions on Programming Languages and Systems (TOPLAS)","date_published":"2011-07-01T00:00:00Z","doi":"10.1145/1985342.1985345","date_created":"2018-12-11T12:02:51Z","quality_controlled":"1","publisher":"ACM","oa":1,"citation":{"chicago":"Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory of Synchronous Relational Interfaces.” ACM Transactions on Programming Languages and Systems (TOPLAS). ACM, 2011. https://doi.org/10.1145/1985342.1985345.","ista":"Tripakis S, Lickly B, Henzinger TA, Lee E. 2011. A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). 33(4), 14.","mla":"Tripakis, Stavros, et al. “A Theory of Synchronous Relational Interfaces.” ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 33, no. 4, 14, ACM, 2011, doi:10.1145/1985342.1985345.","apa":"Tripakis, S., Lickly, B., Henzinger, T. A., & Lee, E. (2011). A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). ACM. https://doi.org/10.1145/1985342.1985345","ama":"Tripakis S, Lickly B, Henzinger TA, Lee E. A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). 2011;33(4). doi:10.1145/1985342.1985345","short":"S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming Languages and Systems (TOPLAS) 33 (2011).","ieee":"S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “A theory of synchronous relational interfaces,” ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 33, no. 4. ACM, 2011."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"3263","author":[{"first_name":"Stavros","full_name":"Tripakis, Stavros","last_name":"Tripakis"},{"last_name":"Lickly","full_name":"Lickly, Ben","first_name":"Ben"},{"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":"Lee, Edward","last_name":"Lee","first_name":"Edward"}],"title":"A theory of synchronous relational interfaces","article_number":"14","project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"publication_status":"published","file":[{"file_id":"5235","checksum":"5d44a8aa81e33210649beae507602138","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:16:45Z","file_name":"IST-2012-85-v1+1_A_theory_of_synchronous_relational_interfaces.pdf","creator":"system","date_updated":"2020-07-14T12:46:09Z","file_size":775662}],"language":[{"iso":"eng"}],"issue":"4","volume":33,"ec_funded":1,"abstract":[{"text":"Compositional theories are crucial when designing large and complex systems from smaller components. In this work we propose such a theory for synchronous concurrent systems. Our approach follows so-called interface theories, which use game-theoretic interpretations of composition and refinement. These are appropriate for systems with distinct inputs and outputs, and explicit conditions on inputs that must be enforced during composition. Our interfaces model systems that execute in an infinite sequence of synchronous rounds. At each round, a contract must be satisfied. The contract is simply a relation specifying the set of valid input/output pairs. Interfaces can be composed by parallel, serial or feedback composition. A refinement relation between interfaces is defined, and shown to have two main properties: (1) it is preserved by composition, and (2) it is equivalent to substitutability, namely, the ability to replace an interface by another one in any context. Shared refinement and abstraction operators, corresponding to greatest lower and least upper bounds with respect to refinement, are also defined. Input-complete interfaces, that impose no restrictions on inputs, and deterministic interfaces, that produce a unique output for any legal input, are discussed as special cases, and an interesting duality between the two classes is exposed. A number of illustrative examples are provided, as well as algorithms to compute compositions, check refinement, and so on, for finite-state interfaces.","lang":"eng"}],"oa_version":"Submitted Version","scopus_import":1,"month":"07","intvolume":" 33","date_updated":"2021-01-12T07:42:52Z","ddc":["000","005"],"file_date_updated":"2020-07-14T12:46:09Z","department":[{"_id":"ToHe"}],"_id":"3353","type":"journal_article","status":"public","pubrep_id":"85"},{"publication_status":"published","file":[{"checksum":"4dc8750ab7921f51de992000b13d1b01","file_id":"4648","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:07:49Z","file_name":"IST-2012-84-v1+1_Quantitative_evaluation_of_BFT_protocols.pdf","creator":"system","date_updated":"2020-07-14T12:46:09Z","file_size":272017}],"language":[{"iso":"eng"}],"scopus_import":1,"month":"10","abstract":[{"lang":"eng","text":"Byzantine Fault Tolerant (BFT) protocols aim to improve the reliability of distributed systems. They enable systems to tolerate arbitrary failures in a bounded number of nodes. BFT protocols are usually proven correct for certain safety and liveness properties. However, recent studies have shown that the performance of state-of-the-art BFT protocols decreases drastically in the presence of even a single malicious node. This motivates a formal quantitative analysis of BFT protocols to investigate their performance characteristics under different scenarios. We present HyPerf, a new hybrid methodology based on model checking and simulation techniques for evaluating the performance of BFT protocols. We build a transition system corresponding to a BFT protocol and systematically explore the set of behaviors allowed by the protocol. We associate certain timing information with different operations in the protocol, like cryptographic operations and message transmission. After an elaborate state exploration, we use the time information to evaluate the performance characteristics of the protocol using simulation techniques. We integrate our framework in Mace, a tool for building and verifying distributed systems. We evaluate the performance of PBFT using our framework. We describe two different use-cases of our methodology. For the benign operation of the protocol, we use the time information as random variables to compute the probability distribution of the execution times. In the presence of faults, we estimate the worst-case performance of the protocol for various attacks that can be employed by malicious nodes. Our results show the importance of hybrid techniques in systematically analyzing the performance of large-scale systems."}],"oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:46:09Z","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T07:42:53Z","ddc":["000","004"],"type":"conference","conference":{"start_date":"2011-09-05","location":"Aachen, Germany","end_date":"2011-09-08","name":"QEST: Quantitative Evaluation of Systems"},"status":"public","pubrep_id":"84","_id":"3355","page":"255 - 264","doi":"10.1109/QEST.2011.40","date_published":"2011-10-13T00:00:00Z","date_created":"2018-12-11T12:02:51Z","has_accepted_license":"1","year":"2011","day":"13","publisher":"IEEE","quality_controlled":"1","oa":1,"publist_id":"3260","author":[{"first_name":"Raluca","id":"584C6850-E996-11E9-805B-F01764644770","full_name":"Halalai, Raluca","last_name":"Halalai"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","last_name":"Singh","full_name":"Singh, Vasu"}],"title":"Quantitative evaluation of BFT protocols","citation":{"ista":"Halalai R, Henzinger TA, Singh V. 2011. Quantitative evaluation of BFT protocols. QEST: Quantitative Evaluation of Systems, 255–264.","chicago":"Halalai, Raluca, Thomas A Henzinger, and Vasu Singh. “Quantitative Evaluation of BFT Protocols,” 255–64. IEEE, 2011. https://doi.org/10.1109/QEST.2011.40.","short":"R. Halalai, T.A. Henzinger, V. Singh, in:, IEEE, 2011, pp. 255–264.","ieee":"R. Halalai, T. A. Henzinger, and V. Singh, “Quantitative evaluation of BFT protocols,” presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany, 2011, pp. 255–264.","apa":"Halalai, R., Henzinger, T. A., & Singh, V. (2011). Quantitative evaluation of BFT protocols (pp. 255–264). Presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany: IEEE. https://doi.org/10.1109/QEST.2011.40","ama":"Halalai R, Henzinger TA, Singh V. Quantitative evaluation of BFT protocols. In: IEEE; 2011:255-264. doi:10.1109/QEST.2011.40","mla":"Halalai, Raluca, et al. Quantitative Evaluation of BFT Protocols. IEEE, 2011, pp. 255–64, doi:10.1109/QEST.2011.40."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"status":"public","type":"journal_article","article_number":"28","_id":"3354","title":"Qualitative concurrent parity games","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publist_id":"3262","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Luca","full_name":"De Alfaro, Luca","last_name":"De Alfaro"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T10:26:18Z","citation":{"ista":"Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 12(4), 28.","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.” ACM Transactions on Computational Logic (TOCL). ACM, 2011. https://doi.org/10.1145/1970398.1970404.","apa":"Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2011). Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/1970398.1970404","ama":"Chatterjee K, De Alfaro L, Henzinger TA. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 2011;12(4). doi:10.1145/1970398.1970404","short":"K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 12 (2011).","ieee":"K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4. ACM, 2011.","mla":"Chatterjee, Krishnendu, et al. “Qualitative Concurrent Parity Games.” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4, 28, ACM, 2011, doi:10.1145/1970398.1970404."},"month":"07","intvolume":" 12","scopus_import":1,"publisher":"ACM","quality_controlled":"1","oa_version":"None","abstract":[{"text":"We consider two-player games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. We consider ω-regular winning conditions specified as parity objectives. Both players are allowed to use randomization when choosing their moves. We study the computation of the limit-winning set of states, consisting of the states where the sup-inf value of the game for player 1 is 1: in other words, a state is limit-winning if player 1 can ensure a probability of winning arbitrarily close to 1. We show that the limit-winning set can be computed in O(n2d+2) time, where n is the size of the game structure and 2d is the number of priorities (or colors). The membership problem of whether a state belongs to the limit-winning set can be decided in NP ∩ coNP. While this complexity is the same as for the simpler class of turn-based parity games, where in each state only one of the two players has a choice of moves, our algorithms are considerably more involved than those for turn-based games. This is because concurrent games do not satisfy two of the most fundamental properties of turn-based parity games. First, in concurrent games limit-winning strategies require randomization; and second, they require infinite memory.","lang":"eng"}],"doi":"10.1145/1970398.1970404","issue":"4","date_published":"2011-07-04T00:00:00Z","volume":12,"related_material":{"record":[{"id":"2054","status":"public","relation":"later_version"}]},"date_created":"2018-12-11T12:02:51Z","day":"04","publication":"ACM Transactions on Computational Logic (TOCL)","language":[{"iso":"eng"}],"year":"2011","publication_status":"published"},{"oa_version":"None","abstract":[{"lang":"eng","text":"Exploring the connection of biology with reactive systems to better understand living systems."}],"month":"10","intvolume":" 54","quality_controlled":"1","publisher":"ACM","day":"01","publication":"Communications of the ACM","language":[{"iso":"eng"}],"publication_status":"published","year":"2011","date_published":"2011-10-01T00:00:00Z","doi":"10.1145/2001269.2001289","issue":"10","volume":54,"date_created":"2018-12-11T12:02:50Z","ec_funded":1,"page":"72 - 82","_id":"3352","status":"public","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"type":"journal_article","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Fisher, Jasmin, et al. “Biology as Reactivity.” Communications of the ACM, vol. 54, no. 10, ACM, 2011, pp. 72–82, doi:10.1145/2001269.2001289.","ieee":"J. Fisher, D. Harel, and T. A. Henzinger, “Biology as reactivity,” Communications of the ACM, vol. 54, no. 10. ACM, pp. 72–82, 2011.","short":"J. Fisher, D. Harel, T.A. Henzinger, Communications of the ACM 54 (2011) 72–82.","apa":"Fisher, J., Harel, D., & Henzinger, T. A. (2011). Biology as reactivity. Communications of the ACM. ACM. https://doi.org/10.1145/2001269.2001289","ama":"Fisher J, Harel D, Henzinger TA. Biology as reactivity. Communications of the ACM. 2011;54(10):72-82. doi:10.1145/2001269.2001289","chicago":"Fisher, Jasmin, David Harel, and Thomas A Henzinger. “Biology as Reactivity.” Communications of the ACM. ACM, 2011. https://doi.org/10.1145/2001269.2001289.","ista":"Fisher J, Harel D, Henzinger TA. 2011. Biology as reactivity. Communications of the ACM. 54(10), 72–82."},"date_updated":"2021-01-12T07:42:52Z","department":[{"_id":"ToHe"}],"title":"Biology as reactivity","author":[{"full_name":"Fisher, Jasmin","last_name":"Fisher","first_name":"Jasmin"},{"last_name":"Harel","full_name":"Harel, David","first_name":"David"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"publist_id":"3267"},{"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"State-transition systems communicating by shared variables have been the underlying model of choice for applications of model checking. Such formalisms, however, have difficulty with modeling process creation or death and communication reconfigurability. Here, we introduce “dynamic reactive modules” (DRM), a state-transition modeling formalism that supports dynamic reconfiguration and creation/death of processes. The resulting formalism supports two types of variables, data variables and reference variables. Reference variables enable changing the connectivity between processes and referring to instances of processes. We show how this new formalism supports parallel composition and refinement through trace containment. DRM provide a natural language for modeling (and ultimately reasoning about) biological systems and multiple threads communicating through shared variables."}],"intvolume":" 6901","month":"01","alternative_title":["LNCS"],"scopus_import":1,"language":[{"iso":"eng"}],"file":[{"file_name":"2011_CONCUR_Fisher.pdf","date_created":"2020-05-19T16:17:48Z","creator":"dernst","file_size":337125,"date_updated":"2020-07-14T12:46:10Z","checksum":"6bf2453d8e52e979ddb58d17325bad26","file_id":"7870","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"publication_status":"published","ec_funded":1,"volume":6901,"_id":"3362","status":"public","conference":{"location":"Aachen, Germany","end_date":"2011-09-09","start_date":"2011-09-06","name":"CONCUR: Concurrency Theory"},"type":"conference","ddc":["000"],"date_updated":"2021-01-12T07:42:57Z","file_date_updated":"2020-07-14T12:46:10Z","department":[{"_id":"ToHe"}],"oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","day":"01","year":"2011","has_accepted_license":"1","date_created":"2018-12-11T12:02:54Z","doi":"10.1007/978-3-642-23217-6_27","date_published":"2011-01-01T00:00:00Z","page":"404 - 418","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. 2011. Dynamic reactive modules. CONCUR: Concurrency Theory, LNCS, vol. 6901, 404–418.","chicago":"Fisher, Jasmin, Thomas A Henzinger, Dejan Nickovic, Nir Piterman, Anmol Singh, and Moshe Vardi. “Dynamic Reactive Modules,” 6901:404–18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011. https://doi.org/10.1007/978-3-642-23217-6_27.","ama":"Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. Dynamic reactive modules. In: Vol 6901. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2011:404-418. doi:10.1007/978-3-642-23217-6_27","apa":"Fisher, J., Henzinger, T. A., Nickovic, D., Piterman, N., Singh, A., & Vardi, M. (2011). Dynamic reactive modules (Vol. 6901, pp. 404–418). Presented at the CONCUR: Concurrency Theory, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-23217-6_27","short":"J. Fisher, T.A. Henzinger, D. Nickovic, N. Piterman, A. Singh, M. Vardi, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–418.","ieee":"J. Fisher, T. A. Henzinger, D. Nickovic, N. Piterman, A. Singh, and M. Vardi, “Dynamic reactive modules,” presented at the CONCUR: Concurrency Theory, Aachen, Germany, 2011, vol. 6901, pp. 404–418.","mla":"Fisher, Jasmin, et al. Dynamic Reactive Modules. Vol. 6901, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–18, doi:10.1007/978-3-642-23217-6_27."},"title":"Dynamic reactive modules","article_processing_charge":"No","author":[{"first_name":"Jasmin","full_name":"Fisher, Jasmin","last_name":"Fisher"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan","full_name":"Nickovic, Dejan","last_name":"Nickovic"},{"first_name":"Nir","full_name":"Piterman, Nir","last_name":"Piterman"},{"last_name":"Singh","full_name":"Singh, Anmol","first_name":"Anmol"},{"full_name":"Vardi, Moshe","last_name":"Vardi","first_name":"Moshe"}],"publist_id":"3253"},{"month":"09","intvolume":" 6605","scopus_import":1,"alternative_title":["LNCS"],"oa_version":"Submitted Version","abstract":[{"text":"We present the tool Quasy, a quantitative synthesis tool. Quasy takes qualitative and quantitative specifications and automatically constructs a system that satisfies the qualitative specification and optimizes the quantitative specification, if such a system exists. The user can choose between a system that satisfies and optimizes the specifications (a) under all possible environment behaviors or (b) under the most-likely environment behaviors given as a probability distribution on the possible input sequences. Quasy solves these two quantitative synthesis problems by reduction to instances of 2-player games and Markov Decision Processes (MDPs) with quantitative winning objectives. Quasy can also be seen as a game solver for quantitative games. Most notable, it can solve lexicographic mean-payoff games with 2 players, MDPs with mean-payoff objectives, and ergodic MDPs with mean-payoff parity objectives.","lang":"eng"}],"volume":6605,"file":[{"checksum":"762e52eb296f6dbfbf2a75d98b8ebaee","file_id":"5022","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:13:37Z","file_name":"IST-2012-77-v1+1_QUASY-_quantitative_synthesis_tool.pdf","creator":"system","date_updated":"2020-07-14T12:46:10Z","file_size":475661}],"language":[{"iso":"eng"}],"publication_status":"published","status":"public","pubrep_id":"77","type":"conference","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2011-04-03","location":"Saarbrucken, Germany","start_date":"2011-03-26"},"_id":"3365","file_date_updated":"2020-07-14T12:46:10Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"ddc":["000","005"],"date_updated":"2021-01-12T07:42:58Z","quality_controlled":"1","publisher":"Springer","oa":1,"doi":"10.1007/978-3-642-19835-9_24","date_published":"2011-09-29T00:00:00Z","date_created":"2018-12-11T12:02:55Z","page":"267 - 271","day":"29","has_accepted_license":"1","year":"2011","title":"QUASY: quantitative synthesis tool","publist_id":"3248","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"},{"first_name":"Rohit","last_name":"Singh","full_name":"Singh, Rohit"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. QUASY: Quantitative Synthesis Tool. Vol. 6605, Springer, 2011, pp. 267–71, doi:10.1007/978-3-642-19835-9_24.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. QUASY: quantitative synthesis tool. In: Vol 6605. Springer; 2011:267-271. doi:10.1007/978-3-642-19835-9_24","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer. https://doi.org/10.1007/978-3-642-19835-9_24","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2011, pp. 267–271.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “QUASY: Quantitative Synthesis Tool,” 6605:267–71. Springer, 2011. https://doi.org/10.1007/978-3-642-19835-9_24.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2011. QUASY: quantitative synthesis tool. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 6605, 267–271."}},{"date_published":"2011-04-01T00:00:00Z","date_created":"2018-12-11T12:02:54Z","ec_funded":1,"page":"19","day":"01","language":[{"iso":"eng"}],"publication_status":"submitted","year":"2011","month":"04","publisher":"ArXiv","main_file_link":[{"url":"https://arxiv.org/abs/1104.0127","open_access":"1"}],"oa":1,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present a complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words."}],"title":"The decidability frontier for probabilistic automata on infinite words","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tracol, Mathieu","last_name":"Tracol","first_name":"Mathieu","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"3251","external_id":{"arxiv":["1104.0127"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. The Decidability Frontier for Probabilistic Automata on Infinite Words. ArXiv.","apa":"Chatterjee, K., Henzinger, T. A., & Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.","ama":"Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.","ieee":"K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.","short":"K. Chatterjee, T.A. Henzinger, M. Tracol, (n.d.).","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d.","ista":"Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words."},"date_updated":"2020-01-21T13:20:24Z","status":"public","project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373"}],"type":"preprint","_id":"3363"},{"scopus_import":1,"intvolume":" 22","month":"06","abstract":[{"lang":"eng","text":"In this survey, we compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. All these languages — matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded command models — describe continuous-time Markov chains, but they differ according to important properties, such as compositionality, expressiveness and succinctness, executability, and ease of use. Moreover, they provide different support for checking the well-formedness of a model and for analyzing a model."}],"oa_version":"Submitted Version","issue":"4","related_material":{"record":[{"status":"public","id":"3841","relation":"earlier_version"}]},"volume":22,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_name":"IST-2016-628-v1+1_journals-ijfcs-HenzingerJW11.pdf","date_created":"2018-12-12T10:08:45Z","creator":"system","file_size":222840,"date_updated":"2020-07-14T12:46:11Z","checksum":"df88431872586c773fbcfea37d7b36a2","file_id":"4707","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"type":"journal_article","pubrep_id":"628","status":"public","_id":"3381","file_date_updated":"2020-07-14T12:46:11Z","department":[{"_id":"ToHe"}],"date_updated":"2023-02-23T11:45:03Z","ddc":["000"],"oa":1,"publisher":"World Scientific Publishing","quality_controlled":"1","page":"823 - 841","date_created":"2018-12-11T12:03:00Z","doi":"10.1142/S0129054111008441","date_published":"2011-06-01T00:00:00Z","year":"2011","has_accepted_license":"1","publication":"IJFCS: International Journal of Foundations of Computer Science","day":"01","author":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"},{"first_name":"Verena","last_name":"Wolf","full_name":"Wolf, Verena"}],"publist_id":"3226","title":"Formalisms for specifying Markovian population models","citation":{"ieee":"T. A. Henzinger, B. Jobstmann, and V. Wolf, “Formalisms for specifying Markovian population models,” IJFCS: International Journal of Foundations of Computer Science, vol. 22, no. 4. World Scientific Publishing, pp. 823–841, 2011.","short":"T.A. Henzinger, B. Jobstmann, V. Wolf, IJFCS: International Journal of Foundations of Computer Science 22 (2011) 823–841.","ama":"Henzinger TA, Jobstmann B, Wolf V. Formalisms for specifying Markovian population models. IJFCS: International Journal of Foundations of Computer Science. 2011;22(4):823-841. doi:10.1142/S0129054111008441","apa":"Henzinger, T. A., Jobstmann, B., & Wolf, V. (2011). Formalisms for specifying Markovian population models. IJFCS: International Journal of Foundations of Computer Science. World Scientific Publishing. https://doi.org/10.1142/S0129054111008441","mla":"Henzinger, Thomas A., et al. “Formalisms for Specifying Markovian Population Models.” IJFCS: International Journal of Foundations of Computer Science, vol. 22, no. 4, World Scientific Publishing, 2011, pp. 823–41, doi:10.1142/S0129054111008441.","ista":"Henzinger TA, Jobstmann B, Wolf V. 2011. Formalisms for specifying Markovian population models. IJFCS: International Journal of Foundations of Computer Science. 22(4), 823–841.","chicago":"Henzinger, Thomas A, Barbara Jobstmann, and Verena Wolf. “Formalisms for Specifying Markovian Population Models.” IJFCS: International Journal of Foundations of Computer Science. World Scientific Publishing, 2011. https://doi.org/10.1142/S0129054111008441."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},{"scopus_import":1,"month":"12","intvolume":" 7","abstract":[{"lang":"eng","text":"We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are concurrent in that at each turn, both players independently propose a time delay and an action, and the action with the shorter delay is chosen. To prevent a player from winning by blocking time, we restrict each player to play strategies that ensure that the player cannot be responsible for causing a zeno run. First, we present an efficient reduction of these games to turn-based (i.e., not concurrent) finite-state (i.e., untimed) parity games. Our reduction improves the best known complexity for solving timed parity games. Moreover, the rich class of algorithms for classical parity games can now be applied to timed parity games. The states of the resulting game are based on clock regions of the original game, and the state space of the finite game is linear in the size of the region graph. Second, we consider two restricted classes of strategies for the player that represents the controller in a real-time synthesis problem, namely, limit-robust and bounded-robust winning strategies. Using a limit-robust winning strategy, the controller cannot choose an exact real-valued time delay but must allow for some nonzero jitter in each of its actions. If there is a given lower bound on the jitter, then the strategy is bounded-robust winning. We show that exact strategies are more powerful than limit-robust strategies, which are more powerful than bounded-robust winning strategies for any bound. For both kinds of robust strategies, we present efficient reductions to standard timed automaton games. These reductions provide algorithms for the synthesis of robust real-time controllers."}],"oa_version":"Published Version","issue":"4","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3876"}]},"volume":7,"ec_funded":1,"license":"https://creativecommons.org/licenses/by-nd/4.0/","publication_status":"published","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5231","checksum":"3480e1594bbef25ff7462fa93a8a814e","creator":"system","date_updated":"2020-07-14T12:46:07Z","file_size":588863,"date_created":"2018-12-12T10:16:42Z","file_name":"IST-2016-86-v2+1_1011.0688_3_.pdf"}],"language":[{"iso":"eng"}],"type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"status":"public","pubrep_id":"506","_id":"3315","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:07Z","date_updated":"2023-02-23T11:46:35Z","ddc":["000","005"],"quality_controlled":"1","publisher":"International Federation of Computational Logic","oa":1,"doi":"10.2168/LMCS-7(4:8)2011","date_published":"2011-12-14T00:00:00Z","date_created":"2018-12-11T12:02:37Z","has_accepted_license":"1","year":"2011","day":"14","publication":"Logical Methods in Computer Science","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"}],"publist_id":"3324","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Vinayak","last_name":"Prabhu","full_name":"Prabhu, Vinayak"}],"title":"Timed parity games: Complexity and robustness","citation":{"short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).","ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” Logical Methods in Computer Science, vol. 7, no. 4. International Federation of Computational Logic, 2011.","apa":"Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2011). Timed parity games: Complexity and robustness. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-7(4:8)2011","ama":"Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 2011;7(4). doi:10.2168/LMCS-7(4:8)2011","mla":"Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.” Logical Methods in Computer Science, vol. 7, no. 4, International Federation of Computational Logic, 2011, doi:10.2168/LMCS-7(4:8)2011.","ista":"Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 7(4).","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.” Logical Methods in Computer Science. International Federation of Computational Logic, 2011. https://doi.org/10.2168/LMCS-7(4:8)2011."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"intvolume":" 6996","month":"10","alternative_title":["LNCS"],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Weighted automata map input words to numerical values. Ap- plications of weighted automata include formal verification of quantitative properties, as well as text, speech, and image processing. A weighted au- tomaton is defined with respect to a semiring. For the tropical semiring, the weight of a run is the sum of the weights of the transitions taken along the run, and the value of a word is the minimal weight of an accepting run on it. In the 90’s, Krob studied the decidability of problems on rational series defined with respect to the tropical semiring. Rational series are strongly related to weighted automata, and Krob’s results apply to them. In par- ticular, it follows from Krob’s results that the universality problem (that is, deciding whether the values of all words are below some threshold) is decidable for weighted automata defined with respect to the tropical semir- ing with domain ∪ {∞}, and that the equality problem is undecidable when the domain is ∪ {∞}. In this paper we continue the study of the borders of decidability in weighted automata, describe alternative and direct proofs of the above results, and tighten them further. Unlike the proofs of Krob, which are algebraic in their nature, our proofs stay in the terrain of state machines, and the reduction is from the halting problem of a two-counter machine. This enables us to significantly simplify Krob’s reasoning, make the un- decidability result accessible to the automata-theoretic community, and strengthen it to apply already to a very simple class of automata: all the states are accepting, there are no initial nor final weights, and all the weights on the transitions are from the set {−1, 0, 1}. The fact we work directly with the automata enables us to tighten also the decidability re- sults and to show that the universality problem for weighted automata defined with respect to the tropical semiring with domain ∪ {∞}, and in fact even with domain ≥0 ∪ {∞}, is PSPACE-complete. Our results thus draw a sharper picture about the decidability of decision problems for weighted automata, in both the front of containment vs. universality and the front of the ∪ {∞} vs. the ∪ {∞} domains."}],"volume":6996,"language":[{"iso":"eng"}],"file":[{"file_id":"7868","checksum":"a7ca08a2cb1b6925f4c18a3034ae5659","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2011_LNCS_Almagor.pdf","date_created":"2020-05-19T16:08:32Z","file_size":182309,"date_updated":"2020-07-14T12:46:07Z","creator":"dernst"}],"publication_status":"published","status":"public","conference":{"end_date":"2011-10-14","location":"Taipei, Taiwan","start_date":"2011-10-11","name":"ATVA: Automated Technology for Verification and Analysis"},"type":"conference","_id":"3326","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:07Z","ddc":["000"],"date_updated":"2021-01-12T07:42:40Z","oa":1,"publisher":"Springer","quality_controlled":"1","date_created":"2018-12-11T12:02:41Z","doi":"10.1007/978-3-642-24372-1_37","date_published":"2011-10-14T00:00:00Z","page":"482 - 491","day":"14","year":"2011","has_accepted_license":"1","title":"What’s decidable about weighted automata ","article_processing_charge":"No","author":[{"last_name":"Almagor","full_name":"Almagor, Shaull","first_name":"Shaull"},{"full_name":"Boker, Udi","last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi"},{"first_name":"Orna","full_name":"Kupferman, Orna","last_name":"Kupferman"}],"publist_id":"3309","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"S. Almagor, U. Boker, and O. Kupferman, “What’s decidable about weighted automata ,” presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan, 2011, vol. 6996, pp. 482–491.","short":"S. Almagor, U. Boker, O. Kupferman, in:, Springer, 2011, pp. 482–491.","ama":"Almagor S, Boker U, Kupferman O. What’s decidable about weighted automata . In: Vol 6996. Springer; 2011:482-491. doi:10.1007/978-3-642-24372-1_37","apa":"Almagor, S., Boker, U., & Kupferman, O. (2011). What’s decidable about weighted automata (Vol. 6996, pp. 482–491). Presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan: Springer. https://doi.org/10.1007/978-3-642-24372-1_37","mla":"Almagor, Shaull, et al. What’s Decidable about Weighted Automata . Vol. 6996, Springer, 2011, pp. 482–91, doi:10.1007/978-3-642-24372-1_37.","ista":"Almagor S, Boker U, Kupferman O. 2011. What’s decidable about weighted automata . ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6996, 482–491.","chicago":"Almagor, Shaull, Udi Boker, and Orna Kupferman. “What’s Decidable about Weighted Automata ,” 6996:482–91. Springer, 2011. https://doi.org/10.1007/978-3-642-24372-1_37."}},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Alur, Rajeev, and Pavol Cerny. Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs. Vol. 46, no. 1, ACM, 2011, pp. 599–610, doi:10.1145/1926385.1926454.","apa":"Alur, R., & Cerny, P. (2011). Streaming transducers for algorithmic verification of single pass list processing programs (Vol. 46, pp. 599–610). Presented at the POPL: Principles of Programming Languages, Texas, USA: ACM. https://doi.org/10.1145/1926385.1926454","ama":"Alur R, Cerny P. Streaming transducers for algorithmic verification of single pass list processing programs. In: Vol 46. ACM; 2011:599-610. doi:10.1145/1926385.1926454","short":"R. Alur, P. Cerny, in:, ACM, 2011, pp. 599–610.","ieee":"R. Alur and P. Cerny, “Streaming transducers for algorithmic verification of single pass list processing programs,” presented at the POPL: Principles of Programming Languages, Texas, USA, 2011, vol. 46, no. 1, pp. 599–610.","chicago":"Alur, Rajeev, and Pavol Cerny. “Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs,” 46:599–610. ACM, 2011. https://doi.org/10.1145/1926385.1926454.","ista":"Alur R, Cerny P. 2011. Streaming transducers for algorithmic verification of single pass list processing programs. POPL: Principles of Programming Languages vol. 46, 599–610."},"date_updated":"2022-03-21T08:12:51Z","department":[{"_id":"ToHe"}],"title":"Streaming transducers for algorithmic verification of single pass list processing programs","publist_id":"3310","author":[{"first_name":"Rajeev","full_name":"Alur, Rajeev","last_name":"Alur"},{"full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","_id":"3325","status":"public","type":"conference","conference":{"location":"Texas, USA","end_date":"2011-01-28","start_date":"2011-01-26","name":"POPL: Principles of Programming Languages"},"day":"26","language":[{"iso":"eng"}],"publication_status":"published","year":"2011","doi":"10.1145/1926385.1926454","volume":46,"date_published":"2011-01-26T00:00:00Z","issue":"1","date_created":"2018-12-11T12:02:41Z","page":"599 - 610","oa_version":"None","abstract":[{"text":"We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) sequences of data values, tagged with symbols from a finite set, over a potentially infinite data do- main that supports only the operations of equality and ordering. The transducer uses a finite set of states, a finite set of variables ranging over the data domain, and a finite set of variables ranging over data strings. At every step, it can make decisions based on the next in- put symbol, updating its state, remembering the input data value in its data variables, and updating data-string variables by concatenat- ing data-string variables and new symbols formed from data vari- ables, while avoiding duplication. We establish that the problems of checking functional equivalence of two streaming transducers, and of checking whether a streaming transducer satisfies pre/post verification conditions specified by streaming acceptors over in- put/output data-strings, are in PSPACE. We identify a class of imperative and a class of functional pro- grams, manipulating lists of data items, which can be effectively translated to streaming data-string transducers. The imperative pro- grams dynamically modify a singly-linked heap by changing next- pointers of heap-nodes and by adding new nodes. The main re- striction specifies how the next-pointers can be used for traversal. We also identify an expressively equivalent fragment of functional programs that traverse a list using syntactically restricted recursive calls. Our results lead to algorithms for assertion checking and for checking functional equivalence of two programs, written possibly in different programming styles, for commonly used routines such as insert, delete, and reverse.","lang":"eng"}],"month":"01","intvolume":" 46","quality_controlled":"1","scopus_import":"1","publisher":"ACM"},{"title":"Decision procedures for automating termination proofs","editor":[{"first_name":"Ranjit","last_name":"Jhala","full_name":"Jhala, Ranjit"},{"last_name":"Schmidt","full_name":"Schmidt, David","first_name":"David"}],"publist_id":"3311","author":[{"last_name":"Piskac","full_name":"Piskac, Ruzica","first_name":"Ruzica"},{"first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas","last_name":"Wies"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Piskac, Ruzica, and Thomas Wies. Decision Procedures for Automating Termination Proofs. Edited by Ranjit Jhala and David Schmidt, vol. 6538, Springer, 2011, pp. 371–86, doi:10.1007/978-3-642-18275-4_26.","ama":"Piskac R, Wies T. Decision procedures for automating termination proofs. In: Jhala R, Schmidt D, eds. Vol 6538. Springer; 2011:371-386. doi:10.1007/978-3-642-18275-4_26","apa":"Piskac, R., & Wies, T. (2011). Decision procedures for automating termination proofs. In R. Jhala & D. Schmidt (Eds.) (Vol. 6538, pp. 371–386). Presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA: Springer. https://doi.org/10.1007/978-3-642-18275-4_26","ieee":"R. Piskac and T. Wies, “Decision procedures for automating termination proofs,” presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA, 2011, vol. 6538, pp. 371–386.","short":"R. Piskac, T. Wies, in:, R. Jhala, D. Schmidt (Eds.), Springer, 2011, pp. 371–386.","chicago":"Piskac, Ruzica, and Thomas Wies. “Decision Procedures for Automating Termination Proofs.” edited by Ranjit Jhala and David Schmidt, 6538:371–86. Springer, 2011. https://doi.org/10.1007/978-3-642-18275-4_26.","ista":"Piskac R, Wies T. 2011. Decision procedures for automating termination proofs. VMCAI: Verification Model Checking and Abstract Interpretation, LNCS, vol. 6538, 371–386."},"date_published":"2011-01-01T00:00:00Z","doi":"10.1007/978-3-642-18275-4_26","date_created":"2018-12-11T12:02:40Z","page":"371 - 386","day":"01","year":"2011","quality_controlled":"1","publisher":"Springer","oa":1,"department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T07:42:39Z","status":"public","type":"conference","conference":{"location":"Texas, USA","end_date":"2011-01-25","start_date":"2011-01-23","name":"VMCAI: Verification Model Checking and Abstract Interpretation"},"_id":"3324","volume":6538,"language":[{"iso":"eng"}],"publication_status":"published","month":"01","intvolume":" 6538","alternative_title":["LNCS"],"scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://infoscience.epfl.ch/record/170697/"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Automated termination provers often use the following schema to prove that a program terminates: construct a relational abstraction of the program's transition relation and then show that the relational abstraction is well-founded. The focus of current tools has been on developing sophisticated techniques for constructing the abstractions while relying on known decidable logics (such as linear arithmetic) to express them. We believe we can significantly increase the class of programs that are amenable to automated termination proofs by identifying more expressive decidable logics for reasoning about well-founded relations. We therefore present a new decision procedure for reasoning about multiset orderings, which are among the most powerful orderings used to prove termination. We show that, using our decision procedure, one can automatically prove termination of natural abstractions of programs."}]},{"date_created":"2018-12-11T12:02:53Z","doi":"10.4230/LIPIcs.CSL.2011.82","date_published":"2011-08-31T00:00:00Z","page":"82 - 96","day":"31","year":"2011","has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"Springer","title":"Determinizing discounted-sum automata","publist_id":"3255","author":[{"first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","full_name":"Boker, Udi"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Boker U, Henzinger TA. 2011. Determinizing discounted-sum automata. CSL: Computer Science Logic, LIPIcs, vol. 12, 82–96.","chicago":"Boker, Udi, and Thomas A Henzinger. “Determinizing Discounted-Sum Automata,” 12:82–96. Springer, 2011. https://doi.org/10.4230/LIPIcs.CSL.2011.82.","short":"U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96.","ieee":"U. Boker and T. A. Henzinger, “Determinizing discounted-sum automata,” presented at the CSL: Computer Science Logic, Bergen, Norway, 2011, vol. 12, pp. 82–96.","apa":"Boker, U., & Henzinger, T. A. (2011). Determinizing discounted-sum automata (Vol. 12, pp. 82–96). Presented at the CSL: Computer Science Logic, Bergen, Norway: Springer. https://doi.org/10.4230/LIPIcs.CSL.2011.82","ama":"Boker U, Henzinger TA. Determinizing discounted-sum automata. In: Vol 12. Springer; 2011:82-96. doi:10.4230/LIPIcs.CSL.2011.82","mla":"Boker, Udi, and Thomas A. Henzinger. Determinizing Discounted-Sum Automata. Vol. 12, Springer, 2011, pp. 82–96, doi:10.4230/LIPIcs.CSL.2011.82."},"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","ec_funded":1,"volume":12,"language":[{"iso":"eng"}],"file":[{"creator":"system","date_updated":"2020-07-14T12:46:10Z","file_size":504270,"date_created":"2018-12-12T10:10:17Z","file_name":"IST-2012-82-v1+1_Determinizing_discounted-sum_automata.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"250603c6be8ccad4fbd4d7b24221f0ee","file_id":"4803"}],"publication_status":"published","intvolume":" 12","month":"08","alternative_title":["LIPIcs"],"scopus_import":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"A discounted-sum automaton (NDA) is a nondeterministic finite automaton with edge weights, which values a run by the discounted sum of visited edge weights. More precisely, the weight in the i-th position of the run is divided by lambda^i, where the discount factor lambda is a fixed rational number greater than 1. Discounted summation is a common and useful measuring scheme, especially for infinite sequences, which reflects the assumption that earlier weights are more important than later weights. Determinizing automata is often essential, for example, in formal verification, where there are polynomial algorithms for comparing two deterministic NDAs, while the equivalence problem for NDAs is not known to be decidable. Unfortunately, however, discounted-sum automata are, in general, not determinizable: it is currently known that for every rational discount factor 1 < lambda < 2, there is an NDA with lambda (denoted lambda-NDA) that cannot be determinized. We provide positive news, showing that every NDA with an integral factor is determinizable. We also complete the picture by proving that the integers characterize exactly the discount factors that guarantee determinizability: we show that for every non-integral rational factor lambda, there is a nondeterminizable lambda-NDA. Finally, we prove that the class of NDAs with integral discount factors enjoys closure under the algebraic operations min, max, addition, and subtraction, which is not the case for general NDAs nor for deterministic NDAs. This shows that for integral discount factors, the class of NDAs forms an attractive specification formalism in quantitative formal verification. All our results hold equally for automata over finite words and for automata over infinite words. "}],"department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:10Z","ddc":["004"],"date_updated":"2021-01-12T07:42:56Z","pubrep_id":"82","status":"public","conference":{"name":"CSL: Computer Science Logic","end_date":"2011-09-15","location":"Bergen, Norway","start_date":"2011-09-12"},"tmp":{"short":"CC BY-NC-ND (4.0)","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","image":"/images/cc_by_nc_nd.png"},"type":"conference","_id":"3360"},{"abstract":[{"text":"In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (based on Shannon entropy)have been introduced to enable more fine-grained reasoning about programs in situations where limited information flow is acceptable. The QIF bounding problem asks whether the information flow in a given program is bounded by a constant $d$. Our first result is that the QIF bounding problem is PSPACE-complete. The QIF memoryless synthesis problem asks whether it is possible to resolve nondeterministic choices in a given partial program in such a way that in the resulting deterministic program, the quantitative information flow is bounded by a given constant $d$. Our second result is that the QIF memoryless synthesis problem is also EXPTIME-complete. The QIF memoryless synthesis problem generalizes to QIF general synthesis problem which does not impose the memoryless requirement (that is, by allowing the synthesized program to have more variables then the original partial program). Our third result is that the QIF general synthesis problem is EXPTIME-hard.","lang":"eng"}],"oa_version":"Submitted Version","scopus_import":1,"month":"06","publication_status":"published","file":[{"file_id":"4792","checksum":"1a25be0c62459fc7640db88af08ff63a","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2012-81-v1+1_The_complexity_of_quantitative_information_flow_problems.pdf","date_created":"2018-12-12T10:10:07Z","creator":"system","file_size":299069,"date_updated":"2020-07-14T12:46:10Z"}],"language":[{"iso":"eng"}],"ec_funded":1,"_id":"3361","type":"conference","conference":{"end_date":"2011-06-29","location":"Cernay-la-Ville, France","start_date":"2011-06-27","name":"CSF: Computer Security Foundations"},"status":"public","pubrep_id":"81","date_updated":"2021-01-12T07:42:56Z","ddc":["000","005"],"file_date_updated":"2020-07-14T12:46:10Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"quality_controlled":"1","publisher":"IEEE","oa":1,"has_accepted_license":"1","year":"2011","day":"27","page":"205 - 217","date_published":"2011-06-27T00:00:00Z","doi":"10.1109/CSF.2011.21","date_created":"2018-12-11T12:02:54Z","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"citation":{"ista":"Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217.","chicago":"Cerny, Pavol, Krishnendu Chatterjee, and Thomas A Henzinger. “The Complexity of Quantitative Information Flow Problems,” 205–17. IEEE, 2011. https://doi.org/10.1109/CSF.2011.21.","apa":"Cerny, P., Chatterjee, K., & Henzinger, T. A. (2011). The complexity of quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France: IEEE. https://doi.org/10.1109/CSF.2011.21","ama":"Cerny P, Chatterjee K, Henzinger TA. The complexity of quantitative information flow problems. In: IEEE; 2011:205-217. doi:10.1109/CSF.2011.21","ieee":"P. Cerny, K. Chatterjee, and T. A. Henzinger, “The complexity of quantitative information flow problems,” presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France, 2011, pp. 205–217.","short":"P. Cerny, K. Chatterjee, T.A. Henzinger, in:, IEEE, 2011, pp. 205–217.","mla":"Cerny, Pavol, et al. The Complexity of Quantitative Information Flow Problems. IEEE, 2011, pp. 205–17, doi:10.1109/CSF.2011.21."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"3254","author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"title":"The complexity of quantitative information flow problems"},{"title":"Scheduling large jobs by abstraction refinement","department":[{"_id":"ToHe"}],"publist_id":"3257","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"full_name":"Singh, Vasu","last_name":"Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu"},{"full_name":"Wies, Thomas","last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","last_name":"Zufferey"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Henzinger TA, Singh V, Wies T, Zufferey D. 2011. Scheduling large jobs by abstraction refinement. EuroSys, 329–342.","chicago":"Henzinger, Thomas A, Vasu Singh, Thomas Wies, and Damien Zufferey. “Scheduling Large Jobs by Abstraction Refinement,” 329–42. ACM, 2011. https://doi.org/10.1145/1966445.1966476.","ama":"Henzinger TA, Singh V, Wies T, Zufferey D. Scheduling large jobs by abstraction refinement. In: ACM; 2011:329-342. doi:10.1145/1966445.1966476","apa":"Henzinger, T. A., Singh, V., Wies, T., & Zufferey, D. (2011). Scheduling large jobs by abstraction refinement (pp. 329–342). Presented at the EuroSys, Salzburg, Austria: ACM. https://doi.org/10.1145/1966445.1966476","short":"T.A. Henzinger, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2011, pp. 329–342.","ieee":"T. A. Henzinger, V. Singh, T. Wies, and D. Zufferey, “Scheduling large jobs by abstraction refinement,” presented at the EuroSys, Salzburg, Austria, 2011, pp. 329–342.","mla":"Henzinger, Thomas A., et al. Scheduling Large Jobs by Abstraction Refinement. ACM, 2011, pp. 329–42, doi:10.1145/1966445.1966476."},"date_updated":"2021-01-12T07:42:55Z","status":"public","type":"conference","conference":{"location":"Salzburg, Austria","end_date":"2011-04-13","start_date":"2011-04-10","name":"EuroSys"},"_id":"3358","doi":"10.1145/1966445.1966476","date_published":"2011-04-10T00:00:00Z","date_created":"2018-12-11T12:02:53Z","page":"329 - 342","day":"10","language":[{"iso":"eng"}],"year":"2011","publication_status":"published","month":"04","quality_controlled":"1","publisher":"ACM","scopus_import":1,"main_file_link":[{"url":"http://cs.nyu.edu/wies/publ/scheduling_large_jobs_by_abstraction_refinement.pdf","open_access":"1"}],"oa":1,"oa_version":"Published Version","abstract":[{"text":"The static scheduling problem often arises as a fundamental problem in real-time systems and grid computing. We consider the problem of statically scheduling a large job expressed as a task graph on a large number of computing nodes, such as a data center. This paper solves the large-scale static scheduling problem using abstraction refinement, a technique commonly used in formal verification to efficiently solve computationally hard problems. A scheduler based on abstraction refinement first attempts to solve the scheduling problem with abstract representations of the job and the computing resources. As abstract representations are generally small, the scheduling can be done reasonably fast. If the obtained schedule does not meet specified quality conditions (like data center utilization or schedule makespan) then the scheduler refines the job and data center abstractions and, again solves the scheduling problem. We develop different schedulers based on abstraction refinement. We implemented these schedulers and used them to schedule task graphs from various computing domains on simulated data centers with realistic topologies. We compared the speed of scheduling and the quality of the produced schedules with our abstraction refinement schedulers against a baseline scheduler that does not use any abstraction. We conclude that abstraction refinement techniques give a significant speed-up compared to traditional static scheduling heuristics, at a reasonable cost in the quality of the produced schedules. We further used our static schedulers in an actual system that we deployed on Amazon EC2 and compared it against the Hadoop dynamic scheduler for large MapReduce jobs. Our experiments indicate that there is great potential for static scheduling techniques.","lang":"eng"}]},{"type":"conference","conference":{"name":"EMSOFT: Embedded Software ","start_date":"2011-10-09","location":"Taipei; Taiwan","end_date":"2011-10-14"},"status":"public","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"214373","name":"Design for Embedded Systems"}],"_id":"3359","author":[{"last_name":"Cerny","full_name":"Cerny, Pavol","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"}],"publist_id":"3256","title":"From boolean to quantitative synthesis","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T07:42:55Z","citation":{"chicago":"Cerny, Pavol, and Thomas A Henzinger. “From Boolean to Quantitative Synthesis,” 149–54. ACM, 2011. https://doi.org/10.1145/2038642.2038666.","ista":"Cerny P, Henzinger TA. 2011. From boolean to quantitative synthesis. EMSOFT: Embedded Software , 149–154.","mla":"Cerny, Pavol, and Thomas A. Henzinger. From Boolean to Quantitative Synthesis. ACM, 2011, pp. 149–54, doi:10.1145/2038642.2038666.","short":"P. Cerny, T.A. Henzinger, in:, ACM, 2011, pp. 149–154.","ieee":"P. Cerny and T. A. Henzinger, “From boolean to quantitative synthesis,” presented at the EMSOFT: Embedded Software , Taipei; Taiwan, 2011, pp. 149–154.","ama":"Cerny P, Henzinger TA. From boolean to quantitative synthesis. In: ACM; 2011:149-154. doi:10.1145/2038642.2038666","apa":"Cerny, P., & Henzinger, T. A. (2011). From boolean to quantitative synthesis (pp. 149–154). Presented at the EMSOFT: Embedded Software , Taipei; Taiwan: ACM. https://doi.org/10.1145/2038642.2038666"},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"ACM","month":"10","abstract":[{"lang":"eng","text":"Motivated by improvements in constraint-solving technology and by the increase of routinely available computational power, partial-program synthesis is emerging as an effective approach for increasing programmer productivity. The goal of the approach is to allow the programmer to specify a part of her intent imperatively (that is, give a partial program) and a part of her intent declaratively, by specifying which conditions need to be achieved or maintained. The task of the synthesizer is to construct a program that satisfies the specification. As an example, consider a partial program where threads access shared data without using any synchronization mechanism, and a declarative specification that excludes data races and deadlocks. The task of the synthesizer is then to place locks into the program code in order for the program to meet the specification.\r\n\r\nIn this paper, we argue that quantitative objectives are needed in partial-program synthesis in order to produce higher-quality programs, while enabling simpler specifications. Returning to the example, the synthesizer could construct a naive solution that uses one global lock for shared data. This can be prevented either by constraining the solution space further (which is error-prone and partly defeats the point of synthesis), or by optimizing a quantitative objective that models performance. Other quantitative notions useful in synthesis include fault tolerance, robustness, resource (memory, power) consumption, and information flow."}],"oa_version":"None","acknowledgement":"This work was partially supported by the ERC Advanced Grant QUAREM, the FWF NFN Grant S11402-N23 (RiSE), and the EU NOE Grant ArtistDesign.","page":"149 - 154","doi":"10.1145/2038642.2038666","date_published":"2011-10-09T00:00:00Z","ec_funded":1,"date_created":"2018-12-11T12:02:53Z","publication_status":"published","year":"2011","day":"09","language":[{"iso":"eng"}]},{"scopus_import":1,"quality_controlled":"1","publisher":"Springer","alternative_title":["LNCS"],"intvolume":" 6638","month":"01","abstract":[{"text":"We consider two-player graph games whose objectives are request-response condition, i.e conjunctions of conditions of the form \"if a state with property Rq is visited, then later a state with property Rp is visited\". The winner of such games can be decided in EXPTIME and the problem is known to be NP-hard. In this paper, we close this gap by showing that this problem is, in fact, EXPTIME-complete. We show that the problem becomes PSPACE-complete if we only consider games played on DAGs, and NP-complete or PTIME-complete if there is only one player (depending on whether he wants to enforce or spoil the request-response condition). We also present near-optimal bounds on the memory needed to design winning strategies for each player, in each case.","lang":"eng"}],"oa_version":"None","page":"227 - 237","date_created":"2018-12-11T12:02:52Z","doi":"10.1007/978-3-642-21254-3_17","date_published":"2011-01-01T00:00:00Z","volume":6638,"publication_status":"published","year":"2011","language":[{"iso":"eng"}],"day":"01","conference":{"name":"LATA: Language and Automata Theory and Applications","start_date":"2011-05-26","end_date":"2011-05-31","location":"Tarragona, Spain"},"type":"conference","status":"public","_id":"3357","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Horn, Florian","last_name":"Horn","first_name":"Florian","id":"37327ACE-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"3258","editor":[{"first_name":"Adrian-Horia","last_name":"Dediu","full_name":"Dediu, Adrian-Horia"},{"last_name":"Inenaga","full_name":"Inenaga, Shunsuke","first_name":"Shunsuke"},{"full_name":"Martín-Vide, Carlos","last_name":"Martín-Vide","first_name":"Carlos"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"The complexity of request-response games","date_updated":"2021-01-12T07:42:54Z","citation":{"mla":"Chatterjee, Krishnendu, et al. The Complexity of Request-Response Games. Edited by Adrian-Horia Dediu et al., vol. 6638, Springer, 2011, pp. 227–37, doi:10.1007/978-3-642-21254-3_17.","short":"K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.","ieee":"K. Chatterjee, T. A. Henzinger, and F. Horn, “The complexity of request-response games,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 227–237.","apa":"Chatterjee, K., Henzinger, T. A., & Horn, F. (2011). The complexity of request-response games. In A.-H. Dediu, S. Inenaga, & C. Martín-Vide (Eds.) (Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_17","ama":"Chatterjee K, Henzinger TA, Horn F. The complexity of request-response games. In: Dediu A-H, Inenaga S, Martín-Vide C, eds. Vol 6638. Springer; 2011:227-237. doi:10.1007/978-3-642-21254-3_17","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “The Complexity of Request-Response Games.” edited by Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martín-Vide, 6638:227–37. Springer, 2011. https://doi.org/10.1007/978-3-642-21254-3_17.","ista":"Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 227–237."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},{"quality_controlled":"1","publisher":"Elsevier","oa":1,"has_accepted_license":"1","year":"2011","day":"06","publication":"Theoretical Computer Science","page":"2128 - 2141","date_published":"2011-05-06T00:00:00Z","doi":"10.1016/j.tcs.2010.10.022","date_created":"2018-12-11T12:02:55Z","citation":{"ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2011. Approximation of event probabilities in noisy cellular processes. Theoretical Computer Science. 412(21), 2128–2141.","chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Approximation of Event Probabilities in Noisy Cellular Processes.” Theoretical Computer Science. Elsevier, 2011. https://doi.org/10.1016/j.tcs.2010.10.022.","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Approximation of event probabilities in noisy cellular processes,” Theoretical Computer Science, vol. 412, no. 21. Elsevier, pp. 2128–2141, 2011.","short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, Theoretical Computer Science 412 (2011) 2128–2141.","ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. Approximation of event probabilities in noisy cellular processes. Theoretical Computer Science. 2011;412(21):2128-2141. doi:10.1016/j.tcs.2010.10.022","apa":"Didier, F., Henzinger, T. A., Mateescu, M., & Wolf, V. (2011). Approximation of event probabilities in noisy cellular processes. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2010.10.022","mla":"Didier, Frédéric, et al. “Approximation of Event Probabilities in Noisy Cellular Processes.” Theoretical Computer Science, vol. 412, no. 21, Elsevier, 2011, pp. 2128–41, doi:10.1016/j.tcs.2010.10.022."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"3249","author":[{"first_name":"Frédéric","last_name":"Didier","full_name":"Didier, Frédéric"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Maria","full_name":"Mateescu, Maria","last_name":"Mateescu"},{"full_name":"Wolf, Verena","last_name":"Wolf","first_name":"Verena"}],"title":"Approximation of event probabilities in noisy cellular processes","abstract":[{"text":"Molecular noise, which arises from the randomness of the discrete events in the cell, significantly influences fundamental biological processes. Discrete-state continuous-time stochastic models (CTMC) can be used to describe such effects, but the calculation of the probabilities of certain events is computationally expensive. We present a comparison of two analysis approaches for CTMC. On one hand, we estimate the probabilities of interest using repeated Gillespie simulation and determine the statistical accuracy that we obtain. On the other hand, we apply a numerical reachability analysis that approximates the probability distributions of the system at several time instances. We use examples of cellular processes to demonstrate the superiority of the reachability analysis if accurate results are required.","lang":"eng"}],"oa_version":"Submitted Version","scopus_import":1,"month":"05","intvolume":" 412","publication_status":"published","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"e5503e25ce020d753e06b3431e16841e","file_id":"4862","creator":"system","date_updated":"2020-07-14T12:46:10Z","file_size":230503,"date_created":"2018-12-12T10:11:09Z","file_name":"IST-2012-79-v1+1_Approximation_of_event_probabilities_in_noisy_cellular_processes.pdf"}],"language":[{"iso":"eng"}],"issue":"21","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"4535"}]},"volume":412,"_id":"3364","type":"journal_article","status":"public","pubrep_id":"79","date_updated":"2023-02-23T12:15:28Z","ddc":["000","004"],"file_date_updated":"2020-07-14T12:46:10Z","department":[{"_id":"ToHe"}]},{"publication_status":"published","language":[{"iso":"eng"}],"volume":39,"issue":"3","abstract":[{"lang":"eng","text":"Software transactional memories (STM) are described in the literature with assumptions of sequentially consistent program execution and atomicity of high level operations like read, write, and abort. However, in a realistic setting, processors use relaxed memory models to optimize hardware performance. Moreover, the atomicity of operations depends on the underlying hardware. This paper presents the first approach to verify STMs under relaxed memory models with atomicity of 32 bit loads and stores, and read-modify-write operations. We describe RML, a simple language for expressing concurrent programs. We develop a semantics of RML parametrized by a relaxed memory model. We then present our tool, FOIL, which takes as input the RML description of an STM algorithm restricted to two threads and two variables, and the description of a memory model, and automatically determines the locations of fences, which if inserted, ensure the correctness of the restricted STM algorithm under the given memory model. We use FOIL to verify DSTM, TL2, and McRT STM under the memory models of sequential consistency, total store order, partial store order, and relaxed memory order for two threads and two variables. Finally, we extend the verification results for DSTM and TL2 to an arbitrary number of threads and variables by manually proving that the structural properties of STMs are satisfied at the hardware level of atomicity under the considered relaxed memory models."}],"oa_version":"Published Version","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://infoscience.epfl.ch/record/178042/files/art3A10.10072Fs10703-011-0131-3.pdf"}],"month":"12","intvolume":" 39","date_updated":"2021-01-12T08:01:27Z","ddc":["000"],"department":[{"_id":"ToHe"}],"_id":"531","article_type":"original","type":"journal_article","status":"public","year":"2011","day":"01","publication":"Formal Methods in System Design","page":"297 - 331","doi":"10.1007/s10703-011-0131-3","date_published":"2011-12-01T00:00:00Z","date_created":"2018-12-11T11:47:00Z","quality_controlled":"1","publisher":"Springer","oa":1,"citation":{"mla":"Guerraoui, Rachid, et al. “Verification of STM on Relaxed Memory Models.” Formal Methods in System Design, vol. 39, no. 3, Springer, 2011, pp. 297–331, doi:10.1007/s10703-011-0131-3.","ieee":"R. Guerraoui, T. A. Henzinger, and V. Singh, “Verification of STM on relaxed memory models,” Formal Methods in System Design, vol. 39, no. 3. Springer, pp. 297–331, 2011.","short":"R. Guerraoui, T.A. Henzinger, V. Singh, Formal Methods in System Design 39 (2011) 297–331.","apa":"Guerraoui, R., Henzinger, T. A., & Singh, V. (2011). Verification of STM on relaxed memory models. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-011-0131-3","ama":"Guerraoui R, Henzinger TA, Singh V. Verification of STM on relaxed memory models. Formal Methods in System Design. 2011;39(3):297-331. doi:10.1007/s10703-011-0131-3","chicago":"Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Verification of STM on Relaxed Memory Models.” Formal Methods in System Design. Springer, 2011. https://doi.org/10.1007/s10703-011-0131-3.","ista":"Guerraoui R, Henzinger TA, Singh V. 2011. Verification of STM on relaxed memory models. Formal Methods in System Design. 39(3), 297–331."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7288","author":[{"first_name":"Rachid","full_name":"Guerraoui, Rachid","last_name":"Guerraoui"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Singh, Vasu","last_name":"Singh","first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","title":"Verification of STM on relaxed memory models"},{"oa":1,"publisher":"IEEE","date_created":"2018-12-11T12:02:52Z","date_published":"2011-06-21T00:00:00Z","doi":"10.1109/LICS.2011.33","year":"2011","has_accepted_license":"1","day":"21","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"article_number":"5970226","publist_id":"3259","author":[{"first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","last_name":"Boker"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"}],"title":"Temporal specifications with accumulative values","citation":{"short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. In: IEEE; 2011. doi:10.1109/LICS.2011.33","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.33","mla":"Boker, Udi, et al. Temporal Specifications with Accumulative Values. 5970226, IEEE, 2011, doi:10.1109/LICS.2011.33.","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” IEEE, 2011. https://doi.org/10.1109/LICS.2011.33."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"month":"06","abstract":[{"lang":"eng","text":"There is recently a significant effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions, aiming for a general and flexible framework for quantitative-oriented specifications. In the heart of quantitative objectives lies the accumulation of values along a computation. It is either the accumulated summation, as with the energy objectives, or the accumulated average, as with the mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point of time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire computation. We study the border of decidability for extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by prefix-accumulation assertions and extending LTL with path-accumulation assertions, result in temporal logics whose model-checking problem is decidable. The extended logics allow to significantly extend the currently known energy and mean-payoff objectives. Moreover, the prefix-accumulation assertions may be refined with \"controlled-accumulation\", allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that the fragment we point to is, in a sense, the maximal logic whose extension with prefix-accumulation assertions permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, and in particular CTL and LTL, makes the problem undecidable."}],"oa_version":"Submitted Version","ec_funded":1,"related_material":{"record":[{"status":"public","id":"2038","relation":"later_version"},{"status":"public","id":"5385","relation":"earlier_version"}]},"publication_status":"published","language":[{"iso":"eng"}],"file":[{"checksum":"792128f5455f0f40f1105f0398e05fa9","file_id":"4960","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:12:42Z","file_name":"IST-2012-83-v1+1_Temporal_specifications_with_accumulative_values.pdf","date_updated":"2020-07-14T12:46:09Z","file_size":225426,"creator":"system"}],"conference":{"start_date":"2011-06-21","end_date":"2011-06-24","location":"Toronto, Canada","name":"LICS: Logic in Computer Science"},"type":"conference","pubrep_id":"83","status":"public","_id":"3356","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:09Z","date_updated":"2023-02-23T12:23:54Z","ddc":["000","004"]},{"has_accepted_license":"1","year":"2011","day":"04","page":"14","doi":"10.15479/AT:IST-2011-0003","date_published":"2011-04-04T00:00:00Z","date_created":"2018-12-12T11:39:02Z","publisher":"IST Austria","oa":1,"citation":{"ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal Specifications with Accumulative Values. IST Austria; 2011. doi:10.15479/AT:IST-2011-0003","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. IST Austria. https://doi.org/10.15479/AT:IST-2011-0003","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, Temporal specifications with accumulative values. IST Austria, 2011.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.","mla":"Boker, Udi, et al. Temporal Specifications with Accumulative Values. IST Austria, 2011, doi:10.15479/AT:IST-2011-0003.","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. Temporal Specifications with Accumulative Values. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0003."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Boker, Udi","last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Orna","full_name":"Kupferman, Orna","last_name":"Kupferman"}],"title":"Temporal specifications with accumulative values","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"publication_identifier":{"issn":["2664-1690"]},"publication_status":"published","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"8491d0d48c4911620ecd5350b413c11e","file_id":"5461","file_size":366281,"date_updated":"2020-07-14T12:46:41Z","creator":"system","file_name":"IST-2011-0003_IST-2011-0003.pdf","date_created":"2018-12-12T11:53:00Z"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","id":"2038","relation":"later_version"},{"status":"public","id":"3356","relation":"later_version"}]},"ec_funded":1,"abstract":[{"lang":"eng","text":"There is recently a significant effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions, aiming for a general and flexible framework for quantitative-oriented specifications. In the heart of quantitative objectives lies the accumulation of values along a computation. It is either the accumulated summation, as with the energy objectives, or the accumulated average, as with the mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point of time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire computation. We study the border of decidability for extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by prefix-accumulation assertions and extending LTL with path-accumulation assertions, result in temporal logics whose model-checking problem is decidable. The extended logics allow to significantly extend the currently known energy and mean-payoff objectives. Moreover, the prefix-accumulation assertions may be refined with “controlled-accumulation”, allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that the fragment we point to is, in a sense, the maximal logic whose extension with prefix-accumulation assertions permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, and in particular CTL and LTL, makes the problem undecidable."}],"oa_version":"Published Version","alternative_title":["IST Austria Technical Report"],"month":"04","date_updated":"2023-02-23T11:23:41Z","ddc":["000","004"],"file_date_updated":"2020-07-14T12:46:41Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"_id":"5385","type":"technical_report","status":"public","pubrep_id":"21"},{"author":[{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Wies","full_name":"Wies, Thomas"},{"first_name":"Marco","last_name":"Muñiz","full_name":"Muñiz, Marco"},{"full_name":"Kuncak, Viktor","last_name":"Kuncak","first_name":"Viktor"}],"title":"On an efficient decision procedure for imperative tree data structures","file_date_updated":"2020-07-14T12:46:40Z","department":[{"_id":"ToHe"}],"citation":{"chicago":"Wies, Thomas, Marco Muñiz, and Viktor Kuncak. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0005.","ista":"Wies T, Muñiz M, Kuncak V. 2011. On an efficient decision procedure for imperative tree data structures, IST Austria, 25p.","mla":"Wies, Thomas, et al. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria, 2011, doi:10.15479/AT:IST-2011-0005.","apa":"Wies, T., Muñiz, M., & Kuncak, V. (2011). On an efficient decision procedure for imperative tree data structures. IST Austria. https://doi.org/10.15479/AT:IST-2011-0005","ama":"Wies T, Muñiz M, Kuncak V. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria; 2011. doi:10.15479/AT:IST-2011-0005","short":"T. Wies, M. Muñiz, V. Kuncak, On an Efficient Decision Procedure for Imperative Tree Data Structures, IST Austria, 2011.","ieee":"T. Wies, M. Muñiz, and V. Kuncak, On an efficient decision procedure for imperative tree data structures. IST Austria, 2011."},"date_updated":"2023-02-23T11:22:16Z","ddc":["000","006"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"technical_report","pubrep_id":"19","status":"public","_id":"5383","page":"25","date_created":"2018-12-12T11:39:01Z","doi":"10.15479/AT:IST-2011-0005","related_material":{"record":[{"relation":"later_version","id":"3323","status":"public"}]},"date_published":"2011-04-26T00:00:00Z","publication_status":"published","year":"2011","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"language":[{"iso":"eng"}],"day":"26","file":[{"date_updated":"2020-07-14T12:46:40Z","file_size":619053,"creator":"system","date_created":"2018-12-12T11:53:01Z","file_name":"IST-2011-0005_IST-2011-0005.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"b20029184c4a819c5f4466a4a3d238b5","file_id":"5462"}],"oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"month":"04","abstract":[{"text":"We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invariants. We show that our logic is closed under weakest precondition computation, which enables its use for automated software verification. We further show that satisfiability of formulas in TREX is decidable in NP. The low complexity makes it an attractive alternative to more expensive logics such as monadic second-order logic (MSOL) over trees, which have been traditionally used for reasoning about tree data structures.","lang":"eng"}],"oa_version":"Published Version"},{"year":"2011","publication_status":"published","language":[{"iso":"eng"}],"day":"19","page":"476 - 491","date_created":"2018-12-11T12:02:40Z","doi":"10.1007/978-3-642-22438-6_36","related_material":{"record":[{"relation":"earlier_version","id":"5383","status":"public"}]},"date_published":"2011-07-19T00:00:00Z","volume":6803,"abstract":[{"lang":"eng","text":"We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invariants. We show that our logic is closed under weakest precondition computation, which enables its use for automated software verification. We further show that satisfiability of formulas in TREX is decidable in NP. The low complexity makes it an attractive alternative to more expensive logics such as monadic second-order logic (MSOL) over trees, which have been traditionally used for reasoning about tree data structures."}],"oa_version":"None","scopus_import":1,"alternative_title":["LNAI "],"quality_controlled":"1","publisher":"Springer","intvolume":" 6803","month":"07","citation":{"ieee":"T. Wies, M. Muñiz, and V. Kuncak, “An efficient decision procedure for imperative tree data structures,” presented at the CADE 23: Automated Deduction , Wrocław, Poland, 2011, vol. 6803, pp. 476–491.","short":"T. Wies, M. Muñiz, V. Kuncak, in:, Springer, 2011, pp. 476–491.","apa":"Wies, T., Muñiz, M., & Kuncak, V. (2011). An efficient decision procedure for imperative tree data structures (Vol. 6803, pp. 476–491). Presented at the CADE 23: Automated Deduction , Wrocław, Poland: Springer. https://doi.org/10.1007/978-3-642-22438-6_36","ama":"Wies T, Muñiz M, Kuncak V. An efficient decision procedure for imperative tree data structures. In: Vol 6803. Springer; 2011:476-491. doi:10.1007/978-3-642-22438-6_36","mla":"Wies, Thomas, et al. An Efficient Decision Procedure for Imperative Tree Data Structures. Vol. 6803, Springer, 2011, pp. 476–91, doi:10.1007/978-3-642-22438-6_36.","ista":"Wies T, Muñiz M, Kuncak V. 2011. An efficient decision procedure for imperative tree data structures. CADE 23: Automated Deduction , LNAI , vol. 6803, 476–491.","chicago":"Wies, Thomas, Marco Muñiz, and Viktor Kuncak. “An Efficient Decision Procedure for Imperative Tree Data Structures,” 6803:476–91. Springer, 2011. https://doi.org/10.1007/978-3-642-22438-6_36."},"date_updated":"2023-02-23T12:23:48Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Wies, Thomas","last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Muñiz, Marco","last_name":"Muñiz","first_name":"Marco"},{"first_name":"Viktor","last_name":"Kuncak","full_name":"Kuncak, Viktor"}],"publist_id":"3312","department":[{"_id":"ToHe"}],"title":"An efficient decision procedure for imperative tree data structures","_id":"3323","conference":{"end_date":"2011-08-05","location":"Wrocław, Poland","start_date":"2011-07-31","name":"CADE 23: Automated Deduction "},"type":"conference","status":"public"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. 2011. Quantitative synthesis for concurrent programs. CAV: Computer Aided Verification, LNCS, vol. 6806, 243–259.","chicago":"Cerny, Pavol, Krishnendu Chatterjee, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. “Quantitative Synthesis for Concurrent Programs.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:243–59. Springer, 2011. https://doi.org/10.1007/978-3-642-22110-1_20.","ama":"Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. Quantitative synthesis for concurrent programs. In: Gopalakrishnan G, Qadeer S, eds. Vol 6806. Springer; 2011:243-259. doi:10.1007/978-3-642-22110-1_20","apa":"Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_20","short":"P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.","ieee":"P. Cerny, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh, “Quantitative synthesis for concurrent programs,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 243–259.","mla":"Cerny, Pavol, et al. Quantitative Synthesis for Concurrent Programs. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 243–59, doi:10.1007/978-3-642-22110-1_20."},"title":"Quantitative synthesis for concurrent programs","editor":[{"first_name":"Ganesh","last_name":"Gopalakrishnan","full_name":"Gopalakrishnan, Ganesh"},{"first_name":"Shaz","full_name":"Qadeer, Shaz","last_name":"Qadeer"}],"author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","full_name":"Cerny, Pavol","last_name":"Cerny"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna"},{"full_name":"Singh, Rohit","last_name":"Singh","first_name":"Rohit"}],"publist_id":"3247","article_processing_charge":"No","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"grant_number":"214373","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"day":"21","has_accepted_license":"1","year":"2011","doi":"10.1007/978-3-642-22110-1_20","date_published":"2011-04-21T00:00:00Z","date_created":"2018-12-11T12:02:55Z","page":"243 - 259","quality_controlled":"1","publisher":"Springer","oa":1,"ddc":["000","004"],"date_updated":"2023-02-23T12:24:01Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:10Z","_id":"3366","status":"public","pubrep_id":"76","type":"conference","conference":{"name":"CAV: Computer Aided Verification","start_date":"2011-07-14","end_date":"2011-07-20","location":"Snowbird, USA"},"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"c033689355f45742dc7c99b5af13ce7a","file_id":"5174","date_updated":"2020-07-14T12:46:10Z","file_size":508946,"creator":"system","date_created":"2018-12-12T10:15:51Z","file_name":"IST-2012-76-v1+1_Quantitative_synthesis_for_concurrent_programs.pdf"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":6806,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5388"}]},"ec_funded":1,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We present an algorithmic method for the quantitative, performance-aware synthesis of concurrent programs. The input consists of a nondeterministic partial program and of a parametric performance model. The nondeterminism allows the programmer to omit which (if any) synchronization construct is used at a particular program location. The performance model, specified as a weighted automaton, can capture system architectures by assigning different costs to actions such as locking, context switching, and memory and cache accesses. The quantitative synthesis problem is to automatically resolve the nondeterminism of the partial program so that both correctness is guaranteed and performance is optimal. As is standard for shared memory concurrency, correctness is formalized "specification free", in particular as race freedom or deadlock freedom. For worst-case (average-case) performance, we show that the problem can be reduced to 2-player graph games (with probabilistic transitions) with quantitative objectives. While we show, using game-theoretic methods, that the synthesis problem is Nexp-complete, we present an algorithmic method and an implementation that works efficiently for concurrent programs and performance models of practical interest. We have implemented a prototype tool and used it to synthesize finite-state concurrent programs that exhibit different programming patterns, for several performance models representing different architectures. "}],"month":"04","intvolume":" 6806","alternative_title":["LNCS"]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer Nature, Berlin, Heidelberg, 2010, pp. 103–118.","ieee":"R. Blanc, T. A. Henzinger, T. Hottelier, and L. Kovács, “ABC: Algebraic Bound Computation for loops,” in Logic for Programming, Artificial Intelligence, and Reasoning, Dakar, Senegal, 2010, vol. 6355, pp. 103–118.","apa":"Blanc, R., Henzinger, T. A., Hottelier, T., & Kovács, L. (2010). ABC: Algebraic Bound Computation for loops. In E. M. Clarke & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (Vol. 6355, pp. 103–118). Berlin, Heidelberg: Springer Nature. https://doi.org/10.1007/978-3-642-17511-4_7","ama":"Blanc R, Henzinger TA, Hottelier T, Kovács L. ABC: Algebraic Bound Computation for loops. In: Clarke EM, Voronkov A, eds. Logic for Programming, Artificial Intelligence, and Reasoning. Vol 6355. LNCS. Berlin, Heidelberg: Springer Nature; 2010:103-118. doi:10.1007/978-3-642-17511-4_7","mla":"Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.” Logic for Programming, Artificial Intelligence, and Reasoning, edited by Edmund M Clarke and Andrei Voronkov, vol. 6355, Springer Nature, 2010, pp. 103–18, doi:10.1007/978-3-642-17511-4_7.","ista":"Blanc R, Henzinger TA, Hottelier T, Kovács L. 2010. ABC: Algebraic Bound Computation for loops. Logic for Programming, Artificial Intelligence, and Reasoning. LPAR: Conference on Logic for Programming, Artificial Intelligence and ReasoningLNCS vol. 6355, 103–118.","chicago":"Blanc, Régis, Thomas A Henzinger, Thibaud Hottelier, and Laura Kovács. “ABC: Algebraic Bound Computation for Loops.” In Logic for Programming, Artificial Intelligence, and Reasoning, edited by Edmund M Clarke and Andrei Voronkov, 6355:103–18. LNCS. Berlin, Heidelberg: Springer Nature, 2010. https://doi.org/10.1007/978-3-642-17511-4_7."},"editor":[{"last_name":"Clarke","full_name":"Clarke, Edmund M","first_name":"Edmund M"},{"full_name":"Voronkov, Andrei","last_name":"Voronkov","first_name":"Andrei"}],"title":"ABC: Algebraic Bound Computation for loops","author":[{"first_name":"Régis","full_name":"Blanc, Régis","last_name":"Blanc"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Thibaud","full_name":"Hottelier, Thibaud","last_name":"Hottelier"},{"last_name":"Kovács","full_name":"Kovács, Laura","first_name":"Laura"}],"article_processing_charge":"No","day":"01","publication":"Logic for Programming, Artificial Intelligence, and Reasoning","year":"2010","doi":"10.1007/978-3-642-17511-4_7","date_published":"2010-05-01T00:00:00Z","date_created":"2022-03-21T08:14:35Z","page":"103-118","acknowledgement":"This work was supported in part by the Swiss NSF. The fourth author is supported by an FWF Hertha Firnberg Research grant (T425-N23).","quality_controlled":"1","publisher":"Springer Nature","oa":1,"date_updated":"2022-06-13T07:44:21Z","department":[{"_id":"ToHe"}],"series_title":"LNCS","_id":"10908","status":"public","type":"conference","conference":{"location":"Dakar, Senegal","end_date":"2010-05-01","start_date":"2010-04-25","name":"LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning"},"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783642175107"],"issn":["0302-9743"],"eisbn":["9783642175114"]},"publication_status":"published","volume":6355,"oa_version":"Submitted Version","abstract":[{"text":"We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis of programs with symbolic summation techniques to derive loop invariant relations between program variables. Iteration bounds are obtained from the inferred invariants, by replacing variables with bounds on their greatest values. We have successfully applied ABC to a large number of examples. The derived symbolic bounds express non-trivial polynomial relations over loop variables. We also report on results to automatically infer symbolic expressions over harmonic numbers as upper bounds on loop iteration counts.","lang":"eng"}],"month":"05","place":"Berlin, Heidelberg","intvolume":" 6355","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://infoscience.epfl.ch/record/186096"}]},{"title":"Lumpability abstractions of rule-based systems","external_id":{"arxiv":["1011.0496"]},"publist_id":"2511","author":[{"first_name":"Jérôme","full_name":"Feret, Jérôme","last_name":"Feret"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Heinz","last_name":"Koeppl","full_name":"Koeppl, Heinz"},{"first_name":"Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrov","orcid":"0000-0002-9041-0905","full_name":"Petrov, Tatjana"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","mla":"Feret, Jérôme, et al. Lumpability Abstractions of Rule-Based Systems. Vol. 40, Open Publishing Association, 2010, pp. 142–61.","short":"J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, in:, Open Publishing Association, 2010, pp. 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.","ama":"Feret J, Henzinger TA, Koeppl H, Petrov T. Lumpability abstractions of rule-based systems. In: Vol 40. Open Publishing Association; 2010:142-161.","apa":"Feret, J., Henzinger, T. A., Koeppl, H., & 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."},"oa":1,"quality_controlled":"1","publisher":"Open Publishing Association","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.","date_created":"2018-12-11T12:04:47Z","date_published":"2010-10-30T00:00:00Z","page":"142-161","day":"30","year":"2010","has_accepted_license":"1","status":"public","conference":{"name":"MECBIC: Membrane Computing and Biologically Inspired Process Calculi","location":"Jena, Germany","end_date":"2010-08-23","start_date":"2010-08-23"},"type":"conference","_id":"3719","department":[{"_id":"ToHe"},{"_id":"CaGu"}],"file_date_updated":"2020-07-14T12:46:14Z","ddc":["570"],"date_updated":"2023-02-23T11:15:19Z","intvolume":" 40","month":"10","scopus_import":1,"alternative_title":["EPTCS"],"oa_version":"Submitted Version","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"}],"related_material":{"record":[{"status":"public","id":"3168","relation":"later_version"}]},"volume":40,"language":[{"iso":"eng"}],"file":[{"creator":"kschuh","file_size":907155,"date_updated":"2020-07-14T12:46:14Z","file_name":"Lumpability_abstractions_of_rule-based_systems.pdf","date_created":"2019-01-31T12:09:09Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5904","checksum":"eaaba991a86fff37606b0eb5196878e8"}],"publication_status":"published"},{"language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:09:03Z","file_name":"IST-2012-63-v1+1_SABRE-A_tool_for_the_stochastic_analysis_of_biochemical_reaction_networks.pdf","creator":"system","date_updated":"2020-07-14T12:46:17Z","file_size":433824,"file_id":"4726","checksum":"38707b149d2174f01be406e794ffa849","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"publication_status":"published","month":"10","scopus_import":1,"oa_version":"Submitted Version","abstract":[{"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.","lang":"eng"}],"department":[{"_id":"ToHe"},{"_id":"CaGu"}],"file_date_updated":"2020-07-14T12:46:17Z","ddc":["004"],"date_updated":"2021-01-12T07:52:37Z","pubrep_id":"63","status":"public","conference":{"start_date":"2010-09-15","location":"Williamsburg, USA","end_date":"2010-09-18","name":"QEST: Quantitative Evaluation of Systems"},"type":"conference","_id":"3847","date_created":"2018-12-11T12:05:29Z","doi":"10.1109/QEST.2010.33","date_published":"2010-10-14T00:00:00Z","page":"193 - 194","day":"14","year":"2010","has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"IEEE","title":"SABRE: A tool for the stochastic analysis of biochemical reaction networks","author":[{"first_name":"Frédéric","full_name":"Didier, Frédéric","last_name":"Didier"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"first_name":"Maria","full_name":"Mateescu, Maria","last_name":"Mateescu"},{"last_name":"Wolf","full_name":"Wolf, Verena","first_name":"Verena"}],"publist_id":"2339","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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. https://doi.org/10.1109/QEST.2010.33.","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.","short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, IEEE, 2010, pp. 193–194.","apa":"Didier, F., Henzinger, T. A., Mateescu, M., & 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. https://doi.org/10.1109/QEST.2010.33","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:10.1109/QEST.2010.33","mla":"Didier, Frédéric, et al. SABRE: A Tool for the Stochastic Analysis of Biochemical Reaction Networks. IEEE, 2010, pp. 193–94, doi:10.1109/QEST.2010.33."}},{"file_date_updated":"2020-07-14T12:46:17Z","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T07:52:37Z","ddc":["005"],"type":"conference","conference":{"start_date":"2010-10-10","location":"Yogyakarta, Indonesia","end_date":"2010-10-15","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning"},"status":"public","pubrep_id":"64","_id":"3845","volume":6397,"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"4790","checksum":"913af269da6710f2174f470b48ab7a82","creator":"system","file_size":186143,"date_updated":"2020-07-14T12:46:17Z","file_name":"IST-2012-64-v1+1_Aligators_for_arrays.pdf","date_created":"2018-12-12T10:10:05Z"}],"language":[{"iso":"eng"}],"alternative_title":["LNCS"],"scopus_import":1,"month":"10","intvolume":" 6397","abstract":[{"lang":"eng","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."}],"oa_version":"Submitted Version","author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hottelier, Thibaud","last_name":"Hottelier","first_name":"Thibaud"},{"last_name":"Kovács","full_name":"Kovács, Laura","first_name":"Laura"},{"last_name":"Rybalchenko","full_name":"Rybalchenko, Andrey","first_name":"Andrey"}],"publist_id":"2342","title":"Aligators for arrays","citation":{"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.","chicago":"Henzinger, Thomas A, Thibaud Hottelier, Laura Kovács, and Andrey Rybalchenko. “Aligators for Arrays,” 6397:348–56. Springer, 2010. https://doi.org/10.1007/978-3-642-16242-8_25.","ama":"Henzinger TA, Hottelier T, Kovács L, Rybalchenko A. Aligators for arrays. In: Vol 6397. Springer; 2010:348-356. doi:10.1007/978-3-642-16242-8_25","apa":"Henzinger, T. A., Hottelier, T., Kovács, L., & 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. https://doi.org/10.1007/978-3-642-16242-8_25","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.","short":"T.A. Henzinger, T. Hottelier, L. Kovács, A. Rybalchenko, in:, Springer, 2010, pp. 348–356.","mla":"Henzinger, Thomas A., et al. Aligators for Arrays. Vol. 6397, Springer, 2010, pp. 348–56, doi:10.1007/978-3-642-16242-8_25."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","page":"348 - 356","date_published":"2010-10-01T00:00:00Z","doi":"10.1007/978-3-642-16242-8_25","date_created":"2018-12-11T12:05:29Z","has_accepted_license":"1","year":"2010","day":"01","publisher":"Springer","quality_controlled":"1","oa":1},{"title":"Fast adaptive uniformization of the chemical master equation","author":[{"last_name":"Didier","full_name":"Didier, Frédéric","first_name":"Frédéric"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Maria","last_name":"Mateescu","full_name":"Mateescu, Maria"},{"first_name":"Verena","full_name":"Wolf, Verena","last_name":"Wolf"}],"publist_id":"2349","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Didier, Frédéric, et al. “Fast Adaptive Uniformization of the Chemical Master Equation.” IET Systems Biology, vol. 4, no. 6, Institution of Engineering and Technology, 2010, pp. 441–52, doi:10.1049/iet-syb.2010.0005.","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Fast adaptive uniformization of the chemical master equation,” IET Systems Biology, vol. 4, no. 6. Institution of Engineering and Technology, pp. 441–452, 2010.","short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, IET Systems Biology 4 (2010) 441–452.","apa":"Didier, F., Henzinger, T. A., Mateescu, M., & Wolf, V. (2010). Fast adaptive uniformization of the chemical master equation. IET Systems Biology. Institution of Engineering and Technology. https://doi.org/10.1049/iet-syb.2010.0005","ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. Fast adaptive uniformization of the chemical master equation. IET Systems Biology. 2010;4(6):441-452. doi:10.1049/iet-syb.2010.0005","chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Fast Adaptive Uniformization of the Chemical Master Equation.” IET Systems Biology. Institution of Engineering and Technology, 2010. https://doi.org/10.1049/iet-syb.2010.0005.","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."},"publisher":"Institution of Engineering and Technology","quality_controlled":"1","oa":1,"date_published":"2010-11-15T00:00:00Z","doi":"10.1049/iet-syb.2010.0005","date_created":"2018-12-11T12:05:28Z","page":"441 - 452","day":"15","publication":"IET Systems Biology","has_accepted_license":"1","year":"2010","status":"public","pubrep_id":"66","type":"journal_article","_id":"3842","file_date_updated":"2020-07-14T12:46:16Z","department":[{"_id":"ToHe"}],"ddc":["570"],"date_updated":"2023-02-23T11:45:08Z","month":"11","intvolume":" 4","scopus_import":1,"oa_version":"Submitted Version","abstract":[{"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.","lang":"eng"}],"volume":4,"related_material":{"record":[{"id":"3843","status":"public","relation":"earlier_version"}]},"issue":"6","file":[{"file_size":222890,"date_updated":"2020-07-14T12:46:16Z","creator":"system","file_name":"IST-2012-66-v1+1_Fast_adaptive_uniformization_of_the_chemical_master_equation.pdf","date_created":"2018-12-12T10:17:02Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5254","checksum":"9a3bde48f43203991a0b3c6a277c2f5b"}],"language":[{"iso":"eng"}],"publication_status":"published"},{"date_updated":"2023-02-23T10:12:00Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"_id":"3856","pubrep_id":"60","status":"public","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2010-08-27","location":"Brno, Czech Republic","start_date":"2010-08-23"},"type":"conference","language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"related_material":{"record":[{"status":"public","id":"1731","relation":"later_version"}]},"volume":6281,"oa_version":"Preprint","abstract":[{"text":"We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided complete-observation (one player has complete observation); and (c) complete-observation (both players have complete view of the game). On the basis of mode of interaction we have the following classification: (a) concurrent (players interact simultaneously); and (b) turn-based (players interact in turn). The two sources of randomness in these games are randomness in transition function and randomness in strategies. In general, randomized strategies are more powerful than deterministic strategies, and randomness in transitions gives more general classes of games. We present a complete characterization for the classes of games where randomness is not helpful in: (a) the transition function (probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies). As consequence of our characterization we obtain new undecidability results for these games. ","lang":"eng"}],"intvolume":" 6281","month":"09","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1006.0673v1"}],"scopus_import":1,"alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free,” 6281:246–57. Springer, 2010. https://doi.org/10.1007/978-3-642-15155-2_23.","ista":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2010. Randomness for free. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 246–257.","mla":"Chatterjee, Krishnendu, et al. Randomness for Free. Vol. 6281, Springer, 2010, pp. 246–57, doi:10.1007/978-3-642-15155-2_23.","ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 246–257.","short":"K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, in:, Springer, 2010, pp. 246–257.","ama":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. Randomness for free. In: Vol 6281. Springer; 2010:246-257. doi:10.1007/978-3-642-15155-2_23","apa":"Chatterjee, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2010). Randomness for free (Vol. 6281, pp. 246–257). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-15155-2_23"},"title":"Randomness for free","publist_id":"2325","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":"Gimbert, Hugo","last_name":"Gimbert","first_name":"Hugo"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"project":[{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"day":"06","year":"2010","date_created":"2018-12-11T12:05:32Z","date_published":"2010-09-06T00:00:00Z","doi":"10.1007/978-3-642-15155-2_23","page":"246 - 257","acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","oa":1,"publisher":"Springer","quality_controlled":"1"},{"publist_id":"2322","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"editor":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"title":"Formal modeling and analysis of timed systems","date_updated":"2019-11-14T08:42:42Z","citation":{"ista":"Chatterjee K, Henzinger TA eds. 2010. Formal modeling and analysis of timed systems, Springer,p.","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger, eds. Formal Modeling and Analysis of Timed Systems. Vol. 6246. Springer, 2010. https://doi.org/10.1007/978-3-642-15297-9.","ieee":"K. Chatterjee and T. A. Henzinger, Eds., Formal modeling and analysis of timed systems, vol. 6246. Springer, 2010.","short":"K. Chatterjee, T.A. Henzinger, eds., Formal Modeling and Analysis of Timed Systems, Springer, 2010.","ama":"Chatterjee K, Henzinger TA, eds. Formal Modeling and Analysis of Timed Systems. Vol 6246. Springer; 2010. doi:10.1007/978-3-642-15297-9","apa":"Chatterjee, K., & Henzinger, T. A. (Eds.). (2010). Formal modeling and analysis of timed systems (Vol. 6246). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-15297-9","mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger, editors. Formal Modeling and Analysis of Timed Systems. Vol. 6246, Springer, 2010, doi:10.1007/978-3-642-15297-9."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","type":"conference_editor","conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems","start_date":"2010-09-08","location":"Klosterneuburg, Austria","end_date":"2010-09-10"},"status":"public","_id":"3859","volume":6246,"related_material":{"link":[{"relation":"other","url":"https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=12721","description":"eBook available via IST BookList"}]},"doi":"10.1007/978-3-642-15297-9","date_published":"2010-09-20T00:00:00Z","date_created":"2018-12-11T12:05:33Z","year":"2010","publication_status":"published","day":"20","language":[{"iso":"eng"}],"publisher":"Springer","quality_controlled":"1","alternative_title":["LNCS"],"month":"09","intvolume":" 6246","abstract":[{"lang":"eng","text":"This book constitutes the proceedings of the 8th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2010, held in Klosterneuburg, Austria in September 2010. The 14 papers presented were carefully reviewed and selected from 31 submissions. In addition, the volume contains 3 invited talks and 2 invited tutorials.The aim of FORMATS is to promote the study of fundamental and practical aspects of timed systems, and to bring together researchers from different disciplines that share an interest in the modeling and analysis of timed systems. Typical topics include foundations and semantics, methods and tools, and applications."}],"oa_version":"None"},{"status":"public","pubrep_id":"54","type":"conference","conference":{"location":"Edinburgh, UK","end_date":"2010-07-19","start_date":"2010-07-15","name":"CAV: Computer Aided Verification"},"_id":"3866","file_date_updated":"2020-07-14T12:46:19Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"ddc":["004"],"date_updated":"2021-01-12T07:52:47Z","month":"07","intvolume":" 6174","scopus_import":1,"alternative_title":["LNCS"],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Systems ought to behave reasonably even in circumstances that are not anticipated in their specifications. We propose a definition of robustness for liveness specifications which prescribes, for any number of environment assumptions that are violated, a minimal number of system guarantees that must still be fulfilled. This notion of robustness can be formulated and realized using a Generalized Reactivity formula. We present an algorithm for synthesizing robust systems from such formulas. For the important special case of Generalized Reactivity formulas of rank 1, our algorithm improves the complexity of [PPS06] for large specifications with a small number of assumptions and guarantees."}],"volume":6174,"ec_funded":1,"file":[{"date_created":"2018-12-12T10:16:52Z","file_name":"IST-2012-54-v1+1_Robustness_in_the_presence_of_liveness.pdf","date_updated":"2020-07-14T12:46:19Z","file_size":213083,"creator":"system","checksum":"9d204611c8d7855bed8134f8708a0010","file_id":"5243","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_status":"published","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems"}],"title":"Robustness in the presence of liveness","editor":[{"last_name":"Touili","full_name":"Touili, Tayssir","first_name":"Tayssir"},{"first_name":"Byron","last_name":"Cook","full_name":"Cook, Byron"},{"full_name":"Jackson, Paul","last_name":"Jackson","first_name":"Paul"}],"publist_id":"2310","author":[{"last_name":"Bloem","full_name":"Bloem, Roderick","first_name":"Roderick"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Karin","full_name":"Greimel, Karin","last_name":"Greimel"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"last_name":"Jobstmann","full_name":"Jobstmann, Barbara","first_name":"Barbara"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Bloem, Roderick, et al. Robustness in the Presence of Liveness. Edited by Tayssir Touili et al., vol. 6174, Springer, 2010, pp. 410–24, doi:10.1007/978-3-642-14295-6_36.","ama":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. Robustness in the presence of liveness. In: Touili T, Cook B, Jackson P, eds. Vol 6174. Springer; 2010:410-424. doi:10.1007/978-3-642-14295-6_36","apa":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann, B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, & P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. https://doi.org/10.1007/978-3-642-14295-6_36","ieee":"R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Robustness in the presence of liveness,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 410–424.","short":"R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, T. Touili, B. Cook, P. Jackson (Eds.), Springer, 2010, pp. 410–424.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Robustness in the Presence of Liveness.” edited by Tayssir Touili, Byron Cook, and Paul Jackson, 6174:410–24. Springer, 2010. https://doi.org/10.1007/978-3-642-14295-6_36.","ista":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2010. Robustness in the presence of liveness. CAV: Computer Aided Verification, LNCS, vol. 6174, 410–424."},"publisher":"Springer","quality_controlled":"1","oa":1,"doi":"10.1007/978-3-642-14295-6_36","date_published":"2010-07-01T00:00:00Z","date_created":"2018-12-11T12:05:36Z","page":"410 - 424","day":"01","has_accepted_license":"1","year":"2010"},{"quality_controlled":"1","publisher":"Springer","oa":1,"day":"08","has_accepted_license":"1","year":"2010","date_published":"2010-09-08T00:00:00Z","doi":"10.1007/978-3-642-15297-9_13","date_created":"2018-12-11T12:08:30Z","page":"152 - 167","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"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Nickovic, D., & Piterman, N. (2010). From MTL to deterministic timed automata. In T. A. Henzinger & K. Chatterjee (Eds.) (Vol. 6246, pp. 152–167). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-15297-9_13","ama":"Nickovic D, Piterman N. From MTL to deterministic timed automata. In: Henzinger TA, Chatterjee K, eds. Vol 6246. Springer; 2010:152-167. doi:10.1007/978-3-642-15297-9_13","ieee":"D. Nickovic and N. Piterman, “From MTL to deterministic timed automata,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria, 2010, vol. 6246, pp. 152–167.","short":"D. Nickovic, N. Piterman, in:, T.A. Henzinger, K. Chatterjee (Eds.), Springer, 2010, pp. 152–167.","mla":"Nickovic, Dejan, and Nir Piterman. From MTL to Deterministic Timed Automata. Edited by Thomas A. Henzinger and Krishnendu Chatterjee, vol. 6246, Springer, 2010, pp. 152–67, doi:10.1007/978-3-642-15297-9_13.","ista":"Nickovic D, Piterman N. 2010. From MTL to deterministic timed automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6246, 152–167.","chicago":"Nickovic, Dejan, and Nir Piterman. “From MTL to Deterministic Timed Automata.” edited by Thomas A. Henzinger and Krishnendu Chatterjee, 6246:152–67. Springer, 2010. https://doi.org/10.1007/978-3-642-15297-9_13."},"title":"From MTL to deterministic timed automata","editor":[{"first_name":"Thomas A.","last_name":"Henzinger","full_name":"Henzinger, Thomas A."},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"}],"author":[{"full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nir","last_name":"Piterman","full_name":"Piterman, Nir"}],"publist_id":"1090","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"In this paper we propose a novel technique for constructing timed automata from properties expressed in the logic mtl, under bounded-variability assumptions. We handle full mtl and include all future operators. Our construction is based on separation of the continuous time monitoring of the input sequence and discrete predictions regarding the future. The separation of the continuous from the discrete allows us to determinize our automata in an exponential construction that does not increase the number of clocks. This leads to a doubly exponential construction from mtl to deterministic timed automata, compared with triply exponential using existing approaches. We offer an alternative to the existing approach to linear real-time model checking, which has never been implemented. It further offers a unified framework for model checking, runtime monitoring, and synthesis, in an approach that can reuse tools, implementations, and insights from the discrete setting."}],"month":"09","intvolume":" 6246","alternative_title":["LNCS"],"scopus_import":1,"file":[{"checksum":"b0ca5f5fbe8a3d20ccbc6f51a344a459","file_id":"5028","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2012-49-v1+1_From_MTL_to_deterministic_timed_automata.pdf","date_created":"2018-12-12T10:13:43Z","file_size":249789,"date_updated":"2020-07-14T12:46:27Z","creator":"system"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":6246,"ec_funded":1,"_id":"4369","status":"public","pubrep_id":"49","type":"conference","conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems","start_date":"2010-09-08","location":"Klosterneuburg, Austria","end_date":"2010-09-10"},"ddc":["004"],"date_updated":"2021-01-12T07:56:27Z","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:27Z"},{"department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:16Z","date_updated":"2021-01-12T07:52:32Z","ddc":["005"],"type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","pubrep_id":"72","_id":"3834","volume":4,"issue":"42","license":"https://creativecommons.org/licenses/by/4.0/","publication_status":"published","file":[{"file_id":"5217","checksum":"220239fae76f7b03c4d7f05d74ef426f","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2012-72-v1+1_Solving_the_chemical_master_equation_using_sliding_windows.pdf","date_created":"2018-12-12T10:16:29Z","file_size":1919130,"date_updated":"2020-07-14T12:46:16Z","creator":"system"}],"language":[{"iso":"eng"}],"scopus_import":1,"month":"04","intvolume":" 4","abstract":[{"lang":"eng","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 "window" 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."}],"oa_version":"Published Version","author":[{"full_name":"Wolf, Verena","last_name":"Wolf","first_name":"Verena"},{"full_name":"Goel, Rushil","last_name":"Goel","first_name":"Rushil"},{"last_name":"Mateescu","full_name":"Mateescu, Maria","id":"3B43276C-F248-11E8-B48F-1D18A9856A87","first_name":"Maria"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"publist_id":"2374","title":"Solving the chemical master equation using sliding windows","citation":{"chicago":"Wolf, Verena, Rushil Goel, Maria Mateescu, and Thomas A Henzinger. “Solving the Chemical Master Equation Using Sliding Windows.” BMC Systems Biology. BioMed Central, 2010. https://doi.org/10.1186/1752-0509-4-42.","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.","mla":"Wolf, Verena, et al. “Solving the Chemical Master Equation Using Sliding Windows.” BMC Systems Biology, vol. 4, no. 42, BioMed Central, 2010, pp. 1–19, doi:10.1186/1752-0509-4-42.","ieee":"V. Wolf, R. Goel, M. Mateescu, and T. A. Henzinger, “Solving the chemical master equation using sliding windows,” BMC Systems Biology, vol. 4, no. 42. BioMed Central, pp. 1–19, 2010.","short":"V. Wolf, R. Goel, M. Mateescu, T.A. Henzinger, BMC Systems Biology 4 (2010) 1–19.","apa":"Wolf, V., Goel, R., Mateescu, M., & Henzinger, T. A. (2010). Solving the chemical master equation using sliding windows. BMC Systems Biology. BioMed Central. https://doi.org/10.1186/1752-0509-4-42","ama":"Wolf V, Goel R, Mateescu M, Henzinger TA. Solving the chemical master equation using sliding windows. BMC Systems Biology. 2010;4(42):1-19. doi:10.1186/1752-0509-4-42"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","page":"1 - 19","doi":"10.1186/1752-0509-4-42","date_published":"2010-04-08T00:00:00Z","date_created":"2018-12-11T12:05:25Z","has_accepted_license":"1","year":"2010","day":"08","publication":"BMC Systems Biology","quality_controlled":"1","publisher":"BioMed Central","oa":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."},{"citation":{"ista":"Henzinger TA. 2010. From boolean to quantitative notions of correctness. POPL: Principles of Programming Languages vol. 45, 157–158.","chicago":"Henzinger, Thomas A. “From Boolean to Quantitative Notions of Correctness,” 45:157–58. ACM, 2010. https://doi.org/10.1145/1706299.1706319.","short":"T.A. Henzinger, in:, ACM, 2010, pp. 157–158.","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.","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. https://doi.org/10.1145/1706299.1706319","ama":"Henzinger TA. From boolean to quantitative notions of correctness. In: Vol 45. ACM; 2010:157-158. doi:10.1145/1706299.1706319","mla":"Henzinger, Thomas A. From Boolean to Quantitative Notions of Correctness. Vol. 45, no. 1, ACM, 2010, pp. 157–58, doi:10.1145/1706299.1706319."},"date_updated":"2021-01-12T07:52:34Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"publist_id":"2354","department":[{"_id":"ToHe"}],"title":"From boolean to quantitative notions of correctness","_id":"3840","type":"conference","conference":{"name":"POPL: Principles of Programming Languages","end_date":"2010-01-23","location":"Madrid, Spain","start_date":"2010-01-17"},"status":"public","year":"2010","publication_status":"published","day":"17","language":[{"iso":"eng"}],"page":"157 - 158","issue":"1","volume":45,"date_published":"2010-01-17T00:00:00Z","doi":"10.1145/1706299.1706319","date_created":"2018-12-11T12:05:27Z","abstract":[{"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.","lang":"eng"}],"oa_version":"None","acknowledgement":"This talk surveys joint work with Roderick Bloem, Krishnendu Chatterjee, Laurent Doyen, and Barbara Jobstmann.","quality_controlled":"1","scopus_import":1,"publisher":"ACM","month":"01","intvolume":" 45"},{"department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:16Z","date_updated":"2021-01-12T07:52:33Z","ddc":["005"],"conference":{"name":"VMCAI: Verification, Model Checking and Abstract Interpretation","location":"Madrid, Spain","end_date":"2010-01-19","start_date":"2010-01-17"},"type":"conference","pubrep_id":"69","status":"public","_id":"3839","volume":5944,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:13:09Z","file_name":"IST-2012-69-v1+1_Invariant_and_type_inference_for_matrices.pdf","date_updated":"2020-07-14T12:46:16Z","file_size":251265,"creator":"system","file_id":"4989","checksum":"da69b13a2d9a7a316c909e09c1090cef","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"alternative_title":["LNCS"],"scopus_import":1,"intvolume":" 5944","month":"01","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."}],"oa_version":"Submitted Version","publist_id":"2357","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Thibaud","last_name":"Hottelier","full_name":"Hottelier, Thibaud"},{"full_name":"Kovács, Laura","last_name":"Kovács","first_name":"Laura"},{"first_name":"Andrei","full_name":"Voronkov, Andrei","last_name":"Voronkov"}],"title":"Invariant and type inference for matrices","citation":{"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.","chicago":"Henzinger, Thomas A, Thibaud Hottelier, Laura Kovács, and Andrei Voronkov. “Invariant and Type Inference for Matrices,” 5944:163–79. Springer, 2010. https://doi.org/10.1007/978-3-642-11319-2_14.","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.","short":"T.A. Henzinger, T. Hottelier, L. Kovács, A. Voronkov, in:, Springer, 2010, pp. 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:10.1007/978-3-642-11319-2_14","apa":"Henzinger, T. A., Hottelier, T., Kovács, L., & 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. https://doi.org/10.1007/978-3-642-11319-2_14","mla":"Henzinger, Thomas A., et al. Invariant and Type Inference for Matrices. Vol. 5944, Springer, 2010, pp. 163–79, doi:10.1007/978-3-642-11319-2_14."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","page":"163 - 179","date_created":"2018-12-11T12:05:27Z","date_published":"2010-01-01T00:00:00Z","doi":"10.1007/978-3-642-11319-2_14","year":"2010","has_accepted_license":"1","day":"01","oa":1,"quality_controlled":"1","publisher":"Springer","acknowledgement":"The research was supported by the Swiss NSF."},{"oa":1,"publisher":"Springer","quality_controlled":"1","date_created":"2018-12-11T12:05:27Z","date_published":"2010-09-29T00:00:00Z","doi":"10.1145/1839764.1839772","page":"55 - 65","day":"29","year":"2010","has_accepted_license":"1","title":"Hybrid numerical solution of the chemical master equation","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Maria","last_name":"Mateescu","full_name":"Mateescu, Maria"},{"full_name":"Mikeev, Linar","last_name":"Mikeev","first_name":"Linar"},{"last_name":"Wolf","full_name":"Wolf, Verena","first_name":"Verena"}],"publist_id":"2356","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"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.","chicago":"Henzinger, Thomas A, Maria Mateescu, Linar Mikeev, and Verena Wolf. “Hybrid Numerical Solution of the Chemical Master Equation,” 55–65. Springer, 2010. https://doi.org/10.1145/1839764.1839772.","short":"T.A. Henzinger, M. Mateescu, L. Mikeev, V. Wolf, in:, Springer, 2010, pp. 55–65.","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.","apa":"Henzinger, T. A., Mateescu, M., Mikeev, L., & 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. https://doi.org/10.1145/1839764.1839772","ama":"Henzinger TA, Mateescu M, Mikeev L, Wolf V. Hybrid numerical solution of the chemical master equation. In: Springer; 2010:55-65. doi:10.1145/1839764.1839772","mla":"Henzinger, Thomas A., et al. Hybrid Numerical Solution of the Chemical Master Equation. Springer, 2010, pp. 55–65, doi:10.1145/1839764.1839772."},"month":"09","scopus_import":1,"oa_version":"Submitted Version","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"}],"language":[{"iso":"eng"}],"file":[{"checksum":"81cb6f0babd97151b171d1ce86582831","file_id":"5179","access_level":"open_access","relation":"main_file","content_type":"application/pdf","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","date_updated":"2020-07-14T12:46:16Z","file_size":671790}],"publication_status":"published","pubrep_id":"68","status":"public","conference":{"name":"CMSB: Computational Methods in Systems Biology","start_date":"2010-09-29","end_date":"2010-10-01","location":"Trento, Italy"},"type":"conference","_id":"3838","file_date_updated":"2020-07-14T12:46:16Z","department":[{"_id":"ToHe"}],"ddc":["004"],"date_updated":"2021-01-12T07:52:33Z"},{"_id":"3853","conference":{"name":"CONCUR: Concurrency Theory","start_date":"2010-08-31","location":"Paris, France","end_date":"2010-09-03"},"type":"conference","pubrep_id":"62","status":"public","date_updated":"2021-01-12T07:52:40Z","ddc":["000","005"],"file_date_updated":"2020-07-14T12:46:17Z","department":[{"_id":"KrCh"},{"_id":"HeEd"},{"_id":"ToHe"}],"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."}],"oa_version":"Submitted Version","scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 6269","month":"11","publication_status":"published","language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:15:41Z","file_name":"IST-2012-62-v1+1_Mean-payoff_automaton_expressions.pdf","date_updated":"2020-07-14T12:46:17Z","file_size":233260,"creator":"system","file_id":"5163","checksum":"4f753ae99d076553fb8733e2c8b390e2","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"ec_funded":1,"volume":6269,"project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"grant_number":"214373","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. Mean-Payoff Automaton Expressions. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–83, doi:10.1007/978-3-642-15375-4_19.","short":"K. Chatterjee, L. Doyen, H. Edelsbrunner, T.A. Henzinger, P. Rannou, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–283.","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.","apa":"Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., & 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. https://doi.org/10.1007/978-3-642-15375-4_19","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:10.1007/978-3-642-15375-4_19","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. https://doi.org/10.1007/978-3-642-15375-4_19.","ista":"Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Philippe","full_name":"Rannou, Philippe","last_name":"Rannou"}],"publist_id":"2328","title":"Mean-payoff automaton expressions","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2010","has_accepted_license":"1","day":"18","page":"269 - 283","date_created":"2018-12-11T12:05:31Z","date_published":"2010-11-18T00:00:00Z","doi":"10.1007/978-3-642-15375-4_19"},{"oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","day":"13","year":"2010","has_accepted_license":"1","date_created":"2018-12-11T12:05:34Z","doi":"10.4230/LIPIcs.FSTTCS.2010.505","date_published":"2010-12-13T00:00:00Z","page":"505 - 516","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Generalized Mean-Payoff and Energy Games,” 8:505–16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505.","ista":"Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2010. Generalized mean-payoff and energy games. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 505–516.","mla":"Chatterjee, Krishnendu, et al. Generalized Mean-Payoff and Energy Games. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–16, doi:10.4230/LIPIcs.FSTTCS.2010.505.","ieee":"K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Generalized mean-payoff and energy games,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 505–516.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–516.","ama":"Chatterjee K, Doyen L, Henzinger TA, Raskin J. Generalized mean-payoff and energy games. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:505-516. doi:10.4230/LIPIcs.FSTTCS.2010.505","apa":"Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2010). Generalized mean-payoff and energy games (Vol. 8, pp. 505–516). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505"},"title":"Generalized mean-payoff and energy games","article_processing_charge":"No","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Raskin","full_name":"Raskin, Jean","first_name":"Jean"}],"publist_id":"2321","oa_version":"Submitted Version","abstract":[{"text":"In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Generalized mean-payoff and energy games replace individual weights by tuples, and the limit average (resp. running sum) of each coordinate must be (resp. remain) nonnegative. These games have applications in the synthesis of resource-bounded processes with multiple resources. We prove the finite-memory determinacy of generalized energy games and show the inter- reducibility of generalized mean-payoff and energy games for finite-memory strategies. We also improve the computational complexity for solving both classes of games with finite-memory strategies: while the previously best known upper bound was EXPSPACE, and no lower bound was known, we give an optimal coNP-complete bound. For memoryless strategies, we show that the problem of deciding the existence of a winning strategy for the protagonist is NP-complete.","lang":"eng"}],"intvolume":" 8","month":"12","scopus_import":1,"alternative_title":["LIPIcs"],"language":[{"iso":"eng"}],"file":[{"file_name":"IST-2012-59-v1+1_Generalized_mean-payoff_and_energy_games.pdf","date_created":"2018-12-12T10:15:27Z","file_size":178278,"date_updated":"2020-07-14T12:46:18Z","creator":"system","file_id":"5147","checksum":"1caabd6319b979927208117a41192637","content_type":"application/pdf","relation":"main_file","access_level":"open_access"},{"date_created":"2018-12-12T10:15:28Z","file_name":"IST-2016-59-v2+1_2_1_.pdf","date_updated":"2020-07-14T12:46:18Z","file_size":477976,"creator":"system","checksum":"3a59759ceeacdb5b578f3803d5e6769b","file_id":"5148","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"publication_status":"published","volume":8,"_id":"3860","pubrep_id":"59","status":"public","tmp":{"short":"CC BY-NC-ND (4.0)","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","image":"/images/cc_by_nc_nd.png"},"conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","location":"Chennai, India","end_date":"2010-12-18","start_date":"2010-12-15"},"type":"conference","ddc":["005"],"date_updated":"2021-01-12T07:52:44Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:18Z"},{"volume":6174,"related_material":{"record":[{"status":"public","id":"1856","relation":"later_version"}]},"publication_status":"published","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1004.0739"}],"alternative_title":["LNCS"],"scopus_import":1,"intvolume":" 6174","month":"07","abstract":[{"lang":"eng","text":"Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if it generates a higher expected value. We solve the following optimal-synthesis problem: given an omega-regular specification, a Markov chain that describes the distribution of inputs, and a weighted automaton that measures how well a system satisfies the given specification tinder the given input assumption, synthesize a system that optimizes the measured value. For safety specifications and measures that are defined by mean-payoff automata, the optimal-synthesis problem amounts to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be done in polynomial time. For general omega-regular specifications, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives. We present some experimental results showing optimal systems that were automatically generated in this way."}],"oa_version":"Preprint","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2023-02-23T10:17:28Z","conference":{"name":"CAV: Computer Aided Verification","start_date":"201-07-15","end_date":"2010-07-19","location":"Edinburgh, United Kingdom"},"type":"conference","status":"public","_id":"3864","page":"380 - 395","date_created":"2018-12-11T12:05:35Z","date_published":"2010-07-09T00:00:00Z","doi":"10.1007/978-3-642-14295-6_34","year":"2010","day":"09","oa":1,"quality_controlled":"1","publisher":"Springer","acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"},{"last_name":"Singh","full_name":"Singh, Rohit","first_name":"Rohit"}],"publist_id":"2313","title":"Measuring and synthesizing systems in probabilistic environments","citation":{"mla":"Chatterjee, Krishnendu, et al. Measuring and Synthesizing Systems in Probabilistic Environments. Vol. 6174, Springer, 2010, pp. 380–95, doi:10.1007/978-3-642-14295-6_34.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2010, pp. 380–395.","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom, 2010, vol. 6174, pp. 380–395.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing systems in probabilistic environments. In: Vol 6174. Springer; 2010:380-395. doi:10.1007/978-3-642-14295-6_34","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2010). Measuring and synthesizing systems in probabilistic environments (Vol. 6174, pp. 380–395). Presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom: Springer. https://doi.org/10.1007/978-3-642-14295-6_34","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments,” 6174:380–95. Springer, 2010. https://doi.org/10.1007/978-3-642-14295-6_34.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2010. Measuring and synthesizing systems in probabilistic environments. CAV: Computer Aided Verification, LNCS, vol. 6174, 380–395."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"_id":"3863","status":"public","pubrep_id":"58","type":"journal_article","ddc":["005"],"date_updated":"2023-02-23T11:46:47Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:18Z","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We consider two-player parity games with imperfect information in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., to determine the winning regions of players and corresponding winning strategies, one can use the subset construction to build an equivalent perfect-information game. Recently, an algorithm that avoids the inefficient subset construction has been proposed. The algorithm performs a fixed-point computation in a lattice of antichains, thus maintaining a succinct representation of state sets. However, this representation does not allow to recover winning strategies. In this paper, we build on the antichain approach to develop an algorithm for constructing the winning strategies in parity games of imperfect information. One major obstacle in adapting the classical procedure is that the complementation of attractor sets would break the invariant of downward-closedness on which the antichain representation relies. We overcome this difficulty by decomposing problem instances recursively into games with a combination of reachability, safety, and simpler parity conditions. We also report on an experimental implementation of our algorithm: to our knowledge, this is the first implementation of a procedure for solving imperfect-information parity games on graphs."}],"month":"10","intvolume":" 208","scopus_import":1,"file":[{"file_id":"5300","checksum":"29d146e4f8049dbb7f80bbf7ea3700ed","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2012-58-v1+1_Strategy_construction_for_parity_games_with_imperfect_information.pdf","date_created":"2018-12-12T10:17:44Z","creator":"system","file_size":287496,"date_updated":"2020-07-14T12:46:18Z"}],"language":[{"iso":"eng"}],"publication_status":"published","issue":"10","related_material":{"record":[{"id":"3880","status":"public","relation":"earlier_version"}]},"volume":208,"ec_funded":1,"project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Berwanger, Dietmar, et al. “Strategy Construction for Parity Games with Imperfect Information.” Information and Computation, vol. 208, no. 10, Elsevier, 2010, pp. 1206–20, doi:10.1016/j.ic.2009.09.006.","ama":"Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. Strategy construction for parity games with imperfect information. Information and Computation. 2010;208(10):1206-1220. doi:10.1016/j.ic.2009.09.006","apa":"Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., & Henzinger, T. A. (2010). Strategy construction for parity games with imperfect information. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2009.09.006","ieee":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T. A. Henzinger, “Strategy construction for parity games with imperfect information,” Information and Computation, vol. 208, no. 10. Elsevier, pp. 1206–1220, 2010.","short":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, Information and Computation 208 (2010) 1206–1220.","chicago":"Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, and Thomas A Henzinger. “Strategy Construction for Parity Games with Imperfect Information.” Information and Computation. Elsevier, 2010. https://doi.org/10.1016/j.ic.2009.09.006.","ista":"Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2010. Strategy construction for parity games with imperfect information. Information and Computation. 208(10), 1206–1220."},"title":"Strategy construction for parity games with imperfect information","publist_id":"2319","author":[{"first_name":"Dietmar","full_name":"Berwanger, Dietmar","last_name":"Berwanger"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"De Wulf","full_name":"De Wulf, Martin","first_name":"Martin"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"quality_controlled":"1","publisher":"Elsevier","oa":1,"day":"01","publication":"Information and Computation","has_accepted_license":"1","year":"2010","date_published":"2010-10-01T00:00:00Z","doi":"10.1016/j.ic.2009.09.006","date_created":"2018-12-11T12:05:35Z","page":"1206 - 1220"},{"date_created":"2018-12-11T12:05:34Z","date_published":"2010-06-01T00:00:00Z","doi":"10.1016/j.ic.2009.07.004","page":"677 - 693","publication":"Information and Computation","day":"01","year":"2010","has_accepted_license":"1","oa":1,"publisher":"Elsevier","quality_controlled":"1","title":"Strategy logic","publist_id":"2317","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"last_name":"Piterman","full_name":"Piterman, Nir","first_name":"Nir"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"short":"K. Chatterjee, T.A. Henzinger, N. Piterman, Information and Computation 208 (2010) 677–693.","ieee":"K. Chatterjee, T. A. Henzinger, and N. Piterman, “Strategy logic,” Information and Computation, vol. 208, no. 6. Elsevier, pp. 677–693, 2010.","ama":"Chatterjee K, Henzinger TA, Piterman N. Strategy logic. Information and Computation. 2010;208(6):677-693. doi:10.1016/j.ic.2009.07.004","apa":"Chatterjee, K., Henzinger, T. A., & Piterman, N. (2010). Strategy logic. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2009.07.004","mla":"Chatterjee, Krishnendu, et al. “Strategy Logic.” Information and Computation, vol. 208, no. 6, Elsevier, 2010, pp. 677–93, doi:10.1016/j.ic.2009.07.004.","ista":"Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information and Computation. 208(6), 677–693.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy Logic.” Information and Computation. Elsevier, 2010. https://doi.org/10.1016/j.ic.2009.07.004."},"volume":208,"issue":"6","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3884"}]},"language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:11:54Z","file_name":"IST-2012-56-v1+1_Strategy_logic.pdf","date_updated":"2020-07-14T12:46:18Z","file_size":189120,"creator":"system","file_id":"4911","checksum":"13bff93f3c2a014e2908145a4517f177","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"publication_status":"published","intvolume":" 208","month":"06","scopus_import":1,"oa_version":"Submitted Version","abstract":[{"text":"We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properties of nonzero-sum games in a simple and natural way. We show that the one-alternation fragment of strategy logic is strong enough to express the existence of Nash equilibria and secure equilibria, and subsumes other logics that were introduced to reason about games, such as ATL, ATL*, and game logic. We show that strategy logic is decidable, by constructing tree automata that recognize sets of strategies. While for the general logic, our decision procedure is nonelementary, for the simple fragment that is used above we show that the complexity is polynomial in the size of the game graph and optimal in the size of the formula (ranging from polynomial to 2EXPTIME depending on the form of the formula).","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:18Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"ddc":["000","004"],"date_updated":"2023-02-23T11:46:57Z","pubrep_id":"56","status":"public","type":"journal_article","_id":"3861"},{"status":"public","type":"conference","conference":{"name":"RV: International Conference on Runtime Verification","start_date":"2010-11-01","end_date":"2010-11-04","location":"St. Julians, Malta"},"_id":"4362","title":"Runtime verification for software transactional memories","editor":[{"first_name":"Oleg","last_name":"Sokolsky","full_name":"Sokolsky, Oleg"},{"last_name":"Rosu","full_name":"Rosu, Grigore","first_name":"Grigore"},{"first_name":"Nikolai","last_name":"Tilmann","full_name":"Tilmann, Nikolai"},{"first_name":"Howard","full_name":"Barringer, Howard","last_name":"Barringer"},{"first_name":"Ylies","full_name":"Falcone, Ylies","last_name":"Falcone"},{"last_name":"Finkbeiner","full_name":"Finkbeiner, Bernd","first_name":"Bernd"},{"first_name":"Klaus","full_name":"Havelund, Klaus","last_name":"Havelund"},{"last_name":"Lee","full_name":"Lee, Insup","first_name":"Insup"},{"last_name":"Pace","full_name":"Pace, Gordon","first_name":"Gordon"}],"department":[{"_id":"ToHe"}],"author":[{"first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","full_name":"Singh, Vasu","last_name":"Singh"}],"publist_id":"1096","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Singh, Vasu. Runtime Verification for Software Transactional Memories. Edited by Oleg Sokolsky et al., vol. 6418, Springer, 2010, pp. 421–35, doi:10.1007/978-3-642-16612-9_32.","ieee":"V. Singh, “Runtime verification for software transactional memories,” presented at the RV: International Conference on Runtime Verification, St. Julians, Malta, 2010, vol. 6418, pp. 421–435.","short":"V. Singh, in:, O. Sokolsky, G. Rosu, N. Tilmann, H. Barringer, Y. Falcone, B. Finkbeiner, K. Havelund, I. Lee, G. Pace (Eds.), Springer, 2010, pp. 421–435.","ama":"Singh V. Runtime verification for software transactional memories. In: Sokolsky O, Rosu G, Tilmann N, et al., eds. Vol 6418. Springer; 2010:421-435. doi:10.1007/978-3-642-16612-9_32","apa":"Singh, V. (2010). Runtime verification for software transactional memories. In O. Sokolsky, G. Rosu, N. Tilmann, H. Barringer, Y. Falcone, B. Finkbeiner, … G. Pace (Eds.) (Vol. 6418, pp. 421–435). Presented at the RV: International Conference on Runtime Verification, St. Julians, Malta: Springer. https://doi.org/10.1007/978-3-642-16612-9_32","chicago":"Singh, Vasu. “Runtime Verification for Software Transactional Memories.” edited by Oleg Sokolsky, Grigore Rosu, Nikolai Tilmann, Howard Barringer, Ylies Falcone, Bernd Finkbeiner, Klaus Havelund, Insup Lee, and Gordon Pace, 6418:421–35. Springer, 2010. https://doi.org/10.1007/978-3-642-16612-9_32.","ista":"Singh V. 2010. Runtime verification for software transactional memories. RV: International Conference on Runtime Verification, LNCS, vol. 6418, 421–435."},"date_updated":"2021-01-12T07:56:25Z","month":"01","intvolume":" 6418","publisher":"Springer","quality_controlled":"1","alternative_title":["LNCS"],"scopus_import":1,"oa_version":"None","abstract":[{"text":"Software transactional memories (STMs) promise simple and efficient concurrent programming. Several correctness properties have been proposed for STMs. Based on a bounded conflict graph algorithm for verifying correctness of STMs, we develop TRACER, a tool for runtime verification of STM implementations. The novelty of TRACER lies in the way it combines coarse and precise runtime analyses to guarantee sound and complete verification in an efficient manner. We implement TRACER in the TL2 STM implementation. We evaluate the performance of TRACER on STAMP benchmarks. While a precise runtime verification technique based on conflict graphs results in an average slowdown of 60x, the two-level approach of TRACER performs complete verification with an average slowdown of around 25x across different benchmarks.","lang":"eng"}],"volume":6418,"date_published":"2010-01-01T00:00:00Z","doi":"10.1007/978-3-642-16612-9_32","date_created":"2018-12-11T12:08:28Z","page":"421 - 435","day":"01","language":[{"iso":"eng"}],"year":"2010","publication_status":"published"},{"abstract":[{"text":"Techniques such as verification condition generation, predicate abstraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Programs and their specifications often make use of data structures such as sets, multisets, algebraic data types, or graphs. Consequently, formulas generated from verification also involve such data structures. To automate the proofs of such formulas we propose a logic (a “calculus”) of such data structures. We build the calculus by starting from decidable logics of individual data structures, and connecting them through functions and sets, in ways that go beyond the frameworks such as Nelson-Oppen. The result are new decidable logics that can simultaneously specify properties of different kinds of data structures and overcome the limitations of the individual logics. Several of our decidable logics include abstraction functions that map a data structure into its more abstract view (a tree into a multiset, a multiset into a set), into a numerical quantity (the size or the height), or into the truth value of a candidate data structure invariant (sortedness, or the heap property). For algebraic data types, we identify an asymptotic many-to-one condition on the abstraction function that guarantees the existence of a decision procedure. In addition to the combination based on abstraction functions, we can combine multiple data structure theories if they all reduce to the same data structure logic. As an instance of this approach, we describe a decidable logic whose formulas are propositional combinations of formulas in: weak monadic second-order logic of two successors, two-variable logic with counting, multiset algebra with Presburger arithmetic, the Bernays-Schönfinkel-Ramsey class of first-order logic, and the logic of algebraic data types with the set content function. The subformulas in this combination can share common variables that refer to sets of objects along with the common set algebra operations. Such sound and complete combination is possible because the relations on sets definable in the component logics are all expressible in Boolean Algebra with Presburger Arithmetic. Presburger arithmetic and its new extensions play an important role in our decidability results. In several cases, when we combine logics that belong to NP, we can prove the satisfiability for the combined logic is still in NP.","lang":"eng"}],"oa_version":"Submitted Version","scopus_import":1,"alternative_title":["LNCS"],"main_file_link":[{"url":"https://infoscience.epfl.ch/record/161290/","open_access":"1"}],"month":"01","intvolume":" 5944","publication_status":"published","language":[{"iso":"eng"}],"volume":5944,"_id":"4378","type":"conference","conference":{"name":"VMCAI: Verification, Model Checking and Abstract Interpretation","location":"Madrid, Spain","end_date":"2010-01-19","start_date":"2010-01-17"},"status":"public","date_updated":"2021-01-12T07:56:31Z","department":[{"_id":"ToHe"}],"publisher":"Springer","quality_controlled":"1","oa":1,"year":"2010","day":"01","page":"26 - 44","doi":"10.1007/978-3-642-11319-2_6","date_published":"2010-01-01T00:00:00Z","date_created":"2018-12-11T12:08:33Z","citation":{"chicago":"Kuncak, Viktor, Ruzica Piskac, Philippe Suter, and Thomas Wies. “Building a Calculus of Data Structures.” edited by Gilles Barthe and Manuel Hermenegildo, 5944:26–44. Springer, 2010. https://doi.org/10.1007/978-3-642-11319-2_6.","ista":"Kuncak V, Piskac R, Suter P, Wies T. 2010. Building a calculus of data structures. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 5944, 26–44.","mla":"Kuncak, Viktor, et al. Building a Calculus of Data Structures. Edited by Gilles Barthe and Manuel Hermenegildo, vol. 5944, Springer, 2010, pp. 26–44, doi:10.1007/978-3-642-11319-2_6.","ieee":"V. Kuncak, R. Piskac, P. Suter, and T. Wies, “Building a calculus of data structures,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain, 2010, vol. 5944, pp. 26–44.","short":"V. Kuncak, R. Piskac, P. Suter, T. Wies, in:, G. Barthe, M. Hermenegildo (Eds.), Springer, 2010, pp. 26–44.","ama":"Kuncak V, Piskac R, Suter P, Wies T. Building a calculus of data structures. In: Barthe G, Hermenegildo M, eds. Vol 5944. Springer; 2010:26-44. doi:10.1007/978-3-642-11319-2_6","apa":"Kuncak, V., Piskac, R., Suter, P., & Wies, T. (2010). Building a calculus of data structures. In G. Barthe & M. Hermenegildo (Eds.) (Vol. 5944, pp. 26–44). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain: Springer. https://doi.org/10.1007/978-3-642-11319-2_6"},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"1081","author":[{"full_name":"Kuncak, Viktor","last_name":"Kuncak","first_name":"Viktor"},{"first_name":"Ruzica","last_name":"Piskac","full_name":"Piskac, Ruzica"},{"first_name":"Philippe","full_name":"Suter, Philippe","last_name":"Suter"},{"full_name":"Wies, Thomas","last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"}],"title":"Building a calculus of data structures","editor":[{"first_name":"Gilles","full_name":"Barthe, Gilles","last_name":"Barthe"},{"first_name":"Manuel","last_name":"Hermenegildo","full_name":"Hermenegildo, Manuel"}]},{"date_updated":"2021-01-12T07:56:33Z","ddc":["004"],"department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:28Z","_id":"4381","type":"conference","conference":{"name":"CLOUD: Cloud Computing","end_date":"2010-07-10","location":"Miami, USA","start_date":"2010-07-05"},"status":"public","pubrep_id":"47","publication_status":"published","file":[{"date_updated":"2020-07-14T12:46:28Z","file_size":467436,"creator":"system","date_created":"2018-12-12T10:16:03Z","file_name":"IST-2012-47-v1+1_FlexPRICE-_Flexible_provisioning_of_resources_in_a_cloud_environment.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5188","checksum":"98e534675339a8e2beca08890d048145"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Cloud computing aims to give users virtually unlimited pay-per-use computing resources without the burden of managing the underlying infrastructure. We claim that, in order to realize the full potential of cloud computing, the user must be presented with a pricing model that offers flexibility at the requirements level, such as a choice between different degrees of execution speed and the cloud provider must be presented with a programming model that offers flexibility at the execution level, such as a choice between different scheduling policies. In such a flexible framework, with each job, the user purchases a virtual computer with the desired speed and cost characteristics, and the cloud provider can optimize the utilization of resources across a stream of jobs from different users. We designed a flexible framework to test our hypothesis, which is called FlexPRICE (Flexible Provisioning of Resources in a Cloud Environment) and works as follows. A user presents a job to the cloud. The cloud finds different schedules to execute the job and presents a set of quotes to the user in terms of price and duration for the execution. The user then chooses a particular quote and the cloud is obliged to execute the job according to the chosen quote. FlexPRICE thus hides the complexity of the actual scheduling decisions from the user, but still provides enough flexibility to meet the users actual demands. We implemented FlexPRICE in a simulator called PRICES that allows us to experiment with our framework. We observe that FlexPRICE provides a wide range of execution options-from fast and expensive to slow and cheap-- for the whole spectrum of data-intensive and computation-intensive jobs. We also observe that the set of quotes computed by FlexPRICE do not vary as the number of simultaneous jobs increases."}],"oa_version":"Submitted Version","scopus_import":1,"month":"08","citation":{"ista":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. 2010. FlexPRICE: Flexible provisioning of resources in a cloud environment. CLOUD: Cloud Computing, 83–90.","chicago":"Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey. “FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment,” 83–90. IEEE, 2010. https://doi.org/10.1109/CLOUD.2010.71.","apa":"Henzinger, T. A., Tomar, A., Singh, V., Wies, T., & Zufferey, D. (2010). FlexPRICE: Flexible provisioning of resources in a cloud environment (pp. 83–90). Presented at the CLOUD: Cloud Computing, Miami, USA: IEEE. https://doi.org/10.1109/CLOUD.2010.71","ama":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. FlexPRICE: Flexible provisioning of resources in a cloud environment. In: IEEE; 2010:83-90. doi:10.1109/CLOUD.2010.71","ieee":"T. A. Henzinger, A. Tomar, V. Singh, T. Wies, and D. Zufferey, “FlexPRICE: Flexible provisioning of resources in a cloud environment,” presented at the CLOUD: Cloud Computing, Miami, USA, 2010, pp. 83–90.","short":"T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, IEEE, 2010, pp. 83–90.","mla":"Henzinger, Thomas A., et al. FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment. IEEE, 2010, pp. 83–90, doi:10.1109/CLOUD.2010.71."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"id":"3D8D36B6-F248-11E8-B48F-1D18A9856A87","first_name":"Anmol","full_name":"Tomar, Anmol","last_name":"Tomar"},{"full_name":"Singh, Vasu","last_name":"Singh","first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wies, Thomas","last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien"}],"publist_id":"1077","article_processing_charge":"No","title":"FlexPRICE: Flexible provisioning of resources in a cloud environment","has_accepted_license":"1","year":"2010","day":"26","page":"83 - 90","date_published":"2010-08-26T00:00:00Z","doi":"10.1109/CLOUD.2010.71","date_created":"2018-12-11T12:08:33Z","quality_controlled":"1","publisher":"IEEE","oa":1},{"date_created":"2018-12-11T12:08:34Z","doi":"10.1145/1810479.1810529","date_published":"2010-06-13T00:00:00Z","page":"263 - 272","language":[{"iso":"eng"}],"file":[{"checksum":"f2ad6c00a6304da34bf21bcdcfd36c4b","file_id":"5080","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:14:28Z","file_name":"IST-2012-46-v1+1_Transactions_in_the_jungle.pdf","date_updated":"2020-07-14T12:46:28Z","file_size":246409,"creator":"system"}],"day":"13","publication_status":"published","year":"2010","has_accepted_license":"1","month":"06","oa":1,"quality_controlled":"1","publisher":"ACM","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of TM executions have been proposed. Many of these definitions assumed that accesses to shared data are solely performed through transactions. In practice, due to legacy code and concurrency libraries, transactions in a TM have to share data with non-transactional operations. The semantics of such interaction, while widely discussed by practitioners, lacks a clear formal specification. Those interactions can vary, sometimes in subtle ways, between TM implementations and underlying memory models. We propose a correctness condition for TMs, parametrized opacity, to formally capture the now folklore notion of strong atomicity by stipulating the two following intuitive requirements: first, every transaction appears as if it is executed instantaneously with respect to other transactions and non-transactional operations, and second, non-transactional operations conform to the given underlying memory model. We investigate the inherent cost of implementing parametrized opacity. We first prove that parametrized opacity requires either instrumenting non-transactional operations (for most memory models) or writing to memory by transactions using potentially expensive read-modify-write instructions (such as compare-and-swap). Then, we show that for a class of practical relaxed memory models, parametrized opacity can indeed be implemented with constant-time instrumentation of non-transactional writes and no instrumentation of non-transactional reads. We show that, in practice, parametrizing the notion of correctness allows developing more efficient TM implementations."}],"file_date_updated":"2020-07-14T12:46:28Z","department":[{"_id":"ToHe"}],"title":"Transactions in the jungle","author":[{"last_name":"Guerraoui","full_name":"Guerraoui, Rachid","first_name":"Rachid"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Kapalka, Michal","last_name":"Kapalka","first_name":"Michal"},{"last_name":"Singh","full_name":"Singh, Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu"}],"publist_id":"1076","ddc":["005"],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:56:33Z","citation":{"ista":"Guerraoui R, Henzinger TA, Kapalka M, Singh V. 2010. Transactions in the jungle. SPAA: ACM Symposium on Parallel Algorithms and Architectures, 263–272.","chicago":"Guerraoui, Rachid, Thomas A Henzinger, Michal Kapalka, and Vasu Singh. “Transactions in the Jungle,” 263–72. ACM, 2010. https://doi.org/10.1145/1810479.1810529.","ama":"Guerraoui R, Henzinger TA, Kapalka M, Singh V. Transactions in the jungle. In: ACM; 2010:263-272. doi:10.1145/1810479.1810529","apa":"Guerraoui, R., Henzinger, T. A., Kapalka, M., & Singh, V. (2010). Transactions in the jungle (pp. 263–272). Presented at the SPAA: ACM Symposium on Parallel Algorithms and Architectures, Santorini, Greece: ACM. https://doi.org/10.1145/1810479.1810529","short":"R. Guerraoui, T.A. Henzinger, M. Kapalka, V. Singh, in:, ACM, 2010, pp. 263–272.","ieee":"R. Guerraoui, T. A. Henzinger, M. Kapalka, and V. Singh, “Transactions in the jungle,” presented at the SPAA: ACM Symposium on Parallel Algorithms and Architectures, Santorini, Greece, 2010, pp. 263–272.","mla":"Guerraoui, Rachid, et al. Transactions in the Jungle. ACM, 2010, pp. 263–72, doi:10.1145/1810479.1810529."},"pubrep_id":"46","status":"public","conference":{"location":"Santorini, Greece","end_date":"2010-06-15","start_date":"2010-06-13","name":"SPAA: ACM Symposium on Parallel Algorithms and Architectures"},"type":"conference","_id":"4382"},{"day":"24","has_accepted_license":"1","year":"2010","doi":"10.1145/1879021.1879022","date_published":"2010-10-24T00:00:00Z","date_created":"2018-12-11T12:08:33Z","page":"1 - 8","quality_controlled":"1","publisher":"ACM","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. 2010. A marketplace for cloud resources. EMSOFT: Embedded Software , 1–8.","chicago":"Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey. “A Marketplace for Cloud Resources,” 1–8. ACM, 2010. https://doi.org/10.1145/1879021.1879022.","ama":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. A marketplace for cloud resources. In: ACM; 2010:1-8. doi:10.1145/1879021.1879022","apa":"Henzinger, T. A., Tomar, A., Singh, V., Wies, T., & Zufferey, D. (2010). A marketplace for cloud resources (pp. 1–8). Presented at the EMSOFT: Embedded Software , Arizona, USA: ACM. https://doi.org/10.1145/1879021.1879022","ieee":"T. A. Henzinger, A. Tomar, V. Singh, T. Wies, and D. Zufferey, “A marketplace for cloud resources,” presented at the EMSOFT: Embedded Software , Arizona, USA, 2010, pp. 1–8.","short":"T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2010, pp. 1–8.","mla":"Henzinger, Thomas A., et al. A Marketplace for Cloud Resources. ACM, 2010, pp. 1–8, doi:10.1145/1879021.1879022."},"title":"A marketplace for cloud resources","author":[{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Anmol","id":"3D8D36B6-F248-11E8-B48F-1D18A9856A87","full_name":"Tomar, Anmol","last_name":"Tomar"},{"last_name":"Singh","full_name":"Singh, Vasu","first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wies, Thomas","last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas"},{"first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","last_name":"Zufferey"}],"publist_id":"1078","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"4767","checksum":"7680dd24016810710f7c977bc94f85e9","creator":"system","file_size":222626,"date_updated":"2020-07-14T12:46:28Z","file_name":"IST-2012-48-v1+1_A_marketplace_for_cloud_resources.pdf","date_created":"2018-12-12T10:09:42Z"}],"language":[{"iso":"eng"}],"publication_status":"published","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Cloud computing is an emerging paradigm aimed to offer users pay-per-use computing resources, while leaving the burden of managing the computing infrastructure to the cloud provider. We present a new programming and pricing model that gives the cloud user the flexibility of trading execution speed and price on a per-job basis. We discuss the scheduling and resource management challenges for the cloud provider that arise in the implementation of this model. We argue that techniques from real-time and embedded software can be useful in this context."}],"month":"10","scopus_import":1,"ddc":["005"],"date_updated":"2021-01-12T07:56:32Z","file_date_updated":"2020-07-14T12:46:28Z","department":[{"_id":"ToHe"}],"_id":"4380","status":"public","pubrep_id":"48","type":"conference","conference":{"name":"EMSOFT: Embedded Software ","start_date":"2010-10-24","end_date":"2010-10-29","location":"Arizona, USA"}},{"page":"77 - 84","doi":"10.1109/ACSD.2010.26","date_published":"2010-08-23T00:00:00Z","date_created":"2018-12-11T12:08:36Z","has_accepted_license":"1","year":"2010","day":"23","publisher":"IEEE","quality_controlled":"1","oa":1,"author":[{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"first_name":"Axel","full_name":"Legay, Axel","last_name":"Legay"},{"full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"1069","title":"Robustness of sequential circuits","citation":{"short":"L. Doyen, T.A. Henzinger, A. Legay, D. Nickovic, in:, IEEE, 2010, pp. 77–84.","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.","apa":"Doyen, L., Henzinger, T. A., Legay, A., & Nickovic, D. (2010). Robustness of sequential circuits (pp. 77–84). Presented at the ACSD: Application of Concurrency to System Design, IEEE. https://doi.org/10.1109/ACSD.2010.26","ama":"Doyen L, Henzinger TA, Legay A, Nickovic D. Robustness of sequential circuits. In: IEEE; 2010:77-84. doi:10.1109/ACSD.2010.26","mla":"Doyen, Laurent, et al. Robustness of Sequential Circuits. IEEE, 2010, pp. 77–84, doi:10.1109/ACSD.2010.26.","ista":"Doyen L, Henzinger TA, Legay A, Nickovic D. 2010. Robustness of sequential circuits. ACSD: Application of Concurrency to System Design, 77–84.","chicago":"Doyen, Laurent, Thomas A Henzinger, Axel Legay, and Dejan Nickovic. “Robustness of Sequential Circuits,” 77–84. IEEE, 2010. https://doi.org/10.1109/ACSD.2010.26."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publication_status":"published","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"42b2952bfc6b6974617bd554842b904a","file_id":"4733","file_size":159920,"date_updated":"2020-07-14T12:46:28Z","creator":"system","file_name":"IST-2012-44-v1+1_Robustness_of_sequential_circuits.pdf","date_created":"2018-12-12T10:09:10Z"}],"language":[{"iso":"eng"}],"scopus_import":1,"month":"08","abstract":[{"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.","lang":"eng"}],"oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:46:28Z","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T07:56:36Z","ddc":["004"],"type":"conference","conference":{"name":"ACSD: Application of Concurrency to System Design"},"status":"public","pubrep_id":"44","_id":"4389"},{"department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T07:56:38Z","type":"book_chapter","status":"public","series_title":"Essays in Memory of Amir Pnueli","_id":"4392","ec_funded":1,"volume":6200,"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 6200","month":"07","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. "}],"oa_version":"None","author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun"}],"publist_id":"1064","title":"Quantitative Simulation Games","editor":[{"full_name":"Manna, Zohar","last_name":"Manna","first_name":"Zohar"},{"last_name":"Peled","full_name":"Peled, Doron","first_name":"Doron"}],"citation":{"mla":"Cerny, Pavol, et al. “Quantitative Simulation Games.” Time For Verification: Essays in Memory of Amir Pnueli, edited by Zohar Manna and Doron Peled, vol. 6200, Springer, 2010, pp. 42–60, doi:10.1007/978-3-642-13754-9_3.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Quantitative Simulation Games. In: Manna Z, Peled D, eds. Time For Verification: Essays in Memory of Amir Pnueli. Vol 6200. Essays in Memory of Amir Pnueli. Springer; 2010:42-60. doi:10.1007/978-3-642-13754-9_3","apa":"Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2010). Quantitative Simulation Games. In Z. Manna & D. Peled (Eds.), Time For Verification: Essays in Memory of Amir Pnueli (Vol. 6200, pp. 42–60). Springer. https://doi.org/10.1007/978-3-642-13754-9_3","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative Simulation Games,” in Time For Verification: Essays in Memory of Amir Pnueli, vol. 6200, Z. Manna and D. Peled, Eds. Springer, 2010, pp. 42–60.","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.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Simulation Games.” In Time For Verification: Essays in Memory of Amir Pnueli, edited by Zohar Manna and Doron Peled, 6200:42–60. Essays in Memory of Amir Pnueli. Springer, 2010. https://doi.org/10.1007/978-3-642-13754-9_3.","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."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","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"}],"page":"42 - 60","date_created":"2018-12-11T12:08:37Z","doi":"10.1007/978-3-642-13754-9_3","date_published":"2010-07-29T00:00:00Z","year":"2010","publication":"Time For Verification: Essays in Memory of Amir Pnueli","day":"29","publisher":"Springer","quality_controlled":"1"},{"citation":{"short":"D. Beyer, T.A. Henzinger, G. Théoduloz, D. Zufferey, in:, D. Rosenblum, G. Taenzer (Eds.), Springer, 2010, pp. 263–277.","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.","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:10.1007/978-3-642-12029-9_19","apa":"Beyer, D., Henzinger, T. A., Théoduloz, G., & Zufferey, D. (2010). Shape refinement through explicit heap analysis. In D. Rosenblum & G. Taenzer (Eds.) (Vol. 6013, pp. 263–277). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer. https://doi.org/10.1007/978-3-642-12029-9_19","mla":"Beyer, Dirk, et al. Shape Refinement through Explicit Heap Analysis. Edited by David Rosenblum and Gabriele Taenzer, vol. 6013, Springer, 2010, pp. 263–77, doi:10.1007/978-3-642-12029-9_19.","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.","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. https://doi.org/10.1007/978-3-642-12029-9_19."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Beyer","full_name":"Beyer, Dirk","first_name":"Dirk"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"first_name":"Grégory","full_name":"Théoduloz, Grégory","last_name":"Théoduloz"},{"first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","last_name":"Zufferey"}],"publist_id":"1061","editor":[{"first_name":"David","full_name":"Rosenblum, David","last_name":"Rosenblum"},{"first_name":"Gabriele","last_name":"Taenzer","full_name":"Taenzer, Gabriele"}],"title":"Shape refinement through explicit heap analysis","project":[{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"year":"2010","has_accepted_license":"1","day":"21","page":"263 - 277","date_created":"2018-12-11T12:08:38Z","doi":"10.1007/978-3-642-12029-9_19","date_published":"2010-04-21T00:00:00Z","oa":1,"publisher":"Springer","quality_controlled":"1","date_updated":"2021-01-12T07:56:40Z","ddc":["004"],"department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:29Z","_id":"4396","conference":{"start_date":"2010-03-20","location":"Paphos, Cyprus","end_date":"2010-03-28","name":"FASE: Fundamental Approaches To Software Engineering"},"type":"conference","pubrep_id":"41","status":"public","publication_status":"published","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5332","checksum":"7d26e59a9681487d7283eba337292b2c","file_size":312147,"date_updated":"2020-07-14T12:46:29Z","creator":"system","file_name":"IST-2012-41-v1+1_Shape_refinement_through_explicit_heap_analysis.pdf","date_created":"2018-12-12T10:18:13Z"}],"volume":6013,"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."}],"oa_version":"Submitted Version","alternative_title":["LNCS"],"scopus_import":1,"intvolume":" 6013","month":"04"},{"ec_funded":1,"issue":"3","related_material":{"record":[{"relation":"earlier_version","id":"4540","status":"public"}]},"volume":6,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"0243da726476817f2ea33b48b78be696","file_id":"5312","date_updated":"2020-07-14T12:46:19Z","file_size":216598,"creator":"system","date_created":"2018-12-12T10:17:54Z","file_name":"IST-2012-55-v1+1_Expressiveness_Closure_Properties_Quantitative_Languages.pdf"},{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5313","checksum":"5e512b8503a9cb263de26331c4ee9cf2","creator":"system","date_updated":"2020-07-14T12:46:19Z","file_size":302416,"date_created":"2018-12-12T10:17:55Z","file_name":"IST-2016-55-v2+1_1007.4018.pdf"}],"scopus_import":1,"intvolume":" 6","month":"08","abstract":[{"lang":"eng","text":"Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit-average, or discounted-sum of the transition weights. The value of a word w is the supremum of the values of the runs over w. We study expressiveness and closure questions about these quantitative languages. We first show that the set of words with value greater than a threshold can be omega-regular for deterministic limit-average and discounted-sum automata, while this set is always omega-regular when the threshold is isolated (i.e., some neighborhood around the threshold contains no word). In the latter case, we prove that the omega-regular language is robust against small perturbations of the transition weights. We next consider automata with transition weights 0 or 1 and show that they are as expressive as general weighted automata in the limit-average case, but not in the discounted-sum case. Third, for quantitative languages L-1 and L-2, we consider the operations max(L-1, L-2), min(L-1, L-2), and 1 - L-1, which generalize the boolean operations on languages, as well as the sum L-1 + L-2. We establish the closure properties of all classes of quantitative languages with respect to these four operations."}],"oa_version":"Published Version","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:19Z","date_updated":"2023-02-23T12:15:42Z","ddc":["000","004"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"type":"journal_article","pubrep_id":"504","status":"public","_id":"3867","page":"1 - 23","date_created":"2018-12-11T12:05:36Z","date_published":"2010-08-30T00:00:00Z","doi":"10.2168/LMCS-6(3:10)2010","year":"2010","has_accepted_license":"1","publication":"Logical Methods in Computer Science","day":"30","oa":1,"quality_controlled":"1","publisher":"International Federation of Computational Logic","publist_id":"2311","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"title":"Expressiveness and closure properties for quantitative languages","citation":{"ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure properties for quantitative languages,” Logical Methods in Computer Science, vol. 6, no. 3. International Federation of Computational Logic, pp. 1–23, 2010.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science 6 (2010) 1–23.","apa":"Chatterjee, K., Doyen, L., & Henzinger, T. A. (2010). Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-6(3:10)2010","ama":"Chatterjee K, Doyen L, Henzinger TA. Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. 2010;6(3):1-23. doi:10.2168/LMCS-6(3:10)2010","mla":"Chatterjee, Krishnendu, et al. “Expressiveness and Closure Properties for Quantitative Languages.” Logical Methods in Computer Science, vol. 6, no. 3, International Federation of Computational Logic, 2010, pp. 1–23, doi:10.2168/LMCS-6(3:10)2010.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages.” Logical Methods in Computer Science. International Federation of Computational Logic, 2010. https://doi.org/10.2168/LMCS-6(3:10)2010."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems"},{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"}]},{"month":"01","intvolume":" 8","alternative_title":["LIPIcs"],"scopus_import":1,"oa_version":"Published Version","abstract":[{"lang":"eng","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 "regular" 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. "}],"volume":8,"file":[{"date_created":"2018-12-12T10:08:29Z","file_name":"IST-2018-948-v1+1_2011_Cerny_Expressiveness_of.pdf","creator":"system","date_updated":"2020-07-14T12:46:35Z","file_size":492344,"checksum":"5845be5aa19791830f7407d8853f2df0","file_id":"4690","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_status":"published","status":"public","pubrep_id":"948","type":"conference","conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","start_date":"2010-12-15","location":"Chennai, India","end_date":"2010-12-18"},"tmp":{"short":"CC BY-NC-ND (4.0)","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","image":"/images/cc_by_nc_nd.png"},"_id":"488","file_date_updated":"2020-07-14T12:46:35Z","department":[{"_id":"ToHe"}],"ddc":["005"],"date_updated":"2021-01-12T08:01:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"doi":"10.4230/LIPIcs.FSTTCS.2010.1","date_published":"2010-01-01T00:00:00Z","date_created":"2018-12-11T11:46:45Z","page":"1 - 12","day":"01","has_accepted_license":"1","year":"2010","title":"Expressiveness of streaming string transducers","publist_id":"7331","author":[{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"},{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","full_name":"Cerny, Pavol","last_name":"Cerny"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Alur R, Cerny P. Expressiveness of streaming string transducers. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:1-12. doi:10.4230/LIPIcs.FSTTCS.2010.1","apa":"Alur, R., & 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. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1","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.","short":"R. Alur, P. Cerny, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12.","mla":"Alur, Rajeev, and Pavol Cerny. Expressiveness of Streaming String Transducers. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12, doi:10.4230/LIPIcs.FSTTCS.2010.1.","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.","chicago":"Alur, Rajeev, and Pavol Cerny. “Expressiveness of Streaming String Transducers,” 8:1–12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1."}},{"publist_id":"7284","author":[{"full_name":"Hoenicke, Jochen","last_name":"Hoenicke","first_name":"Jochen"},{"first_name":"Kari","last_name":"Leino","full_name":"Leino, Kari"},{"full_name":"Podelski, Andreas","last_name":"Podelski","first_name":"Andreas"},{"first_name":"Martin","last_name":"Schäf","full_name":"Schäf, Martin"},{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Wies","full_name":"Wies, Thomas"}],"department":[{"_id":"ToHe"}],"title":"Doomed program points","date_updated":"2021-01-12T08:01:28Z","citation":{"chicago":"Hoenicke, Jochen, Kari Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “Doomed Program Points.” Formal Methods in System Design. Springer, 2010. https://doi.org/10.1007/s10703-010-0102-0.","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.","mla":"Hoenicke, Jochen, et al. “Doomed Program Points.” Formal Methods in System Design, vol. 37, no. 2–3, Springer, 2010, pp. 171–99, doi:10.1007/s10703-010-0102-0.","short":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, T. Wies, Formal Methods in System Design 37 (2010) 171–199.","ieee":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, and T. Wies, “Doomed program points,” Formal Methods in System Design, vol. 37, no. 2–3. Springer, pp. 171–199, 2010.","ama":"Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. Doomed program points. Formal Methods in System Design. 2010;37(2-3):171-199. doi:10.1007/s10703-010-0102-0","apa":"Hoenicke, J., Leino, K., Podelski, A., Schäf, M., & Wies, T. (2010). Doomed program points. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-010-0102-0"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","type":"journal_article","status":"public","_id":"533","page":"171 - 199","date_created":"2018-12-11T11:47:01Z","volume":37,"date_published":"2010-12-01T00:00:00Z","doi":"10.1007/s10703-010-0102-0","issue":"2-3","publication_status":"published","year":"2010","language":[{"iso":"eng"}],"publication":"Formal Methods in System Design","day":"01","quality_controlled":"1","publisher":"Springer","scopus_import":1,"intvolume":" 37","month":"12","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 ("noise") 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."}],"oa_version":"None"},{"publication_status":"published","language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5130","checksum":"ea567903676ba8afe0507ee11313dce5","creator":"system","date_updated":"2020-07-14T12:46:28Z","file_size":198913,"date_created":"2018-12-12T10:15:12Z","file_name":"IST-2012-42-v1+1_Simulation_distances.pdf"}],"ec_funded":1,"related_material":{"record":[{"id":"3249","status":"public","relation":"later_version"},{"id":"5389","status":"public","relation":"earlier_version"}]},"volume":6269,"abstract":[{"lang":"eng","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."}],"oa_version":"Submitted Version","scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 6269","month":"11","date_updated":"2023-02-23T12:24:04Z","ddc":["005"],"department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:28Z","_id":"4393","conference":{"name":"CONCUR: Concurrency Theory","start_date":"2010-08-31","end_date":"2010-09-03","location":"Paris, France"},"type":"conference","pubrep_id":"42","status":"public","year":"2010","has_accepted_license":"1","day":"01","page":"235 - 268","date_created":"2018-12-11T12:08:37Z","doi":"10.1007/978-3-642-15375-4_18","date_published":"2010-11-01T00:00:00Z","acknowledgement":"This work was partially supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","citation":{"ama":"Cerny P, Henzinger TA, Radhakrishna A. Simulation distances. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:235-268. doi:10.1007/978-3-642-15375-4_18","apa":"Cerny, P., Henzinger, T. A., & 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. https://doi.org/10.1007/978-3-642-15375-4_18","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–268.","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.","mla":"Cerny, Pavol, et al. Simulation Distances. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–68, doi:10.1007/978-3-642-15375-4_18.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances. CONCUR: Concurrency Theory, LNCS, vol. 6269, 235–268.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances,” 6269:235–68. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.1007/978-3-642-15375-4_18."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"1065","author":[{"first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","full_name":"Cerny, Pavol"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun"}],"title":"Simulation distances","project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}]},{"_id":"5388","pubrep_id":"24","status":"public","type":"technical_report","ddc":["000","005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p.","chicago":"Chatterjee, Krishnendu, Pavol Cerny, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. Quantitative Synthesis for Concurrent Programs. IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0004.","apa":"Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2010). Quantitative synthesis for concurrent programs. IST Austria. https://doi.org/10.15479/AT:IST-2010-0004","ama":"Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. Quantitative Synthesis for Concurrent Programs. IST Austria; 2010. doi:10.15479/AT:IST-2010-0004","ieee":"K. Chatterjee, P. Cerny, T. A. Henzinger, A. Radhakrishna, and R. Singh, Quantitative synthesis for concurrent programs. IST Austria, 2010.","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. Quantitative Synthesis for Concurrent Programs. IST Austria, 2010, doi:10.15479/AT:IST-2010-0004."},"date_updated":"2023-02-23T11:24:08Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:42Z","title":"Quantitative synthesis for concurrent programs","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","last_name":"Cerny"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna"},{"first_name":"Rohit","full_name":"Singh, Rohit","last_name":"Singh"}],"oa_version":"Published Version","abstract":[{"lang":"eng","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."}],"month":"10","oa":1,"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","language":[{"iso":"eng"}],"day":"07","file":[{"file_id":"5515","checksum":"da38782d2388a6fa32109d10bb9bad67","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2010-0004_IST-2010-0004.pdf","date_created":"2018-12-12T11:53:53Z","creator":"system","file_size":429101,"date_updated":"2020-07-14T12:46:42Z"}],"publication_status":"published","year":"2010","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"date_created":"2018-12-12T11:39:03Z","doi":"10.15479/AT:IST-2010-0004","date_published":"2010-10-07T00:00:00Z","related_material":{"record":[{"relation":"later_version","id":"3366","status":"public"}]},"page":"17"},{"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"}],"oa_version":"Published Version","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa":1,"month":"06","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"year":"2010","publication_status":"published","file":[{"creator":"system","date_updated":"2020-07-14T12:46:42Z","file_size":367246,"date_created":"2018-12-12T11:54:25Z","file_name":"IST-2010-0003_IST-2010-0003.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5547","checksum":"284ded99764e32a583a8ea83fcea254b"}],"day":"04","language":[{"iso":"eng"}],"page":"24","related_material":{"record":[{"relation":"later_version","status":"public","id":"3249"},{"id":"4393","status":"public","relation":"later_version"}]},"date_published":"2010-06-04T00:00:00Z","doi":"10.15479/AT:IST-2010-0003","date_created":"2018-12-12T11:39:03Z","_id":"5389","type":"technical_report","status":"public","pubrep_id":"25","citation":{"apa":"Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2010). Simulation distances. IST Austria. https://doi.org/10.15479/AT:IST-2010-0003","ama":"Cerny P, Henzinger TA, Radhakrishna A. Simulation Distances. IST Austria; 2010. doi:10.15479/AT:IST-2010-0003","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, Simulation Distances, IST Austria, 2010.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, Simulation distances. IST Austria, 2010.","mla":"Cerny, Pavol, et al. Simulation Distances. IST Austria, 2010, doi:10.15479/AT:IST-2010-0003.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances, IST Austria, 24p.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. Simulation Distances. IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0003."},"date_updated":"2023-02-23T12:09:16Z","ddc":["005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2020-07-14T12:46:42Z","title":"Simulation distances","department":[{"_id":"ToHe"}]},{"pubrep_id":"27","status":"public","conference":{"name":"CAV: Computer Aided Verification","location":"Edinburgh, UK","end_date":"2010-07-17","start_date":"2010-07-15"},"type":"conference","_id":"4390","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:28Z","ddc":["000"],"date_updated":"2023-02-23T12:24:12Z","intvolume":" 6174","month":"07","alternative_title":["LNCS"],"oa_version":"Submitted Version","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"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5391"}]},"volume":6174,"language":[{"iso":"eng"}],"file":[{"date_created":"2020-05-19T16:31:56Z","file_name":"2010_CAV_Cerny.pdf","creator":"dernst","date_updated":"2020-07-14T12:46:28Z","file_size":3633276,"file_id":"7873","checksum":"2eb211ce40b3c4988bce3a3592980704","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"publication_status":"published","title":"Model checking of linearizability of concurrent list implementations","article_processing_charge":"No","publist_id":"1066","author":[{"last_name":"Cerny","full_name":"Cerny, Pavol","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","last_name":"Zufferey","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien"},{"last_name":"Chaudhuri","full_name":"Chaudhuri, Swarat","first_name":"Swarat"},{"first_name":"Rajeev","full_name":"Alur, Rajeev","last_name":"Alur"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Cerny, Pavol, et al. Model Checking of Linearizability of Concurrent List Implementations. Vol. 6174, Springer, 2010, pp. 465–79, doi:10.1007/978-3-642-14295-6_41.","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:10.1007/978-3-642-14295-6_41","apa":"Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., & 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. https://doi.org/10.1007/978-3-642-14295-6_41","short":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, in:, Springer, 2010, pp. 465–479.","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.","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. https://doi.org/10.1007/978-3-642-14295-6_41.","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."},"oa":1,"quality_controlled":"1","publisher":"Springer","date_created":"2018-12-11T12:08:36Z","date_published":"2010-07-01T00:00:00Z","doi":"10.1007/978-3-642-14295-6_41","page":"465 - 479","day":"01","year":"2010","has_accepted_license":"1"},{"title":"GIST: A solver for probabilistic games","external_id":{"arxiv":["1004.2367"]},"article_processing_charge":"No","publist_id":"1068","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Barbara","full_name":"Jobstmann, Barbara","last_name":"Jobstmann"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Radhakrishna, A. (2010). GIST: A solver for probabilistic games (Vol. 6174, pp. 665–669). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. https://doi.org/10.1007/978-3-642-14295-6_57","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. GIST: A solver for probabilistic games. In: Vol 6174. Springer; 2010:665-669. doi:10.1007/978-3-642-14295-6_57","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.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, in:, Springer, 2010, pp. 665–669.","mla":"Chatterjee, Krishnendu, et al. GIST: A Solver for Probabilistic Games. Vol. 6174, Springer, 2010, pp. 665–69, doi:10.1007/978-3-642-14295-6_57.","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.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. “GIST: A Solver for Probabilistic Games,” 6174:665–69. Springer, 2010. https://doi.org/10.1007/978-3-642-14295-6_57."},"project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"},{"name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T12:08:36Z","date_published":"2010-07-01T00:00:00Z","doi":"10.1007/978-3-642-14295-6_57","page":"665 - 669","day":"01","year":"2010","has_accepted_license":"1","oa":1,"publisher":"Springer","quality_controlled":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:28Z","ddc":["004"],"date_updated":"2023-02-23T12:24:17Z","pubrep_id":"43","status":"public","conference":{"name":"CAV: Computer Aided Verification","location":"Edinburgh, UK","end_date":"2010-07-17","start_date":"2010-07-15"},"type":"conference","_id":"4388","ec_funded":1,"related_material":{"record":[{"relation":"earlier_version","id":"5393","status":"public"}]},"volume":6174,"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"0b2ef8c4037ffccc6902d93081af24f7","file_id":"5221","file_size":293605,"date_updated":"2020-07-14T12:46:28Z","creator":"system","file_name":"IST-2012-43-v1+1_GIST-_A_solver_for_probabilistic_games.pdf","date_created":"2018-12-12T10:16:33Z"}],"publication_status":"published","intvolume":" 6174","month":"07","alternative_title":["LNCS"],"scopus_import":1,"oa_version":"Submitted Version","abstract":[{"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.","lang":"eng"}]},{"page":"27","date_created":"2018-12-12T11:39:04Z","related_material":{"record":[{"relation":"later_version","id":"4390","status":"public"}]},"doi":"10.15479/AT:IST-2010-0001","date_published":"2010-04-19T00:00:00Z","publication_status":"published","year":"2010","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"language":[{"iso":"eng"}],"day":"19","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"986645caad7dd85a6a091488f6c646dc","file_id":"5505","date_updated":"2020-07-14T12:46:43Z","file_size":372286,"creator":"system","date_created":"2018-12-12T11:53:44Z","file_name":"IST-2010-0001_IST-2010-0001.pdf"}],"oa":1,"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","month":"04","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."}],"oa_version":"Published Version","author":[{"last_name":"Cerny","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","last_name":"Zufferey","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien"},{"first_name":"Swarat","last_name":"Chaudhuri","full_name":"Chaudhuri, Swarat"},{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"}],"title":"Model checking of linearizability of concurrent list implementations","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:43Z","citation":{"ama":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. Model Checking of Linearizability of Concurrent List Implementations. IST Austria; 2010. doi:10.15479/AT:IST-2010-0001","apa":"Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., & Alur, R. (2010). Model checking of linearizability of concurrent list implementations. IST Austria. https://doi.org/10.15479/AT:IST-2010-0001","ieee":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, Model checking of linearizability of concurrent list implementations. IST Austria, 2010.","short":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, Model Checking of Linearizability of Concurrent List Implementations, IST Austria, 2010.","mla":"Cerny, Pavol, et al. Model Checking of Linearizability of Concurrent List Implementations. IST Austria, 2010, doi:10.15479/AT:IST-2010-0001.","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. Model Checking of Linearizability of Concurrent List Implementations. IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0001."},"date_updated":"2023-02-23T12:09:09Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["004"],"type":"technical_report","pubrep_id":"27","status":"public","_id":"5391"},{"doi":"10.1007/978-3-642-15643-4_1","date_published":"2010-10-12T00:00:00Z","date_created":"2018-12-11T12:05:33Z","page":"1 - 16","day":"12","year":"2010","publisher":"Springer","quality_controlled":"1","title":"Probabilistic Automata on infinite words: decidability and undecidability results","publist_id":"2324","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Chatterjee K, Henzinger TA. Probabilistic Automata on infinite words: decidability and undecidability results. In: Vol 6252. Springer; 2010:1-16. doi:10.1007/978-3-642-15643-4_1","apa":"Chatterjee, K., & Henzinger, T. A. (2010). Probabilistic Automata on infinite words: decidability and undecidability results (Vol. 6252, pp. 1–16). Presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore: Springer. https://doi.org/10.1007/978-3-642-15643-4_1","ieee":"K. Chatterjee and T. A. Henzinger, “Probabilistic Automata on infinite words: decidability and undecidability results,” presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore, 2010, vol. 6252, pp. 1–16.","short":"K. Chatterjee, T.A. Henzinger, in:, Springer, 2010, pp. 1–16.","mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. Probabilistic Automata on Infinite Words: Decidability and Undecidability Results. Vol. 6252, Springer, 2010, pp. 1–16, doi:10.1007/978-3-642-15643-4_1.","ista":"Chatterjee K, Henzinger TA. 2010. Probabilistic Automata on infinite words: decidability and undecidability results. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6252, 1–16.","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “Probabilistic Automata on Infinite Words: Decidability and Undecidability Results,” 6252:1–16. Springer, 2010. https://doi.org/10.1007/978-3-642-15643-4_1."},"project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"},{"grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"volume":6252,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5392"}]},"ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","month":"10","intvolume":" 6252","scopus_import":1,"alternative_title":["LNCS"],"oa_version":"None","abstract":[{"text":"We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present an almost complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words.","lang":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2023-02-23T12:24:14Z","status":"public","pubrep_id":"28","type":"conference","conference":{"start_date":"2010-09-21","end_date":"2010-09-24","location":"Singapore, Singapore","name":"ATVA: Automated Technology for Verification and Analysis"},"_id":"3857"},{"alternative_title":["LNCS"],"scopus_import":1,"intvolume":" 6281","month":"08","abstract":[{"text":"We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past sequence of observations. We consider qualitative analysis problems: given a POMDP with a parity objective, decide whether there exists an observation-based strategy to achieve the objective with probability 1 (almost-sure winning), or with positive probability (positive winning). Our main results are twofold. First, we present a complete picture of the computational complexity of the qualitative analysis problem for POMDPs with parity objectives and its subclasses: safety, reachability, Büchi, and coBüchi objectives. We establish several upper and lower bounds that were not known in the literature. Second, we give optimal bounds (matching upper and lower bounds) for the memory required by pure and randomized observation-based strategies for each class of objectives.","lang":"eng"}],"oa_version":"Submitted Version","ec_funded":1,"volume":6281,"related_material":{"record":[{"id":"5395","status":"public","relation":"earlier_version"}]},"publication_status":"published","language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"b6c82ec82f194e5b0ab7c1c3800e4580","file_id":"5038","creator":"system","file_size":173948,"date_updated":"2020-07-14T12:46:17Z","file_name":"IST-2012-61-v1+1_Qualitative_analysis_of_partially-observable_Markov_Decision_Processes.pdf","date_created":"2018-12-12T10:13:51Z"}],"conference":{"name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2010-08-23","end_date":"2010-08-27","location":"Brno, Czech Republic"},"type":"conference","pubrep_id":"61","status":"public","_id":"3855","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:17Z","date_updated":"2023-02-23T12:24:22Z","ddc":["004"],"oa":1,"publisher":"Springer","quality_controlled":"1","page":"258 - 269","date_created":"2018-12-11T12:05:32Z","date_published":"2010-08-01T00:00:00Z","doi":"10.1007/978-3-642-15155-2_24","year":"2010","has_accepted_license":"1","day":"01","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"publist_id":"2326","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"}],"title":"Qualitative analysis of partially-observable Markov Decision Processes","citation":{"ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Qualitative analysis of partially-observable Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 258–269.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Qualitative Analysis of Partially-Observable Markov Decision Processes,” 6281:258–69. Springer, 2010. https://doi.org/10.1007/978-3-642-15155-2_24.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Qualitative analysis of partially-observable Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 258–269.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2010, pp. 258–269.","apa":"Chatterjee, K., Doyen, L., & Henzinger, T. A. (2010). Qualitative analysis of partially-observable Markov Decision Processes (Vol. 6281, pp. 258–269). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-15155-2_24","ama":"Chatterjee K, Doyen L, Henzinger TA. Qualitative analysis of partially-observable Markov Decision Processes. In: Vol 6281. Springer; 2010:258-269. doi:10.1007/978-3-642-15155-2_24","mla":"Chatterjee, Krishnendu, et al. Qualitative Analysis of Partially-Observable Markov Decision Processes. Vol. 6281, Springer, 2010, pp. 258–69, doi:10.1007/978-3-642-15155-2_24."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},{"oa":1,"publisher":"Springer","quality_controlled":"1","day":"01","year":"2010","has_accepted_license":"1","date_created":"2018-12-11T12:08:27Z","doi":"10.1007/978-3-642-12032-9_8","date_published":"2010-03-01T00:00:00Z","page":"94 - 108","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Wies, Thomas, et al. Forward Analysis of Depth-Bounded Processes. Edited by Luke Ong, vol. 6014, Springer, 2010, pp. 94–108, doi:10.1007/978-3-642-12032-9_8.","short":"T. Wies, D. Zufferey, T.A. Henzinger, in:, L. Ong (Ed.), Springer, 2010, pp. 94–108.","ieee":"T. Wies, D. Zufferey, and T. A. Henzinger, “Forward analysis of depth-bounded processes,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus, 2010, vol. 6014, pp. 94–108.","ama":"Wies T, Zufferey D, Henzinger TA. Forward analysis of depth-bounded processes. In: Ong L, ed. Vol 6014. Springer; 2010:94-108. doi:10.1007/978-3-642-12032-9_8","apa":"Wies, T., Zufferey, D., & Henzinger, T. A. (2010). Forward analysis of depth-bounded processes. In L. Ong (Ed.) (Vol. 6014, pp. 94–108). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus: Springer. https://doi.org/10.1007/978-3-642-12032-9_8","chicago":"Wies, Thomas, Damien Zufferey, and Thomas A Henzinger. “Forward Analysis of Depth-Bounded Processes.” edited by Luke Ong, 6014:94–108. Springer, 2010. https://doi.org/10.1007/978-3-642-12032-9_8.","ista":"Wies T, Zufferey D, Henzinger TA. 2010. Forward analysis of depth-bounded processes. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 6014, 94–108."},"editor":[{"last_name":"Ong","full_name":"Ong, Luke","first_name":"Luke"}],"title":"Forward analysis of depth-bounded processes","author":[{"full_name":"Wies, Thomas","last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","last_name":"Zufferey","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"}],"publist_id":"1099","oa_version":"Submitted Version","abstract":[{"text":"Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an adequate domain of limits for the well-structured transition systems that are induced by depth-bounded processes. An immediate consequence of our result is that there exists a forward algorithm that decides the covering problem for this class. Unlike backward algorithms, the forward algorithm terminates even if the depth of the process is not known a priori. More importantly, our result suggests a whole spectrum of forward algorithms that enable the effective verification of a large class of mobile systems.","lang":"eng"}],"intvolume":" 6014","month":"03","scopus_import":1,"alternative_title":["LNCS"],"language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:08:17Z","file_name":"IST-2012-50-v1+1_Forward_analysis_of_depth-bounded_processes.pdf","creator":"system","date_updated":"2020-07-14T12:46:27Z","file_size":240766,"file_id":"4677","checksum":"3e610de84937d821316362658239134a","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"publication_status":"published","volume":6014,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"1405"}]},"_id":"4361","pubrep_id":"50","status":"public","conference":{"location":"Paphos, Cyprus","end_date":"2010-03-28","start_date":"2010-03-20","name":"FoSSaCS: Foundations of Software Science and Computation Structures"},"type":"conference","ddc":["004"],"date_updated":"2023-09-07T11:36:36Z","file_date_updated":"2020-07-14T12:46:27Z","department":[{"_id":"ToHe"}]},{"department":[{"_id":"ToHe"},{"_id":"CaGu"}],"file_date_updated":"2020-07-14T12:46:17Z","date_updated":"2023-02-23T11:45:05Z","ddc":["000"],"type":"conference","conference":{"name":"HIBI: High-Performance Computational Systems Biology","start_date":"2009-10-14","end_date":"2009-10-16","location":"Trento, Italy"},"status":"public","_id":"3843","volume":4,"issue":"6","related_material":{"record":[{"id":"3842","status":"public","relation":"later_version"}]},"publication_status":"published","file":[{"file_size":222890,"date_updated":"2020-07-14T12:46:17Z","creator":"dernst","file_name":"2009_HIBI_Didier.pdf","date_created":"2020-05-19T16:33:55Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"9a3bde48f43203991a0b3c6a277c2f5b","file_id":"7874"}],"language":[{"iso":"eng"}],"scopus_import":1,"month":"10","intvolume":" 4","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).\r\nStandard Uniformization (SU) is an efficient method for the transient analysis of CTMCs. For systems with very different time scales, such as biochemical reaction networks, SU is computationally expensive. In these cases, a variant of SU, called adaptive uniformization (AU), is known to reduce the large number of iterations needed by SU. The additional difficulty of AU is that it requires the solution of a birth process.\r\nIn this paper we present an on-the-fly variant of AU, where we improve the original algorithm for AU 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."}],"oa_version":"Submitted Version","author":[{"last_name":"Didier","full_name":"Didier, Frédéric","first_name":"Frédéric"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Mateescu","full_name":"Mateescu, Maria","id":"3B43276C-F248-11E8-B48F-1D18A9856A87","first_name":"Maria"},{"full_name":"Wolf, Verena","last_name":"Wolf","first_name":"Verena"}],"publist_id":"2348","article_processing_charge":"No","title":"Fast adaptive uniformization of the chemical master equation","citation":{"ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2009. Fast adaptive uniformization of the chemical master equation. HIBI: High-Performance Computational Systems Biology vol. 4, 118–127.","chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Fast Adaptive Uniformization of the Chemical Master Equation,” 4:118–27. IEEE, 2009. https://doi.org/10.1109/HiBi.2009.23.","apa":"Didier, F., Henzinger, T. A., Mateescu, M., & Wolf, V. (2009). Fast adaptive uniformization of the chemical master equation (Vol. 4, pp. 118–127). Presented at the HIBI: High-Performance Computational Systems Biology, Trento, Italy: IEEE. https://doi.org/10.1109/HiBi.2009.23","ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. Fast adaptive uniformization of the chemical master equation. In: Vol 4. IEEE; 2009:118-127. doi:10.1109/HiBi.2009.23","short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, IEEE, 2009, pp. 118–127.","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Fast adaptive uniformization of the chemical master equation,” presented at the HIBI: High-Performance Computational Systems Biology, Trento, Italy, 2009, vol. 4, no. 6, pp. 118–127.","mla":"Didier, Frédéric, et al. Fast Adaptive Uniformization of the Chemical Master Equation. Vol. 4, no. 6, IEEE, 2009, pp. 118–27, doi:10.1109/HiBi.2009.23."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"118 - 127","doi":"10.1109/HiBi.2009.23","date_published":"2009-10-30T00:00:00Z","date_created":"2018-12-11T12:05:28Z","has_accepted_license":"1","year":"2009","day":"30","quality_controlled":"1","publisher":"IEEE","oa":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."},{"language":[{"iso":"eng"}],"file":[{"file_id":"4702","checksum":"df88431872586c773fbcfea37d7b36a2","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:08:41Z","file_name":"IST-2012-67-v1+1_Formalisms_for_specifying_Markovian_population_models.pdf","date_updated":"2020-07-14T12:46:16Z","file_size":222840,"creator":"system"}],"publication_status":"published","volume":5797,"related_material":{"record":[{"relation":"later_version","id":"3381","status":"public"}]},"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. These languages —matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded command models— all describe continuous-time Markov chains, but they differ according to important properties, such as compositionality, expressiveness and succinctness, executability, ease of use, and the support they provide for checking the well-formedness of a model and for analyzing a model. "}],"intvolume":" 5797","month":"09","scopus_import":1,"alternative_title":["LNCS"],"ddc":["005"],"date_updated":"2023-02-23T11:24:49Z","file_date_updated":"2020-07-14T12:46:16Z","department":[{"_id":"ToHe"}],"_id":"3841","pubrep_id":"67","status":"public","conference":{"name":"RP: Reachability Problems","end_date":"2009-09-25","location":"Palaiseau, France","start_date":"2009-09-23"},"type":"conference","day":"07","year":"2009","has_accepted_license":"1","date_created":"2018-12-11T12:05:28Z","date_published":"2009-09-07T00:00:00Z","doi":"10.1007/978-3-642-04420-5_2","page":"3 - 23","acknowledgement":"This research was supported in part by the Excellence Cluster on Multimodal Computing and Interaction and the Swiss National Science Foundation.","oa":1,"publisher":"Springer","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Henzinger, Thomas A, Barbara Jobstmann, and Verena Wolf. “Formalisms for Specifying Markovian Population Models,” 5797:3–23. Springer, 2009. https://doi.org/10.1007/978-3-642-04420-5_2.","ista":"Henzinger TA, Jobstmann B, Wolf V. 2009. Formalisms for specifying Markovian population models. RP: Reachability Problems, LNCS, vol. 5797, 3–23.","mla":"Henzinger, Thomas A., et al. Formalisms for Specifying Markovian Population Models. Vol. 5797, Springer, 2009, pp. 3–23, doi:10.1007/978-3-642-04420-5_2.","apa":"Henzinger, T. A., Jobstmann, B., & Wolf, V. (2009). Formalisms for specifying Markovian population models (Vol. 5797, pp. 3–23). Presented at the RP: Reachability Problems, Palaiseau, France: Springer. https://doi.org/10.1007/978-3-642-04420-5_2","ama":"Henzinger TA, Jobstmann B, Wolf V. Formalisms for specifying Markovian population models. In: Vol 5797. Springer; 2009:3-23. doi:10.1007/978-3-642-04420-5_2","short":"T.A. Henzinger, B. Jobstmann, V. Wolf, in:, Springer, 2009, pp. 3–23.","ieee":"T. A. Henzinger, B. Jobstmann, and V. Wolf, “Formalisms for specifying Markovian population models,” presented at the RP: Reachability Problems, Palaiseau, France, 2009, vol. 5797, pp. 3–23."},"title":"Formalisms for specifying Markovian population models","publist_id":"2352","author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"},{"first_name":"Verena","full_name":"Wolf, Verena","last_name":"Wolf"}]},{"project":[{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373"},{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Henzinger, Thomas A, Christoph Kirsch, Eduardo Marques, and Ana Sokolova. “Distributed, Modular HTL,” 171–80. IEEE, 2009. https://doi.org/10.1109/RTSS.2009.9.","ista":"Henzinger TA, Kirsch C, Marques E, Sokolova A. 2009. Distributed, modular HTL. RTSS: Real-Time Systems Symposium, 171–180.","mla":"Henzinger, Thomas A., et al. Distributed, Modular HTL. IEEE, 2009, pp. 171–80, doi:10.1109/RTSS.2009.9.","apa":"Henzinger, T. A., Kirsch, C., Marques, E., & Sokolova, A. (2009). Distributed, modular HTL (pp. 171–180). Presented at the RTSS: Real-Time Systems Symposium, Washington, DC, United States: IEEE. https://doi.org/10.1109/RTSS.2009.9","ama":"Henzinger TA, Kirsch C, Marques E, Sokolova A. Distributed, modular HTL. In: IEEE; 2009:171-180. doi:10.1109/RTSS.2009.9","ieee":"T. A. Henzinger, C. Kirsch, E. Marques, and A. Sokolova, “Distributed, modular HTL,” presented at the RTSS: Real-Time Systems Symposium, Washington, DC, United States, 2009, pp. 171–180.","short":"T.A. Henzinger, C. Kirsch, E. Marques, A. Sokolova, in:, IEEE, 2009, pp. 171–180."},"title":"Distributed, modular HTL","publist_id":"2346","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"first_name":"Christoph","last_name":"Kirsch","full_name":"Kirsch, Christoph"},{"full_name":"Marques, Eduardo","last_name":"Marques","first_name":"Eduardo"},{"last_name":"Sokolova","full_name":"Sokolova, Ana","first_name":"Ana"}],"acknowledgement":"Supported by the EU ArtistDesign Network of Excellence on Embedded Systems Design, the EU project COMBEST, the Austrian Science Funds P18913-N15 and V00125, and Fundacao para a Ciencia e Tecnologia funds SFRH/BD/29461/2006 and PTDC/EIA/71462/2006","oa":1,"publisher":"IEEE","quality_controlled":"1","day":"01","year":"2009","has_accepted_license":"1","date_created":"2018-12-11T12:05:28Z","doi":"10.1109/RTSS.2009.9","date_published":"2009-01-01T00:00:00Z","page":"171 - 180","_id":"3844","pubrep_id":"65","status":"public","conference":{"start_date":"2009-12-01","location":"Washington, DC, United States","end_date":"2009-12-04","name":"RTSS: Real-Time Systems Symposium"},"type":"conference","ddc":["000"],"date_updated":"2021-01-12T07:52:36Z","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:17Z","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"The Hierarchical Timing Language (HTL) is a real-time coordination language for distributed control systems. HTL programs must be checked for well-formedness, race freedom, transmission safety (schedulability of inter-host communication), and time safety (schedulability of host computation). We present a modular abstract syntax and semantics for HTL, modular checks of well-formedness, race freedom, and transmission safety, and modular code distribution. Our contributions here complement previous results on HTL time safety and modular code generation. Modularity in HTL can be utilized in easy program composition as well as fast program analysis and code generation, but also in so-called runtime patching, where program components may be modified at runtime."}],"month":"01","language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:07:56Z","file_name":"IST-2012-65-v1+1_Distributed_modular_Htl.pdf","creator":"system","date_updated":"2020-07-14T12:46:17Z","file_size":526458,"file_id":"4655","checksum":"b2b15a5ef71eb50d62eaa5aea7efd8c4","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"publication_status":"published","ec_funded":1},{"date_created":"2018-12-11T12:05:26Z","doi":"10.1145/1629335.1629346","date_published":"2009-01-01T00:00:00Z","page":"67 - 76","publication":"EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software","day":"01","year":"2009","has_accepted_license":"1","oa":1,"publisher":"ACM","quality_controlled":"1","acknowledgement":"This work is supported by the Center for Hybrid and Embedded Software Systems (CHESS) at UC Berkeley, which receives support from the National Science Foundation (NSF awards #0720882 (CSR-EHS: PRET) and #0720841 (CSR-CPS)), the U.S. Army Research Office (ARO #W911NF-07-2-0019), the U.S. Air Force Office of Scientific Research (MURI #FA9550-06-0312), the Air Force Research Lab (AFRL), the State of California Micro Program, and the following companies: Agilent, Bosch, Lockheed-Martin, National Instruments, Thales and Toyota. This work is also supported by the COMBEST and ArtistDesign projects of the European Union, and the Swiss National Science Foundation. ","title":"On relational interfaces","publist_id":"2360","author":[{"first_name":"Stavros","last_name":"Tripakis","full_name":"Tripakis, Stavros"},{"last_name":"Lickly","full_name":"Lickly, Ben","first_name":"Ben"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lee","full_name":"Lee, Edward","first_name":"Edward"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “On relational interfaces,” in EMSOFT ’09 Proceedings of the seventh ACM international conference on Embedded software, Grenoble, France, 2009, pp. 67–76.","short":"S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, in:, EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software, ACM, 2009, pp. 67–76.","apa":"Tripakis, S., Lickly, B., Henzinger, T. A., & Lee, E. (2009). On relational interfaces. In EMSOFT ’09 Proceedings of the seventh ACM international conference on Embedded software (pp. 67–76). Grenoble, France: ACM. https://doi.org/10.1145/1629335.1629346","ama":"Tripakis S, Lickly B, Henzinger TA, Lee E. On relational interfaces. In: EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software. ACM; 2009:67-76. doi:10.1145/1629335.1629346","mla":"Tripakis, Stavros, et al. “On Relational Interfaces.” EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software, ACM, 2009, pp. 67–76, doi:10.1145/1629335.1629346.","ista":"Tripakis S, Lickly B, Henzinger TA, Lee E. 2009. On relational interfaces. EMSOFT ’09 Proceedings of the seventh ACM international conference on Embedded software. EMSOFT: Embedded Software , 67–76.","chicago":"Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “On Relational Interfaces.” In EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software, 67–76. ACM, 2009. https://doi.org/10.1145/1629335.1629346."},"project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","grant_number":"214373"}],"ec_funded":1,"language":[{"iso":"eng"}],"file":[{"file_id":"5045","checksum":"3a70e21527dfaad2f198549ae5710786","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2012-70-v1+1_On_Relational_Interfaces.pdf","date_created":"2018-12-12T10:13:57Z","file_size":310902,"date_updated":"2020-07-14T12:46:16Z","creator":"system"}],"publication_status":"published","month":"01","oa_version":"Submitted Version","abstract":[{"text":"In this paper we extend the work of Alfaro, Henzinger et al. on interface theories for component-based design. Existing interface theories often fail to capture functional relations between the inputs and outputs of an interface. For example, a simple synchronous interface that takes as input a number n ≥ 0 and returns, at the same time, as output n + 1, cannot be expressed in existing theories. In this paper we provide a theory of relational interfaces, where such input-output relations can be captured. Our theory supports synchronous interfaces, both stateless and stateful. It includes explicit notions of environments and pluggability, and satisfies fundamental properties such as preservation of refinement by composition, and characterization of pluggability by refinement. We achieve these properties by making reasonable restrictions on feedback loops in interface compositions.","lang":"eng"}],"department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:16Z","ddc":["004"],"date_updated":"2021-01-12T07:52:33Z","pubrep_id":"70","status":"public","conference":{"end_date":"2009-10-16","location":"Grenoble, France","start_date":"2009-10-12","name":"EMSOFT: Embedded Software "},"type":"conference","_id":"3837"},{"ddc":["000","005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:09:01Z","citation":{"ista":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2009. Gist: A solver for probabilistic games, IST Austria, 12p.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. Gist: A Solver for Probabilistic Games. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0003.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. Gist: A Solver for Probabilistic Games. IST Austria; 2009. doi:10.15479/AT:IST-2009-0003","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Radhakrishna, A. (2009). Gist: A solver for probabilistic games. IST Austria. https://doi.org/10.15479/AT:IST-2009-0003","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, Gist: A Solver for Probabilistic Games, IST Austria, 2009.","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, Gist: A solver for probabilistic games. IST Austria, 2009.","mla":"Chatterjee, Krishnendu, et al. Gist: A Solver for Probabilistic Games. IST Austria, 2009, doi:10.15479/AT:IST-2009-0003."},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:43Z","title":"Gist: A solver for probabilistic games","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"},{"first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"}],"_id":"5393","status":"public","pubrep_id":"29","type":"technical_report","file":[{"checksum":"49551ac552915b17593a14c993845274","file_id":"5459","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2009-0003_IST-2009-0003.pdf","date_created":"2018-12-12T11:52:58Z","creator":"system","file_size":386866,"date_updated":"2020-07-14T12:46:43Z"}],"day":"09","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","year":"2009","publication_status":"published","doi":"10.15479/AT:IST-2009-0003","related_material":{"record":[{"status":"public","id":"4388","relation":"later_version"}]},"date_published":"2009-10-09T00:00:00Z","date_created":"2018-12-12T11:39:05Z","page":"12","oa_version":"Published Version","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 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."}],"month":"10","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa":1},{"page":"11","doi":"10.15479/AT:IST-2009-0002","date_published":"2009-09-09T00:00:00Z","date_created":"2018-12-12T11:39:05Z","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"publication_status":"published","year":"2009","day":"09","file":[{"checksum":"1c50a9723fbae1b2c46d18138968efb3","file_id":"5511","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T11:53:50Z","file_name":"IST-2009-0002_IST-2009-0002.pdf","creator":"system","date_updated":"2020-07-14T12:46:43Z","file_size":238091}],"language":[{"iso":"eng"}],"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa":1,"month":"09","abstract":[{"lang":"eng","text":"We consider two-player games played on graphs with request-response and finitary Streett objectives. We show these games are PSPACE-hard, improving the previous known NP-hardness. We also improve the lower bounds on memory required by the winning strategies for the players."}],"oa_version":"Published Version","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Horn, Florian","last_name":"Horn","first_name":"Florian","id":"37327ACE-F248-11E8-B48F-1D18A9856A87"}],"title":"Improved lower bounds for request-response and finitary Streett games","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:43Z","date_updated":"2020-07-14T23:07:47Z","citation":{"ieee":"K. Chatterjee, T. A. Henzinger, and F. Horn, Improved lower bounds for request-response and finitary Streett games. IST Austria, 2009.","short":"K. Chatterjee, T.A. Henzinger, F. Horn, Improved Lower Bounds for Request-Response and Finitary Streett Games, IST Austria, 2009.","apa":"Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Improved lower bounds for request-response and finitary Streett games. IST Austria. https://doi.org/10.15479/AT:IST-2009-0002","ama":"Chatterjee K, Henzinger TA, Horn F. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria; 2009. doi:10.15479/AT:IST-2009-0002","mla":"Chatterjee, Krishnendu, et al. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria, 2009, doi:10.15479/AT:IST-2009-0002.","ista":"Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response and finitary Streett games, IST Austria, 11p.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0002."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["004"],"type":"technical_report","status":"public","pubrep_id":"30","_id":"5394"},{"type":"technical_report","status":"public","pubrep_id":"31","_id":"5395","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2020-07-14T12:46:43Z","title":"Qualitative analysis of partially-observable Markov decision processes","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"citation":{"apa":"Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Qualitative analysis of partially-observable Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2009-0001","ama":"Chatterjee K, Doyen L, Henzinger TA. Qualitative Analysis of Partially-Observable Markov Decision Processes. IST Austria; 2009. doi:10.15479/AT:IST-2009-0001","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, Qualitative Analysis of Partially-Observable Markov Decision Processes, IST Austria, 2009.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, Qualitative analysis of partially-observable Markov decision processes. IST Austria, 2009.","mla":"Chatterjee, Krishnendu, et al. Qualitative Analysis of Partially-Observable Markov Decision Processes. IST Austria, 2009, doi:10.15479/AT:IST-2009-0001.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. Qualitative analysis of partially-observable Markov decision processes, IST Austria, 20p.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. Qualitative Analysis of Partially-Observable Markov Decision Processes. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0001."},"date_updated":"2023-02-23T11:45:39Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["005"],"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa":1,"month":"09","abstract":[{"lang":"eng","text":"We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with omega-regular objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past sequence of observa- tions. We consider the qualitative analysis problem: given a POMDP with an omega-regular objective, whether there is an observation-based strategy to achieve the objective with probability 1 (almost-sure winning), or with positive probability (positive winning). Our main results are twofold. First, we present a complete picture of the computational complexity of the qualitative analysis of POMDPs with parity objectives (a canonical form to express omega-regular objectives) and its subclasses. Our contribution consists in establishing several upper and lower bounds that were not known in literature. Second, we present optimal bounds (matching upper and lower bounds) on the memory required by pure and randomized observation-based strategies for the qualitative analysis of POMDPs with parity objectives and its subclasses."}],"oa_version":"Published Version","page":"20","date_published":"2009-09-09T00:00:00Z","doi":"10.15479/AT:IST-2009-0001","related_material":{"record":[{"id":"3855","status":"public","relation":"later_version"}]},"date_created":"2018-12-12T11:39:05Z","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"publication_status":"published","year":"2009","day":"09","file":[{"creator":"system","date_updated":"2020-07-14T12:46:43Z","file_size":342088,"date_created":"2018-12-12T11:53:25Z","file_name":"IST-2009-0001_IST-2009-0001.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5486","checksum":"04d9cc065cc19598a4e8631c47f1a562"}],"language":[{"iso":"eng"}]}]