[{"has_accepted_license":"1","ddc":["621"],"fulldoi":"https://doi.org/10.1007/s00236-013-0191-5","language":[{"iso":"eng"}],"external_id":{"isi":["000335981500004"]},"date_published":"2014-06-01T00:00:00Z","scopus_import":"1","author":[{"last_name":"Bloem","full_name":"Bloem, Roderick","first_name":"Roderick"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Karin","full_name":"Greimel, Karin","last_name":"Greimel"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Hofferek","first_name":"Georg","full_name":"Hofferek, Georg"},{"last_name":"Jobstmann","full_name":"Jobstmann, Barbara","first_name":"Barbara"},{"first_name":"Bettina","full_name":"Könighofer, Bettina","last_name":"Könighofer"},{"first_name":"Robert","full_name":"Könighofer, Robert","last_name":"Könighofer"}],"publist_id":"4787","page":"193 - 220","pubrep_id":"71","type":"journal_article","article_processing_charge":"No","day":"01","_id":"2187","ec_funded":1,"month":"06","date_created":"2018-12-11T11:56:13Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"article_type":"original","file":[{"access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:16:44Z","file_size":169523,"checksum":"d7f560f3d923f0f00aa10a0652f83273","relation":"main_file","file_name":"IST-2012-71-v1+1_Synthesizing_robust_systems.pdf","creator":"system","date_updated":"2020-07-14T12:45:31Z","file_id":"5234"}],"date_updated":"2025-09-29T11:32:51Z","isi":1,"oa":1,"oa_version":"Submitted Version","publication":"Acta Informatica","file_date_updated":"2020-07-14T12:45:31Z","intvolume":"        51","doi":"10.1007/s00236-013-0191-5","publication_status":"published","citation":{"short":"R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, G. Hofferek, B. Jobstmann, B. Könighofer, R. Könighofer, Acta Informatica 51 (2014) 193–220.","ieee":"R. Bloem <i>et al.</i>, “Synthesizing robust systems,” <i>Acta Informatica</i>, vol. 51, no. 3–4. Springer, pp. 193–220, 2014.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, Georg Hofferek, Barbara Jobstmann, Bettina Könighofer, and Robert Könighofer. “Synthesizing Robust Systems.” <i>Acta Informatica</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00236-013-0191-5\">https://doi.org/10.1007/s00236-013-0191-5</a>.","apa":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., Hofferek, G., Jobstmann, B., … Könighofer, R. (2014). Synthesizing robust systems. <i>Acta Informatica</i>. Springer. <a href=\"https://doi.org/10.1007/s00236-013-0191-5\">https://doi.org/10.1007/s00236-013-0191-5</a>","ama":"Bloem R, Chatterjee K, Greimel K, et al. Synthesizing robust systems. <i>Acta Informatica</i>. 2014;51(3-4):193-220. doi:<a href=\"https://doi.org/10.1007/s00236-013-0191-5\">10.1007/s00236-013-0191-5</a>","mla":"Bloem, Roderick, et al. “Synthesizing Robust Systems.” <i>Acta Informatica</i>, vol. 51, no. 3–4, Springer, 2014, pp. 193–220, doi:<a href=\"https://doi.org/10.1007/s00236-013-0191-5\">10.1007/s00236-013-0191-5</a>.","ista":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Hofferek G, Jobstmann B, Könighofer B, Könighofer R. 2014. Synthesizing robust systems. Acta Informatica. 51(3–4), 193–220."},"volume":51,"year":"2014","title":"Synthesizing robust systems","abstract":[{"text":"Systems should not only be correct but also robust in the sense that they behave reasonably in unexpected situations. This article addresses synthesis of robust reactive systems from temporal specifications. Existing methods allow arbitrary behavior if assumptions in the specification are violated. To overcome this, we define two robustness notions, combine them, and show how to enforce them in synthesis. The first notion applies to safety properties: If safety assumptions are violated temporarily, we require that the system recovers to normal operation with as few errors as possible. The second notion requires that, if liveness assumptions are violated, as many guarantees as possible should be fulfilled nevertheless. We present a synthesis procedure achieving this for the important class of GR(1) specifications, and establish complexity bounds. We also present an implementation of a special case of robustness, and show experimental results.","lang":"eng"}],"quality_controlled":"1","status":"public","issue":"3-4","project":[{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"}],"publisher":"Springer"},{"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2014","volume":4,"citation":{"mla":"Kania, Urszula, et al. “Polar Delivery in Plants; Commonalities and Differences to Animal Epithelial Cells.” <i>Open Biology</i>, vol. 4, no. APRIL, 140017, Royal Society, 2014, doi:<a href=\"https://doi.org/10.1098/rsob.140017\">10.1098/rsob.140017</a>.","ama":"Kania U, Fendrych M, Friml J. Polar delivery in plants; commonalities and differences to animal epithelial cells. <i>Open Biology</i>. 2014;4(APRIL). doi:<a href=\"https://doi.org/10.1098/rsob.140017\">10.1098/rsob.140017</a>","ista":"Kania U, Fendrych M, Friml J. 2014. Polar delivery in plants; commonalities and differences to animal epithelial cells. Open Biology. 4(APRIL), 140017.","ieee":"U. Kania, M. Fendrych, and J. Friml, “Polar delivery in plants; commonalities and differences to animal epithelial cells,” <i>Open Biology</i>, vol. 4, no. APRIL. Royal Society, 2014.","short":"U. Kania, M. Fendrych, J. Friml, Open Biology 4 (2014).","apa":"Kania, U., Fendrych, M., &#38; Friml, J. (2014). Polar delivery in plants; commonalities and differences to animal epithelial cells. <i>Open Biology</i>. Royal Society. <a href=\"https://doi.org/10.1098/rsob.140017\">https://doi.org/10.1098/rsob.140017</a>","chicago":"Kania, Urszula, Matyas Fendrych, and Jiří Friml. “Polar Delivery in Plants; Commonalities and Differences to Animal Epithelial Cells.” <i>Open Biology</i>. Royal Society, 2014. <a href=\"https://doi.org/10.1098/rsob.140017\">https://doi.org/10.1098/rsob.140017</a>."},"publication_status":"published","doi":"10.1098/rsob.140017","issue":"APRIL","status":"public","publisher":"Royal Society","quality_controlled":"1","license":"https://creativecommons.org/licenses/by/4.0/","abstract":[{"lang":"eng","text":"Although plant and animal cells use a similar core mechanism to deliver proteins to the plasma membrane, their different lifestyle, body organization and specific cell structures resulted in the acquisition of regulatory mechanisms that vary in the two kingdoms. In particular, cell polarity regulators do not seem to be conserved, because genes encoding key components are absent in plant genomes. In plants, the broad knowledge on polarity derives from the study of auxin transporters, the PIN-FORMED proteins, in the model plant Arabidopsis thaliana. In animals, much information is provided from the study of polarity in epithelial cells that exhibit basolateral and luminal apical polarities, separated by tight junctions. In this review, we summarize the similarities and differences of the polarization mechanisms between plants and animals and survey the main genetic approaches that have been used to characterize new genes involved in polarity establishment in plants, including the frequently used forward and reverse genetics screens as well as a novel chemical genetics approach that is expected to overcome the limitation of classical genetics methods."}],"title":"Polar delivery in plants; commonalities and differences to animal epithelial cells","acknowledgement":"This work was supported by a grant from the Research Foundation-Flanders (Odysseus).\r\n\r\n","department":[{"_id":"JiFr"}],"date_created":"2018-12-11T11:56:13Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"04","_id":"2188","file_date_updated":"2020-07-14T12:45:31Z","intvolume":"         4","publication":"Open Biology","oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:45:31Z","file_id":"5025","file_name":"IST-2016-441-v1+1_140017.full.pdf","creator":"system","checksum":"2020627feff36cf0799167c84149fa75","file_size":682570,"relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:13:40Z"}],"isi":1,"date_updated":"2025-09-29T11:32:17Z","oa":1,"pubrep_id":"441","corr_author":"1","article_number":"140017","author":[{"last_name":"Kania","full_name":"Kania, Urszula","id":"4AE5C486-F248-11E8-B48F-1D18A9856A87","first_name":"Urszula"},{"first_name":"Matyas","full_name":"Fendrych, Matyas","last_name":"Fendrych"},{"full_name":"Friml, Jiřĺ","first_name":"Jiřĺ","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","orcid":"0000-0002-8302-7596"}],"publist_id":"4786","scopus_import":"1","day":"16","article_processing_charge":"No","type":"journal_article","ddc":["570"],"fulldoi":"https://doi.org/10.1098/rsob.140017","has_accepted_license":"1","date_published":"2014-04-16T00:00:00Z","external_id":{"isi":["000335813800006"]},"language":[{"iso":"eng"}]},{"corr_author":"1","page":"49-58","citation":{"chicago":"Morvant, Emilie. “Adaptation de Domaine de Vote de Majorité Par Auto-Étiquetage Non Itératif,” 1:49–58. Elsevier, 2014.","apa":"Morvant, E. (2014). Adaptation de domaine de vote de majorité par auto-étiquetage non itératif (Vol. 1, pp. 49–58). Presented at the CAP: Conférence Francophone sur l’Apprentissage Automatique (Machine Learning French Conference), Saint-Etienne, France: Elsevier.","short":"E. Morvant, in:, Elsevier, 2014, pp. 49–58.","ieee":"E. Morvant, “Adaptation de domaine de vote de majorité par auto-étiquetage non itératif,” presented at the CAP: Conférence Francophone sur l’Apprentissage Automatique (Machine Learning French Conference), Saint-Etienne, France, 2014, vol. 1, pp. 49–58.","ista":"Morvant E. 2014. Adaptation de domaine de vote de majorité par auto-étiquetage non itératif. CAP: Conférence Francophone sur l’Apprentissage Automatique (Machine Learning French Conference) vol. 1, 49–58.","ama":"Morvant E. Adaptation de domaine de vote de majorité par auto-étiquetage non itératif. In: Vol 1. Elsevier; 2014:49-58.","mla":"Morvant, Emilie. <i>Adaptation de Domaine de Vote de Majorité Par Auto-Étiquetage Non Itératif</i>. Vol. 1, Elsevier, 2014, pp. 49–58."},"publication_status":"published","year":"2014","volume":1,"main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-01005776/"}],"author":[{"orcid":"0000-0002-8301-7240","last_name":"Morvant","id":"4BAC2A72-F248-11E8-B48F-1D18A9856A87","first_name":"Emilie","full_name":"Morvant, Emilie"}],"publist_id":"4785","quality_controlled":"1","status":"public","day":"01","publisher":"Elsevier","type":"conference","abstract":[{"text":"En apprentissage automatique, nous parlons d'adaptation de domaine lorsque les données de test (cibles) et d'apprentissage (sources) sont générées selon différentes distributions. Nous devons donc développer des algorithmes de classification capables de s'adapter à une nouvelle distribution, pour laquelle aucune information sur les étiquettes n'est disponible. Nous attaquons cette problématique sous l'angle de l'approche PAC-Bayésienne qui se focalise sur l'apprentissage de modèles définis comme des votes de majorité sur un ensemble de fonctions. Dans ce contexte, nous introduisons PV-MinCq une version adaptative de l'algorithme (non adaptatif) MinCq. PV-MinCq suit le principe suivant. Nous transférons les étiquettes sources aux points cibles proches pour ensuite appliquer MinCq sur l'échantillon cible ``auto-étiqueté'' (justifié par une borne théorique). Plus précisément, nous définissons un auto-étiquetage non itératif qui se focalise dans les régions où les distributions marginales source et cible sont les plus similaires. Dans un second temps, nous étudions l'influence de notre auto-étiquetage pour en déduire une procédure de validation des hyperparamètres. Finalement, notre approche montre des résultats empiriques prometteurs.","lang":"fre"}],"title":"Adaptation de domaine de vote de majorité par auto-étiquetage non itératif","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:56:13Z","department":[{"_id":"ChLa"}],"_id":"2189","conference":{"location":"Saint-Etienne, France","name":"CAP: Conférence Francophone sur l'Apprentissage Automatique (Machine Learning French Conference)"},"month":"07","oa_version":"Preprint","date_published":"2014-07-01T00:00:00Z","intvolume":"         1","language":[{"iso":"eng"}],"date_updated":"2024-10-09T20:55:32Z","oa":1},{"quality_controlled":"1","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"publisher":"Springer","status":"public","acknowledgement":"The author is on leave from Faculty of Informatics, Masaryk University, Czech Republic, and partially supported by the Czech Science Foundation, grant No. P202/12/G061.","abstract":[{"lang":"eng","text":"We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula φ. The automaton is the product of a master automaton and an array of slave automata, one for each G-subformula of φ. The slave automaton for G ψ is in charge of recognizing whether FG ψ holds. As opposed to standard determinization procedures, the states of all our automata have a clear logical structure, which allows for various optimizations. Our construction subsumes former algorithms for fragments of LTL. Experimental results show improvement in the sizes of the resulting automata compared to existing methods."}],"title":"From LTL to deterministic automata: A safraless compositional approach","citation":{"short":"J. Esparza, J. Kretinsky, in:, Springer, 2014, pp. 192–208.","ieee":"J. Esparza and J. Kretinsky, “From LTL to deterministic automata: A safraless compositional approach,” presented at the CAV: Computer Aided Verification, 2014, vol. 8559, pp. 192–208.","chicago":"Esparza, Javier, and Jan Kretinsky. “From LTL to Deterministic Automata: A Safraless Compositional Approach,” 8559:192–208. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_13\">https://doi.org/10.1007/978-3-319-08867-9_13</a>.","apa":"Esparza, J., &#38; Kretinsky, J. (2014). From LTL to deterministic automata: A safraless compositional approach (Vol. 8559, pp. 192–208). Presented at the CAV: Computer Aided Verification, Springer. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_13\">https://doi.org/10.1007/978-3-319-08867-9_13</a>","ama":"Esparza J, Kretinsky J. From LTL to deterministic automata: A safraless compositional approach. In: Vol 8559. Springer; 2014:192-208. doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_13\">10.1007/978-3-319-08867-9_13</a>","mla":"Esparza, Javier, and Jan Kretinsky. <i>From LTL to Deterministic Automata: A Safraless Compositional Approach</i>. Vol. 8559, Springer, 2014, pp. 192–208, doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_13\">10.1007/978-3-319-08867-9_13</a>.","ista":"Esparza J, Kretinsky J. 2014. From LTL to deterministic automata: A safraless compositional approach. CAV: Computer Aided Verification, LNCS, vol. 8559, 192–208."},"publication_status":"published","volume":8559,"year":"2014","doi":"10.1007/978-3-319-08867-9_13","oa_version":"Submitted Version","intvolume":"      8559","oa":1,"date_updated":"2025-06-11T08:01:04Z","date_created":"2018-12-11T11:56:14Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"conference":{"name":"CAV: Computer Aided Verification"},"ec_funded":1,"_id":"2190","month":"01","day":"01","type":"conference","article_processing_charge":"No","page":"192 - 208","corr_author":"1","scopus_import":"1","main_file_link":[{"url":"http://arxiv.org/abs/1402.3388","open_access":"1"}],"publist_id":"4784","author":[{"last_name":"Esparza","full_name":"Esparza, Javier","first_name":"Javier"},{"last_name":"Kretinsky","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"arxiv":["1402.3388"]},"date_published":"2014-01-01T00:00:00Z","alternative_title":["LNCS"],"arxiv":1,"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1007/978-3-319-08867-9_13"},{"page":"104 - 116","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.4473"}],"scopus_import":"1","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"last_name":"Krinninger","first_name":"Sebastian","full_name":"Krinninger, Sebastian"},{"full_name":"Loitzenbauer, Veronika","first_name":"Veronika","last_name":"Loitzenbauer"},{"last_name":"Raskin","first_name":"Michael","full_name":"Raskin, Michael"}],"publist_id":"5836","day":"28","type":"journal_article","article_processing_charge":"No","fulldoi":"https://doi.org/10.1016/j.tcs.2014.06.031","external_id":{"isi":["000340694000008"],"arxiv":["1307.4473"]},"date_published":"2014-08-28T00:00:00Z","arxiv":1,"language":[{"iso":"eng"}],"publication_status":"published","citation":{"short":"K. Chatterjee, M. Henzinger, S. Krinninger, V. Loitzenbauer, M. Raskin, Theoretical Computer Science 547 (2014) 104–116.","ieee":"K. Chatterjee, M. Henzinger, S. Krinninger, V. Loitzenbauer, and M. Raskin, “Approximating the minimum cycle mean,” <i>Theoretical Computer Science</i>, vol. 547, no. C. Elsevier, pp. 104–116, 2014.","chicago":"Chatterjee, Krishnendu, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, and Michael Raskin. “Approximating the Minimum Cycle Mean.” <i>Theoretical Computer Science</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.tcs.2014.06.031\">https://doi.org/10.1016/j.tcs.2014.06.031</a>.","apa":"Chatterjee, K., Henzinger, M., Krinninger, S., Loitzenbauer, V., &#38; Raskin, M. (2014). Approximating the minimum cycle mean. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2014.06.031\">https://doi.org/10.1016/j.tcs.2014.06.031</a>","ama":"Chatterjee K, Henzinger M, Krinninger S, Loitzenbauer V, Raskin M. Approximating the minimum cycle mean. <i>Theoretical Computer Science</i>. 2014;547(C):104-116. doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.06.031\">10.1016/j.tcs.2014.06.031</a>","mla":"Chatterjee, Krishnendu, et al. “Approximating the Minimum Cycle Mean.” <i>Theoretical Computer Science</i>, vol. 547, no. C, Elsevier, 2014, pp. 104–16, doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.06.031\">10.1016/j.tcs.2014.06.031</a>.","ista":"Chatterjee K, Henzinger M, Krinninger S, Loitzenbauer V, Raskin M. 2014. Approximating the minimum cycle mean. Theoretical Computer Science. 547(C), 104–116."},"year":"2014","volume":547,"doi":"10.1016/j.tcs.2014.06.031","quality_controlled":"1","status":"public","issue":"C","publisher":"Elsevier","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"abstract":[{"text":"We consider directed graphs where each edge is labeled with an integer weight and study the fundamental algorithmic question of computing the value of a cycle with minimum mean weight. Our contributions are twofold: (1) First we show that the algorithmic question is reducible to the problem of a logarithmic number of min-plus matrix multiplications of n×n-matrices, where n is the number of vertices of the graph. (2) Second, when the weights are nonnegative, we present the first (1+ε)-approximation algorithm for the problem and the running time of our algorithm is Õ(nωlog3(nW/ε)/ε),1 where O(nω) is the time required for the classic n×n-matrix multiplication and W is the maximum value of the weights. With an additional O(log(nW/ε)) factor in space a cycle with approximately optimal weight can be computed within the same time bound.","lang":"eng"}],"title":"Approximating the minimum cycle mean","date_created":"2018-12-11T11:51:40Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"KrCh"}],"article_type":"original","ec_funded":1,"_id":"1375","month":"08","oa_version":"Preprint","publication":"Theoretical Computer Science","intvolume":"       547","date_updated":"2025-09-29T13:17:21Z","isi":1,"oa":1},{"ddc":["000","005"],"fulldoi":"https://doi.org/10.1007/978-3-642-54013-4_10","has_accepted_license":"1","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"date_published":"2014-01-01T00:00:00Z","author":[{"full_name":"Dragoi, Cezara","first_name":"Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","last_name":"Dragoi"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Veith, Helmut","first_name":"Helmut","last_name":"Veith"},{"last_name":"Widder","first_name":"Josef","full_name":"Widder, Josef"},{"orcid":"0000-0002-3197-8736","last_name":"Zufferey","first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien"}],"publist_id":"5817","scopus_import":1,"page":"161 - 181","pubrep_id":"179","type":"conference","day":"01","month":"01","ec_funded":1,"_id":"1392","conference":{"start_date":"2014-01-19","location":"San Diego, USA","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","end_date":"2014-01-21"},"department":[{"_id":"ToHe"}],"date_created":"2018-12-11T11:51:45Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:50:22Z","file":[{"file_id":"4859","date_updated":"2020-07-14T12:44:48Z","creator":"system","file_name":"IST-2014-179-v1+1_vmcai14.pdf","relation":"main_file","file_size":444138,"checksum":"bffa33d39be77df0da39defe97eabf84","content_type":"application/pdf","date_created":"2018-12-12T10:11:06Z","access_level":"open_access"}],"oa":1,"file_date_updated":"2020-07-14T12:44:48Z","intvolume":"      8318","oa_version":"Submitted Version","doi":"10.1007/978-3-642-54013-4_10","year":"2014","volume":8318,"publication_status":"published","citation":{"chicago":"Dragoi, Cezara, Thomas A Henzinger, Helmut Veith, Josef Widder, and Damien Zufferey. “A Logic-Based Framework for Verifying Consensus Algorithms,” 8318:161–81. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_10\">https://doi.org/10.1007/978-3-642-54013-4_10</a>.","apa":"Dragoi, C., Henzinger, T. A., Veith, H., Widder, J., &#38; Zufferey, D. (2014). A logic-based framework for verifying consensus algorithms (Vol. 8318, pp. 161–181). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, San Diego, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_10\">https://doi.org/10.1007/978-3-642-54013-4_10</a>","short":"C. Dragoi, T.A. Henzinger, H. Veith, J. Widder, D. Zufferey, in:, Springer, 2014, pp. 161–181.","ieee":"C. Dragoi, T. A. Henzinger, H. Veith, J. Widder, and D. Zufferey, “A logic-based framework for verifying consensus algorithms,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, San Diego, USA, 2014, vol. 8318, pp. 161–181.","ista":"Dragoi C, Henzinger TA, Veith H, Widder J, Zufferey D. 2014. A logic-based framework for verifying consensus algorithms. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 8318, 161–181.","ama":"Dragoi C, Henzinger TA, Veith H, Widder J, Zufferey D. A logic-based framework for verifying consensus algorithms. In: Vol 8318. Springer; 2014:161-181. doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_10\">10.1007/978-3-642-54013-4_10</a>","mla":"Dragoi, Cezara, et al. <i>A Logic-Based Framework for Verifying Consensus Algorithms</i>. Vol. 8318, Springer, 2014, pp. 161–81, doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_10\">10.1007/978-3-642-54013-4_10</a>."},"abstract":[{"text":"Fault-tolerant distributed algorithms play an important role in ensuring the reliability of many software applications. In this paper we consider distributed algorithms whose computations are organized in rounds. To verify the correctness of such algorithms, we reason about (i) properties (such as invariants) of the state, (ii) the transitions controlled by the algorithm, and (iii) the communication graph. We introduce a logic that addresses these points, and contains set comprehensions with cardinality constraints, function symbols to describe the local states of each process, and a limited form of quantifier alternation to express the verification conditions. We show its use in automating the verification of consensus algorithms. In particular, we give a semi-decision procedure for the unsatisfiability problem of the logic and identify a decidable fragment. We successfully applied our framework to verify the correctness of a variety of consensus algorithms tolerant to both benign faults (message loss, process crashes) and value faults (message corruption).","lang":"eng"}],"title":"A logic-based framework for verifying consensus algorithms","acknowledgement":"Supported by the Vienna Science and Technology Fund (WWTF) through grant PROSEED.","status":"public","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"publisher":"Springer","quality_controlled":"1"},{"oa":1,"date_updated":"2026-06-18T17:31:28Z","publication":"Proceedings of the on Future of Software Engineering","oa_version":"Published Version","month":"05","conference":{"start_date":"2014-05-31","location":"Hyderabad, India","end_date":"2014-06-07","name":"FOSE: Future of Software Engineering"},"_id":"1393","ec_funded":1,"department":[{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:51:45Z","title":"Probabilistic programming","abstract":[{"text":"Probabilistic programs are usual functional or imperative programs with two added constructs: (1) the ability to draw values at random from distributions, and (2) the ability to condition values of variables in a program via observations. Models from diverse application areas such as computer vision, coding theory, cryptographic protocols, biology and reliability analysis can be written as probabilistic programs. Probabilistic inference is the problem of computing an explicit representation of the probability distribution implicitly specified by a probabilistic program. Depending on the application, the desired output from inference may vary-we may want to estimate the expected value of some function f with respect to the distribution, or the mode of the distribution, or simply a set of samples drawn from the distribution. In this paper, we describe connections this research area called \\Probabilistic Programming&quot; has with programming languages and software engineering, and this includes language design, and the static and dynamic analysis of programs. We survey current state of the art and speculate on promising directions for future research.","lang":"eng"}],"publisher":"ACM","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"status":"public","quality_controlled":"1","doi":"10.1145/2593882.2593900","year":"2014","citation":{"ista":"Gordon A, Henzinger TA, Nori A, Rajamani S. 2014. Probabilistic programming. Proceedings of the on Future of Software Engineering. FOSE: Future of Software Engineering, 167–181.","mla":"Gordon, Andrew, et al. “Probabilistic Programming.” <i>Proceedings of the on Future of Software Engineering</i>, ACM, 2014, pp. 167–81, doi:<a href=\"https://doi.org/10.1145/2593882.2593900\">10.1145/2593882.2593900</a>.","ama":"Gordon A, Henzinger TA, Nori A, Rajamani S. Probabilistic programming. In: <i>Proceedings of the on Future of Software Engineering</i>. ACM; 2014:167-181. doi:<a href=\"https://doi.org/10.1145/2593882.2593900\">10.1145/2593882.2593900</a>","apa":"Gordon, A., Henzinger, T. A., Nori, A., &#38; Rajamani, S. (2014). Probabilistic programming. In <i>Proceedings of the on Future of Software Engineering</i> (pp. 167–181). Hyderabad, India: ACM. <a href=\"https://doi.org/10.1145/2593882.2593900\">https://doi.org/10.1145/2593882.2593900</a>","chicago":"Gordon, Andrew, Thomas A Henzinger, Aditya Nori, and Sriram Rajamani. “Probabilistic Programming.” In <i>Proceedings of the on Future of Software Engineering</i>, 167–81. ACM, 2014. <a href=\"https://doi.org/10.1145/2593882.2593900\">https://doi.org/10.1145/2593882.2593900</a>.","ieee":"A. Gordon, T. A. Henzinger, A. Nori, and S. Rajamani, “Probabilistic programming,” in <i>Proceedings of the on Future of Software Engineering</i>, Hyderabad, India, 2014, pp. 167–181.","short":"A. Gordon, T.A. Henzinger, A. Nori, S. Rajamani, in:, Proceedings of the on Future of Software Engineering, ACM, 2014, pp. 167–181."},"publication_status":"published","language":[{"iso":"eng"}],"date_published":"2014-05-31T00:00:00Z","fulldoi":"https://doi.org/10.1145/2593882.2593900","ddc":["000"],"article_processing_charge":"No","type":"conference","day":"31","publist_id":"5816","author":[{"last_name":"Gordon","full_name":"Gordon, Andrew","first_name":"Andrew"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"last_name":"Nori","full_name":"Nori, Aditya","first_name":"Aditya"},{"last_name":"Rajamani","full_name":"Rajamani, Sriram","first_name":"Sriram"}],"scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1145/2593882.2593900","open_access":"1"}],"page":"167 - 181"},{"arxiv":1,"external_id":{"arxiv":["1407.5752"]},"date_published":"2014-08-01T00:00:00Z","language":[{"iso":"eng"}],"day":"01","article_processing_charge":"No","type":"conference","page":"214 - 236","publist_id":"5670","author":[{"full_name":"Erdös, László","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","last_name":"Erdös"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.5752"}],"intvolume":"         3","oa_version":"Submitted Version","publication":"Proceedings of the International Congress of Mathematicians","oa":1,"date_updated":"2025-06-11T07:52:59Z","department":[{"_id":"LaEr"}],"date_created":"2018-12-11T11:52:25Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","conference":{"name":"ICM: International Congress of Mathematicians","end_date":"2014-08-21","location":"Seoul, Korea","start_date":"2014-08-13"},"ec_funded":1,"_id":"1507","project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"}],"publisher":"International Congress of Mathematicians","status":"public","quality_controlled":"1","abstract":[{"text":"The Wigner-Dyson-Gaudin-Mehta conjecture asserts that the local eigenvalue statistics of large real and complex Hermitian matrices with independent, identically distributed entries are universal in a sense that they depend only on the symmetry class of the matrix and otherwise are independent of the details of the distribution. We present the recent solution to this half-century old conjecture. We explain how stochastic tools, such as the Dyson Brownian motion, and PDE ideas, such as De Giorgi-Nash-Moser regularity theory, were combined in the solution. We also show related results for log-gases that represent a universal model for strongly correlated systems. Finally, in the spirit of Wigner’s original vision, we discuss the extensions of these universality results to more realistic physical systems such as random band matrices.","lang":"eng"}],"title":"Random matrices, log-gases and Hölder regularity","acknowledgement":"The author is partially supported by SFB-TR 12 Grant of the German Research Council.","year":"2014","volume":3,"publication_status":"published","citation":{"mla":"Erdös, László. “Random Matrices, Log-Gases and Hölder Regularity.” <i>Proceedings of the International Congress of Mathematicians</i>, vol. 3, International Congress of Mathematicians, 2014, pp. 214–36.","ama":"Erdös L. Random matrices, log-gases and Hölder regularity. In: <i>Proceedings of the International Congress of Mathematicians</i>. Vol 3. International Congress of Mathematicians; 2014:214-236.","ista":"Erdös L. 2014. Random matrices, log-gases and Hölder regularity. Proceedings of the International Congress of Mathematicians. ICM: International Congress of Mathematicians vol. 3, 214–236.","ieee":"L. Erdös, “Random matrices, log-gases and Hölder regularity,” in <i>Proceedings of the International Congress of Mathematicians</i>, Seoul, Korea, 2014, vol. 3, pp. 214–236.","short":"L. Erdös, in:, Proceedings of the International Congress of Mathematicians, International Congress of Mathematicians, 2014, pp. 214–236.","apa":"Erdös, L. (2014). Random matrices, log-gases and Hölder regularity. In <i>Proceedings of the International Congress of Mathematicians</i> (Vol. 3, pp. 214–236). Seoul, Korea: International Congress of Mathematicians.","chicago":"Erdös, László. “Random Matrices, Log-Gases and Hölder Regularity.” In <i>Proceedings of the International Congress of Mathematicians</i>, 3:214–36. International Congress of Mathematicians, 2014."}},{"fulldoi":"https://doi.org/10.1142/9789814618144_0007","date_published":"2014-01-01T00:00:00Z","external_id":{"arxiv":["1403.2563"]},"arxiv":1,"language":[{"iso":"eng"}],"page":"127 - 137","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1403.2563"}],"author":[{"last_name":"Bräunlich","full_name":"Bräunlich, Gerhard","first_name":"Gerhard"},{"full_name":"Hainzl, Christian","first_name":"Christian","last_name":"Hainzl"},{"orcid":"0000-0002-6781-0521","last_name":"Seiringer","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"}],"publist_id":"5661","day":"01","type":"conference","article_processing_charge":"No","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:52:28Z","department":[{"_id":"RoSe"}],"_id":"1516","conference":{"location":"Berlin, Germany","end_date":"2013-09-13","name":"QMath: Mathematical Results in Quantum Physics","start_date":"2013-09-10"},"month":"01","publication":"Proceedings of the QMath12 Conference","oa_version":"Preprint","date_updated":"2021-01-12T06:51:19Z","oa":1,"publication_status":"published","citation":{"mla":"Bräunlich, Gerhard, et al. “On the BCS Gap Equation for Superfluid Fermionic Gases.” <i>Proceedings of the QMath12 Conference</i>, World Scientific Publishing, 2014, pp. 127–37, doi:<a href=\"https://doi.org/10.1142/9789814618144_0007\">10.1142/9789814618144_0007</a>.","ama":"Bräunlich G, Hainzl C, Seiringer R. On the BCS gap equation for superfluid fermionic gases. In: <i>Proceedings of the QMath12 Conference</i>. World Scientific Publishing; 2014:127-137. doi:<a href=\"https://doi.org/10.1142/9789814618144_0007\">10.1142/9789814618144_0007</a>","ista":"Bräunlich G, Hainzl C, Seiringer R. 2014. On the BCS gap equation for superfluid fermionic gases. Proceedings of the QMath12 Conference. QMath: Mathematical Results in Quantum Physics, 127–137.","ieee":"G. Bräunlich, C. Hainzl, and R. Seiringer, “On the BCS gap equation for superfluid fermionic gases,” in <i>Proceedings of the QMath12 Conference</i>, Berlin, Germany, 2014, pp. 127–137.","short":"G. Bräunlich, C. Hainzl, R. Seiringer, in:, Proceedings of the QMath12 Conference, World Scientific Publishing, 2014, pp. 127–137.","apa":"Bräunlich, G., Hainzl, C., &#38; Seiringer, R. (2014). On the BCS gap equation for superfluid fermionic gases. In <i>Proceedings of the QMath12 Conference</i> (pp. 127–137). Berlin, Germany: World Scientific Publishing. <a href=\"https://doi.org/10.1142/9789814618144_0007\">https://doi.org/10.1142/9789814618144_0007</a>","chicago":"Bräunlich, Gerhard, Christian Hainzl, and Robert Seiringer. “On the BCS Gap Equation for Superfluid Fermionic Gases.” In <i>Proceedings of the QMath12 Conference</i>, 127–37. World Scientific Publishing, 2014. <a href=\"https://doi.org/10.1142/9789814618144_0007\">https://doi.org/10.1142/9789814618144_0007</a>."},"year":"2014","doi":"10.1142/9789814618144_0007","quality_controlled":"1","status":"public","publisher":"World Scientific Publishing","abstract":[{"text":"We present a rigorous derivation of the BCS gap equation for superfluid fermionic gases with point interactions. Our starting point is the BCS energy functional, whose minimizer we investigate in the limit when the range of the interaction potential goes to zero.\r\n","lang":"eng"}],"title":"On the BCS gap equation for superfluid fermionic gases"},{"author":[{"full_name":"Guerrero, Paul","first_name":"Paul","last_name":"Guerrero"},{"last_name":"Jeschke","full_name":"Jeschke, Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan"},{"last_name":"Wimmer","full_name":"Wimmer, Michael","first_name":"Michael"},{"last_name":"Wonka","first_name":"Peter","full_name":"Wonka, Peter"}],"publist_id":"5526","pubrep_id":"577","article_number":"15","article_processing_charge":"No","type":"journal_article","day":"01","ddc":["000"],"fulldoi":"https://doi.org/10.1145/2591010","has_accepted_license":"1","language":[{"iso":"eng"}],"external_id":{"isi":["000335009900003"]},"date_published":"2014-03-01T00:00:00Z","doi":"10.1145/2591010","year":"2014","volume":33,"publication_status":"published","citation":{"short":"P. Guerrero, S. Jeschke, M. Wimmer, P. Wonka, ACM Transactions on Graphics 33 (2014).","ieee":"P. Guerrero, S. Jeschke, M. Wimmer, and P. Wonka, “Edit propagation using geometric relationship functions,” <i>ACM Transactions on Graphics</i>, vol. 33, no. 2. ACM, 2014.","chicago":"Guerrero, Paul, Stefan Jeschke, Michael Wimmer, and Peter Wonka. “Edit Propagation Using Geometric Relationship Functions.” <i>ACM Transactions on Graphics</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2591010\">https://doi.org/10.1145/2591010</a>.","apa":"Guerrero, P., Jeschke, S., Wimmer, M., &#38; Wonka, P. (2014). Edit propagation using geometric relationship functions. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2591010\">https://doi.org/10.1145/2591010</a>","ama":"Guerrero P, Jeschke S, Wimmer M, Wonka P. Edit propagation using geometric relationship functions. <i>ACM Transactions on Graphics</i>. 2014;33(2). doi:<a href=\"https://doi.org/10.1145/2591010\">10.1145/2591010</a>","mla":"Guerrero, Paul, et al. “Edit Propagation Using Geometric Relationship Functions.” <i>ACM Transactions on Graphics</i>, vol. 33, no. 2, 15, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2591010\">10.1145/2591010</a>.","ista":"Guerrero P, Jeschke S, Wimmer M, Wonka P. 2014. Edit propagation using geometric relationship functions. ACM Transactions on Graphics. 33(2), 15."},"abstract":[{"lang":"eng","text":"We propose a method for propagating edit operations in 2D vector graphics, based on geometric relationship functions. These functions quantify the geometric relationship of a point to a polygon, such as the distance to the boundary or the direction to the closest corner vertex. The level sets of the relationship functions describe points with the same relationship to a polygon. For a given query point, we first determine a set of relationships to local features, construct all level sets for these relationships, and accumulate them. The maxima of the resulting distribution are points with similar geometric relationships. We show extensions to handle mirror symmetries, and discuss the use of relationship functions as local coordinate systems. Our method can be applied, for example, to interactive floorplan editing, and it is especially useful for large layouts, where individual edits would be cumbersome. We demonstrate populating 2D layouts with tens to hundreds of objects by propagating relatively few edit operations."}],"title":"Edit propagation using geometric relationship functions","status":"public","issue":"2","publisher":"ACM","quality_controlled":"1","month":"03","_id":"1629","department":[{"_id":"ChWo"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:53:08Z","file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:11:22Z","access_level":"open_access","relation":"main_file","checksum":"7f91e588a4e888610313b98271e6418e","file_size":9832561,"file_name":"IST-2016-577-v1+1_2014.TOG.Paul.EditingPropagation.final.pdf","creator":"system","date_updated":"2020-07-14T12:45:07Z","file_id":"4876"}],"date_updated":"2025-09-29T13:16:25Z","isi":1,"oa":1,"file_date_updated":"2020-07-14T12:45:07Z","intvolume":"        33","oa_version":"Submitted Version","publication":"ACM Transactions on Graphics"},{"abstract":[{"lang":"eng","text":"We extend the notion of verifiable random functions (VRF) to constrained VRFs, which generalize the concept of constrained pseudorandom functions, put forward by Boneh and Waters (Asiacrypt’13), and independently by Kiayias et al. (CCS’13) and Boyle et al. (PKC’14), who call them delegatable PRFs and functional PRFs, respectively. In a standard VRF the secret key sk allows one to evaluate a pseudorandom function at any point of its domain; in addition, it enables computation of a non-interactive proof that the function value was computed correctly. In a constrained VRF from the key sk one can derive constrained keys skS for subsets S of the domain, which allow computation of function values and proofs only at points in S. After formally defining constrained VRFs, we derive instantiations from the multilinear-maps-based constrained PRFs by Boneh and Waters, yielding a VRF with constrained keys for any set that can be decided by a polynomial-size circuit. Our VRFs have the same function values as the Boneh-Waters PRFs and are proved secure under the same hardness assumption, showing that verifiability comes at no cost. Constrained (functional) VRFs were stated as an open problem by Boyle et al."}],"title":"Constrained Verifiable Random Functions ","status":"public","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","call_identifier":"FP7","name":"Provable Security for Physical Cryptography"}],"publisher":"Springer","doi":"10.1007/978-3-319-10879-7_7","volume":8642,"year":"2014","citation":{"mla":"Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” <i>SCN 2014</i>, edited by Michel Abdalla and Roberto De Prisco, vol. 8642, Springer, 2014, pp. 95–114, doi:<a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">10.1007/978-3-319-10879-7_7</a>.","ama":"Fuchsbauer G. Constrained Verifiable Random Functions . In: Abdalla M, De Prisco R, eds. <i>SCN 2014</i>. Vol 8642. Springer; 2014:95-114. doi:<a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">10.1007/978-3-319-10879-7_7</a>","ista":"Fuchsbauer G. 2014. Constrained Verifiable Random Functions . SCN 2014. SCN: Security and Cryptography for Networks, LNCS, vol. 8642, 95–114.","ieee":"G. Fuchsbauer, “Constrained Verifiable Random Functions ,” in <i>SCN 2014</i>, Amalfi, Italy, 2014, vol. 8642, pp. 95–114.","short":"G. Fuchsbauer, in:, M. Abdalla, R. De Prisco (Eds.), SCN 2014, Springer, 2014, pp. 95–114.","apa":"Fuchsbauer, G. (2014). Constrained Verifiable Random Functions . In M. Abdalla &#38; R. De Prisco (Eds.), <i>SCN 2014</i> (Vol. 8642, pp. 95–114). Amalfi, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">https://doi.org/10.1007/978-3-319-10879-7_7</a>","chicago":"Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” In <i>SCN 2014</i>, edited by Michel Abdalla and Roberto De Prisco, 8642:95–114. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">https://doi.org/10.1007/978-3-319-10879-7_7</a>."},"publication_status":"published","date_updated":"2026-06-22T14:10:02Z","oa":1,"das_tickbox":"1","intvolume":"      8642","publication":"SCN 2014","oa_version":"Submitted Version","month":"01","_id":"1643","editor":[{"first_name":"Michel","full_name":"Abdalla, Michel","last_name":"Abdalla"},{"last_name":"De Prisco","full_name":"De Prisco, Roberto","first_name":"Roberto"}],"ec_funded":1,"conference":{"end_date":"2014-09-05","name":"SCN: Security and Cryptography for Networks","location":"Amalfi, Italy","start_date":"2014-09-03"},"department":[{"_id":"KrPi"}],"date_created":"2018-12-11T11:53:13Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","type":"conference","day":"01","author":[{"last_name":"Fuchsbauer","full_name":"Fuchsbauer, Georg","first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"5509","main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2014/537"}],"cryptoeprintid":1,"scopus_import":"1","corr_author":"1","page":"95 - 114","language":[{"iso":"eng"}],"external_id":{"cryptoeprintid":["2014/537"]},"date_published":"2014-01-01T00:00:00Z","alternative_title":["LNCS"],"fulldoi":"https://doi.org/10.1007/978-3-319-10879-7_7"},{"arxiv":1,"date_published":"2014-12-02T00:00:00Z","external_id":{"arxiv":["1303.7378"]},"alternative_title":["EPTCS"],"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.4204/EPTCS.169.5","day":"02","article_processing_charge":"No","type":"conference","corr_author":"1","page":"31 - 38","publist_id":"5435","author":[{"last_name":"Gupta","full_name":"Gupta, Ashutosh","first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Corneliu","full_name":"Popeea, Corneliu","last_name":"Popeea"},{"full_name":"Rybalchenko, Andrey","first_name":"Andrey","last_name":"Rybalchenko"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1303.7378"}],"intvolume":"       169","publication":"Electronic Proceedings in Theoretical Computer Science, EPTCS","oa_version":"Submitted Version","oa":1,"date_updated":"2025-06-11T08:03:28Z","department":[{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:53:33Z","month":"12","conference":{"end_date":"2014-07-17","name":"HCVS: Horn Clauses for Verification and Synthesis","location":"Vienna, Austria","start_date":"2014-07-17"},"_id":"1702","publisher":"Open Publishing Association","status":"public","quality_controlled":"1","abstract":[{"text":"In this paper we present INTERHORN, a solver for recursion-free Horn clauses. The main application domain of INTERHORN lies in solving interpolation problems arising in software verification. We show how a range of interpolation problems, including path, transition, nested, state/transition and well-founded interpolation can be handled directly by INTERHORN. By detailing these interpolation problems and their Horn clause representations, we hope to encourage the emergence of a common back-end interpolation interface useful for diverse verification tools.","lang":"eng"}],"title":"Generalised interpolation by solving recursion free-horn clauses","volume":169,"year":"2014","publication_status":"published","citation":{"ista":"Gupta A, Popeea C, Rybalchenko A. 2014. Generalised interpolation by solving recursion free-horn clauses. Electronic Proceedings in Theoretical Computer Science, EPTCS. HCVS: Horn Clauses for Verification and Synthesis, EPTCS, vol. 169, 31–38.","ama":"Gupta A, Popeea C, Rybalchenko A. Generalised interpolation by solving recursion free-horn clauses. In: <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>. Vol 169. Open Publishing Association; 2014:31-38. doi:<a href=\"https://doi.org/10.4204/EPTCS.169.5\">10.4204/EPTCS.169.5</a>","mla":"Gupta, Ashutosh, et al. “Generalised Interpolation by Solving Recursion Free-Horn Clauses.” <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, vol. 169, Open Publishing Association, 2014, pp. 31–38, doi:<a href=\"https://doi.org/10.4204/EPTCS.169.5\">10.4204/EPTCS.169.5</a>.","chicago":"Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Generalised Interpolation by Solving Recursion Free-Horn Clauses.” In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, 169:31–38. Open Publishing Association, 2014. <a href=\"https://doi.org/10.4204/EPTCS.169.5\">https://doi.org/10.4204/EPTCS.169.5</a>.","apa":"Gupta, A., Popeea, C., &#38; Rybalchenko, A. (2014). Generalised interpolation by solving recursion free-horn clauses. In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i> (Vol. 169, pp. 31–38). Vienna, Austria: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.169.5\">https://doi.org/10.4204/EPTCS.169.5</a>","short":"A. Gupta, C. Popeea, A. Rybalchenko, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing Association, 2014, pp. 31–38.","ieee":"A. Gupta, C. Popeea, and A. Rybalchenko, “Generalised interpolation by solving recursion free-horn clauses,” in <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, Vienna, Austria, 2014, vol. 169, pp. 31–38."},"doi":"10.4204/EPTCS.169.5"},{"publication_status":"published","citation":{"chicago":"Savin, Cristina, and Sophie Denève. “Spatio-Temporal Representations of Uncertainty in Spiking Neural Networks,” 27:2024–32. Neural Information Processing Systems Foundation, 2014.","apa":"Savin, C., &#38; Denève, S. (2014). Spatio-temporal representations of uncertainty in spiking neural networks (Vol. 27, pp. 2024–2032). Presented at the NIPS: Neural Information Processing Systems, Montreal, Canada: Neural Information Processing Systems Foundation.","short":"C. Savin, S. Denève, in:, Neural Information Processing Systems Foundation, 2014, pp. 2024–2032.","ieee":"C. Savin and S. Denève, “Spatio-temporal representations of uncertainty in spiking neural networks,” presented at the NIPS: Neural Information Processing Systems, Montreal, Canada, 2014, vol. 27, no. January, pp. 2024–2032.","ista":"Savin C, Denève S. 2014. Spatio-temporal representations of uncertainty in spiking neural networks. NIPS: Neural Information Processing Systems vol. 27, 2024–2032.","ama":"Savin C, Denève S. Spatio-temporal representations of uncertainty in spiking neural networks. In: Vol 27. Neural Information Processing Systems Foundation; 2014:2024-2032.","mla":"Savin, Cristina, and Sophie Denève. <i>Spatio-Temporal Representations of Uncertainty in Spiking Neural Networks</i>. Vol. 27, no. January, Neural Information Processing Systems Foundation, 2014, pp. 2024–32."},"volume":27,"year":"2014","abstract":[{"lang":"eng","text":"It has been long argued that, because of inherent ambiguity and noise, the brain needs to represent uncertainty in the form of probability distributions. The neural encoding of such distributions remains however highly controversial. Here we present a novel circuit model for representing multidimensional real-valued distributions using a spike based spatio-temporal code. Our model combines the computational advantages of the currently competing models for probabilistic codes and exhibits realistic neural responses along a variety of classic measures. Furthermore, the model highlights the challenges associated with interpreting neural activity in relation to behavioral uncertainty and points to alternative population-level approaches for the experimental validation of distributed representations."}],"title":"Spatio-temporal representations of uncertainty in spiking neural networks","quality_controlled":"1","publisher":"Neural Information Processing Systems Foundation","issue":"January","status":"public","conference":{"location":"Montreal, Canada","name":"NIPS: Neural Information Processing Systems","end_date":"2014-12-13","start_date":"2014-12-08"},"_id":"1708","month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:53:35Z","department":[{"_id":"GaTk"}],"oa":1,"date_updated":"2025-06-03T11:45:08Z","oa_version":"None","intvolume":"        27","scopus_import":"1","main_file_link":[{"url":"http://papers.nips.cc/paper/5343-spatio-temporal-representations-of-uncertainty-in-spiking-neural-networks.pdf","open_access":"1"}],"publist_id":"5427","author":[{"last_name":"Savin","full_name":"Savin, Cristina","id":"3933349E-F248-11E8-B48F-1D18A9856A87","first_name":"Cristina"},{"last_name":"Denève","full_name":"Denève, Sophie","first_name":"Sophie"}],"page":"2024 - 2032","corr_author":"1","type":"conference","article_processing_charge":"No","day":"01","language":[{"iso":"eng"}],"date_published":"2014-01-01T00:00:00Z"},{"day":"06","article_processing_charge":"No","type":"journal_article","page":"2335 - 2342","author":[{"last_name":"Sassi","full_name":"Sassi, Massimiliano","first_name":"Massimiliano"},{"full_name":"Ali, Olivier","first_name":"Olivier","last_name":"Ali"},{"last_name":"Boudon","first_name":"Frédéric","full_name":"Boudon, Frédéric"},{"full_name":"Cloarec, Gladys","first_name":"Gladys","last_name":"Cloarec"},{"first_name":"Ursula","full_name":"Abad, Ursula","last_name":"Abad"},{"first_name":"Coralie","full_name":"Cellier, Coralie","last_name":"Cellier"},{"full_name":"Chen, Xu","id":"4E5ADCAA-F248-11E8-B48F-1D18A9856A87","first_name":"Xu","last_name":"Chen"},{"last_name":"Gilles","full_name":"Gilles, Benjamin","first_name":"Benjamin"},{"full_name":"Milani, Pascale","first_name":"Pascale","last_name":"Milani"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","full_name":"Friml, Jirí","last_name":"Friml","orcid":"0000-0002-8302-7596"},{"last_name":"Vernoux","full_name":"Vernoux, Teva","first_name":"Teva"},{"full_name":"Godin, Christophe","first_name":"Christophe","last_name":"Godin"},{"last_name":"Hamant","first_name":"Olivier","full_name":"Hamant, Olivier"},{"full_name":"Traas, Jan","first_name":"Jan","last_name":"Traas"}],"publist_id":"5248","main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-01074821","open_access":"1"}],"scopus_import":"1","external_id":{"isi":["000342747600031"]},"date_published":"2014-10-06T00:00:00Z","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1016/j.cub.2014.08.036","issue":"19","status":"public","publisher":"Cell Press","quality_controlled":"1","abstract":[{"lang":"eng","text":"To control morphogenesis, molecular regulatory networks have to interfere with the mechanical properties of the individual cells of developing organs and tissues, but how this is achieved is not well known. We study this issue here in the shoot meristem of higher plants, a group of undifferentiated cells where complex changes in growth rates and directions lead to the continuous formation of new organs [1, 2]. Here, we show that the plant hormone auxin plays an important role in this process via a dual, local effect on the extracellular matrix, the cell wall, which determines cell shape. Our study reveals that auxin not only causes a limited reduction in wall stiffness but also directly interferes with wall anisotropy via the regulation of cortical microtubule dynamics. We further show that to induce growth isotropy and organ outgrowth, auxin somehow interferes with the cortical microtubule-ordering activity of a network of proteins, including AUXIN BINDING PROTEIN 1 and KATANIN 1. Numerical simulations further indicate that the induced isotropy is sufficient to amplify the effects of the relatively minor changes in wall stiffness to promote organogenesis and the establishment of new growth axes in a robust manner."}],"title":"An auxin-mediated shift toward growth isotropy promotes organ formation at the shoot meristem in Arabidopsis","acknowledgement":"This work was funded by grants from EraSysBio+ (iSAM) and ERC (Morphodynamics). ","year":"2014","volume":24,"publication_status":"published","citation":{"ista":"Sassi M, Ali O, Boudon F, Cloarec G, Abad U, Cellier C, Chen X, Gilles B, Milani P, Friml J, Vernoux T, Godin C, Hamant O, Traas J. 2014. An auxin-mediated shift toward growth isotropy promotes organ formation at the shoot meristem in Arabidopsis. Current Biology. 24(19), 2335–2342.","mla":"Sassi, Massimiliano, et al. “An Auxin-Mediated Shift toward Growth Isotropy Promotes Organ Formation at the Shoot Meristem in Arabidopsis.” <i>Current Biology</i>, vol. 24, no. 19, Cell Press, 2014, pp. 2335–42, doi:<a href=\"https://doi.org/10.1016/j.cub.2014.08.036\">10.1016/j.cub.2014.08.036</a>.","ama":"Sassi M, Ali O, Boudon F, et al. An auxin-mediated shift toward growth isotropy promotes organ formation at the shoot meristem in Arabidopsis. <i>Current Biology</i>. 2014;24(19):2335-2342. doi:<a href=\"https://doi.org/10.1016/j.cub.2014.08.036\">10.1016/j.cub.2014.08.036</a>","apa":"Sassi, M., Ali, O., Boudon, F., Cloarec, G., Abad, U., Cellier, C., … Traas, J. (2014). An auxin-mediated shift toward growth isotropy promotes organ formation at the shoot meristem in Arabidopsis. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2014.08.036\">https://doi.org/10.1016/j.cub.2014.08.036</a>","chicago":"Sassi, Massimiliano, Olivier Ali, Frédéric Boudon, Gladys Cloarec, Ursula Abad, Coralie Cellier, Xu Chen, et al. “An Auxin-Mediated Shift toward Growth Isotropy Promotes Organ Formation at the Shoot Meristem in Arabidopsis.” <i>Current Biology</i>. Cell Press, 2014. <a href=\"https://doi.org/10.1016/j.cub.2014.08.036\">https://doi.org/10.1016/j.cub.2014.08.036</a>.","ieee":"M. Sassi <i>et al.</i>, “An auxin-mediated shift toward growth isotropy promotes organ formation at the shoot meristem in Arabidopsis,” <i>Current Biology</i>, vol. 24, no. 19. Cell Press, pp. 2335–2342, 2014.","short":"M. Sassi, O. Ali, F. Boudon, G. Cloarec, U. Abad, C. Cellier, X. Chen, B. Gilles, P. Milani, J. Friml, T. Vernoux, C. Godin, O. Hamant, J. Traas, Current Biology 24 (2014) 2335–2342."},"doi":"10.1016/j.cub.2014.08.036","intvolume":"        24","oa_version":"Submitted Version","publication":"Current Biology","date_updated":"2025-09-29T13:10:45Z","isi":1,"oa":1,"department":[{"_id":"JiFr"}],"date_created":"2018-12-11T11:54:22Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"10","_id":"1852"},{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:54:22Z","department":[{"_id":"KrCh"}],"conference":{"name":"IOT: Internet of Things","end_date":"2014-10-08","location":"Cambridge, USA","start_date":"2014-10-06"},"_id":"1853","fulldoi":"https://doi.org/10.1109/IOT.2014.7030120","month":"02","date_published":"2014-02-03T00:00:00Z","oa_version":"None","date_updated":"2024-10-21T06:02:48Z","language":[{"iso":"eng"}],"page":"85 - 90","citation":{"mla":"Jha, Susmit, et al. <i>Game Theoretic Secure Localization in Wireless Sensor Networks</i>. IEEE, 2014, pp. 85–90, doi:<a href=\"https://doi.org/10.1109/IOT.2014.7030120\">10.1109/IOT.2014.7030120</a>.","ama":"Jha S, Tripakis S, Seshia S, Chatterjee K. Game theoretic secure localization in wireless sensor networks. In: IEEE; 2014:85-90. doi:<a href=\"https://doi.org/10.1109/IOT.2014.7030120\">10.1109/IOT.2014.7030120</a>","ista":"Jha S, Tripakis S, Seshia S, Chatterjee K. 2014. Game theoretic secure localization in wireless sensor networks. IOT: Internet of Things, 85–90.","ieee":"S. Jha, S. Tripakis, S. Seshia, and K. Chatterjee, “Game theoretic secure localization in wireless sensor networks,” presented at the IOT: Internet of Things, Cambridge, USA, 2014, pp. 85–90.","short":"S. Jha, S. Tripakis, S. Seshia, K. Chatterjee, in:, IEEE, 2014, pp. 85–90.","apa":"Jha, S., Tripakis, S., Seshia, S., &#38; Chatterjee, K. (2014). Game theoretic secure localization in wireless sensor networks (pp. 85–90). Presented at the IOT: Internet of Things, Cambridge, USA: IEEE. <a href=\"https://doi.org/10.1109/IOT.2014.7030120\">https://doi.org/10.1109/IOT.2014.7030120</a>","chicago":"Jha, Susmit, Stavros Tripakis, Sanjit Seshia, and Krishnendu Chatterjee. “Game Theoretic Secure Localization in Wireless Sensor Networks,” 85–90. IEEE, 2014. <a href=\"https://doi.org/10.1109/IOT.2014.7030120\">https://doi.org/10.1109/IOT.2014.7030120</a>."},"publication_status":"published","year":"2014","scopus_import":"1","doi":"10.1109/IOT.2014.7030120","publist_id":"5247","author":[{"first_name":"Susmit","full_name":"Jha, Susmit","last_name":"Jha"},{"first_name":"Stavros","full_name":"Tripakis, Stavros","last_name":"Tripakis"},{"first_name":"Sanjit","full_name":"Seshia, Sanjit","last_name":"Seshia"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"}],"quality_controlled":"1","day":"03","publisher":"IEEE","status":"public","type":"conference","abstract":[{"lang":"eng","text":"Wireless sensor networks (WSNs) composed of low-power, low-cost sensor nodes are expected to form the backbone of future intelligent networks for a broad range of civil, industrial and military applications. These sensor nodes are often deployed through random spreading, and function in dynamic environments. Many applications of WSNs such as pollution tracking, forest fire detection, and military surveillance require knowledge of the location of constituent nodes. But the use of technologies such as GPS on all nodes is prohibitive due to power and cost constraints. So, the sensor nodes need to autonomously determine their locations. Most localization techniques use anchor nodes with known locations to determine the position of remaining nodes. Localization techniques have two conflicting requirements. On one hand, an ideal localization technique should be computationally simple and on the other hand, it must be resistant to attacks that compromise anchor nodes. In this paper, we propose a computationally light-weight game theoretic secure localization technique and demonstrate its effectiveness in comparison to existing techniques."}],"title":"Game theoretic secure localization in wireless sensor networks"},{"scopus_import":"1","author":[{"last_name":"Guerrero","first_name":"Paul","full_name":"Guerrero, Paul"},{"full_name":"Auzinger, Thomas","id":"4718F954-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","orcid":"0000-0002-1546-3265","last_name":"Auzinger"},{"first_name":"Michael","full_name":"Wimmer, Michael","last_name":"Wimmer"},{"last_name":"Jeschke","full_name":"Jeschke, Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan"}],"publist_id":"5246","pubrep_id":"574","page":"239 - 252","type":"journal_article","article_processing_charge":"No","day":"05","has_accepted_license":"1","ddc":["000"],"fulldoi":"https://doi.org/10.1111/cgf.12509","language":[{"iso":"eng"}],"external_id":{"isi":["000350145600019"]},"date_published":"2014-11-05T00:00:00Z","doi":"10.1111/cgf.12509","citation":{"chicago":"Guerrero, Paul, Thomas Auzinger, Michael Wimmer, and Stefan Jeschke. “Partial Shape Matching Using Transformation Parameter Similarity.” <i>Computer Graphics Forum</i>. Wiley, 2014. <a href=\"https://doi.org/10.1111/cgf.12509\">https://doi.org/10.1111/cgf.12509</a>.","apa":"Guerrero, P., Auzinger, T., Wimmer, M., &#38; Jeschke, S. (2014). Partial shape matching using transformation parameter similarity. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.12509\">https://doi.org/10.1111/cgf.12509</a>","short":"P. Guerrero, T. Auzinger, M. Wimmer, S. Jeschke, Computer Graphics Forum 34 (2014) 239–252.","ieee":"P. Guerrero, T. Auzinger, M. Wimmer, and S. Jeschke, “Partial shape matching using transformation parameter similarity,” <i>Computer Graphics Forum</i>, vol. 34, no. 1. Wiley, pp. 239–252, 2014.","ista":"Guerrero P, Auzinger T, Wimmer M, Jeschke S. 2014. Partial shape matching using transformation parameter similarity. Computer Graphics Forum. 34(1), 239–252.","ama":"Guerrero P, Auzinger T, Wimmer M, Jeschke S. Partial shape matching using transformation parameter similarity. <i>Computer Graphics Forum</i>. 2014;34(1):239-252. doi:<a href=\"https://doi.org/10.1111/cgf.12509\">10.1111/cgf.12509</a>","mla":"Guerrero, Paul, et al. “Partial Shape Matching Using Transformation Parameter Similarity.” <i>Computer Graphics Forum</i>, vol. 34, no. 1, Wiley, 2014, pp. 239–52, doi:<a href=\"https://doi.org/10.1111/cgf.12509\">10.1111/cgf.12509</a>."},"publication_status":"published","year":"2014","volume":34,"abstract":[{"text":"In this paper, we present a method for non-rigid, partial shape matching in vector graphics. Given a user-specified query region in a 2D shape, similar regions are found, even if they are non-linearly distorted. Furthermore, a non-linear mapping is established between the query regions and these matches, which allows the automatic transfer of editing operations such as texturing. This is achieved by a two-step approach. First, pointwise correspondences between the query region and the whole shape are established. The transformation parameters of these correspondences are registered in an appropriate transformation space. For transformations between similar regions, these parameters form surfaces in transformation space, which are extracted in the second step of our method. The extracted regions may be related to the query region by a non-rigid transform, enabling non-rigid shape matching. In this paper, we present a method for non-rigid, partial shape matching in vector graphics. Given a user-specified query region in a 2D shape, similar regions are found, even if they are non-linearly distorted. Furthermore, a non-linear mapping is established between the query regions and these matches, which allows the automatic transfer of editing operations such as texturing. This is achieved by a two-step approach. First, pointwise correspondences between the query region and the whole shape are established. The transformation parameters of these correspondences are registered in an appropriate transformation space. For transformations between similar regions, these parameters form surfaces in transformation space, which are extracted in the second step of our method. The extracted regions may be related to the query region by a non-rigid transform, enabling non-rigid shape matching.","lang":"eng"}],"title":"Partial shape matching using transformation parameter similarity","quality_controlled":"1","issue":"1","status":"public","publisher":"Wiley","_id":"1854","month":"11","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:54:22Z","department":[{"_id":"ChWo"}],"isi":1,"file":[{"creator":"system","file_name":"IST-2016-574-v1+1_Guerrero-2014-TPS-paper.pdf","file_id":"5182","date_updated":"2020-07-14T12:45:19Z","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:15:58Z","checksum":"91946bfc509c77f5fd3151a3ff2b2c8f","file_size":24817484,"relation":"main_file"}],"date_updated":"2025-09-23T09:47:49Z","oa":1,"publication":"Computer Graphics Forum","oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:45:19Z","intvolume":"        34"},{"project":[{"name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7","_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300"}],"publisher":"Nature Publishing Group","issue":"729","status":"public","quality_controlled":"1","abstract":[{"text":"The prominent and evolutionarily ancient role of the plant hormone auxin is the regulation of cell expansion. Cell expansion requires ordered arrangement of the cytoskeleton but molecular mechanisms underlying its regulation by signalling molecules including auxin are unknown. Here we show in the model plant Arabidopsis thaliana that in elongating cells exogenous application of auxin or redistribution of endogenous auxin induces very rapid microtubule re-orientation from transverse to longitudinal, coherent with the inhibition of cell expansion. This fast auxin effect requires auxin binding protein 1 (ABP1) and involves a contribution of downstream signalling components such as ROP6 GTPase, ROP-interactive protein RIC1 and the microtubule-severing protein katanin. These components are required for rapid auxin-and ABP1-mediated re-orientation of microtubules to regulate cell elongation in roots and dark-grown hypocotyls as well as asymmetric growth during gravitropic responses.","lang":"eng"}],"title":"Inhibition of cell expansion by rapid ABP1-mediated auxin effect on microtubules","acknowledgement":"We thank R. Dixit for performing complementary experiments, D. W. Ehrhardt and T. Hashimoto for providing the seeds of TUB6–RFP and EB1b–GFP respectively, E. Zazimalova, J. Petrasek and M. Fendrych for discussing the manuscript and J. Leung for text optimization. This work was supported by the European Research Council (project ERC-2011-StG-20101109-PSDP, to J.F.), ANR blanc AuxiWall project (ANR-11-BSV5-0007, to C.P.-R. and L.G.) and the Agency for Innovation by Science and Technology (IWT) (to H.R.). This work benefited from the facilities and expertise of the Imagif Cell Biology platform (http://www.imagif.cnrs.fr), which is supported by the Conseil Général de l’Essonne.","volume":516,"year":"2014","publication_status":"published","citation":{"short":"X. Chen, L. Grandont, H. Li, R. Hauschild, S. Paque, A. Abuzeineh, H. Rakusova, E. Benková, C. Perrot Rechenmann, J. Friml, Nature 516 (2014) 90–93.","ieee":"X. Chen <i>et al.</i>, “Inhibition of cell expansion by rapid ABP1-mediated auxin effect on microtubules,” <i>Nature</i>, vol. 516, no. 729. Nature Publishing Group, pp. 90–93, 2014.","chicago":"Chen, Xu, Laurie Grandont, Hongjiang Li, Robert Hauschild, Sébastien Paque, Anas Abuzeineh, Hana Rakusova, Eva Benková, Catherine Perrot Rechenmann, and Jiří Friml. “Inhibition of Cell Expansion by Rapid ABP1-Mediated Auxin Effect on Microtubules.” <i>Nature</i>. Nature Publishing Group, 2014. <a href=\"https://doi.org/10.1038/nature13889\">https://doi.org/10.1038/nature13889</a>.","apa":"Chen, X., Grandont, L., Li, H., Hauschild, R., Paque, S., Abuzeineh, A., … Friml, J. (2014). Inhibition of cell expansion by rapid ABP1-mediated auxin effect on microtubules. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature13889\">https://doi.org/10.1038/nature13889</a>","ama":"Chen X, Grandont L, Li H, et al. Inhibition of cell expansion by rapid ABP1-mediated auxin effect on microtubules. <i>Nature</i>. 2014;516(729):90-93. doi:<a href=\"https://doi.org/10.1038/nature13889\">10.1038/nature13889</a>","mla":"Chen, Xu, et al. “Inhibition of Cell Expansion by Rapid ABP1-Mediated Auxin Effect on Microtubules.” <i>Nature</i>, vol. 516, no. 729, Nature Publishing Group, 2014, pp. 90–93, doi:<a href=\"https://doi.org/10.1038/nature13889\">10.1038/nature13889</a>.","ista":"Chen X, Grandont L, Li H, Hauschild R, Paque S, Abuzeineh A, Rakusova H, Benková E, Perrot Rechenmann C, Friml J. 2014. Inhibition of cell expansion by rapid ABP1-mediated auxin effect on microtubules. Nature. 516(729), 90–93."},"doi":"10.1038/nature13889","intvolume":"       516","oa_version":"Submitted Version","publication":"Nature","oa":1,"isi":1,"date_updated":"2025-09-29T13:10:05Z","article_type":"original","department":[{"_id":"JiFr"},{"_id":"Bio"},{"_id":"EvBe"}],"date_created":"2018-12-11T11:54:25Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"12","_id":"1862","ec_funded":1,"day":"04","article_processing_charge":"No","type":"journal_article","corr_author":"1","page":"90 - 93","publist_id":"5237","author":[{"first_name":"Xu","id":"4E5ADCAA-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Xu","last_name":"Chen"},{"first_name":"Laurie","full_name":"Grandont, Laurie","last_name":"Grandont"},{"full_name":"Li, Hongjiang","id":"33CA54A6-F248-11E8-B48F-1D18A9856A87","first_name":"Hongjiang","orcid":"0000-0001-5039-9660","last_name":"Li"},{"orcid":"0000-0001-9843-3522","last_name":"Hauschild","full_name":"Hauschild, Robert","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"},{"full_name":"Paque, Sébastien","first_name":"Sébastien","last_name":"Paque"},{"last_name":"Abuzeineh","full_name":"Abuzeineh, Anas","first_name":"Anas"},{"last_name":"Rakusova","full_name":"Rakusova, Hana","id":"4CAAA450-78D2-11EA-8E57-B40A396E08BA","first_name":"Hana"},{"first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","full_name":"Benková, Eva","last_name":"Benková","orcid":"0000-0002-8510-9739"},{"last_name":"Perrot Rechenmann","full_name":"Perrot Rechenmann, Catherine","first_name":"Catherine"},{"orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"}],"publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"scopus_import":"1","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4257754/","open_access":"1"}],"external_id":{"pmid":["25409144"],"isi":["000346310800045"]},"date_published":"2014-12-04T00:00:00Z","pmid":1,"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1038/nature13889"},{"doi":"10.1007/978-3-319-13338-6_6","volume":8855,"year":"2014","citation":{"chicago":"Hofferek, Georg, and Ashutosh Gupta. “Suraq - a Controller Synthesis Tool Using Uninterpreted Functions.” In <i>HVC 2014</i>, edited by Eran Yahav, 8855:68–74. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13338-6_6\">https://doi.org/10.1007/978-3-319-13338-6_6</a>.","apa":"Hofferek, G., &#38; Gupta, A. (2014). Suraq - a controller synthesis tool using uninterpreted functions. In E. Yahav (Ed.), <i>HVC 2014</i> (Vol. 8855, pp. 68–74). Haifa, Israel: Springer. <a href=\"https://doi.org/10.1007/978-3-319-13338-6_6\">https://doi.org/10.1007/978-3-319-13338-6_6</a>","short":"G. Hofferek, A. Gupta, in:, E. Yahav (Ed.), HVC 2014, Springer, 2014, pp. 68–74.","ieee":"G. Hofferek and A. Gupta, “Suraq - a controller synthesis tool using uninterpreted functions,” in <i>HVC 2014</i>, Haifa, Israel, 2014, vol. 8855, pp. 68–74.","ista":"Hofferek G, Gupta A. 2014. Suraq - a controller synthesis tool using uninterpreted functions. HVC 2014. HVC: Haifa Verification Conference, LNCS, vol. 8855, 68–74.","ama":"Hofferek G, Gupta A. Suraq - a controller synthesis tool using uninterpreted functions. In: Yahav E, ed. <i>HVC 2014</i>. Vol 8855. Springer; 2014:68-74. doi:<a href=\"https://doi.org/10.1007/978-3-319-13338-6_6\">10.1007/978-3-319-13338-6_6</a>","mla":"Hofferek, Georg, and Ashutosh Gupta. “Suraq - a Controller Synthesis Tool Using Uninterpreted Functions.” <i>HVC 2014</i>, edited by Eran Yahav, vol. 8855, Springer, 2014, pp. 68–74, doi:<a href=\"https://doi.org/10.1007/978-3-319-13338-6_6\">10.1007/978-3-319-13338-6_6</a>."},"publication_status":"published","abstract":[{"lang":"eng","text":"Boolean controllers for systems with complex datapaths are often very difficult to implement correctly, in particular when concurrency is involved. Yet, in many instances it is easy to formally specify correctness. For example, the specification for the controller of a pipelined processor only has to state that the pipelined processor gives the same results as a non-pipelined reference design. This makes such controllers a good target for automated synthesis. However, an efficient abstraction for the complex datapath elements is needed, as a bit-precise description is often infeasible. We present Suraq, the first controller synthesis tool which uses uninterpreted functions for the abstraction. Quantified firstorder formulas (with specific quantifier structure) serve as the specification language from which Suraq synthesizes Boolean controllers. Suraq transforms the specification into an unsatisfiable SMT formula, and uses Craig interpolation to compute its results. Using Suraq, we were able to synthesize a controller (consisting of two Boolean signals) for a five-stage pipelined DLX processor in roughly one hour and 15 minutes."}],"title":"Suraq - a controller synthesis tool using uninterpreted functions","acknowledgement":"The work presented in this paper was supported in part by the European Research Council (ERC) under grant agreement QUAINT (I774-N23)","status":"public","publisher":"Springer","project":[{"call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"}],"quality_controlled":"1","month":"01","ec_funded":1,"_id":"1869","editor":[{"first_name":"Eran","full_name":"Yahav, Eran","last_name":"Yahav"}],"conference":{"start_date":"2014-11-18","end_date":"2014-11-20","name":"HVC: Haifa Verification Conference","location":"Haifa, Israel"},"department":[{"_id":"ToHe"}],"date_created":"2018-12-11T11:54:27Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-21T06:02:48Z","intvolume":"      8855","oa_version":"None","publication":"HVC 2014","author":[{"first_name":"Georg","full_name":"Hofferek, Georg","last_name":"Hofferek"},{"last_name":"Gupta","full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh"}],"publist_id":"5228","scopus_import":"1","page":"68 - 74","type":"conference","day":"01","fulldoi":"https://doi.org/10.1007/978-3-319-13338-6_6","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"date_published":"2014-01-01T00:00:00Z"},{"publist_id":"5227","author":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"last_name":"Otop","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan"},{"first_name":"Roopsha","id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87","full_name":"Samanta, Roopsha","last_name":"Samanta"}],"scopus_import":"1","pubrep_id":"804","page":"431 - 443","corr_author":"1","type":"conference","day":"01","fulldoi":"https://doi.org/10.4230/LIPIcs.FSTTCS.2014.431","ddc":["004"],"has_accepted_license":"1","language":[{"iso":"eng"}],"date_published":"2014-12-01T00:00:00Z","alternative_title":["LIPIcs"],"doi":"10.4230/LIPIcs.FSTTCS.2014.431","volume":29,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2014","citation":{"chicago":"Henzinger, Thomas A, Jan Otop, and Roopsha Samanta. “Lipschitz Robustness of Finite-State Transducers.” In <i>Leibniz International Proceedings in Informatics, LIPIcs</i>, 29:431–43. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2014.431\">https://doi.org/10.4230/LIPIcs.FSTTCS.2014.431</a>.","apa":"Henzinger, T. A., Otop, J., &#38; Samanta, R. (2014). Lipschitz robustness of finite-state transducers. In <i>Leibniz International Proceedings in Informatics, LIPIcs</i> (Vol. 29, pp. 431–443). Delhi, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2014.431\">https://doi.org/10.4230/LIPIcs.FSTTCS.2014.431</a>","short":"T.A. Henzinger, J. Otop, R. Samanta, in:, Leibniz International Proceedings in Informatics, LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 431–443.","ieee":"T. A. Henzinger, J. Otop, and R. Samanta, “Lipschitz robustness of finite-state transducers,” in <i>Leibniz International Proceedings in Informatics, LIPIcs</i>, Delhi, India, 2014, vol. 29, pp. 431–443.","ista":"Henzinger TA, Otop J, Samanta R. 2014. Lipschitz robustness of finite-state transducers. Leibniz International Proceedings in Informatics, LIPIcs. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 29, 431–443.","ama":"Henzinger TA, Otop J, Samanta R. Lipschitz robustness of finite-state transducers. In: <i>Leibniz International Proceedings in Informatics, LIPIcs</i>. Vol 29. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:431-443. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2014.431\">10.4230/LIPIcs.FSTTCS.2014.431</a>","mla":"Henzinger, Thomas A., et al. “Lipschitz Robustness of Finite-State Transducers.” <i>Leibniz International Proceedings in Informatics, LIPIcs</i>, vol. 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 431–43, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2014.431\">10.4230/LIPIcs.FSTTCS.2014.431</a>."},"publication_status":"published","title":"Lipschitz robustness of finite-state transducers","abstract":[{"lang":"eng","text":"We investigate the problem of checking if a finite-state transducer is robust to uncertainty in its input. Our notion of robustness is based on the analytic notion of Lipschitz continuity - a transducer is K-(Lipschitz) robust if the perturbation in its output is at most K times the perturbation in its input. We quantify input and output perturbation using similarity functions. We show that K-robustness is undecidable even for deterministic transducers. We identify a class of functional transducers, which admits a polynomial time automata-theoretic decision procedure for K-robustness. This class includes Mealy machines and functional letter-to-letter transducers. We also study K-robustness of nondeterministic transducers. Since a nondeterministic transducer generates a set of output words for each input word, we quantify output perturbation using setsimilarity functions. We show that K-robustness of nondeterministic transducers is undecidable, even for letter-to-letter transducers. We identify a class of set-similarity functions which admit decidable K-robustness of letter-to-letter transducers."}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","status":"public","quality_controlled":"1","month":"12","conference":{"location":"Delhi, India","end_date":"2014-12-17","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","start_date":"2014-12-15"},"_id":"1870","department":[{"_id":"ToHe"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:54:27Z","oa":1,"file":[{"file_id":"4734","date_updated":"2020-07-14T12:45:19Z","file_name":"IST-2017-804-v1+1_37.pdf","creator":"system","checksum":"7b1aff1710a8bffb7080ec07f62d9a17","file_size":562151,"relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:09:11Z"}],"date_updated":"2024-10-21T06:02:49Z","intvolume":"        29","file_date_updated":"2020-07-14T12:45:19Z","publication":"Leibniz International Proceedings in Informatics, LIPIcs","oa_version":"Published Version"},{"publist_id":"5221","author":[{"full_name":"Samanta, Roopsha","id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87","first_name":"Roopsha","last_name":"Samanta"},{"last_name":"Olivo","full_name":"Olivo, Oswaldo","first_name":"Oswaldo"},{"last_name":"Allen","first_name":"Emerson","full_name":"Allen, Emerson"}],"scopus_import":1,"pubrep_id":"313","page":"268 - 284","type":"conference","day":"01","fulldoi":"https://doi.org/10.1007/978-3-319-10936-7_17","ddc":["000","005"],"has_accepted_license":"1","language":[{"iso":"eng"}],"date_published":"2014-09-01T00:00:00Z","alternative_title":["LNCS"],"doi":"10.1007/978-3-319-10936-7_17","year":"2014","volume":8723,"publication_status":"published","citation":{"chicago":"Samanta, Roopsha, Oswaldo Olivo, and Emerson Allen. “Cost-Aware Automatic Program Repair.” edited by Markus Müller-Olm and Helmut Seidl, 8723:268–84. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-10936-7_17\">https://doi.org/10.1007/978-3-319-10936-7_17</a>.","apa":"Samanta, R., Olivo, O., &#38; Allen, E. (2014). Cost-aware automatic program repair. In M. Müller-Olm &#38; H. Seidl (Eds.) (Vol. 8723, pp. 268–284). Presented at the SAS: Static Analysis Symposium, Munich, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-10936-7_17\">https://doi.org/10.1007/978-3-319-10936-7_17</a>","short":"R. Samanta, O. Olivo, E. Allen, in:, M. Müller-Olm, H. Seidl (Eds.), Springer, 2014, pp. 268–284.","ieee":"R. Samanta, O. Olivo, and E. Allen, “Cost-aware automatic program repair,” presented at the SAS: Static Analysis Symposium, Munich, Germany, 2014, vol. 8723, pp. 268–284.","ista":"Samanta R, Olivo O, Allen E. 2014. Cost-aware automatic program repair. SAS: Static Analysis Symposium, LNCS, vol. 8723, 268–284.","ama":"Samanta R, Olivo O, Allen E. Cost-aware automatic program repair. In: Müller-Olm M, Seidl H, eds. Vol 8723. Springer; 2014:268-284. doi:<a href=\"https://doi.org/10.1007/978-3-319-10936-7_17\">10.1007/978-3-319-10936-7_17</a>","mla":"Samanta, Roopsha, et al. <i>Cost-Aware Automatic Program Repair</i>. Edited by Markus Müller-Olm and Helmut Seidl, vol. 8723, Springer, 2014, pp. 268–84, doi:<a href=\"https://doi.org/10.1007/978-3-319-10936-7_17\">10.1007/978-3-319-10936-7_17</a>."},"abstract":[{"lang":"eng","text":"We present a formal framework for repairing infinite-state, imperative, sequential programs, with (possibly recursive) procedures and multiple assertions; the framework can generate repaired programs by modifying the original erroneous program in multiple program locations, and can ensure the readability of the repaired program using user-defined expression templates; the framework also generates a set of inductive assertions that serve as a proof of correctness of the repaired program. As a step toward integrating programmer intent and intuition in automated program repair, we present a cost-aware formulation - given a cost function associated with permissible statement modifications, the goal is to ensure that the total program modification cost does not exceed a given repair budget. As part of our predicate abstractionbased solution framework, we present a sound and complete algorithm for repair of Boolean programs. We have developed a prototype tool based on SMT solving and used it successfully to repair diverse errors in benchmark C programs."}],"title":"Cost-aware automatic program repair","publisher":"Springer","status":"public","quality_controlled":"1","month":"09","conference":{"start_date":"2014-09-11","name":"SAS: Static Analysis Symposium","end_date":"2014-09-14","location":"Munich, Germany"},"_id":"1875","editor":[{"first_name":"Markus","full_name":"Müller-Olm, Markus","last_name":"Müller-Olm"},{"full_name":"Seidl, Helmut","first_name":"Helmut","last_name":"Seidl"}],"department":[{"_id":"ToHe"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:54:29Z","oa":1,"file":[{"access_level":"open_access","date_created":"2018-12-12T10:07:51Z","content_type":"application/pdf","file_size":409485,"checksum":"78ec4ea1bdecc676cd3e8cad35c6182c","relation":"main_file","creator":"system","file_name":"IST-2014-313-v1+1_SOE.SAS14.pdf","file_id":"4650","date_updated":"2020-07-14T12:45:19Z"}],"date_updated":"2021-01-12T06:53:46Z","intvolume":"      8723","file_date_updated":"2020-07-14T12:45:19Z","oa_version":"Submitted Version"}]