[{"intvolume":"      6269","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5389"},{"id":"3249","relation":"later_version","status":"public"}]},"year":"2010","publication_status":"published","ddc":["005"],"acknowledgement":"This work was partially supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","oa":1,"scopus_import":1,"alternative_title":["LNCS"],"month":"11","date_created":"2018-12-11T12:08:37Z","quality_controlled":"1","department":[{"_id":"ToHe"}],"title":"Simulation distances","has_accepted_license":"1","citation":{"mla":"Cerny, Pavol, et al. <i>Simulation Distances</i>. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–68, doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">10.1007/978-3-642-15375-4_18</a>.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances,” 6269:235–68. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">https://doi.org/10.1007/978-3-642-15375-4_18</a>.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 235–268.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2010). Simulation distances (Vol. 6269, pp. 235–268). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">https://doi.org/10.1007/978-3-642-15375-4_18</a>","ama":"Cerny P, Henzinger TA, Radhakrishna A. Simulation distances. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:235-268. doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">10.1007/978-3-642-15375-4_18</a>","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances. CONCUR: Concurrency Theory, LNCS, vol. 6269, 235–268.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–268."},"ec_funded":1,"publist_id":"1065","_id":"4393","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-642-15375-4_18","page":"235 - 268","volume":6269,"file_date_updated":"2020-07-14T12:46:28Z","pubrep_id":"42","language":[{"iso":"eng"}],"date_published":"2010-11-01T00:00:00Z","status":"public","abstract":[{"text":"Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the implementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes.","lang":"eng"}],"corr_author":"1","file":[{"checksum":"ea567903676ba8afe0507ee11313dce5","date_created":"2018-12-12T10:15:12Z","relation":"main_file","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:28Z","file_name":"IST-2012-42-v1+1_Simulation_distances.pdf","file_id":"5130","creator":"system","file_size":198913}],"conference":{"end_date":"2010-09-03","name":"CONCUR: Concurrency Theory","location":"Paris, France","start_date":"2010-08-31"},"oa_version":"Submitted Version","type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"last_name":"Cerny","full_name":"Cerny, Pavol","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna"}],"project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"day":"01","date_updated":"2026-06-18T18:41:23Z"},{"oa_version":"Submitted Version","conference":{"name":"FASE: Fundamental Approaches To Software Engineering","location":"Paphos, Cyprus","start_date":"2010-03-20","end_date":"2010-03-28"},"file":[{"file_size":312147,"creator":"system","access_level":"open_access","date_updated":"2020-07-14T12:46:29Z","file_id":"5332","file_name":"IST-2012-41-v1+1_Shape_refinement_through_explicit_heap_analysis.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:18:13Z","checksum":"7d26e59a9681487d7283eba337292b2c","relation":"main_file"}],"status":"public","abstract":[{"text":"Shape analysis is a promising technique to prove program properties about recursive data structures. The challenge is to automatically determine the data-structure type, and to supply the shape analysis with the necessary information about the data structure. We present a stepwise approach to the selection of instrumentation predicates for a TVLA-based shape analysis, which takes us a step closer towards the fully automatic verification of data structures. The approach uses two techniques to guide the refinement of shape abstractions: (1) during program exploration, an explicit heap analysis collects sample instances of the heap structures, which are used to identify the data structures that are manipulated by the program; and (2) during abstraction refinement along an infeasible error path, we consider different possible heap abstractions and choose the coarsest one that eliminates the infeasible path. We have implemented this combined approach for automatic shape refinement as an extension of the software model checker BLAST. Example programs from a data-structure library that manipulate doubly-linked lists and trees were successfully verified by our tool.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:29Z","pubrep_id":"41","date_published":"2010-04-21T00:00:00Z","language":[{"iso":"eng"}],"volume":6013,"doi":"10.1007/978-3-642-12029-9_19","page":"263 - 277","date_updated":"2021-01-12T07:56:40Z","day":"21","project":[{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publisher":"Springer","author":[{"full_name":"Beyer, Dirk","last_name":"Beyer","first_name":"Dirk"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"last_name":"Théoduloz","full_name":"Théoduloz, Grégory","first_name":"Grégory"},{"last_name":"Zufferey","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87"}],"type":"conference","month":"04","scopus_import":1,"oa":1,"alternative_title":["LNCS"],"publication_status":"published","ddc":["004"],"year":"2010","intvolume":"      6013","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"4396","publist_id":"1061","has_accepted_license":"1","citation":{"short":"D. Beyer, T.A. Henzinger, G. Théoduloz, D. Zufferey, in:, D. Rosenblum, G. Taenzer (Eds.), Springer, 2010, pp. 263–277.","ista":"Beyer D, Henzinger TA, Théoduloz G, Zufferey D. 2010. Shape refinement through explicit heap analysis. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 6013, 263–277.","ama":"Beyer D, Henzinger TA, Théoduloz G, Zufferey D. Shape refinement through explicit heap analysis. In: Rosenblum D, Taenzer G, eds. Vol 6013. Springer; 2010:263-277. doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">10.1007/978-3-642-12029-9_19</a>","apa":"Beyer, D., Henzinger, T. A., Théoduloz, G., &#38; Zufferey, D. (2010). Shape refinement through explicit heap analysis. In D. Rosenblum &#38; G. Taenzer (Eds.) (Vol. 6013, pp. 263–277). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">https://doi.org/10.1007/978-3-642-12029-9_19</a>","ieee":"D. Beyer, T. A. Henzinger, G. Théoduloz, and D. Zufferey, “Shape refinement through explicit heap analysis,” presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus, 2010, vol. 6013, pp. 263–277.","chicago":"Beyer, Dirk, Thomas A Henzinger, Grégory Théoduloz, and Damien Zufferey. “Shape Refinement through Explicit Heap Analysis.” edited by David Rosenblum and Gabriele Taenzer, 6013:263–77. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">https://doi.org/10.1007/978-3-642-12029-9_19</a>.","mla":"Beyer, Dirk, et al. <i>Shape Refinement through Explicit Heap Analysis</i>. Edited by David Rosenblum and Gabriele Taenzer, vol. 6013, Springer, 2010, pp. 263–77, doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">10.1007/978-3-642-12029-9_19</a>."},"editor":[{"last_name":"Rosenblum","full_name":"Rosenblum, David","first_name":"David"},{"last_name":"Taenzer","full_name":"Taenzer, Gabriele","first_name":"Gabriele"}],"quality_controlled":"1","department":[{"_id":"ToHe"}],"title":"Shape refinement through explicit heap analysis","date_created":"2018-12-11T12:08:38Z"},{"intvolume":"        64","external_id":{"isi":["000281636400017"]},"year":"2010","publication_status":"published","acknowledgement":"This work has made use of the resources provided by the Edinburgh Compute and Data Facility (ECDF). The ECDF is partially supported by the eDIKT initiative. NHB is supported in part by EPSRC Grant EP/E066070/1; JK is supported by EPSRC Grant EP/E066070/1; and AME is supported in part by EPSRC Grant EP/E065945/1.","scopus_import":"1","month":"09","date_created":"2018-12-11T11:46:40Z","title":"A new model for extinction and recolonization in two dimensions: Quantifying phylogeography","department":[{"_id":"NiBa"}],"quality_controlled":"1","citation":{"apa":"Barton, N. H., Kelleher, J., &#38; Etheridge, A. (2010). A new model for extinction and recolonization in two dimensions: Quantifying phylogeography. <i>Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1558-5646.2010.01019.x\">https://doi.org/10.1111/j.1558-5646.2010.01019.x</a>","ama":"Barton NH, Kelleher J, Etheridge A. A new model for extinction and recolonization in two dimensions: Quantifying phylogeography. <i>Evolution</i>. 2010;64(9):2701-2715. doi:<a href=\"https://doi.org/10.1111/j.1558-5646.2010.01019.x\">10.1111/j.1558-5646.2010.01019.x</a>","short":"N.H. Barton, J. Kelleher, A. Etheridge, Evolution 64 (2010) 2701–2715.","ista":"Barton NH, Kelleher J, Etheridge A. 2010. A new model for extinction and recolonization in two dimensions: Quantifying phylogeography. Evolution. 64(9), 2701–2715.","mla":"Barton, Nicholas H., et al. “A New Model for Extinction and Recolonization in Two Dimensions: Quantifying Phylogeography.” <i>Evolution</i>, vol. 64, no. 9, Wiley-Blackwell, 2010, pp. 2701–15, doi:<a href=\"https://doi.org/10.1111/j.1558-5646.2010.01019.x\">10.1111/j.1558-5646.2010.01019.x</a>.","ieee":"N. H. Barton, J. Kelleher, and A. Etheridge, “A new model for extinction and recolonization in two dimensions: Quantifying phylogeography,” <i>Evolution</i>, vol. 64, no. 9. Wiley-Blackwell, pp. 2701–2715, 2010.","chicago":"Barton, Nicholas H, Jerome Kelleher, and Alison Etheridge. “A New Model for Extinction and Recolonization in Two Dimensions: Quantifying Phylogeography.” <i>Evolution</i>. Wiley-Blackwell, 2010. <a href=\"https://doi.org/10.1111/j.1558-5646.2010.01019.x\">https://doi.org/10.1111/j.1558-5646.2010.01019.x</a>."},"publist_id":"2780","_id":"474","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"2701 - 2715","doi":"10.1111/j.1558-5646.2010.01019.x","article_processing_charge":"No","volume":64,"language":[{"iso":"eng"}],"date_published":"2010-09-01T00:00:00Z","corr_author":"1","abstract":[{"lang":"eng","text":"Classical models of gene flow fail in three ways: they cannot explain large-scale patterns; they predict much more genetic diversity than is observed; and they assume that loosely linked genetic loci evolve independently. We propose a new model that deals with these problems. Extinction events kill some fraction of individuals in a region. These are replaced by offspring from a small number of parents, drawn from the preexisting population. This model of evolution forwards in time corresponds to a backwards model, in which ancestral lineages jump to a new location if they are hit by an event, and may coalesce with other lineages that are hit by the same event. We derive an expression for the identity in allelic state, and show that, over scales much larger than the largest event, this converges to the classical value derived by Wright and Malécot. However, rare events that cover large areas cause low genetic diversity, large-scale patterns, and correlations in ancestry between unlinked loci."}],"status":"public","issue":"9","publication":"Evolution","oa_version":"None","type":"journal_article","author":[{"full_name":"Barton, Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240"},{"first_name":"Jerome","last_name":"Kelleher","full_name":"Kelleher, Jerome"},{"last_name":"Etheridge","full_name":"Etheridge, Alison","first_name":"Alison"}],"publisher":"Wiley-Blackwell","isi":1,"day":"01","date_updated":"2025-09-30T09:50:22Z"},{"publist_id":"7331","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"488","title":"Expressiveness of streaming string transducers","department":[{"_id":"ToHe"}],"quality_controlled":"1","date_created":"2018-12-11T11:46:45Z","citation":{"short":"R. Alur, P. Cerny, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12.","ista":"Alur R, Cerny P. 2010. Expressiveness of streaming string transducers. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 1–12.","apa":"Alur, R., &#38; Cerny, P. (2010). Expressiveness of streaming string transducers (Vol. 8, pp. 1–12). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1</a>","ama":"Alur R, Cerny P. Expressiveness of streaming string transducers. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:1-12. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">10.4230/LIPIcs.FSTTCS.2010.1</a>","ieee":"R. Alur and P. Cerny, “Expressiveness of streaming string transducers,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 1–12.","chicago":"Alur, Rajeev, and Pavol Cerny. “Expressiveness of Streaming String Transducers,” 8:1–12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1</a>.","mla":"Alur, Rajeev, and Pavol Cerny. <i>Expressiveness of Streaming String Transducers</i>. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">10.4230/LIPIcs.FSTTCS.2010.1</a>."},"has_accepted_license":"1","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"alternative_title":["LIPIcs"],"oa":1,"scopus_import":"1","publication_status":"published","ddc":["005"],"month":"01","intvolume":"         8","external_id":{"isi":["000310361000001"]},"year":"2010","day":"01","isi":1,"date_updated":"2025-09-30T09:49:32Z","type":"conference","author":[{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"},{"last_name":"Cerny","full_name":"Cerny, Pavol","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file":[{"content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:35Z","file_id":"4690","file_name":"IST-2018-948-v1+1_2011_Cerny_Expressiveness_of.pdf","creator":"system","file_size":492344,"date_created":"2018-12-12T10:08:29Z","checksum":"5845be5aa19791830f7407d8853f2df0","relation":"main_file"}],"abstract":[{"text":"Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and uses a finite set of variables that range over strings from the output alphabet. At every step, the transducer processes an input symbol, and updates all the variables in parallel using assignments whose right-hand-sides are concatenations of output symbols and variables with the restriction that a variable can be used at most once in a right-hand-side expression. It has been shown that streaming string transducers operating on strings over infinite data domains are of interest in algorithmic verification of list-processing programs, as they lead to PSPACE decision procedures for checking pre/post conditions and for checking semantic equivalence, for a well-defined class of heap-manipulating programs. In order to understand the theoretical expressiveness of streaming transducers, we focus on streaming transducers processing strings over finite alphabets, given the existence of a robust and well-studied class of &quot;regular&quot; transductions for this case. Such regular transductions can be defined either by two-way deterministic finite-state transducers, or using a logical MSO-based characterization. Our main result is that the expressiveness of streaming string transducers coincides exactly with this class of regular transductions. ","lang":"eng"}],"corr_author":"1","status":"public","oa_version":"Published Version","conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","start_date":"2010-12-15","location":"Chennai, India","end_date":"2010-12-18"},"volume":8,"page":"1 - 12","doi":"10.4230/LIPIcs.FSTTCS.2010.1","article_processing_charge":"No","language":[{"iso":"eng"}],"date_published":"2010-01-01T00:00:00Z","pubrep_id":"948","file_date_updated":"2020-07-14T12:46:35Z"},{"author":[{"first_name":"Julien","last_name":"Cristau","full_name":"Cristau, Julien"},{"full_name":"David, Claire","last_name":"David","first_name":"Claire"},{"last_name":"Horn","full_name":"Horn, Florian","id":"37327ACE-F248-11E8-B48F-1D18A9856A87","first_name":"Florian"}],"publisher":"Open Publishing Association","type":"conference","date_updated":"2026-06-18T18:51:53Z","day":"09","date_published":"2010-06-09T00:00:00Z","language":[{"iso":"eng"}],"volume":25,"page":"30 - 39","article_processing_charge":"No","doi":"10.4204/EPTCS.25.7","oa_version":"Published Version","conference":{"end_date":"2010-06-18","start_date":"2010-06-17","location":"Minori, Amalfi Coast, Italy","name":"GandALF: Games, Automata, Logic, and Formal Verification"},"publication":"Proceedings of GandALF 2010","corr_author":"1","abstract":[{"lang":"eng","text":"Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represents a hostile environment. The evolution of the system depends on the decisions of both players, supplemented by chance. In this work, we focus on the notion of randomised strategy. More specifically, we show that three natural definitions may lead to very different results: in the most general cases, an almost-surely winning situation may become almost-surely losing if the player is only allowed to use a weaker notion of strategy. In more reasonable settings, translations exist, but they require infinite memory, even in simple cases. Finally, some traditional problems becomes undecidable for the strongest type of strategies."}],"status":"public","citation":{"ieee":"J. Cristau, C. David, and F. Horn, “How do we remember the past in randomised strategies?,” in <i>Proceedings of GandALF 2010</i>, Minori, Amalfi Coast, Italy, 2010, vol. 25, pp. 30–39.","chicago":"Cristau, Julien, Claire David, and Florian Horn. “How Do We Remember the Past in Randomised Strategies?” In <i>Proceedings of GandALF 2010</i>, 25:30–39. Open Publishing Association, 2010. <a href=\"https://doi.org/10.4204/EPTCS.25.7\">https://doi.org/10.4204/EPTCS.25.7</a>.","mla":"Cristau, Julien, et al. “How Do We Remember the Past in Randomised Strategies?” <i>Proceedings of GandALF 2010</i>, vol. 25, Open Publishing Association, 2010, pp. 30–39, doi:<a href=\"https://doi.org/10.4204/EPTCS.25.7\">10.4204/EPTCS.25.7</a>.","short":"J. Cristau, C. David, F. Horn, in:, Proceedings of GandALF 2010, Open Publishing Association, 2010, pp. 30–39.","ista":"Cristau J, David C, Horn F. 2010. How do we remember the past in randomised strategies? Proceedings of GandALF 2010. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 30–39.","ama":"Cristau J, David C, Horn F. How do we remember the past in randomised strategies? In: <i>Proceedings of GandALF 2010</i>. Vol 25. Open Publishing Association; 2010:30-39. doi:<a href=\"https://doi.org/10.4204/EPTCS.25.7\">10.4204/EPTCS.25.7</a>","apa":"Cristau, J., David, C., &#38; Horn, F. (2010). How do we remember the past in randomised strategies? In <i>Proceedings of GandALF 2010</i> (Vol. 25, pp. 30–39). Minori, Amalfi Coast, Italy: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.25.7\">https://doi.org/10.4204/EPTCS.25.7</a>"},"title":"How do we remember the past in randomised strategies?","quality_controlled":"1","department":[{"_id":"KrCh"}],"date_created":"2018-12-11T11:46:45Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1006.1404"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"489","publist_id":"7332","external_id":{"arxiv":["1006.1404"]},"arxiv":1,"year":"2010","intvolume":"        25","month":"06","alternative_title":["EPTCS"],"scopus_import":"1","oa":1,"publication_status":"published","ddc":["000"]},{"intvolume":"        37","external_id":{"isi":["000286631700004"]},"year":"2010","publication_status":"published","scopus_import":"1","month":"12","date_created":"2018-12-11T11:47:01Z","title":"Doomed program points","quality_controlled":"1","department":[{"_id":"ToHe"}],"citation":{"mla":"Hoenicke, Jochen, et al. “Doomed Program Points.” <i>Formal Methods in System Design</i>, vol. 37, no. 2–3, Springer, 2010, pp. 171–99, doi:<a href=\"https://doi.org/10.1007/s10703-010-0102-0\">10.1007/s10703-010-0102-0</a>.","ieee":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, and T. Wies, “Doomed program points,” <i>Formal Methods in System Design</i>, vol. 37, no. 2–3. Springer, pp. 171–199, 2010.","chicago":"Hoenicke, Jochen, Kari Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “Doomed Program Points.” <i>Formal Methods in System Design</i>. Springer, 2010. <a href=\"https://doi.org/10.1007/s10703-010-0102-0\">https://doi.org/10.1007/s10703-010-0102-0</a>.","ama":"Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. Doomed program points. <i>Formal Methods in System Design</i>. 2010;37(2-3):171-199. doi:<a href=\"https://doi.org/10.1007/s10703-010-0102-0\">10.1007/s10703-010-0102-0</a>","apa":"Hoenicke, J., Leino, K., Podelski, A., Schäf, M., &#38; Wies, T. (2010). Doomed program points. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-010-0102-0\">https://doi.org/10.1007/s10703-010-0102-0</a>","short":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, T. Wies, Formal Methods in System Design 37 (2010) 171–199.","ista":"Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. 2010. Doomed program points. Formal Methods in System Design. 37(2–3), 171–199."},"publist_id":"7284","_id":"533","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"171 - 199","article_processing_charge":"No","doi":"10.1007/s10703-010-0102-0","volume":37,"language":[{"iso":"eng"}],"date_published":"2010-12-01T00:00:00Z","abstract":[{"text":"Any programming error that can be revealed before compiling a program saves precious time for the programmer. While integrated development environments already do a good job by detecting, e.g., data-flow abnormalities, current static analysis tools suffer from false positives (&quot;noise&quot;) or require strong user interaction. We propose to avoid this deficiency by defining a new class of errors. A program fragment is doomed if its execution will inevitably fail, regardless of which state it is started in. We use a formal verification method to identify such errors fully automatically and, most significantly, without producing noise. We report on experiments with a prototype tool.","lang":"eng"}],"corr_author":"1","status":"public","issue":"2-3","publication":"Formal Methods in System Design","oa_version":"None","type":"journal_article","author":[{"last_name":"Hoenicke","full_name":"Hoenicke, Jochen","first_name":"Jochen"},{"full_name":"Leino, Kari","last_name":"Leino","first_name":"Kari"},{"last_name":"Podelski","full_name":"Podelski, Andreas","first_name":"Andreas"},{"last_name":"Schäf","full_name":"Schäf, Martin","first_name":"Martin"},{"last_name":"Wies","full_name":"Wies, Thomas","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Springer","isi":1,"day":"01","date_updated":"2025-09-30T09:48:58Z"},{"year":"2010","pubrep_id":"24","file_date_updated":"2020-07-14T12:46:42Z","date_published":"2010-10-07T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.15479/AT:IST-2010-0004","page":"17","related_material":{"record":[{"status":"public","relation":"later_version","id":"3366"}]},"month":"10","oa_version":"Published Version","status":"public","ddc":["000","005"],"publication_status":"published","abstract":[{"lang":"eng","text":"We present an algorithmic method for the synthesis of concurrent programs that are optimal with respect to quantitative performance measures. The input consists of a sequential sketch, that is, a program that does not contain synchronization constructs, and of a parametric performance model that assigns costs to actions such as locking, context switching, and idling. The quantitative synthesis problem is to automatically introduce synchronization constructs into the sequential sketch so that both correctness is guaranteed and worst-case (or average-case) performance is optimized. Correctness is formalized as race freedom or linearizability.\r\n\r\nWe show that for worst-case performance, the problem can be modeled\r\nas a 2-player graph game with quantitative (limit-average) objectives, and\r\nfor average-case performance, as a 2 1/2 -player graph game (with probabilistic transitions). In both cases, the optimal correct program is derived from an optimal strategy in the corresponding quantitative game. We prove that the respective game problems are computationally expensive (NP-complete), and present several techniques that overcome the theoretical difficulty in cases of concurrent programs of practical interest.\r\n\r\nWe have implemented a prototype tool and used it for the automatic syn- thesis of programs that access a concurrent list. For certain parameter val- ues, our method automatically synthesizes various classical synchronization schemes for implementing a concurrent list, such as fine-grained locking or a lazy algorithm. For other parameter values, a new, hybrid synchronization style is synthesized, which uses both the lazy approach and coarse-grained locks (instead of standard fine-grained locks). The trade-off occurs because while fine-grained locking tends to decrease the cost that is due to waiting for locks, it increases cache size requirements."}],"oa":1,"file":[{"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2010-0004_IST-2010-0004.pdf","file_id":"5515","date_updated":"2020-07-14T12:46:42Z","creator":"system","file_size":429101,"date_created":"2018-12-12T11:53:53Z","checksum":"da38782d2388a6fa32109d10bb9bad67","relation":"main_file"}],"alternative_title":["IST Austria Technical Report"],"has_accepted_license":"1","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Cerny","full_name":"Cerny, Pavol","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rohit","last_name":"Singh","full_name":"Singh, Rohit"}],"publisher":"IST Austria","citation":{"apa":"Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., &#38; Singh, R. (2010). <i>Quantitative synthesis for concurrent programs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">https://doi.org/10.15479/AT:IST-2010-0004</a>","ama":"Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. <i>Quantitative Synthesis for Concurrent Programs</i>. IST Austria; 2010. doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">10.15479/AT:IST-2010-0004</a>","short":"K. Chatterjee, P. Cerny, T.A. Henzinger, A. Radhakrishna, R. Singh, Quantitative Synthesis for Concurrent Programs, IST Austria, 2010.","ista":"Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p.","mla":"Chatterjee, Krishnendu, et al. <i>Quantitative Synthesis for Concurrent Programs</i>. IST Austria, 2010, doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">10.15479/AT:IST-2010-0004</a>.","ieee":"K. Chatterjee, P. Cerny, T. A. Henzinger, A. Radhakrishna, and R. Singh, <i>Quantitative synthesis for concurrent programs</i>. IST Austria, 2010.","chicago":"Chatterjee, Krishnendu, Pavol Cerny, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. <i>Quantitative Synthesis for Concurrent Programs</i>. IST Austria, 2010. <a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">https://doi.org/10.15479/AT:IST-2010-0004</a>."},"date_created":"2018-12-12T11:39:03Z","type":"technical_report","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Quantitative synthesis for concurrent programs","_id":"5388","date_updated":"2025-04-15T08:12:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["2664-1690"]},"day":"07"},{"pubrep_id":"25","file_date_updated":"2020-07-14T12:46:42Z","date_published":"2010-06-04T00:00:00Z","language":[{"iso":"eng"}],"year":"2010","related_material":{"record":[{"id":"4393","relation":"later_version","status":"public"},{"status":"public","relation":"later_version","id":"3249"}]},"doi":"10.15479/AT:IST-2010-0003","page":"24","oa_version":"Published Version","month":"06","file":[{"date_created":"2018-12-12T11:54:25Z","checksum":"284ded99764e32a583a8ea83fcea254b","relation":"main_file","file_size":367246,"creator":"system","access_level":"open_access","date_updated":"2020-07-14T12:46:42Z","file_id":"5547","file_name":"IST-2010-0003_IST-2010-0003.pdf","content_type":"application/pdf"}],"oa":1,"alternative_title":["IST Austria Technical Report"],"publication_status":"published","ddc":["005"],"status":"public","abstract":[{"lang":"eng","text":"Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the im- plementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes."}],"has_accepted_license":"1","publisher":"IST Austria","author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"}],"citation":{"ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, <i>Simulation distances</i>. IST Austria, 2010.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. <i>Simulation Distances</i>. IST Austria, 2010. <a href=\"https://doi.org/10.15479/AT:IST-2010-0003\">https://doi.org/10.15479/AT:IST-2010-0003</a>.","mla":"Cerny, Pavol, et al. <i>Simulation Distances</i>. IST Austria, 2010, doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0003\">10.15479/AT:IST-2010-0003</a>.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, Simulation Distances, IST Austria, 2010.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances, IST Austria, 24p.","ama":"Cerny P, Henzinger TA, Radhakrishna A. <i>Simulation Distances</i>. IST Austria; 2010. doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0003\">10.15479/AT:IST-2010-0003</a>","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2010). <i>Simulation distances</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2010-0003\">https://doi.org/10.15479/AT:IST-2010-0003</a>"},"department":[{"_id":"ToHe"}],"title":"Simulation distances","type":"technical_report","date_created":"2018-12-12T11:39:03Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5389","date_updated":"2026-06-18T18:41:23Z","day":"04","publication_identifier":{"issn":["2664-1690"]}},{"has_accepted_license":"1","publisher":"IST Austria","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Fijalkow","full_name":"Fijalkow, Nathanaël","first_name":"Nathanaël"}],"citation":{"ieee":"K. Chatterjee and N. Fijalkow, <i>Topological, automata-theoretic and logical characterization of finitary languages</i>. IST Austria, 2010.","chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. <i>Topological, Automata-Theoretic and Logical Characterization of Finitary Languages</i>. IST Austria, 2010. <a href=\"https://doi.org/10.15479/AT:IST-2010-0002\">https://doi.org/10.15479/AT:IST-2010-0002</a>.","mla":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. <i>Topological, Automata-Theoretic and Logical Characterization of Finitary Languages</i>. IST Austria, 2010, doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0002\">10.15479/AT:IST-2010-0002</a>.","short":"K. Chatterjee, N. Fijalkow, Topological, Automata-Theoretic and Logical Characterization of Finitary Languages, IST Austria, 2010.","ista":"Chatterjee K, Fijalkow N. 2010. Topological, automata-theoretic and logical characterization of finitary languages, IST Austria, 21p.","apa":"Chatterjee, K., &#38; Fijalkow, N. (2010). <i>Topological, automata-theoretic and logical characterization of finitary languages</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2010-0002\">https://doi.org/10.15479/AT:IST-2010-0002</a>","ama":"Chatterjee K, Fijalkow N. <i>Topological, Automata-Theoretic and Logical Characterization of Finitary Languages</i>. IST Austria; 2010. doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0002\">10.15479/AT:IST-2010-0002</a>"},"department":[{"_id":"KrCh"}],"title":"Topological, automata-theoretic and logical characterization of finitary languages","date_created":"2018-12-12T11:39:03Z","type":"technical_report","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2020-07-14T23:04:41Z","_id":"5390","day":"04","publication_identifier":{"issn":["2664-1690"]},"pubrep_id":"26","file_date_updated":"2020-07-14T12:46:43Z","language":[{"iso":"eng"}],"date_published":"2010-06-04T00:00:00Z","year":"2010","doi":"10.15479/AT:IST-2010-0002","page":"21","oa_version":"Published Version","month":"06","file":[{"content_type":"application/pdf","file_size":395662,"creator":"system","date_updated":"2020-07-14T12:46:43Z","file_name":"IST-2010-0002_IST-2010-0002.pdf","file_id":"5532","access_level":"open_access","relation":"main_file","checksum":"283d3604d76dd4d5161585d4c8625fbe","date_created":"2018-12-12T11:54:10Z"}],"oa":1,"alternative_title":["IST Austria Technical Report"],"publication_status":"published","status":"public","ddc":["000"],"abstract":[{"text":"The class of ω regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually.” Two main strengths of the classical, infinite-limit formulation of liveness are robustness (independence from the granularity of transitions) and simplicity (abstraction of complicated time bounds). However, the classical liveness formulation suffers from the drawback that the time until something good happens may be unbounded. A stronger formulation of liveness, so-called finitary liveness, overcomes this drawback, while still retaining robustness and simplicity. Finitary liveness requires that there exists an unknown, fixed bound b such that something good happens within b transitions. In this work we consider the finitary parity and Streett (fairness) conditions. We present the topological, automata-theoretic and logical characterization of finitary languages defined by finitary parity and Streett conditions. We (a) show that the finitary parity and Streett languages are Σ2-complete; (b) present a complete characterization of the expressive power of various classes of automata with finitary and infinitary conditions (in particular we show that non-deterministic finitary parity and Streett automata cannot be determinized to deterministic finitary parity or Streett automata); and (c) show that the languages defined by non-deterministic finitary parity automata exactly characterize the star-free fragment of ωB-regular languages.","lang":"eng"}]},{"year":"2010","date_published":"2010-04-19T00:00:00Z","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:43Z","pubrep_id":"27","page":"27","doi":"10.15479/AT:IST-2010-0001","related_material":{"record":[{"id":"4390","relation":"later_version","status":"public"}]},"month":"04","oa_version":"Published Version","abstract":[{"text":"Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations does not stem from the number of variables or the program size, but rather from the large number of possible interleavings. These implementations are therefore prime candidates for model checking. We introduce an algorithm for verifying linearizability of singly-linked heap-based concurrent data structures. We consider a model consisting of an unbounded heap where each node consists an element from an unbounded data domain, with a restricted set of operations for testing and updating pointers and data elements. Our main result is that linearizability is decidable for programs that invoke a fixed number of methods, possibly in parallel. This decidable fragment covers many of the common implementation techniques — fine-grained locking, lazy synchronization, and lock-free synchronization. We also show how the technique can be used to verify optimistic implementations with the help of programmer annotations. We developed a verification tool CoLT and evaluated it on a representative sample of Java implementations of the concurrent set data structure. The tool verified linearizability of a number of implementations, found a known error in a lock-free imple- mentation and proved that the corrected version is linearizable.","lang":"eng"}],"ddc":["004"],"publication_status":"published","status":"public","alternative_title":["IST Austria Technical Report"],"oa":1,"file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:46:43Z","file_name":"IST-2010-0001_IST-2010-0001.pdf","file_id":"5505","access_level":"open_access","creator":"system","file_size":372286,"relation":"main_file","checksum":"986645caad7dd85a6a091488f6c646dc","date_created":"2018-12-12T11:53:44Z"}],"citation":{"mla":"Cerny, Pavol, et al. <i>Model Checking of Linearizability of Concurrent List Implementations</i>. IST Austria, 2010, doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0001\">10.15479/AT:IST-2010-0001</a>.","ieee":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, <i>Model checking of linearizability of concurrent list implementations</i>. IST Austria, 2010.","chicago":"Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. <i>Model Checking of Linearizability of Concurrent List Implementations</i>. IST Austria, 2010. <a href=\"https://doi.org/10.15479/AT:IST-2010-0001\">https://doi.org/10.15479/AT:IST-2010-0001</a>.","ama":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. <i>Model Checking of Linearizability of Concurrent List Implementations</i>. IST Austria; 2010. doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0001\">10.15479/AT:IST-2010-0001</a>","apa":"Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., &#38; Alur, R. (2010). <i>Model checking of linearizability of concurrent list implementations</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2010-0001\">https://doi.org/10.15479/AT:IST-2010-0001</a>","short":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, Model Checking of Linearizability of Concurrent List Implementations, IST Austria, 2010.","ista":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. 2010. Model checking of linearizability of concurrent list implementations, IST Austria, 27p."},"author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna"},{"orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","last_name":"Zufferey","full_name":"Zufferey, Damien"},{"first_name":"Swarat","last_name":"Chaudhuri","full_name":"Chaudhuri, Swarat"},{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"}],"publisher":"IST Austria","has_accepted_license":"1","type":"technical_report","date_created":"2018-12-12T11:39:04Z","title":"Model checking of linearizability of concurrent list implementations","department":[{"_id":"ToHe"}],"_id":"5391","date_updated":"2024-10-21T06:03:05Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["2664-1690"]},"day":"19"},{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"9452","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"citation":{"ieee":"A. Zemach, I. E. McDaniel, P. Silva, and D. Zilberman, “Genome-wide evolutionary analysis of eukaryotic DNA methylation,” <i>Science</i>, vol. 328, no. 5980. American Association for the Advancement of Science, pp. 916–919, 2010.","chicago":"Zemach, Assaf , Ivy E. McDaniel, Pedro Silva, and Daniel Zilberman. “Genome-Wide Evolutionary Analysis of Eukaryotic DNA Methylation.” <i>Science</i>. American Association for the Advancement of Science, 2010. <a href=\"https://doi.org/10.1126/science.1186366\">https://doi.org/10.1126/science.1186366</a>.","mla":"Zemach, Assaf, et al. “Genome-Wide Evolutionary Analysis of Eukaryotic DNA Methylation.” <i>Science</i>, vol. 328, no. 5980, American Association for the Advancement of Science, 2010, pp. 916–19, doi:<a href=\"https://doi.org/10.1126/science.1186366\">10.1126/science.1186366</a>.","short":"A. Zemach, I.E. McDaniel, P. Silva, D. Zilberman, Science 328 (2010) 916–919.","ista":"Zemach A, McDaniel IE, Silva P, Zilberman D. 2010. Genome-wide evolutionary analysis of eukaryotic DNA methylation. Science. 328(5980), 916–919.","apa":"Zemach, A., McDaniel, I. E., Silva, P., &#38; Zilberman, D. (2010). Genome-wide evolutionary analysis of eukaryotic DNA methylation. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1186366\">https://doi.org/10.1126/science.1186366</a>","ama":"Zemach A, McDaniel IE, Silva P, Zilberman D. Genome-wide evolutionary analysis of eukaryotic DNA methylation. <i>Science</i>. 2010;328(5980):916-919. doi:<a href=\"https://doi.org/10.1126/science.1186366\">10.1126/science.1186366</a>"},"pmid":1,"title":"Genome-wide evolutionary analysis of eukaryotic DNA methylation","quality_controlled":"1","department":[{"_id":"DaZi"}],"date_created":"2021-06-04T08:26:08Z","extern":"1","month":"05","article_type":"original","scopus_import":"1","publication_status":"published","external_id":{"pmid":["20395474 "]},"year":"2010","keyword":["Multidisciplinary"],"intvolume":"       328","date_updated":"2021-12-14T08:35:37Z","day":"14","publisher":"American Association for the Advancement of Science","author":[{"full_name":"Zemach, Assaf ","last_name":"Zemach","first_name":"Assaf "},{"first_name":"Ivy E.","last_name":"McDaniel","full_name":"McDaniel, Ivy E."},{"full_name":"Silva, Pedro","last_name":"Silva","first_name":"Pedro"},{"last_name":"Zilberman","full_name":"Zilberman, Daniel","orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","first_name":"Daniel"}],"type":"journal_article","oa_version":"None","issue":"5980","publication":"Science","abstract":[{"lang":"eng","text":"Eukaryotic cytosine methylation represses transcription but also occurs in the bodies of active genes, and the extent of methylation biology conservation is unclear. We quantified DNA methylation in 17 eukaryotic genomes and found that gene body methylation is conserved between plants and animals, whereas selective methylation of transposons is not. We show that methylation of plant transposons in the CHG context extends to green algae and that exclusion of histone H2A.Z from methylated DNA is conserved between plants and animals, and we present evidence for RNA-directed DNA methylation of fungal genes. Our data demonstrate that extant DNA methylation systems are mosaics of conserved and derived features, and indicate that gene body methylation is an ancient property of eukaryotic genomes."}],"status":"public","language":[{"iso":"eng"}],"date_published":"2010-05-14T00:00:00Z","volume":328,"page":"916-919","article_processing_charge":"No","doi":"10.1126/science.1186366"},{"intvolume":"       107","external_id":{"pmid":["20937895"]},"year":"2010","scopus_import":"1","article_type":"original","oa":1,"publication_status":"published","month":"10","title":"Local DNA hypomethylation activates genes in rice endosperm","department":[{"_id":"DaZi"}],"quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.1073/pnas.1009695107","open_access":"1"}],"date_created":"2021-06-07T09:31:01Z","extern":"1","citation":{"mla":"Zemach, Assaf, et al. “Local DNA Hypomethylation Activates Genes in Rice Endosperm.” <i>Proceedings of the National Academy of Sciences</i>, vol. 107, no. 43, National Academy of Sciences, 2010, pp. 18729–34, doi:<a href=\"https://doi.org/10.1073/pnas.1009695107\">10.1073/pnas.1009695107</a>.","chicago":"Zemach, Assaf, M. Yvonne Kim, Pedro Silva, Jessica A. Rodrigues, Bradley Dotson, Matthew D. Brooks, and Daniel Zilberman. “Local DNA Hypomethylation Activates Genes in Rice Endosperm.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2010. <a href=\"https://doi.org/10.1073/pnas.1009695107\">https://doi.org/10.1073/pnas.1009695107</a>.","ieee":"A. Zemach <i>et al.</i>, “Local DNA hypomethylation activates genes in rice endosperm,” <i>Proceedings of the National Academy of Sciences</i>, vol. 107, no. 43. National Academy of Sciences, pp. 18729–18734, 2010.","apa":"Zemach, A., Kim, M. Y., Silva, P., Rodrigues, J. A., Dotson, B., Brooks, M. D., &#38; Zilberman, D. (2010). Local DNA hypomethylation activates genes in rice endosperm. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1009695107\">https://doi.org/10.1073/pnas.1009695107</a>","ama":"Zemach A, Kim MY, Silva P, et al. Local DNA hypomethylation activates genes in rice endosperm. <i>Proceedings of the National Academy of Sciences</i>. 2010;107(43):18729-18734. doi:<a href=\"https://doi.org/10.1073/pnas.1009695107\">10.1073/pnas.1009695107</a>","ista":"Zemach A, Kim MY, Silva P, Rodrigues JA, Dotson B, Brooks MD, Zilberman D. 2010. Local DNA hypomethylation activates genes in rice endosperm. Proceedings of the National Academy of Sciences. 107(43), 18729–18734.","short":"A. Zemach, M.Y. Kim, P. Silva, J.A. Rodrigues, B. Dotson, M.D. Brooks, D. Zilberman, Proceedings of the National Academy of Sciences 107 (2010) 18729–18734."},"pmid":1,"publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"9485","volume":107,"page":"18729-18734","article_processing_charge":"No","doi":"10.1073/pnas.1009695107","language":[{"iso":"eng"}],"date_published":"2010-10-26T00:00:00Z","issue":"43","publication":"Proceedings of the National Academy of Sciences","abstract":[{"lang":"eng","text":"Cytosine methylation silences transposable elements in plants, vertebrates, and fungi but also regulates gene expression. Plant methylation is catalyzed by three families of enzymes, each with a preferred sequence context: CG, CHG (H = A, C, or T), and CHH, with CHH methylation targeted by the RNAi pathway. Arabidopsis thaliana endosperm, a placenta-like tissue that nourishes the embryo, is globally hypomethylated in the CG context while retaining high non-CG methylation. Global methylation dynamics in seeds of cereal crops that provide the bulk of human nutrition remain unknown. Here, we show that rice endosperm DNA is hypomethylated in all sequence contexts. Non-CG methylation is reduced evenly across the genome, whereas CG hypomethylation is localized. CHH methylation of small transposable elements is increased in embryos, suggesting that endosperm demethylation enhances transposon silencing. Genes preferentially expressed in endosperm, including those coding for major storage proteins and starch synthesizing enzymes, are frequently hypomethylated in endosperm, indicating that DNA methylation is a crucial regulator of rice endosperm biogenesis. Our data show that genome-wide reshaping of seed DNA methylation is conserved among angiosperms and has a profound effect on gene expression in cereal crops."}],"status":"public","oa_version":"Published Version","type":"journal_article","author":[{"last_name":"Zemach","full_name":"Zemach, Assaf","first_name":"Assaf"},{"full_name":"Kim, M. Yvonne","last_name":"Kim","first_name":"M. Yvonne"},{"first_name":"Pedro","last_name":"Silva","full_name":"Silva, Pedro"},{"first_name":"Jessica A.","last_name":"Rodrigues","full_name":"Rodrigues, Jessica A."},{"full_name":"Dotson, Bradley","last_name":"Dotson","first_name":"Bradley"},{"first_name":"Matthew D.","full_name":"Brooks, Matthew D.","last_name":"Brooks"},{"orcid":"0000-0002-0123-8649","first_name":"Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","full_name":"Zilberman, Daniel","last_name":"Zilberman"}],"publisher":"National Academy of Sciences","day":"26","date_updated":"2021-12-14T08:40:02Z"},{"article_processing_charge":"No","doi":"10.1016/j.cub.2010.07.007","page":"R780-R785","volume":20,"language":[{"iso":"eng"}],"date_published":"2010-09-14T00:00:00Z","status":"public","abstract":[{"text":"Cytosine methylation is an ancient process with conserved enzymology but diverse biological functions that include defense against transposable elements and regulation of gene expression. Here we will discuss the evolution and biological significance of eukaryotic DNA methylation, the likely drivers of that evolution, and major remaining mysteries.","lang":"eng"}],"publication":"Current Biology","issue":"17","oa_version":"Published Version","type":"journal_article","author":[{"first_name":"Assaf","last_name":"Zemach","full_name":"Zemach, Assaf"},{"orcid":"0000-0002-0123-8649","first_name":"Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","full_name":"Zilberman, Daniel","last_name":"Zilberman"}],"publisher":"Elsevier","day":"14","date_updated":"2021-12-14T08:52:34Z","intvolume":"        20","year":"2010","external_id":{"pmid":["20833323"]},"publication_status":"published","oa":1,"scopus_import":"1","article_type":"review","month":"09","extern":"1","date_created":"2021-06-07T09:45:27Z","main_file_link":[{"url":"https://doi.org/10.1016/j.cub.2010.07.007","open_access":"1"}],"quality_controlled":"1","department":[{"_id":"DaZi"}],"title":"Evolution of eukaryotic DNA methylation and the pursuit of safer sex","pmid":1,"citation":{"chicago":"Zemach, Assaf, and Daniel Zilberman. “Evolution of Eukaryotic DNA Methylation and the Pursuit of Safer Sex.” <i>Current Biology</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.cub.2010.07.007\">https://doi.org/10.1016/j.cub.2010.07.007</a>.","ieee":"A. Zemach and D. Zilberman, “Evolution of eukaryotic DNA methylation and the pursuit of safer sex,” <i>Current Biology</i>, vol. 20, no. 17. Elsevier, pp. R780–R785, 2010.","mla":"Zemach, Assaf, and Daniel Zilberman. “Evolution of Eukaryotic DNA Methylation and the Pursuit of Safer Sex.” <i>Current Biology</i>, vol. 20, no. 17, Elsevier, 2010, pp. R780–85, doi:<a href=\"https://doi.org/10.1016/j.cub.2010.07.007\">10.1016/j.cub.2010.07.007</a>.","ista":"Zemach A, Zilberman D. 2010. Evolution of eukaryotic DNA methylation and the pursuit of safer sex. Current Biology. 20(17), R780–R785.","short":"A. Zemach, D. Zilberman, Current Biology 20 (2010) R780–R785.","apa":"Zemach, A., &#38; Zilberman, D. (2010). Evolution of eukaryotic DNA methylation and the pursuit of safer sex. <i>Current Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cub.2010.07.007\">https://doi.org/10.1016/j.cub.2010.07.007</a>","ama":"Zemach A, Zilberman D. Evolution of eukaryotic DNA methylation and the pursuit of safer sex. <i>Current Biology</i>. 2010;20(17):R780-R785. doi:<a href=\"https://doi.org/10.1016/j.cub.2010.07.007\">10.1016/j.cub.2010.07.007</a>"},"publication_identifier":{"eissn":["1879-0445"],"issn":["0960-9822"]},"_id":"9489","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"},{"article_processing_charge":"No","doi":"10.1371/journal.pbio.1000429.s003","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"3779"}]},"year":"2010","date_published":"2010-07-20T00:00:00Z","status":"public","month":"07","oa_version":"Published Version","date_created":"2021-08-02T09:45:39Z","type":"research_data_reference","department":[{"_id":"NiBa"}],"title":"Heterosis and the drift load","author":[{"first_name":"Ulises","last_name":"Rosas","full_name":"Rosas, Ulises"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H"},{"last_name":"Copsey","full_name":"Copsey, Lucy","first_name":"Lucy"},{"first_name":"Pierre","full_name":"Barbier De Reuille, Pierre","last_name":"Barbier De Reuille"},{"first_name":"Enrico","full_name":"Coen, Enrico","last_name":"Coen"}],"publisher":"Public Library of Science","citation":{"chicago":"Rosas, Ulises, Nicholas H Barton, Lucy Copsey, Pierre Barbier De Reuille, and Enrico Coen. “Heterosis and the Drift Load.” Public Library of Science, 2010. <a href=\"https://doi.org/10.1371/journal.pbio.1000429.s003\">https://doi.org/10.1371/journal.pbio.1000429.s003</a>.","ieee":"U. Rosas, N. H. Barton, L. Copsey, P. Barbier De Reuille, and E. Coen, “Heterosis and the drift load.” Public Library of Science, 2010.","mla":"Rosas, Ulises, et al. <i>Heterosis and the Drift Load</i>. Public Library of Science, 2010, doi:<a href=\"https://doi.org/10.1371/journal.pbio.1000429.s003\">10.1371/journal.pbio.1000429.s003</a>.","ista":"Rosas U, Barton NH, Copsey L, Barbier De Reuille P, Coen E. 2010. Heterosis and the drift load, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pbio.1000429.s003\">10.1371/journal.pbio.1000429.s003</a>.","short":"U. Rosas, N.H. Barton, L. Copsey, P. Barbier De Reuille, E. Coen, (2010).","ama":"Rosas U, Barton NH, Copsey L, Barbier De Reuille P, Coen E. Heterosis and the drift load. 2010. doi:<a href=\"https://doi.org/10.1371/journal.pbio.1000429.s003\">10.1371/journal.pbio.1000429.s003</a>","apa":"Rosas, U., Barton, N. H., Copsey, L., Barbier De Reuille, P., &#38; Coen, E. (2010). Heterosis and the drift load. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.1000429.s003\">https://doi.org/10.1371/journal.pbio.1000429.s003</a>"},"day":"20","_id":"9764","date_updated":"2025-09-30T09:42:52Z","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf"},{"status":"public","abstract":[{"lang":"eng","text":"Biological traits result in part from interactions between different genetic loci. This can lead to sign epistasis, in which a beneficial adaptation involves a combination of individually deleterious or neutral mutations; in this case, a population must cross a “fitness valley” to adapt. Recombination can assist this process by combining mutations from different individuals or retard it by breaking up the adaptive combination. Here, we analyze the simplest fitness valley, in which an adaptation requires one mutation at each of two loci to provide a fitness benefit. We present a theoretical analysis of the effect of recombination on the valley-crossing process across the full spectrum of possible parameter regimes. We find that low recombination rates can speed up valley crossing relative to the asexual case, while higher recombination rates slow down valley crossing, with the transition between the two regimes occurring when the recombination rate between the loci is approximately equal to the selective advantage provided by the adaptation. In large populations, if the recombination rate is high and selection against single mutants is substantial, the time to cross the valley grows exponentially with population size, effectively meaning that the population cannot acquire the adaptation. Recombination at the optimal (low) rate can reduce the valley-crossing time by up to several orders of magnitude relative to that in an asexual population. "}],"corr_author":"1","publication":"Genetics","issue":"4","oa_version":"Submitted Version","doi":"10.1534/genetics.110.123240","article_processing_charge":"No","page":"1389 - 1410","volume":186,"language":[{"iso":"eng"}],"date_published":"2010-12-01T00:00:00Z","isi":1,"project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation"}],"day":"01","date_updated":"2025-09-30T09:47:59Z","type":"journal_article","author":[{"id":"2D0CE020-F248-11E8-B48F-1D18A9856A87","first_name":"Daniel","full_name":"Weissman, Daniel","last_name":"Weissman"},{"full_name":"Feldman, Marcus","last_name":"Feldman","first_name":"Marcus"},{"last_name":"Fisher","full_name":"Fisher, Daniel","first_name":"Daniel"}],"publisher":"Genetics Society of America","publication_status":"published","acknowledgement":"This work was supported in part by a Robert N. Noyce Stanford Graduate Fellowship and European Research Council grant 250152 (to D.B.W.) and by National Institutes of Health grant GM 28016 (to M.W.F.).\r\nWe thank Michael Desai for many ideas and discussions and are grateful to Joanna Masel and an anonymous reviewer for their helpful suggestions. ","scopus_import":"1","oa":1,"month":"12","intvolume":"       186","year":"2010","external_id":{"isi":["000285297000025"]},"ec_funded":1,"publist_id":"3337","_id":"3303","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T12:02:33Z","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2998319/","open_access":"1"}],"department":[{"_id":"NiBa"}],"quality_controlled":"1","title":"The rate of fitness-valley crossing in sexual populations","citation":{"apa":"Weissman, D., Feldman, M., &#38; Fisher, D. (2010). The rate of fitness-valley crossing in sexual populations. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.110.123240\">https://doi.org/10.1534/genetics.110.123240</a>","ama":"Weissman D, Feldman M, Fisher D. The rate of fitness-valley crossing in sexual populations. <i>Genetics</i>. 2010;186(4):1389-1410. doi:<a href=\"https://doi.org/10.1534/genetics.110.123240\">10.1534/genetics.110.123240</a>","short":"D. Weissman, M. Feldman, D. Fisher, Genetics 186 (2010) 1389–1410.","ista":"Weissman D, Feldman M, Fisher D. 2010. The rate of fitness-valley crossing in sexual populations. Genetics. 186(4), 1389–1410.","mla":"Weissman, Daniel, et al. “The Rate of Fitness-Valley Crossing in Sexual Populations.” <i>Genetics</i>, vol. 186, no. 4, Genetics Society of America, 2010, pp. 1389–410, doi:<a href=\"https://doi.org/10.1534/genetics.110.123240\">10.1534/genetics.110.123240</a>.","ieee":"D. Weissman, M. Feldman, and D. Fisher, “The rate of fitness-valley crossing in sexual populations,” <i>Genetics</i>, vol. 186, no. 4. Genetics Society of America, pp. 1389–1410, 2010.","chicago":"Weissman, Daniel, Marcus Feldman, and Daniel Fisher. “The Rate of Fitness-Valley Crossing in Sexual Populations.” <i>Genetics</i>. Genetics Society of America, 2010. <a href=\"https://doi.org/10.1534/genetics.110.123240\">https://doi.org/10.1534/genetics.110.123240</a>."}},{"date_created":"2018-12-11T12:04:12Z","quality_controlled":"1","department":[{"_id":"NiBa"}],"title":"Investigating temporal changes in hybridisation and introgression between invasive sika (Cervus nippon) and native red deer (Cervus elaphus) on the Kintyre Peninsula, Scotland","citation":{"ieee":"H. Senn, S. Goodman, G. Swanson, N. H. Barton, and J. Pemberton, “Investigating temporal changes in hybridisation and introgression between invasive sika (Cervus nippon) and native red deer (Cervus elaphus) on the Kintyre Peninsula, Scotland,” <i>Molecular Ecology</i>, vol. 19, no. 5. Wiley-Blackwell, pp. 910–924, 2010.","chicago":"Senn, Helen, Simon Goodman, Graeme Swanson, Nicholas H Barton, and Josephine Pemberton. “Investigating Temporal Changes in Hybridisation and Introgression between Invasive Sika (Cervus Nippon) and Native Red Deer (Cervus Elaphus) on the Kintyre Peninsula, Scotland.” <i>Molecular Ecology</i>. Wiley-Blackwell, 2010. <a href=\"https://doi.org/10.1111/j.1365-294X.2009.04497.x\">https://doi.org/10.1111/j.1365-294X.2009.04497.x</a>.","mla":"Senn, Helen, et al. “Investigating Temporal Changes in Hybridisation and Introgression between Invasive Sika (Cervus Nippon) and Native Red Deer (Cervus Elaphus) on the Kintyre Peninsula, Scotland.” <i>Molecular Ecology</i>, vol. 19, no. 5, Wiley-Blackwell, 2010, pp. 910–24, doi:<a href=\"https://doi.org/10.1111/j.1365-294X.2009.04497.x\">10.1111/j.1365-294X.2009.04497.x</a>.","short":"H. Senn, S. Goodman, G. Swanson, N.H. Barton, J. Pemberton, Molecular Ecology 19 (2010) 910–924.","ista":"Senn H, Goodman S, Swanson G, Barton NH, Pemberton J. 2010. Investigating temporal changes in hybridisation and introgression between invasive sika (Cervus nippon) and native red deer (Cervus elaphus) on the Kintyre Peninsula, Scotland. Molecular Ecology. 19(5), 910–924.","apa":"Senn, H., Goodman, S., Swanson, G., Barton, N. H., &#38; Pemberton, J. (2010). Investigating temporal changes in hybridisation and introgression between invasive sika (Cervus nippon) and native red deer (Cervus elaphus) on the Kintyre Peninsula, Scotland. <i>Molecular Ecology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1365-294X.2009.04497.x\">https://doi.org/10.1111/j.1365-294X.2009.04497.x</a>","ama":"Senn H, Goodman S, Swanson G, Barton NH, Pemberton J. Investigating temporal changes in hybridisation and introgression between invasive sika (Cervus nippon) and native red deer (Cervus elaphus) on the Kintyre Peninsula, Scotland. <i>Molecular Ecology</i>. 2010;19(5):910-924. doi:<a href=\"https://doi.org/10.1111/j.1365-294X.2009.04497.x\">10.1111/j.1365-294X.2009.04497.x</a>"},"publist_id":"2779","_id":"3604","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","intvolume":"        19","year":"2010","external_id":{"isi":["000274550100008"]},"publication_status":"published","scopus_import":"1","month":"03","type":"journal_article","author":[{"full_name":"Senn, Helen","last_name":"Senn","first_name":"Helen"},{"full_name":"Goodman, Simon","last_name":"Goodman","first_name":"Simon"},{"first_name":"Graeme","full_name":"Swanson, Graeme","last_name":"Swanson"},{"full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pemberton","full_name":"Pemberton, Josephine","first_name":"Josephine"}],"publisher":"Wiley-Blackwell","isi":1,"day":"01","date_updated":"2025-09-30T09:47:00Z","article_processing_charge":"No","doi":"10.1111/j.1365-294X.2009.04497.x","page":"910 - 924","volume":19,"date_published":"2010-03-01T00:00:00Z","language":[{"iso":"eng"}],"status":"public","abstract":[{"text":"We investigated temporal changes in hybridization and introgression between native red deer (Cervus elaphus) and invasive Japanese sika (Cervus nippon) on the Kintyre Peninsula, Scotland, over 15 years, through analysis of 1513 samples of deer at 20 microsatellite loci and a mtDNA marker. We found no evidence that either the proportion of recent hybrids, or the levels of introgression had changed over the study period. Nevertheless, in one population where the two species have been in contact since ∼1970, 44% of individuals sampled during the study were hybrids. This suggests that hybridization between these species can proceed fairly rapidly. By analysing the number of alleles that have introgressed from polymorphic red deer into the genetically homogenous sika population, we reconstructed the haplotypes of red deer alleles introduced by backcrossing. Five separate hybridization events could account for all the recently hybridized sika-like individuals found across a large section of the Peninsula. Although we demonstrate that low rates of F1 hybridization can lead to substantial introgression, the progress of hybridization and introgression appears to be unpredictable over the short timescales.","lang":"eng"}],"publication":"Molecular Ecology","issue":"5","oa_version":"None"},{"intvolume":"        59","external_id":{"isi":["000283453300006"]},"year":"2010","acknowledgement":" The financial support of the Deutsche Forschungsgemeinschaft (IL 20/12-1, KI 677/2-4) is gratefully acknowledged.\r\nWe thank B. H. Koller (Department of Genetics and Molecular Biology, University of North Carolina at Chapel Hill, NC, USA) for the generous supply of P2Y1−/− and P2Y2−/− mice. We are grateful to Dr. A. Schulz for reanalysing the genotype of the P2Y1−/− mice. The authors thank P. Jonas and U. Heinemann for many helpful comments and A-K. Krause, L Feige and M. Eberts for their excellent technical support.","publication_status":"published","scopus_import":"1","month":"11","date_created":"2018-12-11T12:04:47Z","title":"P2Y1 receptors inhibit long-term depression in the prefrontal cortex.","department":[{"_id":"PeJo"}],"quality_controlled":"1","citation":{"ama":"Guzmán J, Schmidt H, Franke H, et al. P2Y1 receptors inhibit long-term depression in the prefrontal cortex. <i>Neuropharmacology</i>. 2010;59(6):406-415. doi:<a href=\"https://doi.org/10.1016/j.neuropharm.2010.05.013\">10.1016/j.neuropharm.2010.05.013</a>","apa":"Guzmán, J., Schmidt, H., Franke, H., Krügel, U., Eilers, J., Illes, P., &#38; Gerevich, Z. (2010). P2Y1 receptors inhibit long-term depression in the prefrontal cortex. <i>Neuropharmacology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuropharm.2010.05.013\">https://doi.org/10.1016/j.neuropharm.2010.05.013</a>","ista":"Guzmán J, Schmidt H, Franke H, Krügel U, Eilers J, Illes P, Gerevich Z. 2010. P2Y1 receptors inhibit long-term depression in the prefrontal cortex. Neuropharmacology. 59(6), 406–415.","short":"J. Guzmán, H. Schmidt, H. Franke, U. Krügel, J. Eilers, P. Illes, Z. Gerevich, Neuropharmacology 59 (2010) 406–415.","mla":"Guzmán, José, et al. “P2Y1 Receptors Inhibit Long-Term Depression in the Prefrontal Cortex.” <i>Neuropharmacology</i>, vol. 59, no. 6, Elsevier, 2010, pp. 406–15, doi:<a href=\"https://doi.org/10.1016/j.neuropharm.2010.05.013\">10.1016/j.neuropharm.2010.05.013</a>.","chicago":"Guzmán, José, Hartmut Schmidt, Heike Franke, Ute Krügel, Jens Eilers, Peter Illes, and Zoltan Gerevich. “P2Y1 Receptors Inhibit Long-Term Depression in the Prefrontal Cortex.” <i>Neuropharmacology</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.neuropharm.2010.05.013\">https://doi.org/10.1016/j.neuropharm.2010.05.013</a>.","ieee":"J. Guzmán <i>et al.</i>, “P2Y1 receptors inhibit long-term depression in the prefrontal cortex.,” <i>Neuropharmacology</i>, vol. 59, no. 6. Elsevier, pp. 406–415, 2010."},"publist_id":"2512","_id":"3718","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"406 - 415","doi":"10.1016/j.neuropharm.2010.05.013","article_processing_charge":"No","volume":59,"date_published":"2010-11-01T00:00:00Z","language":[{"iso":"eng"}],"abstract":[{"text":"Long-term depression (LTD) is a form of synaptic plasticity that may contribute to information storage in the central nervous system. Here we report that LTD can be elicited in layer 5 pyramidal neurons of the rat prefrontal cortex by pairing low frequency stimulation with a modest postsynaptic depolarization. The induction of LTD required the activation of both metabotropic glutamate receptors of the mGlu1 subtype and voltage-sensitive Ca(2+) channels (VSCCs) of the T/R, P/Q and N types, leading to the stimulation of intracellular inositol trisphosphate (IP3) receptors by IP3 and Ca(2+). The subsequent release of Ca(2+) from intracellular stores activated the protein phosphatase cascade involving calcineurin and protein phosphatase 1. The activation of purinergic P2Y(1) receptors blocked LTD. This effect was prevented by P2Y(1) receptor antagonists and was absent in mice lacking P2Y(1) but not P2Y(2) receptors. We also found that activation of P2Y(1) receptors inhibits Ca(2+) transients via VSCCs in the apical dendrites and spines of pyramidal neurons. In addition, we show that the release of ATP under hypoxia is able to inhibit LTD by acting on postsynaptic P2Y(1) receptors. In conclusion, these data suggest that the reduction of Ca(2+) influx via VSCCs caused by the activation of P2Y(1) receptors by ATP is the possible mechanism for the inhibition of LTD in prefrontal cortex.","lang":"eng"}],"corr_author":"1","status":"public","issue":"6","publication":"Neuropharmacology","oa_version":"None","type":"journal_article","publisher":"Elsevier","author":[{"id":"30CC5506-F248-11E8-B48F-1D18A9856A87","first_name":"José","orcid":"0000-0003-2209-5242","full_name":"Guzmán, José","last_name":"Guzmán"},{"last_name":"Schmidt","full_name":"Schmidt, Hartmut","first_name":"Hartmut"},{"first_name":"Heike","last_name":"Franke","full_name":"Franke, Heike"},{"last_name":"Krügel","full_name":"Krügel, Ute","first_name":"Ute"},{"last_name":"Eilers","full_name":"Eilers, Jens","first_name":"Jens"},{"first_name":"Peter","full_name":"Illes, Peter","last_name":"Illes"},{"last_name":"Gerevich","full_name":"Gerevich, Zoltan","first_name":"Zoltan"}],"isi":1,"day":"01","date_updated":"2025-09-30T09:46:27Z"},{"day":"30","date_updated":"2026-06-18T18:39:27Z","type":"conference","publisher":"Open Publishing Association","author":[{"full_name":"Feret, Jérôme","last_name":"Feret","first_name":"Jérôme"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Koeppl, Heinz","last_name":"Koeppl","first_name":"Heinz"},{"full_name":"Petrov, Tatjana","last_name":"Petrov","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","first_name":"Tatjana","orcid":"0000-0002-9041-0905"}],"file":[{"checksum":"eaaba991a86fff37606b0eb5196878e8","date_created":"2019-01-31T12:09:09Z","relation":"main_file","file_size":907155,"creator":"kschuh","access_level":"open_access","date_updated":"2020-07-14T12:46:14Z","file_name":"Lumpability_abstractions_of_rule-based_systems.pdf","file_id":"5904","content_type":"application/pdf"}],"abstract":[{"text":"The induction of a signaling pathway is characterized by transient complex formation and mutual posttranslational modification of proteins. To faithfully capture this combinatorial process in a math- ematical model is an important challenge in systems biology. Exploiting the limited context on which most binding and modification events are conditioned, attempts have been made to reduce the com- binatorial complexity by quotienting the reachable set of molecular species, into species aggregates while preserving the deterministic semantics of the thermodynamic limit. Recently we proposed a quotienting that also preserves the stochastic semantics and that is complete in the sense that the semantics of individual species can be recovered from the aggregate semantics. In this paper we prove that this quotienting yields a sufficient condition for weak lumpability and that it gives rise to a backward Markov bisimulation between the original and aggregated transition system. We illustrate the framework on a case study of the EGF/insulin receptor crosstalk.","lang":"eng"}],"status":"public","oa_version":"Submitted Version","conference":{"end_date":"2010-08-23","name":"MECBIC: Membrane Computing and Biologically Inspired Process Calculi","start_date":"2010-08-23","location":"Jena, Germany"},"volume":40,"page":"142-161","language":[{"iso":"eng"}],"date_published":"2010-10-30T00:00:00Z","file_date_updated":"2020-07-14T12:46:14Z","publist_id":"2511","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3719","title":"Lumpability abstractions of rule-based systems","department":[{"_id":"ToHe"},{"_id":"CaGu"}],"quality_controlled":"1","date_created":"2018-12-11T12:04:47Z","citation":{"mla":"Feret, Jérôme, et al. <i>Lumpability Abstractions of Rule-Based Systems</i>. Vol. 40, Open Publishing Association, 2010, pp. 142–61.","chicago":"Feret, Jérôme, Thomas A Henzinger, Heinz Koeppl, and Tatjana Petrov. “Lumpability Abstractions of Rule-Based Systems,” 40:142–61. Open Publishing Association, 2010.","ieee":"J. Feret, T. A. Henzinger, H. Koeppl, and T. Petrov, “Lumpability abstractions of rule-based systems,” presented at the MECBIC: Membrane Computing and Biologically Inspired Process Calculi, Jena, Germany, 2010, vol. 40, pp. 142–161.","ama":"Feret J, Henzinger TA, Koeppl H, Petrov T. Lumpability abstractions of rule-based systems. In: Vol 40. Open Publishing Association; 2010:142-161.","apa":"Feret, J., Henzinger, T. A., Koeppl, H., &#38; Petrov, T. (2010). Lumpability abstractions of rule-based systems (Vol. 40, pp. 142–161). Presented at the MECBIC: Membrane Computing and Biologically Inspired Process Calculi, Jena, Germany: Open Publishing Association.","ista":"Feret J, Henzinger TA, Koeppl H, Petrov T. 2010. Lumpability abstractions of rule-based systems. MECBIC: Membrane Computing and Biologically Inspired Process Calculi, EPTCS, vol. 40, 142–161.","short":"J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, in:, Open Publishing Association, 2010, pp. 142–161."},"has_accepted_license":"1","alternative_title":["EPTCS"],"scopus_import":1,"oa":1,"publication_status":"published","ddc":["570"],"acknowledgement":"Jérôme Feret’s contribution was partially supported by the ABSTRACTCELL ANR-Chair of Excellence. Heinz Koeppl acknowledges the support from the Swiss National Science Foundation, grant no. 200020-117975/1. Tatjana Petrov acknowledges the support from SystemsX.ch, the Swiss Initiative in Systems Biology.","month":"10","related_material":{"record":[{"relation":"later_version","status":"public","id":"3168"}]},"intvolume":"        40","arxiv":1,"external_id":{"arxiv":["1011.0496"]},"year":"2010"},{"has_accepted_license":"1","citation":{"apa":"Barton, N. H. (2010). Understanding adaptation in large populations. <i>PLoS Genetics</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pgen.1000987\">https://doi.org/10.1371/journal.pgen.1000987</a>","ama":"Barton NH. Understanding adaptation in large populations. <i>PLoS Genetics</i>. 2010;6(6). doi:<a href=\"https://doi.org/10.1371/journal.pgen.1000987\">10.1371/journal.pgen.1000987</a>","short":"N.H. Barton, PLoS Genetics 6 (2010).","ista":"Barton NH. 2010. Understanding adaptation in large populations. PLoS Genetics. 6(6), e1000987.","mla":"Barton, Nicholas H. “Understanding Adaptation in Large Populations.” <i>PLoS Genetics</i>, vol. 6, no. 6, e1000987, Public Library of Science, 2010, doi:<a href=\"https://doi.org/10.1371/journal.pgen.1000987\">10.1371/journal.pgen.1000987</a>.","ieee":"N. H. Barton, “Understanding adaptation in large populations,” <i>PLoS Genetics</i>, vol. 6, no. 6. Public Library of Science, 2010.","chicago":"Barton, Nicholas H. “Understanding Adaptation in Large Populations.” <i>PLoS Genetics</i>. Public Library of Science, 2010. <a href=\"https://doi.org/10.1371/journal.pgen.1000987\">https://doi.org/10.1371/journal.pgen.1000987</a>."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"department":[{"_id":"NiBa"}],"quality_controlled":"1","title":"Understanding adaptation in large populations","date_created":"2018-12-11T12:05:05Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"3772","article_number":"e1000987","publist_id":"2454","year":"2010","external_id":{"isi":["000279805200002"]},"intvolume":"         6","month":"06","oa":1,"scopus_import":"1","ddc":["570","576"],"publication_status":"published","publisher":"Public Library of Science","author":[{"last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"type":"journal_article","date_updated":"2025-09-30T09:45:21Z","day":"17","isi":1,"pubrep_id":"524","file_date_updated":"2020-07-14T12:46:15Z","date_published":"2010-06-17T00:00:00Z","language":[{"iso":"eng"}],"volume":6,"article_processing_charge":"No","doi":"10.1371/journal.pgen.1000987","oa_version":"Published Version","file":[{"creator":"system","file_size":349965,"file_id":"5075","date_updated":"2020-07-14T12:46:15Z","file_name":"IST-2016-524-v1+1_journal.pgen.1000987.PDF","access_level":"open_access","content_type":"application/pdf","relation":"main_file","date_created":"2018-12-12T10:14:24Z","checksum":"5c14de2680ab483cb835096c99ee734d"}],"publication":"PLoS Genetics","issue":"6","status":"public","corr_author":"1"},{"type":"journal_article","publisher":"Royal Society","author":[{"first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H"}],"day":"12","isi":1,"date_updated":"2025-09-30T09:45:54Z","volume":365,"page":"1825 - 1840","doi":"10.1098/rstb.2010.0001","article_processing_charge":"No","language":[{"iso":"eng"}],"date_published":"2010-06-12T00:00:00Z","issue":"1547","publication":"Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences","corr_author":"1","abstract":[{"lang":"eng","text":"If distinct biological species are to coexist in sympatry, they must be reproductively isolated and must exploit different limiting resources. A two-niche Levene model is analysed, in which habitat preference and survival depend on underlying additive traits. The population genetics of preference and viability are equivalent. However, there is a linear trade-off between the chances of settling in either niche, whereas viabilities may be constrained arbitrarily. With a convex trade-off, a sexual population evolves a single generalist genotype, whereas with a concave trade-off, disruptive selection favours maximal variance. A pure habitat preference evolves to global linkage equilibrium if mating occurs in a single pool, but remarkably, evolves to pairwise linkage equilibrium within niches if mating is within those niches--independent of the genetics. With a concave trade-off, the population shifts sharply between a unimodal distribution with high gene flow and a bimodal distribution with strong isolation, as the underlying genetic variance increases. However, these alternative states are only simultaneously stable for a narrow parameter range. A sharp threshold is only seen if survival in the 'wrong' niche is low; otherwise, strong isolation is impossible. Gene flow from divergent demes makes speciation much easier in parapatry than in sympatry."}],"status":"public","oa_version":"Submitted Version","title":"What role does natural selection play in speciation?","department":[{"_id":"NiBa"}],"quality_controlled":"1","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pubmed/20439284","open_access":"1"}],"date_created":"2018-12-11T12:05:05Z","citation":{"chicago":"Barton, Nicholas H. “What Role Does Natural Selection Play in Speciation?” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>. Royal Society, 2010. <a href=\"https://doi.org/10.1098/rstb.2010.0001\">https://doi.org/10.1098/rstb.2010.0001</a>.","ieee":"N. H. Barton, “What role does natural selection play in speciation?,” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>, vol. 365, no. 1547. Royal Society, pp. 1825–1840, 2010.","mla":"Barton, Nicholas H. “What Role Does Natural Selection Play in Speciation?” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>, vol. 365, no. 1547, Royal Society, 2010, pp. 1825–40, doi:<a href=\"https://doi.org/10.1098/rstb.2010.0001\">10.1098/rstb.2010.0001</a>.","ista":"Barton NH. 2010. What role does natural selection play in speciation? Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences. 365(1547), 1825–1840.","short":"N.H. Barton, Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences 365 (2010) 1825–1840.","apa":"Barton, N. H. (2010). What role does natural selection play in speciation? <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>. Royal Society. <a href=\"https://doi.org/10.1098/rstb.2010.0001\">https://doi.org/10.1098/rstb.2010.0001</a>","ama":"Barton NH. What role does natural selection play in speciation? <i>Philosophical Transactions of the Royal Society of London Series B, Biological Sciences</i>. 2010;365(1547):1825-1840. doi:<a href=\"https://doi.org/10.1098/rstb.2010.0001\">10.1098/rstb.2010.0001</a>"},"pmid":1,"publist_id":"2455","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"3773","intvolume":"       365","external_id":{"isi":["000277208600009"],"pmid":["20439284"]},"year":"2010","oa":1,"scopus_import":"1","acknowledgement":"The author thanks the Werner-Gren Foundation and the Royal Swedish Academy of Sciences for organizing the symposium on the ‘Origin of Species’. He also thanks Reinhard Bürger, and two anonymous referees, for their helpful comments.\r\n","publication_status":"published","month":"06"}]