[{"doi":"10.1145/2491956.2462184","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"type":"conference","quality_controlled":"1","_id":"2301","abstract":[{"lang":"eng","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."}],"publist_id":"4626","month":"06","language":[{"iso":"eng"}],"title":"P: Safe asynchronous event-driven programming","status":"public","department":[{"_id":"ToHe"}],"conference":{"name":"PLDI: Programming Languages Design and Implementation","location":"Seattle, WA, United States","end_date":"2013-06-19","start_date":"2013-06-16"},"scopus_import":1,"date_updated":"2021-01-12T06:56:38Z","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","year":"2013","publisher":"ACM","publication":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","date_published":"2013-06-01T00:00:00Z","citation":{"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>.","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.","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>.","apa":"Desai, A., Gupta, V., Jackson, E., Qadeer, S., Rajamani, S., &#38; Zufferey, D. (2013). P: Safe asynchronous event-driven programming. In <i>Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation</i> (pp. 321–331). Seattle, WA, United States: ACM. <a href=\"https://doi.org/10.1145/2491956.2462184\">https://doi.org/10.1145/2491956.2462184</a>","ama":"Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. P: Safe asynchronous event-driven programming. In: <i>Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>. ACM; 2013:321-331. doi:<a href=\"https://doi.org/10.1145/2491956.2462184\">10.1145/2491956.2462184</a>","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."},"date_created":"2018-12-11T11:56:52Z","day":"01","page":"321 - 331","ec_funded":1,"author":[{"first_name":"Ankush","full_name":"Desai, Ankush","last_name":"Desai"},{"full_name":"Gupta, Vivek","first_name":"Vivek","last_name":"Gupta"},{"last_name":"Jackson","full_name":"Jackson, Ethan","first_name":"Ethan"},{"last_name":"Qadeer","first_name":"Shaz","full_name":"Qadeer, Shaz"},{"full_name":"Rajamani, Sriram","first_name":"Sriram","last_name":"Rajamani"},{"first_name":"Damien","full_name":"Zufferey, Damien","last_name":"Zufferey","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87"}],"main_file_link":[{"url":"http://research.microsoft.com/pubs/191069/pldi212_desai.pdf"}]},{"oa_version":"Submitted Version","alternative_title":["LNCS"],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5417"}]},"oa":1,"date_updated":"2024-10-21T06:02:58Z","volume":8052,"page":"273 - 287","publisher":"Springer","intvolume":"      8052","date_created":"2018-12-11T11:57:00Z","ddc":["005","000"],"citation":{"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>.","short":"T.A. Henzinger, J. Otop, 8052 (2013) 273–287.","ista":"Henzinger TA, Otop J. 2013. From model checking to model measuring. 8052, 273–287.","apa":"Henzinger, T. A., &#38; Otop, J. (2013). From model checking to model measuring. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Springer. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_20\">https://doi.org/10.1007/978-3-642-40184-8_20</a>","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>.","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."},"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"month":"08","has_accepted_license":"1","_id":"2327","publist_id":"4599","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."}],"type":"conference","scopus_import":"1","file_date_updated":"2020-07-14T12:45:38Z","conference":{"end_date":"2013-08-30","location":"Buenos Aires, Argentina","start_date":"2013-08-27","name":"CONCUR: Concurrency Theory"},"status":"public","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","corr_author":"1","day":"01","pubrep_id":"129","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Otop, Jan"}],"date_published":"2013-08-01T00:00:00Z","doi":"10.1007/978-3-642-40184-8_20","quality_controlled":"1","file":[{"date_updated":"2020-07-14T12:45:38Z","creator":"system","file_id":"5301","access_level":"open_access","file_name":"IST-2013-129-v1+1_concur.pdf","date_created":"2018-12-12T10:17:45Z","relation":"main_file","checksum":"4c04695c4bfdf2119cd4f5d1babc3e8a","content_type":"application/pdf","file_size":378587}],"department":[{"_id":"ToHe"}],"title":"From model checking to model measuring"},{"doi":"10.1007/978-3-642-39799-8_68","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","department":[{"_id":"ToHe"}],"title":"Efficient synthesis for concurrency by semantics-preserving transformations","file":[{"relation":"main_file","date_created":"2018-12-12T10:15:37Z","content_type":"application/pdf","checksum":"70c70ca5487faba82262c63e1b678a27","file_size":365548,"date_updated":"2020-07-14T12:45:40Z","creator":"system","file_name":"IST-2014-199-v1+1_cav2013-final.pdf","file_id":"5158","access_level":"open_access"}],"publication_status":"published","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","pubrep_id":"199","author":[{"last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","full_name":"Cerny, Pavol"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"full_name":"Radhakrishna, Arjun","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna"},{"last_name":"Ryzhyk","first_name":"Leonid","full_name":"Ryzhyk, Leonid"},{"full_name":"Tarrach, Thorsten","first_name":"Thorsten","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4409-8487","last_name":"Tarrach"}],"date_published":"2013-07-01T00:00:00Z","has_accepted_license":"1","_id":"2445","publist_id":"4458","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"}],"type":"conference","language":[{"iso":"eng"}],"month":"07","status":"public","file_date_updated":"2020-07-14T12:45:40Z","scopus_import":1,"conference":{"name":"CAV: Computer Aided Verification","start_date":"2013-07-13","location":"St. Petersburg, Russia","end_date":"2013-07-19"},"related_material":{"record":[{"id":"1130","status":"public","relation":"dissertation_contains"}]},"date_updated":"2026-04-09T10:54:00Z","oa":1,"oa_version":"Submitted Version","alternative_title":["LNCS"],"page":"951 - 967","ec_funded":1,"publisher":"Springer","citation":{"short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, T. Tarrach, in:, Springer, 2013, pp. 951–967.","mla":"Cerny, Pavol, et al. <i>Efficient Synthesis for Concurrency by Semantics-Preserving Transformations</i>. Vol. 8044, Springer, 2013, pp. 951–67, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_68\">10.1007/978-3-642-39799-8_68</a>.","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>","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>.","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>","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."},"date_created":"2018-12-11T11:57:42Z","ddc":["000","004"],"intvolume":"      8044","volume":8044},{"file":[{"creator":"dernst","date_updated":"2020-07-14T12:45:41Z","file_name":"2013_CAV_Piskac.pdf","file_id":"7859","access_level":"open_access","content_type":"application/pdf","checksum":"2e866932ab688f47ecd504acb4d5c7d4","relation":"main_file","date_created":"2020-05-15T11:13:01Z","file_size":309182}],"title":"Automating separation logic using SMT","department":[{"_id":"ToHe"}],"quality_controlled":"1","doi":"10.1007/978-3-642-39799-8_54","article_processing_charge":"No","date_published":"2013-07-01T00:00:00Z","author":[{"last_name":"Piskac","first_name":"Ruzica","full_name":"Piskac, Ruzica"},{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","last_name":"Wies","full_name":"Wies, Thomas","first_name":"Thomas"},{"last_name":"Zufferey","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","full_name":"Zufferey, Damien"}],"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","publication_status":"published","conference":{"start_date":"2013-07-13","end_date":"2013-07-19","location":"St. Petersburg, Russia","name":"CAV: Computer Aided Verification"},"file_date_updated":"2020-07-14T12:45:41Z","scopus_import":1,"status":"public","month":"07","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","type":"conference","abstract":[{"lang":"eng","text":"Separation logic (SL) has gained widespread popularity because of its ability to succinctly express complex invariants of a program’s heap configurations. Several specialized provers have been developed for decidable SL fragments. However, these provers cannot be easily extended or combined with solvers for other theories that are important in program verification, e.g., linear arithmetic. In this paper, we present a reduction of decidable SL fragments to a decidable first-order theory that fits well into the satisfiability modulo theories (SMT) framework. We show how to use this reduction to automate satisfiability, entailment, frame inference, and abduction problems for separation logic using SMT solvers. Our approach provides a simple method of integrating separation logic into existing verification tools that provide SMT backends, and an elegant way of combining SL fragments with other decidable first-order theories. We implemented this approach in a verification tool and applied it to heap-manipulating programs whose verification involves reasoning in theory combinations.\r\n"}],"publist_id":"4456","_id":"2447","has_accepted_license":"1","volume":8044,"intvolume":"      8044","date_created":"2018-12-11T11:57:43Z","ddc":["000"],"citation":{"ama":"Piskac R, Wies T, Zufferey D. Automating separation logic using SMT. 2013;8044:773-789. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_54\">10.1007/978-3-642-39799-8_54</a>","ieee":"R. Piskac, T. Wies, and D. Zufferey, “Automating separation logic using SMT,” vol. 8044. Springer, pp. 773–789, 2013.","ista":"Piskac R, Wies T, Zufferey D. 2013. Automating separation logic using SMT. 8044, 773–789.","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>.","apa":"Piskac, R., Wies, T., &#38; Zufferey, D. (2013). Automating separation logic using SMT. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_54\">https://doi.org/10.1007/978-3-642-39799-8_54</a>","short":"R. Piskac, T. Wies, D. Zufferey, 8044 (2013) 773–789.","mla":"Piskac, Ruzica, et al. <i>Automating Separation Logic Using SMT</i>. Vol. 8044, Springer, 2013, pp. 773–89, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_54\">10.1007/978-3-642-39799-8_54</a>."},"publisher":"Springer","page":"773 - 789","alternative_title":["LNCS"],"oa_version":"Submitted Version","date_updated":"2020-08-11T10:09:47Z","oa":1},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","publication_status":"published","article_processing_charge":"No","date_published":"2013-07-01T00:00:00Z","day":"01","author":[{"full_name":"Almagor, Shaull","first_name":"Shaull","last_name":"Almagor"},{"first_name":"Udi","full_name":"Boker, Udi","last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kupferman","first_name":"Orna","full_name":"Kupferman, Orna"}],"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"doi":"10.1007/978-3-642-39212-2_3","quality_controlled":"1","file":[{"file_name":"2013_ICALP_Almagor.pdf","access_level":"open_access","file_id":"7860","creator":"dernst","date_updated":"2020-07-14T12:45:42Z","file_size":363031,"content_type":"application/pdf","checksum":"85afbf6c18a2c7e377c52c9410e2d824","relation":"main_file","date_created":"2020-05-15T11:16:12Z"}],"title":"Formalizing and reasoning about quality","department":[{"_id":"ToHe"}],"alternative_title":["LNCS"],"oa_version":"Submitted Version","oa":1,"date_updated":"2020-08-11T10:09:47Z","volume":7966,"publisher":"Springer","ddc":["000"],"citation":{"mla":"Almagor, Shaull, et al. <i>Formalizing and Reasoning about Quality</i>. Vol. 7966, no. Part 2, Springer, 2013, pp. 15–27, doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_3\">10.1007/978-3-642-39212-2_3</a>.","short":"S. Almagor, U. Boker, O. Kupferman, 7966 (2013) 15–27.","ista":"Almagor S, Boker U, Kupferman O. 2013. Formalizing and reasoning about quality. 7966(Part 2), 15–27.","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>","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>.","ieee":"S. Almagor, U. Boker, and O. Kupferman, “Formalizing and reasoning about quality,” vol. 7966, no. Part 2. Springer, pp. 15–27, 2013.","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>"},"intvolume":"      7966","date_created":"2018-12-11T11:58:08Z","ec_funded":1,"page":"15 - 27","month":"07","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"type":"conference","has_accepted_license":"1","_id":"2517","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."}],"publist_id":"4384","conference":{"name":"ICALP: Automata, Languages and Programming","start_date":"2013-07-08","location":"Riga, Latvia","end_date":"2013-07-12"},"issue":"Part 2","scopus_import":1,"file_date_updated":"2020-07-14T12:45:42Z","acknowledgement":"ERC Grant QUALITY. ","status":"public"},{"date_published":"2013-03-01T00:00:00Z","day":"01","author":[{"last_name":"Bansal","full_name":"Bansal, Kshitij","first_name":"Kshitij"},{"last_name":"Koskinen","full_name":"Koskinen, Eric","first_name":"Eric"},{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","last_name":"Wies","full_name":"Wies, Thomas","first_name":"Thomas"},{"full_name":"Zufferey, Damien","first_name":"Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey"}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","title":"Structural Counter Abstraction","department":[{"_id":"ToHe"}],"project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/978-3-642-36742-7_5","quality_controlled":"1","editor":[{"first_name":"Nir","full_name":"Piterman, Nir","last_name":"Piterman"},{"last_name":"Smolka","full_name":"Smolka, Scott","first_name":"Scott"}],"publisher":"Springer","date_created":"2018-12-11T11:59:54Z","intvolume":"      7795","citation":{"short":"K. Bansal, E. Koskinen, T. Wies, D. Zufferey, 7795 (2013) 62–77.","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>.","ieee":"K. Bansal, E. Koskinen, T. Wies, and D. Zufferey, “Structural Counter Abstraction,” vol. 7795. Springer, pp. 62–77, 2013.","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>","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>","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."},"ec_funded":1,"page":"62 - 77","volume":7795,"main_file_link":[{"url":"http://arise.or.at/pubpdf/Structural_Counter_Abstraction.pdf","open_access":"1"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"1405"}]},"date_updated":"2026-04-09T14:35:24Z","oa":1,"alternative_title":["LNCS"],"oa_version":"Submitted Version","status":"public","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2013-03-16","location":"Rome, Italy","end_date":"2013-03-24"},"scopus_import":1,"type":"conference","_id":"2847","publist_id":"3947","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"}],"month":"03","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}]},{"status":"public","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","scopus_import":"1","file_date_updated":"2020-07-14T12:45:51Z","issue":"5","publist_id":"3938","abstract":[{"lang":"eng","text":"We consider concurrent games played on graphs. At every round of a game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state. Two basic objectives are the safety objective to stay forever in a given set of states, and its dual, the reachability objective to reach a given set of states. First, we present a simple proof of the fact that in concurrent reachability games, for all ε&gt;0, memoryless ε-optimal strategies exist. A memoryless strategy is independent of the history of plays, and an ε-optimal strategy achieves the objective with probability within ε of the value of the game. In contrast to previous proofs of this fact, our proof is more elementary and more combinatorial. Second, we present a strategy-improvement (a.k.a. policy-iteration) algorithm for concurrent games with reachability objectives. Finally, we present a strategy-improvement algorithm for turn-based stochastic games (where each player selects moves in turns) with safety objectives. Our algorithms yield sequences of player-1 strategies which ensure probabilities of winning that converge monotonically (from below) to the value of the game. © 2012 Elsevier Inc."}],"_id":"2854","has_accepted_license":"1","type":"journal_article","language":[{"iso":"eng"}],"external_id":{"isi":["000316837300011"]},"isi":1,"month":"08","page":"640 - 657","ec_funded":1,"intvolume":"        79","ddc":["000"],"citation":{"apa":"Chatterjee, K., De Alfaro, L., &#38; Henzinger, T. A. (2013). Strategy improvement for concurrent reachability and turn based stochastic safety games. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jcss.2012.12.001\">https://doi.org/10.1016/j.jcss.2012.12.001</a>","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>.","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.","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>","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.","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>.","short":"K. Chatterjee, L. De Alfaro, T.A. Henzinger, Journal of Computer and System Sciences 79 (2013) 640–657."},"date_created":"2018-12-11T11:59:57Z","publication":"Journal of Computer and System Sciences","publisher":"Elsevier","article_type":"original","volume":79,"date_updated":"2025-09-29T13:40:38Z","oa":1,"oa_version":"Published Version","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Strategy improvement for concurrent reachability and turn based stochastic safety games","file":[{"date_created":"2018-12-12T10:18:48Z","relation":"main_file","checksum":"6d3ee12cceb946a0abe69594b6a22409","content_type":"application/pdf","file_size":425488,"date_updated":"2020-07-14T12:45:51Z","creator":"system","access_level":"open_access","file_id":"5370","file_name":"IST-2015-388-v1+1_1-s2.0-S0022000012001778-main.pdf"}],"quality_controlled":"1","doi":"10.1016/j.jcss.2012.12.001","project":[{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"pubrep_id":"388","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Luca","full_name":"De Alfaro, Luca","last_name":"De Alfaro"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"day":"01","date_published":"2013-08-01T00:00:00Z","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"corr_author":"1","article_processing_charge":"No","publication_status":"published","year":"2013","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"month":"01","editor":[{"last_name":"Kucera","full_name":"Kucera, Antonin","first_name":"Antonin"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"full_name":"Nesetril, Jaroslav","first_name":"Jaroslav","last_name":"Nesetril"},{"last_name":"Vojnar","first_name":"Tomas","full_name":"Vojnar, Tomas"},{"first_name":"David","full_name":"Antos, David","last_name":"Antos"}],"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","quality_controlled":"1","type":"conference_editor","doi":"10.1007/978-3-642-36046-6","abstract":[{"text":"This volume contains the post-proceedings of the 8th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2012, held in Znojmo, Czech Republic, in October, 2012. The 13 thoroughly revised papers were carefully selected out of 31 submissions and are presented together with 6 invited papers. The topics covered by the papers include: computer-aided analysis and verification, applications of game theory in computer science, networks and security, modern trends of graph theory in computer science, electronic systems design and testing, and quantum information processing.","lang":"eng"}],"publist_id":"3874","_id":"2885","conference":{"name":"MEMICS: Mathematical and Engineering methods in computer science","start_date":"2012-10-25","location":"Znojmo, Czech Republic","end_date":"2012-10-28"},"status":"public","title":"Mathematical and Engineering Methods in Computer Science","acknowledgement":"Red Hat Czech Republic, Y Soft","department":[{"_id":"ToHe"}],"alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","oa_version":"None","date_updated":"2019-08-02T12:37:55Z","publication_status":"published","volume":7721,"date_created":"2018-12-11T12:00:08Z","citation":{"ama":"Kucera A, Henzinger TA, Nesetril J, Vojnar T, Antos D, eds. <i>Mathematical and Engineering Methods in Computer Science</i>. Vol 7721. Springer; 2013:1-228. doi:<a href=\"https://doi.org/10.1007/978-3-642-36046-6\">10.1007/978-3-642-36046-6</a>","ieee":"A. Kucera, T. A. Henzinger, J. Nesetril, T. Vojnar, and D. Antos, Eds., <i>Mathematical and Engineering Methods in Computer Science</i>, vol. 7721. Springer, 2013, pp. 1–228.","ista":"Kucera A, Henzinger TA, Nesetril J, Vojnar T, Antos D eds. 2013. Mathematical and Engineering Methods in Computer Science, Springer,p.","chicago":"Kucera, Antonin, Thomas A Henzinger, Jaroslav Nesetril, Tomas Vojnar, and David Antos, eds. <i>Mathematical and Engineering Methods in Computer Science</i>. Vol. 7721. Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-36046-6\">https://doi.org/10.1007/978-3-642-36046-6</a>.","apa":"Kucera, A., Henzinger, T. A., Nesetril, J., Vojnar, T., &#38; Antos, D. (Eds.). (2013). <i>Mathematical and Engineering Methods in Computer Science</i> (Vol. 7721, pp. 1–228). Presented at the MEMICS: Mathematical and Engineering methods in computer science, Znojmo, Czech Republic: Springer. <a href=\"https://doi.org/10.1007/978-3-642-36046-6\">https://doi.org/10.1007/978-3-642-36046-6</a>","short":"A. Kucera, T.A. Henzinger, J. Nesetril, T. Vojnar, D. Antos, eds., Mathematical and Engineering Methods in Computer Science, Springer, 2013.","mla":"Kucera, Antonin, et al., editors. <i>Mathematical and Engineering Methods in Computer Science</i>. Vol. 7721, Springer, 2013, pp. 1–228, doi:<a href=\"https://doi.org/10.1007/978-3-642-36046-6\">10.1007/978-3-642-36046-6</a>."},"intvolume":"      7721","publisher":"Springer","date_published":"2013-01-09T00:00:00Z","page":"1 - 228","day":"09"},{"oa_version":"Submitted Version","date_updated":"2023-02-21T16:06:49Z","oa":1,"related_material":{"record":[{"status":"deleted","relation":"later_version","id":"10901"}]},"publication_identifier":{"isbn":["978-1-4503-1832-7"]},"ec_funded":1,"page":"317 - 328","ddc":["000","004"],"citation":{"short":"T.A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, A. Sokolova, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–328.","mla":"Henzinger, Thomas A., et al. “Quantitative Relaxation of Concurrent Data Structures.” <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, ACM, 2013, pp. 317–28, doi:<a href=\"https://doi.org/10.1145/2429069.2429109\">10.1145/2429069.2429109</a>.","ieee":"T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative relaxation of concurrent data structures,” in <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i>, Rome, Italy, 2013, pp. 317–328.","ama":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. Quantitative relaxation of concurrent data structures. In: <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>. ACM; 2013:317-328. doi:<a href=\"https://doi.org/10.1145/2429069.2429109\">10.1145/2429069.2429109</a>","apa":"Henzinger, T. A., Kirsch, C., Payer, H., Sezgin, A., &#38; Sokolova, A. (2013). Quantitative relaxation of concurrent data structures. In <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i> (pp. 317–328). Rome, Italy: ACM. <a href=\"https://doi.org/10.1145/2429069.2429109\">https://doi.org/10.1145/2429069.2429109</a>","chicago":"Henzinger, Thomas A, Christoph Kirsch, Hannes Payer, Ali Sezgin, and Ana Sokolova. “Quantitative Relaxation of Concurrent Data Structures.” In <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, 317–28. ACM, 2013. <a href=\"https://doi.org/10.1145/2429069.2429109\">https://doi.org/10.1145/2429069.2429109</a>.","ista":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. 2013. Quantitative relaxation of concurrent data structures. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 317–328."},"date_created":"2018-12-11T11:56:11Z","publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","publisher":"ACM","language":[{"iso":"eng"}],"month":"01","abstract":[{"lang":"eng","text":"There is a trade-off between performance and correctness in implementing concurrent data structures. Better performance may be achieved at the expense of relaxing correctness, by redefining the semantics of data structures. We address such a redefinition of data structure semantics and present a systematic and formal framework for obtaining new data structures by quantitatively relaxing existing ones. We view a data structure as a sequential specification S containing all &quot;legal&quot; sequences over an alphabet of method calls. Relaxing the data structure corresponds to defining a distance from any sequence over the alphabet to the sequential specification: the k-relaxed sequential specification contains all sequences over the alphabet within distance k from the original specification. In contrast to other existing work, our relaxations are semantic (distance in terms of data structure states). As an instantiation of our framework, we present two simple yet generic relaxation schemes, called out-of-order and stuttering relaxation, along with several ways of computing distances. We show that the out-of-order relaxation, when further instantiated to stacks, queues, and priority queues, amounts to tolerating bounded out-of-order behavior, which cannot be captured by a purely syntactic relaxation (distance in terms of sequence manipulation, e.g. edit distance). We give concurrent implementations of relaxed data structures and demonstrate that bounded relaxations provide the means for trading correctness for performance in a controlled way. The relaxations are monotonic which further highlights the trade-off: increasing k increases the number of permitted sequences, which as we demonstrate can lead to better performance. Finally, since a relaxed stack or queue also implements a pool, we actually have new concurrent pool implementations that outperform the state-of-the-art ones."}],"publist_id":"4801","has_accepted_license":"1","_id":"2181","type":"conference","file_date_updated":"2020-07-14T12:45:31Z","scopus_import":1,"conference":{"name":"POPL: Principles of Programming Languages","end_date":"2013-01-25","location":"Rome, Italy","start_date":"2013-01-23"},"status":"public","acknowledgement":" and an Elise Richter Fellowship (Austrian Science Fund V00125). ","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","pubrep_id":"198","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"last_name":"Kirsch","full_name":"Kirsch, Christoph","first_name":"Christoph"},{"last_name":"Payer","first_name":"Hannes","full_name":"Payer, Hannes"},{"last_name":"Sezgin","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","first_name":"Ali","full_name":"Sezgin, Ali"},{"last_name":"Sokolova","first_name":"Ana","full_name":"Sokolova, Ana"}],"day":"01","date_published":"2013-01-01T00:00:00Z","quality_controlled":"1","doi":"10.1145/2429069.2429109","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"file":[{"access_level":"open_access","file_id":"5086","file_name":"IST-2014-198-v1+1_popl128-henzinger-clean.pdf","creator":"system","date_updated":"2020-07-14T12:45:31Z","file_size":294689,"checksum":"adf465e70948f4e80e48057524516456","content_type":"application/pdf","date_created":"2018-12-12T10:14:33Z","relation":"main_file"}],"department":[{"_id":"ToHe"}],"title":"Quantitative relaxation of concurrent data structures"},{"department":[{"_id":"ToHe"}],"title":"Quantitative abstraction refinement","status":"public","scopus_import":1,"conference":{"end_date":"2013-01-25","location":"Rome, Italy","start_date":"2013-07-23","name":"POPL: Principles of Programming Languages"},"publist_id":"4800","abstract":[{"lang":"eng","text":"We propose a general framework for abstraction with respect to quantitative properties, such as worst-case execution time, or power consumption. Our framework provides a systematic way for counter-example guided abstraction refinement for quantitative properties. The salient aspect of the framework is that it allows anytime verification, that is, verification algorithms that can be stopped at any time (for example, due to exhaustion of memory), and report approximations that improve monotonically when the algorithms are given more time. We instantiate the framework with a number of quantitative abstractions and refinement schemes, which differ in terms of how much quantitative information they keep from the original system. We introduce both state-based and trace-based quantitative abstractions, and we describe conditions that define classes of quantitative properties for which the abstractions provide over-approximations. We give algorithms for evaluating the quantitative properties on the abstract systems. We present algorithms for counter-example based refinements for quantitative properties for both state-based and segment-based abstractions. We perform a case study on worst-case execution time of executables to evaluate the anytime verification aspect and the quantitative abstractions we proposed."}],"_id":"2182","quality_controlled":"1","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"}],"doi":"10.1145/2429069.2429085","type":"conference","language":[{"iso":"eng"}],"month":"01","author":[{"full_name":"Cerny, Pavol","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"first_name":"Arjun","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"page":"115 - 128","ec_funded":1,"day":"01","date_created":"2018-12-11T11:56:11Z","citation":{"mla":"Cerny, Pavol, et al. “Quantitative Abstraction Refinement.” <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, ACM, 2013, pp. 115–28, doi:<a href=\"https://doi.org/10.1145/2429069.2429085\">10.1145/2429069.2429085</a>.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–128.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Abstraction Refinement.” In <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, 115–28. ACM, 2013. <a href=\"https://doi.org/10.1145/2429069.2429085\">https://doi.org/10.1145/2429069.2429085</a>.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2013). Quantitative abstraction refinement. In <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i> (pp. 115–128). Rome, Italy: ACM. <a href=\"https://doi.org/10.1145/2429069.2429085\">https://doi.org/10.1145/2429069.2429085</a>","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2013. Quantitative abstraction refinement. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 115–128.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative abstraction refinement,” in <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i>, Rome, Italy, 2013, pp. 115–128.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Quantitative abstraction refinement. In: <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>. ACM; 2013:115-128. doi:<a href=\"https://doi.org/10.1145/2429069.2429085\">10.1145/2429069.2429085</a>"},"publisher":"ACM","publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","date_published":"2013-01-01T00:00:00Z","corr_author":"1","publication_status":"published","date_updated":"2024-10-09T20:55:21Z","oa_version":"None","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publist_id":"5835","abstract":[{"text":"We consider the distributed synthesis problem for temporal logic specifications. Traditionally, the problem has been studied for LTL, and the previous results show that the problem is decidable iff there is no information fork in the architecture. We consider the problem for fragments of LTL and our main results are as follows: (1) We show that the problem is undecidable for architectures with information forks even for the fragment of LTL with temporal operators restricted to next and eventually. (2) For specifications restricted to globally along with non-nested next operators, we establish decidability (in EXPSPACE) for star architectures where the processes receive disjoint inputs, whereas we establish undecidability for architectures containing an information fork-meet structure. (3) Finally, we consider LTL without the next operator, and establish decidability (NEXPTIME-complete) for all architectures for a fragment that consists of a set of safety assumptions, and a set of guarantees where each guarantee is a safety, reachability, or liveness condition.","lang":"eng"}],"_id":"1376","OA_place":"repository","type":"conference","language":[{"iso":"eng"}],"month":"12","status":"public","scopus_import":"1","conference":{"location":"Portland, OR, United States","end_date":"2013-10-23","start_date":"2013-10-20","name":"FMCAD: Formal Methods in Computer-Aided Design"},"date_updated":"2025-06-26T08:33:43Z","oa":1,"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5406"}]},"oa_version":"Preprint","page":"18 - 25","ec_funded":1,"citation":{"mla":"Chatterjee, Krishnendu, et al. “Distributed Synthesis for LTL Fragments.” <i>13th International Conference on Formal Methods in Computer-Aided Design</i>, IEEE, 2013, pp. 18–25, doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">10.1109/FMCAD.2013.6679386</a>.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, in:, 13th International Conference on Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 18–25.","ista":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL fragments. 13th International Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 18–25.","apa":"Chatterjee, K., Henzinger, T. A., Otop, J., &#38; Pavlogiannis, A. (2013). Distributed synthesis for LTL fragments. In <i>13th International Conference on Formal Methods in Computer-Aided Design</i> (pp. 18–25). Portland, OR, United States: IEEE. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">https://doi.org/10.1109/FMCAD.2013.6679386</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. “Distributed Synthesis for LTL Fragments.” In <i>13th International Conference on Formal Methods in Computer-Aided Design</i>, 18–25. IEEE, 2013. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">https://doi.org/10.1109/FMCAD.2013.6679386</a>.","ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed synthesis for LTL fragments,” in <i>13th International Conference on Formal Methods in Computer-Aided Design</i>, Portland, OR, United States, 2013, pp. 18–25.","ama":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. Distributed synthesis for LTL fragments. In: <i>13th International Conference on Formal Methods in Computer-Aided Design</i>. IEEE; 2013:18-25. doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">10.1109/FMCAD.2013.6679386</a>"},"date_created":"2018-12-11T11:51:40Z","publisher":"IEEE","publication":"13th International Conference on Formal Methods in Computer-Aided Design","OA_type":"green","main_file_link":[{"open_access":"1","url":"https://doi.org/10.15479/AT:IST-2013-130-v1-1"}],"quality_controlled":"1","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"doi":"10.1109/FMCAD.2013.6679386","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Distributed synthesis for LTL fragments","publication_status":"published","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"full_name":"Otop, Jan","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop"},{"last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","full_name":"Pavlogiannis, Andreas"}],"day":"11","date_published":"2013-12-11T00:00:00Z","corr_author":"1","article_processing_charge":"No"},{"doi":"10.1109/FMCAD.2013.6679394","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"quality_controlled":"1","department":[{"_id":"ToHe"}],"title":"Synthesizing multiple boolean functions using interpolation on a single proof","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","arxiv":1,"day":"11","author":[{"last_name":"Hofferek","full_name":"Hofferek, Georg","first_name":"Georg"},{"last_name":"Gupta","id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh","full_name":"Gupta, Ashutosh"},{"last_name":"Könighofer","full_name":"Könighofer, Bettina","first_name":"Bettina"},{"last_name":"Jiang","first_name":"Jie","full_name":"Jiang, Jie"},{"last_name":"Bloem","full_name":"Bloem, Roderick","first_name":"Roderick"}],"date_published":"2013-12-11T00:00:00Z","language":[{"iso":"eng"}],"external_id":{"arxiv":["1308.4767"]},"month":"12","_id":"1385","abstract":[{"lang":"eng","text":"It is often difficult to correctly implement a Boolean controller for a complex system, especially when concurrency is involved. Yet, it may be easy to formally specify a controller. For instance, for a pipelined processor it suffices to state that the visible behavior of the pipelined system should be identical to a non-pipelined reference system (Burch-Dill paradigm). We present a novel procedure to efficiently synthesize multiple Boolean control signals from a specification given as a quantified first-order formula (with a specific quantifier structure). Our approach uses uninterpreted functions to abstract details of the design. We construct an unsatisfiable SMT formula from the given specification. Then, from just one proof of unsatisfiability, we use a variant of Craig interpolation to compute multiple coordinated interpolants that implement the Boolean control signals. Our method avoids iterative learning and back-substitution of the control functions. We applied our approach to synthesize a controller for a simple two-stage pipelined processor, and present first experimental results."}],"publist_id":"5825","type":"conference","scopus_import":"1","conference":{"name":"FMCAD: Formal Methods in Computer-Aided Design","location":"Portland, OR, United States","end_date":"2013-10-23","start_date":"2013-10-20"},"acknowledgement":"This research was supported by the European Commission through project\r\nDIAMOND  (FP7-2009-IST-4-248613), and  QUAINT  (I774-N23),  ","status":"public","oa_version":"Preprint","date_updated":"2024-10-21T06:02:56Z","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1308.4767"}],"page":"77 - 84","ec_funded":1,"publication":"2013 Formal Methods in Computer-Aided Design","publisher":"IEEE","date_created":"2018-12-11T11:51:43Z","citation":{"mla":"Hofferek, Georg, et al. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” <i>2013 Formal Methods in Computer-Aided Design</i>, IEEE, 2013, pp. 77–84, doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">10.1109/FMCAD.2013.6679394</a>.","short":"G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, R. Bloem, in:, 2013 Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 77–84.","chicago":"Hofferek, Georg, Ashutosh Gupta, Bettina Könighofer, Jie Jiang, and Roderick Bloem. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” In <i>2013 Formal Methods in Computer-Aided Design</i>, 77–84. IEEE, 2013. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">https://doi.org/10.1109/FMCAD.2013.6679394</a>.","apa":"Hofferek, G., Gupta, A., Könighofer, B., Jiang, J., &#38; Bloem, R. (2013). Synthesizing multiple boolean functions using interpolation on a single proof. In <i>2013 Formal Methods in Computer-Aided Design</i> (pp. 77–84). Portland, OR, United States: IEEE. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">https://doi.org/10.1109/FMCAD.2013.6679394</a>","ista":"Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. 2013. Synthesizing multiple boolean functions using interpolation on a single proof. 2013 Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 77–84.","ama":"Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. Synthesizing multiple boolean functions using interpolation on a single proof. In: <i>2013 Formal Methods in Computer-Aided Design</i>. IEEE; 2013:77-84. doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">10.1109/FMCAD.2013.6679394</a>","ieee":"G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, and R. Bloem, “Synthesizing multiple boolean functions using interpolation on a single proof,” in <i>2013 Formal Methods in Computer-Aided Design</i>, Portland, OR, United States, 2013, pp. 77–84."}},{"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","date_published":"2013-07-01T00:00:00Z","author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","full_name":"Boker, Udi","first_name":"Udi"},{"last_name":"Kuperberg","first_name":"Denis","full_name":"Kuperberg, Denis"},{"first_name":"Orna","full_name":"Kupferman, Orna","last_name":"Kupferman"},{"last_name":"Skrzypczak","first_name":"Michał","full_name":"Skrzypczak, Michał"}],"day":"01","article_processing_charge":"No","quality_controlled":"1","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"doi":"10.1007/978-3-642-39212-2_11","title":"Nondeterminism in the presence of a diverse or unknown future","department":[{"_id":"ToHe"}],"file":[{"file_size":276982,"checksum":"98bc02e3793072e279ec8d364b381ff3","content_type":"application/pdf","date_created":"2020-05-15T11:05:50Z","relation":"main_file","file_id":"7857","access_level":"open_access","file_name":"2013_ICALP_Boker.pdf","creator":"dernst","date_updated":"2020-07-14T12:44:48Z"}],"date_updated":"2020-08-11T10:09:09Z","oa":1,"alternative_title":["LNCS"],"oa_version":"Submitted Version","ddc":["000"],"citation":{"short":"U. Boker, D. Kuperberg, O. Kupferman, M. Skrzypczak, 7966 (2013) 89–100.","mla":"Boker, Udi, et al. <i>Nondeterminism in the Presence of a Diverse or Unknown Future</i>. Vol. 7966, no. PART 2, Springer, 2013, pp. 89–100, doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">10.1007/978-3-642-39212-2_11</a>.","ieee":"U. Boker, D. Kuperberg, O. Kupferman, and M. Skrzypczak, “Nondeterminism in the presence of a diverse or unknown future,” vol. 7966, no. PART 2. Springer, pp. 89–100, 2013.","ama":"Boker U, Kuperberg D, Kupferman O, Skrzypczak M. Nondeterminism in the presence of a diverse or unknown future. 2013;7966(PART 2):89-100. doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">10.1007/978-3-642-39212-2_11</a>","ista":"Boker U, Kuperberg D, Kupferman O, Skrzypczak M. 2013. Nondeterminism in the presence of a diverse or unknown future. 7966(PART 2), 89–100.","apa":"Boker, U., Kuperberg, D., Kupferman, O., &#38; Skrzypczak, M. (2013). Nondeterminism in the presence of a diverse or unknown future. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">https://doi.org/10.1007/978-3-642-39212-2_11</a>","chicago":"Boker, Udi, Denis Kuperberg, Orna Kupferman, and Michał Skrzypczak. “Nondeterminism in the Presence of a Diverse or Unknown Future.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">https://doi.org/10.1007/978-3-642-39212-2_11</a>."},"date_created":"2018-12-11T11:51:44Z","intvolume":"      7966","publisher":"Springer","page":"89 - 100","ec_funded":1,"volume":7966,"type":"conference","abstract":[{"text":"Choices made by nondeterministic word automata depend on both the past (the prefix of the word read so far) and the future (the suffix yet to be read). In several applications, most notably synthesis, the future is diverse or unknown, leading to algorithms that are based on deterministic automata. Hoping to retain some of the advantages of nondeterministic automata, researchers have studied restricted classes of nondeterministic automata. Three such classes are nondeterministic automata that are good for trees (GFT; i.e., ones that can be expanded to tree automata accepting the derived tree languages, thus whose choices should satisfy diverse futures), good for games (GFG; i.e., ones whose choices depend only on the past), and determinizable by pruning (DBP; i.e., ones that embody equivalent deterministic automata). The theoretical properties and relative merits of the different classes are still open, having vagueness on whether they really differ from deterministic automata. In particular, while DBP ⊆ GFG ⊆ GFT, it is not known whether every GFT automaton is GFG and whether every GFG automaton is DBP. Also open is the possible succinctness of GFG and GFT automata compared to deterministic automata. We study these problems for ω-regular automata with all common acceptance conditions. We show that GFT=GFG⊃DBP, and describe a determinization construction for GFG automata.","lang":"eng"}],"publist_id":"5823","has_accepted_license":"1","_id":"1387","month":"07","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","status":"public","acknowledgement":"and ERC Grant QUALITY.","issue":"PART 2","conference":{"start_date":"2013-07-08","location":"Riga, Latvia","end_date":"2013-07-12","name":"ICALP: Automata, Languages and Programming"},"scopus_import":1,"file_date_updated":"2020-07-14T12:44:48Z"},{"alternative_title":["ISTA Thesis"],"oa_version":"Published Version","date_updated":"2026-04-09T14:35:24Z","oa":1,"related_material":{"record":[{"id":"4361","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"3251"},{"relation":"part_of_dissertation","status":"public","id":"2847"}]},"publication_identifier":{"issn":["2663-337X"]},"main_file_link":[{"url":"http://dzufferey.github.io/files/2013_thesis.pdf"}],"citation":{"mla":"Zufferey, Damien. <i>Analysis of Dynamic Message Passing Programs</i>. Institute of Science and Technology Austria, 2013, doi:<a href=\"https://doi.org/10.15479/at:ista:1405\">10.15479/at:ista:1405</a>.","short":"D. Zufferey, Analysis of Dynamic Message Passing Programs, Institute of Science and Technology Austria, 2013.","ista":"Zufferey D. 2013. Analysis of dynamic message passing programs. Institute of Science and Technology Austria.","apa":"Zufferey, D. (2013). <i>Analysis of dynamic message passing programs</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:1405\">https://doi.org/10.15479/at:ista:1405</a>","chicago":"Zufferey, Damien. “Analysis of Dynamic Message Passing Programs.” Institute of Science and Technology Austria, 2013. <a href=\"https://doi.org/10.15479/at:ista:1405\">https://doi.org/10.15479/at:ista:1405</a>.","ama":"Zufferey D. Analysis of dynamic message passing programs. 2013. doi:<a href=\"https://doi.org/10.15479/at:ista:1405\">10.15479/at:ista:1405</a>","ieee":"D. Zufferey, “Analysis of dynamic message passing programs,” Institute of Science and Technology Austria, 2013."},"date_created":"2018-12-11T11:51:50Z","ddc":["000"],"publisher":"Institute of Science and Technology Austria","page":"134","ec_funded":1,"month":"09","language":[{"iso":"eng"}],"type":"dissertation","abstract":[{"lang":"eng","text":"Motivated by the analysis of highly dynamic message-passing systems, i.e. unbounded thread creation, mobility, etc. we present a framework for the analysis of depth-bounded systems. Depth-bounded systems are one of the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. Even though they are infinite state systems depth-bounded systems are well-structured, thus can be analyzed algorithmically. We give an interpretation of depth-bounded systems as graph-rewriting systems. This gives more flexibility and ease of use to apply depth-bounded systems to other type of systems like shared memory concurrency.\r\n\r\nFirst, we develop an adequate domain of limits for depth-bounded systems, a prerequisite for the effective representation of downward-closed sets. Downward-closed sets are needed by forward saturation-based algorithms to represent potentially infinite sets of states. Then, we present an abstract interpretation framework to compute the covering set of well-structured transition systems. Because, in general, the covering set is not computable, our abstraction over-approximates the actual covering set. Our abstraction captures the essence of acceleration based-algorithms while giving up enough precision to ensure convergence. We have implemented the analysis in the PICASSO tool and show that it is accurate in practice. Finally, we build some further analyses like termination using the covering set as starting point."}],"publist_id":"5802","_id":"1405","OA_place":"publisher","has_accepted_license":"1","file_date_updated":"2021-11-17T13:47:58Z","status":"public","acknowledgement":"This work was supported in part by the Austrian Science Fund NFN RiSE (Rigorous Systems Engineering) and by the ERC Advanced Grant QUAREM (Quantitative Reactve Modeling).\r\nChapter 2, 3, and 4 are joint work with Thomas A. Henzinger and Thomas Wies. Chapter 2 was published in FoSSaCS 2010 as “Forward Analysis of Depth-Bounded Processes” [112]. Chapter 3 was published in VMCAI 2012 as “Ideal Abstractions for Well-Structured Transition Systems” [114]. Chap- ter 5.1 is joint work with Kshitij Bansal, Eric Koskinen, and Thomas Wies. It was published in TACAS 2013 as “Structural Counter Abstraction” [13]. The author’s contribution in this part is mostly related to the implementation. The theory required to understand the method and its implementation is quickly recalled to make the thesis self-contained, but should not be considered as a contribution. For the details of the methods, we refer the reader to the orig- inal publication [13] and the corresponding technical report [14]. Chapter 5.2 is ongoing work with Shahram Esmaeilsabzali, Rupak Majumdar, and Thomas Wies. I also would like to thank the people who supported over the past 4 years. My advisor Thomas A. Henzinger who gave me a lot of freedom to work on projects I was interested in. My collaborators, especially Thomas Wies with whom I worked since the beginning. The members of my thesis committee, Viktor Kun- cak and Rupak Majumdar, who also agreed to advise me. Simon Aeschbacher, Pavol Cerny, Cezara Dragoi, Arjun Radhakrishna, my family, friends and col- leagues who created an enjoyable environment. ","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","year":"2013","publication_status":"published","corr_author":"1","article_processing_charge":"No","date_published":"2013-09-05T00:00:00Z","author":[{"orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","full_name":"Zufferey, Damien","first_name":"Damien"}],"day":"05","degree_awarded":"PhD","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"doi":"10.15479/at:ista:1405","file":[{"date_updated":"2021-02-22T11:28:36Z","creator":"dernst","file_name":"2013_Zufferey_thesis_final.pdf","file_id":"9176","access_level":"open_access","relation":"main_file","date_created":"2021-02-22T11:28:36Z","content_type":"application/pdf","checksum":"ed2d7b52933d134e8dc69d569baa284e","success":1,"file_size":1514906},{"date_updated":"2021-11-17T13:47:58Z","creator":"cchlebak","file_name":"2013_Zufferey_thesis_final_pdfa.pdf","access_level":"closed","file_id":"10298","relation":"main_file","date_created":"2021-11-16T14:42:52Z","content_type":"application/pdf","checksum":"cecc4c4b14225bee973d32e3dba91a55","file_size":1378313}],"title":"Analysis of dynamic message passing programs","supervisor":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"department":[{"_id":"ToHe"},{"_id":"GradSch"}]},{"status":"public","title":"How free is your linearizable concurrent data structure?","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:45Z","file":[{"date_updated":"2020-07-14T12:46:45Z","creator":"system","access_level":"open_access","file_id":"5480","file_name":"IST-2013-123-v1+1_main-concur2013.pdf","date_created":"2018-12-12T11:53:19Z","relation":"main_file","checksum":"ce580605ae9756a8c99d7b403ebb8eed","content_type":"application/pdf","file_size":249790}],"type":"technical_report","doi":"10.15479/AT:IST-2013-123-v1-1","has_accepted_license":"1","_id":"5402","abstract":[{"lang":"eng","text":"Linearizability requires that the outcome of calls by competing threads to a concurrent data structure is the same as some sequential execution where each thread has exclusive access to the data structure. In an ordered data structure, such as a queue or a stack, linearizability is ensured by requiring threads commit in the order dictated by the sequential semantics of the data structure; e.g., in a concurrent queue implementation a dequeue can only remove the oldest element. \r\nIn this paper, we investigate the impact of this strict ordering, by comparing what linearizability allows to what existing implementations do. We first give an operational definition for linearizability which allows us to build the most general linearizable implementation as a transition system for any given sequential specification. We then use this operational definition to categorize linearizable implementations based on whether they are bound or free. In a bound implementation, whenever all threads observe the same logical state, the updates to the logical state and the temporal order of commits coincide. All existing queue implementations we know of are bound. We then proceed to present, to the best of our knowledge, the first ever free queue implementation. Our experiments show that free implementations have the potential for better performance by suffering less from contention."}],"month":"06","language":[{"iso":"eng"}],"publisher":"IST Austria","date_published":"2013-06-12T00:00:00Z","citation":{"mla":"Henzinger, Thomas A., and Ali Sezgin. <i>How Free Is Your Linearizable Concurrent Data Structure?</i> IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-123-v1-1\">10.15479/AT:IST-2013-123-v1-1</a>.","short":"T.A. Henzinger, A. Sezgin, How Free Is Your Linearizable Concurrent Data Structure?, IST Austria, 2013.","ista":"Henzinger TA, Sezgin A. 2013. How free is your linearizable concurrent data structure?, IST Austria, 16p.","apa":"Henzinger, T. A., &#38; Sezgin, A. (2013). <i>How free is your linearizable concurrent data structure?</i> IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-123-v1-1\">https://doi.org/10.15479/AT:IST-2013-123-v1-1</a>","chicago":"Henzinger, Thomas A, and Ali Sezgin. <i>How Free Is Your Linearizable Concurrent Data Structure?</i> IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-123-v1-1\">https://doi.org/10.15479/AT:IST-2013-123-v1-1</a>.","ama":"Henzinger TA, Sezgin A. <i>How Free Is Your Linearizable Concurrent Data Structure?</i> IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-123-v1-1\">10.15479/AT:IST-2013-123-v1-1</a>","ieee":"T. A. Henzinger and A. Sezgin, <i>How free is your linearizable concurrent data structure?</i> IST Austria, 2013."},"ddc":["000","004"],"date_created":"2018-12-12T11:39:07Z","day":"12","pubrep_id":"123","author":[{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sezgin, Ali","first_name":"Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","last_name":"Sezgin"}],"page":"16","publication_identifier":{"issn":["2664-1690"]},"oa":1,"date_updated":"2020-07-14T23:04:47Z","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["IST Austria Technical Report"],"year":"2013","oa_version":"Published Version"},{"year":"2013","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["IST Austria Technical Report"],"publication_status":"published","related_material":{"record":[{"status":"public","relation":"later_version","id":"1376"}]},"date_updated":"2025-06-26T08:33:42Z","oa":1,"publication_identifier":{"issn":["2664-1690"]},"day":"08","pubrep_id":"130","page":"11","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"first_name":"Jan","full_name":"Otop, Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pavlogiannis, Andreas","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis"}],"date_published":"2013-07-08T00:00:00Z","publisher":"IST Austria","citation":{"ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, <i>Distributed synthesis for LTL Fragments</i>. IST Austria, 2013.","ama":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. <i>Distributed Synthesis for LTL Fragments</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-130-v1-1\">10.15479/AT:IST-2013-130-v1-1</a>","ista":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL Fragments, IST Austria, 11p.","apa":"Chatterjee, K., Henzinger, T. A., Otop, J., &#38; Pavlogiannis, A. (2013). <i>Distributed synthesis for LTL Fragments</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-130-v1-1\">https://doi.org/10.15479/AT:IST-2013-130-v1-1</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. <i>Distributed Synthesis for LTL Fragments</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-130-v1-1\">https://doi.org/10.15479/AT:IST-2013-130-v1-1</a>.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, Distributed Synthesis for LTL Fragments, IST Austria, 2013.","mla":"Chatterjee, Krishnendu, et al. <i>Distributed Synthesis for LTL Fragments</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-130-v1-1\">10.15479/AT:IST-2013-130-v1-1</a>."},"ddc":["005"],"date_created":"2018-12-12T11:39:09Z","language":[{"iso":"eng"}],"month":"07","has_accepted_license":"1","_id":"5406","abstract":[{"lang":"eng","text":"We consider the distributed synthesis problem fortemporal logic specifications. Traditionally, the problem has been studied for LTL, and the previous results show that the problem is decidable iff there is no information fork in the architecture. We consider the problem for fragments of LTLand our main results are as follows: (1) We show that the problem is undecidable for architectures with information forks even for the fragment of LTL with temporal operators restricted to next and eventually. (2) For specifications restricted to globally along with non-nested next operators, we establish decidability (in EXPSPACE) for star architectures where the processes receive disjoint inputs, whereas we establish undecidability for architectures containing an information fork-meet structure. (3)Finally, we consider LTL without the next operator, and establish decidability (NEXPTIME-complete) for all architectures for a fragment that consists of a set of safety assumptions, and a set of guarantees where each guarantee is a safety, reachability, or liveness condition."}],"type":"technical_report","doi":"10.15479/AT:IST-2013-130-v1-1","file_date_updated":"2020-07-14T12:46:45Z","file":[{"creator":"system","date_updated":"2020-07-14T12:46:45Z","file_id":"5540","access_level":"open_access","file_name":"IST-2013-130-v1+1_Distributed_Synthesis.pdf","checksum":"855513ebaf6f72228800c5fdb522f93c","content_type":"application/pdf","date_created":"2018-12-12T11:54:18Z","relation":"main_file","file_size":467895}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"status":"public","title":"Distributed synthesis for LTL Fragments"},{"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","date_published":"2013-08-01T00:00:00Z","day":"01","author":[{"last_name":"Dragoi","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","first_name":"Cezara","full_name":"Dragoi, Cezara"},{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","full_name":"Gupta, Ashutosh","first_name":"Ashutosh"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"pubrep_id":"195","article_processing_charge":"No","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"doi":"10.1007/978-3-642-39799-8_11","quality_controlled":"1","title":"Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates","department":[{"_id":"ToHe"}],"file":[{"file_size":236480,"checksum":"a901cc6b71db08b61c0d4c0cbacc6287","content_type":"application/pdf","date_created":"2018-12-18T13:13:33Z","relation":"main_file","file_id":"5748","access_level":"open_access","file_name":"2013_CAV_Dragoi.pdf","creator":"dernst","date_updated":"2020-07-14T12:47:10Z"}],"place":"Berlin, Heidelberg","oa":1,"date_updated":"2025-07-10T11:52:57Z","oa_version":"None","publication":"Computer Aided Verification","publisher":"Springer Berlin Heidelberg","ddc":["005"],"date_created":"2018-12-18T13:10:21Z","citation":{"mla":"Dragoi, Cezara, et al. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.” <i>Computer Aided Verification</i>, vol. 8044, Springer Berlin Heidelberg, 2013, pp. 174–90, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_11\">10.1007/978-3-642-39799-8_11</a>.","short":"C. Dragoi, A. Gupta, T.A. Henzinger, in:, Computer Aided Verification, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 174–190.","chicago":"Dragoi, Cezara, Ashutosh Gupta, and Thomas A Henzinger. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.” In <i>Computer Aided Verification</i>, 8044:174–90. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_11\">https://doi.org/10.1007/978-3-642-39799-8_11</a>.","apa":"Dragoi, C., Gupta, A., &#38; Henzinger, T. A. (2013). Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In <i>Computer Aided Verification</i> (Vol. 8044, pp. 174–190). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_11\">https://doi.org/10.1007/978-3-642-39799-8_11</a>","ista":"Dragoi C, Gupta A, Henzinger TA. 2013.Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In: Computer Aided Verification. vol. 8044, 174–190.","ama":"Dragoi C, Gupta A, Henzinger TA. Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In: <i>Computer Aided Verification</i>. Vol 8044. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:174-190. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_11\">10.1007/978-3-642-39799-8_11</a>","ieee":"C. Dragoi, A. Gupta, and T. A. Henzinger, “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates,” in <i>Computer Aided Verification</i>, vol. 8044, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 174–190."},"intvolume":"      8044","ec_funded":1,"page":"174-190","volume":8044,"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783642397981"],"issn":["0302-9743"],"eisbn":["9783642397998"]},"type":"book_chapter","_id":"5747","has_accepted_license":"1","month":"08","series_title":"CAV","language":[{"iso":"eng"}],"status":"public","conference":{"start_date":"2013-07-13","end_date":"2013-07-19","location":"Saint Petersburg, Russia","name":"CAV: Computer Aided Verification"},"scopus_import":"1","file_date_updated":"2020-07-14T12:47:10Z"},{"date_updated":"2020-07-14T23:06:19Z","oa":1,"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["IST Austria Technical Report"],"year":"2013","oa_version":"Published Version","publisher":"IST Austria","date_published":"2013-06-13T00:00:00Z","ddc":["000","005"],"citation":{"mla":"Henzinger, Thomas A., et al. <i>Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues </i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-124-v1-1\">10.15479/AT:IST-2013-124-v1-1</a>.","short":"T.A. Henzinger, H. Payer, A. Sezgin, Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues , IST Austria, 2013.","ista":"Henzinger TA, Payer H, Sezgin A. 2013. Replacing competition with cooperation to achieve scalable lock-free FIFO queues , IST Austria, 23p.","chicago":"Henzinger, Thomas A, Hannes Payer, and Ali Sezgin. <i>Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues </i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-124-v1-1\">https://doi.org/10.15479/AT:IST-2013-124-v1-1</a>.","apa":"Henzinger, T. A., Payer, H., &#38; Sezgin, A. (2013). <i>Replacing competition with cooperation to achieve scalable lock-free FIFO queues </i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-124-v1-1\">https://doi.org/10.15479/AT:IST-2013-124-v1-1</a>","ieee":"T. A. Henzinger, H. Payer, and A. Sezgin, <i>Replacing competition with cooperation to achieve scalable lock-free FIFO queues </i>. IST Austria, 2013.","ama":"Henzinger TA, Payer H, Sezgin A. <i>Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues </i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-124-v1-1\">10.15479/AT:IST-2013-124-v1-1</a>"},"date_created":"2019-05-13T14:13:27Z","day":"13","pubrep_id":"124","author":[{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"first_name":"Hannes","full_name":"Payer, Hannes","last_name":"Payer"},{"first_name":"Ali","full_name":"Sezgin, Ali","last_name":"Sezgin","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87"}],"page":"23","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2013-124-v1-1","type":"technical_report","_id":"6440","has_accepted_license":"1","abstract":[{"lang":"eng","text":"In order to guarantee that each method of a data structure updates the logical state exactly once, al-most all non-blocking implementations employ Compare-And-Swap (CAS) based synchronization. For FIFO  queue  implementations  this  translates  into  concurrent  enqueue  or  dequeue  methods competing among themselves to update the same variable, the tail or the head, respectively, leading to high contention and poor scalability. Recent non-blocking queue implementations try to alleviate high contentionby increasing the number of contention points, all the while using CAS-based synchronization. Furthermore, obtaining a wait-free implementation with competition is achieved by additional synchronization which leads to further degradation of performance.In this paper we formalize the notion of competitiveness of a synchronizing statement which can beused as a measure for the scalability of concurrent implementations.  We present a new queue implementation, the Speculative Pairing (SP) queue, which, as we show, decreases competitiveness by using Fetch-And-Increment (FAI) instead of CAS. We prove that the SP queue is linearizable and lock-free.We also show that replacing CAS with FAI leads to wait-freedom for dequeue methods without an adverse effect on performance.  In fact, our experiments suggest that the SP queue can perform and scale better than the state-of-the-art queue implementations."}],"month":"06","language":[{"iso":"eng"}],"status":"public","title":"Replacing competition with cooperation to achieve scalable lock-free FIFO queues ","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:47:30Z","file":[{"file_name":"2013_TechRep_Henzinger.pdf","access_level":"open_access","file_id":"6441","creator":"dernst","date_updated":"2020-07-14T12:47:30Z","file_size":549684,"content_type":"application/pdf","checksum":"a219ba4eada6cd62befed52262ee15d4","relation":"main_file","date_created":"2019-05-13T14:11:39Z"}]},{"month":"08","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"type":"conference","has_accepted_license":"1","_id":"2328","publist_id":"4598","abstract":[{"lang":"eng","text":"Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on identifying the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates.\r\nIn response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof."}],"conference":{"name":"CONCUR: Concurrency Theory","location":"Buenos Aires, Argentina","end_date":"2013-08-30","start_date":"2013-08-27"},"scopus_import":1,"file_date_updated":"2020-07-14T12:45:39Z","status":"public","alternative_title":["LNCS"],"oa_version":"Submitted Version","related_material":{"record":[{"status":"public","relation":"later_version","id":"1832"}]},"date_updated":"2026-07-06T13:24:04Z","oa":1,"volume":8052,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_created":"2018-12-11T11:57:01Z","ddc":["000","004"],"citation":{"short":"T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256.","mla":"Henzinger, Thomas A., et al. <i>Aspect-Oriented Linearizability Proofs</i>. Vol. 8052, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 242–56, doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">10.1007/978-3-642-40184-8_18</a>.","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.","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>","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>.","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>","ista":"Henzinger TA, Sezgin A, Vafeiadis V. 2013. Aspect-oriented linearizability proofs. 8052, 242–256."},"intvolume":"      8052","page":"242 - 256","ec_funded":1,"project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"doi":"10.1007/978-3-642-40184-8_18","quality_controlled":"1","file":[{"checksum":"bdbb520de91751fe0136309ad4ef67e4","content_type":"application/pdf","date_created":"2018-12-12T10:08:58Z","relation":"main_file","file_size":337059,"creator":"system","date_updated":"2020-07-14T12:45:39Z","file_id":"4721","access_level":"open_access","file_name":"IST-2014-197-v1+1_main-queue-verification.pdf"}],"title":"Aspect-oriented linearizability proofs","department":[{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","publication_status":"published","date_published":"2013-08-01T00:00:00Z","day":"01","author":[{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sezgin","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","first_name":"Ali","full_name":"Sezgin, Ali"},{"first_name":"Viktor","full_name":"Vafeiadis, Viktor","last_name":"Vafeiadis"}],"pubrep_id":"197"},{"language":[{"iso":"eng"}],"series_title":"LNCS","month":"10","abstract":[{"text":"We propose a logic-based framework for automated reasoning about sequential programs manipulating singly-linked lists and arrays with unbounded data. We introduce the logic SLAD, which allows combining shape constraints, written in a fragment of Separation Logic, with data and size constraints. We address the problem of checking the entailment between SLAD formulas, which is crucial in performing pre-post condition reasoning. Although this problem is undecidable in general for SLAD, we propose a sound and powerful procedure that is able to solve this problem for a large class of formulas, beyond the capabilities of existing techniques and tools. We prove that this procedure is complete, i.e., it is actually a decision procedure for this problem, for an important fragment of SLAD including known decidable logics. We implemented this procedure and shown its preciseness and its efficiency on a significant benchmark of formulas.","lang":"eng"}],"_id":"10903","type":"conference","scopus_import":"1","conference":{"name":"ATVA: Automated Technology for Verification and Analysis","location":"Thiruvananthapuram, India","end_date":"2012-10-06","start_date":"2012-10-03"},"status":"public","acknowledgement":"This work has been partially supported by the French ANR project Veridyc","oa_version":"None","alternative_title":["LNCS"],"place":"Berlin, Heidelberg","date_updated":"2024-10-09T21:02:34Z","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783642333859"],"eisbn":["9783642333866"]},"volume":7561,"page":"167-182","intvolume":"      7561","citation":{"ista":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Accurate invariant checking for programs manipulating lists and arrays with infinite data. Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and AnalysisLNCS, LNCS, vol. 7561, 167–182.","chicago":"Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.” In <i>Automated Technology for Verification and Analysis</i>, 7561:167–82. LNCS. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">https://doi.org/10.1007/978-3-642-33386-6_14</a>.","apa":"Bouajjani, A., Dragoi, C., Enea, C., &#38; Sighireanu, M. (2012). Accurate invariant checking for programs manipulating lists and arrays with infinite data. In <i>Automated Technology for Verification and Analysis</i> (Vol. 7561, pp. 167–182). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">https://doi.org/10.1007/978-3-642-33386-6_14</a>","ama":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. Accurate invariant checking for programs manipulating lists and arrays with infinite data. In: <i>Automated Technology for Verification and Analysis</i>. Vol 7561. LNCS. Berlin, Heidelberg: Springer; 2012:167-182. doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">10.1007/978-3-642-33386-6_14</a>","ieee":"A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Accurate invariant checking for programs manipulating lists and arrays with infinite data,” in <i>Automated Technology for Verification and Analysis</i>, Thiruvananthapuram, India, 2012, vol. 7561, pp. 167–182.","mla":"Bouajjani, Ahmed, et al. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.” <i>Automated Technology for Verification and Analysis</i>, vol. 7561, Springer, 2012, pp. 167–82, doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">10.1007/978-3-642-33386-6_14</a>.","short":"A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Automated Technology for Verification and Analysis, Springer, Berlin, Heidelberg, 2012, pp. 167–182."},"date_created":"2022-03-21T07:58:39Z","publisher":"Springer","publication":"Automated Technology for Verification and Analysis","quality_controlled":"1","doi":"10.1007/978-3-642-33386-6_14","department":[{"_id":"ToHe"}],"title":"Accurate invariant checking for programs manipulating lists and arrays with infinite data","year":"2012","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_status":"published","corr_author":"1","article_processing_charge":"No","author":[{"last_name":"Bouajjani","full_name":"Bouajjani, Ahmed","first_name":"Ahmed"},{"full_name":"Dragoi, Cezara","first_name":"Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","last_name":"Dragoi"},{"last_name":"Enea","full_name":"Enea, Constantin","first_name":"Constantin"},{"last_name":"Sighireanu","full_name":"Sighireanu, Mihaela","first_name":"Mihaela"}],"day":"15","date_published":"2012-10-15T00:00:00Z"}]