[{"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Both Gram-positive and Gram-negative bacteria contain bactoprenol-dependent biosynthetic pathways expressing non-essential cell surface polysaccharides that function as virulence factors. Although these polymers are not required for bacterial viability in vitro, genes in many of the biosynthetic pathways are conditionally essential: they cannot be deleted except in strains incapable of initiating polymer synthesis. We report a cell-based, pathway-specific strategy to screen for small molecule inhibitors of conditionally essential enzymes. The screen identifies molecules that prevent the growth of a wildtype bacterial strain but do not affect the growth of a mutant strain incapable of initiating polymer synthesis. We have applied this approach to discover inhibitors of wall teichoic acid (WTA) biosynthesis in Staphylococcus aureus. WTAs are anionic cell surface polysaccharides required for host colonization that have been suggested as targets for new antimicrobials. We have identified a small molecule, 7-chloro-N,N-diethyl-3-(phenylsulfonyl)-[1,2,3]triazolo[1,5-a]quinolin-5-amine (1835F03), that inhibits the growth of a panel of S. aureus strains (MIC = 1−3 μg mL−1), including clinical methicillin-resistant S. aureus (MRSA) isolates. Using a combination of biochemistry and genetics, we have identified the molecular target as TarG, the transmembrane component of the ABC transporter that exports WTAs to the cell surface. We also show that preventing the completion of WTA biosynthesis once it has been initiated triggers growth arrest. The discovery of 1835F03 validates our chemical genetics strategy for identifying inhibitors of conditionally essential enzymes, and the strategy should be applicable to many other bactoprenol-dependent biosynthetic pathways in the pursuit of novel antibacterials and probes of bacterial stress responses."}],"date_published":"2009-08-18T00:00:00Z","intvolume":"         4","status":"public","date_updated":"2021-01-12T07:55:25Z","publication_status":"published","date_created":"2018-12-11T12:07:41Z","author":[{"last_name":"Swoboda","full_name":"Swoboda, Jonathan","first_name":"Jonathan"},{"last_name":"Meredith","first_name":"Timothy","full_name":"Meredith, Timothy"},{"last_name":"Campbell","first_name":"Jennifer","full_name":"Campbell, Jennifer"},{"last_name":"Brown","first_name":"Stephanie","full_name":"Brown, Stephanie"},{"last_name":"Suzuki","full_name":"Suzuki, Takashi","first_name":"Takashi"},{"full_name":"Bollenbach, Mark Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","first_name":"Mark Tobias","orcid":"0000-0003-4398-476X","last_name":"Bollenbach"},{"full_name":"Malhowski, Amy","first_name":"Amy","last_name":"Malhowski"},{"last_name":"Kishony","first_name":"Roy","full_name":"Kishony, Roy"},{"full_name":"Gilmore, Michael","first_name":"Michael","last_name":"Gilmore"},{"last_name":"Walker","full_name":"Walker, Suzanne","first_name":"Suzanne"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"4223","issue":"10","citation":{"short":"J. Swoboda, T. Meredith, J. Campbell, S. Brown, T. Suzuki, M.T. Bollenbach, A. Malhowski, R. Kishony, M. Gilmore, S. Walker, ACS Chemical Biology 4 (2009) 875–883.","ista":"Swoboda J, Meredith T, Campbell J, Brown S, Suzuki T, Bollenbach MT, Malhowski A, Kishony R, Gilmore M, Walker S. 2009. Discovery of a Small Molecule that Blocks Wall Teichoic Acid Biosynthesis in Staphylococcus aureus. ACS Chemical Biology. 4(10), 875–883.","mla":"Swoboda, Jonathan, et al. “Discovery of a Small Molecule That Blocks Wall Teichoic Acid Biosynthesis in Staphylococcus Aureus.” <i>ACS Chemical Biology</i>, vol. 4, no. 10, American Chemical Society, 2009, pp. 875–83, doi:<a href=\"https://doi.org/10.1021/cb900151k\">10.1021/cb900151k</a>.","apa":"Swoboda, J., Meredith, T., Campbell, J., Brown, S., Suzuki, T., Bollenbach, M. T., … Walker, S. (2009). Discovery of a Small Molecule that Blocks Wall Teichoic Acid Biosynthesis in Staphylococcus aureus. <i>ACS Chemical Biology</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/cb900151k\">https://doi.org/10.1021/cb900151k</a>","ieee":"J. Swoboda <i>et al.</i>, “Discovery of a Small Molecule that Blocks Wall Teichoic Acid Biosynthesis in Staphylococcus aureus,” <i>ACS Chemical Biology</i>, vol. 4, no. 10. American Chemical Society, pp. 875–883, 2009.","ama":"Swoboda J, Meredith T, Campbell J, et al. Discovery of a Small Molecule that Blocks Wall Teichoic Acid Biosynthesis in Staphylococcus aureus. <i>ACS Chemical Biology</i>. 2009;4(10):875-883. doi:<a href=\"https://doi.org/10.1021/cb900151k\">10.1021/cb900151k</a>","chicago":"Swoboda, Jonathan, Timothy Meredith, Jennifer Campbell, Stephanie Brown, Takashi Suzuki, Mark Tobias Bollenbach, Amy Malhowski, Roy Kishony, Michael Gilmore, and Suzanne Walker. “Discovery of a Small Molecule That Blocks Wall Teichoic Acid Biosynthesis in Staphylococcus Aureus.” <i>ACS Chemical Biology</i>. American Chemical Society, 2009. <a href=\"https://doi.org/10.1021/cb900151k\">https://doi.org/10.1021/cb900151k</a>."},"year":"2009","oa_version":"None","volume":4,"doi":"10.1021/cb900151k","day":"18","publisher":"American Chemical Society","page":"875 - 883","type":"journal_article","title":"Discovery of a Small Molecule that Blocks Wall Teichoic Acid Biosynthesis in Staphylococcus aureus","publication":"ACS Chemical Biology","article_processing_charge":"No","main_file_link":[{"url":"10.1021/cb900151k [doi]"}],"extern":"1","month":"08","publist_id":"1894"},{"date_updated":"2021-01-12T07:55:27Z","status":"public","date_published":"2009-01-01T00:00:00Z","quality_controlled":0,"abstract":[{"lang":"eng","text":"Suppressive drug interactions, in which one antibiotic can actually help bacterial cells to grow faster in the presence of another, occur between protein and DNA synthesis inhibitors. Here, we show that this suppression results from nonoptimal regulation of ribosomal genes in the presence of DNA stress. Using GFP-tagged transcription reporters in Escherichia coli, we find that ribosomal genes are not directly regulated by DNA stress, leading to an imbalance between cellular DNA and protein content. To test whether ribosomal gene expression under DNA stress is nonoptimal for growth rate, we sequentially deleted up to six of the seven ribosomal RNA operons. These synthetic manipulations of ribosomal gene expression correct the protein-DNA imbalance, lead to improved survival and growth, and completely remove the suppressive drug interaction. A simple mathematical model explains the nonoptimal regulation in different nutrient environments. These results reveal the genetic mechanism underlying an important class of suppressive drug interactions."}],"intvolume":"       139","author":[{"last_name":"Bollenbach","full_name":"Bollenbach, Tobias","first_name":"Tobias"},{"last_name":"Quan","full_name":"Quan, Selwyn","first_name":"Selwyn"},{"id":"3464AE84-F248-11E8-B48F-1D18A9856A87","full_name":"Remy Chait","first_name":"Remy P","orcid":"0000-0003-0876-3187","last_name":"Chait"},{"first_name":"Roy","full_name":"Kishony, Roy","last_name":"Kishony"}],"date_created":"2018-12-11T12:07:43Z","publication_status":"published","type":"journal_article","title":"Nonoptimal Microbial Response to Antibiotics Underlies Suppressive Drug Interactions","publisher":"Cell Press","day":"01","doi":"10.1016/j.cell.2009.10.025","page":"707 - 718","volume":139,"issue":"4","_id":"4228","citation":{"chicago":"Bollenbach, Tobias, Selwyn Quan, Remy P Chait, and Roy Kishony. “Nonoptimal Microbial Response to Antibiotics Underlies Suppressive Drug Interactions.” <i>Cell</i>. Cell Press, 2009. <a href=\"https://doi.org/10.1016/j.cell.2009.10.025\">https://doi.org/10.1016/j.cell.2009.10.025</a>.","ama":"Bollenbach T, Quan S, Chait RP, Kishony R. Nonoptimal Microbial Response to Antibiotics Underlies Suppressive Drug Interactions. <i>Cell</i>. 2009;139(4):707-718. doi:<a href=\"https://doi.org/10.1016/j.cell.2009.10.025\">10.1016/j.cell.2009.10.025</a>","apa":"Bollenbach, T., Quan, S., Chait, R. P., &#38; Kishony, R. (2009). Nonoptimal Microbial Response to Antibiotics Underlies Suppressive Drug Interactions. <i>Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cell.2009.10.025\">https://doi.org/10.1016/j.cell.2009.10.025</a>","mla":"Bollenbach, Tobias, et al. “Nonoptimal Microbial Response to Antibiotics Underlies Suppressive Drug Interactions.” <i>Cell</i>, vol. 139, no. 4, Cell Press, 2009, pp. 707–18, doi:<a href=\"https://doi.org/10.1016/j.cell.2009.10.025\">10.1016/j.cell.2009.10.025</a>.","ista":"Bollenbach T, Quan S, Chait RP, Kishony R. 2009. Nonoptimal Microbial Response to Antibiotics Underlies Suppressive Drug Interactions. Cell. 139(4), 707–718.","ieee":"T. Bollenbach, S. Quan, R. P. Chait, and R. Kishony, “Nonoptimal Microbial Response to Antibiotics Underlies Suppressive Drug Interactions,” <i>Cell</i>, vol. 139, no. 4. Cell Press, pp. 707–718, 2009.","short":"T. Bollenbach, S. Quan, R.P. Chait, R. Kishony, Cell 139 (2009) 707–718."},"year":"2009","month":"01","publist_id":"1890","extern":1,"publication":"Cell"},{"publication":"Genetics","publist_id":"1882","volume":181,"citation":{"ama":"Barton NH, De Vladar H. Statistical mechanics and the evolution of polygenic quantitative traits. <i>Genetics</i>. 2009;181(3):997-1011. doi:<a href=\"https://doi.org/10.1534/genetics.108.099309\">10.1534/genetics.108.099309</a>","chicago":"Barton, Nicholas H, and Harold De Vladar. “Statistical Mechanics and the Evolution of Polygenic Quantitative Traits.” <i>Genetics</i>. Genetics Society of America, 2009. <a href=\"https://doi.org/10.1534/genetics.108.099309\">https://doi.org/10.1534/genetics.108.099309</a>.","short":"N.H. Barton, H. De Vladar, Genetics 181 (2009) 997–1011.","ista":"Barton NH, De Vladar H. 2009. Statistical mechanics and the evolution of polygenic quantitative traits. Genetics. 181(3), 997–1011.","apa":"Barton, N. H., &#38; De Vladar, H. (2009). Statistical mechanics and the evolution of polygenic quantitative traits. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.108.099309\">https://doi.org/10.1534/genetics.108.099309</a>","mla":"Barton, Nicholas H., and Harold De Vladar. “Statistical Mechanics and the Evolution of Polygenic Quantitative Traits.” <i>Genetics</i>, vol. 181, no. 3, Genetics Society of America, 2009, pp. 997–1011, doi:<a href=\"https://doi.org/10.1534/genetics.108.099309\">10.1534/genetics.108.099309</a>.","ieee":"N. H. Barton and H. De Vladar, “Statistical mechanics and the evolution of polygenic quantitative traits,” <i>Genetics</i>, vol. 181, no. 3. Genetics Society of America, pp. 997–1011, 2009."},"type":"journal_article","doi":"10.1534/genetics.108.099309","publisher":"Genetics Society of America","day":"01","page":"997 - 1011","department":[{"_id":"NiBa"}],"date_created":"2018-12-11T12:07:44Z","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"       181","corr_author":"1","external_id":{"isi":["000270213500018"]},"date_updated":"2025-09-30T09:52:35Z","article_processing_charge":"No","month":"03","oa_version":"None","issue":"3","_id":"4231","year":"2009","title":"Statistical mechanics and the evolution of polygenic quantitative traits","author":[{"orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"},{"first_name":"Harold","full_name":"De Vladar, Harold","last_name":"De Vladar"}],"publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"status":"public","date_published":"2009-03-01T00:00:00Z","scopus_import":"1","abstract":[{"lang":"eng","text":"The evolution of quantitative characters depends on the frequencies of the alleles involved, yet these frequencies cannot usually be measured. Previous groups have proposed an approximation to the dynamics of quantitative traits, based on an analogy with statistical mechanics. We present a modified version of that approach, which makes the analogy more precise and applies quite generally to describe the evolution of allele frequencies. We calculate explicitly how the macroscopic quantities (i.e., quantities that depend on the quantitative trait) depend on evolutionary forces, in a way that is independent of the microscopic details. We first show that the stationary distribution of allele frequencies under drift, selection, and mutation maximizes a certain measure of entropy, subject to constraints on the expectation of observable quantities. We then approximate the dynamical changes in these expectations, assuming that the distribution of allele frequencies always maximizes entropy, conditional on the expected values. When applied to directional selection on an additive trait, this gives a very good approximation to the evolution of the trait mean and the genetic variance, when the number of mutations per generation is sufficiently high (4Nμ &gt; 1). We show how the method can be modified for small mutation rates (4Nμ → 0). We outline how this method describes epistatic interactions as, for example, with stabilizing selection."}],"acknowledgement":"N.B. was supported by the Engineering and Physical Sciences Research Council (GR/T11753 and GR/T19537) and by the Royal Society.\r\nWe are grateful to Ellen Baake for helping to initiate this project and for her comments on this manuscript. We also thank Michael Turelli for his comments on the manuscript and I. Pen for discussions and support in this project. This project was a result of a collaboration supported by the European Science Foundation grant “Integrating population genetics and conservation biology.” "},{"oa_version":"None","citation":{"ama":"de Vladar H. Stochasticity and Variability in the dynamics and genetics of populations. 2009.","chicago":"Vladar, Harold de. “Stochasticity and Variability in the Dynamics and Genetics of Populations.” Faculty of mathematical and natural sciences, University of Groningen, 2009.","short":"H. de Vladar, Stochasticity and Variability in the Dynamics and Genetics of Populations, Faculty of mathematical and natural sciences, University of Groningen, 2009.","mla":"de Vladar, Harold. <i>Stochasticity and Variability in the Dynamics and Genetics of Populations</i>. Faculty of mathematical and natural sciences, University of Groningen, 2009.","apa":"de Vladar, H. (2009). <i>Stochasticity and Variability in the dynamics and genetics of populations</i>. Faculty of mathematical and natural sciences, University of Groningen.","ista":"de Vladar H. 2009. Stochasticity and Variability in the dynamics and genetics of populations. Faculty of mathematical and natural sciences, University of Groningen.","ieee":"H. de Vladar, “Stochasticity and Variability in the dynamics and genetics of populations,” Faculty of mathematical and natural sciences, University of Groningen, 2009."},"_id":"4232","year":"2009","type":"dissertation","title":"Stochasticity and Variability in the dynamics and genetics of populations","day":"01","publisher":"Faculty of mathematical and natural sciences, University of Groningen","article_processing_charge":"No","month":"01","publist_id":"1883","extern":"1","status":"public","language":[{"iso":"eng"}],"date_published":"2009-01-01T00:00:00Z","date_updated":"2025-07-02T06:46:07Z","author":[{"last_name":"Vladar","orcid":"0000-0002-5985-7653","full_name":"Vladar, Harold","id":"2A181218-F248-11E8-B48F-1D18A9856A87","first_name":"Harold"}],"date_created":"2018-12-11T12:07:44Z","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publist_id":"1866","publication":"Evolution; International Journal of Organic Evolution","type":"journal_article","day":"01","publisher":"Wiley","doi":"10.1111/j.1558-5646.2009.00622.x","page":"1171 - 1190","pubrep_id":"551","volume":63,"citation":{"chicago":"Barton, Nicholas H, and Maria De Cara. “The Evolution of Strong Reproductive Isolation.” <i>Evolution; International Journal of Organic Evolution</i>. Wiley, 2009. <a href=\"https://doi.org/10.1111/j.1558-5646.2009.00622.x\">https://doi.org/10.1111/j.1558-5646.2009.00622.x</a>.","ama":"Barton NH, De Cara M. The evolution of strong reproductive isolation. <i>Evolution; International Journal of Organic Evolution</i>. 2009;63(5):1171-1190. doi:<a href=\"https://doi.org/10.1111/j.1558-5646.2009.00622.x\">10.1111/j.1558-5646.2009.00622.x</a>","ieee":"N. H. Barton and M. De Cara, “The evolution of strong reproductive isolation,” <i>Evolution; International Journal of Organic Evolution</i>, vol. 63, no. 5. Wiley, pp. 1171–1190, 2009.","mla":"Barton, Nicholas H., and Maria De Cara. “The Evolution of Strong Reproductive Isolation.” <i>Evolution; International Journal of Organic Evolution</i>, vol. 63, no. 5, Wiley, 2009, pp. 1171–90, doi:<a href=\"https://doi.org/10.1111/j.1558-5646.2009.00622.x\">10.1111/j.1558-5646.2009.00622.x</a>.","apa":"Barton, N. H., &#38; De Cara, M. (2009). The evolution of strong reproductive isolation. <i>Evolution; International Journal of Organic Evolution</i>. Wiley. <a href=\"https://doi.org/10.1111/j.1558-5646.2009.00622.x\">https://doi.org/10.1111/j.1558-5646.2009.00622.x</a>","ista":"Barton NH, De Cara M. 2009. The evolution of strong reproductive isolation. Evolution; International Journal of Organic Evolution. 63(5), 1171–1190.","short":"N.H. Barton, M. De Cara, Evolution; International Journal of Organic Evolution 63 (2009) 1171–1190."},"department":[{"_id":"NiBa"}],"file_date_updated":"2020-07-14T12:46:25Z","date_created":"2018-12-11T12:07:48Z","corr_author":"1","external_id":{"isi":["000265145800006"]},"has_accepted_license":"1","date_updated":"2025-09-30T09:52:11Z","quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":"        63","month":"05","article_processing_charge":"No","title":"The evolution of strong reproductive isolation","oa_version":"Submitted Version","_id":"4242","issue":"5","year":"2009","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"file":[{"checksum":"1920d2e25ef335833764256c1a47bbfb","file_name":"IST-2016-551-v1+1_BartonDeCaraRevNew.pdf","date_updated":"2020-07-14T12:46:25Z","content_type":"application/pdf","date_created":"2018-12-12T10:11:46Z","creator":"system","access_level":"open_access","file_id":"4903","file_size":720913,"relation":"main_file"},{"content_type":"application/pdf","creator":"system","date_created":"2018-12-12T10:11:47Z","access_level":"open_access","file_id":"4904","relation":"main_file","file_size":290160,"checksum":"c1c51bbc10d4f328fc96fc5b0e5dc25d","file_name":"IST-2016-551-v1+2_BartonDeCaraRevNewSI.pdf","date_updated":"2020-07-14T12:46:25Z"}],"author":[{"last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"last_name":"De Cara","full_name":"De Cara, Maria","first_name":"Maria"}],"publication_status":"published","ddc":["570"],"acknowledgement":"This work was supported by a Royal Society/Wolfson Research Merit award, and by a grant from the Natural Environment Research Council.\r\nWe are very grateful for insightful comments from S. P. Otto, and for helpful suggestions from the referees and the Associate Editor, Maria Servedio.","status":"public","date_published":"2009-05-01T00:00:00Z","abstract":[{"text":"Felsenstein distinguished two ways by which selection can directly strengthen isolation. First, a modifier that strengthens prezygotic isolation can be favored everywhere. This fits with the traditional view of reinforcement as an adaptation to reduce deleterious hybridization by strengthening assortative mating. Second, selection can favor association between different incompatibilities, despite recombination. We generalize this “two allele” model to follow associations among any number of incompatibilities, which may include both assortment and hybrid inviability. Our key argument is that this process, of coupling between incompatibilities, may be quite different from the usual view of reinforcement: strong isolation can evolve through the coupling of any kind of incompatibility, whether prezygotic or postzygotic. Single locus incompatibilities become coupled because associations between them increase the variance in compatibility, which in turn increases mean fitness if there is positive epistasis. Multiple incompatibilities, each maintained by epistasis, can become coupled in the same way. In contrast, a single-locus incompatibility can become coupled with loci that reduce the viability of haploid hybrids because this reduces harmful recombination. We obtain simple approximations for the limits of tight linkage, and strong assortment, and show how assortment alleles can invade through associations with other components of reproductive isolation.","lang":"eng"}],"scopus_import":"1"},{"publication":"Genetics","extern":1,"month":"01","publist_id":"1101","_id":"4357","citation":{"ama":"Bollback JP, Huelsenbeck J. Parallel genetic evolution within and between bacteriophage species of varying degrees of divergence. <i>Genetics</i>. 2009;181(1):225-234. doi:<a href=\"https://doi.org/10.1534/genetics.107.085225\">10.1534/genetics.107.085225</a>","chicago":"Bollback, Jonathan P, and John Huelsenbeck. “Parallel Genetic Evolution within and between Bacteriophage Species of Varying Degrees of Divergence.” <i>Genetics</i>. Genetics Society of America, 2009. <a href=\"https://doi.org/10.1534/genetics.107.085225\">https://doi.org/10.1534/genetics.107.085225</a>.","short":"J.P. Bollback, J. Huelsenbeck, Genetics 181 (2009) 225–234.","mla":"Bollback, Jonathan P., and John Huelsenbeck. “Parallel Genetic Evolution within and between Bacteriophage Species of Varying Degrees of Divergence.” <i>Genetics</i>, vol. 181, no. 1, Genetics Society of America, 2009, pp. 225–34, doi:<a href=\"https://doi.org/10.1534/genetics.107.085225\">10.1534/genetics.107.085225</a>.","apa":"Bollback, J. P., &#38; Huelsenbeck, J. (2009). Parallel genetic evolution within and between bacteriophage species of varying degrees of divergence. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.107.085225\">https://doi.org/10.1534/genetics.107.085225</a>","ista":"Bollback JP, Huelsenbeck J. 2009. Parallel genetic evolution within and between bacteriophage species of varying degrees of divergence. Genetics. 181(1), 225–234.","ieee":"J. P. Bollback and J. Huelsenbeck, “Parallel genetic evolution within and between bacteriophage species of varying degrees of divergence,” <i>Genetics</i>, vol. 181, no. 1. Genetics Society of America, pp. 225–234, 2009."},"issue":"1","year":"2009","volume":181,"day":"01","doi":"10.1534/genetics.107.085225","publisher":"Genetics Society of America","page":"225 - 234","type":"journal_article","title":"Parallel genetic evolution within and between bacteriophage species of varying degrees of divergence","publication_status":"published","date_created":"2018-12-11T12:08:26Z","author":[{"last_name":"Bollback","orcid":"0000-0002-4624-4612","full_name":"Jonathan Bollback","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","first_name":"Jonathan P"},{"full_name":"Huelsenbeck, John P","first_name":"John","last_name":"Huelsenbeck"}],"abstract":[{"text":"Parallel evolution is the acquisition of identical adaptive traits in independently evolving populations. Understanding whether the genetic changes underlying adaptation to a common selective environment are parallel within and between species is interesting because it sheds light on the degree of evolutionary constraints. If parallel evolution is perfect, then the implication is that forces such as functional constraints, epistasis, and pleiotropy play an important role in shaping the outcomes of adaptive evolution. In addition, population genetic theory predicts that the probability of parallel evolution will decline with an increase in the number of adaptive solutions-if a single adaptive solution exists, then parallel evolution will be observed among highly divergent species. For this reason, it is predicted that close relatives-which likely overlap more in the details of their adaptive solutions-will show more parallel evolution. By adapting three related bacteriophage species to a novel environment we find (1) a high rate of parallel genetic evolution at orthologous nucleotide and amino acid residues within species, (2) parallel beneficial mutations do not occur in a common order in which they fix or appear in an evolving population, (3) low rates of parallel evolution and convergent evolution between species, and (4) the probability of parallel and convergent evolution between species is strongly effected by divergence.","lang":"eng"}],"date_published":"2009-01-01T00:00:00Z","quality_controlled":0,"intvolume":"       181","status":"public","date_updated":"2021-01-12T07:56:22Z"},{"page":"366 - 382","day":"01","publisher":"Springer","doi":"10.1007/978-3-642-04222-5_23","title":"Combining theories with shared set operations","type":"conference","year":"2009","citation":{"chicago":"Wies, Thomas, Ruzica Piskac, and Viktor Kuncak. “Combining Theories with Shared Set Operations.” In <i>7th International Symposium on Frontiers of Combining Systems</i>, 5749:366–82. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-04222-5_23\">https://doi.org/10.1007/978-3-642-04222-5_23</a>.","ama":"Wies T, Piskac R, Kuncak V. Combining theories with shared set operations. In: <i>7th International Symposium on Frontiers of Combining Systems</i>. Vol 5749. Springer; 2009:366-382. doi:<a href=\"https://doi.org/10.1007/978-3-642-04222-5_23\">10.1007/978-3-642-04222-5_23</a>","apa":"Wies, T., Piskac, R., &#38; Kuncak, V. (2009). Combining theories with shared set operations. In <i>7th International Symposium on Frontiers of Combining Systems</i> (Vol. 5749, pp. 366–382). Trento, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-642-04222-5_23\">https://doi.org/10.1007/978-3-642-04222-5_23</a>","ista":"Wies T, Piskac R, Kuncak V. 2009. Combining theories with shared set operations. 7th International Symposium on Frontiers of Combining Systems. FroCoS: Frontiers of Combining Systems, LNCS, vol. 5749, 366–382.","mla":"Wies, Thomas, et al. “Combining Theories with Shared Set Operations.” <i>7th International Symposium on Frontiers of Combining Systems</i>, vol. 5749, Springer, 2009, pp. 366–82, doi:<a href=\"https://doi.org/10.1007/978-3-642-04222-5_23\">10.1007/978-3-642-04222-5_23</a>.","ieee":"T. Wies, R. Piskac, and V. Kuncak, “Combining theories with shared set operations,” in <i>7th International Symposium on Frontiers of Combining Systems</i>, Trento, Italy, 2009, vol. 5749, pp. 366–382.","short":"T. Wies, R. Piskac, V. Kuncak, in:, 7th International Symposium on Frontiers of Combining Systems, Springer, 2009, pp. 366–382."},"_id":"4360","volume":5749,"oa_version":"None","extern":"1","month":"01","publist_id":"1098","publication":"7th International Symposium on Frontiers of Combining Systems","article_processing_charge":"No","alternative_title":["LNCS"],"date_updated":"2025-07-02T06:21:09Z","conference":{"location":"Trento, Italy","end_date":"2009-09-18","name":"FroCoS: Frontiers of Combining Systems","start_date":"2009-09-16"},"intvolume":"      5749","language":[{"iso":"eng"}],"date_published":"2009-01-01T00:00:00Z","quality_controlled":"1","scopus_import":"1","abstract":[{"lang":"eng","text":"Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the theories share set variables and set operations. We prove a combination theorem and apply it to show the decidability of the satisfiability problem for a class of formulas obtained by applying propositional connectives to formulas belonging to: 1) Boolean Algebra with Presburger Arithmetic (with quantifiers over sets and integers), 2) weak monadic second-order logic over trees (with monadic second-order quantifiers), 3) two-variable logic with counting quantifiers (ranging over elements), 4) the Bernays-Schönfinkel-Ramsey class of first-order logic with equality (with ∃ * ∀ * quantifier prefix), and 5) the quantifier-free logic of multisets with cardinality constraints."}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:08:27Z","publication_status":"published","author":[{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas","first_name":"Thomas","last_name":"Wies"},{"last_name":"Piskac","first_name":"Ruzica","full_name":"Piskac, Ruzica"},{"full_name":"Kuncak, Viktor","first_name":"Viktor","last_name":"Kuncak"}]},{"publication":"Formalizing and Verifying Transactional Memories","extern":1,"publist_id":"1095","month":"01","citation":{"short":"V. Singh, Formalizing and Verifying Transactional Memories, EPFL Lausanne, 2009.","ieee":"V. Singh, “Formalizing and Verifying Transactional Memories,” EPFL Lausanne, 2009.","mla":"Singh, Vasu. “Formalizing and Verifying Transactional Memories.” <i>Formalizing and Verifying Transactional Memories</i>, EPFL Lausanne, 2009.","apa":"Singh, V. (2009). <i>Formalizing and Verifying Transactional Memories</i>. <i>Formalizing and Verifying Transactional Memories</i>. EPFL Lausanne.","ista":"Singh V. 2009. Formalizing and Verifying Transactional Memories. EPFL Lausanne.","ama":"Singh V. Formalizing and Verifying Transactional Memories. <i>Formalizing and Verifying Transactional Memories</i>. 2009.","chicago":"Singh, Vasu. “Formalizing and Verifying Transactional Memories.” <i>Formalizing and Verifying Transactional Memories</i>. EPFL Lausanne, 2009."},"_id":"4363","year":"2009","day":"01","publisher":"EPFL Lausanne","type":"dissertation","title":"Formalizing and Verifying Transactional Memories","publication_status":"published","date_created":"2018-12-11T12:08:28Z","author":[{"full_name":"Vasu Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu","last_name":"Singh"}],"date_published":"2009-01-01T00:00:00Z","quality_controlled":0,"status":"public","date_updated":"2021-01-12T07:56:25Z"},{"oa_version":"None","volume":5673,"citation":{"apa":"Seghir, M., Podelski, A., &#38; Wies, T. (2009). Abstraction refinement for quantified array assertions. In <i>16th International Symposium on Static Analysis</i> (Vol. 5673, pp. 3–18). Los Angeles, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-642-03237-0_3\">https://doi.org/10.1007/978-3-642-03237-0_3</a>","mla":"Seghir, Mohamed, et al. “Abstraction Refinement for Quantified Array Assertions.” <i>16th International Symposium on Static Analysis</i>, vol. 5673, Springer, 2009, pp. 3–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-03237-0_3\">10.1007/978-3-642-03237-0_3</a>.","ista":"Seghir M, Podelski A, Wies T. 2009. Abstraction refinement for quantified array assertions. 16th International Symposium on Static Analysis. SAS: Static Analysis Symposium, LNCS, vol. 5673, 3–18.","ieee":"M. Seghir, A. Podelski, and T. Wies, “Abstraction refinement for quantified array assertions,” in <i>16th International Symposium on Static Analysis</i>, Los Angeles, CA, United States, 2009, vol. 5673, pp. 3–18.","short":"M. Seghir, A. Podelski, T. Wies, in:, 16th International Symposium on Static Analysis, Springer, 2009, pp. 3–18.","chicago":"Seghir, Mohamed, Andreas Podelski, and Thomas Wies. “Abstraction Refinement for Quantified Array Assertions.” In <i>16th International Symposium on Static Analysis</i>, 5673:3–18. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-03237-0_3\">https://doi.org/10.1007/978-3-642-03237-0_3</a>.","ama":"Seghir M, Podelski A, Wies T. Abstraction refinement for quantified array assertions. In: <i>16th International Symposium on Static Analysis</i>. Vol 5673. Springer; 2009:3-18. doi:<a href=\"https://doi.org/10.1007/978-3-642-03237-0_3\">10.1007/978-3-642-03237-0_3</a>"},"_id":"4365","year":"2009","type":"conference","title":"Abstraction refinement for quantified array assertions","day":"01","doi":"10.1007/978-3-642-03237-0_3","publisher":"Springer","page":"3 - 18","article_processing_charge":"No","alternative_title":["LNCS"],"publication":"16th International Symposium on Static Analysis","month":"01","publist_id":"1094","extern":"1","status":"public","language":[{"iso":"eng"}],"abstract":[{"text":"We present an abstraction refinement technique for the verification of universally quantified array assertions such as “all elements in the array are sorted”. Our technique can be seamlessly combined with existing software model checking algorithms. We implemented our technique in the ACSAR software model checker and successfully verified quantified array assertions for both text book examples and real-life examples taken from the Linux operating system kernel.","lang":"eng"}],"date_published":"2009-01-01T00:00:00Z","intvolume":"      5673","conference":{"location":"Los Angeles, CA, United States","start_date":"2009-08-09","end_date":"2009-08-11","name":"SAS: Static Analysis Symposium"},"date_updated":"2025-07-02T06:45:01Z","author":[{"full_name":"Seghir, Mohamed","first_name":"Mohamed","last_name":"Seghir"},{"last_name":"Podelski","first_name":"Andreas","full_name":"Podelski, Andreas"},{"last_name":"Wies","first_name":"Thomas","full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T12:08:29Z","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"intvolume":"      5643","date_published":"2009-01-01T00:00:00Z","language":[{"iso":"eng"}],"status":"public","publication_identifier":{"eisbn":["978-3-642-02658-4"]},"date_updated":"2025-07-02T06:41:41Z","conference":{"location":"Grenoble, France","start_date":"2009-06-26","name":"CAV: Computer Aided Verification","end_date":"2009-07-02"},"publication_status":"published","date_created":"2018-12-11T12:08:32Z","author":[{"first_name":"Shuvendu","full_name":"Lahiri, Shuvendu","last_name":"Lahiri"},{"full_name":"Qadeer, Shaz","first_name":"Shaz","last_name":"Qadeer"},{"first_name":"Juan","full_name":"Galeotti, Juan","last_name":"Galeotti"},{"full_name":"Voung, Jan","first_name":"Jan","last_name":"Voung"},{"first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas","last_name":"Wies"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2009","citation":{"mla":"Lahiri, Shuvendu, et al. “Intra-Module Inference.” <i>21st International Conference on Computer Aided Verification</i>, vol. 5643, Springer, 2009, pp. 493–508, doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_37\">10.1007/978-3-642-02658-4_37</a>.","apa":"Lahiri, S., Qadeer, S., Galeotti, J., Voung, J., &#38; Wies, T. (2009). Intra-module inference. In <i>21st International Conference on Computer Aided Verification</i> (Vol. 5643, pp. 493–508). Grenoble, France: Springer. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_37\">https://doi.org/10.1007/978-3-642-02658-4_37</a>","ista":"Lahiri S, Qadeer S, Galeotti J, Voung J, Wies T. 2009. Intra-module inference. 21st International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 5643, 493–508.","ieee":"S. Lahiri, S. Qadeer, J. Galeotti, J. Voung, and T. Wies, “Intra-module inference,” in <i>21st International Conference on Computer Aided Verification</i>, Grenoble, France, 2009, vol. 5643, pp. 493–508.","short":"S. Lahiri, S. Qadeer, J. Galeotti, J. Voung, T. Wies, in:, 21st International Conference on Computer Aided Verification, Springer, 2009, pp. 493–508.","chicago":"Lahiri, Shuvendu, Shaz Qadeer, Juan Galeotti, Jan Voung, and Thomas Wies. “Intra-Module Inference.” In <i>21st International Conference on Computer Aided Verification</i>, 5643:493–508. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_37\">https://doi.org/10.1007/978-3-642-02658-4_37</a>.","ama":"Lahiri S, Qadeer S, Galeotti J, Voung J, Wies T. Intra-module inference. In: <i>21st International Conference on Computer Aided Verification</i>. Vol 5643. Springer; 2009:493-508. doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_37\">10.1007/978-3-642-02658-4_37</a>"},"_id":"4375","volume":5643,"oa_version":"None","page":"493 - 508","day":"01","doi":"10.1007/978-3-642-02658-4_37","publisher":"Springer","title":"Intra-module inference","type":"conference","publication":"21st International Conference on Computer Aided Verification","article_processing_charge":"No","alternative_title":["LNCS"],"extern":"1","publist_id":"1082","month":"01"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Roberto","full_name":"Lublinerman, Roberto","last_name":"Lublinerman"},{"last_name":"Chaudhuri","first_name":"Swarat","full_name":"Chaudhuri, Swarat"},{"last_name":"Cerny","first_name":"Pavol","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T12:08:32Z","publication_status":"published","date_updated":"2025-07-02T06:17:51Z","status":"public","scopus_import":"1","abstract":[{"lang":"eng","text":"We present Chorus, a high-level parallel programming model suitable for irregular, heap-manipulating applications like mesh refinement and epidemic simulations, and JChorus, an implementation of the model on top of Java. One goal of Chorus is to express the dynamic and instance-dependent patterns of memory access that are common in typical irregular applications. Its other focus is locality of effects: the property that in many of the same applications, typical imperative commands only affect small, local regions in the shared heap.\r\nChorus addresses dynamism and locality through the unifying abstraction of an object assembly: a local region in a shared data structure equipped with a short-lived, speculative thread of control. The thread of control in an assembly can only access objects within the assembly. While objects can migrate from assembly to assembly, such migration is local--i.e., objects only move from one assembly to a neighboring one--and does not lead to aliasing. Programming primitives include a merge operation, by which an assembly merges with an adjacent assembly, and a split operation, which splits an assembly into smaller ones. Our abstractions are race and deadlock-free, and inherently data-centric.\r\nWe demonstrate that Chorus and JChorus allow natural programming of several important applications exhibiting irregular data-parallelism. We also present an implementation of JChorus based on a many-to-one mapping of assemblies to lower-level threads, and report on preliminary performance numbers."}],"quality_controlled":"1","date_published":"2009-10-25T00:00:00Z","language":[{"iso":"eng"}],"intvolume":"        44","publist_id":"1083","month":"10","extern":"1","article_processing_charge":"No","publication":"ACM SIGPLAN Notices","type":"journal_article","title":"Parallel programming with object assemblies","publisher":"ACM","doi":"10.1145/1639949.164009","day":"25","page":"61 - 80","oa_version":"None","volume":44,"issue":"10","_id":"4376","citation":{"ama":"Lublinerman R, Chaudhuri S, Cerny P. Parallel programming with object assemblies. <i>ACM SIGPLAN Notices</i>. 2009;44(10):61-80. doi:<a href=\"https://doi.org/10.1145/1639949.164009\">10.1145/1639949.164009</a>","chicago":"Lublinerman, Roberto, Swarat Chaudhuri, and Pavol Cerny. “Parallel Programming with Object Assemblies.” <i>ACM SIGPLAN Notices</i>. ACM, 2009. <a href=\"https://doi.org/10.1145/1639949.164009\">https://doi.org/10.1145/1639949.164009</a>.","short":"R. Lublinerman, S. Chaudhuri, P. Cerny, ACM SIGPLAN Notices 44 (2009) 61–80.","ieee":"R. Lublinerman, S. Chaudhuri, and P. Cerny, “Parallel programming with object assemblies,” <i>ACM SIGPLAN Notices</i>, vol. 44, no. 10. ACM, pp. 61–80, 2009.","ista":"Lublinerman R, Chaudhuri S, Cerny P. 2009. Parallel programming with object assemblies. ACM SIGPLAN Notices. 44(10), 61–80.","mla":"Lublinerman, Roberto, et al. “Parallel Programming with Object Assemblies.” <i>ACM SIGPLAN Notices</i>, vol. 44, no. 10, ACM, 2009, pp. 61–80, doi:<a href=\"https://doi.org/10.1145/1639949.164009\">10.1145/1639949.164009</a>.","apa":"Lublinerman, R., Chaudhuri, S., &#38; Cerny, P. (2009). Parallel programming with object assemblies. <i>ACM SIGPLAN Notices</i>. ACM. <a href=\"https://doi.org/10.1145/1639949.164009\">https://doi.org/10.1145/1639949.164009</a>"},"year":"2009"},{"author":[{"last_name":"Hoenicke","first_name":"Jochen","full_name":"Hoenicke, Jochen"},{"full_name":"Leino, K Rustan","first_name":"K Rustan","last_name":"Leino"},{"last_name":"Podelski","full_name":"Podelski, Andreas","first_name":"Andreas"},{"last_name":"Schäf","first_name":"Martin","full_name":"Schäf, Martin"},{"last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas","first_name":"Thomas"}],"date_created":"2018-12-11T12:08:32Z","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","scopus_import":"1","abstract":[{"lang":"eng","text":"Programming errors found early are the cheapest. Tools applying to the early stage of code development exist but either they suffer from false positives (“noise”) or they require strong user interaction. We propose to avoid this deficiency by defining a new class of errors. A program fragment is doomed if its execution will inevitably fail, in whatever state it is started. We use a formal verification method to identify such errors fully automatically and, most significantly, without producing noise. We report on preliminary experiments with a prototype tool."}],"date_published":"2009-01-01T00:00:00Z","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"      5850","conference":{"location":"Eindhoven, The Netherlands","name":"FM: Formal Methods","end_date":"2009-11-06","start_date":"2009-11-02"},"date_updated":"2025-07-02T06:38:22Z","alternative_title":["LNCS"],"article_processing_charge":"No","publication":"Second World Congress on Formal Methods","publist_id":"1079","month":"01","extern":"1","oa_version":"None","volume":5850,"_id":"4377","citation":{"ama":"Hoenicke J, Leino KR, Podelski A, Schäf M, Wies T. It’s doomed; we can prove it. In: <i>Second World Congress on Formal Methods</i>. Vol 5850. Springer; 2009:338-353. doi:<a href=\"https://doi.org/10.1007/978-3-642-05089-3_22\">10.1007/978-3-642-05089-3_22</a>","chicago":"Hoenicke, Jochen, K Rustan Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “It’s Doomed; We Can Prove It.” In <i>Second World Congress on Formal Methods</i>, 5850:338–53. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-05089-3_22\">https://doi.org/10.1007/978-3-642-05089-3_22</a>.","short":"J. Hoenicke, K.R. Leino, A. Podelski, M. Schäf, T. Wies, in:, Second World Congress on Formal Methods, Springer, 2009, pp. 338–353.","apa":"Hoenicke, J., Leino, K. R., Podelski, A., Schäf, M., &#38; Wies, T. (2009). It’s doomed; we can prove it. In <i>Second World Congress on Formal Methods</i> (Vol. 5850, pp. 338–353). Eindhoven, The Netherlands: Springer. <a href=\"https://doi.org/10.1007/978-3-642-05089-3_22\">https://doi.org/10.1007/978-3-642-05089-3_22</a>","mla":"Hoenicke, Jochen, et al. “It’s Doomed; We Can Prove It.” <i>Second World Congress on Formal Methods</i>, vol. 5850, Springer, 2009, pp. 338–53, doi:<a href=\"https://doi.org/10.1007/978-3-642-05089-3_22\">10.1007/978-3-642-05089-3_22</a>.","ista":"Hoenicke J, Leino KR, Podelski A, Schäf M, Wies T. 2009. It’s doomed; we can prove it. Second World Congress on Formal Methods. FM: Formal Methods, LNCS, vol. 5850, 338–353.","ieee":"J. Hoenicke, K. R. Leino, A. Podelski, M. Schäf, and T. Wies, “It’s doomed; we can prove it,” in <i>Second World Congress on Formal Methods</i>, Eindhoven, The Netherlands, 2009, vol. 5850, pp. 338–353."},"year":"2009","type":"conference","title":"It's doomed; we can prove it","doi":"10.1007/978-3-642-05089-3_22","publisher":"Springer","day":"01","page":"338 - 353"},{"conference":{"name":"CAV: Computer Aided Verification"},"acknowledgement":"This research was supported by the Swiss National Science Foundation.","date_updated":"2021-01-12T07:56:34Z","status":"public","abstract":[{"text":"Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptions are often violated in realistic settings, as STM implementations run on relaxed memory models, with the atomicity of operations as provided by the hardware. This paper presents the first approach to verify STMs under relaxed memory models with atomicity of 32 bit loads and stores, and read-modify-write operations. We present RML, a new high-level language for expressing concurrent algorithms with a hardware-level atomicity of instructions, and whose semantics is parametrized by various relaxed memory models. We then present our tool, FOIL, which takes as input the RML description of an STM algorithm and the description of a memory model, and automatically determines the locations of fences, which if inserted, ensure the correctness of the STM algorithm under the given memory model. We use FOIL to verify DSTM, TL2, and McRT STM under the memory models of sequential consistency, total store order, partial store order, and relaxed memory order.","lang":"eng"}],"quality_controlled":0,"date_published":"2009-06-19T00:00:00Z","intvolume":"      5643","oa":1,"file":[{"file_name":"IST-2012-45-v1+1_Software_transactional_memory_on_relaxed_memory_models.pdf","date_updated":"2020-07-14T12:46:28Z","checksum":"df3c3e6306afd3f630a9146f91642f0a","file_id":"5105","relation":"main_file","file_size":265763,"content_type":"application/pdf","creator":"system","date_created":"2018-12-12T10:14:50Z","access_level":"open_access"}],"author":[{"last_name":"Guerraoui","full_name":"Guerraoui, Rachid","first_name":"Rachid"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"last_name":"Singh","first_name":"Vasu","full_name":"Vasu Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","date_created":"2018-12-11T12:08:34Z","file_date_updated":"2020-07-14T12:46:28Z","type":"conference","title":"Software transactional memory on relaxed memory models","doi":"10.1007/978-3-642-02658-4_26","publisher":"Springer","day":"19","page":"321 - 336","pubrep_id":"45","volume":5643,"_id":"4383","citation":{"chicago":"Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Software Transactional Memory on Relaxed Memory Models,” 5643:321–36. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_26\">https://doi.org/10.1007/978-3-642-02658-4_26</a>.","ama":"Guerraoui R, Henzinger TA, Singh V. Software transactional memory on relaxed memory models. In: Vol 5643. Springer; 2009:321-336. doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_26\">10.1007/978-3-642-02658-4_26</a>","ieee":"R. Guerraoui, T. A. Henzinger, and V. Singh, “Software transactional memory on relaxed memory models,” presented at the CAV: Computer Aided Verification, 2009, vol. 5643, pp. 321–336.","apa":"Guerraoui, R., Henzinger, T. A., &#38; Singh, V. (2009). Software transactional memory on relaxed memory models (Vol. 5643, pp. 321–336). Presented at the CAV: Computer Aided Verification, Springer. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_26\">https://doi.org/10.1007/978-3-642-02658-4_26</a>","ista":"Guerraoui R, Henzinger TA, Singh V. 2009. Software transactional memory on relaxed memory models. CAV: Computer Aided Verification, LNCS, vol. 5643, 321–336.","mla":"Guerraoui, Rachid, et al. <i>Software Transactional Memory on Relaxed Memory Models</i>. Vol. 5643, Springer, 2009, pp. 321–36, doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_26\">10.1007/978-3-642-02658-4_26</a>.","short":"R. Guerraoui, T.A. Henzinger, V. Singh, in:, Springer, 2009, pp. 321–336."},"year":"2009","month":"06","publist_id":"1074","extern":1,"alternative_title":["LNCS"]},{"oa_version":"None","_id":"4385","citation":{"ieee":"A. Dragojevic, R. Guerraoui, A. Singh, and V. Singh, “Preventing versus curing: Avoiding conflicts in transactional memories,” in <i>Proceedings of the 28th ACM symposium on Principles of distributed computing</i>, Calgary, Canada, 2009, pp. 7–16.","ista":"Dragojevic A, Guerraoui R, Singh A, Singh V. 2009. Preventing versus curing: Avoiding conflicts in transactional memories. Proceedings of the 28th ACM symposium on Principles of distributed computing. POPL: Principles of Programming Languages, 7–16.","mla":"Dragojevic, Aleksandar, et al. “Preventing versus Curing: Avoiding Conflicts in Transactional Memories.” <i>Proceedings of the 28th ACM Symposium on Principles of Distributed Computing</i>, ACM, 2009, pp. 7–16, doi:<a href=\"https://doi.org/10.1145/1582716.1582725\">10.1145/1582716.1582725</a>.","apa":"Dragojevic, A., Guerraoui, R., Singh, A., &#38; Singh, V. (2009). Preventing versus curing: Avoiding conflicts in transactional memories. In <i>Proceedings of the 28th ACM symposium on Principles of distributed computing</i> (pp. 7–16). Calgary, Canada: ACM. <a href=\"https://doi.org/10.1145/1582716.1582725\">https://doi.org/10.1145/1582716.1582725</a>","short":"A. Dragojevic, R. Guerraoui, A. Singh, V. Singh, in:, Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, ACM, 2009, pp. 7–16.","chicago":"Dragojevic, Aleksandar, Rachid Guerraoui, Anmol Singh, and Vasu Singh. “Preventing versus Curing: Avoiding Conflicts in Transactional Memories.” In <i>Proceedings of the 28th ACM Symposium on Principles of Distributed Computing</i>, 7–16. ACM, 2009. <a href=\"https://doi.org/10.1145/1582716.1582725\">https://doi.org/10.1145/1582716.1582725</a>.","ama":"Dragojevic A, Guerraoui R, Singh A, Singh V. Preventing versus curing: Avoiding conflicts in transactional memories. In: <i>Proceedings of the 28th ACM Symposium on Principles of Distributed Computing</i>. ACM; 2009:7-16. doi:<a href=\"https://doi.org/10.1145/1582716.1582725\">10.1145/1582716.1582725</a>"},"year":"2009","type":"conference","title":"Preventing versus curing: Avoiding conflicts in transactional memories","doi":"10.1145/1582716.1582725","publisher":"ACM","day":"10","page":"7 - 16","article_processing_charge":"No","publication":"Proceedings of the 28th ACM symposium on Principles of distributed computing","month":"08","publist_id":"1070","extern":"1","status":"public","abstract":[{"lang":"eng","text":"Transactional memories are typically speculative and rely on contention managers to cure conflicts. This paper explores a complementary approach that prevents conflicts by scheduling transactions according to predictions on their access sets.\r\nWe first explore the theoretical boundaries of this approach and prove that (1) a TM scheduler with an accurate prediction can be 2-competitive with an optimal offline TM scheduler, but (2) even a slight inaccuracy in prediction makes the competitive ratio of the TM scheduler in the order of the number of transactions.\r\nWe then show that, in practice, there is room for a pragmatic approach with good average case performance. We present Shrink, a scheduler that (1) bases its prediction of transactional accesses on the access patterns of the past transactions from the same thread, and (2) uses a novel heuristic, which we call serialization affinity, to schedule transactions with a probability proportional to the current amount of contention. Shrink obtains roughly 70% accurate read and write access predictions on STMBench7 and STAMP. In our experimental evaluation, Shrink significantly improves STM performance in cases the number of executing threads is higher than the number of available CPU cores. For SwissTM, Shrink improves the performance by up to 55% on STMBench7, and up to 120% on STAMP. For TinySTM, Shrink drastically improves the performance on STMBench7 and STAMP benchmarks."}],"date_published":"2009-08-10T00:00:00Z","scopus_import":"1","quality_controlled":"1","language":[{"iso":"eng"}],"conference":{"end_date":"2009-08-12","name":"POPL: Principles of Programming Languages","start_date":"2009-08-10","location":"Calgary, Canada"},"date_updated":"2025-07-02T06:35:49Z","author":[{"last_name":"Dragojevic","first_name":"Aleksandar","full_name":"Dragojevic, Aleksandar"},{"full_name":"Guerraoui, Rachid","first_name":"Rachid","last_name":"Guerraoui"},{"last_name":"Singh","full_name":"Singh, Anmol","first_name":"Anmol"},{"full_name":"Singh, Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu","last_name":"Singh"}],"publication_status":"published","date_created":"2018-12-11T12:08:35Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"_id":"4391","citation":{"ieee":"P. Cerny and R. Alur, “Automated analysis of Java methods for confidentiality,” in <i>21st International Conference on Computer Aided Verification</i>, 2009, vol. 5643, pp. 173–187.","apa":"Cerny, P., &#38; Alur, R. (2009). Automated analysis of Java methods for confidentiality. In <i>21st International Conference on Computer Aided Verification</i> (Vol. 5643, pp. 173–187). Springer. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_16\">https://doi.org/10.1007/978-3-642-02658-4_16</a>","ista":"Cerny P, Alur R. 2009. Automated analysis of Java methods for confidentiality. 21st International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 5643, 173–187.","mla":"Cerny, Pavol, and Rajeev Alur. “Automated Analysis of Java Methods for Confidentiality.” <i>21st International Conference on Computer Aided Verification</i>, vol. 5643, Springer, 2009, pp. 173–87, doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_16\">10.1007/978-3-642-02658-4_16</a>.","short":"P. Cerny, R. Alur, in:, 21st International Conference on Computer Aided Verification, Springer, 2009, pp. 173–187.","chicago":"Cerny, Pavol, and Rajeev Alur. “Automated Analysis of Java Methods for Confidentiality.” In <i>21st International Conference on Computer Aided Verification</i>, 5643:173–87. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_16\">https://doi.org/10.1007/978-3-642-02658-4_16</a>.","ama":"Cerny P, Alur R. Automated analysis of Java methods for confidentiality. In: <i>21st International Conference on Computer Aided Verification</i>. Vol 5643. Springer; 2009:173-187. doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_16\">10.1007/978-3-642-02658-4_16</a>"},"year":"2009","oa_version":"None","volume":5643,"publisher":"Springer","doi":"10.1007/978-3-642-02658-4_16","day":"01","page":"173 - 187","type":"conference","title":"Automated analysis of Java methods for confidentiality","publication":"21st International Conference on Computer Aided Verification","article_processing_charge":"No","alternative_title":["LNCS"],"extern":"1","publist_id":"1067","month":"07","date_published":"2009-07-01T00:00:00Z","abstract":[{"text":"We address the problem of analyzing programs such as J2ME midlets for mobile devices, where a central correctness requirement concerns confidentiality of data that the user wants to keep secret. Existing software model checking tools analyze individual program executions, and are not applicable to checking confidentiality properties that require reasoning about equivalence among executions. We develop an automated analysis technique for such properties. We show that both over- and under- approximation is needed for sound analysis. Given a program and a confidentiality requirement, our technique produces a formula that is satisfiable if the requirement holds. We evaluate the approach by analyzing bytecode of a set of Java (J2ME) methods.","lang":"eng"}],"quality_controlled":"1","language":[{"iso":"eng"}],"scopus_import":"1","intvolume":"      5643","status":"public","date_updated":"2025-07-02T06:32:32Z","conference":{"name":"CAV: Computer Aided Verification"},"date_created":"2018-12-11T12:08:36Z","publication_status":"published","author":[{"last_name":"Cerny","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol"},{"last_name":"Alur","full_name":"Alur, Rajeev","first_name":"Rajeev"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"volume":5771,"citation":{"chicago":"Alur, Rajeev, Pavol Cerny, and Scott Weinstein. “Algorithmic Analysis of Array-Accessing Programs,” 5771:86–101. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-04027-6_9\">https://doi.org/10.1007/978-3-642-04027-6_9</a>.","ama":"Alur R, Cerny P, Weinstein S. Algorithmic analysis of array-accessing programs. In: Vol 5771. Springer; 2009:86-101. doi:<a href=\"https://doi.org/10.1007/978-3-642-04027-6_9\">10.1007/978-3-642-04027-6_9</a>","ieee":"R. Alur, P. Cerny, and S. Weinstein, “Algorithmic analysis of array-accessing programs,” presented at the CSL: Computer Science Logic, Coimbra, Portugal, 2009, vol. 5771, pp. 86–101.","mla":"Alur, Rajeev, et al. <i>Algorithmic Analysis of Array-Accessing Programs</i>. Vol. 5771, Springer, 2009, pp. 86–101, doi:<a href=\"https://doi.org/10.1007/978-3-642-04027-6_9\">10.1007/978-3-642-04027-6_9</a>.","apa":"Alur, R., Cerny, P., &#38; Weinstein, S. (2009). Algorithmic analysis of array-accessing programs (Vol. 5771, pp. 86–101). Presented at the CSL: Computer Science Logic, Coimbra, Portugal: Springer. <a href=\"https://doi.org/10.1007/978-3-642-04027-6_9\">https://doi.org/10.1007/978-3-642-04027-6_9</a>","ista":"Alur R, Cerny P, Weinstein S. 2009. Algorithmic analysis of array-accessing programs. CSL: Computer Science Logic, LNCS, vol. 5771, 86–101.","short":"R. Alur, P. Cerny, S. Weinstein, in:, Springer, 2009, pp. 86–101."},"type":"conference","related_material":{"record":[{"relation":"later_version","id":"2967","status":"public"}]},"day":"01","doi":"10.1007/978-3-642-04027-6_9","publisher":"Springer","page":"86 - 101","publist_id":"1056","main_file_link":[{"open_access":"1","url":"http://repository.upenn.edu/cis_reports/894/"}],"extern":"1","quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":"      5771","date_updated":"2025-09-30T08:04:32Z","date_created":"2018-12-11T12:08:40Z","oa_version":"Submitted Version","_id":"4403","year":"2009","title":"Algorithmic analysis of array-accessing programs","alternative_title":["LNCS"],"article_processing_charge":"No","month":"09","status":"public","abstract":[{"text":"For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. In this paper, we consider algorithmic verification of programs that use boolean variables, and in addition, access a single read-only array whose length is potentially unbounded, and whose elements range over a potentially unbounded data domain. We show that the reachability problem, while undecidable in general, is (1) Pspace-complete for programs in which the array-accessing for-loops are not nested, (2) decidable for a restricted class of programs with doubly-nested loops. The second result establishes connections to automata and logics defining languages over data words.","lang":"eng"}],"date_published":"2009-09-01T00:00:00Z","conference":{"location":"Coimbra, Portugal","start_date":"2009-09-07","end_date":"2009-09-11","name":"CSL: Computer Science Logic"},"author":[{"last_name":"Alur","full_name":"Alur, Rajeev","first_name":"Rajeev"},{"full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny"},{"last_name":"Weinstein","first_name":"Scott","full_name":"Weinstein, Scott"}],"publication_status":"published","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"citation":{"chicago":"Henzinger, Thomas A, Maria Mateescu, and Verena Wolf. “Sliding-Window Abstraction for Infinite Markov Chains,” 5643:337–52. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_27\">https://doi.org/10.1007/978-3-642-02658-4_27</a>.","ama":"Henzinger TA, Mateescu M, Wolf V. Sliding-window abstraction for infinite Markov chains. In: Vol 5643. Springer; 2009:337-352. doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_27\">10.1007/978-3-642-02658-4_27</a>","ieee":"T. A. Henzinger, M. Mateescu, and V. Wolf, “Sliding-window abstraction for infinite Markov chains,” presented at the CAV: Computer Aided Verification, 2009, vol. 5643, pp. 337–352.","apa":"Henzinger, T. A., Mateescu, M., &#38; Wolf, V. (2009). Sliding-window abstraction for infinite Markov chains (Vol. 5643, pp. 337–352). Presented at the CAV: Computer Aided Verification, Springer. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_27\">https://doi.org/10.1007/978-3-642-02658-4_27</a>","ista":"Henzinger TA, Mateescu M, Wolf V. 2009. Sliding-window abstraction for infinite Markov chains. CAV: Computer Aided Verification, LNCS, vol. 5643, 337–352.","mla":"Henzinger, Thomas A., et al. <i>Sliding-Window Abstraction for Infinite Markov Chains</i>. Vol. 5643, Springer, 2009, pp. 337–52, doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_27\">10.1007/978-3-642-02658-4_27</a>.","short":"T.A. Henzinger, M. Mateescu, V. Wolf, in:, Springer, 2009, pp. 337–352."},"_id":"4453","year":"2009","volume":5643,"day":"01","publisher":"Springer","doi":"10.1007/978-3-642-02658-4_27","pubrep_id":"40","page":"337 - 352","type":"conference","title":"Sliding-window abstraction for infinite Markov chains","alternative_title":["LNCS"],"main_file_link":[{"open_access":"0","url":"http://pub.ist.ac.at/%7Etah/Publications/sliding-window_abstraction_for_infinite_markov_chains.pdf"}],"extern":1,"publist_id":"278","month":"01","quality_controlled":0,"abstract":[{"lang":"eng","text":"We present an on-the-fly abstraction technique for infinite-state continuous -time Markov chains. We consider Markov chains that are specified by a finite set of transition classes. Such models naturally represent biochemical reactions and therefore play an important role in the stochastic modeling of biological systems. We approximate the transient probability distributions at various time instances by solving a sequence of dynamically constructed abstract models, each depending on the previous one. Each abstract model is a finite Markov chain that represents the behavior of the original, infinite chain during a specific time interval. Our approach provides complete information about probability distributions, not just about individual parameters like the mean. The error of each abstraction can be computed, and the precision of the abstraction refined when desired. We implemented the algorithm and demonstrate its usefulness and efficiency on several case studies from systems biology."}],"date_published":"2009-01-01T00:00:00Z","intvolume":"      5643","status":"public","date_updated":"2021-01-12T07:57:04Z","acknowledgement":"The research has been partially funded by the Swiss National Science Foundation under grant 205321-111840.","conference":{"name":"CAV: Computer Aided Verification"},"publication_status":"published","date_created":"2018-12-11T12:08:55Z","file_date_updated":"2020-07-14T12:46:30Z","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"last_name":"Mateescu","id":"3B43276C-F248-11E8-B48F-1D18A9856A87","full_name":"Maria Mateescu","first_name":"Maria"},{"full_name":"Wolf, Verena","first_name":"Verena","last_name":"Wolf"}],"file":[{"checksum":"36b974111521ea534aae294166e93a63","date_updated":"2020-07-14T12:46:30Z","file_name":"IST-2012-40-v1+1_Sliding-window_abstraction_for_infinite_markov_chains.pdf","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:12:20Z","creator":"system","file_id":"4938","relation":"main_file","file_size":804295}],"oa":1},{"date_created":"2018-12-11T12:09:21Z","publication_status":"published","author":[{"last_name":"Didier","first_name":"Frédéric","full_name":"Didier, Frédéric"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Maria Mateescu","id":"3B43276C-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","last_name":"Mateescu"},{"full_name":"Wolf, Verena","first_name":"Verena","last_name":"Wolf"}],"intvolume":"      5688","quality_controlled":0,"date_published":"2009-08-17T00:00:00Z","abstract":[{"lang":"eng","text":"Molecular noise, which arises from the randomness of the discrete events in the cell, significantly influences fundamental biological processes. Discrete -state continuous-time stochastic models (CTMC) can be used to describe such effects, but the calculation of the probabilities of certain events is computationally expensive.\nWe present a comparison of two analysis approaches for CTMC. On one hand, we estimate the probabilities of interest using repeated Gillespie simulation and determine the statistical accuracy that we obtain. On the other hand, we apply a numerical reachability analysis that approximates the probability distributions of the system at several time instances. We use examples of cellular processes to demonstrate the superiority of the reachability analysis if accurate results are required."}],"status":"public","date_updated":"2025-09-30T09:03:30Z","acknowledgement":"This research was supported in part by the Swiss National Science Foundation under grant 205321-111840 and by the Excellence Cluster on Multimodal Computing and Interaction.","conference":{"name":"CMSB: Computational Methods in Systems Biology"},"alternative_title":["LNCS"],"extern":1,"month":"08","publist_id":"189","year":"2009","_id":"4535","citation":{"ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. Approximation of event probabilities in noisy cellular processes. In: Vol 5688. Springer; 2009:173-188. doi:<a href=\"https://doi.org/10.1007/978-3-642-03845-7_12\">10.1007/978-3-642-03845-7_12</a>","chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Approximation of Event Probabilities in Noisy Cellular Processes,” 5688:173–88. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-03845-7_12\">https://doi.org/10.1007/978-3-642-03845-7_12</a>.","short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, Springer, 2009, pp. 173–188.","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Approximation of event probabilities in noisy cellular processes,” presented at the CMSB: Computational Methods in Systems Biology, 2009, vol. 5688, pp. 173–188.","ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2009. Approximation of event probabilities in noisy cellular processes. CMSB: Computational Methods in Systems Biology, LNCS, vol. 5688, 173–188.","apa":"Didier, F., Henzinger, T. A., Mateescu, M., &#38; Wolf, V. (2009). Approximation of event probabilities in noisy cellular processes (Vol. 5688, pp. 173–188). Presented at the CMSB: Computational Methods in Systems Biology, Springer. <a href=\"https://doi.org/10.1007/978-3-642-03845-7_12\">https://doi.org/10.1007/978-3-642-03845-7_12</a>","mla":"Didier, Frédéric, et al. <i>Approximation of Event Probabilities in Noisy Cellular Processes</i>. Vol. 5688, Springer, 2009, pp. 173–88, doi:<a href=\"https://doi.org/10.1007/978-3-642-03845-7_12\">10.1007/978-3-642-03845-7_12</a>."},"volume":5688,"page":"173 - 188","day":"17","doi":"10.1007/978-3-642-03845-7_12","publisher":"Springer","title":"Approximation of event probabilities in noisy cellular processes","related_material":{"record":[{"id":"3364","relation":"later_version","status":"public"}]},"type":"conference"},{"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"}],"publication_status":"published","date_created":"2018-12-11T12:09:23Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","scopus_import":"1","quality_controlled":"1","abstract":[{"text":"Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit average, or discounted sum of the transition weights. We study expressiveness and closure questions about these quantitative languages. We first show that the set of words with value greater than a threshold can be non-w-regular for deterministic limit-average and discounted-sum automata, while this set is always w-regular when the threshold is isolated (i.e., some neighborhood around the threshold contains no word). In the latter case, we prove that the w-regular language is robust against small perturbations of the transition weights. We next consider automata with transition weights 0 or 1 and show that they are as expressive as general weighted automata in the limit-average case, but not in the discounted-sum case. Third, for quantitative languages L-1 and L-2, we consider the operations max(L-1, L-2), min(L-1, L-2), and 1-L-1, which generalize the boolean operations on languages, as well as the sum L-1 + L-2. We establish the closure properties of all classes of quantitative languages with respect to these four operations.","lang":"eng"}],"date_published":"2009-01-01T00:00:00Z","language":[{"iso":"eng"}],"conference":{"name":"LICS: Logic in Computer Science"},"date_updated":"2025-09-30T09:30:59Z","article_processing_charge":"No","month":"01","publist_id":"181","extern":"1","oa_version":"None","year":"2009","citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages,” 199–208. IEEE, 2009. <a href=\"https://doi.org/10.1109/LICS.2009.16\">https://doi.org/10.1109/LICS.2009.16</a>.","ama":"Chatterjee K, Doyen L, Henzinger TA. Expressiveness and closure properties for quantitative languages. In: IEEE; 2009:199-208. doi:<a href=\"https://doi.org/10.1109/LICS.2009.16\">10.1109/LICS.2009.16</a>","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure properties for quantitative languages,” presented at the LICS: Logic in Computer Science, 2009, pp. 199–208.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2009). Expressiveness and closure properties for quantitative languages (pp. 199–208). Presented at the LICS: Logic in Computer Science, IEEE. <a href=\"https://doi.org/10.1109/LICS.2009.16\">https://doi.org/10.1109/LICS.2009.16</a>","ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. Expressiveness and closure properties for quantitative languages. LICS: Logic in Computer Science, 199–208.","mla":"Chatterjee, Krishnendu, et al. <i>Expressiveness and Closure Properties for Quantitative Languages</i>. IEEE, 2009, pp. 199–208, doi:<a href=\"https://doi.org/10.1109/LICS.2009.16\">10.1109/LICS.2009.16</a>.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, IEEE, 2009, pp. 199–208."},"_id":"4540","title":"Expressiveness and closure properties for quantitative languages","related_material":{"record":[{"status":"public","id":"3867","relation":"later_version"}]},"type":"conference","pubrep_id":"55","page":"199 - 208","publisher":"IEEE","doi":"10.1109/LICS.2009.16","day":"01"},{"date_created":"2018-12-11T12:09:23Z","file_date_updated":"2020-07-14T12:46:31Z","department":[{"_id":"KrCh"}],"has_accepted_license":"1","date_updated":"2024-10-09T20:53:55Z","corr_author":"1","quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":"      5699","publist_id":"180","publisher":"Springer","day":"10","doi":"10.1007/978-3-642-03409-1_2","pubrep_id":"39","page":"3 - 13","ec_funded":1,"type":"conference","citation":{"ama":"Chatterjee K, Doyen L, Henzinger TA. Alternating weighted automata. In: Vol 5699. Springer; 2009:3-13. doi:<a href=\"https://doi.org/10.1007/978-3-642-03409-1_2\">10.1007/978-3-642-03409-1_2</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Alternating Weighted Automata,” 5699:3–13. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-03409-1_2\">https://doi.org/10.1007/978-3-642-03409-1_2</a>.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 3–13.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Alternating weighted automata,” presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland, 2009, vol. 5699, pp. 3–13.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2009). Alternating weighted automata (Vol. 5699, pp. 3–13). Presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland: Springer. <a href=\"https://doi.org/10.1007/978-3-642-03409-1_2\">https://doi.org/10.1007/978-3-642-03409-1_2</a>","mla":"Chatterjee, Krishnendu, et al. <i>Alternating Weighted Automata</i>. Vol. 5699, Springer, 2009, pp. 3–13, doi:<a href=\"https://doi.org/10.1007/978-3-642-03409-1_2\">10.1007/978-3-642-03409-1_2</a>.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. Alternating weighted automata. FCT: Fundamentals of Computation Theory, LNCS, vol. 5699, 3–13."},"volume":5699,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"5126","relation":"main_file","file_size":164428,"content_type":"application/pdf","date_created":"2018-12-12T10:15:09Z","creator":"system","access_level":"open_access","file_name":"IST-2012-39-v1+1_Alternating_Weighted_Automata.pdf","date_updated":"2020-07-14T12:46:31Z","checksum":"e8f53abb63579de3f2bff58b2a1188e2"}],"oa":1,"publication_status":"published","project":[{"name":"Design for Embedded Systems","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373"},{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques"}],"author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"ddc":["004"],"acknowledgement":"This research was supported in part by the Swiss National Science Foundation under the Indo-Swiss Joint Research Programme, by the European Network of Excellence on Embedded Systems Design (ArtistDesign), by the European Combest, Quasimodo, and Gasics projects, by the PAI program Moves funded by the Belgian Federal Government, and by the CFV (Federated Center in Verification) funded by the F.R.S.-FNRS.","conference":{"location":"Wroclaw, Poland","start_date":"2009-09-02","name":"FCT: Fundamentals of Computation Theory","end_date":"2009-09-04"},"scopus_import":1,"date_published":"2009-09-10T00:00:00Z","abstract":[{"text":"Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real number L(w) computed as the maximal value of all runs over w, and the value of a run r is a function of the sequence of weights that appear along r. There are several natural functions to consider such as Sup, LimSup, LimInf, limit average, and discounted sum of transition weights.\r\nWe introduce alternating weighted automata in which the transitions of the runs are chosen by two players in a turn-based fashion. Each word is assigned the maximal value of a run that the first player can enforce regardless of the choices made by the second player. We survey the results about closure properties, expressiveness, and decision problems for nondeterministic weighted automata, and we extend these results to alternating weighted automata.\r\nFor quantitative languages L 1 and L 2, we consider the pointwise operations max(L 1,L 2), min(L 1,L 2), 1 − L 1, and the sum L 1 + L 2. We establish the closure properties of all classes of alternating weighted automata with respect to these four operations.\r\nWe next compare the expressive power of the various classes of alternating and nondeterministic weighted automata over infinite words. In particular, for limit average and discounted sum, we show that alternation brings more expressive power than nondeterminism.\r\nFinally, we present decidability results and open questions for the quantitative extension of the classical decision problems in automata theory: emptiness, universality, language inclusion, and language equivalence.","lang":"eng"}],"status":"public","month":"09","alternative_title":["LNCS"],"title":"Alternating weighted automata","_id":"4542","year":"2009","oa_version":"Submitted Version"}]