[{"date_published":"2006-04-18T00:00:00Z","quality_controlled":0,"type":"journal_article","status":"public","year":"2006","publication_status":"published","issue":"16","publisher":"National Academy of Sciences","doi":"10.1073/pnas.0601337103","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/math/0511163"}],"_id":"1462","date_updated":"2021-01-12T06:50:55Z","oa":1,"abstract":[{"text":"A Fourier transform technique is introduced for counting the number of solutions of holomorphic moment map equations over a finite field. This technique in turn gives information on Betti numbers of holomorphic symplectic quotients. As a consequence, simple unified proofs are obtained for formulas of Poincaré polynomials of toric hyperkähler varieties (recovering results of Bielawski-Dancer and Hausel-Sturmfels), Poincaré polynomials of Hubert schemes of points and twisted Atiyah-Drinfeld-Hitchin-Manin (ADHM) spaces of instantons on ℂ2 (recovering results of Nakajima-Yoshioka), and Poincaré polynomials of all Nakajima quiver varieties. As an application, a proof of a conjecture of Kac on the number of absolutely indecomposable representations of a quiver is announced.","lang":"eng"}],"date_created":"2018-12-11T11:52:10Z","acknowledgement":"This work was supported by a Royal Society University Research Fellowship, National Science Foundation Grant DMS-0305505, an Alfred P. Sloan Research Fellowship, and a Summer Research Assignment of the University of Texas at Austin.","extern":1,"day":"18","publication":"PNAS","author":[{"full_name":"Tamas Hausel","last_name":"Hausel","first_name":"Tamas","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"       103","title":"Betti numbers of holomorphic symplectic quotients via arithmetic Fourier transform","page":"6120 - 6124","publist_id":"5734","month":"04","citation":{"chicago":"Hausel, Tamás. “Betti Numbers of Holomorphic Symplectic Quotients via Arithmetic Fourier Transform.” <i>PNAS</i>. National Academy of Sciences, 2006. <a href=\"https://doi.org/10.1073/pnas.0601337103\">https://doi.org/10.1073/pnas.0601337103</a>.","ieee":"T. Hausel, “Betti numbers of holomorphic symplectic quotients via arithmetic Fourier transform,” <i>PNAS</i>, vol. 103, no. 16. National Academy of Sciences, pp. 6120–6124, 2006.","mla":"Hausel, Tamás. “Betti Numbers of Holomorphic Symplectic Quotients via Arithmetic Fourier Transform.” <i>PNAS</i>, vol. 103, no. 16, National Academy of Sciences, 2006, pp. 6120–24, doi:<a href=\"https://doi.org/10.1073/pnas.0601337103\">10.1073/pnas.0601337103</a>.","ista":"Hausel T. 2006. Betti numbers of holomorphic symplectic quotients via arithmetic Fourier transform. PNAS. 103(16), 6120–6124.","apa":"Hausel, T. (2006). Betti numbers of holomorphic symplectic quotients via arithmetic Fourier transform. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.0601337103\">https://doi.org/10.1073/pnas.0601337103</a>","short":"T. Hausel, PNAS 103 (2006) 6120–6124.","ama":"Hausel T. Betti numbers of holomorphic symplectic quotients via arithmetic Fourier transform. <i>PNAS</i>. 2006;103(16):6120-6124. doi:<a href=\"https://doi.org/10.1073/pnas.0601337103\">10.1073/pnas.0601337103</a>"},"volume":103},{"related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1016/j.cub.2006.06.020"}]},"publisher":"Cell Press","issue":"7","publication_status":"published","year":"2006","status":"public","type":"journal_article","date_published":"2006-04-04T00:00:00Z","abstract":[{"lang":"eng","text":"Background: Cell-to-cell communication at the synapse involves synaptic transmission as well as signaling mediated by growth factors, which provide developmental and plasticity cues. There is evidence that a retrograde, presynaptic transforming growth factor-β (TGF-β) signaling event regulates synapse development and function in Drosophila. Results: Here we show that a postsynaptic TGF-β signaling event occurs during larval development. The type I receptor Thick veins (Tkv) and the R-Smad transcription factor Mothers-against-dpp (Mad) are localized postsynaptically in the muscle. Furthermore, Mad phosphorylation occurs in regions facing the presynaptic active zones of neurotransmitter release within the postsynaptic subsynaptic reticulum (SSR). In order to monitor in real time the levels of TGF-β signaling in the synapse during synaptic transmission, we have established a FRAP assay to measure Mad nuclear import/export in the muscle. We show that Mad nuclear trafficking depends on stimulation of the muscle. Conclusions: Our data suggest a mechanism linking synaptic transmission and postsynaptic TGF-β signaling that may coordinate nerve-muscle development and function."}],"date_updated":"2021-11-16T07:44:15Z","_id":"1715","doi":"10.1016/j.cub.2006.02.061","author":[{"last_name":"Dudu","first_name":"Veronika","full_name":"Dudu, Veronika"},{"full_name":"Bittig, Thomas","first_name":"Thomas","last_name":"Bittig"},{"full_name":"Entchev, Eugeni","first_name":"Eugeni","last_name":"Entchev"},{"full_name":"Kicheva, Anna","orcid":"0000-0003-4509-4998","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","last_name":"Kicheva","first_name":"Anna"},{"full_name":"Julicher, Frank","last_name":"Julicher","first_name":"Frank"},{"full_name":"González Gaitán, Marcos","first_name":"Marcos","last_name":"González Gaitán"}],"publication":"Current Biology","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","extern":"1","day":"04","acknowledgement":"This work was supported by the Max Planck Society, HFSP, and Deutsche Forschungsgemeinschaft.","date_created":"2018-12-11T11:53:37Z","volume":16,"citation":{"apa":"Dudu, V., Bittig, T., Entchev, E., Kicheva, A., Julicher, F., &#38; González Gaitán, M. (2006). Postsynaptic mad signaling at the Drosophila neuromuscular junction. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2006.02.061\">https://doi.org/10.1016/j.cub.2006.02.061</a>","ama":"Dudu V, Bittig T, Entchev E, Kicheva A, Julicher F, González Gaitán M. Postsynaptic mad signaling at the Drosophila neuromuscular junction. <i>Current Biology</i>. 2006;16(7):625-635. doi:<a href=\"https://doi.org/10.1016/j.cub.2006.02.061\">10.1016/j.cub.2006.02.061</a>","short":"V. Dudu, T. Bittig, E. Entchev, A. Kicheva, F. Julicher, M. González Gaitán, Current Biology 16 (2006) 625–635.","chicago":"Dudu, Veronika, Thomas Bittig, Eugeni Entchev, Anna Kicheva, Frank Julicher, and Marcos González Gaitán. “Postsynaptic Mad Signaling at the Drosophila Neuromuscular Junction.” <i>Current Biology</i>. Cell Press, 2006. <a href=\"https://doi.org/10.1016/j.cub.2006.02.061\">https://doi.org/10.1016/j.cub.2006.02.061</a>.","ieee":"V. Dudu, T. Bittig, E. Entchev, A. Kicheva, F. Julicher, and M. González Gaitán, “Postsynaptic mad signaling at the Drosophila neuromuscular junction,” <i>Current Biology</i>, vol. 16, no. 7. Cell Press, pp. 625–635, 2006.","mla":"Dudu, Veronika, et al. “Postsynaptic Mad Signaling at the Drosophila Neuromuscular Junction.” <i>Current Biology</i>, vol. 16, no. 7, Cell Press, 2006, pp. 625–35, doi:<a href=\"https://doi.org/10.1016/j.cub.2006.02.061\">10.1016/j.cub.2006.02.061</a>.","ista":"Dudu V, Bittig T, Entchev E, Kicheva A, Julicher F, González Gaitán M. 2006. Postsynaptic mad signaling at the Drosophila neuromuscular junction. Current Biology. 16(7), 625–635."},"article_processing_charge":"No","month":"04","publist_id":"5416","language":[{"iso":"eng"}],"page":"625 - 635","title":"Postsynaptic mad signaling at the Drosophila neuromuscular junction","oa_version":"None","intvolume":"        16"},{"date_updated":"2025-01-07T12:21:03Z","abstract":[{"lang":"eng","text":"We present a robust method to derive the duty cycle of QSO activity based on the empirical QSO luminosity function and on the present-day linear relation between the masses of supermassive black holes and those of their spheroidal host stellar systems. It is found that the duty cycle is substantially less than unity, with characteristic values in the range 3-6 x 10-3. Finally, we tested the expectation that the QSO luminosity evolution and the star formation history should be roughly parallel, as a consequence of the above-mentioned relation between BH and galaxy masses."}],"external_id":{"arxiv":["astro-ph/0112131"]},"conference":{"location":"Venice, Italy","start_date":"2001-10-24","end_date":"2001-10-26","name":"European Southern Observatory and Universitäts-Sternwarte München Workshop"},"publisher":"Springer Nature","date_published":"2006-02-01T00:00:00Z","arxiv":1,"citation":{"ista":"Ciotti L, Haiman Z, Ostriker JP. 2006. What does the local black hole mass distribution tell us about the evolution of the quasar luminosity function? Proceedings of the European Southern Observatory and Universitäts-Sternwarte München Workshop. European Southern Observatory and Universitäts-Sternwarte München Workshop, ESO Astrophysics Symposia, , 106–108.","mla":"Ciotti, Luca, et al. “What Does the Local Black Hole Mass Distribution Tell Us about the Evolution of the Quasar Luminosity Function?” <i>Proceedings of the European Southern Observatory and Universitäts-Sternwarte München Workshop</i>, Springer Nature, 2006, pp. 106–08, doi:<a href=\"https://doi.org/10.1007/10899892_25\">10.1007/10899892_25</a>.","chicago":"Ciotti, Luca, Zoltán Haiman, and Jeremiah P. Ostriker. “What Does the Local Black Hole Mass Distribution Tell Us about the Evolution of the Quasar Luminosity Function?” In <i>Proceedings of the European Southern Observatory and Universitäts-Sternwarte München Workshop</i>, 106–8. Berlin/Heidelberg: Springer Nature, 2006. <a href=\"https://doi.org/10.1007/10899892_25\">https://doi.org/10.1007/10899892_25</a>.","ieee":"L. Ciotti, Z. Haiman, and J. P. Ostriker, “What does the local black hole mass distribution tell us about the evolution of the quasar luminosity function?,” in <i>Proceedings of the European Southern Observatory and Universitäts-Sternwarte München Workshop</i>, Venice, Italy, 2006, pp. 106–108.","apa":"Ciotti, L., Haiman, Z., &#38; Ostriker, J. P. (2006). What does the local black hole mass distribution tell us about the evolution of the quasar luminosity function? In <i>Proceedings of the European Southern Observatory and Universitäts-Sternwarte München Workshop</i> (pp. 106–108). Berlin/Heidelberg: Springer Nature. <a href=\"https://doi.org/10.1007/10899892_25\">https://doi.org/10.1007/10899892_25</a>","ama":"Ciotti L, Haiman Z, Ostriker JP. What does the local black hole mass distribution tell us about the evolution of the quasar luminosity function? In: <i>Proceedings of the European Southern Observatory and Universitäts-Sternwarte München Workshop</i>. Berlin/Heidelberg: Springer Nature; 2006:106-108. doi:<a href=\"https://doi.org/10.1007/10899892_25\">10.1007/10899892_25</a>","short":"L. Ciotti, Z. Haiman, J.P. Ostriker, in:, Proceedings of the European Southern Observatory and Universitäts-Sternwarte München Workshop, Springer Nature, Berlin/Heidelberg, 2006, pp. 106–108."},"oa_version":"Preprint","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Ciotti, Luca","last_name":"Ciotti","first_name":"Luca"},{"id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","first_name":"Zoltán","last_name":"Haiman","orcid":"0000-0003-3633-5403","full_name":"Haiman, Zoltán"},{"full_name":"Ostriker, Jeremiah P.","first_name":"Jeremiah P.","last_name":"Ostriker"}],"place":"Berlin/Heidelberg","extern":"1","oa":1,"publication_identifier":{"issn":["1431-2433"],"eissn":["1611-6143"],"isbn":["9783540002055"]},"doi":"10.1007/10899892_25","_id":"18730","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/astro-ph/0112131"}],"alternative_title":["ESO Astrophysics Symposia"],"quality_controlled":"1","type":"conference","status":"public","year":"2006","publication_status":"published","article_processing_charge":"No","month":"02","title":"What does the local black hole mass distribution tell us about the evolution of the quasar luminosity function?","page":"106-108","publication":"Proceedings of the European Southern Observatory and Universitäts-Sternwarte München Workshop","date_created":"2025-01-03T12:24:48Z","OA_place":"repository","scopus_import":"1","OA_type":"green","day":"01"},{"month":"03","article_processing_charge":"No","title":"The assembly of the first galaxies","page":"316-323","publication":"Proceedings of the European Southern Observatory and Universitäts-Sternwarte München Workshop","OA_place":"repository","date_created":"2025-01-03T12:25:11Z","scopus_import":"1","OA_type":"green","day":"10","oa":1,"doi":"10.1007/10899892_77","publication_identifier":{"eissn":["1611-6143"],"issn":["1431-2433"],"isbn":["9783540002055"]},"main_file_link":[{"url":"https://arxiv.org/abs/astro-ph/0201173","open_access":"1"}],"_id":"18731","quality_controlled":"1","status":"public","type":"conference","year":"2006","publication_status":"published","citation":{"chicago":"Haiman, Zoltán. “The Assembly of the First Galaxies.” In <i>Proceedings of the European Southern Observatory and Universitäts-Sternwarte München Workshop</i>, 316–23. Springer Nature, 2006. <a href=\"https://doi.org/10.1007/10899892_77\">https://doi.org/10.1007/10899892_77</a>.","ieee":"Z. Haiman, “The assembly of the first galaxies,” in <i>Proceedings of the European Southern Observatory and Universitäts-Sternwarte München Workshop</i>, Venice, Italy, 2006, pp. 316–323.","ista":"Haiman Z. 2006. The assembly of the first galaxies. Proceedings of the European Southern Observatory and Universitäts-Sternwarte München Workshop. European Southern Observatory and Universitäts-Sternwarte München Workshop, 316–323.","mla":"Haiman, Zoltán. “The Assembly of the First Galaxies.” <i>Proceedings of the European Southern Observatory and Universitäts-Sternwarte München Workshop</i>, Springer Nature, 2006, pp. 316–23, doi:<a href=\"https://doi.org/10.1007/10899892_77\">10.1007/10899892_77</a>.","apa":"Haiman, Z. (2006). The assembly of the first galaxies. In <i>Proceedings of the European Southern Observatory and Universitäts-Sternwarte München Workshop</i> (pp. 316–323). Venice, Italy: Springer Nature. <a href=\"https://doi.org/10.1007/10899892_77\">https://doi.org/10.1007/10899892_77</a>","ama":"Haiman Z. The assembly of the first galaxies. In: <i>Proceedings of the European Southern Observatory and Universitäts-Sternwarte München Workshop</i>. Springer Nature; 2006:316-323. doi:<a href=\"https://doi.org/10.1007/10899892_77\">10.1007/10899892_77</a>","short":"Z. Haiman, in:, Proceedings of the European Southern Observatory and Universitäts-Sternwarte München Workshop, Springer Nature, 2006, pp. 316–323."},"oa_version":"Preprint","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Zoltán","last_name":"Haiman","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","full_name":"Haiman, Zoltán","orcid":"0000-0003-3633-5403"}],"extern":"1","date_updated":"2025-01-07T12:28:20Z","abstract":[{"text":"The first galaxies formed at high redshifts, and were likely substantially less massive than typical galaxies in the local universe. We argue that (1) the reionization of a clumpy intergalactic medium by redshift z=6, (2) its enrichment by metals by z=3 without disturbing the Lyman alpha forest, and (3) the presence of supermassive black holes powering the recently discovered bright quasars at z=6, strongly suggest that a population of low-mass galaxies exists beyond redshifts z>6. Although the first stars could have been born in dark matter halos with virial temperatures as low as Tvir=200K, collapsing as early as z=25, the first galaxies likely appeared in significant numbers only in halos with Tvir>10,000K that collapsed later (z=15). The gas in these more massive halos initially contracts isothermally to high densities by atomic Lyman alpha cooling. H2 molecules can then form efficiently via non-equilibrium gas-phase chemistry, allowing the gas to cool further to T=100K, and fragment on stellar mass scales. These halos can harbor the first generation of ``mini-galaxies'' that reionized the universe. The continuum and line emission from these sources, as well as their Lyman alpha cooling radiation, can be detected in the future by NGST and other instruments.","lang":"eng"}],"external_id":{"arxiv":["astro-ph/0201173"]},"conference":{"end_date":"2001-10-26","name":"European Southern Observatory and Universitäts-Sternwarte München Workshop","location":"Venice, Italy","start_date":"2001-10-24"},"publisher":"Springer Nature","date_published":"2006-03-10T00:00:00Z","arxiv":1},{"intvolume":"       311","page":"1430 - 1436","title":"Structure of the hydrophilic domain of respiratory complex I from Thermus thermophilus","publist_id":"5121","month":"03","citation":{"chicago":"Sazanov, Leonid A, and Philip Hinchliffe. “Structure of the Hydrophilic Domain of Respiratory Complex I from Thermus Thermophilus.” <i>Science</i>. American Association for the Advancement of Science, 2006. <a href=\"https://doi.org/10.1126/science.1123809\">https://doi.org/10.1126/science.1123809</a>.","ieee":"L. A. Sazanov and P. Hinchliffe, “Structure of the hydrophilic domain of respiratory complex I from Thermus thermophilus,” <i>Science</i>, vol. 311, no. 5766. American Association for the Advancement of Science, pp. 1430–1436, 2006.","ista":"Sazanov LA, Hinchliffe P. 2006. Structure of the hydrophilic domain of respiratory complex I from Thermus thermophilus. Science. 311(5766), 1430–1436.","mla":"Sazanov, Leonid A., and Philip Hinchliffe. “Structure of the Hydrophilic Domain of Respiratory Complex I from Thermus Thermophilus.” <i>Science</i>, vol. 311, no. 5766, American Association for the Advancement of Science, 2006, pp. 1430–36, doi:<a href=\"https://doi.org/10.1126/science.1123809\">10.1126/science.1123809</a>.","apa":"Sazanov, L. A., &#38; Hinchliffe, P. (2006). Structure of the hydrophilic domain of respiratory complex I from Thermus thermophilus. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1123809\">https://doi.org/10.1126/science.1123809</a>","ama":"Sazanov LA, Hinchliffe P. Structure of the hydrophilic domain of respiratory complex I from Thermus thermophilus. <i>Science</i>. 2006;311(5766):1430-1436. doi:<a href=\"https://doi.org/10.1126/science.1123809\">10.1126/science.1123809</a>","short":"L.A. Sazanov, P. Hinchliffe, Science 311 (2006) 1430–1436."},"volume":311,"acknowledgement":"This work was funded by the Medical Research Council.","date_created":"2018-12-11T11:54:56Z","extern":1,"day":"10","publication":"Science","author":[{"orcid":"0000-0002-0977-7989","full_name":"Leonid Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","first_name":"Leonid A","last_name":"Sazanov"},{"first_name":"Philip","last_name":"Hinchliffe","full_name":"Hinchliffe, Philip "}],"doi":"10.1126/science.1123809","_id":"1961","date_updated":"2021-01-12T06:54:22Z","abstract":[{"lang":"eng","text":"Respiratory complex I plays a central role in cellular energy production in bacteria and mitochondria. Its dysfunction is implicated in many human neurodegenerative diseases, as well as in aging. The crystal structure of the hydrophilic domain (peripheral arm) of complex I from Thermus thermophilus has been solved at 3.3 angstrom resolution. This subcomplex consists of eight subunits and contains all the redox centers of the enzyme, including nine iron-sulfur clusters. The primary electron acceptor, flavin-mononucleotide, is within electron transfer distance of cluster N3, leading to the main redox pathway, and of the distal cluster Nia, a possible antioxidant. The structure reveals new aspects of the mechanism and evolution of the enzyme. The terminal cluster N2 is coordinated, uniquely, by two consecutive cysteines. The novel subunit Nqo15 has a similar fold to the mitochondrial iron chaperone frataxin, and it may be involved in iron-sulfur cluster regeneration in the complex.\n"}],"date_published":"2006-03-10T00:00:00Z","quality_controlled":0,"status":"public","type":"journal_article","publication_status":"published","year":"2006","issue":"5766","publisher":"American Association for the Advancement of Science"},{"intvolume":"        45","title":"Identification of a novel subunit of respiratory complex I from Thermus thermophilus","page":"4413 - 4420","publist_id":"5120","month":"04","citation":{"mla":"Hinchliffe, Philip, et al. “Identification of a Novel Subunit of Respiratory Complex I from Thermus Thermophilus.” <i>Biochemistry</i>, vol. 45, no. 14, ACS, 2006, pp. 4413–20, doi:<a href=\"https://doi.org/10.1021/bi0600998\">10.1021/bi0600998</a>.","ista":"Hinchliffe P, Carroll J, Sazanov LA. 2006. Identification of a novel subunit of respiratory complex I from Thermus thermophilus. Biochemistry. 45(14), 4413–4420.","ieee":"P. Hinchliffe, J. Carroll, and L. A. Sazanov, “Identification of a novel subunit of respiratory complex I from Thermus thermophilus,” <i>Biochemistry</i>, vol. 45, no. 14. ACS, pp. 4413–4420, 2006.","chicago":"Hinchliffe, Philip, Joe Carroll, and Leonid A Sazanov. “Identification of a Novel Subunit of Respiratory Complex I from Thermus Thermophilus.” <i>Biochemistry</i>. ACS, 2006. <a href=\"https://doi.org/10.1021/bi0600998\">https://doi.org/10.1021/bi0600998</a>.","ama":"Hinchliffe P, Carroll J, Sazanov LA. Identification of a novel subunit of respiratory complex I from Thermus thermophilus. <i>Biochemistry</i>. 2006;45(14):4413-4420. doi:<a href=\"https://doi.org/10.1021/bi0600998\">10.1021/bi0600998</a>","short":"P. Hinchliffe, J. Carroll, L.A. Sazanov, Biochemistry 45 (2006) 4413–4420.","apa":"Hinchliffe, P., Carroll, J., &#38; Sazanov, L. A. (2006). Identification of a novel subunit of respiratory complex I from Thermus thermophilus. <i>Biochemistry</i>. ACS. <a href=\"https://doi.org/10.1021/bi0600998\">https://doi.org/10.1021/bi0600998</a>"},"volume":45,"date_created":"2018-12-11T11:54:57Z","extern":1,"day":"11","publication":"Biochemistry","author":[{"first_name":"Philip","last_name":"Hinchliffe","full_name":"Hinchliffe, Philip "},{"full_name":"Carroll, Joe D","first_name":"Joe","last_name":"Carroll"},{"orcid":"0000-0002-0977-7989","full_name":"Leonid Sazanov","first_name":"Leonid A","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.1021/bi0600998","_id":"1966","date_updated":"2021-01-12T06:54:23Z","abstract":[{"text":"The hydrophilic domain (peripheral arm) of the proton-translocating NADH:quinone oxidoreductase (complex I) from the thermophilic organism Thermus thermophilus HB8 has been purified and characterized. The subcomplex is stable in sodium dodecyl sulfate up to 80 °C. Of nine iron-sulfur clusters, four to five (one or two binuclear and three tetranuclear) could be detected by EPR in the NADH-reduced enzyme. The preparation consists of eight different polypeptides. Seven of them have been positively identified by peptide mass mapping and N-terminal sequencing as known hydrophilic subunits of T. thermophilus complex I. The eighth polypeptide copurified with the subcomplex at all stages, is strongly associated with the other subunits, and is present in crystals of the subcomplex, used for X-ray data collection. Therefore, it has been identified as a novel complex I subunit and named Nqo15. It is encoded in a locus separate from the nqo operon, containing the 14 other known complex I genes. ORFs encoding Nqo15 homologues are present in the genomes of the closest relatives of T. thermophilus. Our data show that, contrary to previous assumptions, bacterial complex I can contain proteins in addition to a &quot;core&quot; complement of 14 subunits.","lang":"eng"}],"date_published":"2006-04-11T00:00:00Z","quality_controlled":0,"status":"public","type":"journal_article","publication_status":"published","year":"2006","issue":"14","publisher":"ACS"},{"_id":"4345","doi":"10.1515/bd.2006.40.11.1259","date_updated":"2025-07-01T12:46:13Z","article_type":"original","abstract":[{"text":"Der Artikel beschäftigt sich mit dem Konzept der Bibliothek 2.0 (bzw. Library 2.0). Er skizziert anhand einiger Beispiele die Entwicklung zum Web 2.0 und beschreibt, wie Web 2.0-Technologien und -Anwendungen in Bibliotheken eingesetzt werden. Im Mittelpunkt stehen Social-Tagging-Systeme, benutzerorientierte Erweiterungen von Bibliothekskatalogen und Dokumentenservern sowie der Einsatz von Weblogs an Bibliotheken. Ferner werden neue Anforderungen an Bibliothekare diskutiert.","lang":"eng"}],"date_published":"2006-11-01T00:00:00Z","year":"2006","publication_status":"published","status":"public","type":"journal_article","issue":"11","publisher":"De Gruyter","intvolume":"        40","page":"1250 - 1271","language":[{"iso":"eng"}],"title":"Bibliothek 2.0 - Die Bibliothek der Zukunft?","oa_version":"None","article_processing_charge":"No","month":"11","publist_id":"1229","volume":40,"citation":{"apa":"Danowski, P., &#38; Heller, L. (2006). Bibliothek 2.0 - Die Bibliothek der Zukunft? <i>Bibliotheksdienst</i>. De Gruyter. <a href=\"https://doi.org/10.1515/bd.2006.40.11.1259\">https://doi.org/10.1515/bd.2006.40.11.1259</a>","short":"P. Danowski, L. Heller, Bibliotheksdienst 40 (2006) 1250–1271.","ama":"Danowski P, Heller L. Bibliothek 2.0 - Die Bibliothek der Zukunft? <i>Bibliotheksdienst</i>. 2006;40(11):1250-1271. doi:<a href=\"https://doi.org/10.1515/bd.2006.40.11.1259\">10.1515/bd.2006.40.11.1259</a>","chicago":"Danowski, Patrick, and Lambert Heller. “Bibliothek 2.0 - Die Bibliothek Der Zukunft?” <i>Bibliotheksdienst</i>. De Gruyter, 2006. <a href=\"https://doi.org/10.1515/bd.2006.40.11.1259\">https://doi.org/10.1515/bd.2006.40.11.1259</a>.","ieee":"P. Danowski and L. Heller, “Bibliothek 2.0 - Die Bibliothek der Zukunft?,” <i>Bibliotheksdienst</i>, vol. 40, no. 11. De Gruyter, pp. 1250–1271, 2006.","ista":"Danowski P, Heller L. 2006. Bibliothek 2.0 - Die Bibliothek der Zukunft? Bibliotheksdienst. 40(11), 1250–1271.","mla":"Danowski, Patrick, and Lambert Heller. “Bibliothek 2.0 - Die Bibliothek Der Zukunft?” <i>Bibliotheksdienst</i>, vol. 40, no. 11, De Gruyter, 2006, pp. 1250–71, doi:<a href=\"https://doi.org/10.1515/bd.2006.40.11.1259\">10.1515/bd.2006.40.11.1259</a>."},"date_created":"2018-12-11T12:08:23Z","day":"01","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Bibliotheksdienst","author":[{"last_name":"Danowski","first_name":"Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6026-4409","full_name":"Danowski, Patrick"},{"full_name":"Heller, Lambert","last_name":"Heller","first_name":"Lambert"}]},{"intvolume":"         7","title":"SIMMAP: stochastic character mapping of discrete traits on phylogenies","publist_id":"1109","month":"01","citation":{"apa":"Bollback, J. P. (2006). SIMMAP: stochastic character mapping of discrete traits on phylogenies. <i>BMC Bioinformatics</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1471-2105-7-88\">https://doi.org/10.1186/1471-2105-7-88</a>","ama":"Bollback JP. SIMMAP: stochastic character mapping of discrete traits on phylogenies. <i>BMC Bioinformatics</i>. 2006;7. doi:<a href=\"https://doi.org/10.1186/1471-2105-7-88\">10.1186/1471-2105-7-88</a>","short":"J.P. Bollback, BMC Bioinformatics 7 (2006).","chicago":"Bollback, Jonathan P. “SIMMAP: Stochastic Character Mapping of Discrete Traits on Phylogenies.” <i>BMC Bioinformatics</i>. BioMed Central, 2006. <a href=\"https://doi.org/10.1186/1471-2105-7-88\">https://doi.org/10.1186/1471-2105-7-88</a>.","ieee":"J. P. Bollback, “SIMMAP: stochastic character mapping of discrete traits on phylogenies,” <i>BMC Bioinformatics</i>, vol. 7. BioMed Central, 2006.","mla":"Bollback, Jonathan P. “SIMMAP: Stochastic Character Mapping of Discrete Traits on Phylogenies.” <i>BMC Bioinformatics</i>, vol. 7, BioMed Central, 2006, doi:<a href=\"https://doi.org/10.1186/1471-2105-7-88\">10.1186/1471-2105-7-88</a>.","ista":"Bollback JP. 2006. SIMMAP: stochastic character mapping of discrete traits on phylogenies. BMC Bioinformatics. 7."},"volume":7,"date_created":"2018-12-11T12:08:25Z","day":"01","extern":1,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication":"BMC Bioinformatics","author":[{"full_name":"Jonathan Bollback","orcid":"0000-0002-4624-4612","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","first_name":"Jonathan P","last_name":"Bollback"}],"doi":"10.1186/1471-2105-7-88","_id":"4351","date_updated":"2021-01-12T07:56:20Z","abstract":[{"text":"BACKGROUND: Character mapping on phylogenies has played an important, if not critical role, in our understanding of molecular, morphological, and behavioral evolution. Until very recently we have relied on parsimony to infer character changes. Parsimony has a number of serious limitations that are drawbacks to our understanding. Recent statistical methods have been developed that free us from these limitations enabling us to overcome the problems of parsimony by accommodating uncertainty in evolutionary time, ancestral states, and the phylogeny. RESULTS: SIMMAP has been developed to implement stochastic character mapping that is useful to both molecular evolutionists, systematists, and bioinformaticians. Researchers can address questions about positive selection, patterns of amino acid substitution, character association, and patterns of morphological evolution. CONCLUSION: Stochastic character mapping, as implemented in the SIMMAP software, enables users to address questions that require mapping characters onto phylogenies using a probabilistic approach that does not rely on parsimony. Analyses can be performed using a fully Bayesian approach that is not reliant on considering a single topology, set of substitution model parameters, or reconstruction of ancestral states. Uncertainty in these quantities is accommodated by using MCMC samples from their respective posterior distributions.","lang":"eng"}],"date_published":"2006-01-01T00:00:00Z","quality_controlled":0,"type":"journal_article","status":"public","publication_status":"published","year":"2006","publisher":"BioMed Central"},{"volume":74,"citation":{"apa":"Conn, J., Vineis, J., Bollback, J. P., Onyabe, D., Wilkerson, R., &#38; Povoa, M. (2006). Population structure of the malaria vector Anopheles darlingi in a malaria-endemic region of eastern Amazonian Brazil. <i>The American Journal of Tropical Medicine and Hygiene</i>. American Society of Tropical Medicine and Hygiene.","ama":"Conn J, Vineis J, Bollback JP, Onyabe D, Wilkerson R, Povoa M. Population structure of the malaria vector Anopheles darlingi in a malaria-endemic region of eastern Amazonian Brazil. <i>The American Journal of Tropical Medicine and Hygiene</i>. 2006;74(5):798-806.","short":"J. Conn, J. Vineis, J.P. Bollback, D. Onyabe, R. Wilkerson, M. Povoa, The American Journal of Tropical Medicine and Hygiene 74 (2006) 798–806.","chicago":"Conn, Jan, Joseph Vineis, Jonathan P Bollback, David Onyabe, Richard Wilkerson, and Marinete Povoa. “Population Structure of the Malaria Vector Anopheles Darlingi in a Malaria-Endemic Region of Eastern Amazonian Brazil.” <i>The American Journal of Tropical Medicine and Hygiene</i>. American Society of Tropical Medicine and Hygiene, 2006.","ieee":"J. Conn, J. Vineis, J. P. Bollback, D. Onyabe, R. Wilkerson, and M. Povoa, “Population structure of the malaria vector Anopheles darlingi in a malaria-endemic region of eastern Amazonian Brazil,” <i>The American Journal of Tropical Medicine and Hygiene</i>, vol. 74, no. 5. American Society of Tropical Medicine and Hygiene, pp. 798–806, 2006.","ista":"Conn J, Vineis J, Bollback JP, Onyabe D, Wilkerson R, Povoa M. 2006. Population structure of the malaria vector Anopheles darlingi in a malaria-endemic region of eastern Amazonian Brazil. The American Journal of Tropical Medicine and Hygiene. 74(5), 798–806.","mla":"Conn, Jan, et al. “Population Structure of the Malaria Vector Anopheles Darlingi in a Malaria-Endemic Region of Eastern Amazonian Brazil.” <i>The American Journal of Tropical Medicine and Hygiene</i>, vol. 74, no. 5, American Society of Tropical Medicine and Hygiene, 2006, pp. 798–806."},"month":"05","publist_id":"1108","title":"Population structure of the malaria vector Anopheles darlingi in a malaria-endemic region of eastern Amazonian Brazil","page":"798 - 806","intvolume":"        74","author":[{"full_name":"Conn, Jan E","first_name":"Jan","last_name":"Conn"},{"full_name":"Vineis, Joseph H","last_name":"Vineis","first_name":"Joseph"},{"first_name":"Jonathan P","last_name":"Bollback","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4624-4612","full_name":"Jonathan Bollback"},{"full_name":"Onyabe, David Y","first_name":"David","last_name":"Onyabe"},{"last_name":"Wilkerson","first_name":"Richard","full_name":"Wilkerson, Richard C"},{"full_name":"Povoa, Marinete M","last_name":"Povoa","first_name":"Marinete"}],"publication":"The American Journal of Tropical Medicine and Hygiene","day":"01","extern":1,"date_created":"2018-12-11T12:08:25Z","abstract":[{"lang":"eng","text":"Anopheles darlingi is the primary malaria vector in Latin America, and is especially important in Amazonian Brazil. Historically, control efforts have been focused on indoor house spraying using a variety of insecticides, but since the mid-1990s there has been a shift to patient treatment and focal insecticide fogging. Anopheles darlingi was believed to have been significantly reduced in a gold-mining community, Peixoto de Azevedo (in Mato Grosso State), in the early 1990s by insecticide use during a severe malaria epidemic. In contrast, although An. darlingi was eradicated from some districts of the city of Belem (the capital of Para State) in 1968 to reduce malaria, populations around the water protection area in the eastern district were treated only briefly. To investigate the population structure of An. darlingi including evidence for a population bottleneck in Peixoto, we analyzed eight microsatellite loci of 256 individuals from seven locations in Brazil: three in Amapa State, three in Para State, and one in Mato Grosso State. Allelic diversity and mean expected heterozygosity were high for all populations (mean number alleles/locus and H(E) were 13.5 and 0.834, respectively) and did not differ significantly between locations. Significant heterozygote deficits were associated with linkage disequilibrium, most likely due to either the Wahlund effect or selection. We found no evidence for a population bottleneck in Peixoto, possibly because the reduction was not extreme enough to be detected. Overall estimates of long-term N(e) varied from 92.4 individuals under the linkage disequilibrium model to infinity under the heterozygote excess model. Fixation indices and analysis of molecular variance demonstrated significant differentiation between locations north and south of the Amazon River, suggesting a degree of genetic isolation between them, attributed to isolation by distance."}],"date_updated":"2021-01-12T07:56:20Z","_id":"4352","main_file_link":[{"url":"http://www.ajtmh.org/content/74/5/798.full","open_access":"0"}],"publisher":"American Society of Tropical Medicine and Hygiene","issue":"5","publication_status":"published","year":"2006","type":"journal_article","status":"public","quality_controlled":0,"date_published":"2006-05-01T00:00:00Z"},{"year":"2006","publication_status":"published","status":"public","type":"conference","quality_controlled":"1","date_published":"2006-01-01T00:00:00Z","publisher":"Springer","conference":{"name":"VMCAI: Verification, Model Checking and Abstract Interpretation","end_date":"2006-01-10","start_date":"2006-01-08","location":"Charleston, SC, United States"},"alternative_title":["LNCS"],"_id":"4359","doi":"10.1007/11609773_11","abstract":[{"lang":"eng","text":"We introduce field constraint analysis, a new technique for verifying data structure invariants. A field constraint for a field is a formula specifying a set of objects to which the field can point. Field constraints enable the application of decidable logics to data structures which were originally beyond the scope of these logics, by verifying the backbone of the data structure and then verifying constraints on fields that cross-cut the backbone in arbitrary ways. Previously, such cross-cutting fields could only be verified when they were uniquely determined by the backbone, which significantly limits the range of analyzable data structures.\r\n\r\nField constraint analysis permits non-deterministic field constraints on cross-cutting fields, which allows the verificiation of invariants for data structures such as skip lists. Non-deterministic field constraints also enable the verification of invariants between data structures, yielding an expressive generalization of static type declarations.\r\n\r\nThe generality of our field constraints requires new techniques. We present one such technique and prove its soundness. We have implemented this technique as part of a symbolic shape analysis deployed in the context of the Hob system for verifying data structure consistency. Using this implementation we were able to verify data structures that were previously beyond the reach of similar techniques."}],"date_updated":"2025-07-01T12:38:24Z","extern":"1","day":"01","scopus_import":"1","date_created":"2018-12-11T12:08:27Z","author":[{"full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Wies"},{"full_name":"Kuncak, Viktor","first_name":"Viktor","last_name":"Kuncak"},{"full_name":"Lam, Patrick","last_name":"Lam","first_name":"Patrick"},{"first_name":"Andreas","last_name":"Podelski","full_name":"Podelski, Andreas"},{"first_name":"Martin","last_name":"Rinard","full_name":"Rinard, Martin"}],"publication":"7th International Conference on Verification, Model Checking, and Abstract Interpretation","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"157 - 173","title":"Field constraint analysis","language":[{"iso":"eng"}],"oa_version":"None","intvolume":"      3855","volume":3855,"citation":{"short":"T. Wies, V. Kuncak, P. Lam, A. Podelski, M. Rinard, in:, 7th International Conference on Verification, Model Checking, and Abstract Interpretation, Springer, 2006, pp. 157–173.","ama":"Wies T, Kuncak V, Lam P, Podelski A, Rinard M. Field constraint analysis. In: <i>7th International Conference on Verification, Model Checking, and Abstract Interpretation</i>. Vol 3855. Springer; 2006:157-173. doi:<a href=\"https://doi.org/10.1007/11609773_11\">10.1007/11609773_11</a>","apa":"Wies, T., Kuncak, V., Lam, P., Podelski, A., &#38; Rinard, M. (2006). Field constraint analysis. In <i>7th International Conference on Verification, Model Checking, and Abstract Interpretation</i> (Vol. 3855, pp. 157–173). Charleston, SC, United States: Springer. <a href=\"https://doi.org/10.1007/11609773_11\">https://doi.org/10.1007/11609773_11</a>","ieee":"T. Wies, V. Kuncak, P. Lam, A. Podelski, and M. Rinard, “Field constraint analysis,” in <i>7th International Conference on Verification, Model Checking, and Abstract Interpretation</i>, Charleston, SC, United States, 2006, vol. 3855, pp. 157–173.","chicago":"Wies, Thomas, Viktor Kuncak, Patrick Lam, Andreas Podelski, and Martin Rinard. “Field Constraint Analysis.” In <i>7th International Conference on Verification, Model Checking, and Abstract Interpretation</i>, 3855:157–73. Springer, 2006. <a href=\"https://doi.org/10.1007/11609773_11\">https://doi.org/10.1007/11609773_11</a>.","mla":"Wies, Thomas, et al. “Field Constraint Analysis.” <i>7th International Conference on Verification, Model Checking, and Abstract Interpretation</i>, vol. 3855, Springer, 2006, pp. 157–73, doi:<a href=\"https://doi.org/10.1007/11609773_11\">10.1007/11609773_11</a>.","ista":"Wies T, Kuncak V, Lam P, Podelski A, Rinard M. 2006. Field constraint analysis. 7th International Conference on Verification, Model Checking, and Abstract Interpretation. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 3855, 157–173."},"month":"01","article_processing_charge":"No","publist_id":"1097"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Third International Conference on Formal Modeling and Analysis of Timed Systems","author":[{"full_name":"Maler, Oded","last_name":"Maler","first_name":"Oded"},{"full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","first_name":"Dejan"},{"full_name":"Pnueli, Amir","last_name":"Pnueli","first_name":"Amir"}],"date_created":"2018-12-11T12:08:31Z","scopus_import":"1","extern":"1","day":"23","publist_id":"1084","article_processing_charge":"No","month":"01","citation":{"apa":"Maler, O., Nickovic, D., &#38; Pnueli, A. (2006). Real time temporal logic: Past, present, future. In <i>Third International Conference on Formal Modeling and Analysis of Timed Systems</i> (Vol. 3829, pp. 2–16). Uppsala, Sweden: Springer. <a href=\"https://doi.org/10.1007/11603009_2\">https://doi.org/10.1007/11603009_2</a>","short":"O. Maler, D. Nickovic, A. Pnueli, in:, Third International Conference on Formal Modeling and Analysis of Timed Systems, Springer, 2006, pp. 2–16.","ama":"Maler O, Nickovic D, Pnueli A. Real time temporal logic: Past, present, future. In: <i>Third International Conference on Formal Modeling and Analysis of Timed Systems</i>. Vol 3829. Springer; 2006:2-16. doi:<a href=\"https://doi.org/10.1007/11603009_2\">10.1007/11603009_2</a>","chicago":"Maler, Oded, Dejan Nickovic, and Amir Pnueli. “Real Time Temporal Logic: Past, Present, Future.” In <i>Third International Conference on Formal Modeling and Analysis of Timed Systems</i>, 3829:2–16. Springer, 2006. <a href=\"https://doi.org/10.1007/11603009_2\">https://doi.org/10.1007/11603009_2</a>.","ieee":"O. Maler, D. Nickovic, and A. Pnueli, “Real time temporal logic: Past, present, future,” in <i>Third International Conference on Formal Modeling and Analysis of Timed Systems</i>, Uppsala, Sweden, 2006, vol. 3829, pp. 2–16.","ista":"Maler O, Nickovic D, Pnueli A. 2006. Real time temporal logic: Past, present, future. Third International Conference on Formal Modeling and Analysis of Timed Systems. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 3829, 2–16.","mla":"Maler, Oded, et al. “Real Time Temporal Logic: Past, Present, Future.” <i>Third International Conference on Formal Modeling and Analysis of Timed Systems</i>, vol. 3829, Springer, 2006, pp. 2–16, doi:<a href=\"https://doi.org/10.1007/11603009_2\">10.1007/11603009_2</a>."},"volume":3829,"intvolume":"      3829","oa_version":"None","title":"Real time temporal logic: Past, present, future","language":[{"iso":"eng"}],"page":"2 - 16","alternative_title":["LNCS"],"conference":{"location":"Uppsala, Sweden","start_date":"2005-09-26","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","end_date":"2005-09-28"},"publisher":"Springer","date_published":"2006-01-23T00:00:00Z","quality_controlled":"1","type":"conference","status":"public","publication_status":"published","year":"2006","date_updated":"2025-07-01T12:31:15Z","abstract":[{"text":"This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that timed languages specified by the past fragment of mitl, can be accepted by deterministic timed automata. On the other hand we provide a proof that certain languages expressed in the future fragment of mitl are not deterministic, and analyze the reason for this asymmetry.","lang":"eng"}],"doi":"10.1007/11603009_2","_id":"4373"},{"author":[{"first_name":"Oded","last_name":"Maler","full_name":"Maler, Oded"},{"full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","first_name":"Dejan"},{"full_name":"Pnueli, Amir","last_name":"Pnueli","first_name":"Amir"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"4th International Conference on Formal Modeling and Analysis of Timed Systems","extern":"1","day":"19","date_created":"2018-12-11T12:08:31Z","citation":{"mla":"Maler, Oded, et al. “From MITL to Timed Automata.” <i>4th International Conference on Formal Modeling and Analysis of Timed Systems</i>, vol. 4202, Springer, 2006, pp. 274–89, doi:<a href=\"https://doi.org/10.1007/11867340_20\">10.1007/11867340_20</a>.","ista":"Maler O, Nickovic D, Pnueli A. 2006. From MITL to timed automata. 4th International Conference on Formal Modeling and Analysis of Timed Systems. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 4202, 274–289.","chicago":"Maler, Oded, Dejan Nickovic, and Amir Pnueli. “From MITL to Timed Automata.” In <i>4th International Conference on Formal Modeling and Analysis of Timed Systems</i>, 4202:274–89. Springer, 2006. <a href=\"https://doi.org/10.1007/11867340_20\">https://doi.org/10.1007/11867340_20</a>.","ieee":"O. Maler, D. Nickovic, and A. Pnueli, “From MITL to timed automata,” in <i>4th International Conference on Formal Modeling and Analysis of Timed Systems</i>, Paris, France, 2006, vol. 4202, pp. 274–289.","apa":"Maler, O., Nickovic, D., &#38; Pnueli, A. (2006). From MITL to timed automata. In <i>4th International Conference on Formal Modeling and Analysis of Timed Systems</i> (Vol. 4202, pp. 274–289). Paris, France: Springer. <a href=\"https://doi.org/10.1007/11867340_20\">https://doi.org/10.1007/11867340_20</a>","ama":"Maler O, Nickovic D, Pnueli A. From MITL to timed automata. In: <i>4th International Conference on Formal Modeling and Analysis of Timed Systems</i>. Vol 4202. Springer; 2006:274-289. doi:<a href=\"https://doi.org/10.1007/11867340_20\">10.1007/11867340_20</a>","short":"O. Maler, D. Nickovic, A. Pnueli, in:, 4th International Conference on Formal Modeling and Analysis of Timed Systems, Springer, 2006, pp. 274–289."},"volume":4202,"publist_id":"1085","month":"10","article_processing_charge":"No","oa_version":"None","language":[{"iso":"eng"}],"title":"From MITL to timed automata","page":"274 - 289","intvolume":"      4202","publisher":"Springer","alternative_title":["LNCS"],"conference":{"location":"Paris, France","start_date":"2006-09-25","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","end_date":"2006-09-27"},"type":"conference","status":"public","publication_status":"published","year":"2006","date_published":"2006-10-19T00:00:00Z","abstract":[{"lang":"eng","text":"We show how to transform formulae written in the real-time temporal logic MITL into timed automata that recognize their satisfying models. This compositional construction is much simpler than previously known and can be easily implemented."}],"date_updated":"2025-07-01T12:35:07Z","doi":"10.1007/11867340_20","_id":"4374"},{"publist_id":"1054","article_processing_charge":"No","month":"01","citation":{"ieee":"R. Alur, P. Cerny, and S. Zdancewic, “Preserving secrecy under refinement,” in <i>33rd International Colloquium on Automata, Languages and Programming</i>, 2006, vol. 4052, pp. 107–118.","chicago":"Alur, Rajeev, Pavol Cerny, and Steve Zdancewic. “Preserving Secrecy under Refinement.” In <i>33rd International Colloquium on Automata, Languages and Programming</i>, 4052:107–18. Springer, 2006. <a href=\"https://doi.org/10.1007/11787006_10\">https://doi.org/10.1007/11787006_10</a>.","mla":"Alur, Rajeev, et al. “Preserving Secrecy under Refinement.” <i>33rd International Colloquium on Automata, Languages and Programming</i>, vol. 4052, Springer, 2006, pp. 107–18, doi:<a href=\"https://doi.org/10.1007/11787006_10\">10.1007/11787006_10</a>.","ista":"Alur R, Cerny P, Zdancewic S. 2006. Preserving secrecy under refinement. 33rd International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 4052, 107–118.","short":"R. Alur, P. Cerny, S. Zdancewic, in:, 33rd International Colloquium on Automata, Languages and Programming, Springer, 2006, pp. 107–118.","ama":"Alur R, Cerny P, Zdancewic S. Preserving secrecy under refinement. In: <i>33rd International Colloquium on Automata, Languages and Programming</i>. Vol 4052. Springer; 2006:107-118. doi:<a href=\"https://doi.org/10.1007/11787006_10\">10.1007/11787006_10</a>","apa":"Alur, R., Cerny, P., &#38; Zdancewic, S. (2006). Preserving secrecy under refinement. In <i>33rd International Colloquium on Automata, Languages and Programming</i> (Vol. 4052, pp. 107–118). Springer. <a href=\"https://doi.org/10.1007/11787006_10\">https://doi.org/10.1007/11787006_10</a>"},"volume":4052,"intvolume":"      4052","oa_version":"None","language":[{"iso":"eng"}],"title":"Preserving secrecy under refinement","page":"107 - 118","publication":"33rd International Colloquium on Automata, Languages and Programming","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"},{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"full_name":"Zdancewic, Steve","first_name":"Steve","last_name":"Zdancewic"}],"date_created":"2018-12-11T12:08:40Z","scopus_import":"1","extern":"1","day":"01","date_updated":"2025-07-01T12:27:36Z","abstract":[{"text":"We propose a general framework of secrecy and preservation of secrecy for labeled transition systems. Our definition of secrecy is parameterized by the distinguishing power of the observer, the properties to be kept secret, and the executions of interest, and captures a multitude of definitions in the literature. We define a notion of secrecy preserving refinement between systems by strengthening the classical trace-based refinement so that the implementation leaks a secret only when the specification also leaks it. We show that secrecy is in general not definable in μ-calculus, and thus not expressible in specification logics supported by standard model-checkers. However, we develop a simulation-based proof technique for establishing secrecy preserving refinement. This result shows how existing refinement checkers can be used to show correctness of an implementation with respect to a specification.","lang":"eng"}],"doi":"10.1007/11787006_10","_id":"4401","alternative_title":["LNCS"],"conference":{"name":"ICALP: Automata, Languages and Programming"},"publisher":"Springer","date_published":"2006-01-01T00:00:00Z","quality_controlled":"1","type":"conference","status":"public","year":"2006","publication_status":"published"},{"extern":1,"day":"08","date_created":"2018-12-11T12:08:41Z","acknowledgement":"This research was supported in part by the NSF grants CCR-0234690 and CCR-0225610, and the Belgian FNRS grant 2.4530.02 of the FRFC project “Centre Fédéré en Vérification.”","author":[{"full_name":"De Wulf, Martin","first_name":"Martin","last_name":"De Wulf"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Raskin","first_name":"Jean","full_name":"Raskin, Jean-François"}],"page":"17 - 30","title":"Antichains: A new algorithm for checking universality of finite automata","intvolume":"      4144","citation":{"ama":"De Wulf M, Doyen L, Henzinger TA, Raskin J. Antichains: A new algorithm for checking universality of finite automata. In: Vol 4144. Springer; 2006:17-30. doi:<a href=\"https://doi.org/10.1007/11817963_5\">10.1007/11817963_5</a>","short":"M. De Wulf, L. Doyen, T.A. Henzinger, J. Raskin, in:, Springer, 2006, pp. 17–30.","apa":"De Wulf, M., Doyen, L., Henzinger, T. A., &#38; Raskin, J. (2006). Antichains: A new algorithm for checking universality of finite automata (Vol. 4144, pp. 17–30). Presented at the CAV: Computer Aided Verification, Springer. <a href=\"https://doi.org/10.1007/11817963_5\">https://doi.org/10.1007/11817963_5</a>","ieee":"M. De Wulf, L. Doyen, T. A. Henzinger, and J. Raskin, “Antichains: A new algorithm for checking universality of finite automata,” presented at the CAV: Computer Aided Verification, 2006, vol. 4144, pp. 17–30.","chicago":"De Wulf, Martin, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Antichains: A New Algorithm for Checking Universality of Finite Automata,” 4144:17–30. Springer, 2006. <a href=\"https://doi.org/10.1007/11817963_5\">https://doi.org/10.1007/11817963_5</a>.","mla":"De Wulf, Martin, et al. <i>Antichains: A New Algorithm for Checking Universality of Finite Automata</i>. Vol. 4144, Springer, 2006, pp. 17–30, doi:<a href=\"https://doi.org/10.1007/11817963_5\">10.1007/11817963_5</a>.","ista":"De Wulf M, Doyen L, Henzinger TA, Raskin J. 2006. Antichains: A new algorithm for checking universality of finite automata. CAV: Computer Aided Verification, LNCS, vol. 4144, 17–30."},"volume":4144,"publist_id":"326","month":"08","type":"conference","status":"public","year":"2006","publication_status":"published","date_published":"2006-08-08T00:00:00Z","quality_controlled":0,"publisher":"Springer","alternative_title":["LNCS"],"conference":{"name":"CAV: Computer Aided Verification"},"doi":"10.1007/11817963_5","_id":"4406","abstract":[{"lang":"eng","text":"We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction to explicitly determinize the automaton, we keep the determinization step implicit. Our algorithm computes the least fixed point of a monotone function on the lattice of antichains of state sets. We evaluate the performance of our algorithm experimentally using the random automaton model recently proposed by Tabakov and Vardi. We show that on the difficult instances of this probabilistic model, the antichain algorithm outperforms the standard one by several orders of magnitude. We also show how variations of the antichain method can be used for solving the language-inclusion problem for nondeterministic finite automata, and the emptiness problem for alternating finite automata."}],"date_updated":"2021-01-12T07:56:45Z"},{"title":"The embedded systems design challenge","page":"1 - 15","intvolume":"      4085","volume":4085,"citation":{"chicago":"Henzinger, Thomas A, and Joseph Sifakis. “The Embedded Systems Design Challenge,” 4085:1–15. Springer, 2006. <a href=\"https://doi.org/10.1007/11813040_1\">https://doi.org/10.1007/11813040_1</a>.","ieee":"T. A. Henzinger and J. Sifakis, “The embedded systems design challenge,” presented at the FM: Formal Methods, 2006, vol. 4085, pp. 1–15.","mla":"Henzinger, Thomas A., and Joseph Sifakis. <i>The Embedded Systems Design Challenge</i>. Vol. 4085, Springer, 2006, pp. 1–15, doi:<a href=\"https://doi.org/10.1007/11813040_1\">10.1007/11813040_1</a>.","ista":"Henzinger TA, Sifakis J. 2006. The embedded systems design challenge. FM: Formal Methods, LNCS, vol. 4085, 1–15.","apa":"Henzinger, T. A., &#38; Sifakis, J. (2006). The embedded systems design challenge (Vol. 4085, pp. 1–15). Presented at the FM: Formal Methods, Springer. <a href=\"https://doi.org/10.1007/11813040_1\">https://doi.org/10.1007/11813040_1</a>","ama":"Henzinger TA, Sifakis J. The embedded systems design challenge. In: Vol 4085. Springer; 2006:1-15. doi:<a href=\"https://doi.org/10.1007/11813040_1\">10.1007/11813040_1</a>","short":"T.A. Henzinger, J. Sifakis, in:, Springer, 2006, pp. 1–15."},"month":"08","publist_id":"301","day":"10","extern":1,"date_created":"2018-12-11T12:08:49Z","acknowledgement":"Supported in part by the ARTIST2 European Network of Excellence on Embedded Systems Design, by the NSF ITR Center on Hybrid and Embedded Software Systems (CHESS), and by the SNSF NCCR on Mobile Information and Communication Systems (MICS).","author":[{"orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Joseph","last_name":"Sifakis","full_name":"Sifakis, Joseph"}],"_id":"4431","doi":"10.1007/11813040_1","abstract":[{"text":"We summarize some current trends in embedded systems design and point out some of their characteristics, such as the chasm between analytical and computational models, and the gap between safety-critical and best-effort engineering practices. We call for a coherent scientific foundation for embedded systems design, and we discuss a few key demands on such a foundation: the need for encompassing several manifestations of heterogeneity, and the need for constructivity in design. We believe that the development of a satisfactory Embedded Systems Design Science provides a timely challenge and opportunity for reinvigorating computer science.","lang":"eng"}],"date_updated":"2021-01-12T07:56:55Z","year":"2006","publication_status":"published","type":"conference","status":"public","quality_controlled":0,"date_published":"2006-08-10T00:00:00Z","publisher":"Springer","conference":{"name":"FM: Formal Methods"},"alternative_title":["LNCS"]},{"intvolume":"      4202","page":"1 - 17","title":"Timed alternating-time temporal logic","month":"09","publist_id":"296","volume":4202,"citation":{"mla":"Henzinger, Thomas A., and Vinayak Prabhu. <i>Timed Alternating-Time Temporal Logic</i>. Vol. 4202, Springer, 2006, pp. 1–17, doi:<a href=\"https://doi.org/10.1007/11867340_1\">10.1007/11867340_1</a>.","ista":"Henzinger TA, Prabhu V. 2006. Timed alternating-time temporal logic. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 4202, 1–17.","chicago":"Henzinger, Thomas A, and Vinayak Prabhu. “Timed Alternating-Time Temporal Logic,” 4202:1–17. Springer, 2006. <a href=\"https://doi.org/10.1007/11867340_1\">https://doi.org/10.1007/11867340_1</a>.","ieee":"T. A. Henzinger and V. Prabhu, “Timed alternating-time temporal logic,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, 2006, vol. 4202, pp. 1–17.","apa":"Henzinger, T. A., &#38; Prabhu, V. (2006). Timed alternating-time temporal logic (Vol. 4202, pp. 1–17). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Springer. <a href=\"https://doi.org/10.1007/11867340_1\">https://doi.org/10.1007/11867340_1</a>","ama":"Henzinger TA, Prabhu V. Timed alternating-time temporal logic. In: Vol 4202. Springer; 2006:1-17. doi:<a href=\"https://doi.org/10.1007/11867340_1\">10.1007/11867340_1</a>","short":"T.A. Henzinger, V. Prabhu, in:, Springer, 2006, pp. 1–17."},"date_created":"2018-12-11T12:08:49Z","acknowledgement":"This research was supported in part by the NSF grants CCR-0208875, CCR-0225610, and CCR-0234690.","extern":1,"day":"19","author":[{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger"},{"first_name":"Vinayak","last_name":"Prabhu","full_name":"Prabhu, Vinayak S"}],"_id":"4432","doi":"10.1007/11867340_1","date_updated":"2021-01-12T07:56:56Z","abstract":[{"lang":"eng","text":"We add freeze quantifiers to the game logic ATL in order to specify real-time objectives for games played on timed structures. We define the semantics of the resulting logic TATL by restricting the players to physically meaningful strategies, which do not prevent time from diverging. We show that TATL can be model checked over timed automaton games. We also specify timed optimization problems for physically meaningful strategies, and we show that for timed automaton games, the optimal answers can be approximated to within any degree of precision."}],"quality_controlled":0,"date_published":"2006-09-19T00:00:00Z","publication_status":"published","year":"2006","type":"conference","status":"public","conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"alternative_title":["LNCS"],"publisher":"Springer"},{"date_created":"2018-12-11T12:08:50Z","day":"24","extern":1,"author":[{"full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Slobodan","last_name":"Matic","full_name":"Matic, Slobodan"}],"title":"An interface algebra for real-time components","page":"253 - 266","publist_id":"294","month":"04","citation":{"chicago":"Henzinger, Thomas A, and Slobodan Matic. “An Interface Algebra for Real-Time Components,” 253–66. IEEE, 2006. <a href=\"https://doi.org/10.1109/RTAS.2006.11\">https://doi.org/10.1109/RTAS.2006.11</a>.","ieee":"T. A. Henzinger and S. Matic, “An interface algebra for real-time components,” presented at the RTAS: Real-time and Embedded Technology and Applications Symposium, 2006, pp. 253–266.","ista":"Henzinger TA, Matic S. 2006. An interface algebra for real-time components. RTAS: Real-time and Embedded Technology and Applications Symposium, 253–266.","mla":"Henzinger, Thomas A., and Slobodan Matic. <i>An Interface Algebra for Real-Time Components</i>. IEEE, 2006, pp. 253–66, doi:<a href=\"https://doi.org/10.1109/RTAS.2006.11\">10.1109/RTAS.2006.11</a>.","apa":"Henzinger, T. A., &#38; Matic, S. (2006). An interface algebra for real-time components (pp. 253–266). Presented at the RTAS: Real-time and Embedded Technology and Applications Symposium, IEEE. <a href=\"https://doi.org/10.1109/RTAS.2006.11\">https://doi.org/10.1109/RTAS.2006.11</a>","ama":"Henzinger TA, Matic S. An interface algebra for real-time components. In: IEEE; 2006:253-266. doi:<a href=\"https://doi.org/10.1109/RTAS.2006.11\">10.1109/RTAS.2006.11</a>","short":"T.A. Henzinger, S. Matic, in:, IEEE, 2006, pp. 253–266."},"date_published":"2006-04-24T00:00:00Z","quality_controlled":0,"type":"conference","status":"public","year":"2006","publication_status":"published","conference":{"name":"RTAS: Real-time and Embedded Technology and Applications Symposium"},"publisher":"IEEE","doi":"10.1109/RTAS.2006.11","_id":"4436","date_updated":"2021-01-12T07:56:57Z","abstract":[{"text":"We present an assume-guarantee interface algebra for real-time components. In our formalism a component implements a set of task sequences that share a resource. A component interface consists of an arrival rate function and a latency for each task sequence, and a capacity function for the shared resource. The interface specifies that the component guarantees certain task latencies depending on assumptions about task arrival rates and allocated resource capacities. Our algebra defines compatibility and refinement relations on interfaces. Interface compatibility can be checked on partial designs, even when some component interfaces are yet unknown. In this case interface composition computes as new assumptions the weakest constraints on the unknown components that are necessary to satisfy the specified guarantees. Interface refinement is defined in a way that ensures that compatible interfaces can be refined and implemented independently. Our algebra thus formalizes an interface-based design methodology that supports both the incremental addition of new components and the independent stepwise refinement of existing components. We demonstrate the flexibility and efficiency of the framework through simulation experiments.","lang":"eng"}]},{"status":"public","type":"conference","publication_status":"published","year":"2006","date_published":"2006-09-20T00:00:00Z","quality_controlled":0,"publisher":"Springer","alternative_title":["LNCS"],"conference":{"name":"CSL: Computer Science Logic"},"doi":"10.1007/11874683_26","_id":"4437","abstract":[{"lang":"eng","text":"The synthesis of reactive systems requires the solution of two-player games on graphs with ω-regular objectives. When the objective is specified by a linear temporal logic formula or nondeterministic Büchi automaton, then previous algorithms for solving the game require the construction of an equivalent deterministic automaton. However, determinization for automata on infinite words is extremely complicated, and current implementations fail to produce deterministic automata even for relatively small inputs. We show how to construct, from a given nondeterministic Büchi automaton, an equivalent nondeterministic parity automaton that is good for solving games with objective . The main insight is that a nondeterministic automaton is good for solving games if it fairly simulates the equivalent deterministic automaton. In this way, we omit the determinization step in game solving and reactive synthesis. The fact that our automata are nondeterministic makes them surprisingly simple, amenable to symbolic implementation, and allows an incremental search for winning strategies."}],"date_updated":"2021-01-12T07:56:58Z","extern":1,"day":"20","acknowledgement":"This research was supported in part by the Swiss National Science Foundation.","date_created":"2018-12-11T12:08:51Z","author":[{"full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Piterman, Nir","first_name":"Nir","last_name":"Piterman"}],"title":"Solving games without determinization","page":"395 - 410","intvolume":"      4207","citation":{"ista":"Henzinger TA, Piterman N. 2006. Solving games without determinization. CSL: Computer Science Logic, LNCS, vol. 4207, 395–410.","mla":"Henzinger, Thomas A., and Nir Piterman. <i>Solving Games without Determinization</i>. Vol. 4207, Springer, 2006, pp. 395–410, doi:<a href=\"https://doi.org/10.1007/11874683_26\">10.1007/11874683_26</a>.","ieee":"T. A. Henzinger and N. Piterman, “Solving games without determinization,” presented at the CSL: Computer Science Logic, 2006, vol. 4207, pp. 395–410.","chicago":"Henzinger, Thomas A, and Nir Piterman. “Solving Games without Determinization,” 4207:395–410. Springer, 2006. <a href=\"https://doi.org/10.1007/11874683_26\">https://doi.org/10.1007/11874683_26</a>.","ama":"Henzinger TA, Piterman N. Solving games without determinization. In: Vol 4207. Springer; 2006:395-410. doi:<a href=\"https://doi.org/10.1007/11874683_26\">10.1007/11874683_26</a>","short":"T.A. Henzinger, N. Piterman, in:, Springer, 2006, pp. 395–410.","apa":"Henzinger, T. A., &#38; Piterman, N. (2006). Solving games without determinization (Vol. 4207, pp. 395–410). Presented at the CSL: Computer Science Logic, Springer. <a href=\"https://doi.org/10.1007/11874683_26\">https://doi.org/10.1007/11874683_26</a>"},"volume":4207,"publist_id":"295","month":"09"},{"date_created":"2018-12-11T12:08:55Z","extern":1,"day":"28","publication":"Theoretical Computer Science","author":[{"full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"},{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar S"}],"intvolume":"       354","title":"On the universal and existential fragments of the mu-calculus","page":"173 - 186","publist_id":"276","month":"03","citation":{"ama":"Henzinger TA, Kupferman O, Majumdar R. On the universal and existential fragments of the mu-calculus. <i>Theoretical Computer Science</i>. 2006;354(2):173-186. doi:<a href=\"https://doi.org/10.1016/j.tcs.2005.11.015\">10.1016/j.tcs.2005.11.015</a>","short":"T.A. Henzinger, O. Kupferman, R. Majumdar, Theoretical Computer Science 354 (2006) 173–186.","apa":"Henzinger, T. A., Kupferman, O., &#38; Majumdar, R. (2006). On the universal and existential fragments of the mu-calculus. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2005.11.015\">https://doi.org/10.1016/j.tcs.2005.11.015</a>","mla":"Henzinger, Thomas A., et al. “On the Universal and Existential Fragments of the Mu-Calculus.” <i>Theoretical Computer Science</i>, vol. 354, no. 2, Elsevier, 2006, pp. 173–86, doi:<a href=\"https://doi.org/10.1016/j.tcs.2005.11.015\">10.1016/j.tcs.2005.11.015</a>.","ista":"Henzinger TA, Kupferman O, Majumdar R. 2006. On the universal and existential fragments of the mu-calculus. Theoretical Computer Science. 354(2), 173–186.","ieee":"T. A. Henzinger, O. Kupferman, and R. Majumdar, “On the universal and existential fragments of the mu-calculus,” <i>Theoretical Computer Science</i>, vol. 354, no. 2. Elsevier, pp. 173–186, 2006.","chicago":"Henzinger, Thomas A, Orna Kupferman, and Ritankar Majumdar. “On the Universal and Existential Fragments of the Mu-Calculus.” <i>Theoretical Computer Science</i>. Elsevier, 2006. <a href=\"https://doi.org/10.1016/j.tcs.2005.11.015\">https://doi.org/10.1016/j.tcs.2005.11.015</a>."},"volume":354,"date_published":"2006-03-28T00:00:00Z","quality_controlled":0,"status":"public","type":"journal_article","year":"2006","publication_status":"published","issue":"2","publisher":"Elsevier","doi":"10.1016/j.tcs.2005.11.015","_id":"4451","date_updated":"2021-01-12T07:57:04Z","abstract":[{"text":"One source of complexity in the μ-calculus is its ability to specify an unbounded number of switches between universal (AX) and existential (EX) branching modes. We therefore study the problems of satisfiability, validity, model checking, and implication for the universal and existential fragments of the μ-calculus, in which only one branching mode is allowed. The universal fragment is rich enough to express most specifications of interest, and therefore improved algorithms are of practical importance. We show that while the satisfiability and validity problems become indeed simpler for the existential and universal fragments, this is, unfortunately, not the case for model checking and implication. We also show the corresponding results for the alternation-free fragment of the μ-calculus, where no alternations between least and greatest fixed points are allowed. Our results imply that efforts to find a polynomial-time model-checking algorithm for the μ-calculus can be replaced by efforts to find such an algorithm for the universal or existential fragment.","lang":"eng"}]},{"doi":"10.1145/1181775.1181790","_id":"4523","abstract":[{"text":"We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and for these programs the property checking problem is undecidable. Two broad approaches to property checking are testing and verification. Testing tries to find inputs and executions which demonstrate violations of the property. Verification tries to construct a formal proof which shows that all executions of the program satisfy the property. Testing works best when errors are easy to find, but it is often difficult to achieve sufficient coverage for correct programs. On the other hand, verification methods are most successful when proofs are easy to find, but they are often inefficient at discovering errors. We propose a new algorithm, Synergy, which combines testing and verification. Synergy unifies several ideas from the literature, including counterexample-guided model checking, directed testing, and partition refinement.This paper presents a description of the Synergy algorithm, its theoretical properties, a comparison with related algorithms, and a prototype implementation called Yogi.","lang":"eng"}],"date_updated":"2021-01-12T07:59:26Z","type":"conference","status":"public","year":"2006","publication_status":"published","date_published":"2006-01-01T00:00:00Z","quality_controlled":0,"publisher":"ACM","conference":{"name":"FSE: Foundations of Software Engineering"},"page":"117 - 127","title":"Synergy: A new algorithm for property checking","citation":{"chicago":"Gulavani, Bhargav, Thomas A Henzinger, Yamini Kannan, Aditya Nori, and Sriram Rajamani. “Synergy: A New Algorithm for Property Checking,” 117–27. ACM, 2006. <a href=\"https://doi.org/10.1145/1181775.1181790\">https://doi.org/10.1145/1181775.1181790</a>.","ieee":"B. Gulavani, T. A. Henzinger, Y. Kannan, A. Nori, and S. Rajamani, “Synergy: A new algorithm for property checking,” presented at the FSE: Foundations of Software Engineering, 2006, pp. 117–127.","mla":"Gulavani, Bhargav, et al. <i>Synergy: A New Algorithm for Property Checking</i>. ACM, 2006, pp. 117–27, doi:<a href=\"https://doi.org/10.1145/1181775.1181790\">10.1145/1181775.1181790</a>.","ista":"Gulavani B, Henzinger TA, Kannan Y, Nori A, Rajamani S. 2006. Synergy: A new algorithm for property checking. FSE: Foundations of Software Engineering, 117–127.","apa":"Gulavani, B., Henzinger, T. A., Kannan, Y., Nori, A., &#38; Rajamani, S. (2006). Synergy: A new algorithm for property checking (pp. 117–127). Presented at the FSE: Foundations of Software Engineering, ACM. <a href=\"https://doi.org/10.1145/1181775.1181790\">https://doi.org/10.1145/1181775.1181790</a>","ama":"Gulavani B, Henzinger TA, Kannan Y, Nori A, Rajamani S. Synergy: A new algorithm for property checking. In: ACM; 2006:117-127. doi:<a href=\"https://doi.org/10.1145/1181775.1181790\">10.1145/1181775.1181790</a>","short":"B. Gulavani, T.A. Henzinger, Y. Kannan, A. Nori, S. Rajamani, in:, ACM, 2006, pp. 117–127."},"publist_id":"206","month":"01","extern":1,"day":"01","date_created":"2018-12-11T12:09:18Z","author":[{"last_name":"Gulavani","first_name":"Bhargav","full_name":"Gulavani, Bhargav S"},{"orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Kannan, Yamini","first_name":"Yamini","last_name":"Kannan"},{"full_name":"Nori, Aditya V","last_name":"Nori","first_name":"Aditya"},{"full_name":"Rajamani, Sriram K","first_name":"Sriram","last_name":"Rajamani"}]}]