[{"day":"10","conference":{"name":"ELAG: European Library Automation Group"},"type":"other_academic_publication","main_file_link":[{"open_access":"1","url":"http://www.slideshare.net/PatrickD/open-bibliographic-data-elag2010"}],"file_date_updated":"2020-07-14T12:46:27Z","author":[{"full_name":"Danowski, Patrick","last_name":"Danowski","first_name":"Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6026-4409"}],"year":"2010","status":"public","publication":"European Library Automation Group (ELAG) 2010","title":"Open bibliographic data","citation":{"apa":"Danowski, P. (2010). <i>Open bibliographic data</i>. <i>European Library Automation Group (ELAG) 2010</i>. Elsevier.","ieee":"P. Danowski, <i>Open bibliographic data</i>. Elsevier, 2010.","chicago":"Danowski, Patrick. <i>Open Bibliographic Data</i>. <i>European Library Automation Group (ELAG) 2010</i>. Elsevier, 2010.","mla":"Danowski, Patrick. “Open Bibliographic Data.” <i>European Library Automation Group (ELAG) 2010</i>, Elsevier, 2010.","ama":"Danowski P. <i>Open Bibliographic Data</i>. Elsevier; 2010.","ista":"Danowski P. 2010. Open bibliographic data, Elsevier,p.","short":"P. Danowski, Open Bibliographic Data, Elsevier, 2010."},"ddc":["020"],"publisher":"Elsevier","publist_id":"1234","oa_version":"None","oa":1,"has_accepted_license":"1","_id":"4340","abstract":[{"text":"More and more libraries starting semantic web projects. The question about the license of the data\r\nis not discussed or the discussion is deferred to the end of project. in this paper is discussed why\r\nthe question of the license is so important in context of the semantic web that is should be one of the\r\nfirst aspects in a semantic web project. Also it will be shown why a public domain weaver is the\r\nonly solution that fulfill the the special requirements of the semantic web and that guaranties the\r\nreuseablitly of semantic library data for a sustainability of the projects. ","lang":"eng"}],"publication_status":"published","month":"06","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2020-07-14T23:07:19Z","extern":"1","file":[{"relation":"main_file","access_level":"open_access","checksum":"7061756135333d73b26a84526fa654f5","file_name":"IST-2012-51-v1+1_149-danowski-en.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:27Z","file_size":94982,"creator":"system","file_id":"5118","date_created":"2018-12-12T10:15:01Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_published":"2010-06-10T00:00:00Z","date_created":"2018-12-11T12:08:21Z"},{"publisher":"IFLA","citation":{"chicago":"Danowski, Patrick. “Step One: Blow up the Silo! - Open Bibliographic Data, the First Step towards Linked Open Data.” IFLA, 2010.","mla":"Danowski, Patrick. <i>Step One: Blow up the Silo! - Open Bibliographic Data, the First Step towards Linked Open Data</i>. IFLA, 2010.","apa":"Danowski, P. (2010). Step one: blow up the silo! - Open bibliographic data, the first step towards Linked Open Data. Presented at the WLIC: World Library and Information Congress, IFLA.","ieee":"P. Danowski, “Step one: blow up the silo! - Open bibliographic data, the first step towards Linked Open Data,” presented at the WLIC: World Library and Information Congress, 2010.","ama":"Danowski P. Step one: blow up the silo! - Open bibliographic data, the first step towards Linked Open Data. In: IFLA; 2010.","ista":"Danowski P. 2010. Step one: blow up the silo! - Open bibliographic data, the first step towards Linked Open Data. WLIC: World Library and Information Congress, IFLA , .","short":"P. Danowski, in:, IFLA, 2010."},"title":"Step one: blow up the silo! - Open bibliographic data, the first step towards Linked Open Data","status":"public","year":"2010","publist_id":"1233","type":"conference","conference":{"name":"WLIC: World Library and Information Congress"},"alternative_title":["IFLA "],"day":"01","author":[{"orcid":"0000-0002-6026-4409","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","full_name":"Patrick Danowski","first_name":"Patrick","last_name":"Danowski"}],"pubrep_id":"51","main_file_link":[{"url":"http://www.ifla.org/files/hq/papers/ifla76/149-danowski-en.pdf","open_access":"0"}],"extern":1,"date_updated":"2021-01-12T07:56:16Z","date_published":"2010-08-01T00:00:00Z","quality_controlled":0,"date_created":"2018-12-11T12:08:21Z","publication_status":"published","month":"08","abstract":[{"lang":"eng","text":"More and more libraries starting semantic web projects. The question about the license of the data is not discussed or the discussion is deferred to the end of project. in this paper is discussed why the question of the license is so important in context of the semantic web that is should be one of the first aspects in a semantic web project. Also it will be shown why a public domain weaver is the only solution that fulfill the the special requirements of the semantic web and that guaranties the reuseablitly of semantic library data for a sustainability of the projects."}],"_id":"4341"},{"editor":[{"orcid":"0000-0002-6026-4409","full_name":"Danowski, Patrick","last_name":"Danowski","first_name":"Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bergmann, Julia","first_name":"Julia","last_name":"Bergmann"}],"publication_status":"published","abstract":[{"lang":"eng","text":"With the term \"Library 2.0\" the editors mean an institution which applies the principles of the Web 2.0 such as openness, re-use, collaboration and interaction in the entire organization. Libraries are extending their service offerings and work processes to include the potential of Web 2.0 technologies. This changes the job description and self-image of librarians. The collective volume offers a complete overview of the topic Library 2.0 and the current state of developments from a technological, sociological, information theoretical and practice-oriented perspective."}],"volume":" 41","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2018-12-11T12:08:23Z","alternative_title":["Bibliotheks- und Informationspraxis"],"day":"01","department":[{"_id":"E-Lib"}],"citation":{"apa":"Danowski, P., &#38; Bergmann, J. (Eds.). (2010). <i>Handbuch Bibliothek 2.0</i> (Vol. 41). De Gruyter. <a href=\"https://doi.org/10.1515/9783110232103\">https://doi.org/10.1515/9783110232103</a>","ieee":"P. Danowski and J. Bergmann, Eds., <i>Handbuch Bibliothek 2.0</i>, vol. 41. De Gruyter, 2010.","mla":"Danowski, Patrick, and Julia Bergmann, editors. <i>Handbuch Bibliothek 2.0</i>. Vol. 41, De Gruyter, 2010, doi:<a href=\"https://doi.org/10.1515/9783110232103\">10.1515/9783110232103</a>.","chicago":"Danowski, Patrick, and Julia Bergmann, eds. <i>Handbuch Bibliothek 2.0</i>. Vol. 41. Bibliothekspraxis. De Gruyter, 2010. <a href=\"https://doi.org/10.1515/9783110232103\">https://doi.org/10.1515/9783110232103</a>.","short":"P. Danowski, J. Bergmann, eds., Handbuch Bibliothek 2.0, De Gruyter, 2010.","ama":"Danowski P, Bergmann J, eds. <i>Handbuch Bibliothek 2.0</i>. Vol 41. De Gruyter; 2010. doi:<a href=\"https://doi.org/10.1515/9783110232103\">10.1515/9783110232103</a>","ista":"Danowski P, Bergmann J eds. 2010. Handbuch Bibliothek 2.0, De Gruyter, 405p."},"oa":1,"_id":"4346","article_processing_charge":"No","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"month":"09","publication_identifier":{"eisbn":["9-783-1102-3210-3"],"isbn":["9-783-1102-3209-7"]},"date_updated":"2021-12-22T14:41:57Z","series_title":"Bibliothekspraxis","page":"405","language":[{"iso":"ger"}],"date_published":"2010-09-01T00:00:00Z","quality_controlled":"1","type":"book_editor","main_file_link":[{"url":"https://www.degruyter.com/document/doi/10.1515/9783110232103/html","open_access":"1"}],"year":"2010","title":"Handbuch Bibliothek 2.0","status":"public","publisher":"De Gruyter","doi":"10.1515/9783110232103","oa_version":"Published Version","publist_id":"1228"},{"extern":1,"page":"454 - 466","date_updated":"2021-01-12T07:56:23Z","date_published":"2010-06-09T00:00:00Z","date_created":"2018-12-11T12:08:27Z","quality_controlled":0,"volume":2,"intvolume":"         2","month":"06","publication_status":"published","abstract":[{"text":"Phenotypic biotyping has traditionally been used to differentiate bacteria occupying distinct ecological niches such as host species. For example, the capacity of Staphylococcus aureus from sheep to coagulate ruminant plasma, reported over 60 years ago, led to the description of small ruminant and bovine S. aureus ecovars. The great majority of small ruminant isolates are represented by a single, widespread clonal complex (CC133) of S. aureus, but its evolutionary origin and the molecular basis for its host tropism remain unknown. Here, we provide evidence that the CC133 clone evolved as the result of a human to ruminant host jump followed by adaptive genome diversification. Comparative whole-genome sequencing revealed molecular evidence for host adaptation including gene decay and diversification of proteins involved in host-pathogen interactions. Importantly, several novel mobile genetic elements encoding virulence proteins with attenuated or enhanced activity in ruminants were widely distributed in CC133 isolates, suggesting a key role in its host-specific interactions. To investigate this further, we examined the activity of a novel staphylococcal pathogenicity island (SaPIov2) found in the great majority of CC133 isolates which encodes a variant of the chromosomally encoded von Willebrand-binding protein (vWbp(Sov2)), previously demonstrated to have coagulase activity for human plasma. Remarkably, we discovered that SaPIov2 confers the ability to coagulate ruminant plasma suggesting an important role in ruminant disease pathogenesis and revealing the origin of a defining phenotype of the classical S. aureus biotyping scheme. Taken together, these data provide broad new insights into the origin and molecular basis of S. aureus ruminant host specificity.","lang":"eng"}],"_id":"4358","doi":"10.1093/gbe/evq031","citation":{"short":"C. Guinane, N. Ben Zakour, M. Tormo Mas, L. Weinert, B. Lowder, R. Cartwright, D. Smyth, C. Smyth, J. Lindsay, K. Gould, A. Witney, J. Hinds, J.P. Bollback, A. Rambaut, J. Penades, J.R. Fitzgerald, Genome Biology and Evolution 2 (2010) 454–466.","ista":"Guinane C, Ben Zakour N, Tormo Mas M, Weinert L, Lowder B, Cartwright R, Smyth D, Smyth C, Lindsay J, Gould K, Witney A, Hinds J, Bollback JP, Rambaut A, Penades J, Fitzgerald JR. 2010. Evolutionary genomics of Staphylococcus aureus reveals insights into the origin and molecular basis of ruminant host adaptation. Genome Biology and Evolution. 2, 454–466.","ama":"Guinane C, Ben Zakour N, Tormo Mas M, et al. Evolutionary genomics of Staphylococcus aureus reveals insights into the origin and molecular basis of ruminant host adaptation. <i>Genome Biology and Evolution</i>. 2010;2:454-466. doi:<a href=\"https://doi.org/10.1093/gbe/evq031\">10.1093/gbe/evq031</a>","mla":"Guinane, Caitriona, et al. “Evolutionary Genomics of Staphylococcus Aureus Reveals Insights into the Origin and Molecular Basis of Ruminant Host Adaptation.” <i>Genome Biology and Evolution</i>, vol. 2, Oxford University Press, 2010, pp. 454–66, doi:<a href=\"https://doi.org/10.1093/gbe/evq031\">10.1093/gbe/evq031</a>.","chicago":"Guinane, Caitriona, Nouri Ben Zakour, Maria Tormo Mas, Lucy Weinert, Bethan Lowder, Robyn Cartwright, Davida Smyth, et al. “Evolutionary Genomics of Staphylococcus Aureus Reveals Insights into the Origin and Molecular Basis of Ruminant Host Adaptation.” <i>Genome Biology and Evolution</i>. Oxford University Press, 2010. <a href=\"https://doi.org/10.1093/gbe/evq031\">https://doi.org/10.1093/gbe/evq031</a>.","ieee":"C. Guinane <i>et al.</i>, “Evolutionary genomics of Staphylococcus aureus reveals insights into the origin and molecular basis of ruminant host adaptation,” <i>Genome Biology and Evolution</i>, vol. 2. Oxford University Press, pp. 454–466, 2010.","apa":"Guinane, C., Ben Zakour, N., Tormo Mas, M., Weinert, L., Lowder, B., Cartwright, R., … Fitzgerald, J. R. (2010). Evolutionary genomics of Staphylococcus aureus reveals insights into the origin and molecular basis of ruminant host adaptation. <i>Genome Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/gbe/evq031\">https://doi.org/10.1093/gbe/evq031</a>"},"publisher":"Oxford University Press","year":"2010","status":"public","publication":"Genome Biology and Evolution","title":"Evolutionary genomics of Staphylococcus aureus reveals insights into the origin and molecular basis of ruminant host adaptation","publist_id":"1100","type":"journal_article","day":"09","author":[{"full_name":"Guinane, Caitriona M","last_name":"Guinane","first_name":"Caitriona"},{"full_name":"Ben Zakour, Nouri L","first_name":"Nouri","last_name":"Ben Zakour"},{"last_name":"Tormo Mas","first_name":"Maria","full_name":"Tormo-Mas, Maria A"},{"first_name":"Lucy","last_name":"Weinert","full_name":"Weinert, Lucy A"},{"full_name":"Lowder, Bethan V","last_name":"Lowder","first_name":"Bethan"},{"full_name":"Cartwright, Robyn A","last_name":"Cartwright","first_name":"Robyn"},{"full_name":"Smyth, Davida S","first_name":"Davida","last_name":"Smyth"},{"first_name":"Cyril","last_name":"Smyth","full_name":"Smyth, Cyril J"},{"first_name":"Jodi","last_name":"Lindsay","full_name":"Lindsay, Jodi A"},{"full_name":"Gould, Katherine A","first_name":"Katherine","last_name":"Gould"},{"full_name":"Witney, Adam","last_name":"Witney","first_name":"Adam"},{"first_name":"Jason","last_name":"Hinds","full_name":"Hinds, Jason"},{"orcid":"0000-0002-4624-4612","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","first_name":"Jonathan P","last_name":"Bollback","full_name":"Jonathan Bollback"},{"full_name":"Rambaut, Andrew","first_name":"Andrew","last_name":"Rambaut"},{"full_name":"Penades, Jose R","first_name":"Jose","last_name":"Penades"},{"first_name":"J Ross","last_name":"Fitzgerald","full_name":"Fitzgerald, J Ross"}]},{"_id":"4361","month":"03","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2010-03-01T00:00:00Z","date_updated":"2023-09-07T11:36:36Z","page":"94 - 108","file":[{"checksum":"3e610de84937d821316362658239134a","relation":"main_file","access_level":"open_access","file_name":"IST-2012-50-v1+1_Forward_analysis_of_depth-bounded_processes.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:27Z","file_size":240766,"file_id":"4677","creator":"system","date_created":"2018-12-12T10:08:17Z"}],"file_date_updated":"2020-07-14T12:46:27Z","author":[{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","last_name":"Wies","first_name":"Thomas","full_name":"Wies, Thomas"},{"orcid":"0000-0002-3197-8736","last_name":"Zufferey","first_name":"Damien","full_name":"Zufferey, Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"}],"type":"conference","conference":{"location":"Paphos, Cyprus","start_date":"2010-03-20","end_date":"2010-03-28","name":"FoSSaCS: Foundations of Software Science and Computation Structures"},"has_accepted_license":"1","publist_id":"1099","oa_version":"Submitted Version","year":"2010","status":"public","title":"Forward analysis of depth-bounded processes","doi":"10.1007/978-3-642-12032-9_8","ddc":["004"],"publisher":"Springer","publication_status":"published","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"}],"editor":[{"first_name":"Luke","last_name":"Ong","full_name":"Ong, Luke"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","volume":6014,"intvolume":"      6014","date_created":"2018-12-11T12:08:27Z","related_material":{"record":[{"id":"1405","relation":"dissertation_contains","status":"public"}]},"pubrep_id":"50","alternative_title":["LNCS"],"day":"01","scopus_import":1,"oa":1,"citation":{"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>.","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>.","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.","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>","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.","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>","short":"T. Wies, D. Zufferey, T.A. Henzinger, in:, L. Ong (Ed.), Springer, 2010, pp. 94–108."},"department":[{"_id":"ToHe"}]},{"scopus_import":1,"day":"01","alternative_title":["LNCS"],"conference":{"start_date":"2010-11-01","name":"RV: International Conference on Runtime Verification","end_date":"2010-11-04","location":"St. Julians, Malta"},"type":"conference","author":[{"full_name":"Singh, Vasu","last_name":"Singh","first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"}],"title":"Runtime verification for software transactional memories","status":"public","year":"2010","doi":"10.1007/978-3-642-16612-9_32","department":[{"_id":"ToHe"}],"citation":{"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.","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>","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>.","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>.","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.","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>"},"publisher":"Springer","oa_version":"None","publist_id":"1096","_id":"4362","publication_status":"published","month":"01","editor":[{"full_name":"Sokolsky, Oleg","last_name":"Sokolsky","first_name":"Oleg"},{"first_name":"Grigore","last_name":"Rosu","full_name":"Rosu, Grigore"},{"last_name":"Tilmann","first_name":"Nikolai","full_name":"Tilmann, Nikolai"},{"last_name":"Barringer","first_name":"Howard","full_name":"Barringer, Howard"},{"full_name":"Falcone, Ylies","last_name":"Falcone","first_name":"Ylies"},{"first_name":"Bernd","last_name":"Finkbeiner","full_name":"Finkbeiner, Bernd"},{"last_name":"Havelund","first_name":"Klaus","full_name":"Havelund, Klaus"},{"last_name":"Lee","first_name":"Insup","full_name":"Lee, Insup"},{"full_name":"Pace, Gordon","last_name":"Pace","first_name":"Gordon"}],"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."}],"date_updated":"2021-01-12T07:56:25Z","page":"421 - 435","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","volume":6418,"intvolume":"      6418","language":[{"iso":"eng"}],"date_published":"2010-01-01T00:00:00Z","quality_controlled":"1","date_created":"2018-12-11T12:08:28Z"},{"quality_controlled":0,"date_created":"2018-12-11T12:08:28Z","date_published":"2010-01-01T00:00:00Z","extern":1,"page":"249 - 260","date_updated":"2021-01-12T07:56:26Z","month":"01","publication_status":"published","_id":"4364","publist_id":"1093","doi":"10.1145/1707801.1706330","citation":{"short":"A. Podelski, T. Wies, in:, ACM, 2010, pp. 249–260.","ama":"Podelski A, Wies T. Counterexample-guided focus. In: ACM; 2010:249-260. doi:<a href=\"https://doi.org/10.1145/1707801.1706330\">10.1145/1707801.1706330</a>","ista":"Podelski A, Wies T. 2010. Counterexample-guided focus. POPL: Principles of Programming Languages, 249–260.","apa":"Podelski, A., &#38; Wies, T. (2010). Counterexample-guided focus (pp. 249–260). Presented at the POPL: Principles of Programming Languages, ACM. <a href=\"https://doi.org/10.1145/1707801.1706330\">https://doi.org/10.1145/1707801.1706330</a>","ieee":"A. Podelski and T. Wies, “Counterexample-guided focus,” presented at the POPL: Principles of Programming Languages, 2010, pp. 249–260.","mla":"Podelski, Andreas, and Thomas Wies. <i>Counterexample-Guided Focus</i>. ACM, 2010, pp. 249–60, doi:<a href=\"https://doi.org/10.1145/1707801.1706330\">10.1145/1707801.1706330</a>.","chicago":"Podelski, Andreas, and Thomas Wies. “Counterexample-Guided Focus,” 249–60. ACM, 2010. <a href=\"https://doi.org/10.1145/1707801.1706330\">https://doi.org/10.1145/1707801.1706330</a>."},"publisher":"ACM","title":"Counterexample-guided focus","year":"2010","status":"public","author":[{"last_name":"Podelski","first_name":"Andreas","full_name":"Podelski,Andreas"},{"last_name":"Wies","first_name":"Thomas","full_name":"Thomas Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"}],"type":"conference","conference":{"name":"POPL: Principles of Programming Languages"},"day":"01"},{"alternative_title":["LNCS"],"day":"08","scopus_import":1,"pubrep_id":"49","citation":{"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>","short":"D. Nickovic, N. Piterman, in:, T.A. Henzinger, K. Chatterjee (Eds.), Springer, 2010, pp. 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. <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>.","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>","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."},"department":[{"_id":"ToHe"}],"ec_funded":1,"oa":1,"publication_status":"published","editor":[{"full_name":"Henzinger, Thomas A.","last_name":"Henzinger","first_name":"Thomas A."},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"}],"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."}],"project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"},{"call_identifier":"FP7","grant_number":"214373","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T12:08:30Z","intvolume":"      6246","volume":6246,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems","end_date":"2010-09-10","start_date":"2010-09-08","location":"Klosterneuburg, Austria"},"type":"conference","author":[{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan","last_name":"Nickovic","full_name":"Nickovic, Dejan"},{"full_name":"Piterman, Nir","first_name":"Nir","last_name":"Piterman"}],"file_date_updated":"2020-07-14T12:46:27Z","publisher":"Springer","ddc":["004"],"doi":"10.1007/978-3-642-15297-9_13","status":"public","title":"From MTL to deterministic timed automata","year":"2010","oa_version":"Submitted Version","publist_id":"1090","has_accepted_license":"1","month":"09","_id":"4369","file":[{"file_size":249789,"date_updated":"2020-07-14T12:46:27Z","date_created":"2018-12-12T10:13:43Z","file_id":"5028","creator":"system","file_name":"IST-2012-49-v1+1_From_MTL_to_deterministic_timed_automata.pdf","access_level":"open_access","checksum":"b0ca5f5fbe8a3d20ccbc6f51a344a459","relation":"main_file","content_type":"application/pdf"}],"page":"152 - 167","date_updated":"2021-01-12T07:56:27Z","date_published":"2010-09-08T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}]},{"citation":{"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.","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>","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>.","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>.","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>","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."},"department":[{"_id":"ToHe"}],"oa":1,"scopus_import":1,"alternative_title":["LNCS"],"day":"01","volume":5944,"intvolume":"      5944","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:08:33Z","abstract":[{"lang":"eng","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."}],"publication_status":"published","editor":[{"full_name":"Barthe, Gilles","first_name":"Gilles","last_name":"Barthe"},{"full_name":"Hermenegildo, Manuel","last_name":"Hermenegildo","first_name":"Manuel"}],"title":"Building a calculus of data structures","status":"public","year":"2010","publisher":"Springer","doi":"10.1007/978-3-642-11319-2_6","publist_id":"1081","oa_version":"Submitted Version","type":"conference","conference":{"location":"Madrid, Spain","end_date":"2010-01-19","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","start_date":"2010-01-17"},"main_file_link":[{"url":"https://infoscience.epfl.ch/record/161290/","open_access":"1"}],"author":[{"full_name":"Kuncak, Viktor","first_name":"Viktor","last_name":"Kuncak"},{"last_name":"Piskac","first_name":"Ruzica","full_name":"Piskac, Ruzica"},{"last_name":"Suter","first_name":"Philippe","full_name":"Suter, Philippe"},{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas","last_name":"Wies","first_name":"Thomas"}],"date_updated":"2021-01-12T07:56:31Z","page":"26 - 44","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2010-01-01T00:00:00Z","_id":"4378","month":"01"},{"acknowledgement":"We would like to thank Tom Giovannini from Rambus, Inc. for his detailed explana- tions of the DDR2 specification and for providing us with simulation traces. We would also like to thank Oded Maler from Verimag for discussions on the STL/PSL language and its extensions.","status":"public","publication":"Formal Methods in System Design","year":"2010","title":"Analog property checkers: a DDR2 case study","citation":{"ista":"Jones K, Konrad V, Nickovic D. 2010. Analog property checkers: a DDR2 case study. Formal Methods in System Design. 36(2), 114–130.","ama":"Jones K, Konrad V, Nickovic D. Analog property checkers: a DDR2 case study. <i>Formal Methods in System Design</i>. 2010;36(2):114-130. doi:<a href=\"https://doi.org/10.1007/s10703-009-0085-x\">10.1007/s10703-009-0085-x</a>","short":"K. Jones, V. Konrad, D. Nickovic, Formal Methods in System Design 36 (2010) 114–130.","apa":"Jones, K., Konrad, V., &#38; Nickovic, D. (2010). Analog property checkers: a DDR2 case study. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-009-0085-x\">https://doi.org/10.1007/s10703-009-0085-x</a>","ieee":"K. Jones, V. Konrad, and D. Nickovic, “Analog property checkers: a DDR2 case study,” <i>Formal Methods in System Design</i>, vol. 36, no. 2. Springer, pp. 114–130, 2010.","chicago":"Jones, Kevin, Victor Konrad, and Dejan Nickovic. “Analog Property Checkers: A DDR2 Case Study.” <i>Formal Methods in System Design</i>. Springer, 2010. <a href=\"https://doi.org/10.1007/s10703-009-0085-x\">https://doi.org/10.1007/s10703-009-0085-x</a>.","mla":"Jones, Kevin, et al. “Analog Property Checkers: A DDR2 Case Study.” <i>Formal Methods in System Design</i>, vol. 36, no. 2, Springer, 2010, pp. 114–30, doi:<a href=\"https://doi.org/10.1007/s10703-009-0085-x\">10.1007/s10703-009-0085-x</a>."},"doi":"10.1007/s10703-009-0085-x","publisher":"Springer","publist_id":"1080","oa":1,"day":"01","type":"journal_article","main_file_link":[{"url":"http://openaccess.city.ac.uk/1066/","open_access":"1"}],"author":[{"full_name":"Jones, Kevin D","first_name":"Kevin","last_name":"Jones"},{"full_name":"Konrad,Victor","first_name":"Victor","last_name":"Konrad"},{"full_name":"Dejan Nickovic","last_name":"Nickovic","first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2021-01-12T07:56:31Z","page":"114 - 130","issue":"2","extern":1,"volume":36,"intvolume":"        36","quality_controlled":0,"date_created":"2018-12-11T12:08:33Z","date_published":"2010-06-01T00:00:00Z","_id":"4379","month":"06","publication_status":"published","abstract":[{"lang":"eng","text":"The formal specification component of verification can be exported to simulation through the idea of property checkers. The essence of this approach is the automatic construction of an observer from the specification in the form of a program that can be interfaced with a simulator and alert the user if the property is violated by a simulation trace. Although not complete, this lighter approach to formal verification has been effectively used in software and digital hardware to detect errors. Recently, the idea of property checkers has been extended to analog and mixed-signal systems.\n\nIn this paper, we apply the property-based checking methodology to an industrial and realistic example of a DDR2 memory interface. The properties describing the DDR2 analog behavior are expressed in the formal specification language stl/psl in form of assertions. The simulation traces generated from an actual DDR2 interface design are checked with respect to the stl/psl assertions using the amt tool. The focus of this paper is on the translation of the official (informal and descriptive) specification of two non-trivial DDR2 properties into stl/psl assertions. We study both the benefits and the current limits of such approach.\n"}]},{"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."}],"publication_status":"published","date_created":"2018-12-11T12:08:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"day":"24","pubrep_id":"48","citation":{"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.","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>","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>.","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.","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."},"department":[{"_id":"ToHe"}],"oa":1,"month":"10","_id":"4380","page":"1 - 8","file":[{"date_created":"2018-12-12T10:09:42Z","creator":"system","file_id":"4767","file_size":222626,"date_updated":"2020-07-14T12:46:28Z","content_type":"application/pdf","file_name":"IST-2012-48-v1+1_A_marketplace_for_cloud_resources.pdf","checksum":"7680dd24016810710f7c977bc94f85e9","access_level":"open_access","relation":"main_file"}],"date_updated":"2021-01-12T07:56:32Z","date_published":"2010-10-24T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"conference":{"name":"EMSOFT: Embedded Software ","end_date":"2010-10-29","start_date":"2010-10-24","location":"Arizona, USA"},"type":"conference","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"id":"3D8D36B6-F248-11E8-B48F-1D18A9856A87","full_name":"Tomar, Anmol","last_name":"Tomar","first_name":"Anmol"},{"full_name":"Singh, Vasu","first_name":"Vasu","last_name":"Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"},{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas","first_name":"Thomas","last_name":"Wies"},{"full_name":"Zufferey, Damien","first_name":"Damien","last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736"}],"file_date_updated":"2020-07-14T12:46:28Z","doi":"10.1145/1879021.1879022","publisher":"ACM","ddc":["005"],"title":"A marketplace for cloud resources","year":"2010","status":"public","oa_version":"Submitted Version","has_accepted_license":"1","publist_id":"1078"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:08:33Z","publication_status":"published","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"}],"department":[{"_id":"ToHe"}],"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.","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>","short":"T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, IEEE, 2010, pp. 83–90.","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.","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>","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>.","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>."},"oa":1,"day":"26","scopus_import":1,"pubrep_id":"47","date_updated":"2021-01-12T07:56:33Z","page":"83 - 90","file":[{"content_type":"application/pdf","access_level":"open_access","checksum":"98e534675339a8e2beca08890d048145","relation":"main_file","file_name":"IST-2012-47-v1+1_FlexPRICE-_Flexible_provisioning_of_resources_in_a_cloud_environment.pdf","file_id":"5188","creator":"system","date_created":"2018-12-12T10:16:03Z","date_updated":"2020-07-14T12:46:28Z","file_size":467436}],"language":[{"iso":"eng"}],"date_published":"2010-08-26T00:00:00Z","quality_controlled":"1","_id":"4381","month":"08","article_processing_charge":"No","title":"FlexPRICE: Flexible provisioning of resources in a cloud environment","status":"public","year":"2010","doi":"10.1109/CLOUD.2010.71","publisher":"IEEE","ddc":["004"],"publist_id":"1077","has_accepted_license":"1","oa_version":"Submitted Version","type":"conference","conference":{"location":"Miami, USA","start_date":"2010-07-05","name":"CLOUD: Cloud Computing","end_date":"2010-07-10"},"file_date_updated":"2020-07-14T12:46:28Z","author":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"3D8D36B6-F248-11E8-B48F-1D18A9856A87","full_name":"Tomar, Anmol","first_name":"Anmol","last_name":"Tomar"},{"id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","full_name":"Singh, Vasu","first_name":"Vasu","last_name":"Singh"},{"last_name":"Wies","first_name":"Thomas","full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zufferey, Damien","first_name":"Damien","last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736"}]},{"publication_status":"published","month":"06","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."}],"_id":"4382","quality_controlled":"1","date_created":"2018-12-11T12:08:34Z","date_published":"2010-06-13T00:00:00Z","language":[{"iso":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"file_size":246409,"date_updated":"2020-07-14T12:46:28Z","date_created":"2018-12-12T10:14:28Z","creator":"system","file_id":"5080","file_name":"IST-2012-46-v1+1_Transactions_in_the_jungle.pdf","relation":"main_file","checksum":"f2ad6c00a6304da34bf21bcdcfd36c4b","access_level":"open_access","content_type":"application/pdf"}],"page":"263 - 272","date_updated":"2021-01-12T07:56:33Z","author":[{"last_name":"Guerraoui","first_name":"Rachid","full_name":"Guerraoui, Rachid"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Kapalka, Michal","first_name":"Michal","last_name":"Kapalka"},{"full_name":"Singh, Vasu","first_name":"Vasu","last_name":"Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"}],"pubrep_id":"46","file_date_updated":"2020-07-14T12:46:28Z","type":"conference","conference":{"end_date":"2010-06-15","name":"SPAA: ACM Symposium on Parallel Algorithms and Architectures","start_date":"2010-06-13","location":"Santorini, Greece"},"day":"13","oa_version":"Submitted Version","publist_id":"1076","has_accepted_license":"1","oa":1,"ddc":["005"],"publisher":"ACM","doi":"10.1145/1810479.1810529","department":[{"_id":"ToHe"}],"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.","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>","short":"R. Guerraoui, T.A. Henzinger, M. Kapalka, V. Singh, in:, ACM, 2010, pp. 263–272.","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>.","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>.","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>","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."},"title":"Transactions in the jungle","year":"2010","status":"public"},{"intvolume":"      6174","volume":6174,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:08:36Z","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"}],"publication_status":"published","project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems"}],"arxiv":1,"citation":{"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>","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, “GIST: A solver for probabilistic games,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 665–669.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. “GIST: A Solver for Probabilistic Games,” 6174:665–69. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">https://doi.org/10.1007/978-3-642-14295-6_57</a>.","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>.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2010. GIST: A solver for probabilistic games. CAV: Computer Aided Verification, LNCS, vol. 6174, 665–669.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. GIST: A solver for probabilistic games. In: Vol 6174. Springer; 2010:665-669. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">10.1007/978-3-642-14295-6_57</a>","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, in:, Springer, 2010, pp. 665–669."},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"oa":1,"ec_funded":1,"day":"01","scopus_import":1,"alternative_title":["LNCS"],"pubrep_id":"43","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5393"}]},"external_id":{"arxiv":["1004.2367"]},"date_updated":"2023-02-23T12:24:17Z","file":[{"file_size":293605,"date_updated":"2020-07-14T12:46:28Z","date_created":"2018-12-12T10:16:33Z","file_id":"5221","creator":"system","file_name":"IST-2012-43-v1+1_GIST-_A_solver_for_probabilistic_games.pdf","access_level":"open_access","relation":"main_file","checksum":"0b2ef8c4037ffccc6902d93081af24f7","content_type":"application/pdf"}],"page":"665 - 669","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2010-07-01T00:00:00Z","_id":"4388","article_processing_charge":"No","month":"07","title":"GIST: A solver for probabilistic games","year":"2010","status":"public","ddc":["004"],"publisher":"Springer","doi":"10.1007/978-3-642-14295-6_57","oa_version":"Submitted Version","has_accepted_license":"1","publist_id":"1068","conference":{"name":"CAV: Computer Aided Verification","end_date":"2010-07-17","start_date":"2010-07-15","location":"Edinburgh, UK"},"type":"conference","file_date_updated":"2020-07-14T12:46:28Z","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Jobstmann, Barbara","first_name":"Barbara","last_name":"Jobstmann"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"}]},{"conference":{"name":"ACSD: Application of Concurrency to System Design"},"type":"conference","author":[{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"last_name":"Legay","first_name":"Axel","full_name":"Legay, Axel"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan","last_name":"Nickovic","full_name":"Nickovic, Dejan"}],"file_date_updated":"2020-07-14T12:46:28Z","publisher":"IEEE","ddc":["004"],"doi":"10.1109/ACSD.2010.26","status":"public","title":"Robustness of sequential circuits","year":"2010","publist_id":"1069","has_accepted_license":"1","oa_version":"Submitted Version","month":"08","_id":"4389","file":[{"file_name":"IST-2012-44-v1+1_Robustness_of_sequential_circuits.pdf","checksum":"42b2952bfc6b6974617bd554842b904a","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_size":159920,"date_updated":"2020-07-14T12:46:28Z","date_created":"2018-12-12T10:09:10Z","file_id":"4733","creator":"system"}],"page":"77 - 84","date_updated":"2021-01-12T07:56:36Z","date_published":"2010-08-23T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"day":"23","scopus_import":1,"pubrep_id":"44","citation":{"short":"L. Doyen, T.A. Henzinger, A. Legay, D. Nickovic, in:, IEEE, 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.","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>","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>","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.","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>.","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>."},"department":[{"_id":"ToHe"}],"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"}],"publication_status":"published","date_created":"2018-12-11T12:08:36Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},{"citation":{"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>.","chicago":"Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. “Model Checking of Linearizability of Concurrent List Implementations,” 6174:465–79. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">https://doi.org/10.1007/978-3-642-14295-6_41</a>.","ieee":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, “Model checking of linearizability of concurrent list implementations,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 465–479.","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>","short":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, in:, Springer, 2010, pp. 465–479.","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.","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>"},"department":[{"_id":"ToHe"}],"oa":1,"alternative_title":["LNCS"],"day":"01","related_material":{"record":[{"id":"5391","status":"public","relation":"earlier_version"}]},"pubrep_id":"27","volume":6174,"intvolume":"      6174","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:08:36Z","publication_status":"published","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."}],"status":"public","year":"2010","title":"Model checking of linearizability of concurrent list implementations","ddc":["000"],"publisher":"Springer","doi":"10.1007/978-3-642-14295-6_41","oa_version":"Submitted Version","has_accepted_license":"1","publist_id":"1066","conference":{"location":"Edinburgh, UK","name":"CAV: Computer Aided Verification","end_date":"2010-07-17","start_date":"2010-07-15"},"type":"conference","file_date_updated":"2020-07-14T12:46:28Z","author":[{"last_name":"Cerny","first_name":"Pavol","full_name":"Cerny, 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","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736"},{"last_name":"Chaudhuri","first_name":"Swarat","full_name":"Chaudhuri, Swarat"},{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"}],"date_updated":"2023-02-23T12:24:12Z","file":[{"date_updated":"2020-07-14T12:46:28Z","file_size":3633276,"creator":"dernst","file_id":"7873","date_created":"2020-05-19T16:31:56Z","checksum":"2eb211ce40b3c4988bce3a3592980704","access_level":"open_access","relation":"main_file","file_name":"2010_CAV_Cerny.pdf","content_type":"application/pdf"}],"page":"465 - 479","language":[{"iso":"eng"}],"date_published":"2010-07-01T00:00:00Z","quality_controlled":"1","_id":"4390","article_processing_charge":"No","month":"07"},{"_id":"4392","month":"07","language":[{"iso":"eng"}],"date_published":"2010-07-29T00:00:00Z","quality_controlled":"1","series_title":"Essays in Memory of Amir Pnueli","date_updated":"2021-01-12T07:56:38Z","page":"42 - 60","author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","first_name":"Pavol","last_name":"Cerny"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"type":"book_chapter","publist_id":"1064","oa_version":"None","title":"Quantitative Simulation Games","status":"public","year":"2010","publisher":"Springer","doi":"10.1007/978-3-642-13754-9_3","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"},{"grant_number":"214373","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"editor":[{"first_name":"Zohar","last_name":"Manna","full_name":"Manna, Zohar"},{"full_name":"Peled, Doron","first_name":"Doron","last_name":"Peled"}],"publication_status":"published","abstract":[{"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. ","lang":"eng"}],"volume":6200,"intvolume":"      6200","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:08:37Z","alternative_title":["LNCS"],"scopus_import":1,"day":"29","ec_funded":1,"publication":"Time For Verification: Essays in Memory of Amir Pnueli","department":[{"_id":"ToHe"}],"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.","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>","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>.","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>","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."}},{"publication_status":"published","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."}],"project":[{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7"}],"date_created":"2018-12-11T12:08:37Z","intvolume":"      6269","volume":6269,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"01","scopus_import":1,"alternative_title":["LNCS"],"related_material":{"record":[{"relation":"later_version","status":"public","id":"3249"},{"id":"5389","relation":"earlier_version","status":"public"}]},"pubrep_id":"42","department":[{"_id":"ToHe"}],"citation":{"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.","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>","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>.","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.","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>","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances. CONCUR: Concurrency Theory, LNCS, vol. 6269, 235–268."},"ec_funded":1,"oa":1,"month":"11","_id":"4393","file":[{"file_name":"IST-2012-42-v1+1_Simulation_distances.pdf","relation":"main_file","checksum":"ea567903676ba8afe0507ee11313dce5","access_level":"open_access","content_type":"application/pdf","file_size":198913,"date_updated":"2020-07-14T12:46:28Z","date_created":"2018-12-12T10:15:12Z","creator":"system","file_id":"5130"}],"page":"235 - 268","date_updated":"2023-02-23T12:24:04Z","date_published":"2010-11-01T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","conference":{"location":"Paris, France","end_date":"2010-09-03","name":"CONCUR: Concurrency Theory","start_date":"2010-08-31"},"author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","first_name":"Pavol","last_name":"Cerny"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"}],"file_date_updated":"2020-07-14T12:46:28Z","ddc":["005"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","doi":"10.1007/978-3-642-15375-4_18","year":"2010","status":"public","title":"Simulation distances","acknowledgement":"This work was partially supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","oa_version":"Submitted Version","publist_id":"1065","has_accepted_license":"1"},{"month":"04","editor":[{"first_name":"Rajiv","last_name":"Gupta","full_name":"Gupta, Rajiv"}],"abstract":[{"lang":"eng","text":"The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory programs this task is challenging because (1) concurrent threads can observe transformations that would be undetectable in a sequential program, and (2) contemporary multiprocessors commonly use relaxed memory models that complicate the reasoning. In this paper, we present a novel proof methodology for verifying that a local program transformation is sound with respect to a specific hardware memory model, in the sense that it is not observable in any context. The methodology is based on a structural induction and relies on a novel compositional denotational semantics for relaxed memory models that formalizes (1) the behaviors of program fragments as a set of traces, and (2) the effect of memory model relaxations as local trace rewrite operations. To apply this methodology in practice, we implemented a semi- automated tool called Traver and used it to verify/falsify several compiler transformations for a number of different hardware memory models."}],"publication_status":"published","_id":"4395","page":"104 - 123","extern":"1","date_updated":"2021-01-12T07:56:39Z","date_created":"2018-12-11T12:08:38Z","quality_controlled":"1","date_published":"2010-04-21T00:00:00Z","language":[{"iso":"eng"}],"intvolume":"      6011","volume":6011,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Pahos, Cyprus","name":"CC: Compiler Construction","end_date":"2010-03-28","start_date":"2010-03-20"},"type":"conference","alternative_title":["LNCS"],"day":"21","author":[{"full_name":"Burckhardt, Sebastian","first_name":"Sebastian","last_name":"Burckhardt"},{"first_name":"Madanlal","last_name":"Musuvathi","full_name":"Musuvathi, Madanlal"},{"last_name":"Singh","first_name":"Vasu","full_name":"Singh, Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Springer","citation":{"ista":"Burckhardt S, Musuvathi M, Singh V. 2010. Verifying local transformations on relaxed memory models. CC: Compiler Construction, LNCS, vol. 6011, 104–123.","ama":"Burckhardt S, Musuvathi M, Singh V. Verifying local transformations on relaxed memory models. In: Gupta R, ed. Vol 6011. Springer; 2010:104-123. doi:<a href=\"https://doi.org/10.1007/978-3-642-11970-5_7\">10.1007/978-3-642-11970-5_7</a>","short":"S. Burckhardt, M. Musuvathi, V. Singh, in:, R. Gupta (Ed.), Springer, 2010, pp. 104–123.","ieee":"S. Burckhardt, M. Musuvathi, and V. Singh, “Verifying local transformations on relaxed memory models,” presented at the CC: Compiler Construction, Pahos, Cyprus, 2010, vol. 6011, pp. 104–123.","apa":"Burckhardt, S., Musuvathi, M., &#38; Singh, V. (2010). Verifying local transformations on relaxed memory models. In R. Gupta (Ed.) (Vol. 6011, pp. 104–123). Presented at the CC: Compiler Construction, Pahos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-11970-5_7\">https://doi.org/10.1007/978-3-642-11970-5_7</a>","chicago":"Burckhardt, Sebastian, Madanlal Musuvathi, and Vasu Singh. “Verifying Local Transformations on Relaxed Memory Models.” edited by Rajiv Gupta, 6011:104–23. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-11970-5_7\">https://doi.org/10.1007/978-3-642-11970-5_7</a>.","mla":"Burckhardt, Sebastian, et al. <i>Verifying Local Transformations on Relaxed Memory Models</i>. Edited by Rajiv Gupta, vol. 6011, Springer, 2010, pp. 104–23, doi:<a href=\"https://doi.org/10.1007/978-3-642-11970-5_7\">10.1007/978-3-642-11970-5_7</a>."},"doi":"10.1007/978-3-642-11970-5_7","status":"public","year":"2010","title":"Verifying local transformations on relaxed memory models","publist_id":"1063","oa_version":"None"},{"publist_id":"1061","has_accepted_license":"1","oa_version":"Submitted Version","publisher":"Springer","ddc":["004"],"doi":"10.1007/978-3-642-12029-9_19","title":"Shape refinement through explicit heap analysis","status":"public","year":"2010","author":[{"last_name":"Beyer","first_name":"Dirk","full_name":"Beyer, Dirk"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Théoduloz, Grégory","first_name":"Grégory","last_name":"Théoduloz"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien","last_name":"Zufferey","first_name":"Damien","orcid":"0000-0002-3197-8736"}],"file_date_updated":"2020-07-14T12:46:29Z","type":"conference","conference":{"location":"Paphos, Cyprus","end_date":"2010-03-28","name":"FASE: Fundamental Approaches To Software Engineering","start_date":"2010-03-20"},"date_published":"2010-04-21T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","file_name":"IST-2012-41-v1+1_Shape_refinement_through_explicit_heap_analysis.pdf","checksum":"7d26e59a9681487d7283eba337292b2c","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:18:13Z","creator":"system","file_id":"5332","file_size":312147,"date_updated":"2020-07-14T12:46:29Z"}],"page":"263 - 277","date_updated":"2021-01-12T07:56:40Z","month":"04","_id":"4396","oa":1,"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>.","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.","apa":"Beyer, D., Henzinger, T. A., Théoduloz, G., &#38; Zufferey, D. (2010). Shape refinement through explicit heap analysis. In D. Rosenblum &#38; G. Taenzer (Eds.) (Vol. 6013, pp. 263–277). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">https://doi.org/10.1007/978-3-642-12029-9_19</a>","ista":"Beyer D, Henzinger TA, Théoduloz G, Zufferey D. 2010. Shape refinement through explicit heap analysis. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 6013, 263–277.","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>","short":"D. Beyer, T.A. Henzinger, G. Théoduloz, D. Zufferey, in:, D. Rosenblum, G. Taenzer (Eds.), Springer, 2010, pp. 263–277."},"department":[{"_id":"ToHe"}],"pubrep_id":"41","alternative_title":["LNCS"],"day":"21","scopus_import":1,"date_created":"2018-12-11T12:08:38Z","volume":6013,"intvolume":"      6013","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"editor":[{"full_name":"Rosenblum, David","first_name":"David","last_name":"Rosenblum"},{"full_name":"Taenzer, Gabriele","first_name":"Gabriele","last_name":"Taenzer"}],"publication_status":"published","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."}]}]