[{"day":"21","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1039/b920377j","keyword":["General Chemistry"],"quality_controlled":"1","publication":"Chemical Society Reviews","issue":"6","status":"public","month":"04","author":[{"first_name":"Rafal","full_name":"Klajn, Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","last_name":"Klajn"},{"last_name":"Stoddart","first_name":"J. Fraser","full_name":"Stoddart, J. Fraser"},{"last_name":"Grzybowski","full_name":"Grzybowski, Bartosz A.","first_name":"Bartosz A."}],"citation":{"ista":"Klajn R, Stoddart JF, Grzybowski BA. 2010. Nanoparticles functionalised with reversible molecular and supramolecular switches. Chemical Society Reviews. 39(6), 2203–2237.","apa":"Klajn, R., Stoddart, J. F., &#38; Grzybowski, B. A. (2010). Nanoparticles functionalised with reversible molecular and supramolecular switches. <i>Chemical Society Reviews</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/b920377j\">https://doi.org/10.1039/b920377j</a>","short":"R. Klajn, J.F. Stoddart, B.A. Grzybowski, Chemical Society Reviews 39 (2010) 2203–2237.","mla":"Klajn, Rafal, et al. “Nanoparticles Functionalised with Reversible Molecular and Supramolecular Switches.” <i>Chemical Society Reviews</i>, vol. 39, no. 6, Royal Society of Chemistry, 2010, pp. 2203–37, doi:<a href=\"https://doi.org/10.1039/b920377j\">10.1039/b920377j</a>.","chicago":"Klajn, Rafal, J. Fraser Stoddart, and Bartosz A. Grzybowski. “Nanoparticles Functionalised with Reversible Molecular and Supramolecular Switches.” <i>Chemical Society Reviews</i>. Royal Society of Chemistry, 2010. <a href=\"https://doi.org/10.1039/b920377j\">https://doi.org/10.1039/b920377j</a>.","ieee":"R. Klajn, J. F. Stoddart, and B. A. Grzybowski, “Nanoparticles functionalised with reversible molecular and supramolecular switches,” <i>Chemical Society Reviews</i>, vol. 39, no. 6. Royal Society of Chemistry, pp. 2203–2237, 2010.","ama":"Klajn R, Stoddart JF, Grzybowski BA. Nanoparticles functionalised with reversible molecular and supramolecular switches. <i>Chemical Society Reviews</i>. 2010;39(6):2203-2237. doi:<a href=\"https://doi.org/10.1039/b920377j\">10.1039/b920377j</a>"},"scopus_import":"1","external_id":{"pmid":["20407689"]},"date_published":"2010-04-21T00:00:00Z","publication_status":"published","oa_version":"None","fulldoi":"https://doi.org/10.1039/b920377j","pmid":1,"article_processing_charge":"No","title":"Nanoparticles functionalised with reversible molecular and supramolecular switches","_id":"13412","date_created":"2023-08-01T09:49:07Z","publication_identifier":{"issn":["0306-0012"],"eissn":["1460-4744"]},"volume":39,"page":"2203-2237","abstract":[{"text":"Nanoparticles (NPs) and molecular/supramolecular switches have attracted considerable interest during the past decade on account of their unique properties and prominent roles in the fields of organic chemistry and materials science. Materials derived from the combination of these two components are now emerging in the literature. This critical review evaluates materials which comprise NPs functionalised with well-defined self-assembled monolayers of molecular and supramolecular switches. We draw attention to the fact that immobilisation of switches on NPs does not, in general, hamper their switching ability, although it can impart new properties on the supporting particles. This premise leads us to the discussion of systems in which switching on the surfaces of NPs can be used to modulate reversibly a range of NP properties—optical, fluorescent, electrical, magnetic—as well as the controlled release of small molecules. Finally, we discuss examples in which molecular switches direct reversible self-assembly of NPs (308 references).","lang":"eng"}],"extern":"1","intvolume":"        39","date_updated":"2023-08-08T08:19:00Z","year":"2010","language":[{"iso":"eng"}],"publisher":"Royal Society of Chemistry","type":"journal_article"},{"_id":"1465","quality_controlled":0,"title":"Kac's conjecture from Nakajima quiver varieties","publication":"Inventiones Mathematicae","issue":"1","main_file_link":[{"url":"http://arxiv.org/abs/0811.1569","open_access":"1"}],"date_created":"2018-12-11T11:52:11Z","author":[{"first_name":"Tamas","full_name":"Tamas Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","last_name":"Hausel"}],"status":"public","month":"07","publication_status":"published","fulldoi":"https://doi.org/10.1007/s00222-010-0241-3","day":"01","doi":"10.1007/s00222-010-0241-3","oa":1,"publist_id":"5730","acknowledgement":"This work has been supported by a Royal Society University Research Fellowship, NSF grants DMS-0305505 and DMS-0604775 and an Alfred Sloan Fellowship 2005-2007.","year":"2010","type":"journal_article","date_published":"2010-07-01T00:00:00Z","publisher":"Springer","page":"21 - 37","citation":{"ama":"Hausel T. Kac’s conjecture from Nakajima quiver varieties. <i>Inventiones Mathematicae</i>. 2010;181(1):21-37. doi:<a href=\"https://doi.org/10.1007/s00222-010-0241-3\">10.1007/s00222-010-0241-3</a>","ieee":"T. Hausel, “Kac’s conjecture from Nakajima quiver varieties,” <i>Inventiones Mathematicae</i>, vol. 181, no. 1. Springer, pp. 21–37, 2010.","mla":"Hausel, Tamás. “Kac’s Conjecture from Nakajima Quiver Varieties.” <i>Inventiones Mathematicae</i>, vol. 181, no. 1, Springer, 2010, pp. 21–37, doi:<a href=\"https://doi.org/10.1007/s00222-010-0241-3\">10.1007/s00222-010-0241-3</a>.","ista":"Hausel T. 2010. Kac’s conjecture from Nakajima quiver varieties. Inventiones Mathematicae. 181(1), 21–37.","short":"T. Hausel, Inventiones Mathematicae 181 (2010) 21–37.","apa":"Hausel, T. (2010). Kac’s conjecture from Nakajima quiver varieties. <i>Inventiones Mathematicae</i>. Springer. <a href=\"https://doi.org/10.1007/s00222-010-0241-3\">https://doi.org/10.1007/s00222-010-0241-3</a>","chicago":"Hausel, Tamás. “Kac’s Conjecture from Nakajima Quiver Varieties.” <i>Inventiones Mathematicae</i>. Springer, 2010. <a href=\"https://doi.org/10.1007/s00222-010-0241-3\">https://doi.org/10.1007/s00222-010-0241-3</a>."},"volume":181,"abstract":[{"lang":"eng","text":"We prove a generating function formula for the Betti numbers of Nakajima quiver varieties. We prove that it is a q-deformation of the Weyl-Kac character formula. In particular this implies that the constant term of the polynomial counting the number of absolutely indecomposable representations of a quiver equals the multiplicity of a certain weight in the corresponding Kac-Moody algebra, which was conjectured by Kac in 1982."}],"extern":1,"date_updated":"2021-01-12T06:50:56Z","intvolume":"       181"},{"date_published":"2010-02-01T00:00:00Z","type":"journal_article","publisher":"Elsevier","year":"2010","publist_id":"5731","date_updated":"2021-01-12T06:50:56Z","intvolume":"       348","extern":1,"abstract":[{"text":"In Hausel et al. (2008) [10] we presented a conjecture generalizing the Cauchy formula for Macdonald polynomial. This conjecture encodes the mixed Hodge polynomials of the character varieties of representations of the fundamental group of a punctured Riemann surface of genus g. We proved several results which support this conjecture. Here we announce new results which are consequences of those in Hausel et al. (2008) [10].","lang":"eng"}],"page":"131 - 135","citation":{"ama":"Hausel T, Letellier E, Rodríguez Villegas F. Topology of character varieties and representations of quivers. <i>Comptes Rendus Mathematique</i>. 2010;348(3-4):131-135. doi:<a href=\"https://doi.org/10.1016/j.crma.2010.01.025\">10.1016/j.crma.2010.01.025</a>","ieee":"T. Hausel, E. Letellier, and F. Rodríguez Villegas, “Topology of character varieties and representations of quivers,” <i>Comptes Rendus Mathematique</i>, vol. 348, no. 3–4. Elsevier, pp. 131–135, 2010.","mla":"Hausel, Tamás, et al. “Topology of Character Varieties and Representations of Quivers.” <i>Comptes Rendus Mathematique</i>, vol. 348, no. 3–4, Elsevier, 2010, pp. 131–35, doi:<a href=\"https://doi.org/10.1016/j.crma.2010.01.025\">10.1016/j.crma.2010.01.025</a>.","apa":"Hausel, T., Letellier, E., &#38; Rodríguez Villegas, F. (2010). Topology of character varieties and representations of quivers. <i>Comptes Rendus Mathematique</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.crma.2010.01.025\">https://doi.org/10.1016/j.crma.2010.01.025</a>","short":"T. Hausel, E. Letellier, F. Rodríguez Villegas, Comptes Rendus Mathematique 348 (2010) 131–135.","ista":"Hausel T, Letellier E, Rodríguez Villegas F. 2010. Topology of character varieties and representations of quivers. Comptes Rendus Mathematique. 348(3–4), 131–135.","chicago":"Hausel, Tamás, Emmanuel Letellier, and Fernando Rodríguez Villegas. “Topology of Character Varieties and Representations of Quivers.” <i>Comptes Rendus Mathematique</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.crma.2010.01.025\">https://doi.org/10.1016/j.crma.2010.01.025</a>."},"volume":348,"author":[{"last_name":"Hausel","first_name":"Tamas","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","full_name":"Tamas Hausel"},{"first_name":"Emmanuel","full_name":"Letellier, Emmanuel","last_name":"Letellier"},{"full_name":"Rodríguez Villegas, Fernando","first_name":"Fernando","last_name":"Rodríguez Villegas"}],"month":"02","status":"public","issue":"3-4","main_file_link":[{"url":"http://arxiv.org/abs/0905.3491","open_access":"1"}],"date_created":"2018-12-11T11:52:11Z","publication":"Comptes Rendus Mathematique","_id":"1466","quality_controlled":0,"title":"Topology of character varieties and representations of quivers","oa":1,"doi":"10.1016/j.crma.2010.01.025","fulldoi":"https://doi.org/10.1016/j.crma.2010.01.025","day":"01","publication_status":"published"},{"oa":1,"doi":"10.1093/acprof:oso/9780199534920.003.0016","fulldoi":"https://doi.org/10.1093/acprof:oso/9780199534920.003.0016","day":"01","publication_status":"published","author":[{"last_name":"Hausel","first_name":"Tamas","full_name":"Tamas Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87"}],"status":"public","month":"09","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/0709.0504"}],"date_created":"2018-12-11T11:52:12Z","publication":"The Many Facets of Geometry: A Tribute to Nigel Hitchin","quality_controlled":0,"_id":"1468","title":"S-Duality in HyperkäHler Hodge Theory","date_updated":"2021-01-12T06:50:57Z","extern":1,"abstract":[{"text":"This chapter surveys the motivations, related results, and progress made towards the following problem, raised by Hitchin in 1995: What is the space of L2 harmonic forms on the moduli space of Higgs bundles on a Riemann surface?","lang":"eng"}],"citation":{"mla":"Hausel, Tamás. “S-Duality in HyperkäHler Hodge Theory.” <i>The Many Facets of Geometry: A Tribute to Nigel Hitchin</i>, Oxford University Press, 2010, doi:<a href=\"https://doi.org/10.1093/acprof:oso/9780199534920.003.0016\">10.1093/acprof:oso/9780199534920.003.0016</a>.","ista":"Hausel T. 2010.S-Duality in HyperkäHler Hodge Theory. In: The Many Facets of Geometry: A Tribute to Nigel Hitchin. .","apa":"Hausel, T. (2010). S-Duality in HyperkäHler Hodge Theory. In <i>The Many Facets of Geometry: A Tribute to Nigel Hitchin</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/acprof:oso/9780199534920.003.0016\">https://doi.org/10.1093/acprof:oso/9780199534920.003.0016</a>","short":"T. Hausel, in:, The Many Facets of Geometry: A Tribute to Nigel Hitchin, Oxford University Press, 2010.","chicago":"Hausel, Tamás. “S-Duality in HyperkäHler Hodge Theory.” In <i>The Many Facets of Geometry: A Tribute to Nigel Hitchin</i>. Oxford University Press, 2010. <a href=\"https://doi.org/10.1093/acprof:oso/9780199534920.003.0016\">https://doi.org/10.1093/acprof:oso/9780199534920.003.0016</a>.","ieee":"T. Hausel, “S-Duality in HyperkäHler Hodge Theory,” in <i>The Many Facets of Geometry: A Tribute to Nigel Hitchin</i>, Oxford University Press, 2010.","ama":"Hausel T. S-Duality in HyperkäHler Hodge Theory. In: <i>The Many Facets of Geometry: A Tribute to Nigel Hitchin</i>. Oxford University Press; 2010. doi:<a href=\"https://doi.org/10.1093/acprof:oso/9780199534920.003.0016\">10.1093/acprof:oso/9780199534920.003.0016</a>"},"type":"book_chapter","date_published":"2010-09-01T00:00:00Z","publisher":"Oxford University Press","year":"2010","publist_id":"5729"},{"fulldoi":"https://doi.org/10.1007/978-3-642-02091-9_18","oa_version":"None","publication_status":"published","article_processing_charge":"No","editor":[{"last_name":"Graimann","first_name":"Bernhard","full_name":"Graimann, Bernhard"},{"full_name":"Pfurtscheller, Gert","first_name":"Gert","last_name":"Pfurtscheller"},{"first_name":"Brendan","full_name":"Allison, Brendan","last_name":"Allison"}],"department":[{"_id":"ScienComp"}],"_id":"14983","title":"Adaptive Methods in BCI Research - An Introductory Tutorial","publication_identifier":{"eisbn":["9783642020919"],"issn":["1612-3018"],"isbn":["9783642020902"]},"date_created":"2024-02-14T09:56:00Z","abstract":[{"text":"This chapter tackles a difficult challenge: presenting signal processing material to non-experts. This chapter is meant to be comprehensible to people who have some math background, including a course in linear algebra and basic statistics, but do not specialize in mathematics, engineering, or related fields. Some formulas assume the reader is familiar with matrices and basic matrix operations, but not more advanced material. Furthermore, we tried to make the chapter readable even if you skip the formulas. Nevertheless, we include some simple methods to demonstrate the basics of adaptive data processing, then we proceed with some advanced methods that are fundamental in adaptive signal processing, and are likely to be useful in a variety of applications. The advanced algorithms are also online available [30]. In the second part, these techniques are applied to some real-world BCI data.","lang":"eng"}],"page":"331-355","edition":"1","date_updated":"2024-10-21T06:03:06Z","type":"book_chapter","publisher":"Springer","language":[{"iso":"eng"}],"year":"2010","day":"06","alternative_title":["The Frontiers Collection"],"doi":"10.1007/978-3-642-02091-9_18","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Brain-Computer Interfaces","quality_controlled":"1","author":[{"orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","first_name":"Alois","last_name":"Schlögl"},{"first_name":"Carmen","full_name":"Vidaurre, Carmen","last_name":"Vidaurre"},{"first_name":"Klaus-Robert","full_name":"Müller, Klaus-Robert","last_name":"Müller"}],"month":"09","status":"public","series_title":"FRONTCOLL","citation":{"ieee":"A. Schlögl, C. Vidaurre, and K.-R. Müller, “Adaptive Methods in BCI Research - An Introductory Tutorial,” in <i>Brain-Computer Interfaces</i>, 1st ed., B. Graimann, G. Pfurtscheller, and B. Allison, Eds. Berlin, Heidelberg: Springer, 2010, pp. 331–355.","ama":"Schlögl A, Vidaurre C, Müller K-R. Adaptive Methods in BCI Research - An Introductory Tutorial. In: Graimann B, Pfurtscheller G, Allison B, eds. <i>Brain-Computer Interfaces</i>. 1st ed. FRONTCOLL. Berlin, Heidelberg: Springer; 2010:331-355. doi:<a href=\"https://doi.org/10.1007/978-3-642-02091-9_18\">10.1007/978-3-642-02091-9_18</a>","chicago":"Schlögl, Alois, Carmen Vidaurre, and Klaus-Robert Müller. “Adaptive Methods in BCI Research - An Introductory Tutorial.” In <i>Brain-Computer Interfaces</i>, edited by Bernhard Graimann, Gert Pfurtscheller, and Brendan Allison, 1st ed., 331–55. FRONTCOLL. Berlin, Heidelberg: Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-02091-9_18\">https://doi.org/10.1007/978-3-642-02091-9_18</a>.","short":"A. Schlögl, C. Vidaurre, K.-R. Müller, in:, B. Graimann, G. Pfurtscheller, B. Allison (Eds.), Brain-Computer Interfaces, 1st ed., Springer, Berlin, Heidelberg, 2010, pp. 331–355.","ista":"Schlögl A, Vidaurre C, Müller K-R. 2010.Adaptive Methods in BCI Research - An Introductory Tutorial. In: Brain-Computer Interfaces. The Frontiers Collection, , 331–355.","apa":"Schlögl, A., Vidaurre, C., &#38; Müller, K.-R. (2010). Adaptive Methods in BCI Research - An Introductory Tutorial. In B. Graimann, G. Pfurtscheller, &#38; B. Allison (Eds.), <i>Brain-Computer Interfaces</i> (1st ed., pp. 331–355). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-02091-9_18\">https://doi.org/10.1007/978-3-642-02091-9_18</a>","mla":"Schlögl, Alois, et al. “Adaptive Methods in BCI Research - An Introductory Tutorial.” <i>Brain-Computer Interfaces</i>, edited by Bernhard Graimann et al., 1st ed., Springer, 2010, pp. 331–55, doi:<a href=\"https://doi.org/10.1007/978-3-642-02091-9_18\">10.1007/978-3-642-02091-9_18</a>."},"scopus_import":"1","corr_author":"1","date_published":"2010-09-06T00:00:00Z","place":"Berlin, Heidelberg","acknowledgement":"This work was supported by the EU grants “BrainCom” (FP6-2004-Mobility-5 Grant No 024259) and “Multi-adaptive BCI” (MEIF-CT-2006 Grant No 040666). Furthermore, we thank Matthias Krauledat for fruitful discussions and tools for generating Fig. 5."},{"publist_id":"5113","publisher":"Nature Publishing Group","type":"journal_article","date_published":"2010-05-27T00:00:00Z","year":"2010","acknowledgement":"This work was funded by the Medical Research Council.","abstract":[{"lang":"eng","text":"Complex I is the first enzyme of the respiratory chain and has a central role in cellular energy production, coupling electron transfer between NADH and quinone to proton translocation by an unknown mechanism. Dysfunction of complex I has been implicated in many human neurodegenerative diseases. We have determined the structure of its hydrophilic domain previously. Here, we report the α-helical structure of the membrane domain of complex I from Escherichia coli at 3.9 Å resolution. The antiporter-like subunits NuoL/M/N each contain 14 conserved transmembrane (TM) helices. Two of them are discontinuous, as in some transporters. Unexpectedly, subunit NuoL also contains a 110-Å long amphipathic α-helix, spanning almost the entire length of the domain. Furthermore, we have determined the structure of the entire complex I from Thermus thermophilus at 4.5 Å resolution. The L-shaped assembly consists of the α-helical model for the membrane domain, with 63 TM helices, and the known structure of the hydrophilic domain. The architecture of the complex provides strong clues about the coupling mechanism: the conformational changes at the interface of the two main domains may drive the long amphipathic α-helix of NuoL in a piston-like motion, tilting nearby discontinuous TM helices, resulting in proton translocation."}],"citation":{"ieee":"R. Efremov, R. Baradaran, and L. A. Sazanov, “The architecture of respiratory complex I,” <i>Nature</i>, vol. 465, no. 7297. Nature Publishing Group, pp. 441–445, 2010.","ama":"Efremov R, Baradaran R, Sazanov LA. The architecture of respiratory complex I. <i>Nature</i>. 2010;465(7297):441-445. doi:<a href=\"https://doi.org/10.1038/nature09066\">10.1038/nature09066</a>","chicago":"Efremov, Rouslan, Rozbeh Baradaran, and Leonid A Sazanov. “The Architecture of Respiratory Complex I.” <i>Nature</i>. Nature Publishing Group, 2010. <a href=\"https://doi.org/10.1038/nature09066\">https://doi.org/10.1038/nature09066</a>.","ista":"Efremov R, Baradaran R, Sazanov LA. 2010. The architecture of respiratory complex I. Nature. 465(7297), 441–445.","apa":"Efremov, R., Baradaran, R., &#38; Sazanov, L. A. (2010). The architecture of respiratory complex I. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature09066\">https://doi.org/10.1038/nature09066</a>","short":"R. Efremov, R. Baradaran, L.A. Sazanov, Nature 465 (2010) 441–445.","mla":"Efremov, Rouslan, et al. “The Architecture of Respiratory Complex I.” <i>Nature</i>, vol. 465, no. 7297, Nature Publishing Group, 2010, pp. 441–45, doi:<a href=\"https://doi.org/10.1038/nature09066\">10.1038/nature09066</a>."},"volume":465,"page":"441 - 445","intvolume":"       465","date_updated":"2021-01-12T06:54:25Z","extern":1,"publication":"Nature","title":"The architecture of respiratory complex I","_id":"1970","quality_controlled":0,"month":"05","status":"public","author":[{"first_name":"Rouslan","full_name":"Efremov, Rouslan G","last_name":"Efremov"},{"last_name":"Baradaran","first_name":"Rozbeh","full_name":"Baradaran, Rozbeh "},{"first_name":"Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0977-7989","full_name":"Leonid Sazanov","last_name":"Sazanov"}],"date_created":"2018-12-11T11:54:58Z","issue":"7297","day":"27","fulldoi":"https://doi.org/10.1038/nature09066","publication_status":"published","doi":"10.1038/nature09066"},{"editor":[{"last_name":"Danowski","orcid":"0000-0002-6026-4409","full_name":"Danowski, Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","first_name":"Patrick"},{"first_name":"Julia","full_name":"Bergmann, Julia","last_name":"Bergmann"}],"oa":1,"article_processing_charge":"No","publication_status":"published","oa_version":"Published Version","fulldoi":"https://doi.org/10.1515/9783110232103","date_created":"2018-12-11T12:08:23Z","publication_identifier":{"eisbn":["9-783-1102-3210-3"],"isbn":["9-783-1102-3209-7"]},"title":"Handbuch Bibliothek 2.0","_id":"4346","extern":"1","date_updated":"2025-07-02T11:25:26Z","volume":" 41","page":"405","abstract":[{"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.","lang":"eng"}],"year":"2010","language":[{"iso":"ger"}],"publisher":"De Gruyter","type":"book_editor","publist_id":"1228","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1515/9783110232103","alternative_title":["Bibliotheks- und Informationspraxis"],"day":"01","series_title":"Bibliothekspraxis","main_file_link":[{"url":"https://www.degruyter.com/document/doi/10.1515/9783110232103/html","open_access":"1"}],"status":"public","month":"09","quality_controlled":"1","citation":{"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>.","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>.","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>","short":"P. Danowski, J. Bergmann, eds., Handbuch Bibliothek 2.0, De Gruyter, 2010.","ista":"Danowski P, Bergmann J eds. 2010. Handbuch Bibliothek 2.0, De Gruyter, 405p.","ieee":"P. Danowski and J. Bergmann, Eds., <i>Handbuch Bibliothek 2.0</i>, vol. 41. 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>"},"date_published":"2010-09-01T00:00:00Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"}},{"date_published":"2010-06-09T00:00:00Z","type":"journal_article","publisher":"Oxford University Press","year":"2010","publist_id":"1100","date_updated":"2021-01-12T07:56:23Z","intvolume":"         2","extern":1,"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"}],"page":"454 - 466","volume":2,"citation":{"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.","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>","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>.","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.","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.","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>","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>."},"author":[{"last_name":"Guinane","first_name":"Caitriona","full_name":"Guinane, Caitriona M"},{"first_name":"Nouri","full_name":"Ben Zakour, Nouri L","last_name":"Ben Zakour"},{"first_name":"Maria","full_name":"Tormo-Mas, Maria A","last_name":"Tormo Mas"},{"last_name":"Weinert","first_name":"Lucy","full_name":"Weinert, Lucy A"},{"last_name":"Lowder","full_name":"Lowder, Bethan V","first_name":"Bethan"},{"last_name":"Cartwright","first_name":"Robyn","full_name":"Cartwright, Robyn A"},{"last_name":"Smyth","first_name":"Davida","full_name":"Smyth, Davida S"},{"last_name":"Smyth","full_name":"Smyth, Cyril J","first_name":"Cyril"},{"full_name":"Lindsay, Jodi A","first_name":"Jodi","last_name":"Lindsay"},{"full_name":"Gould, Katherine A","first_name":"Katherine","last_name":"Gould"},{"last_name":"Witney","full_name":"Witney, Adam","first_name":"Adam"},{"last_name":"Hinds","first_name":"Jason","full_name":"Hinds, Jason"},{"last_name":"Bollback","first_name":"Jonathan P","orcid":"0000-0002-4624-4612","full_name":"Jonathan Bollback","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rambaut","first_name":"Andrew","full_name":"Rambaut, Andrew"},{"first_name":"Jose","full_name":"Penades, Jose R","last_name":"Penades"},{"last_name":"Fitzgerald","full_name":"Fitzgerald, J Ross","first_name":"J Ross"}],"month":"06","status":"public","date_created":"2018-12-11T12:08:27Z","publication":"Genome Biology and Evolution","_id":"4358","quality_controlled":0,"title":"Evolutionary genomics of Staphylococcus aureus reveals insights into the origin and molecular basis of ruminant host adaptation","doi":"10.1093/gbe/evq031","fulldoi":"https://doi.org/10.1093/gbe/evq031","day":"09","publication_status":"published"},{"scopus_import":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>.","short":"T. Wies, D. Zufferey, T.A. Henzinger, in:, L. Ong (Ed.), Springer, 2010, 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.","ieee":"T. Wies, D. Zufferey, and T. A. Henzinger, “Forward analysis of depth-bounded processes,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus, 2010, vol. 6014, pp. 94–108.","ama":"Wies T, Zufferey D, Henzinger TA. Forward analysis of depth-bounded processes. In: Ong L, ed. Vol 6014. Springer; 2010:94-108. doi:<a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">10.1007/978-3-642-12032-9_8</a>"},"date_published":"2010-03-01T00:00:00Z","has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:27Z","corr_author":"1","alternative_title":["LNCS"],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-642-12032-9_8","day":"01","author":[{"first_name":"Thomas","full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","last_name":"Wies"},{"last_name":"Zufferey","first_name":"Damien","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}],"month":"03","status":"public","ddc":["004"],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"1405"}]},"quality_controlled":"1","conference":{"name":"FoSSaCS: Foundations of Software Science and Computation Structures","start_date":"2010-03-20","location":"Paphos, Cyprus","end_date":"2010-03-28"},"intvolume":"      6014","date_updated":"2026-04-09T14:35:23Z","file":[{"creator":"system","checksum":"3e610de84937d821316362658239134a","content_type":"application/pdf","file_id":"4677","access_level":"open_access","file_name":"IST-2012-50-v1+1_Forward_analysis_of_depth-bounded_processes.pdf","relation":"main_file","date_updated":"2020-07-14T12:46:27Z","file_size":240766,"date_created":"2018-12-12T10:08:17Z"}],"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."}],"pubrep_id":"50","page":"94 - 108","volume":6014,"type":"conference","publisher":"Springer","language":[{"iso":"eng"}],"year":"2010","publist_id":"1099","oa":1,"editor":[{"last_name":"Ong","first_name":"Luke","full_name":"Ong, Luke"}],"fulldoi":"https://doi.org/10.1007/978-3-642-12032-9_8","oa_version":"Submitted Version","publication_status":"published","date_created":"2018-12-11T12:08:27Z","department":[{"_id":"ToHe"}],"_id":"4361","title":"Forward analysis of depth-bounded processes"},{"corr_author":"1","date_published":"2010-01-01T00:00:00Z","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>","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.","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.","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>","ista":"Singh V. 2010. Runtime verification for software transactional memories. RV: International Conference on Runtime Verification, LNCS, vol. 6418, 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>."},"scopus_import":1,"quality_controlled":"1","month":"01","status":"public","author":[{"id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","full_name":"Singh, Vasu","first_name":"Vasu","last_name":"Singh"}],"day":"01","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-642-16612-9_32","alternative_title":["LNCS"],"publist_id":"1096","year":"2010","language":[{"iso":"eng"}],"publisher":"Springer","type":"conference","volume":6418,"page":"421 - 435","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":"2024-10-09T20:54:01Z","intvolume":"      6418","conference":{"name":"RV: International Conference on Runtime Verification","end_date":"2010-11-04","location":"St. Julians, Malta","start_date":"2010-11-01"},"title":"Runtime verification for software transactional memories","_id":"4362","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:08:28Z","publication_status":"published","oa_version":"None","fulldoi":"https://doi.org/10.1007/978-3-642-16612-9_32","editor":[{"first_name":"Oleg","full_name":"Sokolsky, Oleg","last_name":"Sokolsky"},{"first_name":"Grigore","full_name":"Rosu, Grigore","last_name":"Rosu"},{"first_name":"Nikolai","full_name":"Tilmann, Nikolai","last_name":"Tilmann"},{"full_name":"Barringer, Howard","first_name":"Howard","last_name":"Barringer"},{"last_name":"Falcone","first_name":"Ylies","full_name":"Falcone, Ylies"},{"last_name":"Finkbeiner","full_name":"Finkbeiner, Bernd","first_name":"Bernd"},{"last_name":"Havelund","first_name":"Klaus","full_name":"Havelund, Klaus"},{"last_name":"Lee","full_name":"Lee, Insup","first_name":"Insup"},{"first_name":"Gordon","full_name":"Pace, Gordon","last_name":"Pace"}]},{"title":"Counterexample-guided focus","quality_controlled":0,"_id":"4364","date_created":"2018-12-11T12:08:28Z","status":"public","month":"01","author":[{"last_name":"Podelski","first_name":"Andreas","full_name":"Podelski,Andreas"},{"last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Wies","first_name":"Thomas"}],"publication_status":"published","day":"01","fulldoi":"https://doi.org/10.1145/1707801.1706330","doi":"10.1145/1707801.1706330","publist_id":"1093","year":"2010","publisher":"ACM","date_published":"2010-01-01T00:00:00Z","type":"conference","citation":{"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>.","ista":"Podelski A, Wies T. 2010. Counterexample-guided focus. POPL: Principles of Programming Languages, 249–260.","short":"A. Podelski, T. Wies, in:, ACM, 2010, pp. 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>","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>.","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>","ieee":"A. Podelski and T. Wies, “Counterexample-guided focus,” presented at the POPL: Principles of Programming Languages, 2010, pp. 249–260."},"page":"249 - 260","extern":1,"date_updated":"2021-01-12T07:56:26Z","conference":{"name":"POPL: Principles of Programming Languages"}},{"ec_funded":1,"scopus_import":1,"citation":{"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.","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>","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>.","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.","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>","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>."},"date_published":"2010-09-08T00:00:00Z","file_date_updated":"2020-07-14T12:46:27Z","has_accepted_license":"1","corr_author":"1","alternative_title":["LNCS"],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-642-15297-9_13","day":"08","author":[{"last_name":"Nickovic","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","full_name":"Nickovic, Dejan","first_name":"Dejan"},{"first_name":"Nir","full_name":"Piterman, Nir","last_name":"Piterman"}],"status":"public","ddc":["004"],"month":"09","quality_controlled":"1","conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems","location":"Klosterneuburg, Austria","start_date":"2010-09-08","end_date":"2010-09-10"},"date_updated":"2024-10-09T20:54:01Z","intvolume":"      6246","file":[{"date_created":"2018-12-12T10:13:43Z","file_size":249789,"checksum":"b0ca5f5fbe8a3d20ccbc6f51a344a459","content_type":"application/pdf","file_id":"5028","creator":"system","access_level":"open_access","file_name":"IST-2012-49-v1+1_From_MTL_to_deterministic_timed_automata.pdf","relation":"main_file","date_updated":"2020-07-14T12:46:27Z"}],"pubrep_id":"49","abstract":[{"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.","lang":"eng"}],"page":"152 - 167","volume":6246,"type":"conference","publisher":"Springer","language":[{"iso":"eng"}],"project":[{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"},{"grant_number":"214373","call_identifier":"FP7","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"year":"2010","publist_id":"1090","oa":1,"editor":[{"first_name":"Thomas A.","full_name":"Henzinger, Thomas A.","last_name":"Henzinger"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"}],"fulldoi":"https://doi.org/10.1007/978-3-642-15297-9_13","oa_version":"Submitted Version","publication_status":"published","date_created":"2018-12-11T12:08:30Z","department":[{"_id":"ToHe"}],"_id":"4369","title":"From MTL to deterministic timed automata"},{"year":"2010","language":[{"iso":"eng"}],"publisher":"Springer","type":"conference","publist_id":"1081","intvolume":"      5944","date_updated":"2021-01-12T07:56:31Z","conference":{"name":"VMCAI: Verification, Model Checking and Abstract Interpretation","end_date":"2010-01-19","start_date":"2010-01-17","location":"Madrid, Spain"},"volume":5944,"page":"26 - 44","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"}],"date_created":"2018-12-11T12:08:33Z","title":"Building a calculus of data structures","_id":"4378","department":[{"_id":"ToHe"}],"editor":[{"full_name":"Barthe, Gilles","first_name":"Gilles","last_name":"Barthe"},{"full_name":"Hermenegildo, Manuel","first_name":"Manuel","last_name":"Hermenegildo"}],"oa":1,"publication_status":"published","oa_version":"Submitted Version","fulldoi":"https://doi.org/10.1007/978-3-642-11319-2_6","date_published":"2010-01-01T00:00:00Z","scopus_import":1,"citation":{"chicago":"Kuncak, Viktor, Ruzica Piskac, Philippe Suter, and Thomas Wies. “Building a Calculus of Data Structures.” edited by Gilles Barthe and Manuel Hermenegildo, 5944:26–44. Springer, 2010. <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>.","short":"V. Kuncak, R. Piskac, P. Suter, T. Wies, in:, G. Barthe, M. Hermenegildo (Eds.), Springer, 2010, 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>","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.","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>","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."},"main_file_link":[{"open_access":"1","url":"https://infoscience.epfl.ch/record/161290/"}],"month":"01","status":"public","author":[{"full_name":"Kuncak, Viktor","first_name":"Viktor","last_name":"Kuncak"},{"full_name":"Piskac, Ruzica","first_name":"Ruzica","last_name":"Piskac"},{"last_name":"Suter","full_name":"Suter, Philippe","first_name":"Philippe"},{"last_name":"Wies","full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas"}],"quality_controlled":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-642-11319-2_6","alternative_title":["LNCS"],"day":"01"},{"publication":"Formal Methods in System Design","quality_controlled":0,"_id":"4379","title":"Analog property checkers: a DDR2 case study","author":[{"full_name":"Jones, Kevin D","first_name":"Kevin","last_name":"Jones"},{"full_name":"Konrad,Victor","first_name":"Victor","last_name":"Konrad"},{"last_name":"Nickovic","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","full_name":"Dejan Nickovic","first_name":"Dejan"}],"month":"06","status":"public","issue":"2","main_file_link":[{"open_access":"1","url":"http://openaccess.city.ac.uk/1066/"}],"date_created":"2018-12-11T12:08:33Z","fulldoi":"https://doi.org/10.1007/s10703-009-0085-x","day":"01","publication_status":"published","doi":"10.1007/s10703-009-0085-x","oa":1,"publist_id":"1080","type":"journal_article","date_published":"2010-06-01T00:00:00Z","publisher":"Springer","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.","year":"2010","abstract":[{"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","lang":"eng"}],"page":"114 - 130","citation":{"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>","ista":"Jones K, Konrad V, Nickovic D. 2010. Analog property checkers: a DDR2 case study. Formal Methods in System Design. 36(2), 114–130.","short":"K. Jones, V. Konrad, D. Nickovic, Formal Methods in System Design 36 (2010) 114–130.","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>.","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>.","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>","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."},"volume":36,"date_updated":"2021-01-12T07:56:31Z","intvolume":"        36","extern":1},{"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."}],"pubrep_id":"48","page":"1 - 8","conference":{"name":"EMSOFT: Embedded Software ","end_date":"2010-10-29","location":"Arizona, USA","start_date":"2010-10-24"},"date_updated":"2024-10-09T20:54:01Z","file":[{"date_updated":"2020-07-14T12:46:28Z","relation":"main_file","access_level":"open_access","file_name":"IST-2012-48-v1+1_A_marketplace_for_cloud_resources.pdf","creator":"system","file_id":"4767","checksum":"7680dd24016810710f7c977bc94f85e9","content_type":"application/pdf","file_size":222626,"date_created":"2018-12-12T10:09:42Z"}],"publist_id":"1078","type":"conference","publisher":"ACM","language":[{"iso":"eng"}],"year":"2010","fulldoi":"https://doi.org/10.1145/1879021.1879022","oa_version":"Submitted Version","publication_status":"published","oa":1,"department":[{"_id":"ToHe"}],"_id":"4380","title":"A marketplace for cloud resources","date_created":"2018-12-11T12:08:33Z","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.","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>","short":"T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2010, pp. 1–8.","ista":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. 2010. A marketplace for cloud resources. EMSOFT: Embedded Software , 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>."},"scopus_import":1,"corr_author":"1","date_published":"2010-10-24T00:00:00Z","has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:28Z","day":"24","doi":"10.1145/1879021.1879022","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Anmol","id":"3D8D36B6-F248-11E8-B48F-1D18A9856A87","full_name":"Tomar, Anmol","last_name":"Tomar"},{"first_name":"Vasu","full_name":"Singh, Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","last_name":"Singh"},{"full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Wies"},{"last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","first_name":"Damien"}],"status":"public","ddc":["005"],"month":"10"},{"fulldoi":"https://doi.org/10.1109/CLOUD.2010.71","oa_version":"Submitted Version","publication_status":"published","article_processing_charge":"No","oa":1,"department":[{"_id":"ToHe"}],"_id":"4381","title":"FlexPRICE: Flexible provisioning of resources in a cloud environment","date_created":"2018-12-11T12:08:33Z","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"}],"pubrep_id":"47","page":"83 - 90","conference":{"end_date":"2010-07-10","location":"Miami, USA","start_date":"2010-07-05","name":"CLOUD: Cloud Computing"},"date_updated":"2024-10-09T20:54:00Z","file":[{"creator":"system","file_id":"5188","content_type":"application/pdf","checksum":"98e534675339a8e2beca08890d048145","relation":"main_file","date_updated":"2020-07-14T12:46:28Z","access_level":"open_access","file_name":"IST-2012-47-v1+1_FlexPRICE-_Flexible_provisioning_of_resources_in_a_cloud_environment.pdf","file_size":467436,"date_created":"2018-12-12T10:16:03Z"}],"publist_id":"1077","type":"conference","publisher":"IEEE","language":[{"iso":"eng"}],"year":"2010","day":"26","doi":"10.1109/CLOUD.2010.71","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","author":[{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"3D8D36B6-F248-11E8-B48F-1D18A9856A87","full_name":"Tomar, Anmol","first_name":"Anmol","last_name":"Tomar"},{"first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","full_name":"Singh, Vasu","last_name":"Singh"},{"last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas"},{"last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","first_name":"Damien"}],"status":"public","ddc":["004"],"month":"08","citation":{"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>.","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.","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>","short":"T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, IEEE, 2010, pp. 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>","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."},"scopus_import":1,"corr_author":"1","date_published":"2010-08-26T00:00:00Z","has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:28Z"},{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","doi":"10.1145/1810479.1810529","day":"13","ddc":["005"],"status":"public","month":"06","author":[{"first_name":"Rachid","full_name":"Guerraoui, Rachid","last_name":"Guerraoui"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Kapalka, Michal","first_name":"Michal","last_name":"Kapalka"},{"first_name":"Vasu","full_name":"Singh, Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","last_name":"Singh"}],"quality_controlled":"1","scopus_import":"1","citation":{"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>","ieee":"R. Guerraoui, T. A. Henzinger, M. Kapalka, and V. Singh, “Transactions in the jungle,” presented at the SPAA: ACM Symposium on Parallel Algorithms and Architectures, Santorini, Greece, 2010, pp. 263–272.","mla":"Guerraoui, Rachid, et al. <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.","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>","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>."},"file_date_updated":"2020-07-14T12:46:28Z","has_accepted_license":"1","date_published":"2010-06-13T00:00:00Z","oa":1,"publication_status":"published","oa_version":"Submitted Version","fulldoi":"https://doi.org/10.1145/1810479.1810529","date_created":"2018-12-11T12:08:34Z","title":"Transactions in the jungle","_id":"4382","department":[{"_id":"ToHe"}],"file":[{"file_id":"5080","content_type":"application/pdf","checksum":"f2ad6c00a6304da34bf21bcdcfd36c4b","creator":"system","relation":"main_file","date_updated":"2020-07-14T12:46:28Z","access_level":"open_access","file_name":"IST-2012-46-v1+1_Transactions_in_the_jungle.pdf","date_created":"2018-12-12T10:14:28Z","file_size":246409}],"date_updated":"2024-10-21T06:03:05Z","conference":{"name":"SPAA: ACM Symposium on Parallel Algorithms and Architectures","end_date":"2010-06-15","start_date":"2010-06-13","location":"Santorini, Greece"},"page":"263 - 272","pubrep_id":"46","abstract":[{"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.","lang":"eng"}],"year":"2010","language":[{"iso":"eng"}],"publisher":"ACM","type":"conference","publist_id":"1076"},{"day":"01","doi":"10.1007/978-3-642-14295-6_57","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"related_material":{"record":[{"id":"5393","status":"public","relation":"earlier_version"}]},"quality_controlled":"1","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Barbara","full_name":"Jobstmann, Barbara","last_name":"Jobstmann"},{"last_name":"Radhakrishna","first_name":"Arjun","full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"status":"public","month":"07","ddc":["004"],"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>.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, in:, Springer, 2010, pp. 665–669.","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>","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2010. GIST: A solver for probabilistic games. CAV: Computer Aided Verification, LNCS, vol. 6174, 665–669.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. “GIST: A Solver for Probabilistic Games,” 6174:665–69. Springer, 2010. <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>","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."},"scopus_import":1,"ec_funded":1,"external_id":{"arxiv":["1004.2367"]},"corr_author":"1","has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:28Z","date_published":"2010-07-01T00:00:00Z","publication_status":"published","fulldoi":"https://doi.org/10.1007/978-3-642-14295-6_57","oa_version":"Submitted Version","oa":1,"article_processing_charge":"No","_id":"4388","title":"GIST: A solver for probabilistic games","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:08:36Z","page":"665 - 669","volume":6174,"pubrep_id":"43","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"}],"arxiv":1,"file":[{"file_size":293605,"date_created":"2018-12-12T10:16:33Z","date_updated":"2020-07-14T12:46:28Z","relation":"main_file","file_name":"IST-2012-43-v1+1_GIST-_A_solver_for_probabilistic_games.pdf","access_level":"open_access","creator":"system","file_id":"5221","checksum":"0b2ef8c4037ffccc6902d93081af24f7","content_type":"application/pdf"}],"conference":{"name":"CAV: Computer Aided Verification","location":"Edinburgh, UK","start_date":"2010-07-15","end_date":"2010-07-17"},"date_updated":"2024-10-09T20:54:00Z","intvolume":"      6174","publist_id":"1068","language":[{"iso":"eng"}],"project":[{"name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","call_identifier":"FP7","grant_number":"214373"}],"year":"2010","type":"conference","publisher":"Springer"},{"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>.","ista":"Doyen L, Henzinger TA, Legay A, Nickovic D. 2010. Robustness of sequential circuits. ACSD: Application of Concurrency to System Design, 77–84.","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>","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>.","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.","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>"},"scopus_import":1,"date_published":"2010-08-23T00:00:00Z","file_date_updated":"2020-07-14T12:46:28Z","has_accepted_license":"1","day":"23","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","doi":"10.1109/ACSD.2010.26","quality_controlled":"1","author":[{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Legay","first_name":"Axel","full_name":"Legay, Axel"},{"first_name":"Dejan","full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic"}],"ddc":["004"],"status":"public","month":"08","pubrep_id":"44","abstract":[{"lang":"eng","text":"Digital components play a central role in the design of complex embedded systems. These components are interconnected with other, possibly analog, devices and the physical environment. This environment cannot be entirely captured and can provide inaccurate input data to the component. It is thus important for digital components to have a robust behavior, i.e. the presence of a small change in the input sequences should not result in a drastic change in the output sequences. In this paper, we study a notion of robustness for sequential circuits. However, since sequential circuits may have parts that are naturally discontinuous (e.g., digital controllers with switching behavior), we need a flexible framework that accommodates this fact and leaves discontinuous parts of the circuit out from the robustness analysis. As a consequence, we consider sequential circuits that have their input variables partitioned into two disjoint sets: control and disturbance variables. Our contributions are (1) a definition of robustness for sequential circuits as a form of continuity with respect to disturbance variables, (2) the characterization of the exact class of sequential circuits that are robust according to our definition, (3) an algorithm to decide whether a sequential circuit is robust or not."}],"page":"77 - 84","conference":{"name":"ACSD: Application of Concurrency to System Design"},"date_updated":"2021-01-12T07:56:36Z","file":[{"relation":"main_file","date_updated":"2020-07-14T12:46:28Z","file_name":"IST-2012-44-v1+1_Robustness_of_sequential_circuits.pdf","access_level":"open_access","file_id":"4733","checksum":"42b2952bfc6b6974617bd554842b904a","content_type":"application/pdf","creator":"system","date_created":"2018-12-12T10:09:10Z","file_size":159920}],"publist_id":"1069","type":"conference","publisher":"IEEE","language":[{"iso":"eng"}],"year":"2010","fulldoi":"https://doi.org/10.1109/ACSD.2010.26","oa_version":"Submitted Version","publication_status":"published","oa":1,"department":[{"_id":"ToHe"}],"_id":"4389","title":"Robustness of sequential circuits","date_created":"2018-12-11T12:08:36Z"},{"corr_author":"1","date_published":"2010-07-01T00:00:00Z","has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:28Z","citation":{"chicago":"Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. “Model Checking of Linearizability of Concurrent List Implementations,” 6174:465–79. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">https://doi.org/10.1007/978-3-642-14295-6_41</a>.","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>.","apa":"Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., &#38; Alur, R. (2010). Model checking of linearizability of concurrent list implementations (Vol. 6174, pp. 465–479). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">https://doi.org/10.1007/978-3-642-14295-6_41</a>","ista":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. 2010. Model checking of linearizability of concurrent list implementations. CAV: Computer Aided Verification, LNCS, vol. 6174, 465–479.","short":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, in:, Springer, 2010, pp. 465–479.","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>"},"scopus_import":"1","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5391"}]},"quality_controlled":"1","month":"07","status":"public","ddc":["000"],"author":[{"first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","last_name":"Cerny"},{"last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun"},{"first_name":"Damien","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey"},{"full_name":"Chaudhuri, Swarat","first_name":"Swarat","last_name":"Chaudhuri"},{"last_name":"Alur","full_name":"Alur, Rajeev","first_name":"Rajeev"}],"day":"01","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-642-14295-6_41","publist_id":"1066","publisher":"Springer","type":"conference","year":"2010","language":[{"iso":"eng"}],"pubrep_id":"27","abstract":[{"lang":"eng","text":"Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations does not stem from the number of variables or the program size, but rather from the large number of possible interleavings. These implementations are therefore prime candidates for model checking. We introduce an algorithm for verifying linearizability of singly-linked heap-based concurrent data structures. We consider a model consisting of an unbounded heap where each 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."}],"volume":6174,"page":"465 - 479","date_updated":"2024-10-21T06:03:05Z","intvolume":"      6174","conference":{"location":"Edinburgh, UK","start_date":"2010-07-15","end_date":"2010-07-17","name":"CAV: Computer Aided Verification"},"file":[{"date_updated":"2020-07-14T12:46:28Z","relation":"main_file","file_name":"2010_CAV_Cerny.pdf","access_level":"open_access","file_id":"7873","content_type":"application/pdf","checksum":"2eb211ce40b3c4988bce3a3592980704","creator":"dernst","date_created":"2020-05-19T16:31:56Z","file_size":3633276}],"department":[{"_id":"ToHe"}],"title":"Model checking of linearizability of concurrent list implementations","_id":"4390","date_created":"2018-12-11T12:08:36Z","oa_version":"Submitted Version","fulldoi":"https://doi.org/10.1007/978-3-642-14295-6_41","publication_status":"published","article_processing_charge":"No","oa":1}]