[{"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"doi":"10.1145/2593882.2593900","language":[{"iso":"eng"}],"conference":{"location":"Hyderabad, India","name":"FOSE: Future of Software Engineering","start_date":"2014-05-31","end_date":"2014-06-07"},"title":"Probabilistic programming","ec_funded":1,"citation":{"ieee":"A. Gordon, T. A. Henzinger, A. Nori, and S. Rajamani, “Probabilistic programming,” in <i>Proceedings of the on Future of Software Engineering</i>, Hyderabad, India, 2014, pp. 167–181.","ista":"Gordon A, Henzinger TA, Nori A, Rajamani S. 2014. Probabilistic programming. Proceedings of the on Future of Software Engineering. FOSE: Future of Software Engineering, 167–181.","chicago":"Gordon, Andrew, Thomas A Henzinger, Aditya Nori, and Sriram Rajamani. “Probabilistic Programming.” In <i>Proceedings of the on Future of Software Engineering</i>, 167–81. ACM, 2014. <a href=\"https://doi.org/10.1145/2593882.2593900\">https://doi.org/10.1145/2593882.2593900</a>.","mla":"Gordon, Andrew, et al. “Probabilistic Programming.” <i>Proceedings of the on Future of Software Engineering</i>, ACM, 2014, pp. 167–81, doi:<a href=\"https://doi.org/10.1145/2593882.2593900\">10.1145/2593882.2593900</a>.","short":"A. Gordon, T.A. Henzinger, A. Nori, S. Rajamani, in:, Proceedings of the on Future of Software Engineering, ACM, 2014, pp. 167–181.","apa":"Gordon, A., Henzinger, T. A., Nori, A., &#38; Rajamani, S. (2014). Probabilistic programming. In <i>Proceedings of the on Future of Software Engineering</i> (pp. 167–181). Hyderabad, India: ACM. <a href=\"https://doi.org/10.1145/2593882.2593900\">https://doi.org/10.1145/2593882.2593900</a>","ama":"Gordon A, Henzinger TA, Nori A, Rajamani S. Probabilistic programming. In: <i>Proceedings of the on Future of Software Engineering</i>. ACM; 2014:167-181. doi:<a href=\"https://doi.org/10.1145/2593882.2593900\">10.1145/2593882.2593900</a>"},"type":"conference","author":[{"full_name":"Gordon, Andrew","first_name":"Andrew","last_name":"Gordon"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"last_name":"Nori","first_name":"Aditya","full_name":"Nori, Aditya"},{"first_name":"Sriram","full_name":"Rajamani, Sriram","last_name":"Rajamani"}],"day":"31","publisher":"ACM","status":"public","quality_controlled":"1","department":[{"_id":"ToHe"}],"publication":"Proceedings of the on Future of Software Engineering","page":"167 - 181","date_created":"2018-12-11T11:51:45Z","month":"05","date_updated":"2021-01-12T06:50:22Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"oa_version":"Published Version","year":"2014","publist_id":"5816","main_file_link":[{"url":"https://doi.org/10.1145/2593882.2593900","open_access":"1"}],"oa":1,"publication_status":"published","article_processing_charge":"No","_id":"1393","date_published":"2014-05-31T00:00:00Z","abstract":[{"lang":"eng","text":"Probabilistic programs are usual functional or imperative programs with two added constructs: (1) the ability to draw values at random from distributions, and (2) the ability to condition values of variables in a program via observations. Models from diverse application areas such as computer vision, coding theory, cryptographic protocols, biology and reliability analysis can be written as probabilistic programs. Probabilistic inference is the problem of computing an explicit representation of the probability distribution implicitly specified by a probabilistic program. Depending on the application, the desired output from inference may vary-we may want to estimate the expected value of some function f with respect to the distribution, or the mode of the distribution, or simply a set of samples drawn from the distribution. In this paper, we describe connections this research area called \\Probabilistic Programming&quot; has with programming languages and software engineering, and this includes language design, and the static and dynamic analysis of programs. We survey current state of the art and speculate on promising directions for future research."}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-09-07T11:57:01Z","scopus_import":1,"publist_id":"4458","oa_version":"Submitted Version","has_accepted_license":"1","year":"2013","file_date_updated":"2020-07-14T12:45:40Z","volume":8044,"pubrep_id":"199","publication_status":"published","oa":1,"file":[{"file_name":"IST-2014-199-v1+1_cav2013-final.pdf","file_size":365548,"creator":"system","checksum":"70c70ca5487faba82262c63e1b678a27","date_updated":"2020-07-14T12:45:40Z","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"5158","date_created":"2018-12-12T10:15:37Z"}],"_id":"2445","abstract":[{"text":"We develop program synthesis techniques that can help programmers fix concurrency-related bugs. We make two new contributions to synthesis for concurrency, the first improving the efficiency of the synthesized code, and the second improving the efficiency of the synthesis procedure itself. The first contribution is to have the synthesis procedure explore a variety of (sequential) semantics-preserving program transformations. Classically, only one such transformation has been considered, namely, the insertion of synchronization primitives (such as locks). Based on common manual bug-fixing techniques used by Linux device-driver developers, we explore additional, more efficient transformations, such as the reordering of independent instructions. The second contribution is to speed up the counterexample-guided removal of concurrency bugs within the synthesis procedure by considering partial-order traces (instead of linear traces) as counterexamples. A partial-order error trace represents a set of linear (interleaved) traces of a concurrent program all of which lead to the same error. By eliminating a partial-order error trace, we eliminate in a single iteration of the synthesis procedure all linearizations of the partial-order trace. We evaluated our techniques on several simplified examples of real concurrency bugs that occurred in Linux device drivers.","lang":"eng"}],"date_published":"2013-07-01T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-39799-8_68","ddc":["000","004"],"project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"1130","status":"public"}]},"day":"01","alternative_title":["LNCS"],"author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","full_name":"Cerny, Pavol","first_name":"Pavol"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","first_name":"Arjun","full_name":"Radhakrishna, Arjun"},{"full_name":"Ryzhyk, Leonid","first_name":"Leonid","last_name":"Ryzhyk"},{"last_name":"Tarrach","full_name":"Tarrach, Thorsten","first_name":"Thorsten","orcid":"0000-0003-4409-8487","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87"}],"type":"conference","ec_funded":1,"citation":{"ama":"Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. Efficient synthesis for concurrency by semantics-preserving transformations. In: Vol 8044. Springer; 2013:951-967. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_68\">10.1007/978-3-642-39799-8_68</a>","apa":"Cerny, P., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., &#38; Tarrach, T. (2013). Efficient synthesis for concurrency by semantics-preserving transformations (Vol. 8044, pp. 951–967). Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_68\">https://doi.org/10.1007/978-3-642-39799-8_68</a>","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, T. Tarrach, in:, Springer, 2013, pp. 951–967.","mla":"Cerny, Pavol, et al. <i>Efficient Synthesis for Concurrency by Semantics-Preserving Transformations</i>. Vol. 8044, Springer, 2013, pp. 951–67, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_68\">10.1007/978-3-642-39799-8_68</a>.","chicago":"Cerny, Pavol, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, and Thorsten Tarrach. “Efficient Synthesis for Concurrency by Semantics-Preserving Transformations,” 8044:951–67. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_68\">https://doi.org/10.1007/978-3-642-39799-8_68</a>.","ista":"Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. 2013. Efficient synthesis for concurrency by semantics-preserving transformations. CAV: Computer Aided Verification, LNCS, vol. 8044, 951–967.","ieee":"P. Cerny, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, and T. Tarrach, “Efficient synthesis for concurrency by semantics-preserving transformations,” presented at the CAV: Computer Aided Verification, St. Petersburg, Russia, 2013, vol. 8044, pp. 951–967."},"conference":{"location":"St. Petersburg, Russia","end_date":"2013-07-19","start_date":"2013-07-13","name":"CAV: Computer Aided Verification"},"title":"Efficient synthesis for concurrency by semantics-preserving transformations","quality_controlled":"1","department":[{"_id":"ToHe"}],"intvolume":"      8044","status":"public","publisher":"Springer","month":"07","date_created":"2018-12-11T11:57:42Z","page":"951 - 967"},{"date_updated":"2020-08-11T10:09:47Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"publist_id":"4456","oa_version":"Submitted Version","has_accepted_license":"1","year":"2013","publication_status":"published","oa":1,"file_date_updated":"2020-07-14T12:45:41Z","volume":8044,"article_processing_charge":"No","file":[{"content_type":"application/pdf","file_id":"7859","relation":"main_file","date_created":"2020-05-15T11:13:01Z","file_name":"2013_CAV_Piskac.pdf","creator":"dernst","file_size":309182,"date_updated":"2020-07-14T12:45:41Z","access_level":"open_access","checksum":"2e866932ab688f47ecd504acb4d5c7d4"}],"_id":"2447","date_published":"2013-07-01T00:00:00Z","abstract":[{"lang":"eng","text":"Separation logic (SL) has gained widespread popularity because of its ability to succinctly express complex invariants of a program’s heap configurations. Several specialized provers have been developed for decidable SL fragments. However, these provers cannot be easily extended or combined with solvers for other theories that are important in program verification, e.g., linear arithmetic. In this paper, we present a reduction of decidable SL fragments to a decidable first-order theory that fits well into the satisfiability modulo theories (SMT) framework. We show how to use this reduction to automate satisfiability, entailment, frame inference, and abduction problems for separation logic using SMT solvers. Our approach provides a simple method of integrating separation logic into existing verification tools that provide SMT backends, and an elegant way of combining SL fragments with other decidable first-order theories. We implemented this approach in a verification tool and applied it to heap-manipulating programs whose verification involves reasoning in theory combinations.\r\n"}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-39799-8_54","ddc":["000"],"citation":{"ama":"Piskac R, Wies T, Zufferey D. Automating separation logic using SMT. 2013;8044:773-789. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_54\">10.1007/978-3-642-39799-8_54</a>","apa":"Piskac, R., Wies, T., &#38; Zufferey, D. (2013). Automating separation logic using SMT. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_54\">https://doi.org/10.1007/978-3-642-39799-8_54</a>","short":"R. Piskac, T. Wies, D. Zufferey, 8044 (2013) 773–789.","mla":"Piskac, Ruzica, et al. <i>Automating Separation Logic Using SMT</i>. Vol. 8044, Springer, 2013, pp. 773–89, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_54\">10.1007/978-3-642-39799-8_54</a>.","chicago":"Piskac, Ruzica, Thomas Wies, and Damien Zufferey. “Automating Separation Logic Using SMT.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_54\">https://doi.org/10.1007/978-3-642-39799-8_54</a>.","ieee":"R. Piskac, T. Wies, and D. Zufferey, “Automating separation logic using SMT,” vol. 8044. Springer, pp. 773–789, 2013.","ista":"Piskac R, Wies T, Zufferey D. 2013. Automating separation logic using SMT. 8044, 773–789."},"conference":{"location":"St. Petersburg, Russia","name":"CAV: Computer Aided Verification","end_date":"2013-07-19","start_date":"2013-07-13"},"title":"Automating separation logic using SMT","day":"01","alternative_title":["LNCS"],"type":"conference","author":[{"last_name":"Piskac","first_name":"Ruzica","full_name":"Piskac, Ruzica"},{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","last_name":"Wies","full_name":"Wies, Thomas","first_name":"Thomas"},{"first_name":"Damien","full_name":"Zufferey, Damien","last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736"}],"publisher":"Springer","department":[{"_id":"ToHe"}],"quality_controlled":"1","status":"public","intvolume":"      8044","page":"773 - 789","month":"07","series_title":"Lecture Notes in Computer Science","date_created":"2018-12-11T11:57:43Z"},{"file":[{"checksum":"85afbf6c18a2c7e377c52c9410e2d824","date_updated":"2020-07-14T12:45:42Z","access_level":"open_access","file_name":"2013_ICALP_Almagor.pdf","file_size":363031,"creator":"dernst","date_created":"2020-05-15T11:16:12Z","content_type":"application/pdf","file_id":"7860","relation":"main_file"}],"abstract":[{"lang":"eng","text":"Traditional formal methods are based on a Boolean satisfaction notion: a reactive system satisfies, or not, a given specification. We generalize formal methods to also address the quality of systems. As an adequate specification formalism we introduce the linear temporal logic LTL[F]. The satisfaction value of an LTL[F] formula is a number between 0 and 1, describing the quality of the satisfaction. The logic generalizes traditional LTL by augmenting it with a (parameterized) set F of arbitrary functions over the interval [0,1]. For example, F may contain the maximum or minimum between the satisfaction values of subformulas, their product, and their average. The classical decision problems in formal methods, such as satisfiability, model checking, and synthesis, are generalized to search and optimization problems in the quantitative setting. For example, model checking asks for the quality in which a specification is satisfied, and synthesis returns a system satisfying the specification with the highest quality. Reasoning about quality gives rise to other natural questions, like the distance between specifications. We formalize these basic questions and study them for LTL[F]. By extending the automata-theoretic approach for LTL to a setting that takes quality into an account, we are able to solve the above problems and show that reasoning about LTL[F] has roughly the same complexity as reasoning about traditional LTL."}],"_id":"2517","date_published":"2013-07-01T00:00:00Z","article_processing_charge":"No","issue":"Part 2","file_date_updated":"2020-07-14T12:45:42Z","volume":7966,"publication_status":"published","oa":1,"publist_id":"4384","has_accepted_license":"1","oa_version":"Submitted Version","year":"2013","scopus_import":1,"date_updated":"2020-08-11T10:09:47Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","series_title":"Lecture Notes in Computer Science","date_created":"2018-12-11T11:58:08Z","page":"15 - 27","quality_controlled":"1","department":[{"_id":"ToHe"}],"intvolume":"      7966","status":"public","publisher":"Springer","day":"01","author":[{"last_name":"Almagor","full_name":"Almagor, Shaull","first_name":"Shaull"},{"last_name":"Boker","first_name":"Udi","full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"}],"type":"conference","alternative_title":["LNCS"],"citation":{"mla":"Almagor, Shaull, et al. <i>Formalizing and Reasoning about Quality</i>. Vol. 7966, no. Part 2, Springer, 2013, pp. 15–27, doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_3\">10.1007/978-3-642-39212-2_3</a>.","ieee":"S. Almagor, U. Boker, and O. Kupferman, “Formalizing and reasoning about quality,” vol. 7966, no. Part 2. Springer, pp. 15–27, 2013.","ista":"Almagor S, Boker U, Kupferman O. 2013. Formalizing and reasoning about quality. 7966(Part 2), 15–27.","chicago":"Almagor, Shaull, Udi Boker, and Orna Kupferman. “Formalizing and Reasoning about Quality.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_3\">https://doi.org/10.1007/978-3-642-39212-2_3</a>.","apa":"Almagor, S., Boker, U., &#38; Kupferman, O. (2013). Formalizing and reasoning about quality. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_3\">https://doi.org/10.1007/978-3-642-39212-2_3</a>","ama":"Almagor S, Boker U, Kupferman O. Formalizing and reasoning about quality. 2013;7966(Part 2):15-27. doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_3\">10.1007/978-3-642-39212-2_3</a>","short":"S. Almagor, U. Boker, O. Kupferman, 7966 (2013) 15–27."},"ec_funded":1,"title":"Formalizing and reasoning about quality","conference":{"location":"Riga, Latvia","name":"ICALP: Automata, Languages and Programming","end_date":"2013-07-12","start_date":"2013-07-08"},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-39212-2_3","ddc":["000"],"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"acknowledgement":"ERC Grant QUALITY. "},{"month":"03","series_title":"Lecture Notes in Computer Science","date_created":"2018-12-11T11:59:54Z","page":"62 - 77","quality_controlled":"1","department":[{"_id":"ToHe"}],"intvolume":"      7795","status":"public","publisher":"Springer","day":"01","alternative_title":["LNCS"],"type":"conference","author":[{"first_name":"Kshitij","full_name":"Bansal, Kshitij","last_name":"Bansal"},{"last_name":"Koskinen","full_name":"Koskinen, Eric","first_name":"Eric"},{"full_name":"Wies, Thomas","first_name":"Thomas","last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","full_name":"Zufferey, Damien","first_name":"Damien"}],"ec_funded":1,"citation":{"mla":"Bansal, Kshitij, et al. <i>Structural Counter Abstraction</i>. Edited by Nir Piterman and Scott Smolka, vol. 7795, Springer, 2013, pp. 62–77, doi:<a href=\"https://doi.org/10.1007/978-3-642-36742-7_5\">10.1007/978-3-642-36742-7_5</a>.","ista":"Bansal K, Koskinen E, Wies T, Zufferey D. 2013. Structural Counter Abstraction (eds. N. Piterman &#38; S. Smolka). 7795, 62–77.","ieee":"K. Bansal, E. Koskinen, T. Wies, and D. Zufferey, “Structural Counter Abstraction,” vol. 7795. Springer, pp. 62–77, 2013.","chicago":"Bansal, Kshitij, Eric Koskinen, Thomas Wies, and Damien Zufferey. “Structural Counter Abstraction.” Edited by Nir Piterman and Scott Smolka. Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-36742-7_5\">https://doi.org/10.1007/978-3-642-36742-7_5</a>.","apa":"Bansal, K., Koskinen, E., Wies, T., &#38; Zufferey, D. (2013). Structural Counter Abstraction. (N. Piterman &#38; S. Smolka, Eds.). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Rome, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-642-36742-7_5\">https://doi.org/10.1007/978-3-642-36742-7_5</a>","ama":"Bansal K, Koskinen E, Wies T, Zufferey D. Structural Counter Abstraction. Piterman N, Smolka S, eds. 2013;7795:62-77. doi:<a href=\"https://doi.org/10.1007/978-3-642-36742-7_5\">10.1007/978-3-642-36742-7_5</a>","short":"K. Bansal, E. Koskinen, T. Wies, D. Zufferey, 7795 (2013) 62–77."},"conference":{"start_date":"2013-03-16","end_date":"2013-03-24","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Rome, Italy"},"title":"Structural Counter Abstraction","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-36742-7_5","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"related_material":{"record":[{"status":"public","id":"1405","relation":"dissertation_contains"}]},"_id":"2847","abstract":[{"lang":"eng","text":"Depth-Bounded Systems form an expressive class of well-structured transition systems. They can model a wide range of concurrent infinite-state systems including those with dynamic thread creation, dynamically changing communication topology, and complex shared heap structures. We present the first method to automatically prove fair termination of depth-bounded systems. Our method uses a numerical abstraction of the system, which we obtain by systematically augmenting an over-approximation of the system’s reachable states with a finite set of counters. This numerical abstraction can be analyzed with existing termination provers. What makes our approach unique is the way in which it exploits the well-structuredness of the analyzed system. We have implemented our work in a prototype tool and used it to automatically prove liveness properties of complex concurrent systems, including nonblocking algorithms such as Treiber’s stack and several distributed processes. Many of these examples are beyond the scope of termination analyses that are based on traditional counter abstractions."}],"date_published":"2013-03-01T00:00:00Z","volume":7795,"publication_status":"published","main_file_link":[{"url":"http://arise.or.at/pubpdf/Structural_Counter_Abstraction.pdf","open_access":"1"}],"oa":1,"publist_id":"3947","oa_version":"Submitted Version","year":"2013","editor":[{"full_name":"Piterman, Nir","first_name":"Nir","last_name":"Piterman"},{"full_name":"Smolka, Scott","first_name":"Scott","last_name":"Smolka"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-09-07T11:36:36Z","scopus_import":1},{"oa":1,"publication_status":"published","volume":79,"pubrep_id":"388","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"file_date_updated":"2020-07-14T12:45:51Z","issue":"5","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We consider concurrent games played on graphs. At every round of a game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state. Two basic objectives are the safety objective to stay forever in a given set of states, and its dual, the reachability objective to reach a given set of states. First, we present a simple proof of the fact that in concurrent reachability games, for all ε&gt;0, memoryless ε-optimal strategies exist. A memoryless strategy is independent of the history of plays, and an ε-optimal strategy achieves the objective with probability within ε of the value of the game. In contrast to previous proofs of this fact, our proof is more elementary and more combinatorial. Second, we present a strategy-improvement (a.k.a. policy-iteration) algorithm for concurrent games with reachability objectives. Finally, we present a strategy-improvement algorithm for turn-based stochastic games (where each player selects moves in turns) with safety objectives. Our algorithms yield sequences of player-1 strategies which ensure probabilities of winning that converge monotonically (from below) to the value of the game. © 2012 Elsevier Inc."}],"_id":"2854","date_published":"2013-08-01T00:00:00Z","file":[{"content_type":"application/pdf","file_id":"5370","relation":"main_file","date_created":"2018-12-12T10:18:48Z","file_name":"IST-2015-388-v1+1_1-s2.0-S0022000012001778-main.pdf","creator":"system","file_size":425488,"date_updated":"2020-07-14T12:45:51Z","access_level":"open_access","checksum":"6d3ee12cceb946a0abe69594b6a22409"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:00:16Z","scopus_import":1,"oa_version":"Published Version","has_accepted_license":"1","year":"2013","publist_id":"3938","article_type":"original","publisher":"Elsevier","status":"public","intvolume":"        79","quality_controlled":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication":"Journal of Computer and System Sciences","page":"640 - 657","date_created":"2018-12-11T11:59:57Z","month":"08","acknowledgement":"This work was partially supported in part by the NSF grants CCR-0132780, CNS-0720884, CCR-0225610, by the Swiss National Science Foundation, ERC Start Grant Graph Games (Project No. 279307), FWF NFN Grant S11407-N23 (RiSE), and a Microsoft faculty fellows","project":[{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"ddc":["000"],"doi":"10.1016/j.jcss.2012.12.001","language":[{"iso":"eng"}],"title":"Strategy improvement for concurrent reachability and turn based stochastic safety games","ec_funded":1,"citation":{"apa":"Chatterjee, K., De Alfaro, L., &#38; Henzinger, T. A. (2013). Strategy improvement for concurrent reachability and turn based stochastic safety games. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jcss.2012.12.001\">https://doi.org/10.1016/j.jcss.2012.12.001</a>","ama":"Chatterjee K, De Alfaro L, Henzinger TA. Strategy improvement for concurrent reachability and turn based stochastic safety games. <i>Journal of Computer and System Sciences</i>. 2013;79(5):640-657. doi:<a href=\"https://doi.org/10.1016/j.jcss.2012.12.001\">10.1016/j.jcss.2012.12.001</a>","short":"K. Chatterjee, L. De Alfaro, T.A. Henzinger, Journal of Computer and System Sciences 79 (2013) 640–657.","mla":"Chatterjee, Krishnendu, et al. “Strategy Improvement for Concurrent Reachability and Turn Based Stochastic Safety Games.” <i>Journal of Computer and System Sciences</i>, vol. 79, no. 5, Elsevier, 2013, pp. 640–57, doi:<a href=\"https://doi.org/10.1016/j.jcss.2012.12.001\">10.1016/j.jcss.2012.12.001</a>.","ieee":"K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Strategy improvement for concurrent reachability and turn based stochastic safety games,” <i>Journal of Computer and System Sciences</i>, vol. 79, no. 5. Elsevier, pp. 640–657, 2013.","ista":"Chatterjee K, De Alfaro L, Henzinger TA. 2013. Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences. 79(5), 640–657.","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Strategy Improvement for Concurrent Reachability and Turn Based Stochastic Safety Games.” <i>Journal of Computer and System Sciences</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.jcss.2012.12.001\">https://doi.org/10.1016/j.jcss.2012.12.001</a>."},"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"De Alfaro, Luca","first_name":"Luca","last_name":"De Alfaro"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"type":"journal_article","day":"01"},{"date_created":"2018-12-11T12:00:08Z","_id":"2885","date_published":"2013-01-09T00:00:00Z","series_title":"Lecture Notes in Computer Science","abstract":[{"lang":"eng","text":"This volume contains the post-proceedings of the 8th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2012, held in Znojmo, Czech Republic, in October, 2012. The 13 thoroughly revised papers were carefully selected out of 31 submissions and are presented together with 6 invited papers. The topics covered by the papers include: computer-aided analysis and verification, applications of game theory in computer science, networks and security, modern trends of graph theory in computer science, electronic systems design and testing, and quantum information processing."}],"month":"01","page":"1 - 228","volume":7721,"status":"public","intvolume":"      7721","quality_controlled":"1","department":[{"_id":"ToHe"}],"publication_status":"published","publisher":"Springer","year":"2013","oa_version":"None","alternative_title":["LNCS"],"type":"conference_editor","day":"09","publist_id":"3874","conference":{"location":"Znojmo, Czech Republic","name":"MEMICS: Mathematical and Engineering methods in computer science","end_date":"2012-10-28","start_date":"2012-10-25"},"editor":[{"first_name":"Antonin","full_name":"Kucera, Antonin","last_name":"Kucera"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Jaroslav","full_name":"Nesetril, Jaroslav","last_name":"Nesetril"},{"last_name":"Vojnar","first_name":"Tomas","full_name":"Vojnar, Tomas"},{"full_name":"Antos, David","first_name":"David","last_name":"Antos"}],"title":"Mathematical and Engineering Methods in Computer Science","citation":{"short":"A. Kucera, T.A. Henzinger, J. Nesetril, T. Vojnar, D. Antos, eds., Mathematical and Engineering Methods in Computer Science, Springer, 2013.","ama":"Kucera A, Henzinger TA, Nesetril J, Vojnar T, Antos D, eds. <i>Mathematical and Engineering Methods in Computer Science</i>. Vol 7721. Springer; 2013:1-228. doi:<a href=\"https://doi.org/10.1007/978-3-642-36046-6\">10.1007/978-3-642-36046-6</a>","apa":"Kucera, A., Henzinger, T. A., Nesetril, J., Vojnar, T., &#38; Antos, D. (Eds.). (2013). <i>Mathematical and Engineering Methods in Computer Science</i> (Vol. 7721, pp. 1–228). Presented at the MEMICS: Mathematical and Engineering methods in computer science, Znojmo, Czech Republic: Springer. <a href=\"https://doi.org/10.1007/978-3-642-36046-6\">https://doi.org/10.1007/978-3-642-36046-6</a>","chicago":"Kucera, Antonin, Thomas A Henzinger, Jaroslav Nesetril, Tomas Vojnar, and David Antos, eds. <i>Mathematical and Engineering Methods in Computer Science</i>. Vol. 7721. Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-36046-6\">https://doi.org/10.1007/978-3-642-36046-6</a>.","ista":"Kucera A, Henzinger TA, Nesetril J, Vojnar T, Antos D eds. 2013. Mathematical and Engineering Methods in Computer Science, Springer,p.","ieee":"A. Kucera, T. A. Henzinger, J. Nesetril, T. Vojnar, and D. Antos, Eds., <i>Mathematical and Engineering Methods in Computer Science</i>, vol. 7721. Springer, 2013, pp. 1–228.","mla":"Kucera, Antonin, et al., editors. <i>Mathematical and Engineering Methods in Computer Science</i>. Vol. 7721, Springer, 2013, pp. 1–228, doi:<a href=\"https://doi.org/10.1007/978-3-642-36046-6\">10.1007/978-3-642-36046-6</a>."},"doi":"10.1007/978-3-642-36046-6","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2019-08-02T12:37:55Z","acknowledgement":"Red Hat Czech Republic, Y Soft"},{"month":"05","article_number":"17","date_published":"2013-05-01T00:00:00Z","_id":"10898","date_created":"2022-03-21T07:33:22Z","abstract":[{"lang":"eng","text":"A prominent remedy to multicore scalability issues in concurrent data structure implementations is to relax the sequential specification of the data structure. We present distributed queues (DQ), a new family of relaxed concurrent queue implementations. DQs implement relaxed queues with linearizable emptiness check and either configurable or bounded out-of-order behavior or pool behavior. Our experiments show that DQs outperform and outscale in micro- and macrobenchmarks all strict and relaxed queue as well as pool implementations that we considered."}],"article_processing_charge":"No","issue":"5","publication":"Proceedings of the ACM International Conference on Computing Frontiers - CF '13","department":[{"_id":"ToHe"}],"quality_controlled":"1","status":"public","publisher":"ACM Press","publication_status":"published","day":"01","author":[{"full_name":"Haas, Andreas","first_name":"Andreas","last_name":"Haas"},{"last_name":"Lippautz","first_name":"Michael","full_name":"Lippautz, Michael"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"},{"last_name":"Payer","first_name":"Hannes","full_name":"Payer, Hannes"},{"first_name":"Ana","full_name":"Sokolova, Ana","last_name":"Sokolova"},{"first_name":"Christoph M.","full_name":"Kirsch, Christoph M.","last_name":"Kirsch"},{"id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","last_name":"Sezgin","full_name":"Sezgin, Ali","first_name":"Ali"}],"type":"conference","year":"2013","oa_version":"None","citation":{"short":"A. Haas, M. Lippautz, T.A. Henzinger, H. Payer, A. Sokolova, C.M. Kirsch, A. Sezgin, in:, Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, ACM Press, 2013.","apa":"Haas, A., Lippautz, M., Henzinger, T. A., Payer, H., Sokolova, A., Kirsch, C. M., &#38; Sezgin, A. (2013). Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. In <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>. Ischia, Italy: ACM Press. <a href=\"https://doi.org/10.1145/2482767.2482789\">https://doi.org/10.1145/2482767.2482789</a>","ama":"Haas A, Lippautz M, Henzinger TA, et al. Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. In: <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>. ACM Press; 2013. doi:<a href=\"https://doi.org/10.1145/2482767.2482789\">10.1145/2482767.2482789</a>","ista":"Haas A, Lippautz M, Henzinger TA, Payer H, Sokolova A, Kirsch CM, Sezgin A. 2013. Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. Proceedings of the ACM International Conference on Computing Frontiers - CF ’13. CF: Conference on Computing Frontiers, 17.","ieee":"A. Haas <i>et al.</i>, “Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation,” in <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>, Ischia, Italy, 2013, no. 5.","chicago":"Haas, Andreas, Michael Lippautz, Thomas A Henzinger, Hannes Payer, Ana Sokolova, Christoph M. Kirsch, and Ali Sezgin. “Distributed Queues in Shared Memory: Multicore Performance and Scalability through Quantitative Relaxation.” In <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>. ACM Press, 2013. <a href=\"https://doi.org/10.1145/2482767.2482789\">https://doi.org/10.1145/2482767.2482789</a>.","mla":"Haas, Andreas, et al. “Distributed Queues in Shared Memory: Multicore Performance and Scalability through Quantitative Relaxation.” <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>, no. 5, 17, ACM Press, 2013, doi:<a href=\"https://doi.org/10.1145/2482767.2482789\">10.1145/2482767.2482789</a>."},"title":"Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation","conference":{"end_date":"2013-05-16","start_date":"2013-05-14","name":"CF: Conference on Computing Frontiers","location":"Ischia, Italy"},"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2022-06-21T08:01:19Z","publication_identifier":{"isbn":["978-145032053-5"]},"doi":"10.1145/2482767.2482789"},{"acknowledgement":" and an Elise Richter Fellowship (Austrian Science Fund V00125). ","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"}],"related_material":{"record":[{"status":"deleted","id":"10901","relation":"later_version"}]},"doi":"10.1145/2429069.2429109","ddc":["000","004"],"language":[{"iso":"eng"}],"conference":{"location":"Rome, Italy","name":"POPL: Principles of Programming Languages","end_date":"2013-01-25","start_date":"2013-01-23"},"title":"Quantitative relaxation of concurrent data structures","ec_funded":1,"citation":{"apa":"Henzinger, T. A., Kirsch, C., Payer, H., Sezgin, A., &#38; Sokolova, A. (2013). Quantitative relaxation of concurrent data structures. In <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i> (pp. 317–328). Rome, Italy: ACM. <a href=\"https://doi.org/10.1145/2429069.2429109\">https://doi.org/10.1145/2429069.2429109</a>","ama":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. Quantitative relaxation of concurrent data structures. In: <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>. ACM; 2013:317-328. doi:<a href=\"https://doi.org/10.1145/2429069.2429109\">10.1145/2429069.2429109</a>","short":"T.A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, A. Sokolova, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–328.","mla":"Henzinger, Thomas A., et al. “Quantitative Relaxation of Concurrent Data Structures.” <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, ACM, 2013, pp. 317–28, doi:<a href=\"https://doi.org/10.1145/2429069.2429109\">10.1145/2429069.2429109</a>.","ieee":"T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative relaxation of concurrent data structures,” in <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i>, Rome, Italy, 2013, pp. 317–328.","ista":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. 2013. Quantitative relaxation of concurrent data structures. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 317–328.","chicago":"Henzinger, Thomas A, Christoph Kirsch, Hannes Payer, Ali Sezgin, and Ana Sokolova. “Quantitative Relaxation of Concurrent Data Structures.” In <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, 317–28. ACM, 2013. <a href=\"https://doi.org/10.1145/2429069.2429109\">https://doi.org/10.1145/2429069.2429109</a>."},"type":"conference","author":[{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"last_name":"Kirsch","full_name":"Kirsch, Christoph","first_name":"Christoph"},{"last_name":"Payer","first_name":"Hannes","full_name":"Payer, Hannes"},{"last_name":"Sezgin","first_name":"Ali","full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sokolova","first_name":"Ana","full_name":"Sokolova, Ana"}],"day":"01","publisher":"ACM","status":"public","quality_controlled":"1","department":[{"_id":"ToHe"}],"publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","page":"317 - 328","date_created":"2018-12-11T11:56:11Z","month":"01","publication_identifier":{"isbn":["978-1-4503-1832-7"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-21T16:06:49Z","scopus_import":1,"oa_version":"Submitted Version","year":"2013","has_accepted_license":"1","publist_id":"4801","oa":1,"publication_status":"published","pubrep_id":"198","file_date_updated":"2020-07-14T12:45:31Z","_id":"2181","date_published":"2013-01-01T00:00:00Z","abstract":[{"text":"There is a trade-off between performance and correctness in implementing concurrent data structures. Better performance may be achieved at the expense of relaxing correctness, by redefining the semantics of data structures. We address such a redefinition of data structure semantics and present a systematic and formal framework for obtaining new data structures by quantitatively relaxing existing ones. We view a data structure as a sequential specification S containing all &quot;legal&quot; sequences over an alphabet of method calls. Relaxing the data structure corresponds to defining a distance from any sequence over the alphabet to the sequential specification: the k-relaxed sequential specification contains all sequences over the alphabet within distance k from the original specification. In contrast to other existing work, our relaxations are semantic (distance in terms of data structure states). As an instantiation of our framework, we present two simple yet generic relaxation schemes, called out-of-order and stuttering relaxation, along with several ways of computing distances. We show that the out-of-order relaxation, when further instantiated to stacks, queues, and priority queues, amounts to tolerating bounded out-of-order behavior, which cannot be captured by a purely syntactic relaxation (distance in terms of sequence manipulation, e.g. edit distance). We give concurrent implementations of relaxed data structures and demonstrate that bounded relaxations provide the means for trading correctness for performance in a controlled way. The relaxations are monotonic which further highlights the trade-off: increasing k increases the number of permitted sequences, which as we demonstrate can lead to better performance. Finally, since a relaxed stack or queue also implements a pool, we actually have new concurrent pool implementations that outperform the state-of-the-art ones.","lang":"eng"}],"file":[{"creator":"system","file_size":294689,"file_name":"IST-2014-198-v1+1_popl128-henzinger-clean.pdf","checksum":"adf465e70948f4e80e48057524516456","access_level":"open_access","date_updated":"2020-07-14T12:45:31Z","file_id":"5086","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:14:33Z"}]},{"page":"115 - 128","month":"01","_id":"2182","date_created":"2018-12-11T11:56:11Z","date_published":"2013-01-01T00:00:00Z","abstract":[{"lang":"eng","text":"We propose a general framework for abstraction with respect to quantitative properties, such as worst-case execution time, or power consumption. Our framework provides a systematic way for counter-example guided abstraction refinement for quantitative properties. The salient aspect of the framework is that it allows anytime verification, that is, verification algorithms that can be stopped at any time (for example, due to exhaustion of memory), and report approximations that improve monotonically when the algorithms are given more time. We instantiate the framework with a number of quantitative abstractions and refinement schemes, which differ in terms of how much quantitative information they keep from the original system. We introduce both state-based and trace-based quantitative abstractions, and we describe conditions that define classes of quantitative properties for which the abstractions provide over-approximations. We give algorithms for evaluating the quantitative properties on the abstract systems. We present algorithms for counter-example based refinements for quantitative properties for both state-based and segment-based abstractions. We perform a case study on worst-case execution time of executables to evaluate the anytime verification aspect and the quantitative abstractions we proposed."}],"publication_status":"published","publisher":"ACM","quality_controlled":"1","department":[{"_id":"ToHe"}],"publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","status":"public","ec_funded":1,"citation":{"apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2013). Quantitative abstraction refinement. In <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i> (pp. 115–128). Rome, Italy: ACM. <a href=\"https://doi.org/10.1145/2429069.2429085\">https://doi.org/10.1145/2429069.2429085</a>","ama":"Cerny P, Henzinger TA, Radhakrishna A. Quantitative abstraction refinement. In: <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>. ACM; 2013:115-128. doi:<a href=\"https://doi.org/10.1145/2429069.2429085\">10.1145/2429069.2429085</a>","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–128.","mla":"Cerny, Pavol, et al. “Quantitative Abstraction Refinement.” <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, ACM, 2013, pp. 115–28, doi:<a href=\"https://doi.org/10.1145/2429069.2429085\">10.1145/2429069.2429085</a>.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative abstraction refinement,” in <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i>, Rome, Italy, 2013, pp. 115–128.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2013. Quantitative abstraction refinement. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 115–128.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Abstraction Refinement.” In <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, 115–28. ACM, 2013. <a href=\"https://doi.org/10.1145/2429069.2429085\">https://doi.org/10.1145/2429069.2429085</a>."},"conference":{"location":"Rome, Italy","name":"POPL: Principles of Programming Languages","end_date":"2013-01-25","start_date":"2013-07-23"},"title":"Quantitative abstraction refinement","day":"01","publist_id":"4800","oa_version":"None","year":"2013","author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","full_name":"Cerny, Pavol","first_name":"Pavol"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"first_name":"Arjun","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"type":"conference","project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"}],"date_updated":"2021-01-12T06:55:50Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"doi":"10.1145/2429069.2429085"},{"publist_id":"4724","year":"2013","oa_version":"Submitted Version","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2020-08-11T10:09:42Z","scopus_import":1,"article_processing_charge":"No","file":[{"creator":"dernst","file_size":279206,"file_name":"2013_LPAR_Blanc.pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:34Z","checksum":"9cebaafca032e6769d273f393305c705","relation":"main_file","file_id":"7858","content_type":"application/pdf","date_created":"2020-05-15T11:10:40Z"}],"_id":"2237","date_published":"2013-01-14T00:00:00Z","abstract":[{"text":"We describe new extensions of the Vampire theorem prover for computing tree interpolants. These extensions generalize Craig interpolation in Vampire, and can also be used to derive sequence interpolants. We evaluated our implementation on a large number of examples over the theory of linear integer arithmetic and integer-indexed arrays, with and without quantifiers. When compared to other methods, our experiments show that some examples could only be solved by our implementation.","lang":"eng"}],"publication_status":"published","oa":1,"file_date_updated":"2020-07-14T12:45:34Z","volume":8312,"citation":{"apa":"Blanc, R., Gupta, A., Kovács, L., &#38; Kragl, B. (2013). Tree interpolation in Vampire. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">https://doi.org/10.1007/978-3-642-45221-5_13</a>","ama":"Blanc R, Gupta A, Kovács L, Kragl B. Tree interpolation in Vampire. 2013;8312:173-181. doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">10.1007/978-3-642-45221-5_13</a>","short":"R. Blanc, A. Gupta, L. Kovács, B. Kragl, 8312 (2013) 173–181.","mla":"Blanc, Régis, et al. <i>Tree Interpolation in Vampire</i>. Vol. 8312, Springer, 2013, pp. 173–81, doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">10.1007/978-3-642-45221-5_13</a>.","ieee":"R. Blanc, A. Gupta, L. Kovács, and B. Kragl, “Tree interpolation in Vampire,” vol. 8312. Springer, pp. 173–181, 2013.","ista":"Blanc R, Gupta A, Kovács L, Kragl B. 2013. Tree interpolation in Vampire. 8312, 173–181.","chicago":"Blanc, Régis, Ashutosh Gupta, Laura Kovács, and Bernhard Kragl. “Tree Interpolation in Vampire.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">https://doi.org/10.1007/978-3-642-45221-5_13</a>."},"conference":{"name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","start_date":"2013-12-14","end_date":"2013-12-19","location":"Stellenbosch, South Africa"},"title":"Tree interpolation in Vampire","day":"14","alternative_title":["LNCS"],"author":[{"full_name":"Blanc, Régis","first_name":"Régis","last_name":"Blanc"},{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh","full_name":"Gupta, Ashutosh","last_name":"Gupta"},{"full_name":"Kovács, Laura","first_name":"Laura","last_name":"Kovács"},{"orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87","full_name":"Kragl, Bernhard","first_name":"Bernhard","last_name":"Kragl"}],"type":"conference","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"ddc":["000"],"doi":"10.1007/978-3-642-45221-5_13","page":"173 - 181","month":"01","series_title":"Lecture Notes in Computer Science","date_created":"2018-12-11T11:56:29Z","publisher":"Springer","department":[{"_id":"ToHe"}],"quality_controlled":"1","intvolume":"      8312","status":"public"},{"date_created":"2018-12-11T11:56:32Z","series_title":"Leibniz International Proceedings in Informatics","month":"09","page":"563 - 577","status":"public","intvolume":"        23","quality_controlled":"1","department":[{"_id":"ToHe"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"last_name":"Michaliszyn","first_name":"Jakub","full_name":"Michaliszyn, Jakub"},{"last_name":"Otop","first_name":"Jan","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"type":"conference","alternative_title":["LIPIcs"],"day":"01","title":"Elementary modal logics over transitive structures","conference":{"location":"Torino, Italy","start_date":"2013-09-02","end_date":"2013-09-05","name":"CSL: Computer Science Logic"},"citation":{"apa":"Michaliszyn, J., &#38; Otop, J. (2013). Elementary modal logics over transitive structures. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">https://doi.org/10.4230/LIPIcs.CSL.2013.563</a>","ama":"Michaliszyn J, Otop J. Elementary modal logics over transitive structures. 2013;23:563-577. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">10.4230/LIPIcs.CSL.2013.563</a>","short":"J. Michaliszyn, J. Otop, 23 (2013) 563–577.","mla":"Michaliszyn, Jakub, and Jan Otop. <i>Elementary Modal Logics over Transitive Structures</i>. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 563–77, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">10.4230/LIPIcs.CSL.2013.563</a>.","ista":"Michaliszyn J, Otop J. 2013. Elementary modal logics over transitive structures. 23, 563–577.","ieee":"J. Michaliszyn and J. Otop, “Elementary modal logics over transitive structures,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 563–577, 2013.","chicago":"Michaliszyn, Jakub, and Jan Otop. “Elementary Modal Logics over Transitive Structures.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">https://doi.org/10.4230/LIPIcs.CSL.2013.563</a>."},"ec_funded":1,"doi":"10.4230/LIPIcs.CSL.2013.563","ddc":["000","004"],"language":[{"iso":"eng"}],"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"}],"date_published":"2013-09-01T00:00:00Z","_id":"2243","abstract":[{"lang":"eng","text":"We show that modal logic over universally first-order definable classes of transitive frames is decidable. More precisely, let K be an arbitrary class of transitive Kripke frames definable by a universal first-order sentence. We show that the global and finite global satisfiability problems of modal logic over K are decidable in NP, regardless of choice of K. We also show that the local satisfiability and the finite local satisfiability problems of modal logic over K are decidable in NEXPTIME."}],"file":[{"file_size":454915,"creator":"system","file_name":"IST-2016-136-v1+2_39.pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:34Z","checksum":"e0732e73a8b1e39483df7717d53e3e35","file_id":"4929","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:12:11Z"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"pubrep_id":"136","volume":23,"file_date_updated":"2020-07-14T12:45:34Z","oa":1,"publication_status":"published","oa_version":"Published Version","has_accepted_license":"1","year":"2013","publist_id":"4708","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2020-08-11T10:09:42Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2019-08-02T12:37:44Z","publication_identifier":{"isbn":["978-3-642-40707-9"]},"doi":"10.1007/978-3-642-40708-6","citation":{"ieee":"A. Gupta and T. A. Henzinger, Eds., <i>Computational Methods in Systems Biology</i>, vol. 8130. Springer, 2013.","ista":"Gupta A, Henzinger TA eds. 2013. Computational Methods in Systems Biology, Springer,p.","chicago":"Gupta, Ashutosh, and Thomas A Henzinger, eds. <i>Computational Methods in Systems Biology</i>. Vol. 8130. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40708-6\">https://doi.org/10.1007/978-3-642-40708-6</a>.","mla":"Gupta, Ashutosh, and Thomas A. Henzinger, editors. <i>Computational Methods in Systems Biology</i>. Vol. 8130, Springer, 2013, doi:<a href=\"https://doi.org/10.1007/978-3-642-40708-6\">10.1007/978-3-642-40708-6</a>.","short":"A. Gupta, T.A. Henzinger, eds., Computational Methods in Systems Biology, Springer, 2013.","apa":"Gupta, A., &#38; Henzinger, T. A. (Eds.). (2013). <i>Computational Methods in Systems Biology</i> (Vol. 8130). Presented at the CMSB: Computational Methods in Systems Biology, Klosterneuburg, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-40708-6\">https://doi.org/10.1007/978-3-642-40708-6</a>","ama":"Gupta A, Henzinger TA, eds. <i>Computational Methods in Systems Biology</i>. Vol 8130. Springer; 2013. doi:<a href=\"https://doi.org/10.1007/978-3-642-40708-6\">10.1007/978-3-642-40708-6</a>"},"title":"Computational Methods in Systems Biology","editor":[{"last_name":"Gupta","full_name":"Gupta, Ashutosh","first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"conference":{"end_date":"2013-09-24","start_date":"2013-09-22","name":"CMSB: Computational Methods in Systems Biology","location":"Klosterneuburg, Austria"},"publist_id":"4643","day":"01","type":"conference_editor","alternative_title":["LNCS"],"oa_version":"None","year":"2013","publisher":"Springer","publication_status":"published","quality_controlled":"1","department":[{"_id":"ToHe"}],"intvolume":"      8130","status":"public","volume":8130,"month":"07","_id":"2288","date_published":"2013-07-01T00:00:00Z","abstract":[{"text":"This book constitutes the proceedings of the 11th International Conference on Computational Methods in Systems Biology, CMSB 2013, held in Klosterneuburg, Austria, in September 2013. The 15 regular papers included in this volume were carefully reviewed and selected from 27 submissions. They deal with computational models for all levels, from molecular and cellular, to organs and entire organisms.","lang":"eng"}],"date_created":"2018-12-11T11:56:47Z"},{"publist_id":"4642","has_accepted_license":"1","year":"2013","oa_version":"Published Version","scopus_import":1,"date_updated":"2021-01-12T06:56:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"4","file":[{"content_type":"application/pdf","file_id":"5308","relation":"main_file","date_created":"2018-12-12T10:17:51Z","file_name":"IST-2016-626-v1+1_s00450-013-0251-7.pdf","creator":"system","file_size":570361,"checksum":"f117a00f9f046165bfa95595681e08a0","date_updated":"2020-07-14T12:45:37Z","access_level":"open_access"}],"date_published":"2013-10-05T00:00:00Z","_id":"2289","abstract":[{"lang":"eng","text":"Formal verification aims to improve the quality of software by detecting errors before they do harm. At the basis of formal verification is the logical notion of correctness, which purports to capture whether or not a program behaves as desired. We suggest that the boolean partition of software into correct and incorrect programs falls short of the practical need to assess the behavior of software in a more nuanced fashion against multiple criteria. We therefore propose to introduce quantitative fitness measures for programs, specifically for measuring the function, performance, and robustness of reactive programs such as concurrent processes. This article describes the goals of the ERC Advanced Investigator Project QUAREM. The project aims to build and evaluate a theory of quantitative fitness measures for reactive models. Such a theory must strive to obtain quantitative generalizations of the paradigms that have been success stories in qualitative reactive modeling, such as compositionality, property-preserving abstraction and abstraction refinement, model checking, and synthesis. The theory will be evaluated not only in the context of software and hardware engineering, but also in the context of systems biology. In particular, we will use the quantitative reactive models and fitness measures developed in this project for testing hypotheses about the mechanisms behind data from biological experiments."}],"publication_status":"published","oa":1,"file_date_updated":"2020-07-14T12:45:37Z","pubrep_id":"626","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"volume":28,"citation":{"mla":"Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” <i>Computer Science Research and Development</i>, vol. 28, no. 4, Springer, 2013, pp. 331–44, doi:<a href=\"https://doi.org/10.1007/s00450-013-0251-7\">10.1007/s00450-013-0251-7</a>.","chicago":"Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” <i>Computer Science Research and Development</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s00450-013-0251-7\">https://doi.org/10.1007/s00450-013-0251-7</a>.","ieee":"T. A. Henzinger, “Quantitative reactive modeling and verification,” <i>Computer Science Research and Development</i>, vol. 28, no. 4. Springer, pp. 331–344, 2013.","ista":"Henzinger TA. 2013. Quantitative reactive modeling and verification. Computer Science Research and Development. 28(4), 331–344.","ama":"Henzinger TA. Quantitative reactive modeling and verification. <i>Computer Science Research and Development</i>. 2013;28(4):331-344. doi:<a href=\"https://doi.org/10.1007/s00450-013-0251-7\">10.1007/s00450-013-0251-7</a>","apa":"Henzinger, T. A. (2013). Quantitative reactive modeling and verification. <i>Computer Science Research and Development</i>. Springer. <a href=\"https://doi.org/10.1007/s00450-013-0251-7\">https://doi.org/10.1007/s00450-013-0251-7</a>","short":"T.A. Henzinger, Computer Science Research and Development 28 (2013) 331–344."},"ec_funded":1,"title":"Quantitative reactive modeling and verification","day":"05","type":"journal_article","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"}],"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"}],"language":[{"iso":"eng"}],"ddc":["000"],"doi":"10.1007/s00450-013-0251-7","page":"331 - 344","month":"10","date_created":"2018-12-11T11:56:47Z","publisher":"Springer","publication":"Computer Science Research and Development","department":[{"_id":"ToHe"}],"quality_controlled":"1","status":"public","intvolume":"        28"},{"date_created":"2018-12-11T11:56:50Z","month":"01","page":"150 - 171","intvolume":"      7935","status":"public","quality_controlled":"1","department":[{"_id":"ToHe"}],"publisher":"Springer","alternative_title":["LNCS"],"type":"conference","author":[{"id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","last_name":"Dragoi","first_name":"Cezara","full_name":"Dragoi, Cezara"},{"first_name":"Constantin","full_name":"Enea, Constantin","last_name":"Enea"},{"first_name":"Mihaela","full_name":"Sighireanu, Mihaela","last_name":"Sighireanu"}],"day":"01","conference":{"location":"Seattle, WA, United States","end_date":"2013-06-22","start_date":"2013-06-20","name":"SAS: Static Analysis Symposium"},"title":"Local shape analysis for overlaid data structures","ec_funded":1,"citation":{"ama":"Dragoi C, Enea C, Sighireanu M. Local shape analysis for overlaid data structures. In: Vol 7935. Springer; 2013:150-171. doi:<a href=\"https://doi.org/10.1007/978-3-642-38856-9_10\">10.1007/978-3-642-38856-9_10</a>","apa":"Dragoi, C., Enea, C., &#38; Sighireanu, M. (2013). Local shape analysis for overlaid data structures (Vol. 7935, pp. 150–171). Presented at the SAS: Static Analysis Symposium, Seattle, WA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-642-38856-9_10\">https://doi.org/10.1007/978-3-642-38856-9_10</a>","short":"C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2013, pp. 150–171.","mla":"Dragoi, Cezara, et al. <i>Local Shape Analysis for Overlaid Data Structures</i>. Vol. 7935, Springer, 2013, pp. 150–71, doi:<a href=\"https://doi.org/10.1007/978-3-642-38856-9_10\">10.1007/978-3-642-38856-9_10</a>.","chicago":"Dragoi, Cezara, Constantin Enea, and Mihaela Sighireanu. “Local Shape Analysis for Overlaid Data Structures,” 7935:150–71. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-38856-9_10\">https://doi.org/10.1007/978-3-642-38856-9_10</a>.","ista":"Dragoi C, Enea C, Sighireanu M. 2013. Local shape analysis for overlaid data structures. SAS: Static Analysis Symposium, LNCS, vol. 7935, 150–171.","ieee":"C. Dragoi, C. Enea, and M. Sighireanu, “Local shape analysis for overlaid data structures,” presented at the SAS: Static Analysis Symposium, Seattle, WA, United States, 2013, vol. 7935, pp. 150–171."},"ddc":["000","004"],"doi":"10.1007/978-3-642-38856-9_10","language":[{"iso":"eng"}],"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"abstract":[{"lang":"eng","text":"We present a shape analysis for programs that manipulate overlaid data structures which share sets of objects. The abstract domain contains Separation Logic formulas that (1) combine a per-object separating conjunction with a per-field separating conjunction and (2) constrain a set of variables interpreted as sets of objects. The definition of the abstract domain operators is based on a notion of homomorphism between formulas, viewed as graphs, used recently to define optimal decision procedures for fragments of the Separation Logic. Based on a Frame Rule that supports the two versions of the separating conjunction, the analysis is able to reason in a modular manner about non-overlaid data structures and then, compose information only at a few program points, e.g., procedure returns. We have implemented this analysis in a prototype tool and applied it on several interesting case studies that manipulate overlaid and nested linked lists.\r\n"}],"_id":"2298","date_published":"2013-01-01T00:00:00Z","file":[{"checksum":"907edd33a5892e3af093365f1fd57ed7","access_level":"open_access","date_updated":"2020-07-14T12:45:37Z","creator":"system","file_size":299004,"file_name":"IST-2014-196-v1+1_sas13.pdf","date_created":"2018-12-12T10:10:36Z","file_id":"4824","relation":"main_file","content_type":"application/pdf"}],"volume":7935,"pubrep_id":"196","file_date_updated":"2020-07-14T12:45:37Z","oa":1,"publication_status":"published","year":"2013","has_accepted_license":"1","oa_version":"Submitted Version","publist_id":"4630","date_updated":"2021-01-12T06:56:36Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1},{"publication":"International Journal on Software Tools for Technology Transfer","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"quality_controlled":"1","status":"public","intvolume":"        15","publisher":"Springer","month":"10","date_created":"2018-12-11T11:56:51Z","page":"585 - 601","language":[{"iso":"eng"}],"ddc":["000"],"doi":"10.1007/s10009-011-0207-9","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"day":"01","type":"journal_article","author":[{"id":"5B547124-EB61-11E9-8887-89D9C04DBDF5","last_name":"Godhal","full_name":"Godhal, Yashdeep","first_name":"Yashdeep"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"}],"citation":{"mla":"Godhal, Yashdeep, et al. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” <i>International Journal on Software Tools for Technology Transfer</i>, vol. 15, no. 5–6, Springer, 2013, pp. 585–601, doi:<a href=\"https://doi.org/10.1007/s10009-011-0207-9\">10.1007/s10009-011-0207-9</a>.","ieee":"Y. Godhal, K. Chatterjee, and T. A. Henzinger, “Synthesis of AMBA AHB from formal specification: A case study,” <i>International Journal on Software Tools for Technology Transfer</i>, vol. 15, no. 5–6. Springer, pp. 585–601, 2013.","ista":"Godhal Y, Chatterjee K, Henzinger TA. 2013. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 15(5–6), 585–601.","chicago":"Godhal, Yashdeep, Krishnendu Chatterjee, and Thomas A Henzinger. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” <i>International Journal on Software Tools for Technology Transfer</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s10009-011-0207-9\">https://doi.org/10.1007/s10009-011-0207-9</a>.","apa":"Godhal, Y., Chatterjee, K., &#38; Henzinger, T. A. (2013). Synthesis of AMBA AHB from formal specification: A case study. <i>International Journal on Software Tools for Technology Transfer</i>. Springer. <a href=\"https://doi.org/10.1007/s10009-011-0207-9\">https://doi.org/10.1007/s10009-011-0207-9</a>","ama":"Godhal Y, Chatterjee K, Henzinger TA. Synthesis of AMBA AHB from formal specification: A case study. <i>International Journal on Software Tools for Technology Transfer</i>. 2013;15(5-6):585-601. doi:<a href=\"https://doi.org/10.1007/s10009-011-0207-9\">10.1007/s10009-011-0207-9</a>","short":"Y. Godhal, K. Chatterjee, T.A. Henzinger, International Journal on Software Tools for Technology Transfer 15 (2013) 585–601."},"title":"Synthesis of AMBA AHB from formal specification: A case study","file_date_updated":"2020-07-14T12:45:37Z","pubrep_id":"87","volume":15,"publication_status":"published","oa":1,"file":[{"file_size":277372,"creator":"system","file_name":"IST-2012-87-v1+1_Synthesis_of_AMBA_AHB_from_formal_specifications-_A_case_study.pdf","checksum":"57b06a732dd8d6349190dba6b5b0d33b","access_level":"open_access","date_updated":"2020-07-14T12:45:37Z","file_id":"4910","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:11:53Z"}],"date_published":"2013-10-01T00:00:00Z","_id":"2299","abstract":[{"text":"The standard hardware design flow involves: (a) design of an integrated circuit using a hardware description language, (b) extensive functional and formal verification, and (c) logical synthesis. However, the above-mentioned processes consume significant effort and time. An alternative approach is to use a formal specification language as a high-level hardware description language and synthesize hardware from formal specifications. Our work is a case study of the synthesis of the widely and industrially used AMBA AHB protocol from formal specifications. Bloem et al. presented the first formal specifications for the AMBA AHB Arbiter and synthesized the AHB Arbiter circuit. However, in the first formal specification some important assumptions were missing. Our contributions are as follows: (a) We present detailed formal specifications for the AHB Arbiter incorporating the missing details, and obtain significant improvements in the synthesis results (both with respect to the number of gates in the synthesized circuit and with respect to the time taken to synthesize the circuit), and (b) we present formal specifications to generate compact circuits for the remaining two main components of AMBA AHB, namely, AHB Master and AHB Slave. Thus with systematic description we are able to automatically and completely synthesize an important and widely used industrial protocol.","lang":"eng"}],"issue":"5-6","scopus_import":1,"date_updated":"2021-01-12T06:56:37Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4629","year":"2013","oa_version":"Submitted Version","has_accepted_license":"1"},{"status":"public","department":[{"_id":"ToHe"}],"quality_controlled":"1","publication":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","main_file_link":[{"url":"http://research.microsoft.com/pubs/191069/pldi212_desai.pdf"}],"publication_status":"published","publisher":"ACM","date_published":"2013-06-01T00:00:00Z","_id":"2301","date_created":"2018-12-11T11:56:52Z","abstract":[{"text":"We describe the design and implementation of P, a domain-specific language to write asynchronous event driven code. P allows the programmer to specify the system as a collection of interacting state machines, which communicate with each other using events. P unifies modeling and programming into one activity for the programmer. Not only can a P program be compiled into executable code, but it can also be tested using model checking techniques. P allows the programmer to specify the environment, used to &quot;close&quot; the system during testing, as nondeterministic ghost machines. Ghost machines are erased during compilation to executable code; a type system ensures that the erasure is semantics preserving. The P language is designed so that a P program can be checked for responsiveness-the ability to handle every event in a timely manner. By default, a machine needs to handle every event that arrives in every state. But handling every event in every state is impractical. The language provides a notion of deferred events where the programmer can annotate when she wants to delay processing an event. The default safety checker looks for presence of unhan-dled events. The language also provides default liveness checks that an event cannot be potentially deferred forever. P was used to implement and verify the core of the USB device driver stack that ships with Microsoft Windows 8. The resulting driver is more reliable and performs better than its prior incarnation (which did not use P); we have more confidence in the robustness of its design due to the language abstractions and verification provided by P.","lang":"eng"}],"month":"06","page":"321 - 331","doi":"10.1145/2491956.2462184","date_updated":"2021-01-12T06:56:38Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"}],"oa_version":"None","year":"2013","type":"conference","author":[{"first_name":"Ankush","full_name":"Desai, Ankush","last_name":"Desai"},{"first_name":"Vivek","full_name":"Gupta, Vivek","last_name":"Gupta"},{"last_name":"Jackson","full_name":"Jackson, Ethan","first_name":"Ethan"},{"full_name":"Qadeer, Shaz","first_name":"Shaz","last_name":"Qadeer"},{"first_name":"Sriram","full_name":"Rajamani, Sriram","last_name":"Rajamani"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","first_name":"Damien","last_name":"Zufferey"}],"publist_id":"4626","day":"01","conference":{"name":"PLDI: Programming Languages Design and Implementation","end_date":"2013-06-19","start_date":"2013-06-16","location":"Seattle, WA, United States"},"title":"P: Safe asynchronous event-driven programming","ec_funded":1,"citation":{"short":"A. Desai, V. Gupta, E. Jackson, S. Qadeer, S. Rajamani, D. Zufferey, in:, Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, 2013, pp. 321–331.","apa":"Desai, A., Gupta, V., Jackson, E., Qadeer, S., Rajamani, S., &#38; Zufferey, D. (2013). P: Safe asynchronous event-driven programming. In <i>Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation</i> (pp. 321–331). Seattle, WA, United States: ACM. <a href=\"https://doi.org/10.1145/2491956.2462184\">https://doi.org/10.1145/2491956.2462184</a>","ama":"Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. P: Safe asynchronous event-driven programming. In: <i>Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>. ACM; 2013:321-331. doi:<a href=\"https://doi.org/10.1145/2491956.2462184\">10.1145/2491956.2462184</a>","ista":"Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. 2013. P: Safe asynchronous event-driven programming. Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Languages Design and Implementation, 321–331.","ieee":"A. Desai, V. Gupta, E. Jackson, S. Qadeer, S. Rajamani, and D. Zufferey, “P: Safe asynchronous event-driven programming,” in <i>Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, Seattle, WA, United States, 2013, pp. 321–331.","chicago":"Desai, Ankush, Vivek Gupta, Ethan Jackson, Shaz Qadeer, Sriram Rajamani, and Damien Zufferey. “P: Safe Asynchronous Event-Driven Programming.” In <i>Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, 321–31. ACM, 2013. <a href=\"https://doi.org/10.1145/2491956.2462184\">https://doi.org/10.1145/2491956.2462184</a>.","mla":"Desai, Ankush, et al. “P: Safe Asynchronous Event-Driven Programming.” <i>Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, ACM, 2013, pp. 321–31, doi:<a href=\"https://doi.org/10.1145/2491956.2462184\">10.1145/2491956.2462184</a>."}},{"day":"01","type":"conference","author":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"first_name":"Jan","full_name":"Otop, Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"alternative_title":["LNCS"],"citation":{"short":"T.A. Henzinger, J. Otop, 8052 (2013) 273–287.","apa":"Henzinger, T. A., &#38; Otop, J. (2013). From model checking to model measuring. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Springer. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_20\">https://doi.org/10.1007/978-3-642-40184-8_20</a>","ama":"Henzinger TA, Otop J. From model checking to model measuring. 2013;8052:273-287. doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_20\">10.1007/978-3-642-40184-8_20</a>","ista":"Henzinger TA, Otop J. 2013. From model checking to model measuring. 8052, 273–287.","ieee":"T. A. Henzinger and J. Otop, “From model checking to model measuring,” vol. 8052. Springer, pp. 273–287, 2013.","chicago":"Henzinger, Thomas A, and Jan Otop. “From Model Checking to Model Measuring.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_20\">https://doi.org/10.1007/978-3-642-40184-8_20</a>.","mla":"Henzinger, Thomas A., and Jan Otop. <i>From Model Checking to Model Measuring</i>. Vol. 8052, Springer, 2013, pp. 273–87, doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_20\">10.1007/978-3-642-40184-8_20</a>."},"title":"From model checking to model measuring","conference":{"end_date":"2013-08-30","start_date":"2013-08-27","name":"CONCUR: Concurrency Theory","location":"Buenos Aires, Argentina"},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-40184-8_20","ddc":["005","000"],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5417"}]},"month":"08","series_title":"Lecture Notes in Computer Science","date_created":"2018-12-11T11:57:00Z","page":"273 - 287","quality_controlled":"1","department":[{"_id":"ToHe"}],"intvolume":"      8052","status":"public","publisher":"Springer","publist_id":"4599","year":"2013","has_accepted_license":"1","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:25:26Z","file":[{"date_created":"2018-12-12T10:17:45Z","content_type":"application/pdf","file_id":"5301","relation":"main_file","checksum":"4c04695c4bfdf2119cd4f5d1babc3e8a","date_updated":"2020-07-14T12:45:38Z","access_level":"open_access","file_name":"IST-2013-129-v1+1_concur.pdf","creator":"system","file_size":378587}],"date_published":"2013-08-01T00:00:00Z","_id":"2327","abstract":[{"text":"We define the model-measuring problem: given a model M and specification φ, what is the maximal distance ρ such that all models M′ within distance ρ from M satisfy (or violate) φ. The model measuring problem presupposes a distance function on models. We concentrate on automatic distance functions, which are defined by weighted automata. The model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, quantitative model-checking problems that measure the degree of satisfaction of a specification, and robustness problems that measure how much a model can be perturbed without violating the specification. We show that for automatic distance functions, and ω-regular linear-time and branching-time specifications, the model-measuring problem can be solved. We use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for standard word and tree automata by the optimal-weight question for the weighted versions of these automata. We consider weighted automata that accumulate weights by maximizing, summing, discounting, and limit averaging. We give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications.","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:38Z","pubrep_id":"129","volume":8052,"publication_status":"published","oa":1},{"scopus_import":1,"date_updated":"2023-02-23T10:16:27Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","year":"2013","has_accepted_license":"1","publist_id":"4598","oa":1,"publication_status":"published","pubrep_id":"197","volume":8052,"file_date_updated":"2020-07-14T12:45:39Z","abstract":[{"lang":"eng","text":"Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on identifying the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates.\r\nIn response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof."}],"_id":"2328","date_published":"2013-08-01T00:00:00Z","file":[{"relation":"main_file","file_id":"4721","content_type":"application/pdf","date_created":"2018-12-12T10:08:58Z","creator":"system","file_size":337059,"file_name":"IST-2014-197-v1+1_main-queue-verification.pdf","checksum":"bdbb520de91751fe0136309ad4ef67e4","access_level":"open_access","date_updated":"2020-07-14T12:45:39Z"}],"project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"related_material":{"record":[{"status":"public","id":"1832","relation":"later_version"}]},"ddc":["000","004"],"doi":"10.1007/978-3-642-40184-8_18","language":[{"iso":"eng"}],"title":"Aspect-oriented linearizability proofs","conference":{"start_date":"2013-08-27","end_date":"2013-08-30","name":"CONCUR: Concurrency Theory","location":"Buenos Aires, Argentina"},"citation":{"ama":"Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. 2013;8052:242-256. doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">10.1007/978-3-642-40184-8_18</a>","apa":"Henzinger, T. A., Sezgin, A., &#38; Vafeiadis, V. (2013). Aspect-oriented linearizability proofs. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">https://doi.org/10.1007/978-3-642-40184-8_18</a>","short":"T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256.","mla":"Henzinger, Thomas A., et al. <i>Aspect-Oriented Linearizability Proofs</i>. Vol. 8052, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 242–56, doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">10.1007/978-3-642-40184-8_18</a>.","chicago":"Henzinger, Thomas A, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.” Lecture Notes in Computer Science. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">https://doi.org/10.1007/978-3-642-40184-8_18</a>.","ista":"Henzinger TA, Sezgin A, Vafeiadis V. 2013. Aspect-oriented linearizability proofs. 8052, 242–256.","ieee":"T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” vol. 8052. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 242–256, 2013."},"ec_funded":1,"type":"conference","author":[{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"last_name":"Sezgin","first_name":"Ali","full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Vafeiadis, Viktor","first_name":"Viktor","last_name":"Vafeiadis"}],"alternative_title":["LNCS"],"day":"01","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","status":"public","intvolume":"      8052","department":[{"_id":"ToHe"}],"quality_controlled":"1","page":"242 - 256","date_created":"2018-12-11T11:57:01Z","series_title":"Lecture Notes in Computer Science","month":"08"},{"type":"technical_report","author":[{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ali","full_name":"Sezgin, Ali","last_name":"Sezgin","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version","has_accepted_license":"1","alternative_title":["IST Austria Technical Report"],"year":"2013","day":"12","title":"How free is your linearizable concurrent data structure?","citation":{"chicago":"Henzinger, Thomas A, and Ali Sezgin. <i>How Free Is Your Linearizable Concurrent Data Structure?</i> IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-123-v1-1\">https://doi.org/10.15479/AT:IST-2013-123-v1-1</a>.","ieee":"T. A. Henzinger and A. Sezgin, <i>How free is your linearizable concurrent data structure?</i> IST Austria, 2013.","ista":"Henzinger TA, Sezgin A. 2013. How free is your linearizable concurrent data structure?, IST Austria, 16p.","mla":"Henzinger, Thomas A., and Ali Sezgin. <i>How Free Is Your Linearizable Concurrent Data Structure?</i> IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-123-v1-1\">10.15479/AT:IST-2013-123-v1-1</a>.","short":"T.A. Henzinger, A. Sezgin, How Free Is Your Linearizable Concurrent Data Structure?, IST Austria, 2013.","ama":"Henzinger TA, Sezgin A. <i>How Free Is Your Linearizable Concurrent Data Structure?</i> IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-123-v1-1\">10.15479/AT:IST-2013-123-v1-1</a>","apa":"Henzinger, T. A., &#38; Sezgin, A. (2013). <i>How free is your linearizable concurrent data structure?</i> IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-123-v1-1\">https://doi.org/10.15479/AT:IST-2013-123-v1-1</a>"},"publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2013-123-v1-1","ddc":["000","004"],"language":[{"iso":"eng"}],"date_updated":"2020-07-14T23:04:47Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5402","date_created":"2018-12-12T11:39:07Z","abstract":[{"text":"Linearizability requires that the outcome of calls by competing threads to a concurrent data structure is the same as some sequential execution where each thread has exclusive access to the data structure. In an ordered data structure, such as a queue or a stack, linearizability is ensured by requiring threads commit in the order dictated by the sequential semantics of the data structure; e.g., in a concurrent queue implementation a dequeue can only remove the oldest element. \r\nIn this paper, we investigate the impact of this strict ordering, by comparing what linearizability allows to what existing implementations do. We first give an operational definition for linearizability which allows us to build the most general linearizable implementation as a transition system for any given sequential specification. We then use this operational definition to categorize linearizable implementations based on whether they are bound or free. In a bound implementation, whenever all threads observe the same logical state, the updates to the logical state and the temporal order of commits coincide. All existing queue implementations we know of are bound. We then proceed to present, to the best of our knowledge, the first ever free queue implementation. Our experiments show that free implementations have the potential for better performance by suffering less from contention.","lang":"eng"}],"date_published":"2013-06-12T00:00:00Z","month":"06","file":[{"relation":"main_file","file_id":"5480","content_type":"application/pdf","date_created":"2018-12-12T11:53:19Z","file_size":249790,"creator":"system","file_name":"IST-2013-123-v1+1_main-concur2013.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:45Z","checksum":"ce580605ae9756a8c99d7b403ebb8eed"}],"page":"16","status":"public","pubrep_id":"123","file_date_updated":"2020-07-14T12:46:45Z","department":[{"_id":"ToHe"}],"oa":1,"publication_status":"published","publisher":"IST Austria"}]