[{"pubrep_id":"50","oa_version":"Submitted Version","date_created":"2018-12-11T12:08:27Z","file_date_updated":"2020-07-14T12:46:27Z","_id":"4361","type":"conference","author":[{"last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","full_name":"Wies, Thomas"},{"last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"ToHe"}],"day":"01","title":"Forward analysis of depth-bounded processes","volume":6014,"status":"public","scopus_import":1,"month":"03","date_published":"2010-03-01T00:00:00Z","publication_status":"published","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-09-07T11:36:36Z","publist_id":"1099","publisher":"Springer","quality_controlled":"1","doi":"10.1007/978-3-642-12032-9_8","citation":{"apa":"Wies, T., Zufferey, D., &#38; 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. <a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">https://doi.org/10.1007/978-3-642-12032-9_8</a>","short":"T. Wies, D. Zufferey, T.A. Henzinger, in:, L. Ong (Ed.), Springer, 2010, pp. 94–108.","chicago":"Wies, Thomas, Damien Zufferey, and Thomas A Henzinger. “Forward Analysis of Depth-Bounded Processes.” edited by Luke Ong, 6014:94–108. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">https://doi.org/10.1007/978-3-642-12032-9_8</a>.","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.","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.","mla":"Wies, Thomas, et al. <i>Forward Analysis of Depth-Bounded Processes</i>. Edited by Luke Ong, vol. 6014, Springer, 2010, pp. 94–108, doi:<a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">10.1007/978-3-642-12032-9_8</a>.","ama":"Wies T, Zufferey D, Henzinger TA. Forward analysis of depth-bounded processes. In: Ong L, ed. Vol 6014. Springer; 2010:94-108. doi:<a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">10.1007/978-3-642-12032-9_8</a>"},"related_material":{"record":[{"id":"1405","status":"public","relation":"dissertation_contains"}]},"conference":{"name":"FoSSaCS: Foundations of Software Science and Computation Structures","location":"Paphos, Cyprus","start_date":"2010-03-20","end_date":"2010-03-28"},"year":"2010","language":[{"iso":"eng"}],"has_accepted_license":"1","intvolume":"      6014","editor":[{"full_name":"Ong, Luke","first_name":"Luke","last_name":"Ong"}],"alternative_title":["LNCS"],"page":"94 - 108","abstract":[{"lang":"eng","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."}],"oa":1,"ddc":["004"],"file":[{"content_type":"application/pdf","file_name":"IST-2012-50-v1+1_Forward_analysis_of_depth-bounded_processes.pdf","relation":"main_file","file_id":"4677","date_created":"2018-12-12T10:08:17Z","access_level":"open_access","date_updated":"2020-07-14T12:46:27Z","file_size":240766,"checksum":"3e610de84937d821316362658239134a","creator":"system"}]},{"publist_id":"1096","date_updated":"2021-01-12T07:56:25Z","publisher":"Springer","publication_status":"published","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","month":"01","date_published":"2010-01-01T00:00:00Z","abstract":[{"lang":"eng","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."}],"page":"421 - 435","alternative_title":["LNCS"],"scopus_import":1,"editor":[{"last_name":"Sokolsky","first_name":"Oleg","full_name":"Sokolsky, Oleg"},{"full_name":"Rosu, Grigore","first_name":"Grigore","last_name":"Rosu"},{"full_name":"Tilmann, Nikolai","first_name":"Nikolai","last_name":"Tilmann"},{"full_name":"Barringer, Howard","first_name":"Howard","last_name":"Barringer"},{"full_name":"Falcone, Ylies","first_name":"Ylies","last_name":"Falcone"},{"first_name":"Bernd","last_name":"Finkbeiner","full_name":"Finkbeiner, Bernd"},{"full_name":"Havelund, Klaus","first_name":"Klaus","last_name":"Havelund"},{"last_name":"Lee","first_name":"Insup","full_name":"Lee, Insup"},{"full_name":"Pace, Gordon","last_name":"Pace","first_name":"Gordon"}],"status":"public","intvolume":"      6418","volume":6418,"title":"Runtime verification for software transactional memories","language":[{"iso":"eng"}],"day":"01","year":"2010","conference":{"start_date":"2010-11-01","end_date":"2010-11-04","location":"St. Julians, Malta","name":"RV: International Conference on Runtime Verification"},"department":[{"_id":"ToHe"}],"author":[{"full_name":"Singh, Vasu","last_name":"Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu"}],"_id":"4362","type":"conference","date_created":"2018-12-11T12:08:28Z","quality_controlled":"1","oa_version":"None","doi":"10.1007/978-3-642-16612-9_32","citation":{"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:<a href=\"https://doi.org/10.1007/978-3-642-16612-9_32\">10.1007/978-3-642-16612-9_32</a>","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. <a href=\"https://doi.org/10.1007/978-3-642-16612-9_32\">https://doi.org/10.1007/978-3-642-16612-9_32</a>","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. <a href=\"https://doi.org/10.1007/978-3-642-16612-9_32\">https://doi.org/10.1007/978-3-642-16612-9_32</a>.","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.","ista":"Singh V. 2010. Runtime verification for software transactional memories. RV: International Conference on Runtime Verification, LNCS, vol. 6418, 421–435.","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.","mla":"Singh, Vasu. <i>Runtime Verification for Software Transactional Memories</i>. Edited by Oleg Sokolsky et al., vol. 6418, Springer, 2010, pp. 421–35, doi:<a href=\"https://doi.org/10.1007/978-3-642-16612-9_32\">10.1007/978-3-642-16612-9_32</a>."}},{"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."}],"ddc":["004"],"oa":1,"file":[{"file_size":249789,"checksum":"b0ca5f5fbe8a3d20ccbc6f51a344a459","creator":"system","date_updated":"2020-07-14T12:46:27Z","file_id":"5028","access_level":"open_access","date_created":"2018-12-12T10:13:43Z","content_type":"application/pdf","file_name":"IST-2012-49-v1+1_From_MTL_to_deterministic_timed_automata.pdf","relation":"main_file"}],"page":"152 - 167","alternative_title":["LNCS"],"editor":[{"last_name":"Henzinger","first_name":"Thomas A.","full_name":"Henzinger, Thomas A."},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"}],"has_accepted_license":"1","intvolume":"      6246","year":"2010","language":[{"iso":"eng"}],"conference":{"start_date":"2010-09-08","end_date":"2010-09-10","location":"Klosterneuburg, Austria","name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"ec_funded":1,"quality_controlled":"1","citation":{"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. <a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">https://doi.org/10.1007/978-3-642-15297-9_13</a>.","short":"D. Nickovic, N. Piterman, in:, T.A. Henzinger, K. Chatterjee (Eds.), Springer, 2010, pp. 152–167.","apa":"Nickovic, D., &#38; Piterman, N. (2010). From MTL to deterministic timed automata. In T. A. Henzinger &#38; K. Chatterjee (Eds.) (Vol. 6246, pp. 152–167). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">https://doi.org/10.1007/978-3-642-15297-9_13</a>","mla":"Nickovic, Dejan, and Nir Piterman. <i>From MTL to Deterministic Timed Automata</i>. Edited by Thomas A. Henzinger and Krishnendu Chatterjee, vol. 6246, Springer, 2010, pp. 152–67, doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">10.1007/978-3-642-15297-9_13</a>.","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.","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.","ama":"Nickovic D, Piterman N. From MTL to deterministic timed automata. In: Henzinger TA, Chatterjee K, eds. Vol 6246. Springer; 2010:152-167. doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">10.1007/978-3-642-15297-9_13</a>"},"doi":"10.1007/978-3-642-15297-9_13","publication_status":"published","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:56:27Z","publist_id":"1090","publisher":"Springer","date_published":"2010-09-08T00:00:00Z","month":"09","scopus_import":1,"title":"From MTL to deterministic timed automata","volume":6246,"status":"public","day":"08","author":[{"full_name":"Nickovic, Dejan","first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic"},{"full_name":"Piterman, Nir","last_name":"Piterman","first_name":"Nir"}],"department":[{"_id":"ToHe"}],"pubrep_id":"49","date_created":"2018-12-11T12:08:30Z","oa_version":"Submitted Version","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","call_identifier":"FP7"},{"grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems"}],"file_date_updated":"2020-07-14T12:46:27Z","type":"conference","_id":"4369"},{"page":"26 - 44","alternative_title":["LNCS"],"editor":[{"first_name":"Gilles","last_name":"Barthe","full_name":"Barthe, Gilles"},{"last_name":"Hermenegildo","first_name":"Manuel","full_name":"Hermenegildo, Manuel"}],"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":1,"conference":{"location":"Madrid, Spain","start_date":"2010-01-17","end_date":"2010-01-19","name":"VMCAI: Verification, Model Checking and Abstract Interpretation"},"quality_controlled":"1","doi":"10.1007/978-3-642-11319-2_6","citation":{"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:<a href=\"https://doi.org/10.1007/978-3-642-11319-2_6\">10.1007/978-3-642-11319-2_6</a>","mla":"Kuncak, Viktor, et al. <i>Building a Calculus of Data Structures</i>. Edited by Gilles Barthe and Manuel Hermenegildo, vol. 5944, Springer, 2010, pp. 26–44, doi:<a href=\"https://doi.org/10.1007/978-3-642-11319-2_6\">10.1007/978-3-642-11319-2_6</a>.","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.","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.","short":"V. Kuncak, R. Piskac, P. Suter, T. Wies, in:, G. Barthe, M. Hermenegildo (Eds.), Springer, 2010, pp. 26–44.","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. <a href=\"https://doi.org/10.1007/978-3-642-11319-2_6\">https://doi.org/10.1007/978-3-642-11319-2_6</a>.","apa":"Kuncak, V., Piskac, R., Suter, P., &#38; Wies, T. (2010). Building a calculus of data structures. In G. Barthe &#38; M. Hermenegildo (Eds.) (Vol. 5944, pp. 26–44). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-642-11319-2_6\">https://doi.org/10.1007/978-3-642-11319-2_6</a>"},"intvolume":"      5944","year":"2010","language":[{"iso":"eng"}],"scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://infoscience.epfl.ch/record/161290/"}],"publication_status":"published","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:56:31Z","publist_id":"1081","publisher":"Springer","date_published":"2010-01-01T00:00:00Z","month":"01","author":[{"last_name":"Kuncak","first_name":"Viktor","full_name":"Kuncak, Viktor"},{"full_name":"Piskac, Ruzica","last_name":"Piskac","first_name":"Ruzica"},{"full_name":"Suter, Philippe","last_name":"Suter","first_name":"Philippe"},{"full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Wies"}],"department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:08:33Z","oa_version":"Submitted Version","type":"conference","_id":"4378","volume":5944,"title":"Building a calculus of data structures","status":"public","day":"01"},{"quality_controlled":"1","doi":"10.1145/1879021.1879022","citation":{"ama":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. A marketplace for cloud resources. In: ACM; 2010:1-8. doi:<a href=\"https://doi.org/10.1145/1879021.1879022\">10.1145/1879021.1879022</a>","ista":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. 2010. A marketplace for cloud resources. EMSOFT: Embedded Software , 1–8.","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.","mla":"Henzinger, Thomas A., et al. <i>A Marketplace for Cloud Resources</i>. ACM, 2010, pp. 1–8, doi:<a href=\"https://doi.org/10.1145/1879021.1879022\">10.1145/1879021.1879022</a>.","apa":"Henzinger, T. A., Tomar, A., Singh, V., Wies, T., &#38; Zufferey, D. (2010). A marketplace for cloud resources (pp. 1–8). Presented at the EMSOFT: Embedded Software , Arizona, USA: ACM. <a href=\"https://doi.org/10.1145/1879021.1879022\">https://doi.org/10.1145/1879021.1879022</a>","chicago":"Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey. “A Marketplace for Cloud Resources,” 1–8. ACM, 2010. <a href=\"https://doi.org/10.1145/1879021.1879022\">https://doi.org/10.1145/1879021.1879022</a>.","short":"T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2010, pp. 1–8."},"conference":{"name":"EMSOFT: Embedded Software ","end_date":"2010-10-29","start_date":"2010-10-24","location":"Arizona, USA"},"language":[{"iso":"eng"}],"year":"2010","has_accepted_license":"1","page":"1 - 8","file":[{"content_type":"application/pdf","file_name":"IST-2012-48-v1+1_A_marketplace_for_cloud_resources.pdf","relation":"main_file","file_id":"4767","date_created":"2018-12-12T10:09:42Z","access_level":"open_access","date_updated":"2020-07-14T12:46:28Z","file_size":222626,"checksum":"7680dd24016810710f7c977bc94f85e9","creator":"system"}],"abstract":[{"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.","lang":"eng"}],"ddc":["005"],"oa":1,"file_date_updated":"2020-07-14T12:46:28Z","_id":"4380","type":"conference","date_created":"2018-12-11T12:08:33Z","pubrep_id":"48","oa_version":"Submitted Version","department":[{"_id":"ToHe"}],"author":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"full_name":"Tomar, Anmol","last_name":"Tomar","first_name":"Anmol","id":"3D8D36B6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Singh","first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","full_name":"Singh, Vasu"},{"last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas"},{"last_name":"Zufferey","first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736"}],"day":"24","status":"public","title":"A marketplace for cloud resources","scopus_import":1,"date_published":"2010-10-24T00:00:00Z","month":"10","date_updated":"2021-01-12T07:56:32Z","publist_id":"1078","publisher":"ACM","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"conference":{"name":"CLOUD: Cloud Computing","end_date":"2010-07-10","start_date":"2010-07-05","location":"Miami, USA"},"doi":"10.1109/CLOUD.2010.71","citation":{"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:<a href=\"https://doi.org/10.1109/CLOUD.2010.71\">10.1109/CLOUD.2010.71</a>","mla":"Henzinger, Thomas A., et al. <i>FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment</i>. IEEE, 2010, pp. 83–90, doi:<a href=\"https://doi.org/10.1109/CLOUD.2010.71\">10.1109/CLOUD.2010.71</a>.","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.","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. <a href=\"https://doi.org/10.1109/CLOUD.2010.71\">https://doi.org/10.1109/CLOUD.2010.71</a>.","short":"T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, IEEE, 2010, pp. 83–90.","apa":"Henzinger, T. A., Tomar, A., Singh, V., Wies, T., &#38; Zufferey, D. (2010). FlexPRICE: Flexible provisioning of resources in a cloud environment (pp. 83–90). Presented at the CLOUD: Cloud Computing, Miami, USA: IEEE. <a href=\"https://doi.org/10.1109/CLOUD.2010.71\">https://doi.org/10.1109/CLOUD.2010.71</a>"},"quality_controlled":"1","has_accepted_license":"1","year":"2010","language":[{"iso":"eng"}],"page":"83 - 90","oa":1,"ddc":["004"],"abstract":[{"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.","lang":"eng"}],"file":[{"date_updated":"2020-07-14T12:46:28Z","creator":"system","checksum":"98e534675339a8e2beca08890d048145","file_size":467436,"file_name":"IST-2012-47-v1+1_FlexPRICE-_Flexible_provisioning_of_resources_in_a_cloud_environment.pdf","relation":"main_file","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:16:03Z","file_id":"5188"}],"author":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Anmol","id":"3D8D36B6-F248-11E8-B48F-1D18A9856A87","last_name":"Tomar","full_name":"Tomar, Anmol"},{"full_name":"Singh, Vasu","last_name":"Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu"},{"first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","last_name":"Wies","full_name":"Wies, Thomas"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","last_name":"Zufferey","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736"}],"department":[{"_id":"ToHe"}],"oa_version":"Submitted Version","pubrep_id":"47","date_created":"2018-12-11T12:08:33Z","type":"conference","_id":"4381","article_processing_charge":"No","file_date_updated":"2020-07-14T12:46:28Z","title":"FlexPRICE: Flexible provisioning of resources in a cloud environment","status":"public","day":"26","scopus_import":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","publisher":"IEEE","date_updated":"2021-01-12T07:56:33Z","publist_id":"1077","month":"08","date_published":"2010-08-26T00:00:00Z"},{"publisher":"ACM","publist_id":"1076","date_updated":"2021-01-12T07:56:33Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publication_status":"published","date_published":"2010-06-13T00:00:00Z","month":"06","file":[{"file_size":246409,"checksum":"f2ad6c00a6304da34bf21bcdcfd36c4b","creator":"system","date_updated":"2020-07-14T12:46:28Z","file_id":"5080","date_created":"2018-12-12T10:14:28Z","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2012-46-v1+1_Transactions_in_the_jungle.pdf","relation":"main_file"}],"ddc":["005"],"oa":1,"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."}],"page":"263 - 272","status":"public","has_accepted_license":"1","title":"Transactions in the jungle","language":[{"iso":"eng"}],"year":"2010","day":"13","conference":{"location":"Santorini, Greece","start_date":"2010-06-13","end_date":"2010-06-15","name":"SPAA: ACM Symposium on Parallel Algorithms and Architectures"},"department":[{"_id":"ToHe"}],"author":[{"full_name":"Guerraoui, Rachid","last_name":"Guerraoui","first_name":"Rachid"},{"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":"Kapalka, Michal","last_name":"Kapalka","first_name":"Michal"},{"last_name":"Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu","full_name":"Singh, Vasu"}],"type":"conference","_id":"4382","file_date_updated":"2020-07-14T12:46:28Z","doi":"10.1145/1810479.1810529","citation":{"chicago":"Guerraoui, Rachid, Thomas A Henzinger, Michal Kapalka, and Vasu Singh. “Transactions in the Jungle,” 263–72. ACM, 2010. <a href=\"https://doi.org/10.1145/1810479.1810529\">https://doi.org/10.1145/1810479.1810529</a>.","short":"R. Guerraoui, T.A. Henzinger, M. Kapalka, V. Singh, in:, ACM, 2010, pp. 263–272.","apa":"Guerraoui, R., Henzinger, T. A., Kapalka, M., &#38; Singh, V. (2010). Transactions in the jungle (pp. 263–272). Presented at the SPAA: ACM Symposium on Parallel Algorithms and Architectures, Santorini, Greece: ACM. <a href=\"https://doi.org/10.1145/1810479.1810529\">https://doi.org/10.1145/1810479.1810529</a>","mla":"Guerraoui, Rachid, et al. <i>Transactions in the Jungle</i>. ACM, 2010, pp. 263–72, doi:<a href=\"https://doi.org/10.1145/1810479.1810529\">10.1145/1810479.1810529</a>.","ista":"Guerraoui R, Henzinger TA, Kapalka M, Singh V. 2010. Transactions in the jungle. SPAA: ACM Symposium on Parallel Algorithms and Architectures, 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.","ama":"Guerraoui R, Henzinger TA, Kapalka M, Singh V. Transactions in the jungle. In: ACM; 2010:263-272. doi:<a href=\"https://doi.org/10.1145/1810479.1810529\">10.1145/1810479.1810529</a>"},"pubrep_id":"46","oa_version":"Submitted Version","date_created":"2018-12-11T12:08:34Z","quality_controlled":"1"},{"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"},{"full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"project":[{"call_identifier":"FP7","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","call_identifier":"FP7","grant_number":"214373"}],"oa_version":"Submitted Version","date_created":"2018-12-11T12:08:36Z","pubrep_id":"43","article_processing_charge":"No","_id":"4388","type":"conference","file_date_updated":"2020-07-14T12:46:28Z","title":"GIST: A solver for probabilistic games","volume":6174,"status":"public","day":"01","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","publisher":"Springer","publist_id":"1068","date_updated":"2023-02-23T12:24:17Z","date_published":"2010-07-01T00:00:00Z","month":"07","related_material":{"record":[{"status":"public","id":"5393","relation":"earlier_version"}]},"conference":{"name":"CAV: Computer Aided Verification","end_date":"2010-07-17","start_date":"2010-07-15","location":"Edinburgh, UK"},"doi":"10.1007/978-3-642-14295-6_57","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>GIST: A Solver for Probabilistic Games</i>. Vol. 6174, Springer, 2010, pp. 665–69, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">10.1007/978-3-642-14295-6_57</a>.","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.","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.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, in:, Springer, 2010, pp. 665–669.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. “GIST: A Solver for Probabilistic Games,” 6174:665–69. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">https://doi.org/10.1007/978-3-642-14295-6_57</a>.","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Radhakrishna, A. (2010). GIST: A solver for probabilistic games (Vol. 6174, pp. 665–669). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">https://doi.org/10.1007/978-3-642-14295-6_57</a>","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. GIST: A solver for probabilistic games. In: Vol 6174. Springer; 2010:665-669. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">10.1007/978-3-642-14295-6_57</a>"},"ec_funded":1,"quality_controlled":"1","has_accepted_license":"1","intvolume":"      6174","arxiv":1,"year":"2010","language":[{"iso":"eng"}],"page":"665 - 669","alternative_title":["LNCS"],"external_id":{"arxiv":["1004.2367"]},"oa":1,"ddc":["004"],"abstract":[{"lang":"eng","text":"GIST is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with ω-regular objectives; and (b) synthesizes reasonable environment assumptions for synthesis of unrealizable specifications. Our tool provides the first and efficient implementations of several reduction-based techniques to solve turn-based probabilistic games, and uses the analysis of turn-based probabilistic games for synthesizing environment assumptions for unrealizable specifications."}],"file":[{"date_updated":"2020-07-14T12:46:28Z","checksum":"0b2ef8c4037ffccc6902d93081af24f7","file_size":293605,"creator":"system","content_type":"application/pdf","file_name":"IST-2012-43-v1+1_GIST-_A_solver_for_probabilistic_games.pdf","relation":"main_file","file_id":"5221","date_created":"2018-12-12T10:16:33Z","access_level":"open_access"}]},{"file":[{"date_updated":"2020-07-14T12:46:28Z","creator":"system","checksum":"42b2952bfc6b6974617bd554842b904a","file_size":159920,"relation":"main_file","file_name":"IST-2012-44-v1+1_Robustness_of_sequential_circuits.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:09:10Z","access_level":"open_access","file_id":"4733"}],"ddc":["004"],"oa":1,"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"}],"page":"77 - 84","has_accepted_license":"1","language":[{"iso":"eng"}],"year":"2010","conference":{"name":"ACSD: Application of Concurrency to System Design"},"doi":"10.1109/ACSD.2010.26","citation":{"mla":"Doyen, Laurent, et al. <i>Robustness of Sequential Circuits</i>. IEEE, 2010, pp. 77–84, doi:<a href=\"https://doi.org/10.1109/ACSD.2010.26\">10.1109/ACSD.2010.26</a>.","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.","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. <a href=\"https://doi.org/10.1109/ACSD.2010.26\">https://doi.org/10.1109/ACSD.2010.26</a>.","short":"L. Doyen, T.A. Henzinger, A. Legay, D. Nickovic, in:, IEEE, 2010, pp. 77–84.","apa":"Doyen, L., Henzinger, T. A., Legay, A., &#38; Nickovic, D. (2010). Robustness of sequential circuits (pp. 77–84). Presented at the ACSD: Application of Concurrency to System Design, IEEE. <a href=\"https://doi.org/10.1109/ACSD.2010.26\">https://doi.org/10.1109/ACSD.2010.26</a>","ama":"Doyen L, Henzinger TA, Legay A, Nickovic D. Robustness of sequential circuits. In: IEEE; 2010:77-84. doi:<a href=\"https://doi.org/10.1109/ACSD.2010.26\">10.1109/ACSD.2010.26</a>"},"quality_controlled":"1","publisher":"IEEE","publist_id":"1069","date_updated":"2021-01-12T07:56:36Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publication_status":"published","date_published":"2010-08-23T00:00:00Z","month":"08","scopus_import":1,"status":"public","title":"Robustness of sequential circuits","day":"23","department":[{"_id":"ToHe"}],"author":[{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"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":"Legay, Axel","first_name":"Axel","last_name":"Legay"},{"full_name":"Nickovic, Dejan","first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic"}],"_id":"4389","type":"conference","file_date_updated":"2020-07-14T12:46:28Z","date_created":"2018-12-11T12:08:36Z","oa_version":"Submitted Version","pubrep_id":"44"},{"conference":{"name":"CAV: Computer Aided Verification","start_date":"2010-07-15","end_date":"2010-07-17","location":"Edinburgh, UK"},"related_material":{"record":[{"relation":"earlier_version","id":"5391","status":"public"}]},"quality_controlled":"1","citation":{"short":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, in:, Springer, 2010, 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. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">https://doi.org/10.1007/978-3-642-14295-6_41</a>.","apa":"Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., &#38; Alur, R. (2010). Model checking of linearizability of concurrent list implementations (Vol. 6174, pp. 465–479). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">https://doi.org/10.1007/978-3-642-14295-6_41</a>","mla":"Cerny, Pavol, et al. <i>Model Checking of Linearizability of Concurrent List Implementations</i>. Vol. 6174, Springer, 2010, pp. 465–79, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">10.1007/978-3-642-14295-6_41</a>.","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.","ieee":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, “Model checking of linearizability of concurrent list implementations,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 465–479.","ama":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. Model checking of linearizability of concurrent list implementations. In: Vol 6174. Springer; 2010:465-479. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">10.1007/978-3-642-14295-6_41</a>"},"doi":"10.1007/978-3-642-14295-6_41","intvolume":"      6174","has_accepted_license":"1","language":[{"iso":"eng"}],"year":"2010","page":"465 - 479","alternative_title":["LNCS"],"file":[{"access_level":"open_access","date_created":"2020-05-19T16:31:56Z","file_id":"7873","file_name":"2010_CAV_Cerny.pdf","relation":"main_file","content_type":"application/pdf","creator":"dernst","file_size":3633276,"checksum":"2eb211ce40b3c4988bce3a3592980704","date_updated":"2020-07-14T12:46:28Z"}],"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 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."}],"ddc":["000"],"oa":1,"department":[{"_id":"ToHe"}],"author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol"},{"last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","full_name":"Radhakrishna, Arjun"},{"last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien"},{"full_name":"Chaudhuri, Swarat","last_name":"Chaudhuri","first_name":"Swarat"},{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"}],"file_date_updated":"2020-07-14T12:46:28Z","_id":"4390","type":"conference","article_processing_charge":"No","oa_version":"Submitted Version","date_created":"2018-12-11T12:08:36Z","pubrep_id":"27","status":"public","volume":6174,"title":"Model checking of linearizability of concurrent list implementations","day":"01","publist_id":"1066","date_updated":"2023-02-23T12:24:12Z","publisher":"Springer","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2010-07-01T00:00:00Z","month":"07"},{"author":[{"last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","full_name":"Cerny, Pavol"},{"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":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","full_name":"Radhakrishna, Arjun"}],"department":[{"_id":"ToHe"}],"oa_version":"None","date_created":"2018-12-11T12:08:37Z","project":[{"grant_number":"215543","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques"},{"call_identifier":"FP7","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems"}],"publication":"Time For Verification: Essays in Memory of Amir Pnueli","_id":"4392","type":"book_chapter","title":"Quantitative Simulation Games","volume":6200,"status":"public","day":"29","series_title":"Essays in Memory of Amir Pnueli","scopus_import":1,"publication_status":"published","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:56:38Z","publist_id":"1064","publisher":"Springer","date_published":"2010-07-29T00:00:00Z","month":"07","ec_funded":1,"quality_controlled":"1","citation":{"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 <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, edited by Zohar Manna and Doron Peled, 6200:42–60. Essays in Memory of Amir Pnueli. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">https://doi.org/10.1007/978-3-642-13754-9_3</a>.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2010). Quantitative Simulation Games. In Z. Manna &#38; D. Peled (Eds.), <i>Time For Verification: Essays in Memory of Amir Pnueli</i> (Vol. 6200, pp. 42–60). Springer. <a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">https://doi.org/10.1007/978-3-642-13754-9_3</a>","mla":"Cerny, Pavol, et al. “Quantitative Simulation Games.” <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, edited by Zohar Manna and Doron Peled, vol. 6200, Springer, 2010, pp. 42–60, doi:<a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">10.1007/978-3-642-13754-9_3</a>.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative Simulation Games,” in <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, vol. 6200, Z. Manna and D. Peled, Eds. Springer, 2010, pp. 42–60.","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.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Quantitative Simulation Games. In: Manna Z, Peled D, eds. <i>Time For Verification: Essays in Memory of Amir Pnueli</i>. Vol 6200. Essays in Memory of Amir Pnueli. Springer; 2010:42-60. doi:<a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">10.1007/978-3-642-13754-9_3</a>"},"doi":"10.1007/978-3-642-13754-9_3","intvolume":"      6200","year":"2010","language":[{"iso":"eng"}],"page":"42 - 60","alternative_title":["LNCS"],"editor":[{"full_name":"Manna, Zohar","first_name":"Zohar","last_name":"Manna"},{"full_name":"Peled, Doron","first_name":"Doron","last_name":"Peled"}],"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. "}]},{"language":[{"iso":"eng"}],"year":"2010","intvolume":"      6269","has_accepted_license":"1","ec_funded":1,"quality_controlled":"1","citation":{"apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2010). Simulation distances (Vol. 6269, pp. 235–268). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">https://doi.org/10.1007/978-3-642-15375-4_18</a>","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances,” 6269:235–68. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">https://doi.org/10.1007/978-3-642-15375-4_18</a>.","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.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances. CONCUR: Concurrency Theory, LNCS, vol. 6269, 235–268.","mla":"Cerny, Pavol, et al. <i>Simulation Distances</i>. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–68, doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">10.1007/978-3-642-15375-4_18</a>.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Simulation distances. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:235-268. doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">10.1007/978-3-642-15375-4_18</a>"},"doi":"10.1007/978-3-642-15375-4_18","acknowledgement":"This work was partially supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","conference":{"start_date":"2010-08-31","end_date":"2010-09-03","location":"Paris, France","name":"CONCUR: Concurrency Theory"},"related_material":{"record":[{"id":"3249","status":"public","relation":"later_version"},{"id":"5389","status":"public","relation":"earlier_version"}]},"file":[{"access_level":"open_access","date_created":"2018-12-12T10:15:12Z","file_id":"5130","file_name":"IST-2012-42-v1+1_Simulation_distances.pdf","relation":"main_file","content_type":"application/pdf","creator":"system","checksum":"ea567903676ba8afe0507ee11313dce5","file_size":198913,"date_updated":"2020-07-14T12:46:28Z"}],"abstract":[{"text":"Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the implementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes.","lang":"eng"}],"ddc":["005"],"oa":1,"alternative_title":["LNCS"],"page":"235 - 268","day":"01","status":"public","title":"Simulation distances","volume":6269,"file_date_updated":"2020-07-14T12:46:28Z","type":"conference","_id":"4393","oa_version":"Submitted Version","pubrep_id":"42","date_created":"2018-12-11T12:08:37Z","project":[{"call_identifier":"FP7","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques"},{"grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems"}],"department":[{"_id":"ToHe"}],"author":[{"full_name":"Cerny, Pavol","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2010-11-01T00:00:00Z","month":"11","publist_id":"1065","date_updated":"2023-02-23T12:24:04Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":1},{"intvolume":"      6013","has_accepted_license":"1","language":[{"iso":"eng"}],"year":"2010","conference":{"location":"Paphos, Cyprus","start_date":"2010-03-20","end_date":"2010-03-28","name":"FASE: Fundamental Approaches To Software Engineering"},"quality_controlled":"1","doi":"10.1007/978-3-642-12029-9_19","citation":{"chicago":"Beyer, Dirk, Thomas A Henzinger, Grégory Théoduloz, and Damien Zufferey. “Shape Refinement through Explicit Heap Analysis.” edited by David Rosenblum and Gabriele Taenzer, 6013:263–77. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">https://doi.org/10.1007/978-3-642-12029-9_19</a>.","short":"D. Beyer, T.A. Henzinger, G. Théoduloz, D. Zufferey, in:, D. Rosenblum, G. Taenzer (Eds.), Springer, 2010, pp. 263–277.","apa":"Beyer, D., Henzinger, T. A., Théoduloz, G., &#38; Zufferey, D. (2010). Shape refinement through explicit heap analysis. In D. Rosenblum &#38; G. Taenzer (Eds.) (Vol. 6013, pp. 263–277). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">https://doi.org/10.1007/978-3-642-12029-9_19</a>","mla":"Beyer, Dirk, et al. <i>Shape Refinement through Explicit Heap Analysis</i>. Edited by David Rosenblum and Gabriele Taenzer, vol. 6013, Springer, 2010, pp. 263–77, doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">10.1007/978-3-642-12029-9_19</a>.","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.","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.","ama":"Beyer D, Henzinger TA, Théoduloz G, Zufferey D. Shape refinement through explicit heap analysis. In: Rosenblum D, Taenzer G, eds. Vol 6013. Springer; 2010:263-277. doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">10.1007/978-3-642-12029-9_19</a>"},"file":[{"date_updated":"2020-07-14T12:46:29Z","creator":"system","checksum":"7d26e59a9681487d7283eba337292b2c","file_size":312147,"relation":"main_file","file_name":"IST-2012-41-v1+1_Shape_refinement_through_explicit_heap_analysis.pdf","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:18:13Z","file_id":"5332"}],"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":1,"ddc":["004"],"page":"263 - 277","alternative_title":["LNCS"],"editor":[{"first_name":"David","last_name":"Rosenblum","full_name":"Rosenblum, David"},{"full_name":"Taenzer, Gabriele","first_name":"Gabriele","last_name":"Taenzer"}],"status":"public","title":"Shape refinement through explicit heap analysis","volume":6013,"day":"21","department":[{"_id":"ToHe"}],"author":[{"full_name":"Beyer, Dirk","first_name":"Dirk","last_name":"Beyer"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"last_name":"Théoduloz","first_name":"Grégory","full_name":"Théoduloz, Grégory"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","last_name":"Zufferey","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien"}],"file_date_updated":"2020-07-14T12:46:29Z","type":"conference","_id":"4396","date_created":"2018-12-11T12:08:38Z","oa_version":"Submitted Version","pubrep_id":"41","project":[{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"date_updated":"2021-01-12T07:56:40Z","publist_id":"1061","publisher":"Springer","publication_status":"published","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_published":"2010-04-21T00:00:00Z","month":"04","scopus_import":1},{"status":"public","intvolume":"        64","volume":64,"title":"A new model for extinction and recolonization in two dimensions: Quantifying phylogeography","language":[{"iso":"eng"}],"year":"2010","day":"01","department":[{"_id":"NiBa"}],"acknowledgement":"This work has made use of the resources provided by the Edinburgh Compute and Data Facility (ECDF). The ECDF is partially supported by the eDIKT initiative. NHB is supported in part by EPSRC Grant EP/E066070/1; JK is supported by EPSRC Grant EP/E066070/1; and AME is supported in part by EPSRC Grant EP/E065945/1.","author":[{"orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton"},{"full_name":"Kelleher, Jerome","last_name":"Kelleher","first_name":"Jerome"},{"full_name":"Etheridge, Alison","first_name":"Alison","last_name":"Etheridge"}],"issue":"9","_id":"474","type":"journal_article","publication":"Evolution","citation":{"ama":"Barton NH, Kelleher J, Etheridge A. A new model for extinction and recolonization in two dimensions: Quantifying phylogeography. <i>Evolution</i>. 2010;64(9):2701-2715. doi:<a href=\"https://doi.org/10.1111/j.1558-5646.2010.01019.x\">10.1111/j.1558-5646.2010.01019.x</a>","chicago":"Barton, Nicholas H, Jerome Kelleher, and Alison Etheridge. “A New Model for Extinction and Recolonization in Two Dimensions: Quantifying Phylogeography.” <i>Evolution</i>. Wiley-Blackwell, 2010. <a href=\"https://doi.org/10.1111/j.1558-5646.2010.01019.x\">https://doi.org/10.1111/j.1558-5646.2010.01019.x</a>.","short":"N.H. Barton, J. Kelleher, A. Etheridge, Evolution 64 (2010) 2701–2715.","apa":"Barton, N. H., Kelleher, J., &#38; Etheridge, A. (2010). A new model for extinction and recolonization in two dimensions: Quantifying phylogeography. <i>Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1558-5646.2010.01019.x\">https://doi.org/10.1111/j.1558-5646.2010.01019.x</a>","mla":"Barton, Nicholas H., et al. “A New Model for Extinction and Recolonization in Two Dimensions: Quantifying Phylogeography.” <i>Evolution</i>, vol. 64, no. 9, Wiley-Blackwell, 2010, pp. 2701–15, doi:<a href=\"https://doi.org/10.1111/j.1558-5646.2010.01019.x\">10.1111/j.1558-5646.2010.01019.x</a>.","ieee":"N. H. Barton, J. Kelleher, and A. Etheridge, “A new model for extinction and recolonization in two dimensions: Quantifying phylogeography,” <i>Evolution</i>, vol. 64, no. 9. Wiley-Blackwell, pp. 2701–2715, 2010.","ista":"Barton NH, Kelleher J, Etheridge A. 2010. A new model for extinction and recolonization in two dimensions: Quantifying phylogeography. Evolution. 64(9), 2701–2715."},"doi":"10.1111/j.1558-5646.2010.01019.x","date_created":"2018-12-11T11:46:40Z","quality_controlled":"1","oa_version":"None","publisher":"Wiley-Blackwell","publist_id":"2780","date_updated":"2021-01-12T08:00:52Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","date_published":"2010-09-01T00:00:00Z","month":"09","abstract":[{"text":"Classical models of gene flow fail in three ways: they cannot explain large-scale patterns; they predict much more genetic diversity than is observed; and they assume that loosely linked genetic loci evolve independently. We propose a new model that deals with these problems. Extinction events kill some fraction of individuals in a region. These are replaced by offspring from a small number of parents, drawn from the preexisting population. This model of evolution forwards in time corresponds to a backwards model, in which ancestral lineages jump to a new location if they are hit by an event, and may coalesce with other lineages that are hit by the same event. We derive an expression for the identity in allelic state, and show that, over scales much larger than the largest event, this converges to the classical value derived by Wright and Malécot. However, rare events that cover large areas cause low genetic diversity, large-scale patterns, and correlations in ancestry between unlinked loci.","lang":"eng"}],"scopus_import":1,"page":"2701 - 2715"},{"scopus_import":1,"date_published":"2010-01-01T00:00:00Z","month":"01","date_updated":"2021-01-12T08:01:00Z","publist_id":"7331","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:35Z","type":"conference","_id":"488","oa_version":"Published Version","date_created":"2018-12-11T11:46:45Z","pubrep_id":"948","department":[{"_id":"ToHe"}],"author":[{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"},{"full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"}],"day":"01","status":"public","title":"Expressiveness of streaming string transducers","tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"volume":8,"alternative_title":["LIPIcs"],"page":"1 - 12","file":[{"access_level":"open_access","date_created":"2018-12-12T10:08:29Z","file_id":"4690","file_name":"IST-2018-948-v1+1_2011_Cerny_Expressiveness_of.pdf","relation":"main_file","content_type":"application/pdf","creator":"system","file_size":492344,"checksum":"5845be5aa19791830f7407d8853f2df0","date_updated":"2020-07-14T12:46:35Z"}],"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 &quot;regular&quot; transductions for this case. Such regular transductions can be defined either by two-way deterministic finite-state transducers, or using a logical MSO-based characterization. Our main result is that the expressiveness of streaming string transducers coincides exactly with this class of regular transductions. "}],"ddc":["005"],"oa":1,"quality_controlled":"1","citation":{"mla":"Alur, Rajeev, and Pavol Cerny. <i>Expressiveness of Streaming String Transducers</i>. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">10.4230/LIPIcs.FSTTCS.2010.1</a>.","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.","ieee":"R. Alur and P. Cerny, “Expressiveness of streaming string transducers,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 1–12.","chicago":"Alur, Rajeev, and Pavol Cerny. “Expressiveness of Streaming String Transducers,” 8:1–12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1</a>.","short":"R. Alur, P. Cerny, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12.","apa":"Alur, R., &#38; Cerny, P. (2010). Expressiveness of streaming string transducers (Vol. 8, pp. 1–12). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1</a>","ama":"Alur R, Cerny P. Expressiveness of streaming string transducers. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:1-12. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">10.4230/LIPIcs.FSTTCS.2010.1</a>"},"doi":"10.4230/LIPIcs.FSTTCS.2010.1","conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","location":"Chennai, India","start_date":"2010-12-15","end_date":"2010-12-18"},"language":[{"iso":"eng"}],"year":"2010","intvolume":"         8","has_accepted_license":"1"},{"alternative_title":["EPTCS"],"page":"30 - 39","abstract":[{"lang":"eng","text":"Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represents a hostile environment. The evolution of the system depends on the decisions of both players, supplemented by chance. In this work, we focus on the notion of randomised strategy. More specifically, we show that three natural definitions may lead to very different results: in the most general cases, an almost-surely winning situation may become almost-surely losing if the player is only allowed to use a weaker notion of strategy. In more reasonable settings, translations exist, but they require infinite memory, even in simple cases. Finally, some traditional problems becomes undecidable for the strongest type of strategies."}],"oa":1,"conference":{"name":"GandALF: Games, Automata, Logic, and Formal Verification","location":"Minori, Amalfi Coast, Italy","start_date":"2010-06-17","end_date":"2010-06-18"},"quality_controlled":"1","doi":"10.4204/EPTCS.25.7","citation":{"apa":"Cristau, J., David, C., &#38; Horn, F. (2010). How do we remember the past in randomised strategies? . In <i>Proceedings of GandALF 2010</i> (Vol. 25, pp. 30–39). Minori, Amalfi Coast, Italy: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.25.7\">https://doi.org/10.4204/EPTCS.25.7</a>","chicago":"Cristau, Julien, Claire David, and Florian Horn. “How Do We Remember the Past in Randomised Strategies? .” In <i>Proceedings of GandALF 2010</i>, 25:30–39. Open Publishing Association, 2010. <a href=\"https://doi.org/10.4204/EPTCS.25.7\">https://doi.org/10.4204/EPTCS.25.7</a>.","short":"J. Cristau, C. David, F. Horn, in:, Proceedings of GandALF 2010, Open Publishing Association, 2010, pp. 30–39.","ista":"Cristau J, David C, Horn F. 2010. How do we remember the past in randomised strategies? . Proceedings of GandALF 2010. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 30–39.","ieee":"J. Cristau, C. David, and F. Horn, “How do we remember the past in randomised strategies? ,” in <i>Proceedings of GandALF 2010</i>, Minori, Amalfi Coast, Italy, 2010, vol. 25, pp. 30–39.","mla":"Cristau, Julien, et al. “How Do We Remember the Past in Randomised Strategies? .” <i>Proceedings of GandALF 2010</i>, vol. 25, Open Publishing Association, 2010, pp. 30–39, doi:<a href=\"https://doi.org/10.4204/EPTCS.25.7\">10.4204/EPTCS.25.7</a>.","ama":"Cristau J, David C, Horn F. How do we remember the past in randomised strategies? . In: <i>Proceedings of GandALF 2010</i>. Vol 25. Open Publishing Association; 2010:30-39. doi:<a href=\"https://doi.org/10.4204/EPTCS.25.7\">10.4204/EPTCS.25.7</a>"},"intvolume":"        25","language":[{"iso":"eng"}],"year":"2010","scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1006.1404v1","open_access":"1"}],"date_updated":"2021-01-12T08:01:01Z","publist_id":"7332","publisher":"Open Publishing Association","publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"06","date_published":"2010-06-09T00:00:00Z","department":[{"_id":"KrCh"}],"author":[{"first_name":"Julien","last_name":"Cristau","full_name":"Cristau, Julien"},{"last_name":"David","first_name":"Claire","full_name":"David, Claire"},{"first_name":"Florian","id":"37327ACE-F248-11E8-B48F-1D18A9856A87","last_name":"Horn","full_name":"Horn, Florian"}],"publication":"Proceedings of GandALF 2010","_id":"489","type":"conference","oa_version":"Published Version","date_created":"2018-12-11T11:46:45Z","status":"public","volume":25,"title":"How do we remember the past in randomised strategies? ","day":"09"},{"scopus_import":1,"page":"171 - 199","abstract":[{"text":"Any programming error that can be revealed before compiling a program saves precious time for the programmer. While integrated development environments already do a good job by detecting, e.g., data-flow abnormalities, current static analysis tools suffer from false positives (&quot;noise&quot;) or require strong user interaction. We propose to avoid this deficiency by defining a new class of errors. A program fragment is doomed if its execution will inevitably fail, regardless of which state it is started in. We use a formal verification method to identify such errors fully automatically and, most significantly, without producing noise. We report on experiments with a prototype tool.","lang":"eng"}],"month":"12","date_published":"2010-12-01T00:00:00Z","publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"7284","date_updated":"2021-01-12T08:01:28Z","publisher":"Springer","date_created":"2018-12-11T11:47:01Z","oa_version":"None","quality_controlled":"1","citation":{"ama":"Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. Doomed program points. <i>Formal Methods in System Design</i>. 2010;37(2-3):171-199. doi:<a href=\"https://doi.org/10.1007/s10703-010-0102-0\">10.1007/s10703-010-0102-0</a>","mla":"Hoenicke, Jochen, et al. “Doomed Program Points.” <i>Formal Methods in System Design</i>, vol. 37, no. 2–3, Springer, 2010, pp. 171–99, doi:<a href=\"https://doi.org/10.1007/s10703-010-0102-0\">10.1007/s10703-010-0102-0</a>.","ieee":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, and T. Wies, “Doomed program points,” <i>Formal Methods in System Design</i>, vol. 37, no. 2–3. Springer, pp. 171–199, 2010.","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.","chicago":"Hoenicke, Jochen, Kari Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “Doomed Program Points.” <i>Formal Methods in System Design</i>. Springer, 2010. <a href=\"https://doi.org/10.1007/s10703-010-0102-0\">https://doi.org/10.1007/s10703-010-0102-0</a>.","short":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, T. Wies, Formal Methods in System Design 37 (2010) 171–199.","apa":"Hoenicke, J., Leino, K., Podelski, A., Schäf, M., &#38; Wies, T. (2010). Doomed program points. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-010-0102-0\">https://doi.org/10.1007/s10703-010-0102-0</a>"},"doi":"10.1007/s10703-010-0102-0","publication":"Formal Methods in System Design","_id":"533","type":"journal_article","issue":"2-3","author":[{"full_name":"Hoenicke, Jochen","last_name":"Hoenicke","first_name":"Jochen"},{"last_name":"Leino","first_name":"Kari","full_name":"Leino, Kari"},{"first_name":"Andreas","last_name":"Podelski","full_name":"Podelski, Andreas"},{"full_name":"Schäf, Martin","last_name":"Schäf","first_name":"Martin"},{"last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","full_name":"Wies, Thomas"}],"department":[{"_id":"ToHe"}],"day":"01","year":"2010","language":[{"iso":"eng"}],"volume":37,"title":"Doomed program points","intvolume":"        37","status":"public"},{"file":[{"date_created":"2018-12-12T10:09:16Z","access_level":"open_access","file_id":"4739","relation":"main_file","file_name":"IST-2018-939-v1+1_2010_Kupczok_Accuracy_of.pdf","content_type":"application/pdf","creator":"system","checksum":"e2497285388bc4da629bafb46662eb43","file_size":723929,"date_updated":"2020-07-14T12:45:40Z"}],"abstract":[{"text":"Background: The availability of many gene alignments with overlapping taxon sets raises the question of which strategy is the best to infer species phylogenies from multiple gene information. Methods and programs abound that use the gene alignment in different ways to reconstruct the species tree. In particular, different methods combine the original data at different points along the way from the underlying sequences to the final tree. Accordingly, they are classified into superalignment, supertree and medium-level approaches. Here, we present a simulation study to compare different methods from each of these three approaches.\r\n\r\nResults: We observe that superalignment methods usually outperform the other approaches over a wide range of parameters including sparse data and gene-specific evolutionary parameters. In the presence of high incongruency among gene trees, however, other combination methods show better performance than the superalignment approach. Surprisingly, some supertree and medium-level methods exhibit, on average, worse results than a single gene phylogeny with complete taxon information.\r\n\r\nConclusions: For some methods, using the reconstructed gene tree as an estimation of the species tree is superior to the combination of incomplete information. Superalignment usually performs best since it is less susceptible to stochastic error. Supertree methods can outperform superalignment in the presence of gene-tree conflict.","lang":"eng"}],"oa":1,"ddc":["576"],"quality_controlled":"1","doi":"10.1186/1748-7188-5-37","citation":{"ama":"Kupczok A, Schmidt H, Von Haeseler A. Accuracy of phylogeny reconstruction methods combining overlapping gene data sets . <i>Algorithms for Molecular Biology</i>. 2010;5(1). doi:<a href=\"https://doi.org/10.1186/1748-7188-5-37\">10.1186/1748-7188-5-37</a>","ieee":"A. Kupczok, H. Schmidt, and A. Von Haeseler, “Accuracy of phylogeny reconstruction methods combining overlapping gene data sets ,” <i>Algorithms for Molecular Biology</i>, vol. 5, no. 1. BioMed Central, 2010.","ista":"Kupczok A, Schmidt H, Von Haeseler A. 2010. Accuracy of phylogeny reconstruction methods combining overlapping gene data sets . Algorithms for Molecular Biology. 5(1), 37.","mla":"Kupczok, Anne, et al. “Accuracy of Phylogeny Reconstruction Methods Combining Overlapping Gene Data Sets .” <i>Algorithms for Molecular Biology</i>, vol. 5, no. 1, 37, BioMed Central, 2010, doi:<a href=\"https://doi.org/10.1186/1748-7188-5-37\">10.1186/1748-7188-5-37</a>.","apa":"Kupczok, A., Schmidt, H., &#38; Von Haeseler, A. (2010). Accuracy of phylogeny reconstruction methods combining overlapping gene data sets . <i>Algorithms for Molecular Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1748-7188-5-37\">https://doi.org/10.1186/1748-7188-5-37</a>","short":"A. Kupczok, H. Schmidt, A. Von Haeseler, Algorithms for Molecular Biology 5 (2010).","chicago":"Kupczok, Anne, Heiko Schmidt, and Arndt Von Haeseler. “Accuracy of Phylogeny Reconstruction Methods Combining Overlapping Gene Data Sets .” <i>Algorithms for Molecular Biology</i>. BioMed Central, 2010. <a href=\"https://doi.org/10.1186/1748-7188-5-37\">https://doi.org/10.1186/1748-7188-5-37</a>."},"acknowledgement":"Financial support from the Wiener Wissenschafts-, Forschungs- and Technologiefonds (WWTF) is greatly appreciated. A.v.H. acknowledges support from the German Research Foundation (DFG, SPP-1174).","language":[{"iso":"eng"}],"year":"2010","intvolume":"         5","has_accepted_license":"1","scopus_import":1,"month":"12","date_published":"2010-12-06T00:00:00Z","date_updated":"2021-01-12T06:57:18Z","publist_id":"4517","publisher":"BioMed Central","publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication":"Algorithms for Molecular Biology","file_date_updated":"2020-07-14T12:45:40Z","_id":"2409","issue":"1","type":"journal_article","pubrep_id":"939","oa_version":"Published Version","date_created":"2018-12-11T11:57:30Z","department":[{"_id":"JoBo"}],"author":[{"first_name":"Anne","id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Kupczok","full_name":"Kupczok, Anne"},{"full_name":"Schmidt, Heiko","first_name":"Heiko","last_name":"Schmidt"},{"first_name":"Arndt","last_name":"Von Haeseler","full_name":"Von Haeseler, Arndt"}],"day":"06","status":"public","article_number":"37","volume":5,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"Accuracy of phylogeny reconstruction methods combining overlapping gene data sets "},{"ec_funded":1,"quality_controlled":"1","citation":{"mla":"Weissman, Daniel, et al. “The Rate of Fitness-Valley Crossing in Sexual Populations.” <i>Genetics</i>, vol. 186, no. 4, Genetics Society of America, 2010, pp. 1389–410, doi:<a href=\"https://doi.org/10.1534/genetics.110.123240\">10.1534/genetics.110.123240</a>.","ista":"Weissman D, Feldman M, Fisher D. 2010. The rate of fitness-valley crossing in sexual populations. Genetics. 186(4), 1389–1410.","ieee":"D. Weissman, M. Feldman, and D. Fisher, “The rate of fitness-valley crossing in sexual populations,” <i>Genetics</i>, vol. 186, no. 4. Genetics Society of America, pp. 1389–1410, 2010.","short":"D. Weissman, M. Feldman, D. Fisher, Genetics 186 (2010) 1389–1410.","chicago":"Weissman, Daniel, Marcus Feldman, and Daniel Fisher. “The Rate of Fitness-Valley Crossing in Sexual Populations.” <i>Genetics</i>. Genetics Society of America, 2010. <a href=\"https://doi.org/10.1534/genetics.110.123240\">https://doi.org/10.1534/genetics.110.123240</a>.","apa":"Weissman, D., Feldman, M., &#38; Fisher, D. (2010). The rate of fitness-valley crossing in sexual populations. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.110.123240\">https://doi.org/10.1534/genetics.110.123240</a>","ama":"Weissman D, Feldman M, Fisher D. The rate of fitness-valley crossing in sexual populations. <i>Genetics</i>. 2010;186(4):1389-1410. doi:<a href=\"https://doi.org/10.1534/genetics.110.123240\">10.1534/genetics.110.123240</a>"},"doi":"10.1534/genetics.110.123240","acknowledgement":"This work was supported in part by a Robert N. Noyce Stanford Graduate Fellowship and European Research Council grant 250152 (to D.B.W.) and by National Institutes of Health grant GM 28016 (to M.W.F.).\r\nWe thank Michael Desai for many ideas and discussions and are grateful to Joanna Masel and an anonymous reviewer for their helpful suggestions. ","year":"2010","language":[{"iso":"eng"}],"intvolume":"       186","page":"1389 - 1410","abstract":[{"text":"Biological traits result in part from interactions between different genetic loci. This can lead to sign epistasis, in which a beneficial adaptation involves a combination of individually deleterious or neutral mutations; in this case, a population must cross a “fitness valley” to adapt. Recombination can assist this process by combining mutations from different individuals or retard it by breaking up the adaptive combination. Here, we analyze the simplest fitness valley, in which an adaptation requires one mutation at each of two loci to provide a fitness benefit. We present a theoretical analysis of the effect of recombination on the valley-crossing process across the full spectrum of possible parameter regimes. We find that low recombination rates can speed up valley crossing relative to the asexual case, while higher recombination rates slow down valley crossing, with the transition between the two regimes occurring when the recombination rate between the loci is approximately equal to the selective advantage provided by the adaptation. In large populations, if the recombination rate is high and selection against single mutants is substantial, the time to cross the valley grows exponentially with population size, effectively meaning that the population cannot acquire the adaptation. Recombination at the optimal (low) rate can reduce the valley-crossing time by up to several orders of magnitude relative to that in an asexual population. ","lang":"eng"}],"oa":1,"date_created":"2018-12-11T12:02:33Z","oa_version":"Submitted Version","project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","call_identifier":"FP7"}],"publication":"Genetics","issue":"4","_id":"3303","type":"journal_article","author":[{"full_name":"Weissman, Daniel","last_name":"Weissman","first_name":"Daniel","id":"2D0CE020-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Feldman","first_name":"Marcus","full_name":"Feldman, Marcus"},{"last_name":"Fisher","first_name":"Daniel","full_name":"Fisher, Daniel"}],"department":[{"_id":"NiBa"}],"day":"01","title":"The rate of fitness-valley crossing in sexual populations","volume":186,"status":"public","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2998319/","open_access":"1"}],"scopus_import":1,"month":"12","date_published":"2010-12-01T00:00:00Z","publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"3337","date_updated":"2021-01-12T07:42:31Z","publisher":"Genetics Society of America"},{"page":"103-118","editor":[{"full_name":"Clarke, Edmund M","last_name":"Clarke","first_name":"Edmund M"},{"full_name":"Voronkov, Andrei","last_name":"Voronkov","first_name":"Andrei"}],"place":"Berlin, Heidelberg","abstract":[{"lang":"eng","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."}],"oa":1,"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).","conference":{"start_date":"2010-04-25","end_date":"2010-05-01","location":"Dakar, Senegal","name":"LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning"},"quality_controlled":"1","citation":{"mla":"Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.” <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, edited by Edmund M Clarke and Andrei Voronkov, vol. 6355, Springer Nature, 2010, pp. 103–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">10.1007/978-3-642-17511-4_7</a>.","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.","ieee":"R. Blanc, T. A. Henzinger, T. Hottelier, and L. Kovács, “ABC: Algebraic Bound Computation for loops,” in <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, Dakar, Senegal, 2010, vol. 6355, pp. 103–118.","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.","chicago":"Blanc, Régis, Thomas A Henzinger, Thibaud Hottelier, and Laura Kovács. “ABC: Algebraic Bound Computation for Loops.” In <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, edited by Edmund M Clarke and Andrei Voronkov, 6355:103–18. LNCS. Berlin, Heidelberg: Springer Nature, 2010. <a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">https://doi.org/10.1007/978-3-642-17511-4_7</a>.","apa":"Blanc, R., Henzinger, T. A., Hottelier, T., &#38; Kovács, L. (2010). ABC: Algebraic Bound Computation for loops. In E. M. Clarke &#38; A. Voronkov (Eds.), <i>Logic for Programming, Artificial Intelligence, and Reasoning</i> (Vol. 6355, pp. 103–118). Berlin, Heidelberg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">https://doi.org/10.1007/978-3-642-17511-4_7</a>","ama":"Blanc R, Henzinger TA, Hottelier T, Kovács L. ABC: Algebraic Bound Computation for loops. In: Clarke EM, Voronkov A, eds. <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>. Vol 6355. LNCS. Berlin, Heidelberg: Springer Nature; 2010:103-118. doi:<a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">10.1007/978-3-642-17511-4_7</a>"},"doi":"10.1007/978-3-642-17511-4_7","intvolume":"      6355","year":"2010","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783642175107"],"eisbn":["9783642175114"]},"scopus_import":"1","series_title":"LNCS","main_file_link":[{"open_access":"1","url":"https://infoscience.epfl.ch/record/186096"}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2022-06-13T07:44:21Z","publisher":"Springer Nature","date_published":"2010-05-01T00:00:00Z","month":"05","author":[{"full_name":"Blanc, Régis","first_name":"Régis","last_name":"Blanc"},{"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":"Hottelier, Thibaud","last_name":"Hottelier","first_name":"Thibaud"},{"last_name":"Kovács","first_name":"Laura","full_name":"Kovács, Laura"}],"department":[{"_id":"ToHe"}],"oa_version":"Submitted Version","date_created":"2022-03-21T08:14:35Z","publication":"Logic for Programming, Artificial Intelligence, and Reasoning","type":"conference","_id":"10908","article_processing_charge":"No","volume":6355,"title":"ABC: Algebraic Bound Computation for loops","status":"public","day":"01"}]