[{"date_published":"2018-01-01T00:00:00Z","type":"journal_article","article_processing_charge":"No","citation":{"ista":"Jiang Y, Liu H, Song H, Kong H, Wang R, Guan Y, Sha L. 2018. Safety-assured model-driven design of the multifunction vehicle bus controller. IEEE Transactions on Intelligent Transportation Systems. 19(10), 3320–3333.","mla":"Jiang, Yu, et al. “Safety-Assured Model-Driven Design of the Multifunction Vehicle Bus Controller.” <i>IEEE Transactions on Intelligent Transportation Systems</i>, vol. 19, no. 10, IEEE, 2018, pp. 3320–33, doi:<a href=\"https://doi.org/10.1109/TITS.2017.2778077\">10.1109/TITS.2017.2778077</a>.","short":"Y. Jiang, H. Liu, H. Song, H. Kong, R. Wang, Y. Guan, L. Sha, IEEE Transactions on Intelligent Transportation Systems 19 (2018) 3320–3333.","ama":"Jiang Y, Liu H, Song H, et al. Safety-assured model-driven design of the multifunction vehicle bus controller. <i>IEEE Transactions on Intelligent Transportation Systems</i>. 2018;19(10):3320-3333. doi:<a href=\"https://doi.org/10.1109/TITS.2017.2778077\">10.1109/TITS.2017.2778077</a>","apa":"Jiang, Y., Liu, H., Song, H., Kong, H., Wang, R., Guan, Y., &#38; Sha, L. (2018). Safety-assured model-driven design of the multifunction vehicle bus controller. <i>IEEE Transactions on Intelligent Transportation Systems</i>. IEEE. <a href=\"https://doi.org/10.1109/TITS.2017.2778077\">https://doi.org/10.1109/TITS.2017.2778077</a>","chicago":"Jiang, Yu, Han Liu, Huobing Song, Hui Kong, Rui Wang, Yong Guan, and Lui Sha. “Safety-Assured Model-Driven Design of the Multifunction Vehicle Bus Controller.” <i>IEEE Transactions on Intelligent Transportation Systems</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/TITS.2017.2778077\">https://doi.org/10.1109/TITS.2017.2778077</a>.","ieee":"Y. Jiang <i>et al.</i>, “Safety-assured model-driven design of the multifunction vehicle bus controller,” <i>IEEE Transactions on Intelligent Transportation Systems</i>, vol. 19, no. 10. IEEE, pp. 3320–3333, 2018."},"month":"01","oa_version":"None","issue":"10","date_updated":"2023-09-18T08:12:49Z","department":[{"_id":"ToHe"}],"publist_id":"7389","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"434","language":[{"iso":"eng"}],"year":"2018","publisher":"IEEE","related_material":{"record":[{"relation":"earlier_version","id":"1205","status":"public"}]},"publication_status":"published","publication":"IEEE Transactions on Intelligent Transportation Systems","doi":"10.1109/TITS.2017.2778077","abstract":[{"lang":"eng","text":"In this paper, we present a formal model-driven design approach to establish a safety-assured implementation of multifunction vehicle bus controller (MVBC), which controls the data transmission among the devices of the vehicle. First, the generic models and safety requirements described in International Electrotechnical Commission Standard 61375 are formalized as time automata and timed computation tree logic formulas, respectively. With model checking tool Uppaal, we verify whether or not the constructed timed automata satisfy the formulas and several logic inconsistencies in the original standard are detected and corrected. Then, we apply the code generation tool Times to generate C code from the verified model, which is later synthesized into a real MVBC chip, with some handwriting glue code. Furthermore, the runtime verification tool RMOR is applied on the integrated code, to verify some safety requirements that cannot be formalized on the timed automata. For evaluation, we compare the proposed approach with existing MVBC design methods, such as BeagleBone, Galsblock, and Simulink. Experiments show that more ambiguousness or bugs in the standard are detected during Uppaal verification, and the generated code of Times outperforms the C code generated by others in terms of the synthesized binary code size. The errors in the standard have been confirmed and the resulting MVBC has been deployed in the real train communication network."}],"status":"public","date_created":"2018-12-11T11:46:27Z","external_id":{"isi":["000446651100020"]},"page":"3320 - 3333","scopus_import":"1","intvolume":"        19","title":"Safety-assured model-driven design of the multifunction vehicle bus controller","volume":19,"quality_controlled":"1","day":"01","author":[{"first_name":"Yu","last_name":"Jiang","full_name":"Jiang, Yu"},{"first_name":"Han","last_name":"Liu","full_name":"Liu, Han"},{"first_name":"Huobing","last_name":"Song","full_name":"Song, Huobing"},{"orcid":"0000-0002-3066-6941","last_name":"Kong","first_name":"Hui","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","full_name":"Kong, Hui"},{"full_name":"Wang, Rui","first_name":"Rui","last_name":"Wang"},{"full_name":"Guan, Yong","first_name":"Yong","last_name":"Guan"},{"full_name":"Sha, Lui","last_name":"Sha","first_name":"Lui"}],"isi":1},{"year":"2017","language":[{"iso":"eng"}],"_id":"711","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publist_id":"6976","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","date_updated":"2021-01-12T08:11:53Z","oa_version":"Published Version","ddc":["004","005"],"publication_identifier":{"issn":["18688969"]},"oa":1,"month":"08","citation":{"apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2017). Bidirectional nested weighted automata (Vol. 85). Presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2017.5\">https://doi.org/10.4230/LIPIcs.CONCUR.2017.5</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Bidirectional Nested Weighted Automata,” Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2017.5\">https://doi.org/10.4230/LIPIcs.CONCUR.2017.5</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Bidirectional nested weighted automata,” presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany, 2017, vol. 85.","ista":"Chatterjee K, Henzinger TA, Otop J. 2017. Bidirectional nested weighted automata. 28th International Conference on Concurrency Theory, CONCUR, LIPIcs, vol. 85, 5.","mla":"Chatterjee, Krishnendu, et al. <i>Bidirectional Nested Weighted Automata</i>. Vol. 85, 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2017.5\">10.4230/LIPIcs.CONCUR.2017.5</a>.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ama":"Chatterjee K, Henzinger TA, Otop J. Bidirectional nested weighted automata. In: Vol 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2017.5\">10.4230/LIPIcs.CONCUR.2017.5</a>"},"type":"conference","date_published":"2017-08-01T00:00:00Z","day":"01","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"last_name":"Otop","first_name":"Jan","full_name":"Otop, Jan"}],"quality_controlled":"1","volume":85,"title":"Bidirectional nested weighted automata","file":[{"checksum":"d2bda4783821a6358333fe27f11f4737","content_type":"application/pdf","file_name":"IST-2017-886-v1+1_LIPIcs-CONCUR-2017-5.pdf","file_size":570294,"date_created":"2018-12-12T10:08:02Z","creator":"system","file_id":"4661","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:47:49Z"}],"intvolume":"        85","scopus_import":1,"article_number":"5","alternative_title":["LIPIcs"],"conference":{"name":"28th International Conference on Concurrency Theory, CONCUR","start_date":"2017-09-05","end_date":"2017-09-08","location":"Berlin, Germany"},"date_created":"2018-12-11T11:48:04Z","status":"public","pubrep_id":"886","file_date_updated":"2020-07-14T12:47:49Z","abstract":[{"text":"Nested weighted automata (NWA) present a robust and convenient automata-theoretic formalism for quantitative specifications. Previous works have considered NWA that processed input words only in the forward direction. It is natural to allow the automata to process input words backwards as well, for example, to measure the maximal or average time between a response and the preceding request. We therefore introduce and study bidirectional NWA that can process input words in both directions. First, we show that bidirectional NWA can express interesting quantitative properties that are not expressible by forward-only NWA. Second, for the fundamental decision problems of emptiness and universality, we establish decidability and complexity results for the new framework which match the best-known results for the special case of forward-only NWA. Thus, for NWA, the increased expressiveness of bidirectionality is achieved at no additional computational complexity. This is in stark contrast to the unweighted case, where bidirectional finite automata are no more expressive but exponentially more succinct than their forward-only counterparts.","lang":"eng"}],"doi":"10.4230/LIPIcs.CONCUR.2017.5","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"abstract":[{"lang":"eng","text":"This special issue of the Journal on Formal Methods in System Design is dedicated to Prof. Helmut Veith, who unexpectedly passed away in March 2016. Helmut Veith was a brilliant researcher, inspiring collaborator, passionate mentor, generous friend, and valued member of the formal methods community. Helmut was not only known for his numerous and influential contributions in the field of automated verification (most prominently his work on Counterexample-Guided Abstraction Refinement [1,2]), but also for his untiring and passionate efforts for the logic community: he co-organized the Vienna Summer of Logic (an event comprising twelve conferences and numerous workshops which attracted thousands of researchers from all over the world), he initiated the Vienna Center for Logic and Algorithms (which promotes international collaboration on logic and algorithms and organizes outreach events such as the LogicLounge), and he coordinated the Doctoral Program on Logical Methods in Computer Science at TU Wien (currently educating more than 40 doctoral students) and a National Research Network on Rigorous Systems Engineering (uniting fifteen researchers in Austria to address the challenge of building reliable and safe computer\r\nsystems). With his enthusiasm and commitment, Helmut completely reshaped the Austrian research landscape in the field of logic and verification in his few years as a full professor at TU Wien."}],"citation":{"ieee":"G. Gottlob, T. A. Henzinger, and G. Weißenbacher, “Preface of the special issue in memoriam Helmut Veith,” <i>Formal Methods in System Design</i>, vol. 51, no. 2. Springer, pp. 267–269, 2017.","apa":"Gottlob, G., Henzinger, T. A., &#38; Weißenbacher, G. (2017). Preface of the special issue in memoriam Helmut Veith. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-017-0307-6\">https://doi.org/10.1007/s10703-017-0307-6</a>","chicago":"Gottlob, Georg, Thomas A Henzinger, and Georg Weißenbacher. “Preface of the Special Issue in Memoriam Helmut Veith.” <i>Formal Methods in System Design</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s10703-017-0307-6\">https://doi.org/10.1007/s10703-017-0307-6</a>.","ama":"Gottlob G, Henzinger TA, Weißenbacher G. Preface of the special issue in memoriam Helmut Veith. <i>Formal Methods in System Design</i>. 2017;51(2):267-269. doi:<a href=\"https://doi.org/10.1007/s10703-017-0307-6\">10.1007/s10703-017-0307-6</a>","short":"G. Gottlob, T.A. Henzinger, G. Weißenbacher, Formal Methods in System Design 51 (2017) 267–269.","ista":"Gottlob G, Henzinger TA, Weißenbacher G. 2017. Preface of the special issue in memoriam Helmut Veith. Formal Methods in System Design. 51(2), 267–269.","mla":"Gottlob, Georg, et al. “Preface of the Special Issue in Memoriam Helmut Veith.” <i>Formal Methods in System Design</i>, vol. 51, no. 2, Springer, 2017, pp. 267–69, doi:<a href=\"https://doi.org/10.1007/s10703-017-0307-6\">10.1007/s10703-017-0307-6</a>."},"doi":"10.1007/s10703-017-0307-6","article_processing_charge":"No","publication_status":"published","publication":"Formal Methods in System Design","type":"journal_article","date_published":"2017-11-14T00:00:00Z","publisher":"Springer","issue":"2","external_id":{"isi":["000415615600001"]},"oa_version":"None","date_created":"2018-12-11T11:48:16Z","month":"11","status":"public","publist_id":"6924","department":[{"_id":"ToHe"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":"        51","page":"267 - 269","date_updated":"2023-09-27T12:29:29Z","year":"2017","language":[{"iso":"eng"}],"isi":1,"_id":"743","day":"14","author":[{"first_name":"Georg","last_name":"Gottlob","full_name":"Gottlob, Georg"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Georg","last_name":"Weißenbacher","full_name":"Weißenbacher, Georg"}],"quality_controlled":"1","volume":51,"title":"Preface of the special issue in memoriam Helmut Veith"},{"doi":"10.1007/s10703-016-0256-5","file_date_updated":"2020-07-14T12:44:44Z","abstract":[{"lang":"eng","text":"We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of calls that the program makes to an external interface. The specification requires that any such sequence produced under a preemptive scheduler should be included in the set of sequences produced under a non-preemptive scheduler. We guarantee that our synthesis does not introduce deadlocks and that the synchronization inserted is optimal w.r.t. a given objective function. The solution is based on a finitary abstraction, an algorithm for bounded language inclusion modulo an independence relation, and generation of a set of global constraints over synchronization placements. Each model of the global constraints set corresponds to a correctness-ensuring synchronization placement. The placement that is optimal w.r.t. the given objective function is chosen as the synchronization solution. We apply the approach to device-driver programming, where the driver threads call the software interface of the device and the API provided by the operating system. Our experiments demonstrate that our synthesis method is precise and efficient. The implicit specification helped us find one concurrency bug previously missed when model-checking using an explicit, user-provided specification. We implemented objective functions for coarse-grained and fine-grained locking and observed that different synchronization placements are produced for our experiments, favoring a minimal number of synchronization operations or maximum concurrency, respectively."}],"publisher":"Springer","publication":"Formal Methods in System Design","related_material":{"record":[{"id":"1729","status":"public","relation":"earlier_version"}]},"publication_status":"published","external_id":{"isi":["000399888900001"]},"pubrep_id":"656","status":"public","date_created":"2018-12-11T11:51:27Z","page":"97 - 139","scopus_import":"1","intvolume":"        50","ec_funded":1,"isi":1,"file":[{"date_updated":"2020-07-14T12:44:44Z","access_level":"open_access","relation":"main_file","creator":"system","file_id":"4985","file_size":1416170,"file_name":"IST-2016-656-v1+1_s10703-016-0256-5.pdf","date_created":"2018-12-12T10:13:05Z","content_type":"application/pdf","checksum":"1163dfd997e8212c789525d4178b1653"}],"title":"From non-preemptive to preemptive scheduling using synchronization synthesis","quality_controlled":"1","volume":50,"author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol"},{"full_name":"Clarke, Edmund","first_name":"Edmund","last_name":"Clarke"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","first_name":"Arjun","last_name":"Radhakrishna"},{"first_name":"Leonid","last_name":"Ryzhyk","full_name":"Ryzhyk, Leonid"},{"id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87","full_name":"Samanta, Roopsha","last_name":"Samanta","first_name":"Roopsha"},{"orcid":"0000-0003-4409-8487","last_name":"Tarrach","first_name":"Thorsten","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87","full_name":"Tarrach, Thorsten"}],"day":"01","article_processing_charge":"No","citation":{"mla":"Cerny, Pavol, et al. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.” <i>Formal Methods in System Design</i>, vol. 50, no. 2–3, Springer, 2017, pp. 97–139, doi:<a href=\"https://doi.org/10.1007/s10703-016-0256-5\">10.1007/s10703-016-0256-5</a>.","ista":"Cerny P, Clarke E, Henzinger TA, Radhakrishna A, Ryzhyk L, Samanta R, Tarrach T. 2017. From non-preemptive to preemptive scheduling using synchronization synthesis. Formal Methods in System Design. 50(2–3), 97–139.","short":"P. Cerny, E. Clarke, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, R. Samanta, T. Tarrach, Formal Methods in System Design 50 (2017) 97–139.","ama":"Cerny P, Clarke E, Henzinger TA, et al. From non-preemptive to preemptive scheduling using synchronization synthesis. <i>Formal Methods in System Design</i>. 2017;50(2-3):97-139. doi:<a href=\"https://doi.org/10.1007/s10703-016-0256-5\">10.1007/s10703-016-0256-5</a>","apa":"Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta, R., &#38; Tarrach, T. (2017). From non-preemptive to preemptive scheduling using synchronization synthesis. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-016-0256-5\">https://doi.org/10.1007/s10703-016-0256-5</a>","chicago":"Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.” <i>Formal Methods in System Design</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s10703-016-0256-5\">https://doi.org/10.1007/s10703-016-0256-5</a>.","ieee":"P. Cerny <i>et al.</i>, “From non-preemptive to preemptive scheduling using synchronization synthesis,” <i>Formal Methods in System Design</i>, vol. 50, no. 2–3. Springer, pp. 97–139, 2017."},"date_published":"2017-06-01T00:00:00Z","type":"journal_article","ddc":["000"],"oa_version":"Published Version","issue":"2-3","month":"06","oa":1,"project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publist_id":"5929","department":[{"_id":"ToHe"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-20T11:13:51Z","has_accepted_license":"1","_id":"1338","language":[{"iso":"eng"}],"year":"2017"},{"_id":"1351","language":[{"iso":"eng"}],"year":"2017","date_updated":"2025-05-28T11:57:04Z","has_accepted_license":"1","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","grant_number":"618091","call_identifier":"FP7","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425"},{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"ToHe"},{"_id":"CaGu"},{"_id":"NiBa"}],"publist_id":"5898","oa":1,"month":"12","publication_identifier":{"issn":["00015903"]},"ddc":["006","576"],"oa_version":"Published Version","issue":"8","date_published":"2017-12-01T00:00:00Z","type":"journal_article","article_processing_charge":"No","citation":{"chicago":"Giacobbe, Mirco, Calin C Guet, Ashutosh Gupta, Thomas A Henzinger, Tiago Paixao, and Tatjana Petrov. “Model Checking the Evolution of Gene Regulatory Networks.” <i>Acta Informatica</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00236-016-0278-x\">https://doi.org/10.1007/s00236-016-0278-x</a>.","apa":"Giacobbe, M., Guet, C. C., Gupta, A., Henzinger, T. A., Paixao, T., &#38; Petrov, T. (2017). Model checking the evolution of gene regulatory networks. <i>Acta Informatica</i>. Springer. <a href=\"https://doi.org/10.1007/s00236-016-0278-x\">https://doi.org/10.1007/s00236-016-0278-x</a>","ieee":"M. Giacobbe, C. C. Guet, A. Gupta, T. A. Henzinger, T. Paixao, and T. Petrov, “Model checking the evolution of gene regulatory networks,” <i>Acta Informatica</i>, vol. 54, no. 8. Springer, pp. 765–787, 2017.","ista":"Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. 2017. Model checking the evolution of gene regulatory networks. Acta Informatica. 54(8), 765–787.","mla":"Giacobbe, Mirco, et al. “Model Checking the Evolution of Gene Regulatory Networks.” <i>Acta Informatica</i>, vol. 54, no. 8, Springer, 2017, pp. 765–87, doi:<a href=\"https://doi.org/10.1007/s00236-016-0278-x\">10.1007/s00236-016-0278-x</a>.","short":"M. Giacobbe, C.C. Guet, A. Gupta, T.A. Henzinger, T. Paixao, T. Petrov, Acta Informatica 54 (2017) 765–787.","ama":"Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. Model checking the evolution of gene regulatory networks. <i>Acta Informatica</i>. 2017;54(8):765-787. doi:<a href=\"https://doi.org/10.1007/s00236-016-0278-x\">10.1007/s00236-016-0278-x</a>"},"title":"Model checking the evolution of gene regulatory networks","file":[{"relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:44:46Z","content_type":"application/pdf","checksum":"4e661d9135d7f8c342e8e258dee76f3e","creator":"dernst","file_id":"5841","file_size":755241,"file_name":"2017_ActaInformatica_Giacobbe.pdf","date_created":"2019-01-17T15:57:29Z"}],"volume":54,"quality_controlled":"1","day":"01","author":[{"orcid":"0000-0001-8180-0904","last_name":"Giacobbe","first_name":"Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","full_name":"Giacobbe, Mirco"},{"full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","last_name":"Guet","first_name":"Calin C","orcid":"0000-0001-6220-2052"},{"first_name":"Ashutosh","last_name":"Gupta","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-2361-3953","first_name":"Tiago","last_name":"Paixao","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","full_name":"Paixao, Tiago"},{"last_name":"Petrov","first_name":"Tatjana","orcid":"0000-0002-9041-0905","full_name":"Petrov, Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87"}],"isi":1,"ec_funded":1,"page":"765 - 787","scopus_import":"1","intvolume":"        54","pubrep_id":"649","status":"public","date_created":"2018-12-11T11:51:32Z","external_id":{"isi":["000414343200003"]},"publisher":"Springer","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1835"}]},"publication":"Acta Informatica","publication_status":"published","doi":"10.1007/s00236-016-0278-x","file_date_updated":"2020-07-14T12:44:46Z","abstract":[{"text":"The behaviour of gene regulatory networks (GRNs) is typically analysed using simulation-based statistical testing-like methods. In this paper, we demonstrate that we can replace this approach by a formal verification-like method that gives higher assurance and scalability. We focus on Wagner’s weighted GRN model with varying weights, which is used in evolutionary biology. In the model, weight parameters represent the gene interaction strength that may change due to genetic mutations. For a property of interest, we synthesise the constraints over the parameter space that represent the set of GRNs satisfying the property. We experimentally show that our parameter synthesis procedure computes the mutational robustness of GRNs—an important problem of interest in evolutionary biology—more efficiently than the classical simulation method. We specify the property in linear temporal logic. We employ symbolic bounded model checking and SMT solving to compute the space of GRNs that satisfy the property, which amounts to synthesizing a set of linear constraints on the weights.","lang":"eng"}]},{"project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"}],"publist_id":"5800","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_updated":"2023-09-20T09:43:09Z","language":[{"iso":"eng"}],"_id":"1407","year":"2017","article_processing_charge":"No","main_file_link":[{"url":"http://arxiv.org/abs/1410.5387","open_access":"1"}],"citation":{"chicago":"Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.nahs.2016.04.006\">https://doi.org/10.1016/j.nahs.2016.04.006</a>.","apa":"Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., &#38; Belta, C. (2017). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.nahs.2016.04.006\">https://doi.org/10.1016/j.nahs.2016.04.006</a>","ieee":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 23, no. 2. Elsevier, pp. 230–253, 2017.","ista":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2017. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. 23(2), 230–253.","mla":"Svoreňová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 23, no. 2, Elsevier, 2017, pp. 230–53, doi:<a href=\"https://doi.org/10.1016/j.nahs.2016.04.006\">10.1016/j.nahs.2016.04.006</a>.","ama":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. <i>Nonlinear Analysis: Hybrid Systems</i>. 2017;23(2):230-253. doi:<a href=\"https://doi.org/10.1016/j.nahs.2016.04.006\">10.1016/j.nahs.2016.04.006</a>","short":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, C. Belta, Nonlinear Analysis: Hybrid Systems 23 (2017) 230–253."},"date_published":"2017-02-01T00:00:00Z","type":"journal_article","issue":"2","oa_version":"Preprint","oa":1,"month":"02","page":"230 - 253","scopus_import":"1","intvolume":"        23","isi":1,"ec_funded":1,"quality_controlled":"1","volume":23,"title":"Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games","day":"01","author":[{"full_name":"Svoreňová, Mária","first_name":"Mária","last_name":"Svoreňová"},{"orcid":"0000-0002-8122-2881","last_name":"Kretinsky","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","first_name":"Martin","last_name":"Chmelik"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Cěrná","first_name":"Ivana","full_name":"Cěrná, Ivana"},{"last_name":"Belta","first_name":"Cǎlin","full_name":"Belta, Cǎlin"}],"abstract":[{"text":"We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal logic specification with probability 1 (almost-surely). We focus on discrete-time, stochastic linear dynamics and specifications given as formulas of the Generalized Reactivity(1) fragment of Linear Temporal Logic over linear predicates in the states of the system. We propose a solution based on iterative abstraction-refinement, and turn-based 2-player probabilistic games. While the theoretical guarantee of our algorithm after any finite number of iterations is only a partial solution, we show that if our algorithm terminates, then the result is the set of all satisfying initial states. Moreover, for any (partial) solution our algorithm synthesizes witness control strategies to ensure almost-sure satisfaction of the temporal logic specification. While the proposed algorithm guarantees progress and soundness in every iteration, it is computationally demanding. We offer an alternative, more efficient solution for the reachability properties that decomposes the problem into a series of smaller problems of the same type. All algorithms are demonstrated on an illustrative case study.","lang":"eng"}],"doi":"10.1016/j.nahs.2016.04.006","publisher":"Elsevier","publication_status":"published","publication":"Nonlinear Analysis: Hybrid Systems","related_material":{"record":[{"id":"1689","status":"public","relation":"earlier_version"}]},"external_id":{"arxiv":["1410.5387"],"isi":["000390637000014"]},"arxiv":1,"status":"public","date_created":"2018-12-11T11:51:50Z"},{"language":[{"iso":"eng"}],"_id":"549","year":"2017","project":[{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"department":[{"_id":"ToHe"}],"publist_id":"7264","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-10-17T12:02:46Z","has_accepted_license":"1","publication_identifier":{"issn":["2075-2180"]},"oa_version":"Submitted Version","ddc":["004"],"oa":1,"month":"10","article_processing_charge":"No","main_file_link":[{"url":"https://arxiv.org/abs/1710.03391v1","open_access":"1"}],"citation":{"chicago":"Finkbeiner, Bernd, and Andrey Kupriyanov. “Causality-Based Model Checking.” In <i>Electronic Proceedings in Theoretical Computer Science</i>, 259:31–38. Open Publishing Association, 2017. <a href=\"https://doi.org/10.4204/EPTCS.259.3\">https://doi.org/10.4204/EPTCS.259.3</a>.","apa":"Finkbeiner, B., &#38; Kupriyanov, A. (2017). Causality-based model checking. In <i>Electronic Proceedings in Theoretical Computer Science</i> (Vol. 259, pp. 31–38). Uppsala, Sweden: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.259.3\">https://doi.org/10.4204/EPTCS.259.3</a>","ieee":"B. Finkbeiner and A. Kupriyanov, “Causality-based model checking,” in <i>Electronic Proceedings in Theoretical Computer Science</i>, Uppsala, Sweden, 2017, vol. 259, pp. 31–38.","mla":"Finkbeiner, Bernd, and Andrey Kupriyanov. “Causality-Based Model Checking.” <i>Electronic Proceedings in Theoretical Computer Science</i>, vol. 259, Open Publishing Association, 2017, pp. 31–38, doi:<a href=\"https://doi.org/10.4204/EPTCS.259.3\">10.4204/EPTCS.259.3</a>.","ista":"Finkbeiner B, Kupriyanov A. 2017. Causality-based model checking. Electronic Proceedings in Theoretical Computer Science. CREST: Causal Reasoning for Embedded and Safety-Critical Systems Technologies, EPTCS, vol. 259, 31–38.","short":"B. Finkbeiner, A. Kupriyanov, in:, Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2017, pp. 31–38.","ama":"Finkbeiner B, Kupriyanov A. Causality-based model checking. In: <i>Electronic Proceedings in Theoretical Computer Science</i>. Vol 259. Open Publishing Association; 2017:31-38. doi:<a href=\"https://doi.org/10.4204/EPTCS.259.3\">10.4204/EPTCS.259.3</a>"},"date_published":"2017-10-10T00:00:00Z","type":"conference","quality_controlled":"1","volume":259,"title":"Causality-based model checking","file":[{"date_updated":"2020-07-14T12:47:00Z","relation":"main_file","access_level":"open_access","date_created":"2018-12-12T10:12:21Z","file_name":"IST-2018-925-v1+1_1710.03391v1.pdf","file_size":209294,"file_id":"4939","creator":"system","checksum":"6274f6c0da3376a7b079180d81568518","content_type":"application/pdf"}],"day":"10","author":[{"last_name":"Finkbeiner","first_name":"Bernd","full_name":"Finkbeiner, Bernd"},{"last_name":"Kupriyanov","first_name":"Andrey","full_name":"Kupriyanov, Andrey","id":"2C311BF8-F248-11E8-B48F-1D18A9856A87"}],"page":"31 - 38","scopus_import":"1","intvolume":"       259","conference":{"location":"Uppsala, Sweden","name":"CREST: Causal Reasoning for Embedded and Safety-Critical Systems Technologies","start_date":"2017-04-29","end_date":"2017-04-29"},"alternative_title":["EPTCS"],"status":"public","pubrep_id":"925","date_created":"2018-12-11T11:47:07Z","file_date_updated":"2020-07-14T12:47:00Z","abstract":[{"text":"Model checking is usually based on a comprehensive traversal of the state space. Causality-based model checking is a radically different approach that instead analyzes the cause-effect relationships in a program. We give an overview on a new class of model checking algorithms that capture the causal relationships in a special data structure called concurrent traces. Concurrent traces identify key events in an execution history and link them through their cause-effect relationships. The model checker builds a tableau of concurrent traces, where the case splits represent different causal explanations of a hypothetical error. Causality-based model checking has been implemented in the ARCTOR tool, and applied to previously intractable multi-threaded benchmarks.","lang":"eng"}],"doi":"10.4204/EPTCS.259.3","publisher":"Open Publishing Association","publication_status":"published","publication":"Electronic Proceedings in Theoretical Computer Science"},{"intvolume":"     10460","scopus_import":"1","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 and S11407-N23 (RiSE/SHiNE), and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003.","page":"367 - 381","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"day":"25","file":[{"access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:47:25Z","content_type":"application/pdf","checksum":"b2402766ec02c79801aac634bd8f9f6c","file_id":"7048","creator":"dernst","file_name":"2017_ModelsAlgorithms_Chatterjee.pdf","date_created":"2019-11-19T08:06:50Z","file_size":192826}],"title":"The cost of exactness in quantitative reachability","quality_controlled":"1","volume":10460,"ec_funded":1,"publication":"Models, Algorithms, Logics and Tools","publication_status":"published","publisher":"Springer","doi":"10.1007/978-3-319-63121-9_18","file_date_updated":"2020-07-14T12:47:25Z","abstract":[{"lang":"eng","text":"In the analysis of reactive systems a quantitative objective assigns a real value to every trace of the system. The value decision problem for a quantitative objective requires a trace whose value is at least a given threshold, and the exact value decision problem requires a trace whose value is exactly the threshold. We compare the computational complexity of the value and exact value decision problems for classical quantitative objectives, such as sum, discounted sum, energy, and mean-payoff for two standard models of reactive systems, namely, graphs and graph games."}],"date_created":"2018-12-11T11:47:34Z","status":"public","series_title":"Theoretical Computer Science and General Issues","alternative_title":["LNCS"],"has_accepted_license":"1","date_updated":"2025-06-02T08:53:45Z","publist_id":"7170","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"project":[{"call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"editor":[{"full_name":"Aceto, Luca","last_name":"Aceto","first_name":"Luca"},{"full_name":"Bacci, Giorgio","first_name":"Giorgio","last_name":"Bacci"},{"first_name":"Anna","last_name":"Ingólfsdóttir","full_name":"Ingólfsdóttir, Anna"},{"full_name":"Legay, Axel","last_name":"Legay","first_name":"Axel"},{"full_name":"Mardare, Radu","last_name":"Mardare","first_name":"Radu"}],"year":"2017","_id":"625","language":[{"iso":"eng"}],"type":"book_chapter","date_published":"2017-07-25T00:00:00Z","citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “The Cost of Exactness in Quantitative Reachability.” In <i>Models, Algorithms, Logics and Tools</i>, edited by Luca Aceto, Giorgio Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare, 10460:367–81. Theoretical Computer Science and General Issues. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-63121-9_18\">https://doi.org/10.1007/978-3-319-63121-9_18</a>.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2017). The cost of exactness in quantitative reachability. In L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, &#38; R. Mardare (Eds.), <i>Models, Algorithms, Logics and Tools</i> (Vol. 10460, pp. 367–381). Springer. <a href=\"https://doi.org/10.1007/978-3-319-63121-9_18\">https://doi.org/10.1007/978-3-319-63121-9_18</a>","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “The cost of exactness in quantitative reachability,” in <i>Models, Algorithms, Logics and Tools</i>, vol. 10460, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, and R. Mardare, Eds. Springer, 2017, pp. 367–381.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2017.The cost of exactness in quantitative reachability. In: Models, Algorithms, Logics and Tools. LNCS, vol. 10460, 367–381.","mla":"Chatterjee, Krishnendu, et al. “The Cost of Exactness in Quantitative Reachability.” <i>Models, Algorithms, Logics and Tools</i>, edited by Luca Aceto et al., vol. 10460, Springer, 2017, pp. 367–81, doi:<a href=\"https://doi.org/10.1007/978-3-319-63121-9_18\">10.1007/978-3-319-63121-9_18</a>.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, R. Mardare (Eds.), Models, Algorithms, Logics and Tools, Springer, 2017, pp. 367–381.","ama":"Chatterjee K, Doyen L, Henzinger TA. The cost of exactness in quantitative reachability. In: Aceto L, Bacci G, Ingólfsdóttir A, Legay A, Mardare R, eds. <i>Models, Algorithms, Logics and Tools</i>. Vol 10460. Theoretical Computer Science and General Issues. Springer; 2017:367-381. doi:<a href=\"https://doi.org/10.1007/978-3-319-63121-9_18\">10.1007/978-3-319-63121-9_18</a>"},"article_processing_charge":"No","oa":1,"month":"07","oa_version":"Submitted Version","ddc":["000"],"publication_identifier":{"issn":["0302-9743"],"isbn":["978-3-319-63120-2"]}},{"oa":1,"month":"03","ddc":["000"],"oa_version":"Submitted Version","publication_identifier":{"isbn":["978-366254576-8"]},"type":"conference","date_published":"2017-03-31T00:00:00Z","citation":{"chicago":"Bogomolov, Sergiy, Goran Frehse, Mirco Giacobbe, and Thomas A Henzinger. “Counterexample Guided Refinement of Template Polyhedra,” 10205:589–606. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-662-54577-5_34\">https://doi.org/10.1007/978-3-662-54577-5_34</a>.","apa":"Bogomolov, S., Frehse, G., Giacobbe, M., &#38; Henzinger, T. A. (2017). Counterexample guided refinement of template polyhedra (Vol. 10205, pp. 589–606). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden: Springer. <a href=\"https://doi.org/10.1007/978-3-662-54577-5_34\">https://doi.org/10.1007/978-3-662-54577-5_34</a>","ieee":"S. Bogomolov, G. Frehse, M. Giacobbe, and T. A. Henzinger, “Counterexample guided refinement of template polyhedra,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10205, pp. 589–606.","mla":"Bogomolov, Sergiy, et al. <i>Counterexample Guided Refinement of Template Polyhedra</i>. Vol. 10205, Springer, 2017, pp. 589–606, doi:<a href=\"https://doi.org/10.1007/978-3-662-54577-5_34\">10.1007/978-3-662-54577-5_34</a>.","ista":"Bogomolov S, Frehse G, Giacobbe M, Henzinger TA. 2017. Counterexample guided refinement of template polyhedra. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10205, 589–606.","ama":"Bogomolov S, Frehse G, Giacobbe M, Henzinger TA. Counterexample guided refinement of template polyhedra. In: Vol 10205. Springer; 2017:589-606. doi:<a href=\"https://doi.org/10.1007/978-3-662-54577-5_34\">10.1007/978-3-662-54577-5_34</a>","short":"S. Bogomolov, G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2017, pp. 589–606."},"year":"2017","_id":"631","language":[{"iso":"eng"}],"has_accepted_license":"1","date_updated":"2023-09-07T12:53:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"publist_id":"7162","project":[{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T11:47:36Z","pubrep_id":"966","status":"public","alternative_title":["LNCS"],"conference":{"end_date":"2017-04-29","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2017-04-22","location":"Uppsala, Sweden"},"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"6894"}]},"publication_status":"published","publisher":"Springer","doi":"10.1007/978-3-662-54577-5_34","file_date_updated":"2020-07-14T12:47:27Z","abstract":[{"lang":"eng","text":"Template polyhedra generalize intervals and octagons to polyhedra whose facets are orthogonal to a given set of arbitrary directions. They have been employed in the abstract interpretation of programs and, with particular success, in the reachability analysis of hybrid automata. While previously, the choice of directions has been left to the user or a heuristic, we present a method for the automatic discovery of directions that generalize and eliminate spurious counterexamples. We show that for the class of convex hybrid automata, i.e., hybrid automata with (possibly nonlinear) convex constraints on derivatives, such directions always exist and can be found using convex optimization. We embed our method inside a CEGAR loop, thus enabling the time-unbounded reachability analysis of an important and richer class of hybrid automata than was previously possible. We evaluate our method on several benchmarks, demonstrating also its superior efficiency for the special case of linear hybrid automata."}],"author":[{"full_name":"Bogomolov, Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","first_name":"Sergiy","last_name":"Bogomolov","orcid":"0000-0002-0686-0365"},{"full_name":"Frehse, Goran","first_name":"Goran","last_name":"Frehse"},{"full_name":"Giacobbe, Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","first_name":"Mirco","last_name":"Giacobbe","orcid":"0000-0001-8180-0904"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"}],"day":"31","file":[{"date_updated":"2020-07-14T12:47:27Z","access_level":"open_access","relation":"main_file","file_id":"4897","creator":"system","date_created":"2018-12-12T10:11:41Z","file_name":"IST-2017-741-v1+1_main.pdf","file_size":569863,"content_type":"application/pdf","checksum":"f395d0d20102b89aeaad8b4ef4f18f4f"},{"file_size":563276,"file_name":"IST-2018-741-v2+2_main.pdf","date_created":"2018-12-12T10:11:42Z","file_id":"4898","creator":"system","checksum":"f416ee1ae4497b23ecdf28b1f18bb8df","content_type":"application/pdf","date_updated":"2020-07-14T12:47:27Z","relation":"main_file","access_level":"open_access"}],"title":"Counterexample guided refinement of template polyhedra","volume":10205,"quality_controlled":"1","scopus_import":1,"intvolume":"     10205","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), by the European Commission under grant 643921 (UnCoVerCPS), and by the ARC project DP140104219 (Robust AI Planning for Hybrid Systems).","page":"589 - 606"},{"author":[{"first_name":"Stanley","last_name":"Bak","full_name":"Bak, Stanley"},{"full_name":"Bogomolov, Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","last_name":"Bogomolov","first_name":"Sergiy","orcid":"0000-0002-0686-0365"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Kumar","first_name":"Aviral","full_name":"Kumar, Aviral"}],"day":"01","volume":10381,"quality_controlled":"1","title":"Challenges and tool implementation of hybrid rapidly exploring random trees","intvolume":"     10381","scopus_import":1,"page":"83 - 89","date_created":"2018-12-11T11:47:37Z","status":"public","alternative_title":["LNCS"],"conference":{"location":"Heidelberg, Germany","name":"NSV: Numerical Software Verification","start_date":"2017-07-22","end_date":"2017-07-23"},"publication_status":"published","publisher":"Springer","abstract":[{"lang":"eng","text":"A Rapidly-exploring Random Tree (RRT) is an algorithm which can search a non-convex region of space by incrementally building a space-filling tree. The tree is constructed from random points drawn from system’s state space and is biased to grow towards large unexplored areas in the system. RRT can provide better coverage of a system’s possible behaviors compared with random simulations, but is more lightweight than full reachability analysis. In this paper, we explore some of the design decisions encountered while implementing a hybrid extension of the RRT algorithm, which have not been elaborated on before. In particular, we focus on handling non-determinism, which arises due to discrete transitions. We introduce the notion of important points to account for this phenomena. We showcase our ideas using heater and navigation benchmarks."}],"doi":"10.1007/978-3-319-63501-9_6","editor":[{"first_name":"Alessandro","last_name":"Abate","full_name":"Abate, Alessandro"},{"last_name":"Bodo","first_name":"Sylvie","full_name":"Bodo, Sylvie"}],"year":"2017","language":[{"iso":"eng"}],"_id":"633","date_updated":"2021-01-12T08:07:06Z","department":[{"_id":"ToHe"}],"publist_id":"7159","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}],"month":"01","oa_version":"None","publication_identifier":{"isbn":["978-331963500-2"]},"type":"conference","date_published":"2017-01-01T00:00:00Z","citation":{"apa":"Bak, S., Bogomolov, S., Henzinger, T. A., &#38; Kumar, A. (2017). Challenges and tool implementation of hybrid rapidly exploring random trees. In A. Abate &#38; S. Bodo (Eds.) (Vol. 10381, pp. 83–89). Presented at the NSV: Numerical Software Verification, Heidelberg, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-63501-9_6\">https://doi.org/10.1007/978-3-319-63501-9_6</a>","chicago":"Bak, Stanley, Sergiy Bogomolov, Thomas A Henzinger, and Aviral Kumar. “Challenges and Tool Implementation of Hybrid Rapidly Exploring Random Trees.” edited by Alessandro Abate and Sylvie Bodo, 10381:83–89. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-63501-9_6\">https://doi.org/10.1007/978-3-319-63501-9_6</a>.","ieee":"S. Bak, S. Bogomolov, T. A. Henzinger, and A. Kumar, “Challenges and tool implementation of hybrid rapidly exploring random trees,” presented at the NSV: Numerical Software Verification, Heidelberg, Germany, 2017, vol. 10381, pp. 83–89.","ista":"Bak S, Bogomolov S, Henzinger TA, Kumar A. 2017. Challenges and tool implementation of hybrid rapidly exploring random trees. NSV: Numerical Software Verification, LNCS, vol. 10381, 83–89.","mla":"Bak, Stanley, et al. <i>Challenges and Tool Implementation of Hybrid Rapidly Exploring Random Trees</i>. Edited by Alessandro Abate and Sylvie Bodo, vol. 10381, Springer, 2017, pp. 83–89, doi:<a href=\"https://doi.org/10.1007/978-3-319-63501-9_6\">10.1007/978-3-319-63501-9_6</a>.","short":"S. Bak, S. Bogomolov, T.A. Henzinger, A. Kumar, in:, A. Abate, S. Bodo (Eds.), Springer, 2017, pp. 83–89.","ama":"Bak S, Bogomolov S, Henzinger TA, Kumar A. Challenges and tool implementation of hybrid rapidly exploring random trees. In: Abate A, Bodo S, eds. Vol 10381. Springer; 2017:83-89. doi:<a href=\"https://doi.org/10.1007/978-3-319-63501-9_6\">10.1007/978-3-319-63501-9_6</a>"}},{"day":"03","author":[{"first_name":"Alexey","last_name":"Bakhirkin","full_name":"Bakhirkin, Alexey"},{"orcid":"0000-0001-5199-3143","last_name":"Ferrere","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas"},{"last_name":"Maler","first_name":"Oded","full_name":"Maler, Oded"},{"first_name":"Dogan","last_name":"Ulus","full_name":"Ulus, Dogan"}],"volume":10419,"quality_controlled":"1","title":"On the quantitative semantics of regular expressions over real-valued signals","intvolume":"     10419","scopus_import":1,"page":"189 - 206","date_created":"2018-12-11T11:47:38Z","status":"public","alternative_title":["LNCS"],"conference":{"location":"Berlin, Germany","name":"FORMATS: Formal Modelling and Analysis of Timed Systems","start_date":"2017-09-05","end_date":"2017-09-07"},"publication_status":"published","publisher":"Springer","abstract":[{"text":"Signal regular expressions can specify sequential properties of real-valued signals based on threshold conditions, regular operations, and duration constraints. In this paper we endow them with a quantitative semantics which indicates how robustly a signal matches or does not match a given expression. First, we show that this semantics is a safe approximation of a distance between the signal and the language defined by the expression. Then, we consider the robust matching problem, that is, computing the quantitative semantics of every segment of a given signal relative to an expression. We present an algorithm that solves this problem for piecewise-constant and piecewise-linear signals and show that for such signals the robustness map is a piecewise-linear function. The availability of an indicator describing how robustly a signal segment matches some regular pattern provides a general framework for quantitative monitoring of cyber-physical systems.","lang":"eng"}],"doi":"10.1007/978-3-319-65765-3_11","editor":[{"full_name":"Abate, Alessandro","last_name":"Abate","first_name":"Alessandro"},{"last_name":"Geeraerts","first_name":"Gilles","full_name":"Geeraerts, Gilles"}],"year":"2017","language":[{"iso":"eng"}],"_id":"636","date_updated":"2021-01-12T08:07:14Z","publist_id":"7152","department":[{"_id":"ToHe"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"oa":1,"month":"08","oa_version":"Submitted Version","publication_identifier":{"isbn":["978-331965764-6"]},"type":"conference","date_published":"2017-08-03T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-01552132"}],"citation":{"ieee":"A. Bakhirkin, T. Ferrere, O. Maler, and D. Ulus, “On the quantitative semantics of regular expressions over real-valued signals,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 189–206.","apa":"Bakhirkin, A., Ferrere, T., Maler, O., &#38; Ulus, D. (2017). On the quantitative semantics of regular expressions over real-valued signals. In A. Abate &#38; G. Geeraerts (Eds.) (Vol. 10419, pp. 189–206). Presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-65765-3_11\">https://doi.org/10.1007/978-3-319-65765-3_11</a>","chicago":"Bakhirkin, Alexey, Thomas Ferrere, Oded Maler, and Dogan Ulus. “On the Quantitative Semantics of Regular Expressions over Real-Valued Signals.” edited by Alessandro Abate and Gilles Geeraerts, 10419:189–206. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-65765-3_11\">https://doi.org/10.1007/978-3-319-65765-3_11</a>.","ama":"Bakhirkin A, Ferrere T, Maler O, Ulus D. On the quantitative semantics of regular expressions over real-valued signals. In: Abate A, Geeraerts G, eds. Vol 10419. Springer; 2017:189-206. doi:<a href=\"https://doi.org/10.1007/978-3-319-65765-3_11\">10.1007/978-3-319-65765-3_11</a>","short":"A. Bakhirkin, T. Ferrere, O. Maler, D. Ulus, in:, A. Abate, G. Geeraerts (Eds.), Springer, 2017, pp. 189–206.","ista":"Bakhirkin A, Ferrere T, Maler O, Ulus D. 2017. On the quantitative semantics of regular expressions over real-valued signals. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS, vol. 10419, 189–206.","mla":"Bakhirkin, Alexey, et al. <i>On the Quantitative Semantics of Regular Expressions over Real-Valued Signals</i>. Edited by Alessandro Abate and Gilles Geeraerts, vol. 10419, Springer, 2017, pp. 189–206, doi:<a href=\"https://doi.org/10.1007/978-3-319-65765-3_11\">10.1007/978-3-319-65765-3_11</a>."}},{"abstract":[{"lang":"eng","text":"This book constitutes the refereed proceedings of the 9th InternationalWorkshop on Numerical Software Verification, NSV 2016, held in Toronto, ON, Canada in July 2011 - colocated with CAV 2016, the 28th International Conference on Computer Aided Verification.\r\nThe NSV workshop is dedicated to the development of logical and mathematical techniques for the reasoning about programmability and reliability."}],"doi":"10.1007/978-3-319-54292-8","citation":{"mla":"Bogomolov, Sergiy, et al., editors. <i>Numerical Software Verification</i>. Vol. 10152, Springer, 2017, doi:<a href=\"https://doi.org/10.1007/978-3-319-54292-8\">10.1007/978-3-319-54292-8</a>.","ista":"Bogomolov S, Martel M, Prabhakar P eds. 2017. Numerical Software Verification, Springer,p.","ama":"Bogomolov S, Martel M, Prabhakar P, eds. <i>Numerical Software Verification</i>. Vol 10152. Springer; 2017. doi:<a href=\"https://doi.org/10.1007/978-3-319-54292-8\">10.1007/978-3-319-54292-8</a>","short":"S. Bogomolov, M. Martel, P. Prabhakar, eds., Numerical Software Verification, Springer, 2017.","chicago":"Bogomolov, Sergiy, Matthieu Martel, and Pavithra Prabhakar, eds. <i>Numerical Software Verification</i>. Vol. 10152. LNCS. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-54292-8\">https://doi.org/10.1007/978-3-319-54292-8</a>.","apa":"Bogomolov, S., Martel, M., &#38; Prabhakar, P. (Eds.). (2017). <i>Numerical Software Verification</i> (Vol. 10152). Presented at the NSV: Numerical Software Verification, Toronto, ON, Canada: Springer. <a href=\"https://doi.org/10.1007/978-3-319-54292-8\">https://doi.org/10.1007/978-3-319-54292-8</a>","ieee":"S. Bogomolov, M. Martel, and P. Prabhakar, Eds., <i>Numerical Software Verification</i>, vol. 10152. Springer, 2017."},"article_processing_charge":"No","publication_status":"published","type":"conference_editor","date_published":"2017-01-01T00:00:00Z","publisher":"Springer","oa_version":"None","series_title":"LNCS","publication_identifier":{"eisbn":["978-3-319-54292-8"],"issn":["0302-9743"]},"conference":{"location":"Toronto, ON, Canada","end_date":"2016-07-18","name":"NSV: Numerical Software Verification","start_date":"2016-07-17"},"date_created":"2018-12-11T11:47:38Z","month":"01","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7150","department":[{"_id":"ToHe"}],"intvolume":"     10152","date_updated":"2022-05-24T07:09:52Z","year":"2017","language":[{"iso":"eng"}],"_id":"638","editor":[{"orcid":"0000-0002-0686-0365","first_name":"Sergiy","last_name":"Bogomolov","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","full_name":"Bogomolov, Sergiy"},{"first_name":"Matthieu","last_name":"Martel","full_name":"Martel, Matthieu"},{"last_name":"Prabhakar","first_name":"Pavithra","full_name":"Prabhakar, Pavithra"}],"day":"01","quality_controlled":"1","volume":10152,"title":"Numerical Software Verification"},{"date_published":"2017-08-04T00:00:00Z","publisher":"IST Austria","type":"technical_report","related_material":{"record":[{"id":"133","status":"public","relation":"later_version"}]},"publication_status":"published","file_date_updated":"2020-07-14T12:47:30Z","abstract":[{"text":"Synchronous programs are easy to specify because the side effects of an operation are finished by the time the invocation of the operation returns to the caller. Asynchronous programs, on the other hand, are difficult to specify because there are side effects due to pending computation scheduled as a result of the invocation of an operation. They are also difficult to verify because of the large number of possible interleavings of concurrent asynchronous computation threads. We show that specifications and correctness proofs for asynchronous programs can be structured by introducing the fiction, for proof purposes, that intermediate, non-quiescent states of asynchronous operations can be ignored. Then, the task of specification becomes relatively simple and the task of verification can be naturally decomposed into smaller sub-tasks. The sub-tasks iteratively summarize, guided by the structure of an asynchronous program, the atomic effect of non-atomic operations and the synchronous effect of asynchronous operations. This structuring of specifications and proofs corresponds to the introduction of multiple layers of stepwise refinement for asynchronous programs. We present the first proof rule, called synchronization, to reduce asynchronous invocations on a lower layer to synchronous invocations on a higher layer. We implemented our proof method in CIVL and evaluated it on a collection of benchmark programs.","lang":"eng"}],"doi":"10.15479/AT:IST-2018-853-v2-2","citation":{"short":"T.A. Henzinger, B. Kragl, S. Qadeer, Synchronizing the Asynchronous, IST Austria, 2017.","ama":"Henzinger TA, Kragl B, Qadeer S. <i>Synchronizing the Asynchronous</i>. IST Austria; 2017. doi:<a href=\"https://doi.org/10.15479/AT:IST-2018-853-v2-2\">10.15479/AT:IST-2018-853-v2-2</a>","mla":"Henzinger, Thomas A., et al. <i>Synchronizing the Asynchronous</i>. IST Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:IST-2018-853-v2-2\">10.15479/AT:IST-2018-853-v2-2</a>.","ista":"Henzinger TA, Kragl B, Qadeer S. 2017. Synchronizing the asynchronous, IST Austria, 28p.","ieee":"T. A. Henzinger, B. Kragl, and S. Qadeer, <i>Synchronizing the asynchronous</i>. IST Austria, 2017.","chicago":"Henzinger, Thomas A, Bernhard Kragl, and Shaz Qadeer. <i>Synchronizing the Asynchronous</i>. IST Austria, 2017. <a href=\"https://doi.org/10.15479/AT:IST-2018-853-v2-2\">https://doi.org/10.15479/AT:IST-2018-853-v2-2</a>.","apa":"Henzinger, T. A., Kragl, B., &#38; Qadeer, S. (2017). <i>Synchronizing the asynchronous</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2018-853-v2-2\">https://doi.org/10.15479/AT:IST-2018-853-v2-2</a>"},"status":"public","date_created":"2019-05-13T08:15:55Z","month":"08","oa":1,"publication_identifier":{"issn":["2664-1690"]},"alternative_title":["IST Austria Technical Report"],"oa_version":"Published Version","ddc":["000"],"page":"28","date_updated":"2023-02-21T16:59:21Z","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"title":"Synchronizing the asynchronous","file":[{"access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:47:30Z","content_type":"application/pdf","checksum":"b48d42725182d7ca10107a118815f4cf","creator":"dernst","file_id":"6431","file_size":971347,"file_name":"main(1).pdf","date_created":"2019-05-13T08:14:44Z"}],"author":[{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Kragl, Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","last_name":"Kragl","orcid":"0000-0001-7745-9117"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"}],"day":"04","language":[{"iso":"eng"}],"_id":"6426","year":"2017"},{"ddc":["005"],"oa_version":"Submitted Version","publication_identifier":{"isbn":["978-331965764-6"]},"oa":1,"month":"09","citation":{"short":"S. Bogomolov, M. Giacobbe, T.A. Henzinger, H. Kong, in:, Springer, 2017, pp. 116–132.","ama":"Bogomolov S, Giacobbe M, Henzinger TA, Kong H. Conic abstractions for hybrid systems. In: Vol 10419. Springer; 2017:116-132. doi:<a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">10.1007/978-3-319-65765-3_7</a>","ista":"Bogomolov S, Giacobbe M, Henzinger TA, Kong H. 2017. Conic abstractions for hybrid systems. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS, vol. 10419, 116–132.","mla":"Bogomolov, Sergiy, et al. <i>Conic Abstractions for Hybrid Systems</i>. Vol. 10419, Springer, 2017, pp. 116–32, doi:<a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">10.1007/978-3-319-65765-3_7</a>.","ieee":"S. Bogomolov, M. Giacobbe, T. A. Henzinger, and H. Kong, “Conic abstractions for hybrid systems,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 116–132.","apa":"Bogomolov, S., Giacobbe, M., Henzinger, T. A., &#38; Kong, H. (2017). Conic abstractions for hybrid systems (Vol. 10419, pp. 116–132). Presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">https://doi.org/10.1007/978-3-319-65765-3_7</a>","chicago":"Bogomolov, Sergiy, Mirco Giacobbe, Thomas A Henzinger, and Hui Kong. “Conic Abstractions for Hybrid Systems,” 10419:116–32. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">https://doi.org/10.1007/978-3-319-65765-3_7</a>."},"type":"conference","date_published":"2017-09-01T00:00:00Z","year":"2017","language":[{"iso":"eng"}],"_id":"647","department":[{"_id":"ToHe"}],"publist_id":"7129","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"}],"has_accepted_license":"1","date_updated":"2023-09-07T12:53:00Z","alternative_title":["LNCS"],"conference":{"end_date":"2017-09-07","start_date":"2017-09-05","name":"FORMATS: Formal Modelling and Analysis of Timed Systems","location":"Berlin, Germany"},"date_created":"2018-12-11T11:47:41Z","status":"public","pubrep_id":"831","abstract":[{"lang":"eng","text":"Despite researchers’ efforts in the last couple of decades, reachability analysis is still a challenging problem even for linear hybrid systems. Among the existing approaches, the most practical ones are mainly based on bounded-time reachable set over-approximations. For the purpose of unbounded-time analysis, one important strategy is to abstract the original system and find an invariant for the abstraction. In this paper, we propose an approach to constructing a new kind of abstraction called conic abstraction for affine hybrid systems, and to computing reachable sets based on this abstraction. The essential feature of a conic abstraction is that it partitions the state space of a system into a set of convex polyhedral cones which is derived from a uniform conic partition of the derivative space. Such a set of polyhedral cones is able to cut all trajectories of the system into almost straight segments so that every segment of a reach pipe in a polyhedral cone tends to be straight as well, and hence can be over-approximated tightly by polyhedra using similar techniques as HyTech or PHAVer. In particular, for diagonalizable affine systems, our approach can guarantee to find an invariant for unbounded reachable sets, which is beyond the capability of bounded-time reachability analysis tools. We implemented the approach in a tool and experiments on benchmarks show that our approach is more powerful than SpaceEx and PHAVer in dealing with diagonalizable systems."}],"file_date_updated":"2020-07-14T12:47:31Z","doi":"10.1007/978-3-319-65765-3_7","publication_status":"published","related_material":{"record":[{"id":"6894","status":"public","relation":"dissertation_contains"}]},"publisher":"Springer","author":[{"last_name":"Bogomolov","first_name":"Sergiy","orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-8180-0904","last_name":"Giacobbe","first_name":"Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","full_name":"Giacobbe, Mirco"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"full_name":"Kong, Hui","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","first_name":"Hui","last_name":"Kong","orcid":"0000-0002-3066-6941"}],"day":"01","volume":"10419 ","quality_controlled":"1","file":[{"relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:47:31Z","checksum":"faf546914ba29bcf9974ee36b6b16750","content_type":"application/pdf","file_size":3806864,"date_created":"2018-12-12T10:12:38Z","file_name":"IST-2017-831-v1+1_main.pdf","file_id":"4956","creator":"system"}],"title":"Conic abstractions for hybrid systems","scopus_import":1,"page":"116 - 132"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7067","department":[{"_id":"ToHe"}],"has_accepted_license":"1","date_updated":"2021-01-12T08:08:17Z","year":"2017","_id":"663","language":[{"iso":"eng"}],"citation":{"ama":"Kong H, Bogomolov S, Schilling C, Jiang Y, Henzinger TA. Safety verification of nonlinear hybrid systems based on invariant clusters. In: <i>Proceedings of the 20th International Conference on Hybrid Systems</i>. ACM; 2017:163-172. doi:<a href=\"https://doi.org/10.1145/3049797.3049814\">10.1145/3049797.3049814</a>","short":"H. Kong, S. Bogomolov, C. Schilling, Y. Jiang, T.A. Henzinger, in:, Proceedings of the 20th International Conference on Hybrid Systems, ACM, 2017, pp. 163–172.","ista":"Kong H, Bogomolov S, Schilling C, Jiang Y, Henzinger TA. 2017. Safety verification of nonlinear hybrid systems based on invariant clusters. Proceedings of the 20th International Conference on Hybrid Systems. HSCC: Hybrid Systems Computation and Control , 163–172.","mla":"Kong, Hui, et al. “Safety Verification of Nonlinear Hybrid Systems Based on Invariant Clusters.” <i>Proceedings of the 20th International Conference on Hybrid Systems</i>, ACM, 2017, pp. 163–72, doi:<a href=\"https://doi.org/10.1145/3049797.3049814\">10.1145/3049797.3049814</a>.","ieee":"H. Kong, S. Bogomolov, C. Schilling, Y. Jiang, and T. A. Henzinger, “Safety verification of nonlinear hybrid systems based on invariant clusters,” in <i>Proceedings of the 20th International Conference on Hybrid Systems</i>, Pittsburgh, PA, United States, 2017, pp. 163–172.","apa":"Kong, H., Bogomolov, S., Schilling, C., Jiang, Y., &#38; Henzinger, T. A. (2017). Safety verification of nonlinear hybrid systems based on invariant clusters. In <i>Proceedings of the 20th International Conference on Hybrid Systems</i> (pp. 163–172). Pittsburgh, PA, United States: ACM. <a href=\"https://doi.org/10.1145/3049797.3049814\">https://doi.org/10.1145/3049797.3049814</a>","chicago":"Kong, Hui, Sergiy Bogomolov, Christian Schilling, Yu Jiang, and Thomas A Henzinger. “Safety Verification of Nonlinear Hybrid Systems Based on Invariant Clusters.” In <i>Proceedings of the 20th International Conference on Hybrid Systems</i>, 163–72. ACM, 2017. <a href=\"https://doi.org/10.1145/3049797.3049814\">https://doi.org/10.1145/3049797.3049814</a>."},"type":"conference","date_published":"2017-04-01T00:00:00Z","oa_version":"Submitted Version","ddc":["000"],"publication_identifier":{"isbn":["978-145034590-3"]},"oa":1,"month":"04","scopus_import":1,"page":"163 - 172","day":"01","author":[{"full_name":"Kong, Hui","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","last_name":"Kong","first_name":"Hui","orcid":"0000-0002-3066-6941"},{"full_name":"Bogomolov, Sergiy","last_name":"Bogomolov","first_name":"Sergiy","orcid":"0000-0002-0686-0365"},{"first_name":"Christian","last_name":"Schilling","full_name":"Schilling, Christian"},{"first_name":"Yu","last_name":"Jiang","full_name":"Jiang, Yu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"}],"file":[{"creator":"system","file_id":"4873","file_size":1650530,"file_name":"IST-2017-817-v1+1_p163-kong.pdf","date_created":"2018-12-12T10:11:20Z","content_type":"application/pdf","checksum":"b7667434cbf5b5f0ade3bea1dbe5bf63","date_updated":"2020-07-14T12:47:34Z","relation":"main_file","access_level":"open_access"}],"title":"Safety verification of nonlinear hybrid systems based on invariant clusters","quality_controlled":"1","doi":"10.1145/3049797.3049814","file_date_updated":"2020-07-14T12:47:34Z","abstract":[{"text":"In this paper, we propose an approach to automatically compute invariant clusters for nonlinear semialgebraic hybrid systems. An invariant cluster for an ordinary differential equation (ODE) is a multivariate polynomial invariant g(u→, x→) = 0, parametric in u→, which can yield an infinite number of concrete invariants by assigning different values to u→ so that every trajectory of the system can be overapproximated precisely by the intersection of a group of concrete invariants. For semialgebraic systems, which involve ODEs with multivariate polynomial right-hand sides, given a template multivariate polynomial g(u→, x→), an invariant cluster can be obtained by first computing the remainder of the Lie derivative of g(u→, x→) divided by g(u→, x→) and then solving the system of polynomial equations obtained from the coefficients of the remainder. Based on invariant clusters and sum-of-squares (SOS) programming, we present a new method for the safety verification of hybrid systems. Experiments on nonlinear benchmark systems from biology and control theory show that our approach is efficient. ","lang":"eng"}],"publication":"Proceedings of the 20th International Conference on Hybrid Systems","publication_status":"published","publisher":"ACM","conference":{"location":"Pittsburgh, PA, United States","start_date":"2017-04-18","name":"HSCC: Hybrid Systems Computation and Control ","end_date":"2017-04-20"},"date_created":"2018-12-11T11:47:47Z","pubrep_id":"817","status":"public"},{"month":"05","oa":1,"ddc":["004"],"oa_version":"Submitted Version","publication_identifier":{"issn":["10450823"]},"type":"conference","date_published":"2017-05-30T00:00:00Z","citation":{"chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement Methodology for Reasoning about Network Games,” 70–76. AAAI Press, 2017. <a href=\"https://doi.org/10.24963/ijcai.2017/11\">https://doi.org/10.24963/ijcai.2017/11</a>.","apa":"Avni, G., Guha, S., &#38; Kupferman, O. (2017). An abstraction-refinement methodology for reasoning about network games (pp. 70–76). Presented at the IJCAI: International Joint Conference on Artificial Intelligence , Melbourne, Australia: AAAI Press. <a href=\"https://doi.org/10.24963/ijcai.2017/11\">https://doi.org/10.24963/ijcai.2017/11</a>","ieee":"G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” presented at the IJCAI: International Joint Conference on Artificial Intelligence , Melbourne, Australia, 2017, pp. 70–76.","ista":"Avni G, Guha S, Kupferman O. 2017. An abstraction-refinement methodology for reasoning about network games. IJCAI: International Joint Conference on Artificial Intelligence , 70–76.","mla":"Avni, Guy, et al. <i>An Abstraction-Refinement Methodology for Reasoning about Network Games</i>. AAAI Press, 2017, pp. 70–76, doi:<a href=\"https://doi.org/10.24963/ijcai.2017/11\">10.24963/ijcai.2017/11</a>.","short":"G. Avni, S. Guha, O. Kupferman, in:, AAAI Press, 2017, pp. 70–76.","ama":"Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning about network games. In: AAAI Press; 2017:70-76. doi:<a href=\"https://doi.org/10.24963/ijcai.2017/11\">10.24963/ijcai.2017/11</a>"},"article_processing_charge":"No","year":"2017","language":[{"iso":"eng"}],"_id":"1003","has_accepted_license":"1","date_updated":"2023-09-22T09:49:00Z","publist_id":"6395","department":[{"_id":"ToHe"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T11:49:38Z","status":"public","pubrep_id":"818","external_id":{"isi":["000764137500011"]},"conference":{"end_date":"2017-08-25","start_date":"2017-08-19","name":"IJCAI: International Joint Conference on Artificial Intelligence ","location":"Melbourne, Australia"},"related_material":{"record":[{"relation":"later_version","id":"6006","status":"public"}]},"publication_status":"published","publisher":"AAAI Press","abstract":[{"text":"Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally optimal solution. The networks modeled by NGs may be huge. In formal verification, abstraction has proven to be an extremely effective technique for reasoning about systems with big and even infinite state spaces. We describe an abstraction-refinement methodology for reasoning about NGs. Our methodology is based on an abstraction function that maps the state space of an NG to a much smaller state space. We search for a global optimum and a Nash equilibrium by reasoning on an under- and an overapproximation defined on top of this smaller state space. When the approximations are too coarse to find such profiles, we refine the abstraction function. Our experimental results demonstrate the efficiency of the methodology.","lang":"eng"}],"file_date_updated":"2018-12-12T10:16:58Z","doi":"10.24963/ijcai.2017/11","author":[{"first_name":"Guy","last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Guha, Shibashis","first_name":"Shibashis","last_name":"Guha"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"day":"30","quality_controlled":"1","file":[{"date_updated":"2018-12-12T10:16:58Z","relation":"main_file","access_level":"open_access","creator":"system","file_id":"5249","date_created":"2018-12-12T10:16:58Z","file_name":"IST-2017-818-v1+1_allIJCAI_CR.pdf","file_size":365172,"content_type":"application/pdf"}],"title":"An abstraction-refinement methodology for reasoning about network games","isi":1,"scopus_import":"1","page":"70 - 76"},{"ec_funded":1,"isi":1,"volume":10201,"quality_controlled":"1","title":"Faster algorithms for weighted recursive state machines","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kragl, Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl","first_name":"Bernhard","orcid":"0000-0001-7745-9117"},{"full_name":"Mishra, Samarth","first_name":"Samarth","last_name":"Mishra"},{"full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722"}],"day":"19","page":"287 - 313","intvolume":"     10201","scopus_import":"1","conference":{"location":"Uppsala, Sweden","start_date":"2017-04-22","name":"ESOP: European Symposium on Programming","end_date":"2017-04-29"},"external_id":{"isi":["000681702400011"]},"alternative_title":["LNCS"],"status":"public","date_created":"2018-12-11T11:49:41Z","abstract":[{"text":"Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis. Yet RSMs are more convenient as they (a) explicitly model function calls and returns, and (b) specify many natural parameters for algorithmic analysis, e.g., the number of entries and exits. We consider a general framework where RSM transitions are labeled from a semiring and path properties are algebraic with semiring operations, which can model, e.g., interprocedural reachability and dataflow analysis problems. Our main contributions are new algorithms for several fundamental problems. As compared to a direct translation of RSMs to PDSs and the best-known existing bounds of PDSs, our analysis algorithm improves the complexity for finite-height semirings (that subsumes reachability and standard dataflow properties). We further consider the problem of extracting distance values from the representation structures computed by our algorithm, and give efficient algorithms that distinguish the complexity of a one-time preprocessing from the complexity of each individual query. Another advantage of our algorithm is that our improvements carry over to the concurrent setting, where we improve the bestknown complexity for the context-bounded analysis of concurrent RSMs. Finally, we provide a prototype implementation that gives a significant speed-up on several benchmarks from the SLAM/SDV project.","lang":"eng"}],"doi":"10.1007/978-3-662-54434-1_11","publisher":"Springer","publication_status":"published","language":[{"iso":"eng"}],"_id":"1011","year":"2017","editor":[{"first_name":"Hongseok","last_name":"Yang","full_name":"Yang, Hongseok"}],"project":[{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"6384","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2023-09-22T09:44:50Z","publication_identifier":{"issn":["03029743"]},"oa_version":"Submitted Version","month":"03","oa":1,"article_processing_charge":"No","main_file_link":[{"url":"https://arxiv.org/abs/1701.04914","open_access":"1"}],"citation":{"ieee":"K. Chatterjee, B. Kragl, S. Mishra, and A. Pavlogiannis, “Faster algorithms for weighted recursive state machines,” presented at the ESOP: European Symposium on Programming, Uppsala, Sweden, 2017, vol. 10201, pp. 287–313.","chicago":"Chatterjee, Krishnendu, Bernhard Kragl, Samarth Mishra, and Andreas Pavlogiannis. “Faster Algorithms for Weighted Recursive State Machines.” edited by Hongseok Yang, 10201:287–313. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">https://doi.org/10.1007/978-3-662-54434-1_11</a>.","apa":"Chatterjee, K., Kragl, B., Mishra, S., &#38; Pavlogiannis, A. (2017). Faster algorithms for weighted recursive state machines. In H. Yang (Ed.) (Vol. 10201, pp. 287–313). Presented at the ESOP: European Symposium on Programming, Uppsala, Sweden: Springer. <a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">https://doi.org/10.1007/978-3-662-54434-1_11</a>","short":"K. Chatterjee, B. Kragl, S. Mishra, A. Pavlogiannis, in:, H. Yang (Ed.), Springer, 2017, pp. 287–313.","ama":"Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. Faster algorithms for weighted recursive state machines. In: Yang H, ed. Vol 10201. Springer; 2017:287-313. doi:<a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">10.1007/978-3-662-54434-1_11</a>","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Weighted Recursive State Machines</i>. Edited by Hongseok Yang, vol. 10201, Springer, 2017, pp. 287–313, doi:<a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">10.1007/978-3-662-54434-1_11</a>.","ista":"Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. 2017. Faster algorithms for weighted recursive state machines. ESOP: European Symposium on Programming, LNCS, vol. 10201, 287–313."},"date_published":"2017-03-19T00:00:00Z","type":"conference"},{"year":"2017","_id":"10418","language":[{"iso":"eng"}],"date_updated":"2021-12-07T08:04:14Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"oa":1,"month":"12","oa_version":"Published Version","issue":"POPL","publication_identifier":{"eissn":["2475-1421"]},"type":"journal_article","date_published":"2017-12-07T00:00:00Z","article_type":"original","citation":{"mla":"Mciver, Annabelle, et al. “A New Proof Rule for Almost-Sure Termination.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL, 33, Association for Computing Machinery, 2017, doi:<a href=\"https://doi.org/10.1145/3158121\">10.1145/3158121</a>.","ista":"Mciver A, Morgan C, Kaminski BL, Katoen JP. 2017. A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. 2(POPL), 33.","ama":"Mciver A, Morgan C, Kaminski BL, Katoen JP. A new proof rule for almost-sure termination. <i>Proceedings of the ACM on Programming Languages</i>. 2017;2(POPL). doi:<a href=\"https://doi.org/10.1145/3158121\">10.1145/3158121</a>","short":"A. Mciver, C. Morgan, B.L. Kaminski, J.P. Katoen, Proceedings of the ACM on Programming Languages 2 (2017).","apa":"Mciver, A., Morgan, C., Kaminski, B. L., &#38; Katoen, J. P. (2017). A new proof rule for almost-sure termination. <i>Proceedings of the ACM on Programming Languages</i>. Los Angeles, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3158121\">https://doi.org/10.1145/3158121</a>","chicago":"Mciver, Annabelle, Carroll Morgan, Benjamin Lucien Kaminski, and Joost P Katoen. “A New Proof Rule for Almost-Sure Termination.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2017. <a href=\"https://doi.org/10.1145/3158121\">https://doi.org/10.1145/3158121</a>.","ieee":"A. Mciver, C. Morgan, B. L. Kaminski, and J. P. Katoen, “A new proof rule for almost-sure termination,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL. Association for Computing Machinery, 2017."},"main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/3158121","open_access":"1"}],"article_processing_charge":"No","day":"07","author":[{"full_name":"Mciver, Annabelle","first_name":"Annabelle","last_name":"Mciver"},{"full_name":"Morgan, Carroll","first_name":"Carroll","last_name":"Morgan"},{"full_name":"Kaminski, Benjamin Lucien","first_name":"Benjamin Lucien","last_name":"Kaminski"},{"full_name":"Katoen, Joost P","id":"4524F760-F248-11E8-B48F-1D18A9856A87","last_name":"Katoen","first_name":"Joost P"}],"title":"A new proof rule for almost-sure termination","quality_controlled":"1","volume":2,"intvolume":"         2","scopus_import":"1","acknowledgement":"McIver and Morgan are grateful to David Basin and the Information Security Group at ETH Zürich for hosting a six-month stay in Switzerland, during part of which this work began. And thanks particularly to Andreas Lochbihler, who shared with us the probabilistic termination problem that led to it. They acknowledge the support of ARC grant DP140101119. Part of this work was carried out during the Workshop on Probabilistic Programming Semantics\r\nat McGill University’s Bellairs Research Institute on Barbados organised by Alexandra Silva and\r\nPrakash Panangaden. Kaminski and Katoen are grateful to Sebastian Junges for spotting a flaw in §5.4.","article_number":"33","date_created":"2021-12-05T23:01:49Z","status":"public","arxiv":1,"external_id":{"arxiv":["1711.03588"]},"conference":{"end_date":"2018-01-13","name":"POPL: Programming Languages","start_date":"2018-01-07","location":"Los Angeles, CA, United States"},"publication":"Proceedings of the ACM on Programming Languages","publication_status":"published","publisher":"Association for Computing Machinery","doi":"10.1145/3158121","abstract":[{"text":"We present a new proof rule for proving almost-sure termination of probabilistic programs, including those that contain demonic non-determinism. An important question for a probabilistic program is whether the probability mass of all its diverging runs is zero, that is that it terminates \"almost surely\". Proving that can be hard, and this paper presents a new method for doing so. It applies directly to the program's source code, even if the program contains demonic choice. Like others, we use variant functions (a.k.a. \"super-martingales\") that are real-valued and decrease randomly on each loop iteration; but our key innovation is that the amount as well as the probability of the decrease are parametric. We prove the soundness of the new rule, indicate where its applicability goes beyond existing rules, and explain its connection to classical results on denumerable (non-demonic) Markov chains.","lang":"eng"}]},{"external_id":{"isi":["000402025600002"]},"status":"public","date_created":"2018-12-11T11:49:58Z","doi":"10.1016/j.ic.2016.10.006","abstract":[{"text":"Simulation is an attractive alternative to language inclusion for automata as it is an under-approximation of language inclusion, but usually has much lower complexity. 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. 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 in general, whereas the (quantitative) simulation reduces to quantitative 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, yet they still admit pseudo-polynomial time algorithms.","lang":"eng"}],"publisher":"Elsevier","publication_status":"published","related_material":{"record":[{"relation":"earlier_version","id":"5428","status":"public"}]},"publication":"Information and Computation","ec_funded":1,"isi":1,"title":"Quantitative fair simulation games","quality_controlled":"1","volume":254,"day":"01","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Otop"},{"last_name":"Velner","first_name":"Yaron","full_name":"Velner, Yaron"}],"page":"143 - 166","intvolume":"       254","scopus_import":"1","oa_version":"None","issue":"2","month":"06","article_processing_charge":"No","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner. “Quantitative Fair Simulation Games.” <i>Information and Computation</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.ic.2016.10.006\">https://doi.org/10.1016/j.ic.2016.10.006</a>.","apa":"Chatterjee, K., Henzinger, T. A., Otop, J., &#38; Velner, Y. (2017). Quantitative fair simulation games. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2016.10.006\">https://doi.org/10.1016/j.ic.2016.10.006</a>","ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, “Quantitative fair simulation games,” <i>Information and Computation</i>, vol. 254, no. 2. Elsevier, pp. 143–166, 2017.","mla":"Chatterjee, Krishnendu, et al. “Quantitative Fair Simulation Games.” <i>Information and Computation</i>, vol. 254, no. 2, Elsevier, 2017, pp. 143–66, doi:<a href=\"https://doi.org/10.1016/j.ic.2016.10.006\">10.1016/j.ic.2016.10.006</a>.","ista":"Chatterjee K, Henzinger TA, Otop J, Velner Y. 2017. Quantitative fair simulation games. Information and Computation. 254(2), 143–166.","ama":"Chatterjee K, Henzinger TA, Otop J, Velner Y. Quantitative fair simulation games. <i>Information and Computation</i>. 2017;254(2):143-166. doi:<a href=\"https://doi.org/10.1016/j.ic.2016.10.006\">10.1016/j.ic.2016.10.006</a>","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Information and Computation 254 (2017) 143–166."},"date_published":"2017-06-01T00:00:00Z","type":"journal_article","_id":"1066","language":[{"iso":"eng"}],"year":"2017","project":[{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"publist_id":"6322","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-20T12:07:48Z"},{"date_updated":"2021-01-12T08:22:05Z","page":"376 - 379 ","scopus_import":1,"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"publist_id":"6478","title":"JFIX: Semantics-based repair of Java programs via symbolic  PathFinder","quality_controlled":"1","day":"10","author":[{"full_name":"Le, Xuan","first_name":"Xuan","last_name":"Le"},{"last_name":"Chu","first_name":"Duc Hiep","full_name":"Chu, Duc Hiep","id":"3598E630-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lo, David","first_name":"David","last_name":"Lo"},{"last_name":"Le Goues","first_name":"Claire","full_name":"Le Goues, Claire"},{"full_name":"Visser, Willem","last_name":"Visser","first_name":"Willem"}],"_id":"941","language":[{"iso":"eng"}],"year":"2017","publisher":"ACM","date_published":"2017-07-10T00:00:00Z","publication_status":"published","publication":"Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis","type":"conference","citation":{"ieee":"X. Le, D. H. Chu, D. Lo, C. Le Goues, and W. Visser, “JFIX: Semantics-based repair of Java programs via symbolic  PathFinder,” in <i>Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis</i>, Santa Barbara, CA, United States, 2017, pp. 376–379.","chicago":"Le, Xuan, Duc Hiep Chu, David Lo, Claire Le Goues, and Willem Visser. “JFIX: Semantics-Based Repair of Java Programs via Symbolic  PathFinder.” In <i>Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis</i>, 376–79. ACM, 2017. <a href=\"https://doi.org/10.1145/3092703.3098225\">https://doi.org/10.1145/3092703.3098225</a>.","apa":"Le, X., Chu, D. H., Lo, D., Le Goues, C., &#38; Visser, W. (2017). JFIX: Semantics-based repair of Java programs via symbolic  PathFinder. In <i>Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis</i> (pp. 376–379). Santa Barbara, CA, United States: ACM. <a href=\"https://doi.org/10.1145/3092703.3098225\">https://doi.org/10.1145/3092703.3098225</a>","ama":"Le X, Chu DH, Lo D, Le Goues C, Visser W. JFIX: Semantics-based repair of Java programs via symbolic  PathFinder. In: <i>Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis</i>. ACM; 2017:376-379. doi:<a href=\"https://doi.org/10.1145/3092703.3098225\">10.1145/3092703.3098225</a>","short":"X. Le, D.H. Chu, D. Lo, C. Le Goues, W. Visser, in:, Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, ACM, 2017, pp. 376–379.","mla":"Le, Xuan, et al. “JFIX: Semantics-Based Repair of Java Programs via Symbolic  PathFinder.” <i>Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis</i>, ACM, 2017, pp. 376–79, doi:<a href=\"https://doi.org/10.1145/3092703.3098225\">10.1145/3092703.3098225</a>.","ista":"Le X, Chu DH, Lo D, Le Goues C, Visser W. 2017. JFIX: Semantics-based repair of Java programs via symbolic  PathFinder. Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis. ISSTA: International Symposium on Software Testing and Analysis, 376–379."},"doi":"10.1145/3092703.3098225","abstract":[{"lang":"eng","text":"Recently there has been a proliferation of automated program repair (APR) techniques, targeting various programming languages. Such techniques can be generally classified into two families: syntactic- and semantics-based. Semantics-based APR, on which we focus, typically uses symbolic execution to infer semantic constraints and then program synthesis to construct repairs conforming to them. While syntactic-based APR techniques have been shown successful on bugs in real-world programs written in both C and Java, semantics-based APR techniques mostly target C programs. This leaves empirical comparisons of the APR families not fully explored, and developers without a Java-based semantics APR technique. We present JFix, a semantics-based APR framework that targets Java, and an associated Eclipse plugin. JFix is implemented atop Symbolic PathFinder, a well-known symbolic execution engine for Java programs. It extends one particular APR technique (Angelix), and is designed to be sufficiently generic to support a variety of such techniques. We demonstrate that semantics-based APR can indeed efficiently and effectively repair a variety of classes of bugs in large real-world Java programs. This supports our claim that the framework can both support developers seeking semantics-based repair of bugs in Java programs, as well as enable larger scale empirical studies comparing syntactic- and semantics-based APR targeting Java. The demonstration of our tool is available via the project website at: https://xuanbachle.github.io/semanticsrepair/ "}],"status":"public","month":"07","date_created":"2018-12-11T11:49:19Z","conference":{"location":"Santa Barbara, CA, United States","end_date":"2017-07-14","name":"ISSTA: International Symposium on Software Testing and Analysis","start_date":"2017-07-10"},"oa_version":"None"}]