[{"volume":412,"abstract":[{"lang":"eng","text":"Molecular noise, which arises from the randomness of the discrete events in the cell, significantly influences fundamental biological processes. Discrete-state continuous-time stochastic models (CTMC) can be used to describe such effects, but the calculation of the probabilities of certain events is computationally expensive. We present a comparison of two analysis approaches for CTMC. On one hand, we estimate the probabilities of interest using repeated Gillespie simulation and determine the statistical accuracy that we obtain. On the other hand, we apply a numerical reachability analysis that approximates the probability distributions of the system at several time instances. We use examples of cellular processes to demonstrate the superiority of the reachability analysis if accurate results are required."}],"month":"05","issue":"21","language":[{"iso":"eng"}],"oa":1,"isi":1,"intvolume":"       412","date_published":"2011-05-06T00:00:00Z","file_date_updated":"2020-07-14T12:46:10Z","publist_id":"3249","year":"2011","date_created":"2018-12-11T12:02:55Z","author":[{"full_name":"Didier, Frédéric","first_name":"Frédéric","last_name":"Didier"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Mateescu","first_name":"Maria","full_name":"Mateescu, Maria"},{"last_name":"Wolf","first_name":"Verena","full_name":"Wolf, Verena"}],"external_id":{"isi":["000290078000005"]},"publication_status":"published","pubrep_id":"79","date_updated":"2025-09-30T09:03:30Z","day":"06","has_accepted_license":"1","publication":"Theoretical Computer Science","citation":{"short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, Theoretical Computer Science 412 (2011) 2128–2141.","chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Approximation of Event Probabilities in Noisy Cellular Processes.” <i>Theoretical Computer Science</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.tcs.2010.10.022\">https://doi.org/10.1016/j.tcs.2010.10.022</a>.","ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2011. Approximation of event probabilities in noisy cellular processes. Theoretical Computer Science. 412(21), 2128–2141.","ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. Approximation of event probabilities in noisy cellular processes. <i>Theoretical Computer Science</i>. 2011;412(21):2128-2141. doi:<a href=\"https://doi.org/10.1016/j.tcs.2010.10.022\">10.1016/j.tcs.2010.10.022</a>","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Approximation of event probabilities in noisy cellular processes,” <i>Theoretical Computer Science</i>, vol. 412, no. 21. Elsevier, pp. 2128–2141, 2011.","apa":"Didier, F., Henzinger, T. A., Mateescu, M., &#38; Wolf, V. (2011). Approximation of event probabilities in noisy cellular processes. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2010.10.022\">https://doi.org/10.1016/j.tcs.2010.10.022</a>","mla":"Didier, Frédéric, et al. “Approximation of Event Probabilities in Noisy Cellular Processes.” <i>Theoretical Computer Science</i>, vol. 412, no. 21, Elsevier, 2011, pp. 2128–41, doi:<a href=\"https://doi.org/10.1016/j.tcs.2010.10.022\">10.1016/j.tcs.2010.10.022</a>."},"file":[{"creator":"system","file_size":230503,"content_type":"application/pdf","relation":"main_file","date_created":"2018-12-12T10:11:09Z","access_level":"open_access","file_name":"IST-2012-79-v1+1_Approximation_of_event_probabilities_in_noisy_cellular_processes.pdf","date_updated":"2020-07-14T12:46:10Z","checksum":"e5503e25ce020d753e06b3431e16841e","file_id":"4862"}],"publisher":"Elsevier","department":[{"_id":"ToHe"}],"title":"Approximation of event probabilities in noisy cellular processes","_id":"3364","ddc":["000","004"],"type":"journal_article","article_processing_charge":"No","doi":"10.1016/j.tcs.2010.10.022","quality_controlled":"1","status":"public","scopus_import":"1","oa_version":"Submitted Version","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"2128 - 2141","related_material":{"record":[{"id":"4535","relation":"earlier_version","status":"public"}]}},{"oa":1,"language":[{"iso":"eng"}],"intvolume":"      6605","file_date_updated":"2020-07-14T12:46:10Z","date_published":"2011-09-29T00:00:00Z","publist_id":"3248","year":"2011","date_created":"2018-12-11T12:02:55Z","volume":6605,"abstract":[{"text":"We present the tool Quasy, a quantitative synthesis tool. Quasy takes qualitative and quantitative specifications and automatically constructs a system that satisfies the qualitative specification and optimizes the quantitative specification, if such a system exists. The user can choose between a system that satisfies and optimizes the specifications (a) under all possible environment behaviors or (b) under the most-likely environment behaviors given as a probability distribution on the possible input sequences. Quasy solves these two quantitative synthesis problems by reduction to instances of 2-player games and Markov Decision Processes (MDPs) with quantitative winning objectives. Quasy can also be seen as a game solver for quantitative games. Most notable, it can solve lexicographic mean-payoff games with 2 players, MDPs with mean-payoff objectives, and ergodic MDPs with mean-payoff parity objectives.","lang":"eng"}],"month":"09","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Jobstmann, Barbara","first_name":"Barbara","last_name":"Jobstmann"},{"full_name":"Singh, Rohit","last_name":"Singh","first_name":"Rohit"}],"publication_status":"published","pubrep_id":"77","has_accepted_license":"1","citation":{"short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2011, pp. 267–271.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2011. QUASY: quantitative synthesis tool. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 6605, 267–271.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “QUASY: Quantitative Synthesis Tool,” 6605:267–71. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-19835-9_24\">https://doi.org/10.1007/978-3-642-19835-9_24</a>.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. QUASY: quantitative synthesis tool. In: Vol 6605. Springer; 2011:267-271. doi:<a href=\"https://doi.org/10.1007/978-3-642-19835-9_24\">10.1007/978-3-642-19835-9_24</a>","mla":"Chatterjee, Krishnendu, et al. <i>QUASY: Quantitative Synthesis Tool</i>. Vol. 6605, Springer, 2011, pp. 267–71, doi:<a href=\"https://doi.org/10.1007/978-3-642-19835-9_24\">10.1007/978-3-642-19835-9_24</a>.","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-642-19835-9_24\">https://doi.org/10.1007/978-3-642-19835-9_24</a>","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271."},"file":[{"date_created":"2018-12-12T10:13:37Z","relation":"main_file","access_level":"open_access","creator":"system","file_size":475661,"content_type":"application/pdf","checksum":"762e52eb296f6dbfbf2a75d98b8ebaee","file_id":"5022","file_name":"IST-2012-77-v1+1_QUASY-_quantitative_synthesis_tool.pdf","date_updated":"2020-07-14T12:46:10Z"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Springer","_id":"3365","title":"QUASY: quantitative synthesis tool","date_updated":"2021-01-12T07:42:58Z","day":"29","alternative_title":["LNCS"],"doi":"10.1007/978-3-642-19835-9_24","quality_controlled":"1","status":"public","scopus_import":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","page":"267 - 271","conference":{"end_date":"2011-04-03","location":"Saarbrucken, Germany","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2011-03-26"},"ddc":["000","005"],"type":"conference"},{"day":"21","alternative_title":["LNCS"],"date_updated":"2024-10-21T06:03:04Z","_id":"3366","title":"Quantitative synthesis for concurrent programs","file":[{"creator":"system","content_type":"application/pdf","file_size":508946,"date_created":"2018-12-12T10:15:51Z","relation":"main_file","access_level":"open_access","file_name":"IST-2012-76-v1+1_Quantitative_synthesis_for_concurrent_programs.pdf","date_updated":"2020-07-14T12:46:10Z","file_id":"5174","checksum":"c033689355f45742dc7c99b5af13ce7a"}],"publisher":"Springer","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"has_accepted_license":"1","citation":{"chicago":"Cerny, Pavol, Krishnendu Chatterjee, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. “Quantitative Synthesis for Concurrent Programs.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:243–59. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22110-1_20\">https://doi.org/10.1007/978-3-642-22110-1_20</a>.","ista":"Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. 2011. Quantitative synthesis for concurrent programs. CAV: Computer Aided Verification, LNCS, vol. 6806, 243–259.","short":"P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.","ieee":"P. Cerny, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh, “Quantitative synthesis for concurrent programs,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 243–259.","apa":"Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., &#38; Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan &#38; S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-22110-1_20\">https://doi.org/10.1007/978-3-642-22110-1_20</a>","mla":"Cerny, Pavol, et al. <i>Quantitative Synthesis for Concurrent Programs</i>. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 243–59, doi:<a href=\"https://doi.org/10.1007/978-3-642-22110-1_20\">10.1007/978-3-642-22110-1_20</a>.","ama":"Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. Quantitative synthesis for concurrent programs. In: Gopalakrishnan G, Qadeer S, eds. Vol 6806. Springer; 2011:243-259. doi:<a href=\"https://doi.org/10.1007/978-3-642-22110-1_20\">10.1007/978-3-642-22110-1_20</a>"},"article_processing_charge":"No","type":"conference","ddc":["000","004"],"conference":{"location":"Snowbird, USA","name":"CAV: Computer Aided Verification","start_date":"2011-07-14","end_date":"2011-07-20"},"scopus_import":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","page":"243 - 259","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5388"}]},"status":"public","ec_funded":1,"doi":"10.1007/978-3-642-22110-1_20","quality_controlled":"1","month":"04","abstract":[{"text":"We present an algorithmic method for the quantitative, performance-aware synthesis of concurrent programs. The input consists of a nondeterministic partial program and of a parametric performance model. The nondeterminism allows the programmer to omit which (if any) synchronization construct is used at a particular program location. The performance model, specified as a weighted automaton, can capture system architectures by assigning different costs to actions such as locking, context switching, and memory and cache accesses. The quantitative synthesis problem is to automatically resolve the nondeterminism of the partial program so that both correctness is guaranteed and performance is optimal. As is standard for shared memory concurrency, correctness is formalized &quot;specification free&quot;, in particular as race freedom or deadlock freedom. For worst-case (average-case) performance, we show that the problem can be reduced to 2-player graph games (with probabilistic transitions) with quantitative objectives. While we show, using game-theoretic methods, that the synthesis problem is Nexp-complete, we present an algorithmic method and an implementation that works efficiently for concurrent programs and performance models of practical interest. We have implemented a prototype tool and used it to synthesize finite-state concurrent programs that exhibit different programming patterns, for several performance models representing different architectures. ","lang":"eng"}],"volume":6806,"editor":[{"first_name":"Ganesh","last_name":"Gopalakrishnan","full_name":"Gopalakrishnan, Ganesh"},{"full_name":"Qadeer, Shaz","last_name":"Qadeer","first_name":"Shaz"}],"date_created":"2018-12-11T12:02:55Z","date_published":"2011-04-21T00:00:00Z","file_date_updated":"2020-07-14T12:46:10Z","year":"2011","publist_id":"3247","intvolume":"      6806","oa":1,"language":[{"iso":"eng"}],"publication_status":"published","pubrep_id":"76","corr_author":"1","author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol"},{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Singh, Rohit","last_name":"Singh","first_name":"Rohit"}],"project":[{"call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","call_identifier":"FP7","name":"Design for Embedded Systems"}]},{"date_published":"2011-06-01T00:00:00Z","file_date_updated":"2020-07-14T12:46:11Z","publist_id":"3226","year":"2011","date_created":"2018-12-11T12:03:00Z","oa":1,"issue":"4","isi":1,"language":[{"iso":"eng"}],"intvolume":"        22","abstract":[{"lang":"eng","text":"In this survey, we compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. All these languages — matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded command models — describe continuous-time Markov chains, but they differ according to important properties, such as compositionality, expressiveness and succinctness, executability, and ease of use. Moreover, they provide different support for checking the well-formedness of a model and for analyzing a model."}],"month":"06","volume":22,"external_id":{"isi":["000291552600005"]},"publication_status":"published","pubrep_id":"628","author":[{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"},{"full_name":"Wolf, Verena","first_name":"Verena","last_name":"Wolf"}],"_id":"3381","title":"Formalisms for specifying Markovian population models","has_accepted_license":"1","publication":"IJFCS: International Journal of Foundations of Computer Science","citation":{"short":"T.A. Henzinger, B. Jobstmann, V. Wolf, IJFCS: International Journal of Foundations of Computer Science 22 (2011) 823–841.","ista":"Henzinger TA, Jobstmann B, Wolf V. 2011. Formalisms for specifying Markovian population models. IJFCS: International Journal of Foundations of Computer Science. 22(4), 823–841.","chicago":"Henzinger, Thomas A, Barbara Jobstmann, and Verena Wolf. “Formalisms for Specifying Markovian Population Models.” <i>IJFCS: International Journal of Foundations of Computer Science</i>. World Scientific Publishing, 2011. <a href=\"https://doi.org/10.1142/S0129054111008441\">https://doi.org/10.1142/S0129054111008441</a>.","ama":"Henzinger TA, Jobstmann B, Wolf V. Formalisms for specifying Markovian population models. <i>IJFCS: International Journal of Foundations of Computer Science</i>. 2011;22(4):823-841. doi:<a href=\"https://doi.org/10.1142/S0129054111008441\">10.1142/S0129054111008441</a>","apa":"Henzinger, T. A., Jobstmann, B., &#38; Wolf, V. (2011). Formalisms for specifying Markovian population models. <i>IJFCS: International Journal of Foundations of Computer Science</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0129054111008441\">https://doi.org/10.1142/S0129054111008441</a>","mla":"Henzinger, Thomas A., et al. “Formalisms for Specifying Markovian Population Models.” <i>IJFCS: International Journal of Foundations of Computer Science</i>, vol. 22, no. 4, World Scientific Publishing, 2011, pp. 823–41, doi:<a href=\"https://doi.org/10.1142/S0129054111008441\">10.1142/S0129054111008441</a>.","ieee":"T. A. Henzinger, B. Jobstmann, and V. Wolf, “Formalisms for specifying Markovian population models,” <i>IJFCS: International Journal of Foundations of Computer Science</i>, vol. 22, no. 4. World Scientific Publishing, pp. 823–841, 2011."},"file":[{"access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:08:45Z","content_type":"application/pdf","file_size":222840,"creator":"system","checksum":"df88431872586c773fbcfea37d7b36a2","file_id":"4707","date_updated":"2020-07-14T12:46:11Z","file_name":"IST-2016-628-v1+1_journals-ijfcs-HenzingerJW11.pdf"}],"publisher":"World Scientific Publishing","department":[{"_id":"ToHe"}],"day":"01","date_updated":"2025-09-30T08:49:01Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Submitted Version","scopus_import":"1","related_material":{"record":[{"id":"3841","relation":"earlier_version","status":"public"}]},"page":"823 - 841","doi":"10.1142/S0129054111008441","quality_controlled":"1","status":"public","type":"journal_article","article_processing_charge":"No","ddc":["000"]},{"volume":6355,"series_title":"LNCS","abstract":[{"lang":"eng","text":"We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis of programs with symbolic summation techniques to derive loop invariant relations between program variables. Iteration bounds are obtained from the inferred invariants, by replacing variables with bounds on their greatest values. We have successfully applied ABC to a large number of examples. The derived symbolic bounds express non-trivial polynomial relations over loop variables. We also report on results to automatically infer symbolic expressions over harmonic numbers as upper bounds on loop iteration counts."}],"month":"05","oa":1,"acknowledgement":"This work was supported in part by the Swiss NSF. The fourth author is supported by an FWF Hertha Firnberg Research grant (T425-N23).","isi":1,"language":[{"iso":"eng"}],"intvolume":"      6355","year":"2010","date_published":"2010-05-01T00:00:00Z","date_created":"2022-03-21T08:14:35Z","editor":[{"full_name":"Clarke, Edmund M","last_name":"Clarke","first_name":"Edmund M"},{"full_name":"Voronkov, Andrei","last_name":"Voronkov","first_name":"Andrei"}],"author":[{"full_name":"Blanc, Régis","last_name":"Blanc","first_name":"Régis"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Thibaud","last_name":"Hottelier","full_name":"Hottelier, Thibaud"},{"last_name":"Kovács","first_name":"Laura","full_name":"Kovács, Laura"}],"corr_author":"1","external_id":{"isi":["000309668000007"]},"publication_status":"published","date_updated":"2025-09-30T09:51:13Z","day":"01","citation":{"chicago":"Blanc, Régis, Thomas A Henzinger, Thibaud Hottelier, and Laura Kovács. “ABC: Algebraic Bound Computation for Loops.” In <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, edited by Edmund M Clarke and Andrei Voronkov, 6355:103–18. LNCS. Berlin, Heidelberg: Springer Nature, 2010. <a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">https://doi.org/10.1007/978-3-642-17511-4_7</a>.","ista":"Blanc R, Henzinger TA, Hottelier T, Kovács L. 2010. ABC: Algebraic Bound Computation for loops. Logic for Programming, Artificial Intelligence, and Reasoning. LPAR: Logic for Programming, Artificial Intelligence and ReasoningLNCS vol. 6355, 103–118.","short":"R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer Nature, Berlin, Heidelberg, 2010, pp. 103–118.","ieee":"R. Blanc, T. A. Henzinger, T. Hottelier, and L. Kovács, “ABC: Algebraic Bound Computation for loops,” in <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, Dakar, Senegal, 2010, vol. 6355, pp. 103–118.","mla":"Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.” <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, edited by Edmund M Clarke and Andrei Voronkov, vol. 6355, Springer Nature, 2010, pp. 103–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">10.1007/978-3-642-17511-4_7</a>.","apa":"Blanc, R., Henzinger, T. A., Hottelier, T., &#38; Kovács, L. (2010). ABC: Algebraic Bound Computation for loops. In E. M. Clarke &#38; A. Voronkov (Eds.), <i>Logic for Programming, Artificial Intelligence, and Reasoning</i> (Vol. 6355, pp. 103–118). Berlin, Heidelberg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">https://doi.org/10.1007/978-3-642-17511-4_7</a>","ama":"Blanc R, Henzinger TA, Hottelier T, Kovács L. ABC: Algebraic Bound Computation for loops. In: Clarke EM, Voronkov A, eds. <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>. Vol 6355. LNCS. Berlin, Heidelberg: Springer Nature; 2010:103-118. doi:<a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">10.1007/978-3-642-17511-4_7</a>"},"place":"Berlin, Heidelberg","publication":"Logic for Programming, Artificial Intelligence, and Reasoning","department":[{"_id":"ToHe"}],"publisher":"Springer Nature","main_file_link":[{"url":"https://infoscience.epfl.ch/record/186096","open_access":"1"}],"_id":"10908","title":"ABC: Algebraic Bound Computation for loops","type":"conference","article_processing_charge":"No","quality_controlled":"1","doi":"10.1007/978-3-642-17511-4_7","publication_identifier":{"eisbn":["9783642175114"],"isbn":["9783642175107"],"issn":["0302-9743"],"eissn":["1611-3349"]},"status":"public","page":"103-118","oa_version":"Submitted Version","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","conference":{"end_date":"2010-05-01","start_date":"2010-04-25","name":"LPAR: Logic for Programming, Artificial Intelligence and Reasoning","location":"Dakar, Senegal"}},{"related_material":{"record":[{"relation":"dissertation_contains","id":"1405","status":"public"}]},"page":"94 - 108","oa_version":"Submitted Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"conference":{"end_date":"2010-03-28","location":"Paphos, Cyprus","start_date":"2010-03-20","name":"FoSSaCS: Foundations of Software Science and Computation Structures"},"quality_controlled":"1","doi":"10.1007/978-3-642-12032-9_8","status":"public","type":"conference","ddc":["004"],"_id":"4361","title":"Forward analysis of depth-bounded processes","citation":{"short":"T. Wies, D. Zufferey, T.A. Henzinger, in:, L. Ong (Ed.), Springer, 2010, pp. 94–108.","chicago":"Wies, Thomas, Damien Zufferey, and Thomas A Henzinger. “Forward Analysis of Depth-Bounded Processes.” edited by Luke Ong, 6014:94–108. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">https://doi.org/10.1007/978-3-642-12032-9_8</a>.","ista":"Wies T, Zufferey D, Henzinger TA. 2010. Forward analysis of depth-bounded processes. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 6014, 94–108.","ama":"Wies T, Zufferey D, Henzinger TA. Forward analysis of depth-bounded processes. In: Ong L, ed. Vol 6014. Springer; 2010:94-108. doi:<a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">10.1007/978-3-642-12032-9_8</a>","ieee":"T. Wies, D. Zufferey, and T. A. Henzinger, “Forward analysis of depth-bounded processes,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus, 2010, vol. 6014, pp. 94–108.","mla":"Wies, Thomas, et al. <i>Forward Analysis of Depth-Bounded Processes</i>. Edited by Luke Ong, vol. 6014, Springer, 2010, pp. 94–108, doi:<a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">10.1007/978-3-642-12032-9_8</a>.","apa":"Wies, T., Zufferey, D., &#38; Henzinger, T. A. (2010). Forward analysis of depth-bounded processes. In L. Ong (Ed.) (Vol. 6014, pp. 94–108). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">https://doi.org/10.1007/978-3-642-12032-9_8</a>"},"has_accepted_license":"1","publisher":"Springer","department":[{"_id":"ToHe"}],"file":[{"access_level":"open_access","date_created":"2018-12-12T10:08:17Z","relation":"main_file","content_type":"application/pdf","file_size":240766,"creator":"system","checksum":"3e610de84937d821316362658239134a","file_id":"4677","date_updated":"2020-07-14T12:46:27Z","file_name":"IST-2012-50-v1+1_Forward_analysis_of_depth-bounded_processes.pdf"}],"alternative_title":["LNCS"],"day":"01","date_updated":"2026-04-09T14:35:23Z","corr_author":"1","pubrep_id":"50","publication_status":"published","author":[{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas","last_name":"Wies","first_name":"Thomas"},{"first_name":"Damien","last_name":"Zufferey","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"}],"publist_id":"1099","year":"2010","date_published":"2010-03-01T00:00:00Z","file_date_updated":"2020-07-14T12:46:27Z","date_created":"2018-12-11T12:08:27Z","editor":[{"first_name":"Luke","last_name":"Ong","full_name":"Ong, Luke"}],"oa":1,"language":[{"iso":"eng"}],"intvolume":"      6014","abstract":[{"lang":"eng","text":"Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an adequate domain of limits for the well-structured transition systems that are induced by depth-bounded processes. An immediate consequence of our result is that there exists a forward algorithm that decides the covering problem for this class. Unlike backward algorithms, the forward algorithm terminates even if the depth of the process is not known a priori. More importantly, our result suggests a whole spectrum of forward algorithms that enable the effective verification of a large class of mobile systems."}],"month":"03","volume":6014},{"publication_status":"published","type":"conference","corr_author":"1","author":[{"full_name":"Singh, Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu","last_name":"Singh"}],"conference":{"end_date":"2010-11-04","name":"RV: International Conference on Runtime Verification","start_date":"2010-11-01","location":"St. Julians, Malta"},"scopus_import":1,"oa_version":"None","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","page":"421 - 435","status":"public","doi":"10.1007/978-3-642-16612-9_32","quality_controlled":"1","month":"01","day":"01","alternative_title":["LNCS"],"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."}],"date_updated":"2024-10-09T20:54:01Z","volume":6418,"editor":[{"last_name":"Sokolsky","first_name":"Oleg","full_name":"Sokolsky, Oleg"},{"full_name":"Rosu, Grigore","first_name":"Grigore","last_name":"Rosu"},{"first_name":"Nikolai","last_name":"Tilmann","full_name":"Tilmann, Nikolai"},{"first_name":"Howard","last_name":"Barringer","full_name":"Barringer, Howard"},{"full_name":"Falcone, Ylies","last_name":"Falcone","first_name":"Ylies"},{"full_name":"Finkbeiner, Bernd","first_name":"Bernd","last_name":"Finkbeiner"},{"full_name":"Havelund, Klaus","first_name":"Klaus","last_name":"Havelund"},{"full_name":"Lee, Insup","last_name":"Lee","first_name":"Insup"},{"full_name":"Pace, Gordon","first_name":"Gordon","last_name":"Pace"}],"date_created":"2018-12-11T12:08:28Z","_id":"4362","title":"Runtime verification for software transactional memories","date_published":"2010-01-01T00:00:00Z","publist_id":"1096","year":"2010","intvolume":"      6418","department":[{"_id":"ToHe"}],"publisher":"Springer","language":[{"iso":"eng"}],"citation":{"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.","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>","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>.","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>.","ista":"Singh V. 2010. Runtime verification for software transactional memories. RV: International Conference on Runtime Verification, LNCS, vol. 6418, 421–435.","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."}},{"_id":"4369","title":"From MTL to deterministic timed automata","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.","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>","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>.","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>","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>.","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.","short":"D. Nickovic, N. Piterman, in:, T.A. Henzinger, K. Chatterjee (Eds.), Springer, 2010, pp. 152–167."},"has_accepted_license":"1","publisher":"Springer","department":[{"_id":"ToHe"}],"file":[{"date_updated":"2020-07-14T12:46:27Z","file_name":"IST-2012-49-v1+1_From_MTL_to_deterministic_timed_automata.pdf","file_id":"5028","checksum":"b0ca5f5fbe8a3d20ccbc6f51a344a459","file_size":249789,"content_type":"application/pdf","creator":"system","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:13:43Z"}],"alternative_title":["LNCS"],"day":"08","date_updated":"2024-10-09T20:54:01Z","page":"152 - 167","scopus_import":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","conference":{"end_date":"2010-09-10","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","start_date":"2010-09-08","location":"Klosterneuburg, Austria"},"quality_controlled":"1","doi":"10.1007/978-3-642-15297-9_13","status":"public","ec_funded":1,"type":"conference","ddc":["004"],"year":"2010","publist_id":"1090","date_published":"2010-09-08T00:00:00Z","file_date_updated":"2020-07-14T12:46:27Z","date_created":"2018-12-11T12:08:30Z","editor":[{"first_name":"Thomas A.","last_name":"Henzinger","full_name":"Henzinger, Thomas A."},{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"}],"oa":1,"language":[{"iso":"eng"}],"intvolume":"      6246","abstract":[{"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.","lang":"eng"}],"month":"09","volume":6246,"project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7"}],"corr_author":"1","pubrep_id":"49","publication_status":"published","author":[{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan"},{"full_name":"Piterman, Nir","first_name":"Nir","last_name":"Piterman"}]},{"citation":{"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>.","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.","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>.","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>","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>"},"department":[{"_id":"ToHe"}],"publisher":"Springer","main_file_link":[{"url":"https://infoscience.epfl.ch/record/161290/","open_access":"1"}],"_id":"4378","title":"Building a calculus of data structures","date_updated":"2021-01-12T07:56:31Z","alternative_title":["LNCS"],"day":"01","quality_controlled":"1","doi":"10.1007/978-3-642-11319-2_6","status":"public","page":"26 - 44","oa_version":"Submitted Version","scopus_import":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2010-01-17","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","location":"Madrid, Spain","end_date":"2010-01-19"},"type":"conference","language":[{"iso":"eng"}],"oa":1,"intvolume":"      5944","publist_id":"1081","year":"2010","date_published":"2010-01-01T00:00:00Z","date_created":"2018-12-11T12:08:33Z","editor":[{"last_name":"Barthe","first_name":"Gilles","full_name":"Barthe, Gilles"},{"first_name":"Manuel","last_name":"Hermenegildo","full_name":"Hermenegildo, Manuel"}],"volume":5944,"abstract":[{"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.","lang":"eng"}],"month":"01","author":[{"first_name":"Viktor","last_name":"Kuncak","full_name":"Kuncak, Viktor"},{"full_name":"Piskac, Ruzica","first_name":"Ruzica","last_name":"Piskac"},{"last_name":"Suter","first_name":"Philippe","full_name":"Suter, Philippe"},{"first_name":"Thomas","last_name":"Wies","full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published"},{"corr_author":"1","publication_status":"published","pubrep_id":"48","author":[{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"id":"3D8D36B6-F248-11E8-B48F-1D18A9856A87","full_name":"Tomar, Anmol","last_name":"Tomar","first_name":"Anmol"},{"id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","full_name":"Singh, Vasu","last_name":"Singh","first_name":"Vasu"},{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas","last_name":"Wies","first_name":"Thomas"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","last_name":"Zufferey","first_name":"Damien"}],"abstract":[{"lang":"eng","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."}],"month":"10","date_published":"2010-10-24T00:00:00Z","file_date_updated":"2020-07-14T12:46:28Z","publist_id":"1078","year":"2010","date_created":"2018-12-11T12:08:33Z","oa":1,"language":[{"iso":"eng"}],"type":"conference","ddc":["005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"oa_version":"Submitted Version","page":"1 - 8","conference":{"location":"Arizona, USA","name":"EMSOFT: Embedded Software ","start_date":"2010-10-24","end_date":"2010-10-29"},"doi":"10.1145/1879021.1879022","quality_controlled":"1","status":"public","day":"24","date_updated":"2024-10-09T20:54:01Z","title":"A marketplace for cloud resources","_id":"4380","has_accepted_license":"1","citation":{"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>","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>.","ista":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. 2010. A marketplace for cloud resources. EMSOFT: Embedded Software , 1–8.","short":"T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2010, pp. 1–8."},"file":[{"file_name":"IST-2012-48-v1+1_A_marketplace_for_cloud_resources.pdf","date_updated":"2020-07-14T12:46:28Z","file_id":"4767","checksum":"7680dd24016810710f7c977bc94f85e9","creator":"system","content_type":"application/pdf","file_size":222626,"date_created":"2018-12-12T10:09:42Z","relation":"main_file","access_level":"open_access"}],"publisher":"ACM","department":[{"_id":"ToHe"}]},{"month":"08","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"oa":1,"date_created":"2018-12-11T12:08:33Z","date_published":"2010-08-26T00:00:00Z","file_date_updated":"2020-07-14T12:46:28Z","year":"2010","publist_id":"1077","author":[{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Tomar","first_name":"Anmol","id":"3D8D36B6-F248-11E8-B48F-1D18A9856A87","full_name":"Tomar, Anmol"},{"first_name":"Vasu","last_name":"Singh","full_name":"Singh, Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","last_name":"Zufferey","first_name":"Damien"}],"publication_status":"published","pubrep_id":"47","corr_author":"1","date_updated":"2024-10-09T20:54:00Z","day":"26","file":[{"file_name":"IST-2012-47-v1+1_FlexPRICE-_Flexible_provisioning_of_resources_in_a_cloud_environment.pdf","date_updated":"2020-07-14T12:46:28Z","checksum":"98e534675339a8e2beca08890d048145","file_id":"5188","creator":"system","content_type":"application/pdf","file_size":467436,"relation":"main_file","date_created":"2018-12-12T10:16:03Z","access_level":"open_access"}],"publisher":"IEEE","department":[{"_id":"ToHe"}],"has_accepted_license":"1","citation":{"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>.","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.","short":"T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, IEEE, 2010, pp. 83–90.","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>","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>"},"title":"FlexPRICE: Flexible provisioning of resources in a cloud environment","_id":"4381","ddc":["004"],"article_processing_charge":"No","type":"conference","status":"public","doi":"10.1109/CLOUD.2010.71","quality_controlled":"1","conference":{"end_date":"2010-07-10","start_date":"2010-07-05","name":"CLOUD: Cloud Computing","location":"Miami, USA"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","scopus_import":1,"page":"83 - 90"},{"month":"06","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"oa":1,"date_created":"2018-12-11T12:08:34Z","file_date_updated":"2020-07-14T12:46:28Z","date_published":"2010-06-13T00:00:00Z","publist_id":"1076","year":"2010","author":[{"last_name":"Guerraoui","first_name":"Rachid","full_name":"Guerraoui, Rachid"},{"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":"Kapalka, Michal","last_name":"Kapalka","first_name":"Michal"},{"first_name":"Vasu","last_name":"Singh","full_name":"Singh, Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","pubrep_id":"46","date_updated":"2024-10-21T06:03:05Z","day":"13","file":[{"checksum":"f2ad6c00a6304da34bf21bcdcfd36c4b","file_id":"5080","file_name":"IST-2012-46-v1+1_Transactions_in_the_jungle.pdf","date_updated":"2020-07-14T12:46:28Z","relation":"main_file","date_created":"2018-12-12T10:14:28Z","access_level":"open_access","creator":"system","file_size":246409,"content_type":"application/pdf"}],"department":[{"_id":"ToHe"}],"publisher":"ACM","has_accepted_license":"1","citation":{"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>.","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.","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.","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>.","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>","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>"},"_id":"4382","title":"Transactions in the jungle","ddc":["005"],"type":"conference","status":"public","doi":"10.1145/1810479.1810529","quality_controlled":"1","conference":{"start_date":"2010-06-13","name":"SPAA: ACM Symposium on Parallel Algorithms and Architectures","location":"Santorini, Greece","end_date":"2010-06-15"},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","scopus_import":"1","page":"263 - 272"},{"ddc":["004"],"arxiv":1,"article_processing_charge":"No","type":"conference","status":"public","ec_funded":1,"quality_controlled":"1","doi":"10.1007/978-3-642-14295-6_57","conference":{"end_date":"2010-07-17","start_date":"2010-07-15","name":"CAV: Computer Aided Verification","location":"Edinburgh, UK"},"page":"665 - 669","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5393"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"oa_version":"Submitted Version","date_updated":"2024-10-09T20:54:00Z","alternative_title":["LNCS"],"day":"01","publisher":"Springer","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file":[{"access_level":"open_access","date_created":"2018-12-12T10:16:33Z","relation":"main_file","file_size":293605,"content_type":"application/pdf","creator":"system","file_id":"5221","checksum":"0b2ef8c4037ffccc6902d93081af24f7","date_updated":"2020-07-14T12:46:28Z","file_name":"IST-2012-43-v1+1_GIST-_A_solver_for_probabilistic_games.pdf"}],"citation":{"ista":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2010. GIST: A solver for probabilistic games. CAV: Computer Aided Verification, LNCS, vol. 6174, 665–669.","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>.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, in:, Springer, 2010, pp. 665–669.","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>","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>.","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, “GIST: A solver for probabilistic games,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 665–669.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. GIST: A solver for probabilistic games. In: Vol 6174. Springer; 2010:665-669. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">10.1007/978-3-642-14295-6_57</a>"},"has_accepted_license":"1","_id":"4388","title":"GIST: A solver for probabilistic games","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"},{"last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"}],"pubrep_id":"43","publication_status":"published","corr_author":"1","external_id":{"arxiv":["1004.2367"]},"project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"214373","name":"Design for Embedded Systems"}],"volume":6174,"month":"07","abstract":[{"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.","lang":"eng"}],"intvolume":"      6174","oa":1,"language":[{"iso":"eng"}],"date_created":"2018-12-11T12:08:36Z","publist_id":"1068","year":"2010","date_published":"2010-07-01T00:00:00Z","file_date_updated":"2020-07-14T12:46:28Z"},{"status":"public","quality_controlled":"1","doi":"10.1109/ACSD.2010.26","conference":{"name":"ACSD: Application of Concurrency to System Design"},"page":"77 - 84","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","scopus_import":1,"ddc":["004"],"type":"conference","publisher":"IEEE","department":[{"_id":"ToHe"}],"file":[{"creator":"system","file_size":159920,"content_type":"application/pdf","date_created":"2018-12-12T10:09:10Z","relation":"main_file","access_level":"open_access","file_name":"IST-2012-44-v1+1_Robustness_of_sequential_circuits.pdf","date_updated":"2020-07-14T12:46:28Z","file_id":"4733","checksum":"42b2952bfc6b6974617bd554842b904a"}],"citation":{"chicago":"Doyen, Laurent, Thomas A Henzinger, Axel Legay, and Dejan Nickovic. “Robustness of Sequential Circuits,” 77–84. IEEE, 2010. <a href=\"https://doi.org/10.1109/ACSD.2010.26\">https://doi.org/10.1109/ACSD.2010.26</a>.","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.","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>.","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>","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>"},"has_accepted_license":"1","_id":"4389","title":"Robustness of sequential circuits","date_updated":"2021-01-12T07:56:36Z","day":"23","author":[{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"last_name":"Legay","first_name":"Axel","full_name":"Legay, Axel"},{"full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan","last_name":"Nickovic"}],"pubrep_id":"44","publication_status":"published","language":[{"iso":"eng"}],"oa":1,"date_created":"2018-12-11T12:08:36Z","year":"2010","publist_id":"1069","file_date_updated":"2020-07-14T12:46:28Z","date_published":"2010-08-23T00:00:00Z","month":"08","abstract":[{"lang":"eng","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."}]},{"intvolume":"      6174","oa":1,"language":[{"iso":"eng"}],"date_created":"2018-12-11T12:08:36Z","file_date_updated":"2020-07-14T12:46:28Z","date_published":"2010-07-01T00:00:00Z","publist_id":"1066","year":"2010","volume":6174,"month":"07","abstract":[{"lang":"eng","text":"Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations does not stem from the number of variables or the program size, but rather from the large number of possible interleavings. These implementations are therefore prime candidates for model checking. We introduce an algorithm for verifying linearizability of singly-linked heap-based concurrent data structures. We consider a model consisting of an unbounded heap where each vertex stores an element from an unbounded data domain, with a restricted set of operations for testing and updating pointers and data elements. Our main result is that linearizability is decidable for programs that invoke a fixed number of methods, possibly in parallel. This decidable fragment covers many of the common implementation techniques — fine-grained locking, lazy synchronization, and lock-free synchronization. We also show how the technique can be used to verify optimistic implementations with the help of programmer annotations. We developed a verification tool CoLT and evaluated it on a representative sample of Java implementations of the concurrent set data structure. The tool verified linearizability of a number of implementations, found a known error in a lock-free implementation and proved that the corrected version is linearizable."}],"author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","first_name":"Arjun"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","last_name":"Zufferey","first_name":"Damien"},{"last_name":"Chaudhuri","first_name":"Swarat","full_name":"Chaudhuri, Swarat"},{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"}],"publication_status":"published","pubrep_id":"27","corr_author":"1","file":[{"relation":"main_file","date_created":"2020-05-19T16:31:56Z","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":3633276,"file_id":"7873","checksum":"2eb211ce40b3c4988bce3a3592980704","file_name":"2010_CAV_Cerny.pdf","date_updated":"2020-07-14T12:46:28Z"}],"publisher":"Springer","department":[{"_id":"ToHe"}],"has_accepted_license":"1","citation":{"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>","short":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, in:, Springer, 2010, pp. 465–479.","chicago":"Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. “Model Checking of Linearizability of Concurrent List Implementations,” 6174:465–79. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">https://doi.org/10.1007/978-3-642-14295-6_41</a>.","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."},"_id":"4390","title":"Model checking of linearizability of concurrent list implementations","date_updated":"2024-10-21T06:03:05Z","day":"01","alternative_title":["LNCS"],"status":"public","doi":"10.1007/978-3-642-14295-6_41","quality_controlled":"1","conference":{"start_date":"2010-07-15","name":"CAV: Computer Aided Verification","location":"Edinburgh, UK","end_date":"2010-07-17"},"oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","page":"465 - 479","related_material":{"record":[{"id":"5391","relation":"earlier_version","status":"public"}]},"ddc":["000"],"article_processing_charge":"No","type":"conference"},{"doi":"10.1007/978-3-642-13754-9_3","quality_controlled":"1","status":"public","ec_funded":1,"scopus_import":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"None","page":"42 - 60","type":"book_chapter","publication":"Time For Verification: Essays in Memory of Amir Pnueli","citation":{"ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative Simulation Games,” in <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, vol. 6200, Z. Manna and D. Peled, Eds. Springer, 2010, pp. 42–60.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2010). Quantitative Simulation Games. In Z. Manna &#38; D. Peled (Eds.), <i>Time For Verification: Essays in Memory of Amir Pnueli</i> (Vol. 6200, pp. 42–60). Springer. <a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">https://doi.org/10.1007/978-3-642-13754-9_3</a>","mla":"Cerny, Pavol, et al. “Quantitative Simulation Games.” <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, edited by Zohar Manna and Doron Peled, vol. 6200, Springer, 2010, pp. 42–60, doi:<a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">10.1007/978-3-642-13754-9_3</a>.","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."},"publisher":"Springer","department":[{"_id":"ToHe"}],"title":"Quantitative Simulation Games","_id":"4392","date_updated":"2024-10-09T20:53:58Z","day":"29","alternative_title":["LNCS"],"project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","grant_number":"215543"},{"grant_number":"214373","call_identifier":"FP7","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"author":[{"last_name":"Cerny","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna"}],"corr_author":"1","publication_status":"published","language":[{"iso":"eng"}],"intvolume":"      6200","date_published":"2010-07-29T00:00:00Z","publist_id":"1064","year":"2010","editor":[{"full_name":"Manna, Zohar","first_name":"Zohar","last_name":"Manna"},{"last_name":"Peled","first_name":"Doron","full_name":"Peled, Doron"}],"date_created":"2018-12-11T12:08:37Z","series_title":"Essays in Memory of Amir Pnueli","volume":6200,"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"}],"month":"07"},{"volume":6269,"month":"11","abstract":[{"text":"Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the implementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes.","lang":"eng"}],"intvolume":"      6269","language":[{"iso":"eng"}],"oa":1,"acknowledgement":"This work was partially supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","date_created":"2018-12-11T12:08:37Z","year":"2010","publist_id":"1065","file_date_updated":"2020-07-14T12:46:28Z","date_published":"2010-11-01T00:00:00Z","author":[{"first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","first_name":"Arjun"}],"pubrep_id":"42","publication_status":"published","corr_author":"1","project":[{"call_identifier":"FP7","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"date_updated":"2026-06-18T18:41:23Z","alternative_title":["LNCS"],"day":"01","department":[{"_id":"ToHe"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file":[{"file_name":"IST-2012-42-v1+1_Simulation_distances.pdf","date_updated":"2020-07-14T12:46:28Z","checksum":"ea567903676ba8afe0507ee11313dce5","file_id":"5130","creator":"system","content_type":"application/pdf","file_size":198913,"relation":"main_file","date_created":"2018-12-12T10:15:12Z","access_level":"open_access"}],"citation":{"ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances. CONCUR: Concurrency Theory, LNCS, vol. 6269, 235–268.","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>.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, 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>","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.","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>"},"has_accepted_license":"1","_id":"4393","title":"Simulation distances","ddc":["005"],"type":"conference","status":"public","ec_funded":1,"quality_controlled":"1","doi":"10.1007/978-3-642-15375-4_18","conference":{"location":"Paris, France","name":"CONCUR: Concurrency Theory","start_date":"2010-08-31","end_date":"2010-09-03"},"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5389"},{"relation":"later_version","id":"3249","status":"public"}]},"page":"235 - 268","scopus_import":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version"},{"type":"conference","ddc":["004"],"oa_version":"Submitted Version","scopus_import":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","page":"263 - 277","conference":{"end_date":"2010-03-28","name":"FASE: Fundamental Approaches To Software Engineering","start_date":"2010-03-20","location":"Paphos, Cyprus"},"doi":"10.1007/978-3-642-12029-9_19","quality_controlled":"1","status":"public","day":"21","alternative_title":["LNCS"],"date_updated":"2021-01-12T07:56:40Z","title":"Shape refinement through explicit heap analysis","_id":"4396","has_accepted_license":"1","citation":{"short":"D. Beyer, T.A. Henzinger, G. Théoduloz, D. Zufferey, in:, D. Rosenblum, G. Taenzer (Eds.), Springer, 2010, pp. 263–277.","ista":"Beyer D, Henzinger TA, Théoduloz G, Zufferey D. 2010. Shape refinement through explicit heap analysis. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 6013, 263–277.","chicago":"Beyer, Dirk, Thomas A Henzinger, Grégory Théoduloz, and Damien Zufferey. “Shape Refinement through Explicit Heap Analysis.” edited by David Rosenblum and Gabriele Taenzer, 6013:263–77. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">https://doi.org/10.1007/978-3-642-12029-9_19</a>.","ama":"Beyer D, Henzinger TA, Théoduloz G, Zufferey D. Shape refinement through explicit heap analysis. In: Rosenblum D, Taenzer G, eds. Vol 6013. Springer; 2010:263-277. doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">10.1007/978-3-642-12029-9_19</a>","apa":"Beyer, D., Henzinger, T. A., Théoduloz, G., &#38; Zufferey, D. (2010). Shape refinement through explicit heap analysis. In D. Rosenblum &#38; G. Taenzer (Eds.) (Vol. 6013, pp. 263–277). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">https://doi.org/10.1007/978-3-642-12029-9_19</a>","mla":"Beyer, Dirk, et al. <i>Shape Refinement through Explicit Heap Analysis</i>. Edited by David Rosenblum and Gabriele Taenzer, vol. 6013, Springer, 2010, pp. 263–77, doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">10.1007/978-3-642-12029-9_19</a>.","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."},"file":[{"date_updated":"2020-07-14T12:46:29Z","file_name":"IST-2012-41-v1+1_Shape_refinement_through_explicit_heap_analysis.pdf","checksum":"7d26e59a9681487d7283eba337292b2c","file_id":"5332","file_size":312147,"content_type":"application/pdf","creator":"system","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:18:13Z"}],"publisher":"Springer","department":[{"_id":"ToHe"}],"publication_status":"published","pubrep_id":"41","author":[{"full_name":"Beyer, Dirk","first_name":"Dirk","last_name":"Beyer"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Grégory","last_name":"Théoduloz","full_name":"Théoduloz, Grégory"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","last_name":"Zufferey","first_name":"Damien"}],"project":[{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"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."}],"month":"04","volume":6013,"file_date_updated":"2020-07-14T12:46:29Z","date_published":"2010-04-21T00:00:00Z","publist_id":"1061","year":"2010","date_created":"2018-12-11T12:08:38Z","editor":[{"full_name":"Rosenblum, David","last_name":"Rosenblum","first_name":"David"},{"last_name":"Taenzer","first_name":"Gabriele","full_name":"Taenzer, Gabriele"}],"language":[{"iso":"eng"}],"oa":1,"intvolume":"      6013"},{"citation":{"ama":"Alur R, Cerny P. Expressiveness of streaming string transducers. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:1-12. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">10.4230/LIPIcs.FSTTCS.2010.1</a>","apa":"Alur, R., &#38; Cerny, P. (2010). Expressiveness of streaming string transducers (Vol. 8, pp. 1–12). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1</a>","mla":"Alur, Rajeev, and Pavol Cerny. <i>Expressiveness of Streaming String Transducers</i>. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">10.4230/LIPIcs.FSTTCS.2010.1</a>.","ieee":"R. Alur and P. Cerny, “Expressiveness of streaming string transducers,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 1–12.","short":"R. Alur, P. Cerny, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12.","ista":"Alur R, Cerny P. 2010. Expressiveness of streaming string transducers. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 1–12.","chicago":"Alur, Rajeev, and Pavol Cerny. “Expressiveness of Streaming String Transducers,” 8:1–12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1</a>."},"has_accepted_license":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"}],"file":[{"file_id":"4690","checksum":"5845be5aa19791830f7407d8853f2df0","file_name":"IST-2018-948-v1+1_2011_Cerny_Expressiveness_of.pdf","date_updated":"2020-07-14T12:46:35Z","date_created":"2018-12-12T10:08:29Z","relation":"main_file","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":492344}],"_id":"488","title":"Expressiveness of streaming string transducers","date_updated":"2025-09-30T09:49:32Z","alternative_title":["LIPIcs"],"day":"01","quality_controlled":"1","doi":"10.4230/LIPIcs.FSTTCS.2010.1","status":"public","page":"1 - 12","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Published Version","conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","start_date":"2010-12-15","location":"Chennai, India","end_date":"2010-12-18"},"ddc":["005"],"type":"conference","article_processing_charge":"No","isi":1,"oa":1,"language":[{"iso":"eng"}],"intvolume":"         8","publist_id":"7331","year":"2010","date_published":"2010-01-01T00:00:00Z","file_date_updated":"2020-07-14T12:46:35Z","date_created":"2018-12-11T11:46:45Z","volume":8,"abstract":[{"lang":"eng","text":"Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and uses a finite set of variables that range over strings from the output alphabet. At every step, the transducer processes an input symbol, and updates all the variables in parallel using assignments whose right-hand-sides are concatenations of output symbols and variables with the restriction that a variable can be used at most once in a right-hand-side expression. It has been shown that streaming string transducers operating on strings over infinite data domains are of interest in algorithmic verification of list-processing programs, as they lead to PSPACE decision procedures for checking pre/post conditions and for checking semantic equivalence, for a well-defined class of heap-manipulating programs. In order to understand the theoretical expressiveness of streaming transducers, we focus on streaming transducers processing strings over finite alphabets, given the existence of a robust and well-studied class of &quot;regular&quot; transductions for this case. Such regular transductions can be defined either by two-way deterministic finite-state transducers, or using a logical MSO-based characterization. Our main result is that the expressiveness of streaming string transducers coincides exactly with this class of regular transductions. "}],"month":"01","author":[{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"},{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol"}],"corr_author":"1","external_id":{"isi":["000310361000001"]},"pubrep_id":"948","tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"publication_status":"published"},{"date_created":"2018-12-11T11:47:01Z","date_published":"2010-12-01T00:00:00Z","year":"2010","publist_id":"7284","intvolume":"        37","language":[{"iso":"eng"}],"issue":"2-3","isi":1,"month":"12","abstract":[{"lang":"eng","text":"Any programming error that can be revealed before compiling a program saves precious time for the programmer. While integrated development environments already do a good job by detecting, e.g., data-flow abnormalities, current static analysis tools suffer from false positives (&quot;noise&quot;) or require strong user interaction. We propose to avoid this deficiency by defining a new class of errors. A program fragment is doomed if its execution will inevitably fail, regardless of which state it is started in. We use a formal verification method to identify such errors fully automatically and, most significantly, without producing noise. We report on experiments with a prototype tool."}],"volume":37,"publication_status":"published","external_id":{"isi":["000286631700004"]},"corr_author":"1","author":[{"full_name":"Hoenicke, Jochen","first_name":"Jochen","last_name":"Hoenicke"},{"last_name":"Leino","first_name":"Kari","full_name":"Leino, Kari"},{"last_name":"Podelski","first_name":"Andreas","full_name":"Podelski, Andreas"},{"full_name":"Schäf, Martin","last_name":"Schäf","first_name":"Martin"},{"last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas"}],"title":"Doomed program points","_id":"533","department":[{"_id":"ToHe"}],"publisher":"Springer","publication":"Formal Methods in System Design","citation":{"apa":"Hoenicke, J., Leino, K., Podelski, A., Schäf, M., &#38; Wies, T. (2010). Doomed program points. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-010-0102-0\">https://doi.org/10.1007/s10703-010-0102-0</a>","mla":"Hoenicke, Jochen, et al. “Doomed Program Points.” <i>Formal Methods in System Design</i>, vol. 37, no. 2–3, Springer, 2010, pp. 171–99, doi:<a href=\"https://doi.org/10.1007/s10703-010-0102-0\">10.1007/s10703-010-0102-0</a>.","ieee":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, and T. Wies, “Doomed program points,” <i>Formal Methods in System Design</i>, vol. 37, no. 2–3. Springer, pp. 171–199, 2010.","ama":"Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. Doomed program points. <i>Formal Methods in System Design</i>. 2010;37(2-3):171-199. doi:<a href=\"https://doi.org/10.1007/s10703-010-0102-0\">10.1007/s10703-010-0102-0</a>","ista":"Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. 2010. Doomed program points. Formal Methods in System Design. 37(2–3), 171–199.","chicago":"Hoenicke, Jochen, Kari Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “Doomed Program Points.” <i>Formal Methods in System Design</i>. Springer, 2010. <a href=\"https://doi.org/10.1007/s10703-010-0102-0\">https://doi.org/10.1007/s10703-010-0102-0</a>.","short":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, T. Wies, Formal Methods in System Design 37 (2010) 171–199."},"day":"01","date_updated":"2025-09-30T09:48:58Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"None","scopus_import":"1","page":"171 - 199","status":"public","doi":"10.1007/s10703-010-0102-0","quality_controlled":"1","article_processing_charge":"No","type":"journal_article"}]