[{"project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"citation":{"chicago":"Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” Theoretical Computer Science. Elsevier, 2014. https://doi.org/10.1016/j.tcs.2014.08.019.","ista":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation distances. Theoretical Computer Science. 560(3), 348–363.","mla":"Cerny, Pavol, et al. “Interface Simulation Distances.” Theoretical Computer Science, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi:10.1016/j.tcs.2014.08.019.","ieee":"P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” Theoretical Computer Science, vol. 560, no. 3. Elsevier, pp. 348–363, 2014.","short":"P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 560 (2014) 348–363.","ama":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface simulation distances. Theoretical Computer Science. 2014;560(3):348-363. doi:10.1016/j.tcs.2014.08.019","apa":"Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2014). Interface simulation distances. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2014.08.019"},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"5392","title":"Interface simulation distances","oa":1,"quality_controlled":"1","publisher":"Elsevier","year":"2014","publication":"Theoretical Computer Science","day":"04","page":"348 - 363","date_created":"2018-12-11T11:53:43Z","date_published":"2014-12-04T00:00:00Z","doi":"10.1016/j.tcs.2014.08.019","_id":"1733","type":"journal_article","status":"public","date_updated":"2023-02-23T11:04:00Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"abstract":[{"lang":"eng","text":"The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a distance for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intuitively, tolerating errors (while counting them) in the alternating simulation game. We show that the interface simulation distance satisfies the triangle inequality, that the distance between two interfaces does not increase under parallel composition with a third interface, that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces, and how to synthesize an interface from incompatible requirements. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies."}],"oa_version":"Submitted Version","main_file_link":[{"url":"http://arxiv.org/abs/1210.2450","open_access":"1"}],"scopus_import":1,"intvolume":" 560","month":"12","publication_status":"published","language":[{"iso":"eng"}],"ec_funded":1,"related_material":{"record":[{"id":"2916","status":"public","relation":"earlier_version"}]},"issue":"3","volume":560},{"publication_status":"published","file":[{"file_name":"IST-2014-192-v1+1_AccumulativeValues.pdf","date_created":"2018-12-12T10:10:59Z","creator":"system","file_size":346184,"date_updated":"2020-07-14T12:45:26Z","file_id":"4851","checksum":"354c41d37500b56320afce94cf9a99c2","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"volume":15,"issue":"4","related_material":{"record":[{"id":"3356","status":"public","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5385"}]},"ec_funded":1,"abstract":[{"text":"Recently, there has been an effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions. At the heart of quantitative objectives lies the accumulation of values along a computation. It is often the accumulated sum, as with energy objectives, or the accumulated average, as with mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric (or Boolean) variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point in time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire infinite computation. We study the border of decidability for such quantitative extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities with both prefix-accumulation assertions, or extending LTL with both path-accumulation assertions, results in temporal logics whose model-checking problem is decidable. Moreover, the prefix-accumulation assertions may be generalized with "controlled accumulation," allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that this branching-time logic is, in a sense, the maximal logic with one or both of the prefix-accumulation assertions that permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, such as CTL or LTL, makes the problem undecidable.","lang":"eng"}],"oa_version":"Submitted Version","scopus_import":1,"month":"09","intvolume":" 15","date_updated":"2023-02-23T12:23:54Z","ddc":["000","004"],"file_date_updated":"2020-07-14T12:45:26Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"_id":"2038","type":"journal_article","article_type":"original","status":"public","pubrep_id":"192","has_accepted_license":"1","year":"2014","day":"16","publication":"ACM Transactions on Computational Logic (TOCL)","date_published":"2014-09-16T00:00:00Z","doi":"10.1145/2629686","date_created":"2018-12-11T11:55:21Z","acknowledgement":"The research was supported in part by ERC Starting grant 278410 (QUALITY).","publisher":"ACM","quality_controlled":"1","oa":1,"citation":{"ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27.","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” ACM Transactions on Computational Logic (TOCL). ACM, 2014. https://doi.org/10.1145/2629686.","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 2014;15(4). doi:10.1145/2629686","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2014). Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2629686","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 15 (2014).","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4. ACM, 2014.","mla":"Boker, Udi, et al. “Temporal Specifications with Accumulative Values.” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4, 27, ACM, 2014, doi:10.1145/2629686."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5013","author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi","last_name":"Boker","full_name":"Boker, Udi"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"last_name":"Kupferman","full_name":"Kupferman, Orna","first_name":"Orna"}],"article_processing_charge":"No","title":"Temporal specifications with accumulative values","article_number":"27","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}]},{"page":"20","date_created":"2018-12-12T11:39:11Z","date_published":"2014-01-28T00:00:00Z","doi":"10.15479/AT:IST-2014-148-v2-1","related_material":{"record":[{"id":"2167","status":"public","relation":"later_version"}]},"publication_status":"published","year":"2014","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T11:54:21Z","file_name":"IST-2014-148-v2+1_main_tr.pdf","date_updated":"2020-07-14T12:46:46Z","file_size":534732,"creator":"system","file_id":"5543","checksum":"0e03aba625cc334141a3148432aa5760","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"day":"28","oa":1,"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","month":"01","abstract":[{"lang":"eng","text":"Model-based testing is a promising technology for black-box software and hardware testing, in which test cases are generated automatically from high-level specifications. Nowadays, systems typically consist of multiple interacting components and, due to their complexity, testing presents a considerable portion of the effort and cost in the design process. Exploiting the compositional structure of system specifications can considerably reduce the effort in model-based testing. Moreover, inferring properties about the system from testing its individual components allows the designer to reduce the amount of integration testing.\r\nIn this paper, we study compositional properties of the IOCO-testing theory. We propose a new approach to composition and hiding operations, inspired by contract-based design and interface theories. These operations preserve behaviors that are compatible under composition and hiding, and prune away incompatible ones. The resulting specification characterizes the input sequences for which the unit testing of components is sufficient to infer the correctness of component integration without the need for further tests. We provide a methodology that uses these results to minimize integration testing effort, but also to detect potential weaknesses in specifications. While we focus on asynchronous models and the IOCO conformance relation, the resulting methodology can be applied to a broader class of systems."}],"oa_version":"Published Version","author":[{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","last_name":"Daca","full_name":"Daca, Przemyslaw"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"last_name":"Krenn","full_name":"Krenn, Willibald","first_name":"Willibald"},{"last_name":"Nickovic","full_name":"Nickovic, Dejan","first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"}],"title":"Compositional specifications for IOCO testing","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:46Z","date_updated":"2023-02-23T10:31:07Z","citation":{"ista":"Daca P, Henzinger TA, Krenn W, Nickovic D. 2014. Compositional specifications for IOCO testing, IST Austria, 20p.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Willibald Krenn, and Dejan Nickovic. Compositional Specifications for IOCO Testing. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-148-v2-1.","short":"P. Daca, T.A. Henzinger, W. Krenn, D. Nickovic, Compositional Specifications for IOCO Testing, IST Austria, 2014.","ieee":"P. Daca, T. A. Henzinger, W. Krenn, and D. Nickovic, Compositional specifications for IOCO testing. IST Austria, 2014.","ama":"Daca P, Henzinger TA, Krenn W, Nickovic D. Compositional Specifications for IOCO Testing. IST Austria; 2014. doi:10.15479/AT:IST-2014-148-v2-1","apa":"Daca, P., Henzinger, T. A., Krenn, W., & Nickovic, D. (2014). Compositional specifications for IOCO testing. IST Austria. https://doi.org/10.15479/AT:IST-2014-148-v2-1","mla":"Daca, Przemyslaw, et al. Compositional Specifications for IOCO Testing. IST Austria, 2014, doi:10.15479/AT:IST-2014-148-v2-1."},"ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"technical_report","pubrep_id":"152","status":"public","_id":"5411"},{"project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Henzinger, T. A., & Otop, J. (2014). Model measuring for hybrid systems. In Proceedings of the 17th international conference on Hybrid systems: computation and control (pp. 213–222). Berlin, Germany: Springer. https://doi.org/10.1145/2562059.2562130","ama":"Henzinger TA, Otop J. Model measuring for hybrid systems. In: Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control. Springer; 2014:213-222. doi:10.1145/2562059.2562130","short":"T.A. Henzinger, J. Otop, in:, Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control, Springer, 2014, pp. 213–222.","ieee":"T. A. Henzinger and J. Otop, “Model measuring for hybrid systems,” in Proceedings of the 17th international conference on Hybrid systems: computation and control, Berlin, Germany, 2014, pp. 213–222.","mla":"Henzinger, Thomas A., and Jan Otop. “Model Measuring for Hybrid Systems.” Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control, Springer, 2014, pp. 213–22, doi:10.1145/2562059.2562130.","ista":"Henzinger TA, Otop J. 2014. Model measuring for hybrid systems. Proceedings of the 17th international conference on Hybrid systems: computation and control. HSCC: Hybrid Systems - Computation and Control, 213–222.","chicago":"Henzinger, Thomas A, and Jan Otop. “Model Measuring for Hybrid Systems.” In Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control, 213–22. Springer, 2014. https://doi.org/10.1145/2562059.2562130."},"title":"Model measuring for hybrid systems","publist_id":"4751","author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Otop, Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"article_processing_charge":"No","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 Reactive Modeling).\r\nA Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/171","publisher":"Springer","quality_controlled":"1","day":"01","publication":"Proceedings of the 17th international conference on Hybrid systems: computation and control","year":"2014","doi":"10.1145/2562059.2562130","date_published":"2014-04-01T00:00:00Z","date_created":"2018-12-11T11:56:23Z","page":"213 - 222","_id":"2217","status":"public","type":"conference","conference":{"start_date":"2014-04-15","end_date":"2014-04-17","location":"Berlin, Germany","name":"HSCC: Hybrid Systems - Computation and Control"},"date_updated":"2023-02-23T12:25:23Z","department":[{"_id":"ToHe"}],"oa_version":"None","abstract":[{"text":"As hybrid systems involve continuous behaviors, they should be evaluated by quantitative methods, rather than qualitative methods. In this paper we adapt a quantitative framework, called model measuring, to the hybrid systems domain. The model-measuring problem asks, given a model M and a specification, what is the maximal distance such that all models within that distance from M satisfy (or violate) the specification. A distance function on models is given as part of the input of the problem. Distances, especially related to continuous behaviors are more natural in the hybrid case than the discrete case. We are interested in distances represented by monotonic hybrid automata, a hybrid counterpart of (discrete) weighted automata, whose recognized timed languages are monotone (w.r.t. inclusion) in the values of parameters.\r\n\r\nThe contributions of this paper are twofold. First, we give sufficient conditions under which the model-measuring problem can be solved. Second, we discuss the modeling of distances and applications of the model-measuring problem.","lang":"eng"}],"month":"04","scopus_import":1,"language":[{"iso":"eng"}],"publication_status":"published","related_material":{"record":[{"id":"5416","status":"public","relation":"earlier_version"}]},"ec_funded":1},{"day":"19","file":[{"file_size":383052,"date_updated":"2020-07-14T12:46:49Z","creator":"system","file_name":"IST-2014-172-v1+1_report.pdf","date_created":"2018-12-12T11:53:20Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5481","checksum":"fcc3eab903cfcd3778b338d2d0d44d18"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","publication_status":"published","year":"2014","related_material":{"record":[{"relation":"later_version","id":"2327","status":"public"}]},"doi":"10.15479/AT:IST-2014-172-v1-1","date_published":"2014-02-19T00:00:00Z","date_created":"2018-12-12T11:39:13Z","page":"14","oa_version":"Published Version","abstract":[{"text":"We define the model-measuring problem: given a model M and specification φ, what is the maximal distance ρ such that all models M'within distance ρ from M satisfy (or violate)φ. The model measuring problem presupposes a distance function on models. We concentrate on automatic distance functions, which are defined by weighted automata.\r\nThe 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.\r\nWe show that for automatic distance functions, and ω-regular linear-time and branching-time specifications, the model-measuring problem can be solved.\r\nWe 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. \r\nWe give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications.","lang":"eng"}],"month":"02","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"citation":{"chicago":"Henzinger, Thomas A, and Jan Otop. From Model Checking to Model Measuring. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-172-v1-1.","ista":"Henzinger TA, Otop J. 2014. From model checking to model measuring, IST Austria, 14p.","mla":"Henzinger, Thomas A., and Jan Otop. From Model Checking to Model Measuring. IST Austria, 2014, doi:10.15479/AT:IST-2014-172-v1-1.","ama":"Henzinger TA, Otop J. From Model Checking to Model Measuring. IST Austria; 2014. doi:10.15479/AT:IST-2014-172-v1-1","apa":"Henzinger, T. A., & Otop, J. (2014). From model checking to model measuring. IST Austria. https://doi.org/10.15479/AT:IST-2014-172-v1-1","ieee":"T. A. Henzinger and J. Otop, From model checking to model measuring. IST Austria, 2014.","short":"T.A. Henzinger, J. Otop, From Model Checking to Model Measuring, IST Austria, 2014."},"date_updated":"2023-02-23T10:38:10Z","file_date_updated":"2020-07-14T12:46:49Z","department":[{"_id":"ToHe"}],"title":"From model checking to model measuring","author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"_id":"5417","status":"public","pubrep_id":"175","type":"technical_report"},{"author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Otop, Jan","last_name":"Otop"}],"file_date_updated":"2020-07-14T12:46:49Z","title":"Model measuring for hybrid systems","department":[{"_id":"ToHe"}],"date_updated":"2023-02-23T10:33:21Z","citation":{"apa":"Henzinger, T. A., & Otop, J. (2014). Model measuring for hybrid systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-171-v1-1","ama":"Henzinger TA, Otop J. Model Measuring for Hybrid Systems. IST Austria; 2014. doi:10.15479/AT:IST-2014-171-v1-1","short":"T.A. Henzinger, J. Otop, Model Measuring for Hybrid Systems, IST Austria, 2014.","ieee":"T. A. Henzinger and J. Otop, Model measuring for hybrid systems. IST Austria, 2014.","mla":"Henzinger, Thomas A., and Jan Otop. Model Measuring for Hybrid Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-171-v1-1.","ista":"Henzinger TA, Otop J. 2014. Model measuring for hybrid systems, IST Austria, 22p.","chicago":"Henzinger, Thomas A, and Jan Otop. Model Measuring for Hybrid Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-171-v1-1."},"ddc":["005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"technical_report","status":"public","pubrep_id":"171","_id":"5416","page":"22","related_material":{"record":[{"relation":"later_version","id":"2217","status":"public"}]},"date_published":"2014-02-19T00:00:00Z","doi":"10.15479/AT:IST-2014-171-v1-1","date_created":"2018-12-12T11:39:12Z","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"publication_status":"published","year":"2014","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5492","checksum":"445456d22371e4e49aad2b9a0c13bf80","file_size":712077,"date_updated":"2020-07-14T12:46:49Z","creator":"system","file_name":"IST-2014-171-v1+1_report.pdf","date_created":"2018-12-12T11:53:32Z"}],"day":"19","language":[{"iso":"eng"}],"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","oa":1,"month":"02","abstract":[{"lang":"eng","text":"As hybrid systems involve continuous behaviors, they should be evaluated by quantitative methods, rather than qualitative methods. In this paper we adapt a quantitative framework, called model measuring, to the hybrid systems domain. The model-measuring problem asks, given a model M and a specification, what is the maximal distance such that all models within that distance from M satisfy (or violate) the specification. A distance function on models is given as part of the input of the problem. Distances, especially related to continuous behaviors are more natural in the hybrid case than the discrete case. We are interested in distances represented by monotonic hybrid automata, a hybrid counterpart of (discrete) weighted automata, whose recognized timed languages are monotone (w.r.t. inclusion) in the values of parameters.The contributions of this paper are twofold. First, we give sufficient conditions under which the model-measuring problem can be solved. Second, we discuss the modeling of distances and applications of the model-measuring problem."}],"oa_version":"Published Version"},{"date_created":"2018-12-12T11:39:12Z","doi":"10.15479/AT:IST-2014-170-v1-1","related_material":{"record":[{"relation":"later_version","id":"1656","status":"public"},{"id":"467","status":"public","relation":"later_version"},{"status":"public","id":"5436","relation":"later_version"}]},"date_published":"2014-02-19T00:00:00Z","page":"27","language":[{"iso":"eng"}],"day":"19","file":[{"checksum":"31f90dcf2cf899c3f8c6427cfcc2b3c7","file_id":"5497","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2014-170-v1+1_main.pdf","date_created":"2018-12-12T11:53:36Z","creator":"system","file_size":573457,"date_updated":"2020-07-14T12:46:48Z"}],"year":"2014","publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","month":"02","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Recently there has been a significant effort to add quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, several basic system properties such as average response time cannot be expressed with weighted automata. In this work, we introduce nested weighted automata as a new formalism for expressing important quantitative properties such as average response time. We establish an almost complete decidability picture for the basic decision problems for nested weighted automata, and illustrate its applicability in several domains. "}],"file_date_updated":"2020-07-14T12:46:48Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Nested weighted automata","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","last_name":"Otop"}],"ddc":["004"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria, 27p.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted Automata. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-170-v1-1.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2014.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2014.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested Weighted Automata. IST Austria; 2014. doi:10.15479/AT:IST-2014-170-v1-1","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2014). Nested weighted automata. IST Austria. https://doi.org/10.15479/AT:IST-2014-170-v1-1","mla":"Chatterjee, Krishnendu, et al. Nested Weighted Automata. IST Austria, 2014, doi:10.15479/AT:IST-2014-170-v1-1."},"date_updated":"2023-02-23T12:26:19Z","pubrep_id":"170","status":"public","type":"technical_report","_id":"5415"},{"ddc":["000"],"date_updated":"2023-09-07T11:57:01Z","file_date_updated":"2020-07-14T12:45:33Z","department":[{"_id":"ToHe"}],"_id":"2218","pubrep_id":"297","status":"public","conference":{"name":"CAV: Computer Aided Verification","start_date":"2014-07-18","location":"Vienna, Austria","end_date":"2014-07-22"},"type":"conference","language":[{"iso":"eng"}],"file":[{"creator":"system","file_size":416732,"date_updated":"2020-07-14T12:45:33Z","file_name":"IST-2014-297-v1+1_cav14-final.pdf","date_created":"2018-12-12T10:13:14Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"4995","checksum":"a631d3105509f239724644e77a1212e2"},{"file_id":"4996","checksum":"f8b0f748cc9fa697ca992cc56c87bc4e","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2014-297-v2+1_cav14-final2.pdf","date_created":"2018-12-12T10:13:15Z","creator":"system","file_size":616293,"date_updated":"2020-07-14T12:45:33Z"}],"publication_status":"published","publication_identifier":{"isbn":["978-331908866-2"]},"ec_funded":1,"volume":8559,"related_material":{"record":[{"id":"1130","status":"public","relation":"dissertation_contains"}]},"oa_version":"Submitted Version","abstract":[{"text":"While fixing concurrency bugs, program repair algorithms may introduce new concurrency bugs. We present an algorithm that avoids such regressions. The solution space is given by a set of program transformations we consider in the repair process. These include reordering of instructions within a thread and inserting atomic sections. The new algorithm learns a constraint on the space of candidate solutions, from both positive examples (error-free traces) and counterexamples (error traces). From each counterexample, the algorithm learns a constraint necessary to remove the errors. From each positive examples, it learns a constraint that is necessary in order to prevent the repair from turning the trace into an error trace. We implemented the algorithm and evaluated it on simplified Linux device drivers with known bugs.","lang":"eng"}],"intvolume":" 8559","month":"07","main_file_link":[{"open_access":"1","url":"https://link.springer.com/chapter/10.1007%2F978-3-319-08867-9_38"}],"alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Cerny, Pavol, et al. Regression-Free Synthesis for Concurrency. Vol. 8559, Springer, 2014, pp. 568–84, doi:10.1007/978-3-319-08867-9_38.","ieee":"P. Cerny, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, and T. Tarrach, “Regression-free synthesis for concurrency,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 568–584.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, T. Tarrach, in:, Springer, 2014, pp. 568–584.","ama":"Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. Regression-free synthesis for concurrency. In: Vol 8559. Springer; 2014:568-584. doi:10.1007/978-3-319-08867-9_38","apa":"Cerny, P., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., & Tarrach, T. (2014). Regression-free synthesis for concurrency (Vol. 8559, pp. 568–584). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-08867-9_38","chicago":"Cerny, Pavol, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, and Thorsten Tarrach. “Regression-Free Synthesis for Concurrency,” 8559:568–84. Springer, 2014. https://doi.org/10.1007/978-3-319-08867-9_38.","ista":"Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. 2014. Regression-free synthesis for concurrency. CAV: Computer Aided Verification, LNCS, vol. 8559, 568–584."},"title":"Regression-free synthesis for concurrency","publist_id":"4749","author":[{"last_name":"Cerny","full_name":"Cerny, Pavol","first_name":"Pavol"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ryzhyk, Leonid","last_name":"Ryzhyk","first_name":"Leonid"},{"first_name":"Thorsten","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87","last_name":"Tarrach","full_name":"Tarrach, Thorsten","orcid":"0000-0003-4409-8487"}],"project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"day":"22","year":"2014","has_accepted_license":"1","date_created":"2018-12-11T11:56:23Z","doi":"10.1007/978-3-319-08867-9_38","date_published":"2014-07-22T00:00:00Z","page":"568 - 584","oa":1,"quality_controlled":"1","publisher":"Springer"},{"publisher":"IEEE","quality_controlled":"1","oa":1,"day":"01","publication":"IEEE 7th International Conference on Software Testing, Verification and Validation","year":"2014","date_published":"2014-03-01T00:00:00Z","doi":"10.1109/ICST.2014.50","date_created":"2018-12-11T11:56:06Z","article_number":"6823899","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"P. Daca, T.A. Henzinger, W. Krenn, D. Nickovic, in:, IEEE 7th International Conference on Software Testing, Verification and Validation, IEEE, 2014.","ieee":"P. Daca, T. A. Henzinger, W. Krenn, and D. Nickovic, “Compositional specifications for IOCO testing,” in IEEE 7th International Conference on Software Testing, Verification and Validation, Cleveland, USA, 2014.","apa":"Daca, P., Henzinger, T. A., Krenn, W., & Nickovic, D. (2014). Compositional specifications for IOCO testing. In IEEE 7th International Conference on Software Testing, Verification and Validation. Cleveland, USA: IEEE. https://doi.org/10.1109/ICST.2014.50","ama":"Daca P, Henzinger TA, Krenn W, Nickovic D. Compositional specifications for IOCO testing. In: IEEE 7th International Conference on Software Testing, Verification and Validation. IEEE; 2014. doi:10.1109/ICST.2014.50","mla":"Daca, Przemyslaw, et al. “Compositional Specifications for IOCO Testing.” IEEE 7th International Conference on Software Testing, Verification and Validation, 6823899, IEEE, 2014, doi:10.1109/ICST.2014.50.","ista":"Daca P, Henzinger TA, Krenn W, Nickovic D. 2014. Compositional specifications for IOCO testing. IEEE 7th International Conference on Software Testing, Verification and Validation. ICST: International Conference on Software Testing, Verification and Validation, 6823899.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Willibald Krenn, and Dejan Nickovic. “Compositional Specifications for IOCO Testing.” In IEEE 7th International Conference on Software Testing, Verification and Validation. IEEE, 2014. https://doi.org/10.1109/ICST.2014.50."},"title":"Compositional specifications for IOCO testing","publist_id":"4817","author":[{"last_name":"Daca","full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Willibald","full_name":"Krenn, Willibald","last_name":"Krenn"},{"first_name":"Dejan","full_name":"Nickovic, Dejan","last_name":"Nickovic"}],"article_processing_charge":"No","external_id":{"arxiv":["1904.07083"]},"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Model-based testing is a promising technology for black-box software and hardware testing, in which test cases are generated automatically from high-level specifications. Nowadays, systems typically consist of multiple interacting components and, due to their complexity, testing presents a considerable portion of the effort and cost in the design process. Exploiting the compositional structure of system specifications can considerably reduce the effort in model-based testing. Moreover, inferring properties about the system from testing its individual components allows the designer to reduce the amount of integration testing. In this paper, we study compositional properties of the ioco-testing theory. We propose a new approach to composition and hiding operations, inspired by contract-based design and interface theories. These operations preserve behaviors that are compatible under composition and hiding, and prune away incompatible ones. The resulting specification characterizes the input sequences for which the unit testing of components is sufficient to infer the correctness of component integration without the need for further tests. We provide a methodology that uses these results to minimize integration testing effort, but also to detect potential weaknesses in specifications. While we focus on asynchronous models and the ioco conformance relation, the resulting methodology can be applied to a broader class of systems."}],"month":"03","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1904.07083"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-1-4799-2255-0"],"issn":["2159-4848"]},"publication_status":"published","related_material":{"record":[{"relation":"earlier_version","id":"5411","status":"public"},{"status":"public","id":"1155","relation":"dissertation_contains"}]},"ec_funded":1,"_id":"2167","status":"public","type":"conference","conference":{"location":"Cleveland, USA","end_date":"2014-04-04","start_date":"2014-03-31","name":"ICST: International Conference on Software Testing, Verification and Validation"},"date_updated":"2023-09-07T11:58:33Z","department":[{"_id":"ToHe"}]},{"_id":"2063","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"status":"public","type":"conference","conference":{"location":"Vienna, Austria","end_date":"2014-07-22","start_date":"2014-07-18","name":"CAV: Computer Aided Verification"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"K. Chatterjee, M. Chmelik, P. Daca, in:, Springer, 2014, pp. 473–490.","ieee":"K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for qualitative analysis of probabilistic systems,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 473–490.","apa":"Chatterjee, K., Chmelik, M., & Daca, P. (2014). CEGAR for qualitative analysis of probabilistic systems (Vol. 8559, pp. 473–490). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-08867-9_31","ama":"Chatterjee K, Chmelik M, Daca P. CEGAR for qualitative analysis of probabilistic systems. In: Vol 8559. Springer; 2014:473-490. doi:10.1007/978-3-319-08867-9_31","mla":"Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic Systems. Vol. 8559, Springer, 2014, pp. 473–90, doi:10.1007/978-3-319-08867-9_31.","ista":"Chatterjee K, Chmelik M, Daca P. 2014. CEGAR for qualitative analysis of probabilistic systems. CAV: Computer Aided Verification, LNCS, vol. 8559, 473–490.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Qualitative Analysis of Probabilistic Systems,” 8559:473–90. Springer, 2014. https://doi.org/10.1007/978-3-319-08867-9_31."},"date_updated":"2023-09-07T11:58:33Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"CEGAR for qualitative analysis of probabilistic systems","publist_id":"4978","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Chmelik, Martin","last_name":"Chmelik"},{"full_name":"Daca, Przemyslaw","last_name":"Daca","id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw"}],"oa_version":"None","abstract":[{"text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems.We focus on qualitative properties forMDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability. We introduce a new simulation relation to capture the refinement relation ofMDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.We present an automated technique for assume-guarantee style reasoning for compositional analysis ofMDPs with qualitative properties by giving a counterexample guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements.","lang":"eng"}],"month":"07","intvolume":" 8559","publisher":"Springer","quality_controlled":"1","alternative_title":["LNCS"],"day":"01","language":[{"iso":"eng"}],"publication_status":"published","year":"2014","doi":"10.1007/978-3-319-08867-9_31","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5412"},{"id":"5413","status":"public","relation":"earlier_version"},{"id":"5414","status":"public","relation":"earlier_version"},{"status":"public","id":"1155","relation":"dissertation_contains"}]},"date_published":"2014-07-01T00:00:00Z","volume":8559,"date_created":"2018-12-11T11:55:30Z","ec_funded":1,"page":"473 - 490"},{"pubrep_id":"315","status":"public","type":"technical_report","_id":"5428","title":"Quantitative fair simulation games","file_date_updated":"2020-07-14T12:46:52Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Otop","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"first_name":"Yaron","last_name":"Velner","full_name":"Velner, Yaron"}],"ddc":["004"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-09-20T12:07:48Z","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner. Quantitative Fair Simulation Games. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-315-v1-1.","ista":"Chatterjee K, Henzinger TA, Otop J, Velner Y. 2014. Quantitative fair simulation games, IST Austria, 26p.","mla":"Chatterjee, Krishnendu, et al. Quantitative Fair Simulation Games. IST Austria, 2014, doi:10.15479/AT:IST-2014-315-v1-1.","apa":"Chatterjee, K., Henzinger, T. A., Otop, J., & Velner, Y. (2014). Quantitative fair simulation games. IST Austria. https://doi.org/10.15479/AT:IST-2014-315-v1-1","ama":"Chatterjee K, Henzinger TA, Otop J, Velner Y. Quantitative Fair Simulation Games. IST Austria; 2014. doi:10.15479/AT:IST-2014-315-v1-1","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Quantitative Fair Simulation Games, IST Austria, 2014.","ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, Quantitative fair simulation games. IST Austria, 2014."},"month":"12","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa_version":"Published Version","abstract":[{"text":"Simulation is an attractive alternative for language inclusion for automata as it is an under-approximation of language inclusion, but usually has much lower complexity. For non-deterministic automata, while language inclusion is PSPACE-complete, simulation can be computed in polynomial time. Simulation has also been extended in two orthogonal directions, namely, (1) fair simulation, for simulation over specified set of infinite runs; and (2) quantitative simulation, for simulation between weighted automata. Again, while fair trace inclusion is PSPACE-complete, fair simulation can be computed in polynomial time. For weighted automata, the (quantitative) language inclusion problem is undecidable for mean-payoff automata and the decidability is open for discounted-sum automata, whereas the (quantitative) simulation reduce to mean-payoff games and discounted-sum games, which admit pseudo-polynomial time algorithms.\r\n\r\nIn this work, we study (quantitative) simulation for weighted automata with Büchi acceptance conditions, i.e., we generalize fair simulation from non-weighted automata to weighted automata. We show that imposing Büchi acceptance conditions on weighted automata changes many fundamental properties of the simulation games. For example, whereas for mean-payoff and discounted-sum games, the players do not need memory to play optimally; we show in contrast that for simulation games with Büchi acceptance conditions, (i) for mean-payoff objectives, optimal strategies for both players require infinite memory in general, and (ii) for discounted-sum objectives, optimal strategies need not exist for both players. While the simulation games with Büchi acceptance conditions are more complicated (e.g., due to infinite-memory requirements for mean-payoff objectives) as compared to their counterpart without Büchi acceptance conditions, we still present pseudo-polynomial time algorithms to solve simulation games with Büchi acceptance conditions for both weighted mean-payoff and weighted discounted-sum automata.","lang":"eng"}],"date_created":"2018-12-12T11:39:16Z","doi":"10.15479/AT:IST-2014-315-v1-1","related_material":{"record":[{"id":"1066","status":"public","relation":"later_version"}]},"date_published":"2014-12-05T00:00:00Z","page":"26","language":[{"iso":"eng"}],"day":"05","file":[{"date_updated":"2020-07-14T12:46:52Z","file_size":531046,"creator":"system","date_created":"2018-12-12T11:53:59Z","file_name":"IST-2014-315-v1+1_report.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5521","checksum":"b1d573bc04365625ff9974880c0aa807"}],"year":"2014","publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1"},{"oa_version":"None","abstract":[{"text":"A prominent remedy to multicore scalability issues in concurrent data structure implementations is to relax the sequential specification of the data structure. We present distributed queues (DQ), a new family of relaxed concurrent queue implementations. DQs implement relaxed queues with linearizable emptiness check and either configurable or bounded out-of-order behavior or pool behavior. Our experiments show that DQs outperform and outscale in micro- and macrobenchmarks all strict and relaxed queue as well as pool implementations that we considered.","lang":"eng"}],"month":"05","scopus_import":"1","quality_controlled":"1","publisher":"ACM Press","language":[{"iso":"eng"}],"publication":"Proceedings of the ACM International Conference on Computing Frontiers - CF '13","day":"01","year":"2013","publication_status":"published","publication_identifier":{"isbn":["978-145032053-5"]},"date_created":"2022-03-21T07:33:22Z","issue":"5","doi":"10.1145/2482767.2482789","date_published":"2013-05-01T00:00:00Z","article_number":"17","_id":"10898","status":"public","conference":{"name":"CF: Conference on Computing Frontiers","end_date":"2013-05-16","location":"Ischia, Italy","start_date":"2013-05-14"},"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2022-06-21T08:01:19Z","citation":{"ista":"Haas A, Lippautz M, Henzinger TA, Payer H, Sokolova A, Kirsch CM, Sezgin A. 2013. Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. Proceedings of the ACM International Conference on Computing Frontiers - CF ’13. CF: Conference on Computing Frontiers, 17.","chicago":"Haas, Andreas, Michael Lippautz, Thomas A Henzinger, Hannes Payer, Ana Sokolova, Christoph M. Kirsch, and Ali Sezgin. “Distributed Queues in Shared Memory: Multicore Performance and Scalability through Quantitative Relaxation.” In Proceedings of the ACM International Conference on Computing Frontiers - CF ’13. ACM Press, 2013. https://doi.org/10.1145/2482767.2482789.","apa":"Haas, A., Lippautz, M., Henzinger, T. A., Payer, H., Sokolova, A., Kirsch, C. M., & Sezgin, A. (2013). Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. In Proceedings of the ACM International Conference on Computing Frontiers - CF ’13. Ischia, Italy: ACM Press. https://doi.org/10.1145/2482767.2482789","ama":"Haas A, Lippautz M, Henzinger TA, et al. Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. In: Proceedings of the ACM International Conference on Computing Frontiers - CF ’13. ACM Press; 2013. doi:10.1145/2482767.2482789","ieee":"A. Haas et al., “Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation,” in Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, Ischia, Italy, 2013, no. 5.","short":"A. Haas, M. Lippautz, T.A. Henzinger, H. Payer, A. Sokolova, C.M. Kirsch, A. Sezgin, in:, Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, ACM Press, 2013.","mla":"Haas, Andreas, et al. “Distributed Queues in Shared Memory: Multicore Performance and Scalability through Quantitative Relaxation.” Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, no. 5, 17, ACM Press, 2013, doi:10.1145/2482767.2482789."},"title":"Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation","department":[{"_id":"ToHe"}],"article_processing_charge":"No","author":[{"first_name":"Andreas","full_name":"Haas, Andreas","last_name":"Haas"},{"full_name":"Lippautz, Michael","last_name":"Lippautz","first_name":"Michael"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger"},{"first_name":"Hannes","last_name":"Payer","full_name":"Payer, Hannes"},{"first_name":"Ana","last_name":"Sokolova","full_name":"Sokolova, Ana"},{"full_name":"Kirsch, Christoph M.","last_name":"Kirsch","first_name":"Christoph M."},{"id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","first_name":"Ali","full_name":"Sezgin, Ali","last_name":"Sezgin"}]},{"quality_controlled":"1","publisher":"IEEE","oa":1,"acknowledgement":"This research was supported by the European Commission through project\r\nDIAMOND (FP7-2009-IST-4-248613), and QUAINT (I774-N23), ","date_published":"2013-12-11T00:00:00Z","doi":"10.1109/FMCAD.2013.6679394","date_created":"2018-12-11T11:51:43Z","page":"77 - 84","day":"11","publication":"2013 Formal Methods in Computer-Aided Design","year":"2013","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"title":"Synthesizing multiple boolean functions using interpolation on a single proof","publist_id":"5825","author":[{"first_name":"Georg","full_name":"Hofferek, Georg","last_name":"Hofferek"},{"first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh","last_name":"Gupta"},{"first_name":"Bettina","last_name":"Könighofer","full_name":"Könighofer, Bettina"},{"last_name":"Jiang","full_name":"Jiang, Jie","first_name":"Jie"},{"first_name":"Roderick","last_name":"Bloem","full_name":"Bloem, Roderick"}],"external_id":{"arxiv":["1308.4767"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Hofferek, Georg, Ashutosh Gupta, Bettina Könighofer, Jie Jiang, and Roderick Bloem. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” In 2013 Formal Methods in Computer-Aided Design, 77–84. IEEE, 2013. https://doi.org/10.1109/FMCAD.2013.6679394.","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.","mla":"Hofferek, Georg, et al. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” 2013 Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 77–84, doi:10.1109/FMCAD.2013.6679394.","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.","ieee":"G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, and R. Bloem, “Synthesizing multiple boolean functions using interpolation on a single proof,” in 2013 Formal Methods in Computer-Aided Design, Portland, OR, United States, 2013, pp. 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: 2013 Formal Methods in Computer-Aided Design. IEEE; 2013:77-84. doi:10.1109/FMCAD.2013.6679394","apa":"Hofferek, G., Gupta, A., Könighofer, B., Jiang, J., & Bloem, R. (2013). Synthesizing multiple boolean functions using interpolation on a single proof. In 2013 Formal Methods in Computer-Aided Design (pp. 77–84). Portland, OR, United States: IEEE. https://doi.org/10.1109/FMCAD.2013.6679394"},"month":"12","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1308.4767"}],"oa_version":"Preprint","abstract":[{"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.","lang":"eng"}],"ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","status":"public","type":"conference","conference":{"start_date":"2013-10-20","location":"Portland, OR, United States","end_date":"2013-10-23","name":"FMCAD: Formal Methods in Computer-Aided Design"},"_id":"1385","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T06:50:19Z"},{"_id":"1387","series_title":"Lecture Notes in Computer Science","conference":{"name":"ICALP: Automata, Languages and Programming","end_date":"2013-07-12","location":"Riga, Latvia","start_date":"2013-07-08"},"type":"conference","status":"public","date_updated":"2020-08-11T10:09:09Z","ddc":["000"],"department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:44:48Z","abstract":[{"lang":"eng","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."}],"oa_version":"Submitted Version","scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 7966","month":"07","publication_status":"published","language":[{"iso":"eng"}],"file":[{"date_created":"2020-05-15T11:05:50Z","file_name":"2013_ICALP_Boker.pdf","creator":"dernst","date_updated":"2020-07-14T12:44:48Z","file_size":276982,"file_id":"7857","checksum":"98bc02e3793072e279ec8d364b381ff3","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"ec_funded":1,"issue":"PART 2","volume":7966,"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"citation":{"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.","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. https://doi.org/10.1007/978-3-642-39212-2_11.","apa":"Boker, U., Kuperberg, D., Kupferman, O., & Skrzypczak, M. (2013). Nondeterminism in the presence of a diverse or unknown future. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. https://doi.org/10.1007/978-3-642-39212-2_11","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:10.1007/978-3-642-39212-2_11","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.","short":"U. Boker, D. Kuperberg, O. Kupferman, M. Skrzypczak, 7966 (2013) 89–100.","mla":"Boker, Udi, et al. Nondeterminism in the Presence of a Diverse or Unknown Future. Vol. 7966, no. PART 2, Springer, 2013, pp. 89–100, doi:10.1007/978-3-642-39212-2_11."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","publist_id":"5823","author":[{"full_name":"Boker, Udi","last_name":"Boker","first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Denis","full_name":"Kuperberg, Denis","last_name":"Kuperberg"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"},{"full_name":"Skrzypczak, Michał","last_name":"Skrzypczak","first_name":"Michał"}],"title":"Nondeterminism in the presence of a diverse or unknown future","acknowledgement":"and ERC Grant QUALITY.","oa":1,"quality_controlled":"1","publisher":"Springer","year":"2013","has_accepted_license":"1","day":"01","page":"89 - 100","date_created":"2018-12-11T11:51:44Z","date_published":"2013-07-01T00:00:00Z","doi":"10.1007/978-3-642-39212-2_11"},{"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Henzinger, Thomas A., et al. “Quantitative Relaxation of Concurrent Data Structures.” Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–28, doi:10.1145/2429069.2429109.","ama":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. Quantitative relaxation of concurrent data structures. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language. ACM; 2013:317-328. doi:10.1145/2429069.2429109","apa":"Henzinger, T. A., Kirsch, C., Payer, H., Sezgin, A., & Sokolova, A. (2013). Quantitative relaxation of concurrent data structures. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language (pp. 317–328). Rome, Italy: ACM. https://doi.org/10.1145/2429069.2429109","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.","ieee":"T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative relaxation of concurrent data structures,” in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language, Rome, Italy, 2013, pp. 317–328.","chicago":"Henzinger, Thomas A, Christoph Kirsch, Hannes Payer, Ali Sezgin, and Ana Sokolova. “Quantitative Relaxation of Concurrent Data Structures.” In Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, 317–28. ACM, 2013. https://doi.org/10.1145/2429069.2429109.","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."},"title":"Quantitative relaxation of concurrent data structures","publist_id":"4801","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Kirsch, Christoph","last_name":"Kirsch","first_name":"Christoph"},{"full_name":"Payer, Hannes","last_name":"Payer","first_name":"Hannes"},{"last_name":"Sezgin","full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","first_name":"Ali"},{"full_name":"Sokolova, Ana","last_name":"Sokolova","first_name":"Ana"}],"acknowledgement":" and an Elise Richter Fellowship (Austrian Science Fund V00125). ","quality_controlled":"1","publisher":"ACM","oa":1,"day":"01","publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","has_accepted_license":"1","year":"2013","doi":"10.1145/2429069.2429109","date_published":"2013-01-01T00:00:00Z","date_created":"2018-12-11T11:56:11Z","page":"317 - 328","_id":"2181","status":"public","pubrep_id":"198","type":"conference","conference":{"end_date":"2013-01-25","location":"Rome, Italy","start_date":"2013-01-23","name":"POPL: Principles of Programming Languages"},"ddc":["000","004"],"date_updated":"2023-02-21T16:06:49Z","file_date_updated":"2020-07-14T12:45:31Z","department":[{"_id":"ToHe"}],"oa_version":"Submitted Version","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 "legal" 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."}],"month":"01","scopus_import":1,"file":[{"date_created":"2018-12-12T10:14:33Z","file_name":"IST-2014-198-v1+1_popl128-henzinger-clean.pdf","date_updated":"2020-07-14T12:45:31Z","file_size":294689,"creator":"system","file_id":"5086","checksum":"adf465e70948f4e80e48057524516456","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-1-4503-1832-7"]},"publication_status":"published","related_material":{"record":[{"status":"deleted","id":"10901","relation":"later_version"}]},"ec_funded":1},{"_id":"2182","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"status":"public","type":"conference","conference":{"name":"POPL: Principles of Programming Languages","start_date":"2013-07-23","end_date":"2013-01-25","location":"Rome, Italy"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Cerny, Pavol, et al. “Quantitative Abstraction Refinement.” Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–28, doi:10.1145/2429069.2429085.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative abstraction refinement,” in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language, Rome, Italy, 2013, pp. 115–128.","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.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Quantitative abstraction refinement. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language. ACM; 2013:115-128. doi:10.1145/2429069.2429085","apa":"Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2013). Quantitative abstraction refinement. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language (pp. 115–128). Rome, Italy: ACM. https://doi.org/10.1145/2429069.2429085","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Abstraction Refinement.” In Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, 115–28. ACM, 2013. https://doi.org/10.1145/2429069.2429085.","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."},"date_updated":"2021-01-12T06:55:50Z","title":"Quantitative abstraction refinement","department":[{"_id":"ToHe"}],"author":[{"last_name":"Cerny","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun"}],"publist_id":"4800","oa_version":"None","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."}],"month":"01","quality_controlled":"1","publisher":"ACM","scopus_import":1,"day":"01","language":[{"iso":"eng"}],"publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","year":"2013","publication_status":"published","date_published":"2013-01-01T00:00:00Z","doi":"10.1145/2429069.2429085","ec_funded":1,"date_created":"2018-12-11T11:56:11Z","page":"115 - 128"},{"project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Blanc, Régis","last_name":"Blanc","first_name":"Régis"},{"first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh","last_name":"Gupta"},{"first_name":"Laura","last_name":"Kovács","full_name":"Kovács, Laura"},{"id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard","last_name":"Kragl"}],"publist_id":"4724","article_processing_charge":"No","title":"Tree interpolation in Vampire","citation":{"ista":"Blanc R, Gupta A, Kovács L, Kragl B. 2013. Tree interpolation in Vampire. 8312, 173–181.","chicago":"Blanc, Régis, Ashutosh Gupta, Laura Kovács, and Bernhard Kragl. “Tree Interpolation in Vampire.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-45221-5_13.","ama":"Blanc R, Gupta A, Kovács L, Kragl B. Tree interpolation in Vampire. 2013;8312:173-181. doi:10.1007/978-3-642-45221-5_13","apa":"Blanc, R., Gupta, A., Kovács, L., & Kragl, B. (2013). Tree interpolation in Vampire. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. https://doi.org/10.1007/978-3-642-45221-5_13","short":"R. Blanc, A. Gupta, L. Kovács, B. Kragl, 8312 (2013) 173–181.","ieee":"R. Blanc, A. Gupta, L. Kovács, and B. Kragl, “Tree interpolation in Vampire,” vol. 8312. Springer, pp. 173–181, 2013.","mla":"Blanc, Régis, et al. Tree Interpolation in Vampire. Vol. 8312, Springer, 2013, pp. 173–81, doi:10.1007/978-3-642-45221-5_13."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","quality_controlled":"1","oa":1,"page":"173 - 181","date_published":"2013-01-14T00:00:00Z","doi":"10.1007/978-3-642-45221-5_13","date_created":"2018-12-11T11:56:29Z","has_accepted_license":"1","year":"2013","day":"14","type":"conference","conference":{"name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","end_date":"2013-12-19","location":"Stellenbosch, South Africa","start_date":"2013-12-14"},"status":"public","series_title":"Lecture Notes in Computer Science","_id":"2237","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:45:34Z","date_updated":"2020-08-11T10:09:42Z","ddc":["000"],"alternative_title":["LNCS"],"scopus_import":1,"month":"01","intvolume":" 8312","abstract":[{"text":"We describe new extensions of the Vampire theorem prover for computing tree interpolants. These extensions generalize Craig interpolation in Vampire, and can also be used to derive sequence interpolants. We evaluated our implementation on a large number of examples over the theory of linear integer arithmetic and integer-indexed arrays, with and without quantifiers. When compared to other methods, our experiments show that some examples could only be solved by our implementation.","lang":"eng"}],"oa_version":"Submitted Version","volume":8312,"publication_status":"published","file":[{"file_name":"2013_LPAR_Blanc.pdf","date_created":"2020-05-15T11:10:40Z","creator":"dernst","file_size":279206,"date_updated":"2020-07-14T12:45:34Z","file_id":"7858","checksum":"9cebaafca032e6769d273f393305c705","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}]},{"scopus_import":1,"alternative_title":["LIPIcs"],"intvolume":" 23","month":"09","abstract":[{"text":"We show that modal logic over universally first-order definable classes of transitive frames is decidable. More precisely, let K be an arbitrary class of transitive Kripke frames definable by a universal first-order sentence. We show that the global and finite global satisfiability problems of modal logic over K are decidable in NP, regardless of choice of K. We also show that the local satisfiability and the finite local satisfiability problems of modal logic over K are decidable in NEXPTIME.","lang":"eng"}],"oa_version":"Published Version","ec_funded":1,"volume":23,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_size":454915,"date_updated":"2020-07-14T12:45:34Z","creator":"system","file_name":"IST-2016-136-v1+2_39.pdf","date_created":"2018-12-12T10:12:11Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"4929","checksum":"e0732e73a8b1e39483df7717d53e3e35"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"CSL: Computer Science Logic","start_date":"2013-09-02","end_date":"2013-09-05","location":"Torino, Italy"},"type":"conference","pubrep_id":"136","status":"public","series_title":"Leibniz International Proceedings in Informatics","_id":"2243","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:45:34Z","date_updated":"2020-08-11T10:09:42Z","ddc":["000","004"],"oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","page":"563 - 577","date_created":"2018-12-11T11:56:32Z","date_published":"2013-09-01T00:00:00Z","doi":"10.4230/LIPIcs.CSL.2013.563","year":"2013","has_accepted_license":"1","day":"01","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"}],"publist_id":"4708","author":[{"first_name":"Jakub","full_name":"Michaliszyn, Jakub","last_name":"Michaliszyn"},{"first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","full_name":"Otop, Jan"}],"title":"Elementary modal logics over transitive structures","citation":{"ama":"Michaliszyn J, Otop J. Elementary modal logics over transitive structures. 2013;23:563-577. doi:10.4230/LIPIcs.CSL.2013.563","apa":"Michaliszyn, J., & Otop, J. (2013). Elementary modal logics over transitive structures. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.563","short":"J. Michaliszyn, J. Otop, 23 (2013) 563–577.","ieee":"J. Michaliszyn and J. Otop, “Elementary modal logics over transitive structures,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 563–577, 2013.","mla":"Michaliszyn, Jakub, and Jan Otop. Elementary Modal Logics over Transitive Structures. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 563–77, doi:10.4230/LIPIcs.CSL.2013.563.","ista":"Michaliszyn J, Otop J. 2013. Elementary modal logics over transitive structures. 23, 563–577.","chicago":"Michaliszyn, Jakub, and Jan Otop. “Elementary Modal Logics over Transitive Structures.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.563."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publisher":"Springer","quality_controlled":"1","oa":1,"doi":"10.1007/s00450-013-0251-7","date_published":"2013-10-05T00:00:00Z","date_created":"2018-12-11T11:56:47Z","page":"331 - 344","day":"05","publication":"Computer Science Research and Development","has_accepted_license":"1","year":"2013","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"title":"Quantitative reactive modeling and verification","author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"publist_id":"4642","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” Computer Science Research and Development. Springer, 2013. https://doi.org/10.1007/s00450-013-0251-7.","ista":"Henzinger TA. 2013. Quantitative reactive modeling and verification. Computer Science Research and Development. 28(4), 331–344.","mla":"Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” Computer Science Research and Development, vol. 28, no. 4, Springer, 2013, pp. 331–44, doi:10.1007/s00450-013-0251-7.","apa":"Henzinger, T. A. (2013). Quantitative reactive modeling and verification. Computer Science Research and Development. Springer. https://doi.org/10.1007/s00450-013-0251-7","ama":"Henzinger TA. Quantitative reactive modeling and verification. Computer Science Research and Development. 2013;28(4):331-344. doi:10.1007/s00450-013-0251-7","short":"T.A. Henzinger, Computer Science Research and Development 28 (2013) 331–344.","ieee":"T. A. Henzinger, “Quantitative reactive modeling and verification,” Computer Science Research and Development, vol. 28, no. 4. Springer, pp. 331–344, 2013."},"month":"10","intvolume":" 28","scopus_import":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Formal verification aims to improve the quality of software by detecting errors before they do harm. At the basis of formal verification is the logical notion of correctness, which purports to capture whether or not a program behaves as desired. We suggest that the boolean partition of software into correct and incorrect programs falls short of the practical need to assess the behavior of software in a more nuanced fashion against multiple criteria. We therefore propose to introduce quantitative fitness measures for programs, specifically for measuring the function, performance, and robustness of reactive programs such as concurrent processes. This article describes the goals of the ERC Advanced Investigator Project QUAREM. The project aims to build and evaluate a theory of quantitative fitness measures for reactive models. Such a theory must strive to obtain quantitative generalizations of the paradigms that have been success stories in qualitative reactive modeling, such as compositionality, property-preserving abstraction and abstraction refinement, model checking, and synthesis. The theory will be evaluated not only in the context of software and hardware engineering, but also in the context of systems biology. In particular, we will use the quantitative reactive models and fitness measures developed in this project for testing hypotheses about the mechanisms behind data from biological experiments."}],"volume":28,"issue":"4","ec_funded":1,"file":[{"date_created":"2018-12-12T10:17:51Z","file_name":"IST-2016-626-v1+1_s00450-013-0251-7.pdf","creator":"system","date_updated":"2020-07-14T12:45:37Z","file_size":570361,"checksum":"f117a00f9f046165bfa95595681e08a0","file_id":"5308","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_status":"published","status":"public","pubrep_id":"626","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"2289","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:45:37Z","ddc":["000"],"date_updated":"2021-01-12T06:56:33Z"},{"_id":"2288","status":"public","type":"conference_editor","conference":{"name":"CMSB: Computational Methods in Systems Biology","location":"Klosterneuburg, Austria","end_date":"2013-09-24","start_date":"2013-09-22"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2019-08-02T12:37:44Z","citation":{"mla":"Gupta, Ashutosh, and Thomas A. Henzinger, editors. Computational Methods in Systems Biology. Vol. 8130, Springer, 2013, doi:10.1007/978-3-642-40708-6.","short":"A. Gupta, T.A. Henzinger, eds., Computational Methods in Systems Biology, Springer, 2013.","ieee":"A. Gupta and T. A. Henzinger, Eds., Computational Methods in Systems Biology, vol. 8130. Springer, 2013.","apa":"Gupta, A., & Henzinger, T. A. (Eds.). (2013). Computational Methods in Systems Biology (Vol. 8130). Presented at the CMSB: Computational Methods in Systems Biology, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-40708-6","ama":"Gupta A, Henzinger TA, eds. Computational Methods in Systems Biology. Vol 8130. Springer; 2013. doi:10.1007/978-3-642-40708-6","chicago":"Gupta, Ashutosh, and Thomas A Henzinger, eds. Computational Methods in Systems Biology. Vol. 8130. Springer, 2013. https://doi.org/10.1007/978-3-642-40708-6.","ista":"Gupta A, Henzinger TA eds. 2013. Computational Methods in Systems Biology, Springer,p."},"department":[{"_id":"ToHe"}],"title":"Computational Methods in Systems Biology","editor":[{"first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh","last_name":"Gupta"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"publist_id":"4643","oa_version":"None","abstract":[{"text":"This book constitutes the proceedings of the 11th International Conference on Computational Methods in Systems Biology, CMSB 2013, held in Klosterneuburg, Austria, in September 2013. The 15 regular papers included in this volume were carefully reviewed and selected from 27 submissions. They deal with computational models for all levels, from molecular and cellular, to organs and entire organisms.","lang":"eng"}],"month":"07","intvolume":" 8130","quality_controlled":"1","publisher":"Springer","alternative_title":["LNCS"],"day":"01","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-642-40707-9"]},"year":"2013","publication_status":"published","date_published":"2013-07-01T00:00:00Z","volume":8130,"doi":"10.1007/978-3-642-40708-6","date_created":"2018-12-11T11:56:47Z"}]