[{"year":"2010","_id":"3865","page":"293 - 307","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"closed access","intvolume":"      6013","date_updated":"2025-05-20T06:36:30Z","publisher":"Springer","status":"public","type":"conference","publist_id":"2315","doi":"10.1007/978-3-642-12029-9_21","date_published":"2010-04-21T00:00:00Z","citation":{"ista":"Chatterjee K, De Alfaro L, Raman V, Sánchez C. 2010. Analyzing the impact of change in multi-threaded programs. 13th International Conference on Fundamental Approaches to Software Engineering. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 6013, 293–307.","short":"K. Chatterjee, L. De Alfaro, V. Raman, C. Sánchez, in:, 13th International Conference on Fundamental Approaches to Software Engineering, Springer, 2010, pp. 293–307.","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, Vishwanath Raman, and César Sánchez. “Analyzing the Impact of Change in Multi-Threaded Programs.” In <i>13th International Conference on Fundamental Approaches to Software Engineering</i>, 6013:293–307. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">https://doi.org/10.1007/978-3-642-12029-9_21</a>.","ama":"Chatterjee K, De Alfaro L, Raman V, Sánchez C. Analyzing the impact of change in multi-threaded programs. In: <i>13th International Conference on Fundamental Approaches to Software Engineering</i>. Vol 6013. Springer; 2010:293-307. doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">10.1007/978-3-642-12029-9_21</a>","apa":"Chatterjee, K., De Alfaro, L., Raman, V., &#38; Sánchez, C. (2010). Analyzing the impact of change in multi-threaded programs. In <i>13th International Conference on Fundamental Approaches to Software Engineering</i> (Vol. 6013, pp. 293–307). Paphos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">https://doi.org/10.1007/978-3-642-12029-9_21</a>","ieee":"K. Chatterjee, L. De Alfaro, V. Raman, and C. Sánchez, “Analyzing the impact of change in multi-threaded programs,” in <i>13th International Conference on Fundamental Approaches to Software Engineering</i>, Paphos, Cyprus, 2010, vol. 6013, pp. 293–307.","mla":"Chatterjee, Krishnendu, et al. “Analyzing the Impact of Change in Multi-Threaded Programs.” <i>13th International Conference on Fundamental Approaches to Software Engineering</i>, vol. 6013, Springer, 2010, pp. 293–307, doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">10.1007/978-3-642-12029-9_21</a>."},"volume":6013,"month":"04","article_processing_charge":"No","conference":{"end_date":"2010-03-28","name":"FASE: Fundamental Approaches To Software Engineering","location":"Paphos, Cyprus","start_date":"2010-03-20"},"date_created":"2018-12-11T12:05:35Z","quality_controlled":"1","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783642120299"]},"language":[{"iso":"eng"}],"oa_version":"None","abstract":[{"text":"We introduce a technique for debugging multi-threaded C programs and analyzing the impact of source code changes, and its implementation in the prototype tool DIRECT. Our approach uses a combination of source code instrumentation and runtime management. The source code along with a test harness is instrumented to monitor Operating System (OS) and user defined function calls. DIRECT tracks all concurrency control primitives and, optionally, data from the program. DIRECT maintains an abstract global state that combines information from every thread, including the sequence of function calls and concurrency primitives executed. The runtime manager can insert delays, provoking thread inter-leavings that may exhibit bugs that are difficult to reach otherwise. The runtime manager collects an approximation of the reachable state space and uses this approximation to assess the impact of change in a new version of the program.","lang":"eng"}],"day":"21","publication":"13th International Conference on Fundamental Approaches to Software Engineering","scopus_import":"1","publication_status":"published","alternative_title":["LNCS"],"title":"Analyzing the impact of change in multi-threaded programs","department":[{"_id":"KrCh"}],"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Luca","last_name":"De Alfaro","full_name":"De Alfaro, Luca"},{"first_name":"Vishwanath","last_name":"Raman","full_name":"Raman, Vishwanath"},{"last_name":"Sánchez","first_name":"César","full_name":"Sánchez, César"}]},{"author":[{"first_name":"Roderick","full_name":"Bloem, Roderick","last_name":"Bloem"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Greimel, Karin","first_name":"Karin","last_name":"Greimel"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Jobstmann, Barbara","first_name":"Barbara","last_name":"Jobstmann"}],"file":[{"file_id":"5243","creator":"system","checksum":"9d204611c8d7855bed8134f8708a0010","date_created":"2018-12-12T10:16:52Z","date_updated":"2020-07-14T12:46:19Z","access_level":"open_access","relation":"main_file","file_name":"IST-2012-54-v1+1_Robustness_in_the_presence_of_liveness.pdf","content_type":"application/pdf","file_size":213083}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Robustness in the presence of liveness","alternative_title":["LNCS"],"pubrep_id":"54","has_accepted_license":"1","publication_status":"published","scopus_import":1,"project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems"}],"abstract":[{"text":"Systems ought to behave reasonably even in circumstances that are not anticipated in their specifications. We propose a definition of robustness for liveness specifications which prescribes, for any number of environment assumptions that are violated, a minimal number of system guarantees that must still be fulfilled. This notion of robustness can be formulated and realized using a Generalized Reactivity formula. We present an algorithm for synthesizing robust systems from such formulas. For the important special case of Generalized Reactivity formulas of rank 1, our algorithm improves the complexity of [PPS06] for large specifications with a small number of assumptions and guarantees.","lang":"eng"}],"ddc":["004"],"day":"01","ec_funded":1,"oa_version":"Submitted Version","language":[{"iso":"eng"}],"editor":[{"full_name":"Touili, Tayssir","last_name":"Touili","first_name":"Tayssir"},{"first_name":"Byron","last_name":"Cook","full_name":"Cook, Byron"},{"full_name":"Jackson, Paul","first_name":"Paul","last_name":"Jackson"}],"quality_controlled":"1","date_created":"2018-12-11T12:05:36Z","conference":{"location":"Edinburgh, UK","start_date":"2010-07-15","name":"CAV: Computer Aided Verification","end_date":"2010-07-19"},"month":"07","volume":6174,"oa":1,"citation":{"apa":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., &#38; Jobstmann, B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, &#38; P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">https://doi.org/10.1007/978-3-642-14295-6_36</a>","mla":"Bloem, Roderick, et al. <i>Robustness in the Presence of Liveness</i>. Edited by Tayssir Touili et al., vol. 6174, Springer, 2010, pp. 410–24, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">10.1007/978-3-642-14295-6_36</a>.","ieee":"R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Robustness in the presence of liveness,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 410–424.","ama":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. Robustness in the presence of liveness. In: Touili T, Cook B, Jackson P, eds. Vol 6174. Springer; 2010:410-424. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">10.1007/978-3-642-14295-6_36</a>","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Robustness in the Presence of Liveness.” edited by Tayssir Touili, Byron Cook, and Paul Jackson, 6174:410–24. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">https://doi.org/10.1007/978-3-642-14295-6_36</a>.","ista":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2010. Robustness in the presence of liveness. CAV: Computer Aided Verification, LNCS, vol. 6174, 410–424.","short":"R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, T. Touili, B. Cook, P. Jackson (Eds.), Springer, 2010, pp. 410–424."},"file_date_updated":"2020-07-14T12:46:19Z","date_published":"2010-07-01T00:00:00Z","doi":"10.1007/978-3-642-14295-6_36","publist_id":"2310","status":"public","publisher":"Springer","type":"conference","date_updated":"2021-01-12T07:52:47Z","intvolume":"      6174","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","page":"410 - 424","_id":"3866","year":"2010"},{"title":"Expressiveness and closure properties for quantitative languages","file":[{"file_name":"IST-2012-55-v1+1_Expressiveness_Closure_Properties_Quantitative_Languages.pdf","checksum":"0243da726476817f2ea33b48b78be696","file_id":"5312","creator":"system","date_created":"2018-12-12T10:17:54Z","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:46:19Z","content_type":"application/pdf","file_size":216598},{"file_name":"IST-2016-55-v2+1_1007.4018.pdf","creator":"system","checksum":"5e512b8503a9cb263de26331c4ee9cf2","file_id":"5313","date_created":"2018-12-12T10:17:55Z","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:46:19Z","content_type":"application/pdf","file_size":302416}],"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"external_id":{"isi":["000282653500010"]},"author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"}],"ec_funded":1,"oa_version":"Published Version","publication":"Logical Methods in Computer Science","issue":"3","abstract":[{"text":"Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit-average, or discounted-sum of the transition weights. The value of a word w is the supremum of the values of the runs over w. We study expressiveness and closure questions about these quantitative languages. We first show that the set of words with value greater than a threshold can be omega-regular for deterministic limit-average and discounted-sum automata, while this set is always omega-regular when the threshold is isolated (i.e., some neighborhood around the threshold contains no word). In the latter case, we prove that the omega-regular language is robust against small perturbations of the transition weights. We next consider automata with transition weights 0 or 1 and show that they are as expressive as general weighted automata in the limit-average case, but not in the discounted-sum case. Third, for quantitative languages L-1 and L-2, we consider the operations max(L-1, L-2), min(L-1, L-2), and 1 - L-1, which generalize the boolean operations on languages, as well as the sum L-1 + L-2. We establish the closure properties of all classes of quantitative languages with respect to these four operations.","lang":"eng"}],"ddc":["000","004"],"day":"30","project":[{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems"},{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"}],"publication_status":"published","corr_author":"1","scopus_import":"1","related_material":{"record":[{"id":"4540","status":"public","relation":"earlier_version"}]},"has_accepted_license":"1","pubrep_id":"504","file_date_updated":"2020-07-14T12:46:19Z","date_published":"2010-08-30T00:00:00Z","oa":1,"article_processing_charge":"No","month":"08","volume":6,"citation":{"ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science 6 (2010) 1–23.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2010). Expressiveness and closure properties for quantitative languages. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">https://doi.org/10.2168/LMCS-6(3:10)2010</a>","mla":"Chatterjee, Krishnendu, et al. “Expressiveness and Closure Properties for Quantitative Languages.” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3, International Federation of Computational Logic, 2010, pp. 1–23, doi:<a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">10.2168/LMCS-6(3:10)2010</a>.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure properties for quantitative languages,” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3. International Federation of Computational Logic, pp. 1–23, 2010.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2010. <a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">https://doi.org/10.2168/LMCS-6(3:10)2010</a>.","ama":"Chatterjee K, Doyen L, Henzinger TA. Expressiveness and closure properties for quantitative languages. <i>Logical Methods in Computer Science</i>. 2010;6(3):1-23. doi:<a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">10.2168/LMCS-6(3:10)2010</a>"},"date_created":"2018-12-11T12:05:36Z","language":[{"iso":"eng"}],"quality_controlled":"1","_id":"3867","page":"1 - 23","year":"2010","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-30T09:31:00Z","publisher":"International Federation of Computational Logic","status":"public","type":"journal_article","intvolume":"         6","doi":"10.2168/LMCS-6(3:10)2010","publist_id":"2311"},{"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"De Alfaro, Luca","first_name":"Luca","last_name":"De Alfaro"},{"full_name":"Majumdar, Ritankar","first_name":"Ritankar","last_name":"Majumdar"},{"last_name":"Raman","full_name":"Raman, Vishwanath","first_name":"Vishwanath"}],"external_id":{"isi":["000282653500013"]},"file":[{"file_name":"IST-2015-370-v1+1_0809.4326.pdf","checksum":"a18988135fef3016c93808ecb15b55f5","file_id":"4671","creator":"system","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:46:19Z","date_created":"2018-12-12T10:08:11Z","content_type":"application/pdf","file_size":346527}],"department":[{"_id":"KrCh"}],"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"title":"Algorithms for game metrics","pubrep_id":"370","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3504"}]},"has_accepted_license":"1","corr_author":"1","publication_status":"published","scopus_import":"1","issue":"3","publication":"Logical Methods in Computer Science","abstract":[{"text":"Simulation and bisimulation metrics for stochastic systems provide a quantitative generalization of the classical simulation and bisimulation relations. These metrics capture the similarity of states with respect to quantitative specifications written in the quantitative mu-calculus and related probabilistic logics. We first show that the metrics provide a bound for the difference in long-run average and discounted average behavior across states, indicating that the metrics can be used both in system verification, and in performance evaluation. For turn-based games and MDPs, we provide a polynomial-time algorithm for the computation of the one-step metric distance between states. The algorithm is based on linear programming; it improves on the previous known exponential-time algorithm based on a reduction to the theory of reals. We then present PSPACE algorithms for both the decision problem and the problem of approximating the metric distance between two states, matching the best known algorithms for Markov chains. For the bisimulation kernel of the metric our algorithm works in time O(n(4)) for both turn-based games and MDPs; improving the previously best known O(n(9).log(n)) time algorithm for MDPs. For a concurrent game G, we show that computing the exact distance be tween states is at least as hard as computing the value of concurrent reachability games and the square-root-sum problem in computational geometry. We show that checking whether the metric distance is bounded by a rational r, can be done via a reduction to the theory of real closed fields, involving a formula with three quantifier alternations, yielding O(vertical bar G vertical bar(O(vertical bar G vertical bar 5))) time complexity, improving the previously known reduction, which yielded O(vertical bar G vertical bar(O(vertical bar G vertical bar 7))) time complexity. These algorithms can be iterated to approximate the metrics using binary search","lang":"eng"}],"day":"01","ddc":["000"],"oa_version":"Published Version","language":[{"iso":"eng"}],"quality_controlled":"1","date_created":"2018-12-11T12:05:36Z","article_processing_charge":"No","month":"09","volume":6,"oa":1,"citation":{"ista":"Chatterjee K, De Alfaro L, Majumdar R, Raman V. 2010. Algorithms for game metrics. Logical Methods in Computer Science. 6(3), 1–27.","short":"K. Chatterjee, L. De Alfaro, R. Majumdar, V. Raman, Logical Methods in Computer Science 6 (2010) 1–27.","apa":"Chatterjee, K., De Alfaro, L., Majumdar, R., &#38; Raman, V. (2010). Algorithms for game metrics. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-6(3:13)2010\">https://doi.org/10.2168/LMCS-6(3:13)2010</a>","mla":"Chatterjee, Krishnendu, et al. “Algorithms for Game Metrics.” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3, International Federation of Computational Logic, 2010, pp. 1–27, doi:<a href=\"https://doi.org/10.2168/LMCS-6(3:13)2010\">10.2168/LMCS-6(3:13)2010</a>.","ieee":"K. Chatterjee, L. De Alfaro, R. Majumdar, and V. Raman, “Algorithms for game metrics,” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3. International Federation of Computational Logic, pp. 1–27, 2010.","ama":"Chatterjee K, De Alfaro L, Majumdar R, Raman V. Algorithms for game metrics. <i>Logical Methods in Computer Science</i>. 2010;6(3):1-27. doi:<a href=\"https://doi.org/10.2168/LMCS-6(3:13)2010\">10.2168/LMCS-6(3:13)2010</a>","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, Ritankar Majumdar, and Vishwanath Raman. “Algorithms for Game Metrics.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2010. <a href=\"https://doi.org/10.2168/LMCS-6(3:13)2010\">https://doi.org/10.2168/LMCS-6(3:13)2010</a>."},"file_date_updated":"2020-07-14T12:46:19Z","date_published":"2010-09-01T00:00:00Z","doi":"10.2168/LMCS-6(3:13)2010","publist_id":"2312","status":"public","type":"journal_article","publisher":"International Federation of Computational Logic","date_updated":"2025-09-30T09:31:30Z","intvolume":"         6","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"1 - 27","_id":"3868","year":"2010"},{"intvolume":"        16","status":"public","type":"journal_article","publisher":"IEEE","date_updated":"2025-09-30T09:30:22Z","publist_id":"2253","doi":"10.1109/TVCG.2010.139","year":"2010","page":"1251 - 1260","_id":"3901","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"date_created":"2018-12-11T12:05:47Z","quality_controlled":"1","language":[{"iso":"eng"}],"date_published":"2010-10-28T00:00:00Z","file_date_updated":"2020-07-14T12:46:21Z","citation":{"ista":"Bendich P, Edelsbrunner H, Kerber M. 2010. Computing robustness and persistence for images. IEEE Transactions of Visualization and Computer Graphics. 16(6), 1251–1260.","short":"P. Bendich, H. Edelsbrunner, M. Kerber, IEEE Transactions of Visualization and Computer Graphics 16 (2010) 1251–1260.","apa":"Bendich, P., Edelsbrunner, H., &#38; Kerber, M. (2010). Computing robustness and persistence for images. <i>IEEE Transactions of Visualization and Computer Graphics</i>. IEEE. <a href=\"https://doi.org/10.1109/TVCG.2010.139\">https://doi.org/10.1109/TVCG.2010.139</a>","ieee":"P. Bendich, H. Edelsbrunner, and M. Kerber, “Computing robustness and persistence for images,” <i>IEEE Transactions of Visualization and Computer Graphics</i>, vol. 16, no. 6. IEEE, pp. 1251–1260, 2010.","mla":"Bendich, Paul, et al. “Computing Robustness and Persistence for Images.” <i>IEEE Transactions of Visualization and Computer Graphics</i>, vol. 16, no. 6, IEEE, 2010, pp. 1251–60, doi:<a href=\"https://doi.org/10.1109/TVCG.2010.139\">10.1109/TVCG.2010.139</a>.","chicago":"Bendich, Paul, Herbert Edelsbrunner, and Michael Kerber. “Computing Robustness and Persistence for Images.” <i>IEEE Transactions of Visualization and Computer Graphics</i>. IEEE, 2010. <a href=\"https://doi.org/10.1109/TVCG.2010.139\">https://doi.org/10.1109/TVCG.2010.139</a>.","ama":"Bendich P, Edelsbrunner H, Kerber M. Computing robustness and persistence for images. <i>IEEE Transactions of Visualization and Computer Graphics</i>. 2010;16(6):1251-1260. doi:<a href=\"https://doi.org/10.1109/TVCG.2010.139\">10.1109/TVCG.2010.139</a>"},"volume":16,"month":"10","article_processing_charge":"No","oa":1,"scopus_import":"1","corr_author":"1","publication_status":"published","pubrep_id":"536","has_accepted_license":"1","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to acontinuous function, we study the robustness of homology classes in its level and interlevel sets, that is, the amount of perturbationneeded to destroy these classes. The structure of the homology classes and their robustness, over all level and interlevel sets, can bevisualized by a triangular diagram of dots obtained by computing the extended persistence of the function. We give a fast hierarchicalalgorithm using the dual complexes of oct-tree approximations of the function. In addition, we show that for balanced oct-trees, thedual complexes are geometrically realized in $R^3$ and can thus be used to construct level and interlevel sets. We apply these tools tostudy 3-dimensional images of plant root systems."}],"day":"28","ddc":["000"],"publication":"IEEE Transactions of Visualization and Computer Graphics","issue":"6","external_id":{"isi":["000283758600045"]},"author":[{"last_name":"Bendich","full_name":"Bendich, Paul","first_name":"Paul","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","orcid":"0000-0002-9823-6833"},{"orcid":"0000-0002-8030-9299","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","full_name":"Kerber, Michael","last_name":"Kerber","first_name":"Michael"}],"title":"Computing robustness and persistence for images","department":[{"_id":"HeEd"}],"file":[{"file_size":721994,"content_type":"application/pdf","date_created":"2018-12-12T10:17:10Z","relation":"main_file","date_updated":"2020-07-14T12:46:21Z","access_level":"open_access","file_id":"5262","checksum":"f6d813c04f4b46023cec6b9a17f15472","creator":"system","file_name":"IST-2016-536-v1+1_2010-J-02-PersistenceforImages.pdf"}]},{"title":"Why is adaptation prevented at ecological margins? New insights from individual-based simulations","department":[{"_id":"NiBa"}],"external_id":{"isi":["000275635400008"]},"author":[{"first_name":"Jon","full_name":"Bridle, Jon","last_name":"Bridle"},{"full_name":"Polechova, Jitka","first_name":"Jitka","id":"3BBFB084-F248-11E8-B48F-1D18A9856A87","last_name":"Polechova","orcid":"0000-0003-0951-3112"},{"last_name":"Kawata","first_name":"Masakado","full_name":"Kawata, Masakado"},{"first_name":"Roger","full_name":"Butlin, Roger","last_name":"Butlin"}],"ec_funded":1,"oa_version":"None","publication":"Ecology Letters","issue":"4","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"day":"15","abstract":[{"text":"All species are restricted in their distribution. Currently, ecological models can only explain such limits if patches vary in quality, leading to asymmetrical dispersal, or if genetic variation is too low at the margins for adaptation. However, population genetic models suggest that the increase in genetic variance resulting from dispersal should allow adaptation to almost any ecological gradient. Clearly therefore, these models miss something that prevents evolution in natural populations. We developed an individual-based simulation to explore stochastic effects in these models. At high carrying capacities, our simulations largely agree with deterministic predictions. However, when carrying capacity is low, the population fails to establish for a wide range of parameter values where adaptation was expected from previous models. Stochastic or transient effects appear critical around the boundaries in parameter space between simulation behaviours. Dispersal, gradient steepness, and population density emerge as key factors determining adaptation on an ecological gradient. ","lang":"eng"}],"publication_status":"published","scopus_import":"1","date_published":"2010-03-15T00:00:00Z","month":"03","volume":13,"article_processing_charge":"No","citation":{"ista":"Bridle J, Polechova J, Kawata M, Butlin R. 2010. Why is adaptation prevented at ecological margins? New insights from individual-based simulations. Ecology Letters. 13(4), 485–494.","short":"J. Bridle, J. Polechova, M. Kawata, R. Butlin, Ecology Letters 13 (2010) 485–494.","ama":"Bridle J, Polechova J, Kawata M, Butlin R. Why is adaptation prevented at ecological margins? New insights from individual-based simulations. <i>Ecology Letters</i>. 2010;13(4):485-494. doi:<a href=\"https://doi.org/10.1111/j.1461-0248.2010.01442.x\">10.1111/j.1461-0248.2010.01442.x</a>","chicago":"Bridle, Jon, Jitka Polechova, Masakado Kawata, and Roger Butlin. “Why Is Adaptation Prevented at Ecological Margins? New Insights from Individual-Based Simulations.” <i>Ecology Letters</i>. Wiley-Blackwell, 2010. <a href=\"https://doi.org/10.1111/j.1461-0248.2010.01442.x\">https://doi.org/10.1111/j.1461-0248.2010.01442.x</a>.","apa":"Bridle, J., Polechova, J., Kawata, M., &#38; Butlin, R. (2010). Why is adaptation prevented at ecological margins? New insights from individual-based simulations. <i>Ecology Letters</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1461-0248.2010.01442.x\">https://doi.org/10.1111/j.1461-0248.2010.01442.x</a>","mla":"Bridle, Jon, et al. “Why Is Adaptation Prevented at Ecological Margins? New Insights from Individual-Based Simulations.” <i>Ecology Letters</i>, vol. 13, no. 4, Wiley-Blackwell, 2010, pp. 485–94, doi:<a href=\"https://doi.org/10.1111/j.1461-0248.2010.01442.x\">10.1111/j.1461-0248.2010.01442.x</a>.","ieee":"J. Bridle, J. Polechova, M. Kawata, and R. Butlin, “Why is adaptation prevented at ecological margins? New insights from individual-based simulations,” <i>Ecology Letters</i>, vol. 13, no. 4. Wiley-Blackwell, pp. 485–494, 2010."},"date_created":"2018-12-11T12:07:08Z","language":[{"iso":"eng"}],"quality_controlled":"1","page":"485 - 494","_id":"4134","year":"2010","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publisher":"Wiley-Blackwell","type":"journal_article","status":"public","date_updated":"2025-09-30T09:29:55Z","intvolume":"        13","doi":"10.1111/j.1461-0248.2010.01442.x","acknowledgement":"We are very grateful to Nick Barton.","publist_id":"1987"},{"external_id":{"pmid":["20717145"],"isi":["000281006400009"]},"author":[{"first_name":"Ekaterina","id":"41DB591E-F248-11E8-B48F-1D18A9856A87","last_name":"Papusheva","full_name":"Papusheva, Ekaterina"},{"last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566"}],"title":"Spatial organization of adhesion: force-dependent regulation and function in tissue morphogenesis","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2924654/","open_access":"1"}],"department":[{"_id":"Bio"},{"_id":"CaHe"}],"publication_status":"published","scopus_import":"1","oa_version":"Submitted Version","publication":"EMBO Journal","issue":"16","day":"18","abstract":[{"text":"Integrin- and cadherin-mediated adhesion is central for cell and tissue morphogenesis, allowing cells and tissues to change shape without loosing integrity. Studies predominantly in cell culture showed that mechanosensation through adhesion structures is achieved by force-mediated modulation of their molecular composition. The specific molecular composition of adhesion sites in turn determines their signalling activity and dynamic reorganization. Here, we will review how adhesion sites respond to mecanical stimuli, and how spatially and temporally regulated signalling from different adhesion sites controls cell migration and tissue morphogenesis.","lang":"eng"}],"date_created":"2018-12-11T12:07:17Z","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2010-08-18T00:00:00Z","oa":1,"month":"08","volume":29,"article_processing_charge":"No","citation":{"short":"E. Papusheva, C.-P.J. Heisenberg, EMBO Journal 29 (2010) 2753–2768.","ista":"Papusheva E, Heisenberg C-PJ. 2010. Spatial organization of adhesion: force-dependent regulation and function in tissue morphogenesis. EMBO Journal. 29(16), 2753–2768.","ama":"Papusheva E, Heisenberg C-PJ. Spatial organization of adhesion: force-dependent regulation and function in tissue morphogenesis. <i>EMBO Journal</i>. 2010;29(16):2753-2768. doi:<a href=\"https://doi.org/10.1038/emboj.2010.182\">10.1038/emboj.2010.182</a>","chicago":"Papusheva, Ekaterina, and Carl-Philipp J Heisenberg. “Spatial Organization of Adhesion: Force-Dependent Regulation and Function in Tissue Morphogenesis.” <i>EMBO Journal</i>. Wiley-Blackwell, 2010. <a href=\"https://doi.org/10.1038/emboj.2010.182\">https://doi.org/10.1038/emboj.2010.182</a>.","mla":"Papusheva, Ekaterina, and Carl-Philipp J. Heisenberg. “Spatial Organization of Adhesion: Force-Dependent Regulation and Function in Tissue Morphogenesis.” <i>EMBO Journal</i>, vol. 29, no. 16, Wiley-Blackwell, 2010, pp. 2753–68, doi:<a href=\"https://doi.org/10.1038/emboj.2010.182\">10.1038/emboj.2010.182</a>.","ieee":"E. Papusheva and C.-P. J. Heisenberg, “Spatial organization of adhesion: force-dependent regulation and function in tissue morphogenesis,” <i>EMBO Journal</i>, vol. 29, no. 16. Wiley-Blackwell, pp. 2753–2768, 2010.","apa":"Papusheva, E., &#38; Heisenberg, C.-P. J. (2010). Spatial organization of adhesion: force-dependent regulation and function in tissue morphogenesis. <i>EMBO Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1038/emboj.2010.182\">https://doi.org/10.1038/emboj.2010.182</a>"},"date_updated":"2025-09-30T09:29:30Z","publisher":"Wiley-Blackwell","type":"journal_article","status":"public","intvolume":"        29","doi":"10.1038/emboj.2010.182","publist_id":"1962","_id":"4157","acknowledged_ssus":[{"_id":"Bio"}],"page":"2753 - 2768","year":"2010","pmid":1,"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"doi":"10.1214/EJP.v15-741","publist_id":"1863","type":"journal_article","publisher":"Institute of Mathematical Statistics","status":"public","date_updated":"2025-09-30T09:28:54Z","intvolume":"        15","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"162 - 216","_id":"4243","year":"2010","language":[{"iso":"eng"}],"quality_controlled":"1","date_created":"2018-12-11T12:07:48Z","month":"02","article_processing_charge":"No","volume":15,"oa":1,"citation":{"ista":"Barton NH, Etheridge A, Véber A. 2010. A new model for evolution in a spatial continuum. Electronic Journal of Probability. 15(7), 162–216.","short":"N.H. Barton, A. Etheridge, A. Véber, Electronic Journal of Probability 15 (2010) 162–216.","chicago":"Barton, Nicholas H, Alison Etheridge, and Amandine Véber. “A New Model for Evolution in a Spatial Continuum.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2010. <a href=\"https://doi.org/10.1214/EJP.v15-741\">https://doi.org/10.1214/EJP.v15-741</a>.","ama":"Barton NH, Etheridge A, Véber A. A new model for evolution in a spatial continuum. <i>Electronic Journal of Probability</i>. 2010;15(7):162-216. doi:<a href=\"https://doi.org/10.1214/EJP.v15-741\">10.1214/EJP.v15-741</a>","apa":"Barton, N. H., Etheridge, A., &#38; Véber, A. (2010). A new model for evolution in a spatial continuum. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/EJP.v15-741\">https://doi.org/10.1214/EJP.v15-741</a>","mla":"Barton, Nicholas H., et al. “A New Model for Evolution in a Spatial Continuum.” <i>Electronic Journal of Probability</i>, vol. 15, no. 7, Institute of Mathematical Statistics, 2010, pp. 162–216, doi:<a href=\"https://doi.org/10.1214/EJP.v15-741\">10.1214/EJP.v15-741</a>.","ieee":"N. H. Barton, A. Etheridge, and A. Véber, “A new model for evolution in a spatial continuum,” <i>Electronic Journal of Probability</i>, vol. 15, no. 7. Institute of Mathematical Statistics, pp. 162–216, 2010."},"file_date_updated":"2020-07-14T12:46:26Z","date_published":"2010-02-03T00:00:00Z","pubrep_id":"369","has_accepted_license":"1","publication_status":"published","scopus_import":"1","issue":"7","publication":"Electronic Journal of Probability","day":"03","abstract":[{"text":"We investigate a new model for populations evolving in a spatial continuum. This model can be thought of as a spatial version of the Lambda-Fleming-Viot process. It explicitly incorporates both small scale reproduction events and large scale extinction-recolonisation events. The lineages ancestral to a sample from a population evolving according to this model can be described in terms of a spatial version of the Lambda-coalescent. Using a technique of Evans (1997), we prove existence and uniqueness in law for the model. We then investigate the asymptotic behaviour of the genealogy of a finite number of individuals sampled uniformly at random (or more generally `far enough apart') from a two-dimensional torus of sidelength L as L tends to infinity. Under appropriate conditions (and on a suitable timescale) we can obtain as limiting genealogical processes a Kingman coalescent, a more general Lambda-coalescent or a system of coalescing Brownian motions (with a non-local coalescence mechanism).","lang":"eng"}],"ddc":["576"],"oa_version":"Published Version","author":[{"orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton"},{"full_name":"Etheridge, Alison","last_name":"Etheridge","first_name":"Alison"},{"first_name":"Amandine","full_name":"Véber, Amandine","last_name":"Véber"}],"external_id":{"isi":["000274822400001"]},"file":[{"file_size":450171,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:26Z","date_created":"2018-12-12T10:15:21Z","checksum":"bab577546dd4e8f882e9a9dd645cd01e","creator":"system","file_id":"5140","file_name":"IST-2015-369-v1+1_741-2535-1-PB.pdf"}],"department":[{"_id":"NiBa"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"title":"A new model for evolution in a spatial continuum"},{"year":"2010","oa_version":"None","page":"421 - 435","_id":"4362","day":"01","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Software transactional memories (STMs) promise simple and efficient concurrent programming. Several correctness properties have been proposed for STMs. Based on a bounded conflict graph algorithm for verifying correctness of STMs, we develop TRACER, a tool for runtime verification of STM implementations. The novelty of TRACER lies in the way it combines coarse and precise runtime analyses to guarantee sound and complete verification in an efficient manner. We implement TRACER in the TL2 STM implementation. We evaluate the performance of TRACER on STAMP benchmarks. While a precise runtime verification technique based on conflict graphs results in an average slowdown of 60x, the two-level approach of TRACER performs complete verification with an average slowdown of around 25x across different benchmarks."}],"intvolume":"      6418","scopus_import":1,"type":"conference","publication_status":"published","publisher":"Springer","corr_author":"1","status":"public","date_updated":"2024-10-09T20:54:01Z","publist_id":"1096","doi":"10.1007/978-3-642-16612-9_32","alternative_title":["LNCS"],"date_published":"2010-01-01T00:00:00Z","title":"Runtime verification for software transactional memories","department":[{"_id":"ToHe"}],"citation":{"short":"V. Singh, in:, O. Sokolsky, G. Rosu, N. Tilmann, H. Barringer, Y. Falcone, B. Finkbeiner, K. Havelund, I. Lee, G. Pace (Eds.), Springer, 2010, pp. 421–435.","ista":"Singh V. 2010. Runtime verification for software transactional memories. RV: International Conference on Runtime Verification, LNCS, vol. 6418, 421–435.","ama":"Singh V. Runtime verification for software transactional memories. In: Sokolsky O, Rosu G, Tilmann N, et al., eds. Vol 6418. Springer; 2010:421-435. doi:<a href=\"https://doi.org/10.1007/978-3-642-16612-9_32\">10.1007/978-3-642-16612-9_32</a>","chicago":"Singh, Vasu. “Runtime Verification for Software Transactional Memories.” edited by Oleg Sokolsky, Grigore Rosu, Nikolai Tilmann, Howard Barringer, Ylies Falcone, Bernd Finkbeiner, Klaus Havelund, Insup Lee, and Gordon Pace, 6418:421–35. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-16612-9_32\">https://doi.org/10.1007/978-3-642-16612-9_32</a>.","ieee":"V. Singh, “Runtime verification for software transactional memories,” presented at the RV: International Conference on Runtime Verification, St. Julians, Malta, 2010, vol. 6418, pp. 421–435.","mla":"Singh, Vasu. <i>Runtime Verification for Software Transactional Memories</i>. Edited by Oleg Sokolsky et al., vol. 6418, Springer, 2010, pp. 421–35, doi:<a href=\"https://doi.org/10.1007/978-3-642-16612-9_32\">10.1007/978-3-642-16612-9_32</a>.","apa":"Singh, V. (2010). Runtime verification for software transactional memories. In O. Sokolsky, G. Rosu, N. Tilmann, H. Barringer, Y. Falcone, B. Finkbeiner, … G. Pace (Eds.) (Vol. 6418, pp. 421–435). Presented at the RV: International Conference on Runtime Verification, St. Julians, Malta: Springer. <a href=\"https://doi.org/10.1007/978-3-642-16612-9_32\">https://doi.org/10.1007/978-3-642-16612-9_32</a>"},"month":"01","volume":6418,"conference":{"end_date":"2010-11-04","name":"RV: International Conference on Runtime Verification","location":"St. Julians, Malta","start_date":"2010-11-01"},"date_created":"2018-12-11T12:08:28Z","quality_controlled":"1","author":[{"id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","full_name":"Singh, Vasu","first_name":"Vasu","last_name":"Singh"}],"language":[{"iso":"eng"}],"editor":[{"first_name":"Oleg","last_name":"Sokolsky","full_name":"Sokolsky, Oleg"},{"full_name":"Rosu, Grigore","last_name":"Rosu","first_name":"Grigore"},{"full_name":"Tilmann, Nikolai","first_name":"Nikolai","last_name":"Tilmann"},{"first_name":"Howard","full_name":"Barringer, Howard","last_name":"Barringer"},{"first_name":"Ylies","last_name":"Falcone","full_name":"Falcone, Ylies"},{"last_name":"Finkbeiner","full_name":"Finkbeiner, Bernd","first_name":"Bernd"},{"full_name":"Havelund, Klaus","first_name":"Klaus","last_name":"Havelund"},{"last_name":"Lee","first_name":"Insup","full_name":"Lee, Insup"},{"full_name":"Pace, Gordon","first_name":"Gordon","last_name":"Pace"}]},{"pubrep_id":"49","has_accepted_license":"1","alternative_title":["LNCS"],"scopus_import":1,"publication_status":"published","corr_author":"1","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","grant_number":"215543"},{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","call_identifier":"FP7"}],"abstract":[{"lang":"eng","text":"In this paper we propose a novel technique for constructing timed automata from properties expressed in the logic mtl, under bounded-variability assumptions. We handle full mtl and include all future operators. Our construction is based on separation of the continuous time monitoring of the input sequence and discrete predictions regarding the future. The separation of the continuous from the discrete allows us to determinize our automata in an exponential construction that does not increase the number of clocks. This leads to a doubly exponential construction from mtl to deterministic timed automata, compared with triply exponential using existing approaches. We offer an alternative to the existing approach to linear real-time model checking, which has never been implemented. It further offers a unified framework for model checking, runtime monitoring, and synthesis, in an approach that can reuse tools, implementations, and insights from the discrete setting."}],"ddc":["004"],"day":"08","oa_version":"Submitted Version","ec_funded":1,"author":[{"full_name":"Nickovic, Dejan","first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic"},{"first_name":"Nir","full_name":"Piterman, Nir","last_name":"Piterman"}],"department":[{"_id":"ToHe"}],"file":[{"checksum":"b0ca5f5fbe8a3d20ccbc6f51a344a459","creator":"system","file_id":"5028","access_level":"open_access","date_updated":"2020-07-14T12:46:27Z","relation":"main_file","date_created":"2018-12-12T10:13:43Z","file_name":"IST-2012-49-v1+1_From_MTL_to_deterministic_timed_automata.pdf","content_type":"application/pdf","file_size":249789}],"title":"From MTL to deterministic timed automata","publist_id":"1090","doi":"10.1007/978-3-642-15297-9_13","intvolume":"      6246","publisher":"Springer","type":"conference","status":"public","date_updated":"2024-10-09T20:54:01Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","year":"2010","page":"152 - 167","_id":"4369","quality_controlled":"1","language":[{"iso":"eng"}],"editor":[{"full_name":"Henzinger, Thomas A.","first_name":"Thomas A.","last_name":"Henzinger"},{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"conference":{"location":"Klosterneuburg, Austria","start_date":"2010-09-08","end_date":"2010-09-10","name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"date_created":"2018-12-11T12:08:30Z","citation":{"ieee":"D. Nickovic and N. Piterman, “From MTL to deterministic timed automata,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria, 2010, vol. 6246, pp. 152–167.","mla":"Nickovic, Dejan, and Nir Piterman. <i>From MTL to Deterministic Timed Automata</i>. Edited by Thomas A. Henzinger and Krishnendu Chatterjee, vol. 6246, Springer, 2010, pp. 152–67, doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">10.1007/978-3-642-15297-9_13</a>.","apa":"Nickovic, D., &#38; Piterman, N. (2010). From MTL to deterministic timed automata. In T. A. Henzinger &#38; K. Chatterjee (Eds.) (Vol. 6246, pp. 152–167). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">https://doi.org/10.1007/978-3-642-15297-9_13</a>","chicago":"Nickovic, Dejan, and Nir Piterman. “From MTL to Deterministic Timed Automata.” edited by Thomas A. Henzinger and Krishnendu Chatterjee, 6246:152–67. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">https://doi.org/10.1007/978-3-642-15297-9_13</a>.","ama":"Nickovic D, Piterman N. From MTL to deterministic timed automata. In: Henzinger TA, Chatterjee K, eds. Vol 6246. Springer; 2010:152-167. doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">10.1007/978-3-642-15297-9_13</a>","short":"D. Nickovic, N. Piterman, in:, T.A. Henzinger, K. Chatterjee (Eds.), Springer, 2010, pp. 152–167.","ista":"Nickovic D, Piterman N. 2010. From MTL to deterministic timed automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6246, 152–167."},"volume":6246,"month":"09","oa":1,"date_published":"2010-09-08T00:00:00Z","file_date_updated":"2020-07-14T12:46:27Z"},{"citation":{"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.","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>","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>","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.","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>."},"month":"01","volume":5944,"oa":1,"date_published":"2010-01-01T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"editor":[{"full_name":"Barthe, Gilles","last_name":"Barthe","first_name":"Gilles"},{"full_name":"Hermenegildo, Manuel","last_name":"Hermenegildo","first_name":"Manuel"}],"conference":{"end_date":"2010-01-19","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","start_date":"2010-01-17","location":"Madrid, Spain"},"date_created":"2018-12-11T12:08:33Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","year":"2010","page":"26 - 44","_id":"4378","publist_id":"1081","doi":"10.1007/978-3-642-11319-2_6","intvolume":"      5944","type":"conference","publisher":"Springer","status":"public","date_updated":"2021-01-12T07:56:31Z","department":[{"_id":"ToHe"}],"main_file_link":[{"url":"https://infoscience.epfl.ch/record/161290/","open_access":"1"}],"title":"Building a calculus of data structures","author":[{"last_name":"Kuncak","first_name":"Viktor","full_name":"Kuncak, Viktor"},{"last_name":"Piskac","full_name":"Piskac, Ruzica","first_name":"Ruzica"},{"last_name":"Suter","first_name":"Philippe","full_name":"Suter, Philippe"},{"full_name":"Wies, Thomas","last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas"}],"day":"01","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."}],"oa_version":"Submitted Version","alternative_title":["LNCS"],"scopus_import":1,"publication_status":"published"},{"citation":{"short":"T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2010, pp. 1–8.","ista":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. 2010. A marketplace for cloud resources. EMSOFT: Embedded Software , 1–8.","ama":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. A marketplace for cloud resources. In: ACM; 2010:1-8. doi:<a href=\"https://doi.org/10.1145/1879021.1879022\">10.1145/1879021.1879022</a>","chicago":"Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey. “A Marketplace for Cloud Resources,” 1–8. ACM, 2010. <a href=\"https://doi.org/10.1145/1879021.1879022\">https://doi.org/10.1145/1879021.1879022</a>.","ieee":"T. A. Henzinger, A. Tomar, V. Singh, T. Wies, and D. Zufferey, “A marketplace for cloud resources,” presented at the EMSOFT: Embedded Software , Arizona, USA, 2010, pp. 1–8.","mla":"Henzinger, Thomas A., et al. <i>A Marketplace for Cloud Resources</i>. ACM, 2010, pp. 1–8, doi:<a href=\"https://doi.org/10.1145/1879021.1879022\">10.1145/1879021.1879022</a>.","apa":"Henzinger, T. A., Tomar, A., Singh, V., Wies, T., &#38; Zufferey, D. (2010). A marketplace for cloud resources (pp. 1–8). Presented at the EMSOFT: Embedded Software , Arizona, USA: ACM. <a href=\"https://doi.org/10.1145/1879021.1879022\">https://doi.org/10.1145/1879021.1879022</a>"},"oa":1,"month":"10","date_published":"2010-10-24T00:00:00Z","file_date_updated":"2020-07-14T12:46:28Z","quality_controlled":"1","language":[{"iso":"eng"}],"conference":{"location":"Arizona, USA","start_date":"2010-10-24","name":"EMSOFT: Embedded Software ","end_date":"2010-10-29"},"date_created":"2018-12-11T12:08:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2010","_id":"4380","page":"1 - 8","publist_id":"1078","doi":"10.1145/1879021.1879022","date_updated":"2024-10-09T20:54:01Z","status":"public","type":"conference","publisher":"ACM","department":[{"_id":"ToHe"}],"file":[{"file_name":"IST-2012-48-v1+1_A_marketplace_for_cloud_resources.pdf","relation":"main_file","date_updated":"2020-07-14T12:46:28Z","access_level":"open_access","date_created":"2018-12-12T10:09:42Z","creator":"system","checksum":"7680dd24016810710f7c977bc94f85e9","file_id":"4767","file_size":222626,"content_type":"application/pdf"}],"title":"A marketplace for cloud resources","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Tomar","full_name":"Tomar, Anmol","first_name":"Anmol","id":"3D8D36B6-F248-11E8-B48F-1D18A9856A87"},{"id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","last_name":"Singh","first_name":"Vasu","full_name":"Singh, Vasu"},{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas","last_name":"Wies","first_name":"Thomas"},{"orcid":"0000-0002-3197-8736","last_name":"Zufferey","full_name":"Zufferey, Damien","first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87"}],"day":"24","ddc":["005"],"abstract":[{"text":"Cloud computing is an emerging paradigm aimed to offer users pay-per-use computing resources, while leaving the burden of managing the computing infrastructure to the cloud provider. We present a new programming and pricing model that gives the cloud user the flexibility of trading execution speed and price on a per-job basis. We discuss the scheduling and resource management challenges for the cloud provider that arise in the implementation of this model. We argue that techniques from real-time and embedded software can be useful in this context.","lang":"eng"}],"oa_version":"Submitted Version","has_accepted_license":"1","pubrep_id":"48","scopus_import":1,"publication_status":"published","corr_author":"1"},{"title":"FlexPRICE: Flexible provisioning of resources in a cloud environment","department":[{"_id":"ToHe"}],"file":[{"file_name":"IST-2012-47-v1+1_FlexPRICE-_Flexible_provisioning_of_resources_in_a_cloud_environment.pdf","date_created":"2018-12-12T10:16:03Z","relation":"main_file","date_updated":"2020-07-14T12:46:28Z","access_level":"open_access","checksum":"98e534675339a8e2beca08890d048145","file_id":"5188","creator":"system","file_size":467436,"content_type":"application/pdf"}],"author":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"id":"3D8D36B6-F248-11E8-B48F-1D18A9856A87","full_name":"Tomar, Anmol","first_name":"Anmol","last_name":"Tomar"},{"id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","last_name":"Singh","first_name":"Vasu","full_name":"Singh, Vasu"},{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","last_name":"Wies","first_name":"Thomas","full_name":"Wies, Thomas"},{"first_name":"Damien","last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736"}],"oa_version":"Submitted Version","ddc":["004"],"day":"26","abstract":[{"lang":"eng","text":"Cloud computing aims to give users virtually unlimited pay-per-use computing resources without the burden of managing the underlying infrastructure. We claim that, in order to realize the full potential of cloud computing, the user must be presented with a pricing model that offers flexibility at the requirements level, such as a choice between different degrees of execution speed and the cloud provider must be presented with a programming model that offers flexibility at the execution level, such as a choice between different scheduling policies. In such a flexible framework, with each job, the user purchases a virtual computer with the desired speed and cost characteristics, and the cloud provider can optimize the utilization of resources across a stream of jobs from different users. We designed a flexible framework to test our hypothesis, which is called FlexPRICE (Flexible Provisioning of Resources in a Cloud Environment) and works as follows. A user presents a job to the cloud. The cloud finds different schedules to execute the job and presents a set of quotes to the user in terms of price and duration for the execution. The user then chooses a particular quote and the cloud is obliged to execute the job according to the chosen quote. FlexPRICE thus hides the complexity of the actual scheduling decisions from the user, but still provides enough flexibility to meet the users actual demands. We implemented FlexPRICE in a simulator called PRICES that allows us to experiment with our framework. We observe that FlexPRICE provides a wide range of execution options-from fast and expensive to slow and cheap-- for the whole spectrum of data-intensive and computation-intensive jobs. We also observe that the set of quotes computed by FlexPRICE do not vary as the number of simultaneous jobs increases."}],"scopus_import":1,"corr_author":"1","publication_status":"published","has_accepted_license":"1","pubrep_id":"47","date_published":"2010-08-26T00:00:00Z","file_date_updated":"2020-07-14T12:46:28Z","citation":{"short":"T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, IEEE, 2010, pp. 83–90.","ista":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. 2010. FlexPRICE: Flexible provisioning of resources in a cloud environment. CLOUD: Cloud Computing, 83–90.","ama":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. FlexPRICE: Flexible provisioning of resources in a cloud environment. In: IEEE; 2010:83-90. doi:<a href=\"https://doi.org/10.1109/CLOUD.2010.71\">10.1109/CLOUD.2010.71</a>","chicago":"Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey. “FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment,” 83–90. IEEE, 2010. <a href=\"https://doi.org/10.1109/CLOUD.2010.71\">https://doi.org/10.1109/CLOUD.2010.71</a>.","ieee":"T. A. Henzinger, A. Tomar, V. Singh, T. Wies, and D. Zufferey, “FlexPRICE: Flexible provisioning of resources in a cloud environment,” presented at the CLOUD: Cloud Computing, Miami, USA, 2010, pp. 83–90.","mla":"Henzinger, Thomas A., et al. <i>FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment</i>. IEEE, 2010, pp. 83–90, doi:<a href=\"https://doi.org/10.1109/CLOUD.2010.71\">10.1109/CLOUD.2010.71</a>.","apa":"Henzinger, T. A., Tomar, A., Singh, V., Wies, T., &#38; Zufferey, D. (2010). FlexPRICE: Flexible provisioning of resources in a cloud environment (pp. 83–90). Presented at the CLOUD: Cloud Computing, Miami, USA: IEEE. <a href=\"https://doi.org/10.1109/CLOUD.2010.71\">https://doi.org/10.1109/CLOUD.2010.71</a>"},"oa":1,"article_processing_charge":"No","month":"08","conference":{"start_date":"2010-07-05","location":"Miami, USA","name":"CLOUD: Cloud Computing","end_date":"2010-07-10"},"date_created":"2018-12-11T12:08:33Z","quality_controlled":"1","language":[{"iso":"eng"}],"year":"2010","_id":"4381","page":"83 - 90","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-09T20:54:00Z","status":"public","type":"conference","publisher":"IEEE","publist_id":"1077","doi":"10.1109/CLOUD.2010.71"},{"title":"Transactions in the jungle","department":[{"_id":"ToHe"}],"file":[{"file_size":246409,"content_type":"application/pdf","file_name":"IST-2012-46-v1+1_Transactions_in_the_jungle.pdf","date_created":"2018-12-12T10:14:28Z","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:28Z","checksum":"f2ad6c00a6304da34bf21bcdcfd36c4b","file_id":"5080","creator":"system"}],"author":[{"full_name":"Guerraoui, Rachid","last_name":"Guerraoui","first_name":"Rachid"},{"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":"Kapalka","full_name":"Kapalka, Michal","first_name":"Michal"},{"id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu","last_name":"Singh","full_name":"Singh, Vasu"}],"oa_version":"Submitted Version","day":"13","abstract":[{"lang":"eng","text":"Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of TM executions have been proposed. Many of these definitions assumed that accesses to shared data are solely performed through transactions. In practice, due to legacy code and concurrency libraries, transactions in a TM have to share data with non-transactional operations. The semantics of such interaction, while widely discussed by practitioners, lacks a clear formal specification. Those interactions can vary, sometimes in subtle ways, between TM implementations and underlying memory models. We propose a correctness condition for TMs, parametrized opacity, to formally capture the now folklore notion of strong atomicity by stipulating the two following intuitive requirements: first, every transaction appears as if it is executed instantaneously with respect to other transactions and non-transactional operations, and second, non-transactional operations conform to the given underlying memory model. We investigate the inherent cost of implementing parametrized opacity. We first prove that parametrized opacity requires either instrumenting non-transactional operations (for most memory models) or writing to memory by transactions using potentially expensive read-modify-write instructions (such as compare-and-swap). Then, we show that for a class of practical relaxed memory models, parametrized opacity can indeed be implemented with constant-time instrumentation of non-transactional writes and no instrumentation of non-transactional reads. We show that, in practice, parametrizing the notion of correctness allows developing more efficient TM implementations."}],"ddc":["005"],"scopus_import":"1","publication_status":"published","has_accepted_license":"1","pubrep_id":"46","date_published":"2010-06-13T00:00:00Z","file_date_updated":"2020-07-14T12:46:28Z","citation":{"ista":"Guerraoui R, Henzinger TA, Kapalka M, Singh V. 2010. Transactions in the jungle. SPAA: ACM Symposium on Parallel Algorithms and Architectures, 263–272.","short":"R. Guerraoui, T.A. Henzinger, M. Kapalka, V. Singh, in:, ACM, 2010, pp. 263–272.","ama":"Guerraoui R, Henzinger TA, Kapalka M, Singh V. Transactions in the jungle. In: ACM; 2010:263-272. doi:<a href=\"https://doi.org/10.1145/1810479.1810529\">10.1145/1810479.1810529</a>","chicago":"Guerraoui, Rachid, Thomas A Henzinger, Michal Kapalka, and Vasu Singh. “Transactions in the Jungle,” 263–72. ACM, 2010. <a href=\"https://doi.org/10.1145/1810479.1810529\">https://doi.org/10.1145/1810479.1810529</a>.","apa":"Guerraoui, R., Henzinger, T. A., Kapalka, M., &#38; Singh, V. (2010). Transactions in the jungle (pp. 263–272). Presented at the SPAA: ACM Symposium on Parallel Algorithms and Architectures, Santorini, Greece: ACM. <a href=\"https://doi.org/10.1145/1810479.1810529\">https://doi.org/10.1145/1810479.1810529</a>","mla":"Guerraoui, Rachid, et al. <i>Transactions in the Jungle</i>. ACM, 2010, pp. 263–72, doi:<a href=\"https://doi.org/10.1145/1810479.1810529\">10.1145/1810479.1810529</a>.","ieee":"R. Guerraoui, T. A. Henzinger, M. Kapalka, and V. Singh, “Transactions in the jungle,” presented at the SPAA: ACM Symposium on Parallel Algorithms and Architectures, Santorini, Greece, 2010, pp. 263–272."},"oa":1,"month":"06","conference":{"location":"Santorini, Greece","start_date":"2010-06-13","name":"SPAA: ACM Symposium on Parallel Algorithms and Architectures","end_date":"2010-06-15"},"date_created":"2018-12-11T12:08:34Z","quality_controlled":"1","language":[{"iso":"eng"}],"year":"2010","_id":"4382","page":"263 - 272","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-21T06:03:05Z","publisher":"ACM","type":"conference","status":"public","publist_id":"1076","doi":"10.1145/1810479.1810529"},{"ec_funded":1,"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."}],"ddc":["004"],"day":"01","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"},{"name":"Design for Embedded Systems","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373"}],"publication_status":"published","corr_author":"1","scopus_import":1,"alternative_title":["LNCS"],"has_accepted_license":"1","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5393"}]},"pubrep_id":"43","title":"GIST: A solver for probabilistic games","file":[{"file_name":"IST-2012-43-v1+1_GIST-_A_solver_for_probabilistic_games.pdf","file_id":"5221","creator":"system","checksum":"0b2ef8c4037ffccc6902d93081af24f7","date_created":"2018-12-12T10:16:33Z","access_level":"open_access","date_updated":"2020-07-14T12:46:28Z","relation":"main_file","content_type":"application/pdf","file_size":293605}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"external_id":{"arxiv":["1004.2367"]},"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Barbara","full_name":"Jobstmann, Barbara","last_name":"Jobstmann"},{"full_name":"Radhakrishna, Arjun","first_name":"Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"_id":"4388","page":"665 - 669","year":"2010","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-09T20:54:00Z","type":"conference","publisher":"Springer","status":"public","intvolume":"      6174","doi":"10.1007/978-3-642-14295-6_57","publist_id":"1068","file_date_updated":"2020-07-14T12:46:28Z","date_published":"2010-07-01T00:00:00Z","oa":1,"article_processing_charge":"No","month":"07","volume":6174,"citation":{"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>.","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.","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>","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, in:, Springer, 2010, pp. 665–669.","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."},"arxiv":1,"date_created":"2018-12-11T12:08:36Z","conference":{"start_date":"2010-07-15","location":"Edinburgh, UK","end_date":"2010-07-17","name":"CAV: Computer Aided Verification"},"language":[{"iso":"eng"}],"quality_controlled":"1"},{"citation":{"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.","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>","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.","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>.","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>","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>."},"month":"08","oa":1,"date_published":"2010-08-23T00:00:00Z","file_date_updated":"2020-07-14T12:46:28Z","quality_controlled":"1","language":[{"iso":"eng"}],"conference":{"name":"ACSD: Application of Concurrency to System Design"},"date_created":"2018-12-11T12:08:36Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","year":"2010","page":"77 - 84","_id":"4389","publist_id":"1069","doi":"10.1109/ACSD.2010.26","status":"public","type":"conference","publisher":"IEEE","date_updated":"2021-01-12T07:56:36Z","department":[{"_id":"ToHe"}],"file":[{"date_created":"2018-12-12T10:09:10Z","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:28Z","checksum":"42b2952bfc6b6974617bd554842b904a","creator":"system","file_id":"4733","file_name":"IST-2012-44-v1+1_Robustness_of_sequential_circuits.pdf","file_size":159920,"content_type":"application/pdf"}],"title":"Robustness of sequential circuits","author":[{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"last_name":"Legay","full_name":"Legay, Axel","first_name":"Axel"},{"full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","first_name":"Dejan"}],"ddc":["004"],"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"}],"day":"23","oa_version":"Submitted Version","pubrep_id":"44","has_accepted_license":"1","scopus_import":1,"publication_status":"published"},{"title":"Model checking of linearizability of concurrent list implementations","department":[{"_id":"ToHe"}],"file":[{"file_name":"2010_CAV_Cerny.pdf","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:28Z","date_created":"2020-05-19T16:31:56Z","file_id":"7873","creator":"dernst","checksum":"2eb211ce40b3c4988bce3a3592980704","file_size":3633276,"content_type":"application/pdf"}],"author":[{"last_name":"Cerny","full_name":"Cerny, Pavol","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"},{"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","first_name":"Swarat","last_name":"Chaudhuri"},{"last_name":"Alur","first_name":"Rajeev","full_name":"Alur, Rajeev"}],"oa_version":"Submitted Version","ddc":["000"],"abstract":[{"text":"Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations does not stem from the number of variables or the program size, but rather from the large number of possible interleavings. These implementations are therefore prime candidates for model checking. We introduce an algorithm for verifying linearizability of singly-linked heap-based concurrent data structures. We consider a model consisting of an unbounded heap where each 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.","lang":"eng"}],"day":"01","scopus_import":"1","corr_author":"1","publication_status":"published","pubrep_id":"27","related_material":{"record":[{"id":"5391","relation":"earlier_version","status":"public"}]},"has_accepted_license":"1","alternative_title":["LNCS"],"date_published":"2010-07-01T00:00:00Z","file_date_updated":"2020-07-14T12:46:28Z","citation":{"short":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, in:, Springer, 2010, pp. 465–479.","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.","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.","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>.","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>"},"volume":6174,"article_processing_charge":"No","month":"07","oa":1,"conference":{"location":"Edinburgh, UK","start_date":"2010-07-15","name":"CAV: Computer Aided Verification","end_date":"2010-07-17"},"date_created":"2018-12-11T12:08:36Z","quality_controlled":"1","language":[{"iso":"eng"}],"year":"2010","page":"465 - 479","_id":"4390","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"      6174","publisher":"Springer","status":"public","type":"conference","date_updated":"2024-10-21T06:03:05Z","publist_id":"1066","doi":"10.1007/978-3-642-14295-6_41"},{"language":[{"iso":"eng"}],"editor":[{"last_name":"Manna","full_name":"Manna, Zohar","first_name":"Zohar"},{"last_name":"Peled","first_name":"Doron","full_name":"Peled, Doron"}],"quality_controlled":"1","date_created":"2018-12-11T12:08:37Z","month":"07","volume":6200,"citation":{"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>.","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.","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>","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>.","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.","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."},"date_published":"2010-07-29T00:00:00Z","doi":"10.1007/978-3-642-13754-9_3","publist_id":"1064","type":"book_chapter","publisher":"Springer","status":"public","date_updated":"2024-10-09T20:53:58Z","intvolume":"      6200","series_title":"Essays in Memory of Amir Pnueli","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","page":"42 - 60","_id":"4392","year":"2010","author":[{"last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","first_name":"Pavol"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","first_name":"Arjun","full_name":"Radhakrishna, Arjun"}],"department":[{"_id":"ToHe"}],"title":"Quantitative Simulation Games","alternative_title":["LNCS"],"corr_author":"1","publication_status":"published","scopus_import":1,"publication":"Time For Verification: Essays in Memory of Amir Pnueli","project":[{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques"},{"name":"Design for Embedded Systems","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373"}],"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"}],"day":"29","ec_funded":1,"oa_version":"None"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","page":"235 - 268","_id":"4393","year":"2010","doi":"10.1007/978-3-642-15375-4_18","acknowledgement":"This work was partially supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","publist_id":"1065","status":"public","type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2025-09-30T07:46:05Z","intvolume":"      6269","volume":6269,"month":"11","oa":1,"citation":{"short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–268.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances. CONCUR: Concurrency Theory, LNCS, vol. 6269, 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>.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 235–268.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2010). Simulation distances (Vol. 6269, pp. 235–268). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">https://doi.org/10.1007/978-3-642-15375-4_18</a>","ama":"Cerny P, Henzinger TA, Radhakrishna A. Simulation distances. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:235-268. doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">10.1007/978-3-642-15375-4_18</a>","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>."},"file_date_updated":"2020-07-14T12:46:28Z","date_published":"2010-11-01T00:00:00Z","language":[{"iso":"eng"}],"quality_controlled":"1","date_created":"2018-12-11T12:08:37Z","conference":{"name":"CONCUR: Concurrency Theory","end_date":"2010-09-03","location":"Paris, France","start_date":"2010-08-31"},"project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"},{"grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"day":"01","abstract":[{"lang":"eng","text":"Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the 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."}],"ddc":["005"],"ec_funded":1,"oa_version":"Submitted Version","alternative_title":["LNCS"],"pubrep_id":"42","has_accepted_license":"1","related_material":{"record":[{"id":"5389","relation":"earlier_version","status":"public"},{"relation":"later_version","status":"public","id":"3249"}]},"corr_author":"1","publication_status":"published","scopus_import":1,"file":[{"content_type":"application/pdf","file_size":198913,"file_name":"IST-2012-42-v1+1_Simulation_distances.pdf","checksum":"ea567903676ba8afe0507ee11313dce5","creator":"system","file_id":"5130","date_updated":"2020-07-14T12:46:28Z","relation":"main_file","access_level":"open_access","date_created":"2018-12-12T10:15:12Z"}],"department":[{"_id":"ToHe"}],"title":"Simulation distances","author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","first_name":"Arjun"}]},{"alternative_title":["LNCS"],"has_accepted_license":"1","pubrep_id":"41","publication_status":"published","scopus_import":1,"day":"21","abstract":[{"lang":"eng","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."}],"ddc":["004"],"project":[{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version","author":[{"full_name":"Beyer, Dirk","first_name":"Dirk","last_name":"Beyer"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"last_name":"Théoduloz","first_name":"Grégory","full_name":"Théoduloz, Grégory"},{"orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien","first_name":"Damien","last_name":"Zufferey"}],"file":[{"content_type":"application/pdf","file_size":312147,"file_name":"IST-2012-41-v1+1_Shape_refinement_through_explicit_heap_analysis.pdf","creator":"system","file_id":"5332","checksum":"7d26e59a9681487d7283eba337292b2c","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:46:29Z","date_created":"2018-12-12T10:18:13Z"}],"department":[{"_id":"ToHe"}],"title":"Shape refinement through explicit heap analysis","doi":"10.1007/978-3-642-12029-9_19","publist_id":"1061","date_updated":"2021-01-12T07:56:40Z","status":"public","publisher":"Springer","type":"conference","intvolume":"      6013","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"4396","page":"263 - 277","year":"2010","editor":[{"full_name":"Rosenblum, David","last_name":"Rosenblum","first_name":"David"},{"first_name":"Gabriele","full_name":"Taenzer, Gabriele","last_name":"Taenzer"}],"language":[{"iso":"eng"}],"quality_controlled":"1","date_created":"2018-12-11T12:08:38Z","conference":{"end_date":"2010-03-28","name":"FASE: Fundamental Approaches To Software Engineering","start_date":"2010-03-20","location":"Paphos, Cyprus"},"oa":1,"month":"04","volume":6013,"citation":{"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.","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>","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>.","apa":"Beyer, D., Henzinger, T. A., Théoduloz, G., &#38; Zufferey, D. (2010). Shape refinement through explicit heap analysis. In D. Rosenblum &#38; G. Taenzer (Eds.) (Vol. 6013, pp. 263–277). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">https://doi.org/10.1007/978-3-642-12029-9_19</a>","ieee":"D. Beyer, T. A. Henzinger, G. Théoduloz, and D. Zufferey, “Shape refinement through explicit heap analysis,” presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus, 2010, vol. 6013, pp. 263–277.","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>."},"file_date_updated":"2020-07-14T12:46:29Z","date_published":"2010-04-21T00:00:00Z"}]