[{"doi":"10.1007/978-3-642-11319-2_6","editor":[{"first_name":"Gilles","full_name":"Barthe, Gilles","last_name":"Barthe"},{"first_name":"Manuel","last_name":"Hermenegildo","full_name":"Hermenegildo, Manuel"}],"year":"2010","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2010-01-19","start_date":"2010-01-17","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","location":"Madrid, Spain"},"date_created":"2018-12-11T12:08:33Z","alternative_title":["LNCS"],"title":"Building a calculus of data structures","type":"conference","language":[{"iso":"eng"}],"publication_status":"published","author":[{"first_name":"Viktor","last_name":"Kuncak","full_name":"Kuncak, Viktor"},{"last_name":"Piskac","full_name":"Piskac, Ruzica","first_name":"Ruzica"},{"first_name":"Philippe","full_name":"Suter, Philippe","last_name":"Suter"},{"full_name":"Wies, Thomas","last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"}],"day":"01","oa_version":"Submitted Version","main_file_link":[{"url":"https://infoscience.epfl.ch/record/161290/","open_access":"1"}],"abstract":[{"lang":"eng","text":"Techniques such as verification condition generation, predicate abstraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Programs and their specifications often make use of data structures such as sets, multisets, algebraic data types, or graphs. Consequently, formulas generated from verification also involve such data structures. To automate the proofs of such formulas we propose a logic (a “calculus”) of such data structures. We build the calculus by starting from decidable logics of individual data structures, and connecting them through functions and sets, in ways that go beyond the frameworks such as Nelson-Oppen. The result are new decidable logics that can simultaneously specify properties of different kinds of data structures and overcome the limitations of the individual logics. Several of our decidable logics include abstraction functions that map a data structure into its more abstract view (a tree into a multiset, a multiset into a set), into a numerical quantity (the size or the height), or into the truth value of a candidate data structure invariant (sortedness, or the heap property). For algebraic data types, we identify an asymptotic many-to-one condition on the abstraction function that guarantees the existence of a decision procedure. In addition to the combination based on abstraction functions, we can combine multiple data structure theories if they all reduce to the same data structure logic. As an instance of this approach, we describe a decidable logic whose formulas are propositional combinations of formulas in: weak monadic second-order logic of two successors, two-variable logic with counting, multiset algebra with Presburger arithmetic, the Bernays-Schönfinkel-Ramsey class of first-order logic, and the logic of algebraic data types with the set content function. The subformulas in this combination can share common variables that refer to sets of objects along with the common set algebra operations. Such sound and complete combination is possible because the relations on sets definable in the component logics are all expressible in Boolean Algebra with Presburger Arithmetic. Presburger arithmetic and its new extensions play an important role in our decidability results. In several cases, when we combine logics that belong to NP, we can prove the satisfiability for the combined logic is still in NP."}],"date_published":"2010-01-01T00:00:00Z","date_updated":"2021-01-12T07:56:31Z","publist_id":"1081","oa":1,"scopus_import":1,"department":[{"_id":"ToHe"}],"status":"public","_id":"4378","page":"26 - 44","quality_controlled":"1","volume":5944,"citation":{"ieee":"V. Kuncak, R. Piskac, P. Suter, and T. Wies, “Building a calculus of data structures,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain, 2010, vol. 5944, pp. 26–44.","chicago":"Kuncak, Viktor, Ruzica Piskac, Philippe Suter, and Thomas Wies. “Building a Calculus of Data Structures.” edited by Gilles Barthe and Manuel Hermenegildo, 5944:26–44. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-11319-2_6\">https://doi.org/10.1007/978-3-642-11319-2_6</a>.","ama":"Kuncak V, Piskac R, Suter P, Wies T. Building a calculus of data structures. In: Barthe G, Hermenegildo M, eds. Vol 5944. Springer; 2010:26-44. doi:<a href=\"https://doi.org/10.1007/978-3-642-11319-2_6\">10.1007/978-3-642-11319-2_6</a>","ista":"Kuncak V, Piskac R, Suter P, Wies T. 2010. Building a calculus of data structures. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 5944, 26–44.","short":"V. Kuncak, R. Piskac, P. Suter, T. Wies, in:, G. Barthe, M. Hermenegildo (Eds.), Springer, 2010, pp. 26–44.","apa":"Kuncak, V., Piskac, R., Suter, P., &#38; Wies, T. (2010). Building a calculus of data structures. In G. Barthe &#38; M. Hermenegildo (Eds.) (Vol. 5944, pp. 26–44). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-642-11319-2_6\">https://doi.org/10.1007/978-3-642-11319-2_6</a>","mla":"Kuncak, Viktor, et al. <i>Building a Calculus of Data Structures</i>. Edited by Gilles Barthe and Manuel Hermenegildo, vol. 5944, Springer, 2010, pp. 26–44, doi:<a href=\"https://doi.org/10.1007/978-3-642-11319-2_6\">10.1007/978-3-642-11319-2_6</a>."},"intvolume":"      5944","publisher":"Springer","month":"01"},{"year":"2010","doi":"10.1007/978-3-642-14295-6_57","alternative_title":["LNCS"],"date_created":"2018-12-11T12:08:36Z","conference":{"location":"Edinburgh, UK","name":"CAV: Computer Aided Verification","start_date":"2010-07-15","end_date":"2010-07-17"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"title":"GIST: A solver for probabilistic games","type":"conference","project":[{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7"}],"publication_status":"published","day":"01","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"GIST is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with ω-regular objectives; and (b) synthesizes reasonable environment assumptions for synthesis of unrealizable specifications. Our tool provides the first and efficient implementations of several reduction-based techniques to solve turn-based probabilistic games, and uses the analysis of turn-based probabilistic games for synthesizing environment assumptions for unrealizable specifications."}],"file":[{"checksum":"0b2ef8c4037ffccc6902d93081af24f7","file_name":"IST-2012-43-v1+1_GIST-_A_solver_for_probabilistic_games.pdf","file_id":"5221","access_level":"open_access","relation":"main_file","creator":"system","date_updated":"2020-07-14T12:46:28Z","content_type":"application/pdf","date_created":"2018-12-12T10:16:33Z","file_size":293605}],"date_published":"2010-07-01T00:00:00Z","external_id":{"arxiv":["1004.2367"]},"date_updated":"2024-10-09T20:54:00Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5393"}]},"oa":1,"publist_id":"1068","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:28Z","ddc":["004"],"arxiv":1,"scopus_import":1,"_id":"4388","corr_author":"1","status":"public","article_processing_charge":"No","ec_funded":1,"page":"665 - 669","citation":{"ista":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2010. GIST: A solver for probabilistic games. CAV: Computer Aided Verification, LNCS, vol. 6174, 665–669.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, in:, Springer, 2010, pp. 665–669.","mla":"Chatterjee, Krishnendu, et al. <i>GIST: A Solver for Probabilistic Games</i>. Vol. 6174, Springer, 2010, pp. 665–69, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">10.1007/978-3-642-14295-6_57</a>.","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Radhakrishna, A. (2010). GIST: A solver for probabilistic games (Vol. 6174, pp. 665–669). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">https://doi.org/10.1007/978-3-642-14295-6_57</a>","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, “GIST: A solver for probabilistic games,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 665–669.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. GIST: A solver for probabilistic games. In: Vol 6174. Springer; 2010:665-669. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">10.1007/978-3-642-14295-6_57</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. “GIST: A Solver for Probabilistic Games,” 6174:665–69. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">https://doi.org/10.1007/978-3-642-14295-6_57</a>."},"has_accepted_license":"1","quality_controlled":"1","pubrep_id":"43","volume":6174,"publisher":"Springer","intvolume":"      6174","month":"07"},{"publisher":"IEEE","month":"08","page":"77 - 84","citation":{"chicago":"Doyen, Laurent, Thomas A Henzinger, Axel Legay, and Dejan Nickovic. “Robustness of Sequential Circuits,” 77–84. IEEE, 2010. <a href=\"https://doi.org/10.1109/ACSD.2010.26\">https://doi.org/10.1109/ACSD.2010.26</a>.","ama":"Doyen L, Henzinger TA, Legay A, Nickovic D. Robustness of sequential circuits. In: IEEE; 2010:77-84. doi:<a href=\"https://doi.org/10.1109/ACSD.2010.26\">10.1109/ACSD.2010.26</a>","ieee":"L. Doyen, T. A. Henzinger, A. Legay, and D. Nickovic, “Robustness of sequential circuits,” presented at the ACSD: Application of Concurrency to System Design, 2010, pp. 77–84.","apa":"Doyen, L., Henzinger, T. A., Legay, A., &#38; Nickovic, D. (2010). Robustness of sequential circuits (pp. 77–84). Presented at the ACSD: Application of Concurrency to System Design, IEEE. <a href=\"https://doi.org/10.1109/ACSD.2010.26\">https://doi.org/10.1109/ACSD.2010.26</a>","mla":"Doyen, Laurent, et al. <i>Robustness of Sequential Circuits</i>. IEEE, 2010, pp. 77–84, doi:<a href=\"https://doi.org/10.1109/ACSD.2010.26\">10.1109/ACSD.2010.26</a>.","ista":"Doyen L, Henzinger TA, Legay A, Nickovic D. 2010. Robustness of sequential circuits. ACSD: Application of Concurrency to System Design, 77–84.","short":"L. Doyen, T.A. Henzinger, A. Legay, D. Nickovic, in:, IEEE, 2010, pp. 77–84."},"has_accepted_license":"1","pubrep_id":"44","quality_controlled":"1","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:28Z","ddc":["004"],"scopus_import":1,"_id":"4389","status":"public","date_updated":"2021-01-12T07:56:36Z","oa":1,"publist_id":"1069","abstract":[{"text":"Digital components play a central role in the design of complex embedded systems. These components are interconnected with other, possibly analog, devices and the physical environment. This environment cannot be entirely captured and can provide inaccurate input data to the component. It is thus important for digital components to have a robust behavior, i.e. the presence of a small change in the input sequences should not result in a drastic change in the output sequences. In this paper, we study a notion of robustness for sequential circuits. However, since sequential circuits may have parts that are naturally discontinuous (e.g., digital controllers with switching behavior), we need a flexible framework that accommodates this fact and leaves discontinuous parts of the circuit out from the robustness analysis. As a consequence, we consider sequential circuits that have their input variables partitioned into two disjoint sets: control and disturbance variables. Our contributions are (1) a definition of robustness for sequential circuits as a form of continuity with respect to disturbance variables, (2) the characterization of the exact class of sequential circuits that are robust according to our definition, (3) an algorithm to decide whether a sequential circuit is robust or not.","lang":"eng"}],"date_published":"2010-08-23T00:00:00Z","file":[{"checksum":"42b2952bfc6b6974617bd554842b904a","relation":"main_file","access_level":"open_access","file_name":"IST-2012-44-v1+1_Robustness_of_sequential_circuits.pdf","file_id":"4733","date_updated":"2020-07-14T12:46:28Z","creator":"system","file_size":159920,"content_type":"application/pdf","date_created":"2018-12-12T10:09:10Z"}],"day":"23","author":[{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"last_name":"Legay","full_name":"Legay, Axel","first_name":"Axel"},{"last_name":"Nickovic","full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan"}],"oa_version":"Submitted Version","language":[{"iso":"eng"}],"type":"conference","title":"Robustness of sequential circuits","publication_status":"published","year":"2010","doi":"10.1109/ACSD.2010.26","date_created":"2018-12-11T12:08:36Z","conference":{"name":"ACSD: Application of Concurrency to System Design"},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},{"abstract":[{"lang":"eng","text":"Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations does not stem from the number of variables or the program size, but rather from the large number of possible interleavings. These implementations are therefore prime candidates for model checking. We introduce an algorithm for verifying linearizability of singly-linked heap-based concurrent data structures. We consider a model consisting of an unbounded heap where each vertex stores an element from an unbounded data domain, with a restricted set of operations for testing and updating pointers and data elements. Our main result is that linearizability is decidable for programs that invoke a fixed number of methods, possibly in parallel. This decidable fragment covers many of the common implementation techniques — fine-grained locking, lazy synchronization, and lock-free synchronization. We also show how the technique can be used to verify optimistic implementations with the help of programmer annotations. We developed a verification tool CoLT and evaluated it on a representative sample of Java implementations of the concurrent set data structure. The tool verified linearizability of a number of implementations, found a known error in a lock-free implementation and proved that the corrected version is linearizable."}],"date_published":"2010-07-01T00:00:00Z","file":[{"creator":"dernst","date_updated":"2020-07-14T12:46:28Z","content_type":"application/pdf","date_created":"2020-05-19T16:31:56Z","file_size":3633276,"checksum":"2eb211ce40b3c4988bce3a3592980704","file_id":"7873","file_name":"2010_CAV_Cerny.pdf","access_level":"open_access","relation":"main_file"}],"author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zufferey, Damien","last_name":"Zufferey","first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736"},{"full_name":"Chaudhuri, Swarat","last_name":"Chaudhuri","first_name":"Swarat"},{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"}],"day":"01","oa_version":"Submitted Version","type":"conference","title":"Model checking of linearizability of concurrent list implementations","language":[{"iso":"eng"}],"publication_status":"published","doi":"10.1007/978-3-642-14295-6_41","year":"2010","conference":{"location":"Edinburgh, UK","name":"CAV: Computer Aided Verification","start_date":"2010-07-15","end_date":"2010-07-17"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"date_created":"2018-12-11T12:08:36Z","intvolume":"      6174","publisher":"Springer","month":"07","page":"465 - 479","article_processing_charge":"No","pubrep_id":"27","quality_controlled":"1","volume":6174,"citation":{"apa":"Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., &#38; Alur, R. (2010). Model checking of linearizability of concurrent list implementations (Vol. 6174, pp. 465–479). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">https://doi.org/10.1007/978-3-642-14295-6_41</a>","mla":"Cerny, Pavol, et al. <i>Model Checking of Linearizability of Concurrent List Implementations</i>. Vol. 6174, Springer, 2010, pp. 465–79, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">10.1007/978-3-642-14295-6_41</a>.","ista":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. 2010. Model checking of linearizability of concurrent list implementations. CAV: Computer Aided Verification, LNCS, vol. 6174, 465–479.","short":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, in:, Springer, 2010, pp. 465–479.","chicago":"Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. “Model Checking of Linearizability of Concurrent List Implementations,” 6174:465–79. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">https://doi.org/10.1007/978-3-642-14295-6_41</a>.","ama":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. Model checking of linearizability of concurrent list implementations. In: Vol 6174. Springer; 2010:465-479. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">10.1007/978-3-642-14295-6_41</a>","ieee":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, “Model checking of linearizability of concurrent list implementations,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 465–479."},"has_accepted_license":"1","scopus_import":"1","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:28Z","ddc":["000"],"status":"public","_id":"4390","corr_author":"1","date_updated":"2024-10-21T06:03:05Z","publist_id":"1066","related_material":{"record":[{"id":"5391","status":"public","relation":"earlier_version"}]},"oa":1},{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"date_created":"2018-12-11T12:08:37Z","doi":"10.1007/978-3-642-13754-9_3","year":"2010","editor":[{"full_name":"Manna, Zohar","last_name":"Manna","first_name":"Zohar"},{"first_name":"Doron","last_name":"Peled","full_name":"Peled, Doron"}],"series_title":"Essays in Memory of Amir Pnueli","publication_status":"published","title":"Quantitative Simulation Games","type":"book_chapter","project":[{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"language":[{"iso":"eng"}],"oa_version":"None","author":[{"last_name":"Cerny","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"day":"29","publication":"Time For Verification: Essays in Memory of Amir Pnueli","date_published":"2010-07-29T00:00:00Z","abstract":[{"text":"While a boolean notion of correctness is given by a preorder on systems and properties, a quantitative notion of correctness is defined by a distance function on systems and properties, where the distance between a system and a property provides a measure of “fit” or “desirability.” In this article, we explore several ways how the simulation preorder can be generalized to a distance function. This is done by equipping the classical simulation game between a system and a property with quantitative objectives. In particular, for systems that satisfy a property, a quantitative simulation game can measure the “robustness” of the satisfaction, that is, how much the system can deviate from its nominal behavior while still satisfying the property. For systems that violate a property, a quantitative simulation game can measure the “seriousness” of the violation, that is, how much the property has to be modified so that it is satisfied by the system. These distances can be computed in polynomial time, since the computation reduces to the value problem in limit average games with constant weights. Finally, we demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes. ","lang":"eng"}],"publist_id":"1064","date_updated":"2024-10-09T20:53:58Z","status":"public","corr_author":"1","_id":"4392","scopus_import":1,"department":[{"_id":"ToHe"}],"quality_controlled":"1","volume":6200,"citation":{"chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Simulation Games.” In <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, edited by Zohar Manna and Doron Peled, 6200:42–60. Essays in Memory of Amir Pnueli. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">https://doi.org/10.1007/978-3-642-13754-9_3</a>.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Quantitative Simulation Games. In: Manna Z, Peled D, eds. <i>Time For Verification: Essays in Memory of Amir Pnueli</i>. Vol 6200. Essays in Memory of Amir Pnueli. Springer; 2010:42-60. doi:<a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">10.1007/978-3-642-13754-9_3</a>","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative Simulation Games,” in <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, vol. 6200, Z. Manna and D. Peled, Eds. Springer, 2010, pp. 42–60.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2010). Quantitative Simulation Games. In Z. Manna &#38; D. Peled (Eds.), <i>Time For Verification: Essays in Memory of Amir Pnueli</i> (Vol. 6200, pp. 42–60). Springer. <a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">https://doi.org/10.1007/978-3-642-13754-9_3</a>","mla":"Cerny, Pavol, et al. “Quantitative Simulation Games.” <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, edited by Zohar Manna and Doron Peled, vol. 6200, Springer, 2010, pp. 42–60, doi:<a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">10.1007/978-3-642-13754-9_3</a>.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Z. Manna, D. Peled (Eds.), Time For Verification: Essays in Memory of Amir Pnueli, Springer, 2010, pp. 42–60.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010.Quantitative Simulation Games. In: Time For Verification: Essays in Memory of Amir Pnueli. LNCS, vol. 6200, 42–60."},"page":"42 - 60","ec_funded":1,"month":"07","intvolume":"      6200","publisher":"Springer"},{"pubrep_id":"42","quality_controlled":"1","volume":6269,"citation":{"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>","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.","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>.","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>","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."},"has_accepted_license":"1","page":"235 - 268","ec_funded":1,"month":"11","intvolume":"      6269","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publist_id":"1065","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5389"},{"relation":"later_version","status":"public","id":"3249"}]},"oa":1,"date_updated":"2026-06-18T18:41:23Z","status":"public","_id":"4393","corr_author":"1","scopus_import":1,"department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:28Z","ddc":["005"],"oa_version":"Submitted Version","author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun"}],"day":"01","date_published":"2010-11-01T00:00:00Z","file":[{"relation":"main_file","access_level":"open_access","file_name":"IST-2012-42-v1+1_Simulation_distances.pdf","file_id":"5130","checksum":"ea567903676ba8afe0507ee11313dce5","file_size":198913,"content_type":"application/pdf","date_created":"2018-12-12T10:15:12Z","date_updated":"2020-07-14T12:46:28Z","creator":"system"}],"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"}],"conference":{"end_date":"2010-09-03","location":"Paris, France","start_date":"2010-08-31","name":"CONCUR: Concurrency Theory"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"date_created":"2018-12-11T12:08:37Z","acknowledgement":"This work was partially supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","doi":"10.1007/978-3-642-15375-4_18","year":"2010","publication_status":"published","type":"conference","title":"Simulation distances","project":[{"call_identifier":"FP7","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","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}]},{"citation":{"ieee":"S. Burckhardt, M. Musuvathi, and V. Singh, “Verifying local transformations on relaxed memory models,” presented at the CC: Compiler Construction, Pahos, Cyprus, 2010, vol. 6011, pp. 104–123.","ama":"Burckhardt S, Musuvathi M, Singh V. Verifying local transformations on relaxed memory models. In: Gupta R, ed. Vol 6011. Springer; 2010:104-123. doi:<a href=\"https://doi.org/10.1007/978-3-642-11970-5_7\">10.1007/978-3-642-11970-5_7</a>","chicago":"Burckhardt, Sebastian, Madanlal Musuvathi, and Vasu Singh. “Verifying Local Transformations on Relaxed Memory Models.” edited by Rajiv Gupta, 6011:104–23. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-11970-5_7\">https://doi.org/10.1007/978-3-642-11970-5_7</a>.","short":"S. Burckhardt, M. Musuvathi, V. Singh, in:, R. Gupta (Ed.), Springer, 2010, pp. 104–123.","ista":"Burckhardt S, Musuvathi M, Singh V. 2010. Verifying local transformations on relaxed memory models. CC: Compiler Construction, LNCS, vol. 6011, 104–123.","apa":"Burckhardt, S., Musuvathi, M., &#38; Singh, V. (2010). Verifying local transformations on relaxed memory models. In R. Gupta (Ed.) (Vol. 6011, pp. 104–123). Presented at the CC: Compiler Construction, Pahos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-11970-5_7\">https://doi.org/10.1007/978-3-642-11970-5_7</a>","mla":"Burckhardt, Sebastian, et al. <i>Verifying Local Transformations on Relaxed Memory Models</i>. Edited by Rajiv Gupta, vol. 6011, Springer, 2010, pp. 104–23, doi:<a href=\"https://doi.org/10.1007/978-3-642-11970-5_7\">10.1007/978-3-642-11970-5_7</a>."},"quality_controlled":"1","oa_version":"None","volume":6011,"day":"21","author":[{"first_name":"Sebastian","full_name":"Burckhardt, Sebastian","last_name":"Burckhardt"},{"first_name":"Madanlal","last_name":"Musuvathi","full_name":"Musuvathi, Madanlal"},{"last_name":"Singh","full_name":"Singh, Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu"}],"page":"104 - 123","date_published":"2010-04-21T00:00:00Z","extern":"1","month":"04","abstract":[{"lang":"eng","text":"The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory programs this task is challenging because (1) concurrent threads can observe transformations that would be undetectable in a sequential program, and (2) contemporary multiprocessors commonly use relaxed memory models that complicate the reasoning. In this paper, we present a novel proof methodology for verifying that a local program transformation is sound with respect to a specific hardware memory model, in the sense that it is not observable in any context. The methodology is based on a structural induction and relies on a novel compositional denotational semantics for relaxed memory models that formalizes (1) the behaviors of program fragments as a set of traces, and (2) the effect of memory model relaxations as local trace rewrite operations. To apply this methodology in practice, we implemented a semi- automated tool called Traver and used it to verify/falsify several compiler transformations for a number of different hardware memory models."}],"publisher":"Springer","intvolume":"      6011","date_created":"2018-12-11T12:08:38Z","alternative_title":["LNCS"],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"1063","conference":{"location":"Pahos, Cyprus","name":"CC: Compiler Construction","start_date":"2010-03-20","end_date":"2010-03-28"},"editor":[{"first_name":"Rajiv","full_name":"Gupta, Rajiv","last_name":"Gupta"}],"year":"2010","date_updated":"2021-01-12T07:56:39Z","doi":"10.1007/978-3-642-11970-5_7","_id":"4395","status":"public","publication_status":"published","language":[{"iso":"eng"}],"type":"conference","title":"Verifying local transformations on relaxed memory models"},{"file":[{"file_size":312147,"date_created":"2018-12-12T10:18:13Z","content_type":"application/pdf","date_updated":"2020-07-14T12:46:29Z","creator":"system","access_level":"open_access","relation":"main_file","file_name":"IST-2012-41-v1+1_Shape_refinement_through_explicit_heap_analysis.pdf","file_id":"5332","checksum":"7d26e59a9681487d7283eba337292b2c"}],"date_published":"2010-04-21T00:00:00Z","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"}],"oa_version":"Submitted Version","day":"21","author":[{"first_name":"Dirk","last_name":"Beyer","full_name":"Beyer, Dirk"},{"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":"Théoduloz","full_name":"Théoduloz, Grégory","first_name":"Grégory"},{"orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","last_name":"Zufferey","full_name":"Zufferey, Damien"}],"publication_status":"published","language":[{"iso":"eng"}],"project":[{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"title":"Shape refinement through explicit heap analysis","type":"conference","date_created":"2018-12-11T12:08:38Z","alternative_title":["LNCS"],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2010-03-20","name":"FASE: Fundamental Approaches To Software Engineering","location":"Paphos, Cyprus","end_date":"2010-03-28"},"editor":[{"first_name":"David","last_name":"Rosenblum","full_name":"Rosenblum, David"},{"last_name":"Taenzer","full_name":"Taenzer, Gabriele","first_name":"Gabriele"}],"year":"2010","doi":"10.1007/978-3-642-12029-9_19","month":"04","publisher":"Springer","intvolume":"      6013","has_accepted_license":"1","citation":{"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>","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>.","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.","short":"D. Beyer, T.A. Henzinger, G. Théoduloz, D. Zufferey, in:, D. Rosenblum, G. Taenzer (Eds.), Springer, 2010, 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>.","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>","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."},"pubrep_id":"41","volume":6013,"quality_controlled":"1","page":"263 - 277","_id":"4396","status":"public","ddc":["004"],"file_date_updated":"2020-07-14T12:46:29Z","department":[{"_id":"ToHe"}],"scopus_import":1,"oa":1,"publist_id":"1061","date_updated":"2021-01-12T07:56:40Z"},{"citation":{"ieee":"E. Bangerter, J. Camenisch, and S. Krenn, “Efficiency Limitations for Σ-Protocols for Group Homomorphisms,” presented at the TCC: Theory of Cryptography Conference, 2010, vol. 5978, pp. 553–571.","ama":"Bangerter E, Camenisch J, Krenn S. Efficiency Limitations for Σ-Protocols for Group Homomorphisms. In: Micciancio D, ed. Vol 5978. Springer; 2010:553-571. doi:<a href=\"https://doi.org/10.1007/978-3-642-11799-2\">10.1007/978-3-642-11799-2</a>","chicago":"Bangerter, Endre, Jan Camenisch, and Stephan Krenn. “Efficiency Limitations for Σ-Protocols for Group Homomorphisms.” edited by Daniele Micciancio, 5978:553–71. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-11799-2\">https://doi.org/10.1007/978-3-642-11799-2</a>.","short":"E. Bangerter, J. Camenisch, S. Krenn, in:, D. Micciancio (Ed.), Springer, 2010, pp. 553–571.","ista":"Bangerter E, Camenisch J, Krenn S. 2010. Efficiency Limitations for Σ-Protocols for Group Homomorphisms. TCC: Theory of Cryptography Conference, LNCS, vol. 5978, 553–571.","apa":"Bangerter, E., Camenisch, J., &#38; Krenn, S. (2010). Efficiency Limitations for Σ-Protocols for Group Homomorphisms. In D. Micciancio (Ed.) (Vol. 5978, pp. 553–571). Presented at the TCC: Theory of Cryptography Conference, Springer. <a href=\"https://doi.org/10.1007/978-3-642-11799-2\">https://doi.org/10.1007/978-3-642-11799-2</a>","mla":"Bangerter, Endre, et al. <i>Efficiency Limitations for Σ-Protocols for Group Homomorphisms</i>. Edited by Daniele Micciancio, vol. 5978, Springer, 2010, pp. 553–71, doi:<a href=\"https://doi.org/10.1007/978-3-642-11799-2\">10.1007/978-3-642-11799-2</a>."},"main_file_link":[{"url":"http://eprint.iacr.org/2009/595.pdf","open_access":"1"}],"quality_controlled":0,"volume":5978,"day":"08","page":"553 - 571","author":[{"first_name":"Endre","last_name":"Bangerter","full_name":"Bangerter, Endre"},{"full_name":"Camenisch, Jan","last_name":"Camenisch","first_name":"Jan"},{"last_name":"Krenn","full_name":"Stephan Krenn","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan","orcid":"0000-0003-2835-9093"}],"extern":1,"date_published":"2010-02-08T00:00:00Z","month":"02","publisher":"Springer","abstract":[{"lang":"eng","text":"Efficient zero-knowledge proofs of knowledge for group homomorphisms are essential for numerous systems in applied cryptography. Especially, Σ-protocols for proving knowledge of discrete logarithms in known and hidden order groups are of prime importance. Yet, while these proofs can be performed very efficiently within groups of known order, for hidden order groups the respective proofs are far less efficient.\n\nThis paper shows strong evidence that this efficiency gap cannot be bridged. Namely, while there are efficient protocols allowing a prover to cheat only with negligibly small probability in the case of known order groups, we provide strong evidence that for hidden order groups this probability is bounded below by 1/2 for all efficient  Σ-protocols not using common reference strings or the like.\n\nWe prove our results for a comprehensive class of Σ-protocols in the generic group model, and further strengthen them by investigating certain instantiations in the plain model."}],"intvolume":"      5978","oa":1,"alternative_title":["LNCS"],"date_created":"2018-12-11T12:00:39Z","conference":{"name":"TCC: Theory of Cryptography Conference"},"publist_id":"3725","year":"2010","editor":[{"first_name":"Daniele","full_name":"Micciancio, Daniele","last_name":"Micciancio"}],"doi":"10.1007/978-3-642-11799-2","date_updated":"2021-01-12T07:40:12Z","_id":"2978","publication_status":"published","status":"public","title":"Efficiency Limitations for Σ-Protocols for Group Homomorphisms","type":"conference"},{"intvolume":"      6345","publisher":"Springer","abstract":[{"text":"Zero-knowledge proofs of knowledge (ZK-PoK) are important building blocks for numerous cryptographic applications. Although ZK-PoK have a high potential impact, their real world deployment is  typically hindered by their significant complexity compared to other (non-interactive) crypto primitives. Moreover, their design and implementation are time-consuming and error-prone.\n\nWe contribute to overcoming these challenges as follows: We present a comprehensive specification language and a compiler for ZK-PoK protocols based on Σ-protocols. The compiler allows the fully automatic translation of an abstract description of a proof goal into an executable implementation. Moreover, the compiler overcomes various restrictions of previous approaches, e.g., it supports the important class of exponentiation homomorphisms with hidden-order co-domain,  needed for privacy-preserving applications such as DAA. Finally, our compiler is certifying, in the sense that it automatically produces a formal proof of the soundness of the compiled protocol for a large class of protocols using the Isabelle/HOL theorem prover. \n","lang":"eng"}],"month":"08","extern":1,"date_published":"2010-08-30T00:00:00Z","page":"151 - 167","author":[{"first_name":"José","full_name":"Almeida, José Bacelar","last_name":"Almeida"},{"last_name":"Bangerter","full_name":"Bangerter, Endre","first_name":"Endre"},{"first_name":"Manuel","last_name":"Barbosa","full_name":"Barbosa, Manuel"},{"id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan","last_name":"Krenn","full_name":"Stephan Krenn","orcid":"0000-0003-2835-9093"},{"first_name":"Ahmad","full_name":"Sadeghi, Ahmad-Reza","last_name":"Sadeghi"},{"last_name":"Schneider","full_name":"Schneider, Thomas","first_name":"Thomas"}],"day":"30","volume":6345,"quality_controlled":0,"citation":{"ista":"Almeida J, Bangerter E, Barbosa M, Krenn S, Sadeghi A, Schneider T. 2010. A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols. ESORICS: European Symposium on Research in Computer Security, LNCS, vol. 6345, 151–167.","short":"J. Almeida, E. Bangerter, M. Barbosa, S. Krenn, A. Sadeghi, T. Schneider, in:, D. Gritzalis, B. Preneel, M. Theoharidou (Eds.), Springer, 2010, pp. 151–167.","apa":"Almeida, J., Bangerter, E., Barbosa, M., Krenn, S., Sadeghi, A., &#38; Schneider, T. (2010). A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols. In D. Gritzalis, B. Preneel, &#38; M. Theoharidou (Eds.) (Vol. 6345, pp. 151–167). Presented at the ESORICS: European Symposium on Research in Computer Security, Springer. <a href=\"https://doi.org/10.1007/978-3-642-15497-3\">https://doi.org/10.1007/978-3-642-15497-3</a>","mla":"Almeida, José, et al. <i>A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols</i>. Edited by Dimitris Gritzalis et al., vol. 6345, Springer, 2010, pp. 151–67, doi:<a href=\"https://doi.org/10.1007/978-3-642-15497-3\">10.1007/978-3-642-15497-3</a>.","ieee":"J. Almeida, E. Bangerter, M. Barbosa, S. Krenn, A. Sadeghi, and T. Schneider, “A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols,” presented at the ESORICS: European Symposium on Research in Computer Security, 2010, vol. 6345, pp. 151–167.","ama":"Almeida J, Bangerter E, Barbosa M, Krenn S, Sadeghi A, Schneider T. A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols. In: Gritzalis D, Preneel B, Theoharidou M, eds. Vol 6345. Springer; 2010:151-167. doi:<a href=\"https://doi.org/10.1007/978-3-642-15497-3\">10.1007/978-3-642-15497-3</a>","chicago":"Almeida, José, Endre Bangerter, Manuel Barbosa, Stephan Krenn, Ahmad Sadeghi, and Thomas Schneider. “A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols.” edited by Dimitris Gritzalis, Bart Preneel, and Marianthi Theoharidou, 6345:151–67. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15497-3\">https://doi.org/10.1007/978-3-642-15497-3</a>."},"main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2010/339.pdf"}],"title":"A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols","type":"conference","publication_status":"published","status":"public","_id":"2979","doi":"10.1007/978-3-642-15497-3","acknowledgement":"This work was in part funded by the European Community's Seventh Framework Programme (FP7) under grant agreement no. 216499.\nA preliminary version of the compiler can be found at http://zkc.cace-project.eu.","date_updated":"2021-01-12T07:40:13Z","year":"2010","editor":[{"first_name":"Dimitris","last_name":"Gritzalis","full_name":"Gritzalis, Dimitris"},{"first_name":"Bart","full_name":"Preneel, Bart","last_name":"Preneel"},{"first_name":"Marianthi","full_name":"Theoharidou, Marianthi","last_name":"Theoharidou"}],"conference":{"name":"ESORICS: European Symposium on Research in Computer Security"},"publist_id":"3724","oa":1,"date_created":"2018-12-11T12:00:40Z","alternative_title":["LNCS"]},{"quality_controlled":0,"volume":6391,"main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2008/471.pdf"}],"citation":{"ista":"Bangerter E, Briner T, Henecka W, Krenn S, Sadeghi A, Schneider T. 2010. Automatic Generation of Sigma-Protocols. EuroPKI: Public Key Infrastructures, Services and Applications, LNCS, vol. 6391, 67–82.","short":"E. Bangerter, T. Briner, W. Henecka, S. Krenn, A. Sadeghi, T. Schneider, in:, F. Martinelli, B. Preneel (Eds.), Springer, 2010, pp. 67–82.","apa":"Bangerter, E., Briner, T., Henecka, W., Krenn, S., Sadeghi, A., &#38; Schneider, T. (2010). Automatic Generation of Sigma-Protocols. In F. Martinelli &#38; B. Preneel (Eds.) (Vol. 6391, pp. 67–82). Presented at the EuroPKI: Public Key Infrastructures, Services and Applications, Springer. <a href=\"https://doi.org/10.1007/978-3-642-16441-5\">https://doi.org/10.1007/978-3-642-16441-5</a>","mla":"Bangerter, Endre, et al. <i>Automatic Generation of Sigma-Protocols</i>. Edited by Fabio Martinelli and Bart Preneel, vol. 6391, Springer, 2010, pp. 67–82, doi:<a href=\"https://doi.org/10.1007/978-3-642-16441-5\">10.1007/978-3-642-16441-5</a>.","ieee":"E. Bangerter, T. Briner, W. Henecka, S. Krenn, A. Sadeghi, and T. Schneider, “Automatic Generation of Sigma-Protocols,” presented at the EuroPKI: Public Key Infrastructures, Services and Applications, 2010, vol. 6391, pp. 67–82.","chicago":"Bangerter, Endre, Thomas Briner, Wilko Henecka, Stephan Krenn, Ahmad Sadeghi, and Thomas Schneider. “Automatic Generation of Sigma-Protocols.” edited by Fabio Martinelli and Bart Preneel, 6391:67–82. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-16441-5\">https://doi.org/10.1007/978-3-642-16441-5</a>.","ama":"Bangerter E, Briner T, Henecka W, Krenn S, Sadeghi A, Schneider T. Automatic Generation of Sigma-Protocols. In: Martinelli F, Preneel B, eds. Vol 6391. Springer; 2010:67-82. doi:<a href=\"https://doi.org/10.1007/978-3-642-16441-5\">10.1007/978-3-642-16441-5</a>"},"author":[{"first_name":"Endre","full_name":"Bangerter, Endre","last_name":"Bangerter"},{"first_name":"Thomas","last_name":"Briner","full_name":"Briner, Thomas"},{"full_name":"Henecka, Wilko","last_name":"Henecka","first_name":"Wilko"},{"orcid":"0000-0003-2835-9093","full_name":"Stephan Krenn","last_name":"Krenn","first_name":"Stephan","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sadeghi, Ahmad-Reza","last_name":"Sadeghi","first_name":"Ahmad"},{"first_name":"Thomas","last_name":"Schneider","full_name":"Schneider, Thomas"}],"page":"67 - 82","day":"25","month":"10","date_published":"2010-10-25T00:00:00Z","extern":1,"intvolume":"      6391","abstract":[{"lang":"eng","text":"Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic\n  building blocks of many practical cryptographic applications such as\n  identification schemes, group signatures, and secure multi-party\n  computation (SMPC). Currently, first applications that essentially\n  rely on ZK-PoKs are being deployed in the real world. The most\n  prominent example is the Direct Anonymous Attestation (DAA)\n  protocol, which was adopted by the Trusted Computing Group (TCG) \n  and implemented as one of the functionalities of the cryptographic \n  chip Trusted Platform Module (TPM).\n\nImplementing systems using ZK-PoK turns out to be challenging,\n  since ZK-PoK are significantly more complex than standard crypto\n  primitives (e.g., encryption and signature schemes). As a result, \n  the design-implementation cycles of ZK-PoK are time-consuming\n  and error-prone.\n\nTo overcome this, we present a compiler with corresponding languages \n  for the automatic generation of sound and efficient ZK-PoK based on \n  Σ-protocols. The protocol designer using our compiler formulates \n  the goal of a ZK-PoK proof in a high-level protocol specification language,\n  which abstracts away unnecessary technicalities from the designer. The\n  compiler then automatically generates the protocol implementation in \n  Java code; alternatively, the compiler can output a description of the \n  protocol in LaTeX which can be used for documentation or verification."}],"publisher":"Springer","publist_id":"3723","conference":{"name":"EuroPKI: Public Key Infrastructures, Services and Applications"},"oa":1,"date_created":"2018-12-11T12:00:40Z","alternative_title":["LNCS"],"date_updated":"2021-01-12T07:40:13Z","acknowledgement":"This work was performed within the FP7 EU project CACE (Computer Aided Cryptography Engineering).","doi":"10.1007/978-3-642-16441-5","editor":[{"first_name":"Fabio","last_name":"Martinelli","full_name":"Martinelli, Fabio"},{"full_name":"Preneel, Bart","last_name":"Preneel","first_name":"Bart"}],"year":"2010","status":"public","publication_status":"published","_id":"2980","title":"Automatic Generation of Sigma-Protocols","type":"conference"},{"type":"journal_article","title":"Trafficking to the outer polar domain defines the root soil interface","_id":"3066","publication_status":"published","status":"public","year":"2010","doi":"10.1016/j.cub.2010.03.059","date_updated":"2021-01-12T07:40:48Z","date_created":"2018-12-11T12:01:10Z","publist_id":"3634","publisher":"Cell Press","abstract":[{"lang":"eng","text":"In animals, the interface between organism and environment is constituted by the epithelium [1]. In plants, the exchange of nutrients and signals between root and soil is crucial for their survival, but the cellular mechanisms underlying the epithelium-like function and specific localization of proteins to the root surface have not been identified [2]. Here we analyze the mechanism of polar delivery to the root-soil interface of the proteins BOR4, ABCG37, and PEN3, which transport nutrients [2], transport plant hormones, and are required for pathogen defense [3], respectively. The simultaneous visualization of these proteins and the apical and basal cargos in a single cell demonstrates that the outermost cell side represents an additional polar domain. Delivery to this outer polar domain depends on ARF GEF [4] and actin [5-8] function but does not require known molecular components of the apical or basal targeting. The outer polar delivery is, in contrast to known basal and apical cargos [9, 10], mediated by the polar secretion. Our findings show that the outermost cell membranes of roots define an additional polar domain in plant cells along with a specific, previously uncharacterized, polar targeting mechanism that is important for defining the functional, epithelium-like root-soil interface."}],"intvolume":"        20","extern":1,"date_published":"2010-05-25T00:00:00Z","publication":"Current Biology","month":"05","day":"25","page":"904 - 908","author":[{"full_name":"Łangowski, Łukasz","last_name":"Łangowski","first_name":"Łukasz"},{"full_name":"Růžička, Kamil","last_name":"Růžička","first_name":"Kamil"},{"full_name":"Naramoto, Satoshi","last_name":"Naramoto","first_name":"Satoshi"},{"last_name":"Kleine Vehn","full_name":"Kleine-Vehn, Jürgen","first_name":"Jürgen"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","last_name":"Friml","full_name":"Jirí Friml","orcid":"0000-0002-8302-7596"}],"citation":{"ista":"Łangowski Ł, Růžička K, Naramoto S, Kleine Vehn J, Friml J. 2010. Trafficking to the outer polar domain defines the root soil interface. Current Biology. 20(10), 904–908.","short":"Ł. Łangowski, K. Růžička, S. Naramoto, J. Kleine Vehn, J. Friml, Current Biology 20 (2010) 904–908.","mla":"Łangowski, Łukasz, et al. “Trafficking to the Outer Polar Domain Defines the Root Soil Interface.” <i>Current Biology</i>, vol. 20, no. 10, Cell Press, 2010, pp. 904–08, doi:<a href=\"https://doi.org/10.1016/j.cub.2010.03.059\">10.1016/j.cub.2010.03.059</a>.","apa":"Łangowski, Ł., Růžička, K., Naramoto, S., Kleine Vehn, J., &#38; Friml, J. (2010). Trafficking to the outer polar domain defines the root soil interface. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2010.03.059\">https://doi.org/10.1016/j.cub.2010.03.059</a>","ieee":"Ł. Łangowski, K. Růžička, S. Naramoto, J. Kleine Vehn, and J. Friml, “Trafficking to the outer polar domain defines the root soil interface,” <i>Current Biology</i>, vol. 20, no. 10. Cell Press, pp. 904–908, 2010.","chicago":"Łangowski, Łukasz, Kamil Růžička, Satoshi Naramoto, Jürgen Kleine Vehn, and Jiří Friml. “Trafficking to the Outer Polar Domain Defines the Root Soil Interface.” <i>Current Biology</i>. Cell Press, 2010. <a href=\"https://doi.org/10.1016/j.cub.2010.03.059\">https://doi.org/10.1016/j.cub.2010.03.059</a>.","ama":"Łangowski Ł, Růžička K, Naramoto S, Kleine Vehn J, Friml J. Trafficking to the outer polar domain defines the root soil interface. <i>Current Biology</i>. 2010;20(10):904-908. doi:<a href=\"https://doi.org/10.1016/j.cub.2010.03.059\">10.1016/j.cub.2010.03.059</a>"},"issue":"10","quality_controlled":0,"volume":20},{"type":"journal_article","title":"Arabidopsis PIS1 encodes the ABCG37 transporter of auxinic compounds including the auxin precursor indole 3 butyric acid","_id":"3068","status":"public","publication_status":"published","year":"2010","date_updated":"2021-01-12T07:40:49Z","doi":"10.1073/pnas.1005878107","date_created":"2018-12-11T12:01:11Z","publist_id":"3633","abstract":[{"lang":"eng","text":"Differential distribution of the plant hormone auxin within tissues mediates a variety of developmental processes. Cellular auxin levels are determined by metabolic processes including synthesis, degradation, and (de)conjugation, as well as by auxin transport across the plasma membrane. Whereas transport of free auxins such as naturally occurring indole-3-acetic acid (IAA) is well characterized, little is known about the transport of auxin precursors and metabolites. Here, we identify amutation in the ABCG37 gene of Arabidopsis that causes the polar auxin transport inhibitor sensitive1 (pis1) phenotype manifested by hypersensitivity to auxinic compounds. ABCG37 encodes the pleiotropic drug resistance transporter that transports a range of synthetic auxinic compounds as well as the endogenous auxin precursor indole-3-butyric acid (IBA), but not free IAA. ABCG37 and its homolog ABCG36 act redundantly at outermost root plasma membranes and,unlike established IAA transporters from the PIN and ABCB families, transport IBA out of the cells. Our findings explore possible novel modes of regulating auxin homeostasis and plant development by means of directional transport of the auxin precursor IBA and presumably also other auxin metabolites."}],"publisher":"National Academy of Sciences","intvolume":"       107","date_published":"2010-06-08T00:00:00Z","extern":1,"publication":"PNAS","month":"06","day":"08","author":[{"first_name":"Kamil","last_name":"Růžička","full_name":"Růžička, Kamil"},{"first_name":"Lucia","last_name":"Strader","full_name":"Strader, Lucia C"},{"full_name":"Bailly, Aurélien","last_name":"Bailly","first_name":"Aurélien"},{"first_name":"Haibing","full_name":"Yang, Haibing","last_name":"Yang"},{"first_name":"Joshua","last_name":"Blakeslee","full_name":"Blakeslee, Joshua"},{"first_name":"Łukasz","full_name":"Łangowski, Łukasz","last_name":"Łangowski"},{"first_name":"Eliška","last_name":"Nejedlá","full_name":"Nejedlá, Eliška"},{"first_name":"Hironori","full_name":"Fujita, Hironori","last_name":"Fujita"},{"last_name":"Itoh","full_name":"Itoh, Hironori","first_name":"Hironori"},{"first_name":"Kunihiko","full_name":"Syōno, Kunihiko","last_name":"Syōno"},{"last_name":"Hejátko","full_name":"Hejátko, Jan","first_name":"Jan"},{"first_name":"William","last_name":"Gray","full_name":"Gray, William M"},{"full_name":"Martinoia, Enrico","last_name":"Martinoia","first_name":"Enrico"},{"first_name":"Markus","last_name":"Geisler","full_name":"Geisler, Markus"},{"full_name":"Bartel, Bonnie","last_name":"Bartel","first_name":"Bonnie"},{"first_name":"Angus","full_name":"Murphy, Angus S","last_name":"Murphy"},{"last_name":"Friml","full_name":"Jirí Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","orcid":"0000-0002-8302-7596"}],"page":"10749 - 10753","issue":"23","citation":{"ama":"Růžička K, Strader L, Bailly A, et al. Arabidopsis PIS1 encodes the ABCG37 transporter of auxinic compounds including the auxin precursor indole 3 butyric acid. <i>PNAS</i>. 2010;107(23):10749-10753. doi:<a href=\"https://doi.org/10.1073/pnas.1005878107\">10.1073/pnas.1005878107</a>","chicago":"Růžička, Kamil, Lucia Strader, Aurélien Bailly, Haibing Yang, Joshua Blakeslee, Łukasz Łangowski, Eliška Nejedlá, et al. “Arabidopsis PIS1 Encodes the ABCG37 Transporter of Auxinic Compounds Including the Auxin Precursor Indole 3 Butyric Acid.” <i>PNAS</i>. National Academy of Sciences, 2010. <a href=\"https://doi.org/10.1073/pnas.1005878107\">https://doi.org/10.1073/pnas.1005878107</a>.","ieee":"K. Růžička <i>et al.</i>, “Arabidopsis PIS1 encodes the ABCG37 transporter of auxinic compounds including the auxin precursor indole 3 butyric acid,” <i>PNAS</i>, vol. 107, no. 23. National Academy of Sciences, pp. 10749–10753, 2010.","apa":"Růžička, K., Strader, L., Bailly, A., Yang, H., Blakeslee, J., Łangowski, Ł., … Friml, J. (2010). Arabidopsis PIS1 encodes the ABCG37 transporter of auxinic compounds including the auxin precursor indole 3 butyric acid. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1005878107\">https://doi.org/10.1073/pnas.1005878107</a>","mla":"Růžička, Kamil, et al. “Arabidopsis PIS1 Encodes the ABCG37 Transporter of Auxinic Compounds Including the Auxin Precursor Indole 3 Butyric Acid.” <i>PNAS</i>, vol. 107, no. 23, National Academy of Sciences, 2010, pp. 10749–53, doi:<a href=\"https://doi.org/10.1073/pnas.1005878107\">10.1073/pnas.1005878107</a>.","short":"K. Růžička, L. Strader, A. Bailly, H. Yang, J. Blakeslee, Ł. Łangowski, E. Nejedlá, H. Fujita, H. Itoh, K. Syōno, J. Hejátko, W. Gray, E. Martinoia, M. Geisler, B. Bartel, A. Murphy, J. Friml, PNAS 107 (2010) 10749–10753.","ista":"Růžička K, Strader L, Bailly A, Yang H, Blakeslee J, Łangowski Ł, Nejedlá E, Fujita H, Itoh H, Syōno K, Hejátko J, Gray W, Martinoia E, Geisler M, Bartel B, Murphy A, Friml J. 2010. Arabidopsis PIS1 encodes the ABCG37 transporter of auxinic compounds including the auxin precursor indole 3 butyric acid. PNAS. 107(23), 10749–10753."},"volume":107,"quality_controlled":0},{"author":[{"last_name":"Feraru","full_name":"Feraru, Elena","first_name":"Elena"},{"first_name":"Tomasz","last_name":"Paciorek","full_name":"Paciorek, Tomasz"},{"last_name":"Feraru","full_name":"Feraru, Mugurel I","first_name":"Mugurel"},{"full_name":"Zwiewka, Marta","last_name":"Zwiewka","first_name":"Marta"},{"first_name":"Ruth","full_name":"De Groodt, Ruth","last_name":"De Groodt"},{"first_name":"Riet","full_name":"De Rycke, Riet M","last_name":"De Rycke"},{"last_name":"Kleine Vehn","full_name":"Kleine-Vehn, Jürgen","first_name":"Jürgen"},{"orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","last_name":"Friml","full_name":"Jirí Friml"}],"page":"2812 - 2824","day":"01","volume":22,"quality_controlled":0,"issue":"8","citation":{"ieee":"E. Feraru <i>et al.</i>, “The AP 3 β adaptin mediates the biogenesis and function of lytic vacuoles in Arabidopsis,” <i>Plant Cell</i>, vol. 22, no. 8. American Society of Plant Biologists, pp. 2812–2824, 2010.","chicago":"Feraru, Elena, Tomasz Paciorek, Mugurel Feraru, Marta Zwiewka, Ruth De Groodt, Riet De Rycke, Jürgen Kleine Vehn, and Jiří Friml. “The AP 3 β Adaptin Mediates the Biogenesis and Function of Lytic Vacuoles in Arabidopsis.” <i>Plant Cell</i>. American Society of Plant Biologists, 2010. <a href=\"https://doi.org/10.1105/tpc.110.075424\">https://doi.org/10.1105/tpc.110.075424</a>.","ama":"Feraru E, Paciorek T, Feraru M, et al. The AP 3 β adaptin mediates the biogenesis and function of lytic vacuoles in Arabidopsis. <i>Plant Cell</i>. 2010;22(8):2812-2824. doi:<a href=\"https://doi.org/10.1105/tpc.110.075424\">10.1105/tpc.110.075424</a>","short":"E. Feraru, T. Paciorek, M. Feraru, M. Zwiewka, R. De Groodt, R. De Rycke, J. Kleine Vehn, J. Friml, Plant Cell 22 (2010) 2812–2824.","ista":"Feraru E, Paciorek T, Feraru M, Zwiewka M, De Groodt R, De Rycke R, Kleine Vehn J, Friml J. 2010. The AP 3 β adaptin mediates the biogenesis and function of lytic vacuoles in Arabidopsis. Plant Cell. 22(8), 2812–2824.","mla":"Feraru, Elena, et al. “The AP 3 β Adaptin Mediates the Biogenesis and Function of Lytic Vacuoles in Arabidopsis.” <i>Plant Cell</i>, vol. 22, no. 8, American Society of Plant Biologists, 2010, pp. 2812–24, doi:<a href=\"https://doi.org/10.1105/tpc.110.075424\">10.1105/tpc.110.075424</a>.","apa":"Feraru, E., Paciorek, T., Feraru, M., Zwiewka, M., De Groodt, R., De Rycke, R., … Friml, J. (2010). The AP 3 β adaptin mediates the biogenesis and function of lytic vacuoles in Arabidopsis. <i>Plant Cell</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1105/tpc.110.075424\">https://doi.org/10.1105/tpc.110.075424</a>"},"intvolume":"        22","abstract":[{"text":"Plant vacuoles are essential multifunctional organelles largely distinct from similar organelles in other eukaryotes. Embryo protein storage vacuoles and the lytic vacuoles that perform a general degradation function are the best characterized, but little is known about the biogenesis and transition between these vacuolar types. Here, we designed a fluorescent marker- based forward genetic screen in Arabidopsis thaliana and identified a protein affected trafficking2 (pat2) mutant, whose lytic vacuoles display altered morphology and accumulation of proteins. Unlike other mutants affecting the vacuole, pat2 is specifically defective in the biogenesis, identity, and function of lytic vacuoles but shows normal sorting of proteins to storage vacuoles. PAT2 encodes a putative β-subunit of adaptor protein complex 3 (AP-3) that can partially complement the corresponding yeast mutant. Manipulations of the putative AP-3 β adaptin functions suggest a plant-specific role for the evolutionarily conserved AP-3 β in mediating lytic vacuole performance and transition of storage into the lytic vacuoles independently of the main prevacuolar compartment-based trafficking route.","lang":"eng"}],"publisher":"American Society of Plant Biologists","month":"08","publication":"Plant Cell","date_published":"2010-08-01T00:00:00Z","extern":1,"date_updated":"2021-01-12T07:40:51Z","doi":"10.1105/tpc.110.075424","year":"2010","publist_id":"3630","date_created":"2018-12-11T12:01:12Z","title":"The AP 3 β adaptin mediates the biogenesis and function of lytic vacuoles in Arabidopsis","type":"journal_article","status":"public","publication_status":"published","_id":"3071"},{"year":"2010","date_updated":"2021-01-12T07:40:55Z","doi":"10.1073/pnas.1016260107","date_created":"2018-12-11T12:01:15Z","publist_id":"3621","title":"ADP ribosylation factor machinery mediates endocytosis in plant cells","type":"journal_article","_id":"3081","status":"public","publication_status":"published","day":"14","author":[{"full_name":"Naramoto, Satoshi","last_name":"Naramoto","first_name":"Satoshi"},{"first_name":"Jürgen","full_name":"Kleine-Vehn, Jürgen","last_name":"Kleine Vehn"},{"first_name":"Stéphanie","last_name":"Robert","full_name":"Robert, Stéphanie"},{"full_name":"Fujimoto, Masaru","last_name":"Fujimoto","first_name":"Masaru"},{"first_name":"Tomoko","last_name":"Dainobu","full_name":"Dainobu, Tomoko"},{"first_name":"Tomasz","full_name":"Paciorek, Tomasz","last_name":"Paciorek"},{"last_name":"Ueda","full_name":"Ueda, Takashi","first_name":"Takashi"},{"first_name":"Akihiko","full_name":"Nakano, Akihiko","last_name":"Nakano"},{"first_name":"Marc","full_name":"Van Montagu, Marc C","last_name":"Van Montagu"},{"first_name":"Hiroo","last_name":"Fukuda","full_name":"Fukuda, Hiroo"},{"orcid":"0000-0002-8302-7596","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Jirí Friml","last_name":"Friml"}],"page":"21890 - 21895","issue":"50","citation":{"short":"S. Naramoto, J. Kleine Vehn, S. Robert, M. Fujimoto, T. Dainobu, T. Paciorek, T. Ueda, A. Nakano, M. Van Montagu, H. Fukuda, J. Friml, PNAS 107 (2010) 21890–21895.","ista":"Naramoto S, Kleine Vehn J, Robert S, Fujimoto M, Dainobu T, Paciorek T, Ueda T, Nakano A, Van Montagu M, Fukuda H, Friml J. 2010. ADP ribosylation factor machinery mediates endocytosis in plant cells. PNAS. 107(50), 21890–21895.","mla":"Naramoto, Satoshi, et al. “ADP Ribosylation Factor Machinery Mediates Endocytosis in Plant Cells.” <i>PNAS</i>, vol. 107, no. 50, National Academy of Sciences, 2010, pp. 21890–95, doi:<a href=\"https://doi.org/10.1073/pnas.1016260107\">10.1073/pnas.1016260107</a>.","apa":"Naramoto, S., Kleine Vehn, J., Robert, S., Fujimoto, M., Dainobu, T., Paciorek, T., … Friml, J. (2010). ADP ribosylation factor machinery mediates endocytosis in plant cells. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1016260107\">https://doi.org/10.1073/pnas.1016260107</a>","ieee":"S. Naramoto <i>et al.</i>, “ADP ribosylation factor machinery mediates endocytosis in plant cells,” <i>PNAS</i>, vol. 107, no. 50. National Academy of Sciences, pp. 21890–21895, 2010.","ama":"Naramoto S, Kleine Vehn J, Robert S, et al. ADP ribosylation factor machinery mediates endocytosis in plant cells. <i>PNAS</i>. 2010;107(50):21890-21895. doi:<a href=\"https://doi.org/10.1073/pnas.1016260107\">10.1073/pnas.1016260107</a>","chicago":"Naramoto, Satoshi, Jürgen Kleine Vehn, Stéphanie Robert, Masaru Fujimoto, Tomoko Dainobu, Tomasz Paciorek, Takashi Ueda, et al. “ADP Ribosylation Factor Machinery Mediates Endocytosis in Plant Cells.” <i>PNAS</i>. National Academy of Sciences, 2010. <a href=\"https://doi.org/10.1073/pnas.1016260107\">https://doi.org/10.1073/pnas.1016260107</a>."},"volume":107,"quality_controlled":0,"abstract":[{"lang":"eng","text":"Endocytosis is crucial for various cellular functions and development of multicellular organisms. In mammals and yeast, ADP-ribosylation factor (ARF) GTPases, key components of vesicle formation, and their regulators ARF-guanine nucleotide exchange factors (GEFs) and ARF-GTPase-activating protein (GAPs) mediate endocytosis. A similar role has not been established in plants,mainly because of the lack of the canonical ARF and ARF-GEF components that are involved in endocytosis in other eukaryotes. In this study, we revealed a regulatory mechanism of endocytosis in plants based on ARF GTPase activity.Weidentified that ARF-GEFGNOMand ARF-GAP VASCULAR NETWORK DEFECTIVE 3 (VAN3), both of which are involved in polar auxin transport-dependent morphogenesis, localize at the plasma membranes as well as in intracellular structures. Variable angle epifluorescence microscopy revealed that GNOM and VAN3 localize to partially overlapping discrete foci at the plasmamembranes that are regularly associated with the endocytic vesicle coat clathrin. Genetic studies revealed that GNOM and VAN3 activities are required for endocytosis and internalization of plasma membrane proteins, including PIN-FORMED auxin transporters. These findings identified ARF GTPase-based regulatory mechanisms for endocytosis in plants. GNOMand VAN3 previously were proposed to function solely at the recycling endosomes and trans-Golgi networks, respectively. Therefore our findings uncovered an additional cellular function of these prominent developmental regulators."}],"publisher":"National Academy of Sciences","intvolume":"       107","date_published":"2010-12-14T00:00:00Z","extern":1,"month":"12","publication":"PNAS"},{"extern":1,"date_published":"2010-11-18T00:00:00Z","month":"11","publication":"Neuron","publisher":"Elsevier","abstract":[{"lang":"eng","text":"Coordinated migration of newly born neurons to their prospective target laminae is a prerequisite for neural circuit assembly in the developing brain. The evolutionarily conserved LIS1/NDEL1 complex is essential for neuronal migration in the mammalian cerebral cortex. The cytoplasmic nature of LIS1 and NDEL1 proteins suggest that they regulate neuronal migration cell autonomously. Here, we extend mosaic analysis with double markers (MADM) to mouse chromosome 11 where Lis1, Ndel1, and 14-3-3e{open} (encoding a LIS1/NDEL1 signaling partner) are located. Analyses of sparse and uniquely labeled mutant cells in mosaic animals reveal distinct cell-autonomous functions for these three genes. Lis1 regulates neuronal migration efficiency in a dose-dependent manner, while Ndel1 is essential for a specific, previously uncharacterized, late step of neuronal migration: entry into the target lamina. Comparisons with previous genetic perturbations of Lis1 and Ndel1 also suggest a surprising degree of cell-nonautonomous function for these proteins in regulating neuronal migration."}],"intvolume":"        68","citation":{"chicago":"Hippenmeyer, Simon, Yong Youn, Hyang Moon, Kazunari Miyamichi, Hui Zong, Anthony Wynshaw Boris, and Liqun Luo. “Genetic Mosaic Dissection of Lis1 and Ndel1 in Neuronal Migration.” <i>Neuron</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.neuron.2010.09.027\">https://doi.org/10.1016/j.neuron.2010.09.027</a>.","ama":"Hippenmeyer S, Youn Y, Moon H, et al. Genetic mosaic dissection of Lis1 and Ndel1 in neuronal migration. <i>Neuron</i>. 2010;68(4):695-709. doi:<a href=\"https://doi.org/10.1016/j.neuron.2010.09.027\">10.1016/j.neuron.2010.09.027</a>","ieee":"S. Hippenmeyer <i>et al.</i>, “Genetic mosaic dissection of Lis1 and Ndel1 in neuronal migration,” <i>Neuron</i>, vol. 68, no. 4. Elsevier, pp. 695–709, 2010.","mla":"Hippenmeyer, Simon, et al. “Genetic Mosaic Dissection of Lis1 and Ndel1 in Neuronal Migration.” <i>Neuron</i>, vol. 68, no. 4, Elsevier, 2010, pp. 695–709, doi:<a href=\"https://doi.org/10.1016/j.neuron.2010.09.027\">10.1016/j.neuron.2010.09.027</a>.","apa":"Hippenmeyer, S., Youn, Y., Moon, H., Miyamichi, K., Zong, H., Wynshaw Boris, A., &#38; Luo, L. (2010). Genetic mosaic dissection of Lis1 and Ndel1 in neuronal migration. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2010.09.027\">https://doi.org/10.1016/j.neuron.2010.09.027</a>","short":"S. Hippenmeyer, Y. Youn, H. Moon, K. Miyamichi, H. Zong, A. Wynshaw Boris, L. Luo, Neuron 68 (2010) 695–709.","ista":"Hippenmeyer S, Youn Y, Moon H, Miyamichi K, Zong H, Wynshaw Boris A, Luo L. 2010. Genetic mosaic dissection of Lis1 and Ndel1 in neuronal migration. Neuron. 68(4), 695–709."},"issue":"4","volume":68,"quality_controlled":0,"day":"18","page":"695 - 709","author":[{"orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer","full_name":"Simon Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon"},{"last_name":"Youn","full_name":"Youn, Yong H","first_name":"Yong"},{"full_name":"Moon, Hyang M","last_name":"Moon","first_name":"Hyang"},{"full_name":"Miyamichi, Kazunari","last_name":"Miyamichi","first_name":"Kazunari"},{"last_name":"Zong","full_name":"Zong, Hui","first_name":"Hui"},{"full_name":"Wynshaw-Boris, Anthony","last_name":"Wynshaw Boris","first_name":"Anthony"},{"first_name":"Liqun","last_name":"Luo","full_name":"Luo, Liqun"}],"_id":"3146","publication_status":"published","status":"public","title":"Genetic mosaic dissection of Lis1 and Ndel1 in neuronal migration","type":"journal_article","date_created":"2018-12-11T12:01:39Z","publist_id":"3550","year":"2010","doi":"10.1016/j.neuron.2010.09.027","date_updated":"2021-01-12T07:41:22Z"},{"main_file_link":[{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.330.6803df","open_access":"0"}],"citation":{"mla":"Vicente, Sara, et al. <i>Cosegmentation Revisited: Models and Optimization</i>. Vol. 6312, Springer, 2010, pp. 465–79, doi:<a href=\"https://doi.org/10.1007/978-3-642-15552-9_34\">10.1007/978-3-642-15552-9_34</a>.","apa":"Vicente, S., Kolmogorov, V., &#38; Rother, C. (2010). Cosegmentation revisited: Models and optimization (Vol. 6312, pp. 465–479). Presented at the ECCV: European Conference on Computer Vision, Springer. <a href=\"https://doi.org/10.1007/978-3-642-15552-9_34\">https://doi.org/10.1007/978-3-642-15552-9_34</a>","short":"S. Vicente, V. Kolmogorov, C. Rother, in:, Springer, 2010, pp. 465–479.","ista":"Vicente S, Kolmogorov V, Rother C. 2010. Cosegmentation revisited: Models and optimization. ECCV: European Conference on Computer Vision, LNCS, vol. 6312, 465–479.","ama":"Vicente S, Kolmogorov V, Rother C. Cosegmentation revisited: Models and optimization. In: Vol 6312. Springer; 2010:465-479. doi:<a href=\"https://doi.org/10.1007/978-3-642-15552-9_34\">10.1007/978-3-642-15552-9_34</a>","chicago":"Vicente, Sara, Vladimir Kolmogorov, and Carsten Rother. “Cosegmentation Revisited: Models and Optimization,” 6312:465–79. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15552-9_34\">https://doi.org/10.1007/978-3-642-15552-9_34</a>.","ieee":"S. Vicente, V. Kolmogorov, and C. Rother, “Cosegmentation revisited: Models and optimization,” presented at the ECCV: European Conference on Computer Vision, 2010, vol. 6312, pp. 465–479."},"volume":6312,"quality_controlled":0,"day":"30","author":[{"last_name":"Vicente","full_name":"Vicente, Sara","first_name":"Sara"},{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov"},{"first_name":"Carsten","full_name":"Rother, Carsten","last_name":"Rother"}],"page":"465 - 479","date_published":"2010-08-30T00:00:00Z","extern":1,"month":"08","abstract":[{"text":"The problem of cosegmentation consists of segmenting the same object (or objects of the same class) in two or more distinct images. Recently a number of different models have been proposed for this problem. However, no comparison of such models and corresponding optimization techniques has been done so far. We analyze three existing models: the L1 norm model of Rother et al. [1], the L2 norm model of Mukherjee et al. [2] and the &quot;reward&quot; model of Hochbaum and Singh [3]. We also study a new model, which is a straightforward extension of the Boykov-Jolly model for single image segmentation [4]. In terms of optimization, we use a Dual Decomposition (DD) technique in addition to optimization methods in [1,2]. Experiments show a significant improvement of DD over published methods. Our main conclusion, however, is that the new model is the best overall because it: (i) has fewest parameters; (ii) is most robust in practice, and (iii) can be optimized well with an efficient EM-style procedure.","lang":"eng"}],"publisher":"Springer","intvolume":"      6312","alternative_title":["LNCS"],"date_created":"2018-12-11T12:01:59Z","publist_id":"3479","conference":{"name":"ECCV: European Conference on Computer Vision"},"year":"2010","date_updated":"2021-01-12T07:41:46Z","doi":"10.1007/978-3-642-15552-9_34","_id":"3201","status":"public","publication_status":"published","title":"Cosegmentation revisited: Models and optimization","type":"conference"},{"alternative_title":["LNCS"],"date_created":"2018-12-11T12:02:10Z","conference":{"name":"TCC: Theory of Cryptography Conference"},"publist_id":"3446","year":"2010","doi":"10.1007/978-3-642-11799-2_1","date_updated":"2021-01-12T07:41:59Z","_id":"3233","publication_status":"published","status":"public","type":"conference","title":"An efficient parallel repetition theorem","citation":{"ama":"Håstad J, Pass R, Wikström D, Pietrzak KZ. An efficient parallel repetition theorem. In: Vol 5978. Springer; 2010:1-18. doi:<a href=\"https://doi.org/10.1007/978-3-642-11799-2_1\">10.1007/978-3-642-11799-2_1</a>","chicago":"Håstad, Johan, Rafael Pass, Douglas Wikström, and Krzysztof Z Pietrzak. “An Efficient Parallel Repetition Theorem,” 5978:1–18. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-11799-2_1\">https://doi.org/10.1007/978-3-642-11799-2_1</a>.","ieee":"J. Håstad, R. Pass, D. Wikström, and K. Z. Pietrzak, “An efficient parallel repetition theorem,” presented at the TCC: Theory of Cryptography Conference, 2010, vol. 5978, pp. 1–18.","mla":"Håstad, Johan, et al. <i>An Efficient Parallel Repetition Theorem</i>. Vol. 5978, Springer, 2010, pp. 1–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-11799-2_1\">10.1007/978-3-642-11799-2_1</a>.","apa":"Håstad, J., Pass, R., Wikström, D., &#38; Pietrzak, K. Z. (2010). An efficient parallel repetition theorem (Vol. 5978, pp. 1–18). Presented at the TCC: Theory of Cryptography Conference, Springer. <a href=\"https://doi.org/10.1007/978-3-642-11799-2_1\">https://doi.org/10.1007/978-3-642-11799-2_1</a>","ista":"Håstad J, Pass R, Wikström D, Pietrzak KZ. 2010. An efficient parallel repetition theorem. TCC: Theory of Cryptography Conference, LNCS, vol. 5978, 1–18.","short":"J. Håstad, R. Pass, D. Wikström, K.Z. Pietrzak, in:, Springer, 2010, pp. 1–18."},"quality_controlled":0,"volume":5978,"day":"26","page":"1 - 18","author":[{"first_name":"Johan","last_name":"Håstad","full_name":"Håstad, Johan"},{"first_name":"Rafael","last_name":"Pass","full_name":"Pass, Rafael"},{"first_name":"Douglas","last_name":"Wikström","full_name":"Wikström, Douglas"},{"orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Krzysztof Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"}],"extern":1,"date_published":"2010-03-26T00:00:00Z","month":"03","publisher":"Springer","abstract":[{"lang":"eng","text":"We present a general parallel-repetition theorem with an efficient reduction. As a corollary of this theorem we establish that parallel repetition reduces the soundness error at an exponential rate in any public-coin argument, and more generally, any argument where the verifier's messages, but not necessarily its decision to accept or reject, can be efficiently simulated with noticeable probability."}],"intvolume":"      5978"},{"title":"Leakage resilient signatures","type":"conference","_id":"3234","status":"public","publication_status":"published","year":"2010","date_updated":"2021-01-12T07:41:59Z","doi":"10.1007/978-3-642-11799-2_21","alternative_title":["LNCS"],"date_created":"2018-12-11T12:02:10Z","publist_id":"3447","conference":{"name":"TCC: Theory of Cryptography Conference"},"abstract":[{"text":"The strongest standard security notion for digital signature schemes is unforgeability under chosen message attacks. In practice, however, this notion can be insufficient due to &quot;side-channel attacks&quot; which exploit leakage of information about the secret internal state. In this work we put forward the notion of &quot;leakage-resilient signatures,&quot; which strengthens the standard security notion by giving the adversary the additional power to learn a bounded amount of arbitrary information about the secret state that was accessed during every signature generation. This notion naturally implies security against all side-channel attacks as long as the amount of information leaked on each invocation is bounded and &quot;only computation leaks information.&quot; The main result of this paper is a construction which gives a (tree-based, stateful) leakage-resilient signature scheme based on any 3-time signature scheme. The amount of information that our scheme can safely leak per signature generation is 1/3 of the information the underlying 3-time signature scheme can leak in total. Signature schemes that remain secure even if a bounded total amount of information is leaked were recently constructed, hence instantiating our construction with these schemes gives the first constructions of provably secure leakage-resilient signature schemes. The above construction assumes that the signing algorithm can sample truly random bits, and thus an implementation would need some special hardware (randomness gates). Simply generating this randomness using a leakage-resilient stream-cipher will in general not work. Our second contribution is a sound general principle to replace uniform random bits in any leakage-resilient construction with pseudorandom ones: run two leakage-resilient stream-ciphers (with independent keys) in parallel and then apply a two-source extractor to their outputs. ","lang":"eng"}],"publisher":"Springer","intvolume":"      5978","date_published":"2010-03-26T00:00:00Z","extern":1,"month":"03","day":"26","author":[{"last_name":"Faust","full_name":"Faust, Sebastian","first_name":"Sebastian"},{"full_name":"Kiltz, Eike","last_name":"Kiltz","first_name":"Eike"},{"orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Krzysztof Pietrzak","last_name":"Pietrzak"},{"full_name":"Rothblum, Guy N","last_name":"Rothblum","first_name":"Guy"}],"page":"343 - 360","citation":{"short":"S. Faust, E. Kiltz, K.Z. Pietrzak, G. Rothblum, in:, Springer, 2010, pp. 343–360.","ista":"Faust S, Kiltz E, Pietrzak KZ, Rothblum G. 2010. Leakage resilient signatures. TCC: Theory of Cryptography Conference, LNCS, vol. 5978, 343–360.","apa":"Faust, S., Kiltz, E., Pietrzak, K. Z., &#38; Rothblum, G. (2010). Leakage resilient signatures (Vol. 5978, pp. 343–360). Presented at the TCC: Theory of Cryptography Conference, Springer. <a href=\"https://doi.org/10.1007/978-3-642-11799-2_21\">https://doi.org/10.1007/978-3-642-11799-2_21</a>","mla":"Faust, Sebastian, et al. <i>Leakage Resilient Signatures</i>. Vol. 5978, Springer, 2010, pp. 343–60, doi:<a href=\"https://doi.org/10.1007/978-3-642-11799-2_21\">10.1007/978-3-642-11799-2_21</a>.","ieee":"S. Faust, E. Kiltz, K. Z. Pietrzak, and G. Rothblum, “Leakage resilient signatures,” presented at the TCC: Theory of Cryptography Conference, 2010, vol. 5978, pp. 343–360.","ama":"Faust S, Kiltz E, Pietrzak KZ, Rothblum G. Leakage resilient signatures. In: Vol 5978. Springer; 2010:343-360. doi:<a href=\"https://doi.org/10.1007/978-3-642-11799-2_21\">10.1007/978-3-642-11799-2_21</a>","chicago":"Faust, Sebastian, Eike Kiltz, Krzysztof Z Pietrzak, and Guy Rothblum. “Leakage Resilient Signatures,” 5978:343–60. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-11799-2_21\">https://doi.org/10.1007/978-3-642-11799-2_21</a>."},"volume":5978,"quality_controlled":0},{"intvolume":"      6223","abstract":[{"text":"A cryptographic primitive is leakage-resilient, if it remains secure even if an adversary can learn a bounded amount of arbitrary information about the computation with every invocation. As a consequence, the physical implementation of a leakage-resilient primitive is secure against every side-channel as long as the amount of information leaked per invocation is bounded. In this paper we prove positive and negative results about the feasibility of constructing leakage-resilient pseudorandom functions and permutations (i.e. block-ciphers). Our results are three fold: 1. We construct (from any standard PRF) a PRF which satisfies a relaxed notion of leakage-resilience where (1) the leakage function is fixed (and not adaptively chosen with each query.) and (2) the computation is split into several steps which leak individually (a &quot;step&quot; will be the invocation of the underlying PRF.) 2. We prove that a Feistel network with a super-logarithmic number of rounds, each instantiated with a leakage-resilient PRF, is a leakage resilient PRP. This reduction also holds for the non-adaptive notion just discussed, we thus get a block-cipher which is leakage-resilient (against non-adaptive leakage). 3. We propose generic side-channel attacks against Feistel networks. The attacks are generic in the sense that they work for any round functions (e.g. uniformly random functions) and only require some simple leakage from the inputs to the round functions. For example we show how to invert an r round Feistel network over 2n bits making 4•(n+1) r-2 forward queries, if with each query we are also given as leakage the Hamming weight of the inputs to the r round functions. This complements the result from the previous item showing that a super-constant number of rounds is necessary.","lang":"eng"}],"publisher":"Springer","month":"09","date_published":"2010-09-30T00:00:00Z","extern":1,"author":[{"last_name":"Dodis","full_name":"Dodis, Yevgeniy","first_name":"Yevgeniy"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Krzysztof Pietrzak","orcid":"0000-0002-9139-1654"}],"page":"21 - 40","day":"30","quality_controlled":0,"volume":6223,"citation":{"ama":"Dodis Y, Pietrzak KZ. Leakage resilient pseudorandom functions and side channel attacks on feistel networks. In: Vol 6223. Springer; 2010:21-40. doi:<a href=\"https://doi.org/10.1007/978-3-642-14623-7_2\">10.1007/978-3-642-14623-7_2</a>","chicago":"Dodis, Yevgeniy, and Krzysztof Z Pietrzak. “Leakage Resilient Pseudorandom Functions and Side Channel Attacks on Feistel Networks,” 6223:21–40. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14623-7_2\">https://doi.org/10.1007/978-3-642-14623-7_2</a>.","ieee":"Y. Dodis and K. Z. Pietrzak, “Leakage resilient pseudorandom functions and side channel attacks on feistel networks,” presented at the CRYPTO: International Cryptology Conference, 2010, vol. 6223, pp. 21–40.","apa":"Dodis, Y., &#38; Pietrzak, K. Z. (2010). Leakage resilient pseudorandom functions and side channel attacks on feistel networks (Vol. 6223, pp. 21–40). Presented at the CRYPTO: International Cryptology Conference, Springer. <a href=\"https://doi.org/10.1007/978-3-642-14623-7_2\">https://doi.org/10.1007/978-3-642-14623-7_2</a>","mla":"Dodis, Yevgeniy, and Krzysztof Z. Pietrzak. <i>Leakage Resilient Pseudorandom Functions and Side Channel Attacks on Feistel Networks</i>. Vol. 6223, Springer, 2010, pp. 21–40, doi:<a href=\"https://doi.org/10.1007/978-3-642-14623-7_2\">10.1007/978-3-642-14623-7_2</a>.","ista":"Dodis Y, Pietrzak KZ. 2010. Leakage resilient pseudorandom functions and side channel attacks on feistel networks. CRYPTO: International Cryptology Conference, LNCS, vol. 6223, 21–40.","short":"Y. Dodis, K.Z. Pietrzak, in:, Springer, 2010, pp. 21–40."},"title":"Leakage resilient pseudorandom functions and side channel attacks on feistel networks","type":"conference","status":"public","publication_status":"published","_id":"3235","date_updated":"2021-01-12T07:42:00Z","doi":"10.1007/978-3-642-14623-7_2","year":"2010","publist_id":"3445","conference":{"name":"CRYPTO: International Cryptology Conference"},"date_created":"2018-12-11T12:02:10Z","alternative_title":["LNCS"]}]