[{"author":[{"last_name":"Boker","first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi"},{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"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":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"}],"external_id":{"isi":["000345570700002"]},"publication_status":"published","article_number":"27","pubrep_id":"192","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"volume":15,"abstract":[{"text":"Recently, there has been an effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions. At the heart of quantitative objectives lies the accumulation of values along a computation. It is often the accumulated sum, as with energy objectives, or the accumulated average, as with mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric (or Boolean) variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point in time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire infinite computation. We study the border of decidability for such quantitative extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities with both prefix-accumulation assertions, or extending LTL with both path-accumulation assertions, results in temporal logics whose model-checking problem is decidable. Moreover, the prefix-accumulation assertions may be generalized with &quot;controlled accumulation,&quot; allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that this branching-time logic is, in a sense, the maximal logic with one or both of the prefix-accumulation assertions that permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, such as CTL or LTL, makes the problem undecidable.","lang":"eng"}],"month":"09","issue":"4","isi":1,"oa":1,"language":[{"iso":"eng"}],"acknowledgement":"The research was supported in part by ERC Starting grant 278410 (QUALITY).","intvolume":"        15","file_date_updated":"2020-07-14T12:45:26Z","date_published":"2014-09-16T00:00:00Z","year":"2014","publist_id":"5013","article_type":"original","date_created":"2018-12-11T11:55:21Z","ddc":["000","004"],"type":"journal_article","article_processing_charge":"No","doi":"10.1145/2629686","quality_controlled":"1","status":"public","ec_funded":1,"scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Submitted Version","related_material":{"record":[{"id":"5385","relation":"earlier_version","status":"public"},{"id":"3356","relation":"earlier_version","status":"public"}]},"date_updated":"2025-09-30T09:27:29Z","day":"16","has_accepted_license":"1","publication":"ACM Transactions on Computational Logic (TOCL)","citation":{"ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27.","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2629686\">https://doi.org/10.1145/2629686</a>.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 15 (2014).","mla":"Boker, Udi, et al. “Temporal Specifications with Accumulative Values.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 15, no. 4, 27, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2629686\">10.1145/2629686</a>.","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2014). Temporal specifications with accumulative values. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/2629686\">https://doi.org/10.1145/2629686</a>","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 15, no. 4. ACM, 2014.","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2014;15(4). doi:<a href=\"https://doi.org/10.1145/2629686\">10.1145/2629686</a>"},"file":[{"file_name":"IST-2014-192-v1+1_AccumulativeValues.pdf","date_updated":"2020-07-14T12:45:26Z","file_id":"4851","checksum":"354c41d37500b56320afce94cf9a99c2","creator":"system","content_type":"application/pdf","file_size":346184,"relation":"main_file","date_created":"2018-12-12T10:10:59Z","access_level":"open_access"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"ACM","_id":"2038","title":"Temporal specifications with accumulative values"},{"project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","external_id":{"arxiv":["1404.5084"]},"author":[{"full_name":"Hermanns, Holger","first_name":"Holger","last_name":"Hermanns"},{"last_name":"Krčál","first_name":"Jan","full_name":"Krčál, Jan"},{"full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Kretinsky"}],"editor":[{"full_name":"Baldan, Paolo","last_name":"Baldan","first_name":"Paolo"},{"last_name":"Gorla","first_name":"Daniele","full_name":"Gorla, Daniele"}],"date_created":"2018-12-11T11:55:27Z","year":"2014","publist_id":"4993","date_published":"2014-09-01T00:00:00Z","intvolume":"      8704","language":[{"iso":"eng"}],"oa":1,"acknowledgement":"This work is supported by the EU 7th Framework Programme under grant agreements 295261 (MEALS) and 318490 (SENSATION), Czech Science Foundation under grant agreement P202/12/G061, the DFG Transregional Collaborative Research Centre SFB/TR 14 AVACS, and by the CAS/SAFEA International Partnership Program for Creative Research Teams.","month":"09","abstract":[{"text":"In contrast to the usual understanding of probabilistic systems as stochastic processes, recently these systems have also been regarded as transformers of probabilities. In this paper, we give a natural definition of strong bisimulation for probabilistic systems corresponding to this view that treats probability distributions as first-class citizens. Our definition applies in the same way to discrete systems as well as to systems with uncountable state and action spaces. Several examples demonstrate that our definition refines the understanding of behavioural equivalences of probabilistic systems. In particular, it solves a longstanding open problem concerning the representation of memoryless continuous time by memoryfull continuous time. Finally, we give algorithms for computing this bisimulation not only for finite but also for classes of uncountably infinite systems.","lang":"eng"}],"volume":8704,"conference":{"end_date":"2014-09-05","start_date":"2014-09-02","name":"CONCUR: Concurrency Theory","location":"Rome, Italy"},"page":"249 - 265","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","status":"public","ec_funded":1,"doi":"10.1007/978-3-662-44584-6_18","arxiv":1,"article_processing_charge":"No","type":"conference","_id":"2053","title":"Probabilistic bisimulation: Naturally on distributions","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"main_file_link":[{"url":"http://arxiv.org/abs/1404.5084","open_access":"1"}],"citation":{"ama":"Hermanns H, Krčál J, Kretinsky J. Probabilistic bisimulation: Naturally on distributions. In: Baldan P, Gorla D, eds. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:249-265. doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">10.1007/978-3-662-44584-6_18</a>","apa":"Hermanns, H., Krčál, J., &#38; Kretinsky, J. (2014). Probabilistic bisimulation: Naturally on distributions. In P. Baldan &#38; D. Gorla (Eds.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8704, pp. 249–265). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">https://doi.org/10.1007/978-3-662-44584-6_18</a>","mla":"Hermanns, Holger, et al. “Probabilistic Bisimulation: Naturally on Distributions.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 249–65, doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">10.1007/978-3-662-44584-6_18</a>.","ieee":"H. Hermanns, J. Krčál, and J. Kretinsky, “Probabilistic bisimulation: Naturally on distributions,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Rome, Italy, 2014, vol. 8704, pp. 249–265.","short":"H. Hermanns, J. Krčál, J. Kretinsky, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 249–265.","ista":"Hermanns H, Krčál J, Kretinsky J. 2014. Probabilistic bisimulation: Naturally on distributions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 249–265.","chicago":"Hermanns, Holger, Jan Krčál, and Jan Kretinsky. “Probabilistic Bisimulation: Naturally on Distributions.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, 8704:249–65. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">https://doi.org/10.1007/978-3-662-44584-6_18</a>."},"publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","alternative_title":["LNCS"],"day":"01","date_updated":"2025-06-11T07:57:15Z"},{"type":"journal_article","article_processing_charge":"No","arxiv":1,"oa_version":"Submitted Version","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"767 - 797","doi":"10.1007/s00285-013-0738-7","quality_controlled":"1","status":"public","day":"20","date_updated":"2025-09-29T11:50:22Z","title":"Markov chain aggregation and its applications to combinatorial reaction networks","_id":"2056","publication":"Journal of Mathematical Biology","citation":{"ama":"Ganguly A, Petrov T, Koeppl H. Markov chain aggregation and its applications to combinatorial reaction networks. <i>Journal of Mathematical Biology</i>. 2014;69(3):767-797. doi:<a href=\"https://doi.org/10.1007/s00285-013-0738-7\">10.1007/s00285-013-0738-7</a>","ieee":"A. Ganguly, T. Petrov, and H. Koeppl, “Markov chain aggregation and its applications to combinatorial reaction networks,” <i>Journal of Mathematical Biology</i>, vol. 69, no. 3. Springer, pp. 767–797, 2014.","mla":"Ganguly, Arnab, et al. “Markov Chain Aggregation and Its Applications to Combinatorial Reaction Networks.” <i>Journal of Mathematical Biology</i>, vol. 69, no. 3, Springer, 2014, pp. 767–97, doi:<a href=\"https://doi.org/10.1007/s00285-013-0738-7\">10.1007/s00285-013-0738-7</a>.","apa":"Ganguly, A., Petrov, T., &#38; Koeppl, H. (2014). Markov chain aggregation and its applications to combinatorial reaction networks. <i>Journal of Mathematical Biology</i>. Springer. <a href=\"https://doi.org/10.1007/s00285-013-0738-7\">https://doi.org/10.1007/s00285-013-0738-7</a>","short":"A. Ganguly, T. Petrov, H. Koeppl, Journal of Mathematical Biology 69 (2014) 767–797.","chicago":"Ganguly, Arnab, Tatjana Petrov, and Heinz Koeppl. “Markov Chain Aggregation and Its Applications to Combinatorial Reaction Networks.” <i>Journal of Mathematical Biology</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00285-013-0738-7\">https://doi.org/10.1007/s00285-013-0738-7</a>.","ista":"Ganguly A, Petrov T, Koeppl H. 2014. Markov chain aggregation and its applications to combinatorial reaction networks. Journal of Mathematical Biology. 69(3), 767–797."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1303.4532"}],"publisher":"Springer","department":[{"_id":"CaGu"},{"_id":"ToHe"}],"external_id":{"isi":["000340588700008"],"arxiv":["1303.4532"]},"publication_status":"published","author":[{"full_name":"Ganguly, Arnab","first_name":"Arnab","last_name":"Ganguly"},{"first_name":"Tatjana","last_name":"Petrov","orcid":"0000-0002-9041-0905","full_name":"Petrov, Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Koeppl, Heinz","last_name":"Koeppl","first_name":"Heinz"}],"abstract":[{"lang":"eng","text":"We consider a continuous-time Markov chain (CTMC) whose state space is partitioned into aggregates, and each aggregate is assigned a probability measure. A sufficient condition for defining a CTMC over the aggregates is presented as a variant of weak lumpability, which also characterizes that the measure over the original process can be recovered from that of the aggregated one. We show how the applicability of de-aggregation depends on the initial distribution. The application section is devoted to illustrate how the developed theory aids in reducing CTMC models of biochemical systems particularly in connection to protein-protein interactions. We assume that the model is written by a biologist in form of site-graph-rewrite rules. Site-graph-rewrite rules compactly express that, often, only a local context of a protein (instead of a full molecular species) needs to be in a certain configuration in order to trigger a reaction event. This observation leads to suitable aggregate Markov chains with smaller state spaces, thereby providing sufficient reduction in computational complexity. This is further exemplified in two case studies: simple unbounded polymerization and early EGFR/insulin crosstalk."}],"month":"11","volume":69,"date_published":"2014-11-20T00:00:00Z","publist_id":"4990","year":"2014","date_created":"2018-12-11T11:55:28Z","isi":1,"language":[{"iso":"eng"}],"acknowledgement":"T. Petrov is supported by SystemsX.ch—the Swiss Inititative for Systems Biology.","oa":1,"issue":"3","intvolume":"        69"},{"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","last_name":"Chmelik","first_name":"Martin"},{"first_name":"Przemyslaw","last_name":"Daca","full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","corr_author":"1","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"volume":8559,"month":"07","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems.We focus on qualitative properties forMDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability. We introduce a new simulation relation to capture the refinement relation ofMDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.We present an automated technique for assume-guarantee style reasoning for compositional analysis ofMDPs with qualitative properties by giving a counterexample guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements."}],"intvolume":"      8559","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:55:30Z","publist_id":"4978","year":"2014","date_published":"2014-07-01T00:00:00Z","type":"conference","ec_funded":1,"status":"public","quality_controlled":"1","doi":"10.1007/978-3-319-08867-9_31","conference":{"name":"CAV: Computer Aided Verification","start_date":"2014-07-18","location":"Vienna, Austria","end_date":"2014-07-22"},"page":"473 - 490","related_material":{"record":[{"relation":"earlier_version","id":"5412","status":"public"},{"status":"public","id":"5413","relation":"earlier_version"},{"status":"public","relation":"earlier_version","id":"5414"},{"id":"1155","relation":"dissertation_contains","status":"public"}]},"oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","date_updated":"2026-04-15T10:02:12Z","alternative_title":["LNCS"],"day":"01","publisher":"Springer","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"citation":{"ama":"Chatterjee K, Chmelik M, Daca P. CEGAR for qualitative analysis of probabilistic systems. In: Vol 8559. Springer; 2014:473-490. doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">10.1007/978-3-319-08867-9_31</a>","ieee":"K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for qualitative analysis of probabilistic systems,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 473–490.","apa":"Chatterjee, K., Chmelik, M., &#38; Daca, P. (2014). CEGAR for qualitative analysis of probabilistic systems (Vol. 8559, pp. 473–490). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">https://doi.org/10.1007/978-3-319-08867-9_31</a>","mla":"Chatterjee, Krishnendu, et al. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. Vol. 8559, Springer, 2014, pp. 473–90, doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">10.1007/978-3-319-08867-9_31</a>.","short":"K. Chatterjee, M. Chmelik, P. Daca, in:, Springer, 2014, pp. 473–490.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Qualitative Analysis of Probabilistic Systems,” 8559:473–90. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">https://doi.org/10.1007/978-3-319-08867-9_31</a>.","ista":"Chatterjee K, Chmelik M, Daca P. 2014. CEGAR for qualitative analysis of probabilistic systems. CAV: Computer Aided Verification, LNCS, vol. 8559, 473–490."},"title":"CEGAR for qualitative analysis of probabilistic systems","_id":"2063"},{"author":[{"first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"}],"publication_status":"published","external_id":{"isi":["000347601300009"],"arxiv":["1210.2450"]},"corr_author":"1","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"volume":560,"month":"12","abstract":[{"lang":"eng","text":"The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a distance for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intuitively, tolerating errors (while counting them) in the alternating simulation game. We show that the interface simulation distance satisfies the triangle inequality, that the distance between two interfaces does not increase under parallel composition with a third interface, that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces, and how to synthesize an interface from incompatible requirements. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies."}],"intvolume":"       560","issue":"3","language":[{"iso":"eng"}],"oa":1,"isi":1,"date_created":"2018-12-11T11:53:43Z","date_published":"2014-12-04T00:00:00Z","year":"2014","publist_id":"5392","article_processing_charge":"No","arxiv":1,"type":"journal_article","ec_funded":1,"status":"public","doi":"10.1016/j.tcs.2014.08.019","quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","oa_version":"Submitted Version","page":"348 - 363","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"2916"}]},"date_updated":"2025-09-29T13:14:25Z","day":"04","main_file_link":[{"url":"http://arxiv.org/abs/1210.2450","open_access":"1"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"Elsevier","publication":"Theoretical Computer Science","citation":{"ieee":"P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” <i>Theoretical Computer Science</i>, vol. 560, no. 3. Elsevier, pp. 348–363, 2014.","apa":"Cerny, P., Chmelik, M., Henzinger, T. A., &#38; Radhakrishna, A. (2014). Interface simulation distances. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">https://doi.org/10.1016/j.tcs.2014.08.019</a>","mla":"Cerny, Pavol, et al. “Interface Simulation Distances.” <i>Theoretical Computer Science</i>, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">10.1016/j.tcs.2014.08.019</a>.","ama":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface simulation distances. <i>Theoretical Computer Science</i>. 2014;560(3):348-363. doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">10.1016/j.tcs.2014.08.019</a>","chicago":"Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” <i>Theoretical Computer Science</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">https://doi.org/10.1016/j.tcs.2014.08.019</a>.","ista":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation distances. Theoretical Computer Science. 560(3), 348–363.","short":"P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 560 (2014) 348–363."},"title":"Interface simulation distances","_id":"1733"},{"article_number":"17","publication_status":"published","author":[{"last_name":"Haas","first_name":"Andreas","full_name":"Haas, Andreas"},{"full_name":"Lippautz, Michael","last_name":"Lippautz","first_name":"Michael"},{"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":"Payer, Hannes","first_name":"Hannes","last_name":"Payer"},{"full_name":"Sokolova, Ana","first_name":"Ana","last_name":"Sokolova"},{"first_name":"Christoph M.","last_name":"Kirsch","full_name":"Kirsch, Christoph M."},{"last_name":"Sezgin","first_name":"Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","full_name":"Sezgin, Ali"}],"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"month":"05","abstract":[{"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.","lang":"eng"}],"date_created":"2022-03-21T07:33:22Z","year":"2013","date_published":"2013-05-14T00:00:00Z","acknowledgement":"This work has been supported by the European Research Council advanced grant on Quantitative Reactive Modeling (QUAREM) and the National Research Network RiSE on Rigorous Systems Engineering (Austrian Science Fund S11402-N23 and S11404-N23).","issue":"5","language":[{"iso":"eng"}],"article_processing_charge":"No","type":"conference","conference":{"name":"CF: Conference on Computing Frontiers","start_date":"2013-05-14","location":"Ischia, Italy","end_date":"2013-05-16"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","oa_version":"None","status":"public","ec_funded":1,"quality_controlled":"1","doi":"10.1145/2482767.2482789","publication_identifier":{"isbn":["978-145032053-5"]},"day":"14","date_updated":"2025-05-14T11:23:58Z","title":"Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation","_id":"10898","publisher":"ACM","department":[{"_id":"ToHe"}],"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, 2013.","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.","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, 2013. <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; 2013. doi:<a href=\"https://doi.org/10.1145/2482767.2482789\">10.1145/2482767.2482789</a>","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. <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, 2013, doi:<a href=\"https://doi.org/10.1145/2482767.2482789\">10.1145/2482767.2482789</a>.","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."},"publication":"Proceedings of the ACM International Conference on Computing Frontiers - CF '13"},{"scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","page":"173 - 181","conference":{"end_date":"2013-12-19","start_date":"2013-12-14","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","location":"Stellenbosch, South Africa"},"doi":"10.1007/978-3-642-45221-5_13","quality_controlled":"1","status":"public","type":"conference","article_processing_charge":"No","ddc":["000"],"_id":"2237","title":"Tree interpolation in Vampire","has_accepted_license":"1","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>","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.","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>","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>.","short":"R. Blanc, A. Gupta, L. Kovács, B. Kragl, 8312 (2013) 173–181."},"file":[{"file_id":"7858","checksum":"9cebaafca032e6769d273f393305c705","date_updated":"2020-07-14T12:45:34Z","file_name":"2013_LPAR_Blanc.pdf","access_level":"open_access","date_created":"2020-05-15T11:10:40Z","relation":"main_file","content_type":"application/pdf","file_size":279206,"creator":"dernst"}],"department":[{"_id":"ToHe"}],"publisher":"Springer","day":"14","alternative_title":["LNCS"],"date_updated":"2020-08-11T10:09:42Z","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","author":[{"last_name":"Blanc","first_name":"Régis","full_name":"Blanc, Régis"},{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh","last_name":"Gupta","first_name":"Ashutosh"},{"full_name":"Kovács, Laura","first_name":"Laura","last_name":"Kovács"},{"orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","last_name":"Kragl"}],"date_published":"2013-01-14T00:00:00Z","file_date_updated":"2020-07-14T12:45:34Z","year":"2013","publist_id":"4724","date_created":"2018-12-11T11:56:29Z","language":[{"iso":"eng"}],"oa":1,"intvolume":"      8312","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"}],"month":"01","series_title":"Lecture Notes in Computer Science","volume":8312},{"day":"01","alternative_title":["LIPIcs"],"date_updated":"2020-08-11T10:09:42Z","title":"Elementary modal logics over transitive structures","_id":"2243","has_accepted_license":"1","citation":{"short":"J. Michaliszyn, J. Otop, 23 (2013) 563–577.","ista":"Michaliszyn J, Otop J. 2013. Elementary modal logics over transitive structures. 23, 563–577.","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>.","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>","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>.","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>","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."},"file":[{"creator":"system","file_size":454915,"content_type":"application/pdf","relation":"main_file","date_created":"2018-12-12T10:12:11Z","access_level":"open_access","file_name":"IST-2016-136-v1+2_39.pdf","date_updated":"2020-07-14T12:45:34Z","checksum":"e0732e73a8b1e39483df7717d53e3e35","file_id":"4929"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"}],"type":"conference","ddc":["000","004"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","scopus_import":1,"page":"563 - 577","conference":{"location":"Torino, Italy","start_date":"2013-09-02","name":"CSL: Computer Science Logic","end_date":"2013-09-05"},"doi":"10.4230/LIPIcs.CSL.2013.563","quality_controlled":"1","ec_funded":1,"status":"public","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."}],"month":"09","series_title":"Leibniz International Proceedings in Informatics","volume":23,"date_published":"2013-09-01T00:00:00Z","file_date_updated":"2020-07-14T12:45:34Z","year":"2013","publist_id":"4708","date_created":"2018-12-11T11:56:32Z","language":[{"iso":"eng"}],"license":"https://creativecommons.org/licenses/by/4.0/","oa":1,"intvolume":"        23","publication_status":"published","pubrep_id":"136","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"author":[{"full_name":"Michaliszyn, Jakub","first_name":"Jakub","last_name":"Michaliszyn"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan"}],"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"}]},{"year":"2013","publist_id":"4643","date_published":"2013-07-01T00:00:00Z","_id":"2288","title":"Computational Methods in Systems Biology","date_created":"2018-12-11T11:56:47Z","editor":[{"full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh","last_name":"Gupta"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"}],"citation":{"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>","ieee":"A. Gupta and T. A. Henzinger, Eds., <i>Computational Methods in Systems Biology</i>, vol. 8130. Springer, 2013.","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>.","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>","short":"A. Gupta, T.A. Henzinger, eds., Computational Methods in Systems Biology, Springer, 2013.","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>.","ista":"Gupta A, Henzinger TA eds. 2013. Computational Methods in Systems Biology, Springer,p."},"language":[{"iso":"eng"}],"publisher":"Springer","department":[{"_id":"ToHe"}],"intvolume":"      8130","abstract":[{"lang":"eng","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."}],"alternative_title":["LNCS"],"day":"01","month":"07","date_updated":"2024-10-09T20:55:17Z","volume":8130,"oa_version":"None","user_id":"2DF688A6-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"},"quality_controlled":"1","doi":"10.1007/978-3-642-40708-6","publication_identifier":{"isbn":["978-3-642-40707-9"]},"status":"public","corr_author":"1","type":"conference_editor","publication_status":"published"},{"quality_controlled":"1","doi":"10.1007/s00450-013-0251-7","ec_funded":1,"status":"public","page":"331 - 344","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","ddc":["000"],"type":"journal_article","citation":{"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>","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.","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>.","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.","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>.","ista":"Henzinger TA. 2013. Quantitative reactive modeling and verification. Computer Science Research and Development. 28(4), 331–344."},"has_accepted_license":"1","publication":"Computer Science Research and Development","publisher":"Springer","department":[{"_id":"ToHe"}],"file":[{"access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:17:51Z","content_type":"application/pdf","file_size":570361,"creator":"system","checksum":"f117a00f9f046165bfa95595681e08a0","file_id":"5308","date_updated":"2020-07-14T12:45:37Z","file_name":"IST-2016-626-v1+1_s00450-013-0251-7.pdf"}],"title":"Quantitative reactive modeling and verification","_id":"2289","date_updated":"2024-10-09T20:55:17Z","day":"05","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"author":[{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"corr_author":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"pubrep_id":"626","publication_status":"published","language":[{"iso":"eng"}],"oa":1,"issue":"4","intvolume":"        28","year":"2013","publist_id":"4642","date_published":"2013-10-05T00:00:00Z","file_date_updated":"2020-07-14T12:45:37Z","date_created":"2018-12-11T11:56:47Z","volume":28,"abstract":[{"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.","lang":"eng"}],"month":"10"},{"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"pubrep_id":"196","publication_status":"published","author":[{"first_name":"Cezara","last_name":"Dragoi","full_name":"Dragoi, Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Constantin","last_name":"Enea","full_name":"Enea, Constantin"},{"full_name":"Sighireanu, Mihaela","last_name":"Sighireanu","first_name":"Mihaela"}],"year":"2013","publist_id":"4630","date_published":"2013-01-01T00:00:00Z","file_date_updated":"2020-07-14T12:45:37Z","date_created":"2018-12-11T11:56:50Z","oa":1,"language":[{"iso":"eng"}],"intvolume":"      7935","abstract":[{"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","lang":"eng"}],"month":"01","volume":7935,"page":"150 - 171","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"conference":{"location":"Seattle, WA, United States","start_date":"2013-06-20","name":"SAS: Static Analysis Symposium","end_date":"2013-06-22"},"quality_controlled":"1","doi":"10.1007/978-3-642-38856-9_10","ec_funded":1,"status":"public","type":"conference","ddc":["000","004"],"title":"Local shape analysis for overlaid data structures","_id":"2298","citation":{"ista":"Dragoi C, Enea C, Sighireanu M. 2013. Local shape analysis for overlaid data structures. SAS: Static Analysis Symposium, LNCS, vol. 7935, 150–171.","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>.","short":"C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2013, pp. 150–171.","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>","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>.","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.","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>"},"has_accepted_license":"1","department":[{"_id":"ToHe"}],"publisher":"Springer","file":[{"date_created":"2018-12-12T10:10:36Z","relation":"main_file","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":299004,"file_id":"4824","checksum":"907edd33a5892e3af093365f1fd57ed7","file_name":"IST-2014-196-v1+1_sas13.pdf","date_updated":"2020-07-14T12:45:37Z"}],"alternative_title":["LNCS"],"day":"01","date_updated":"2021-01-12T06:56:36Z"},{"ddc":["000"],"type":"journal_article","status":"public","quality_controlled":"1","doi":"10.1007/s10009-011-0207-9","page":"585 - 601","scopus_import":1,"oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-09T20:55:16Z","day":"01","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Springer","file":[{"file_id":"4910","checksum":"57b06a732dd8d6349190dba6b5b0d33b","date_updated":"2020-07-14T12:45:37Z","file_name":"IST-2012-87-v1+1_Synthesis_of_AMBA_AHB_from_formal_specifications-_A_case_study.pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:11:53Z","file_size":277372,"content_type":"application/pdf","creator":"system"}],"citation":{"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>","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.","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>","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>.","short":"Y. Godhal, K. Chatterjee, T.A. Henzinger, International Journal on Software Tools for Technology Transfer 15 (2013) 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>.","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."},"has_accepted_license":"1","publication":"International Journal on Software Tools for Technology Transfer","_id":"2299","title":"Synthesis of AMBA AHB from formal specification: A case study","author":[{"last_name":"Godhal","first_name":"Yashdeep","id":"5B547124-EB61-11E9-8887-89D9C04DBDF5","full_name":"Godhal, Yashdeep"},{"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","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"pubrep_id":"87","publication_status":"published","corr_author":"1","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"volume":15,"month":"10","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"}],"intvolume":"        15","issue":"5-6","language":[{"iso":"eng"}],"oa":1,"date_created":"2018-12-11T11:56:51Z","publist_id":"4629","year":"2013","file_date_updated":"2020-07-14T12:45:37Z","date_published":"2013-10-01T00:00:00Z"},{"publication_status":"published","type":"conference","author":[{"full_name":"Desai, Ankush","first_name":"Ankush","last_name":"Desai"},{"last_name":"Gupta","first_name":"Vivek","full_name":"Gupta, Vivek"},{"last_name":"Jackson","first_name":"Ethan","full_name":"Jackson, Ethan"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"},{"first_name":"Sriram","last_name":"Rajamani","full_name":"Rajamani, Sriram"},{"first_name":"Damien","last_name":"Zufferey","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87"}],"conference":{"end_date":"2013-06-19","location":"Seattle, WA, United States","start_date":"2013-06-16","name":"PLDI: Programming Languages Design and Implementation"},"project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7"}],"scopus_import":1,"oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"321 - 331","status":"public","ec_funded":1,"doi":"10.1145/2491956.2462184","quality_controlled":"1","month":"06","day":"01","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"}],"date_updated":"2021-01-12T06:56:38Z","date_created":"2018-12-11T11:56:52Z","title":"P: Safe asynchronous event-driven programming","_id":"2301","date_published":"2013-06-01T00:00:00Z","publist_id":"4626","year":"2013","main_file_link":[{"url":"http://research.microsoft.com/pubs/191069/pldi212_desai.pdf"}],"department":[{"_id":"ToHe"}],"publisher":"ACM","publication":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","citation":{"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.","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>.","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>","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>.","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.","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>"},"language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","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."}],"month":"08","volume":8052,"series_title":"Lecture Notes in Computer Science","year":"2013","publist_id":"4599","file_date_updated":"2020-07-14T12:45:38Z","date_published":"2013-08-01T00:00:00Z","date_created":"2018-12-11T11:57:00Z","language":[{"iso":"eng"}],"oa":1,"intvolume":"      8052","corr_author":"1","pubrep_id":"129","publication_status":"published","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Otop"}],"alternative_title":["LNCS"],"day":"01","date_updated":"2024-10-21T06:02:58Z","title":"From model checking to model measuring","_id":"2327","citation":{"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>","ieee":"T. A. Henzinger and J. Otop, “From model checking to model measuring,” vol. 8052. Springer, pp. 273–287, 2013.","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>.","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>","short":"T.A. Henzinger, J. Otop, 8052 (2013) 273–287.","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>.","ista":"Henzinger TA, Otop J. 2013. From model checking to model measuring. 8052, 273–287."},"has_accepted_license":"1","department":[{"_id":"ToHe"}],"publisher":"Springer","file":[{"relation":"main_file","date_created":"2018-12-12T10:17:45Z","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":378587,"file_id":"5301","checksum":"4c04695c4bfdf2119cd4f5d1babc3e8a","file_name":"IST-2013-129-v1+1_concur.pdf","date_updated":"2020-07-14T12:45:38Z"}],"type":"conference","ddc":["005","000"],"page":"273 - 287","related_material":{"record":[{"relation":"earlier_version","id":"5417","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","scopus_import":"1","conference":{"end_date":"2013-08-30","name":"CONCUR: Concurrency Theory","start_date":"2013-08-27","location":"Buenos Aires, Argentina"},"quality_controlled":"1","doi":"10.1007/978-3-642-40184-8_20","status":"public"},{"ddc":["000","004"],"type":"conference","ec_funded":1,"status":"public","doi":"10.1007/978-3-642-40184-8_18","quality_controlled":"1","conference":{"location":"Buenos Aires, Argentina","name":"CONCUR: Concurrency Theory","start_date":"2013-08-27","end_date":"2013-08-30"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","scopus_import":1,"page":"242 - 256","related_material":{"record":[{"id":"1832","relation":"later_version","status":"public"}]},"date_updated":"2025-09-23T07:56:19Z","day":"01","alternative_title":["LNCS"],"file":[{"date_created":"2018-12-12T10:08:58Z","relation":"main_file","access_level":"open_access","creator":"system","file_size":337059,"content_type":"application/pdf","file_id":"4721","checksum":"bdbb520de91751fe0136309ad4ef67e4","file_name":"IST-2014-197-v1+1_main-queue-verification.pdf","date_updated":"2020-07-14T12:45:39Z"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"}],"has_accepted_license":"1","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>","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.","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>","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>.","short":"T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256.","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."},"title":"Aspect-oriented linearizability proofs","_id":"2328","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","first_name":"Ali","last_name":"Sezgin"},{"full_name":"Vafeiadis, Viktor","first_name":"Viktor","last_name":"Vafeiadis"}],"publication_status":"published","pubrep_id":"197","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"series_title":"Lecture Notes in Computer Science","volume":8052,"month":"08","abstract":[{"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.","lang":"eng"}],"intvolume":"      8052","language":[{"iso":"eng"}],"oa":1,"date_created":"2018-12-11T11:57:01Z","date_published":"2013-08-01T00:00:00Z","file_date_updated":"2020-07-14T12:45:39Z","publist_id":"4598","year":"2013"},{"file_date_updated":"2020-07-14T12:45:40Z","date_published":"2013-07-01T00:00:00Z","year":"2013","publist_id":"4458","date_created":"2018-12-11T11:57:42Z","language":[{"iso":"eng"}],"oa":1,"intvolume":"      8044","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"}],"month":"07","volume":8044,"project":[{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","pubrep_id":"199","author":[{"last_name":"Cerny","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol"},{"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":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"},{"full_name":"Ryzhyk, Leonid","last_name":"Ryzhyk","first_name":"Leonid"},{"first_name":"Thorsten","last_name":"Tarrach","orcid":"0000-0003-4409-8487","full_name":"Tarrach, Thorsten","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87"}],"title":"Efficient synthesis for concurrency by semantics-preserving transformations","_id":"2445","has_accepted_license":"1","citation":{"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>.","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>","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.","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>","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.","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>.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, T. Tarrach, in:, Springer, 2013, pp. 951–967."},"file":[{"file_name":"IST-2014-199-v1+1_cav2013-final.pdf","date_updated":"2020-07-14T12:45:40Z","file_id":"5158","checksum":"70c70ca5487faba82262c63e1b678a27","creator":"system","file_size":365548,"content_type":"application/pdf","relation":"main_file","date_created":"2018-12-12T10:15:37Z","access_level":"open_access"}],"publisher":"Springer","department":[{"_id":"ToHe"}],"day":"01","alternative_title":["LNCS"],"date_updated":"2026-04-09T10:54:00Z","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","related_material":{"record":[{"id":"1130","relation":"dissertation_contains","status":"public"}]},"page":"951 - 967","conference":{"end_date":"2013-07-19","location":"St. Petersburg, Russia","name":"CAV: Computer Aided Verification","start_date":"2013-07-13"},"doi":"10.1007/978-3-642-39799-8_68","quality_controlled":"1","ec_funded":1,"status":"public","type":"conference","ddc":["000","004"]},{"ddc":["000"],"type":"conference","article_processing_charge":"No","quality_controlled":"1","doi":"10.1007/978-3-642-39799-8_54","status":"public","page":"773 - 789","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"oa_version":"Submitted Version","conference":{"end_date":"2013-07-19","start_date":"2013-07-13","name":"CAV: Computer Aided Verification","location":"St. Petersburg, Russia"},"date_updated":"2020-08-11T10:09:47Z","alternative_title":["LNCS"],"day":"01","citation":{"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>","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>.","ieee":"R. Piskac, T. Wies, and D. Zufferey, “Automating separation logic using SMT,” vol. 8044. Springer, pp. 773–789, 2013.","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>","ista":"Piskac R, Wies T, Zufferey D. 2013. Automating separation logic using SMT. 8044, 773–789.","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>.","short":"R. Piskac, T. Wies, D. Zufferey, 8044 (2013) 773–789."},"has_accepted_license":"1","department":[{"_id":"ToHe"}],"publisher":"Springer","file":[{"file_size":309182,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","date_created":"2020-05-15T11:13:01Z","relation":"main_file","date_updated":"2020-07-14T12:45:41Z","file_name":"2013_CAV_Piskac.pdf","file_id":"7859","checksum":"2e866932ab688f47ecd504acb4d5c7d4"}],"_id":"2447","title":"Automating separation logic using SMT","author":[{"full_name":"Piskac, Ruzica","last_name":"Piskac","first_name":"Ruzica"},{"first_name":"Thomas","last_name":"Wies","full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","last_name":"Zufferey"}],"publication_status":"published","volume":8044,"series_title":"Lecture Notes in Computer Science","abstract":[{"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","lang":"eng"}],"month":"07","oa":1,"language":[{"iso":"eng"}],"intvolume":"      8044","year":"2013","publist_id":"4456","file_date_updated":"2020-07-14T12:45:41Z","date_published":"2013-07-01T00:00:00Z","date_created":"2018-12-11T11:57:43Z"},{"status":"public","ec_funded":1,"doi":"10.1007/978-3-642-39212-2_3","quality_controlled":"1","conference":{"end_date":"2013-07-12","location":"Riga, Latvia","name":"ICALP: Automata, Languages and Programming","start_date":"2013-07-08"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","scopus_import":1,"page":"15 - 27","ddc":["000"],"article_processing_charge":"No","type":"conference","file":[{"access_level":"open_access","date_created":"2020-05-15T11:16:12Z","relation":"main_file","file_size":363031,"content_type":"application/pdf","creator":"dernst","checksum":"85afbf6c18a2c7e377c52c9410e2d824","file_id":"7860","date_updated":"2020-07-14T12:45:42Z","file_name":"2013_ICALP_Almagor.pdf"}],"publisher":"Springer","department":[{"_id":"ToHe"}],"has_accepted_license":"1","citation":{"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>","ieee":"S. Almagor, U. Boker, and O. Kupferman, “Formalizing and reasoning about quality,” vol. 7966, no. Part 2. Springer, pp. 15–27, 2013.","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>.","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>","short":"S. Almagor, U. Boker, O. Kupferman, 7966 (2013) 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>.","ista":"Almagor S, Boker U, Kupferman O. 2013. Formalizing and reasoning about quality. 7966(Part 2), 15–27."},"title":"Formalizing and reasoning about quality","_id":"2517","date_updated":"2020-08-11T10:09:47Z","day":"01","alternative_title":["LNCS"],"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"}],"author":[{"last_name":"Almagor","first_name":"Shaull","full_name":"Almagor, Shaull"},{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","last_name":"Boker","first_name":"Udi"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"}],"publication_status":"published","intvolume":"      7966","acknowledgement":"ERC Grant QUALITY. ","oa":1,"issue":"Part 2","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:58:08Z","file_date_updated":"2020-07-14T12:45:42Z","date_published":"2013-07-01T00:00:00Z","year":"2013","publist_id":"4384","series_title":"Lecture Notes in Computer Science","volume":7966,"month":"07","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."}]},{"date_updated":"2026-04-09T14:35:24Z","day":"01","alternative_title":["LNCS"],"main_file_link":[{"open_access":"1","url":"http://arise.or.at/pubpdf/Structural_Counter_Abstraction.pdf"}],"publisher":"Springer","department":[{"_id":"ToHe"}],"citation":{"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>","ieee":"K. Bansal, E. Koskinen, T. Wies, and D. Zufferey, “Structural Counter Abstraction,” vol. 7795. Springer, pp. 62–77, 2013.","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>.","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>","short":"K. Bansal, E. Koskinen, T. Wies, D. Zufferey, 7795 (2013) 62–77.","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>.","ista":"Bansal K, Koskinen E, Wies T, Zufferey D. 2013. Structural Counter Abstraction (eds. N. Piterman &#38; S. Smolka). 7795, 62–77."},"title":"Structural Counter Abstraction","_id":"2847","type":"conference","status":"public","ec_funded":1,"doi":"10.1007/978-3-642-36742-7_5","quality_controlled":"1","conference":{"end_date":"2013-03-24","start_date":"2013-03-16","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Rome, Italy"},"scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","page":"62 - 77","related_material":{"record":[{"relation":"dissertation_contains","id":"1405","status":"public"}]},"series_title":"Lecture Notes in Computer Science","volume":7795,"month":"03","abstract":[{"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.","lang":"eng"}],"intvolume":"      7795","language":[{"iso":"eng"}],"oa":1,"date_created":"2018-12-11T11:59:54Z","editor":[{"last_name":"Piterman","first_name":"Nir","full_name":"Piterman, Nir"},{"first_name":"Scott","last_name":"Smolka","full_name":"Smolka, Scott"}],"date_published":"2013-03-01T00:00:00Z","year":"2013","publist_id":"3947","author":[{"full_name":"Bansal, Kshitij","last_name":"Bansal","first_name":"Kshitij"},{"last_name":"Koskinen","first_name":"Eric","full_name":"Koskinen, Eric"},{"full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Wies"},{"first_name":"Damien","last_name":"Zufferey","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","project":[{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"}]},{"doi":"10.1016/j.jcss.2012.12.001","quality_controlled":"1","ec_funded":1,"status":"public","oa_version":"Published Version","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"640 - 657","ddc":["000"],"type":"journal_article","article_processing_charge":"No","has_accepted_license":"1","publication":"Journal of Computer and System Sciences","citation":{"short":"K. Chatterjee, L. De Alfaro, T.A. Henzinger, Journal of Computer and System Sciences 79 (2013) 640–657.","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>.","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>","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>","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."},"file":[{"creator":"system","file_size":425488,"content_type":"application/pdf","relation":"main_file","date_created":"2018-12-12T10:18:48Z","access_level":"open_access","file_name":"IST-2015-388-v1+1_1-s2.0-S0022000012001778-main.pdf","date_updated":"2020-07-14T12:45:51Z","file_id":"5370","checksum":"6d3ee12cceb946a0abe69594b6a22409"}],"publisher":"Elsevier","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"_id":"2854","title":"Strategy improvement for concurrent reachability and turn based stochastic safety games","date_updated":"2025-09-29T13:40:38Z","day":"01","project":[{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"De Alfaro","first_name":"Luca","full_name":"De Alfaro, Luca"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"isi":["000316837300011"]},"corr_author":"1","publication_status":"published","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)"},"pubrep_id":"388","language":[{"iso":"eng"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","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","oa":1,"issue":"5","isi":1,"intvolume":"        79","file_date_updated":"2020-07-14T12:45:51Z","date_published":"2013-08-01T00:00:00Z","year":"2013","publist_id":"3938","article_type":"original","date_created":"2018-12-11T11:59:57Z","volume":79,"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."}],"month":"08"}]