Tools and algorithms for the construction and analysis of systems : 26th International Conference, TACAS 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, ...最新文献
Pub Date : 2021-02-26DOI: 10.1007/978-3-030-72013-1_5
Aviad Cohen, Alexander Nadel, Vadim Ryvchin
{"title":"Local Search with a SAT Oracle for Combinatorial Optimization","authors":"Aviad Cohen, Alexander Nadel, Vadim Ryvchin","doi":"10.1007/978-3-030-72013-1_5","DOIUrl":"https://doi.org/10.1007/978-3-030-72013-1_5","url":null,"abstract":"","PeriodicalId":93056,"journal":{"name":"Tools and algorithms for the construction and analysis of systems : 26th International Conference, TACAS 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, ...","volume":"98 1","pages":"87 - 104"},"PeriodicalIF":0.0,"publicationDate":"2021-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78332138","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-29DOI: 10.1007/978-3-030-72016-2_11
Roman Andriushchenko, Milan Ceska, Sebastian Junges, J. Katoen
{"title":"Inductive Synthesis for Probabilistic Programs Reaches New Horizons","authors":"Roman Andriushchenko, Milan Ceska, Sebastian Junges, J. Katoen","doi":"10.1007/978-3-030-72016-2_11","DOIUrl":"https://doi.org/10.1007/978-3-030-72016-2_11","url":null,"abstract":"","PeriodicalId":93056,"journal":{"name":"Tools and algorithms for the construction and analysis of systems : 26th International Conference, TACAS 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, ...","volume":"42 1","pages":"191 - 209"},"PeriodicalIF":0.0,"publicationDate":"2021-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78620288","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-21DOI: 10.46298/lmcs-18(4:2)2022
R. Majumdar, R. Thinniyam, Georg Zetzsche
The model of asynchronous programming arises in many contexts, from low-level systems software to high-level web programming. We take a language-theoretic perspective and show general decidability and undecidability results for asynchronous programs that capture all known results as well as show decidability of new and important classes. As a main consequence, we show decidability of safety, termination and boundedness verification for higher-order asynchronous programs—such as OCaml programs using Lwt—and undecidability of liveness verification already for order-2 asynchronous programs. We show that under mild assumptions, surprisingly, safety and termination verification of asynchronous programs with handlers from a language class are decidable iff emptiness is decidable for the underlying language class. Moreover, we show that configuration reachability and liveness (fair termination) verification are equivalent, and decidability of these problems implies decidability of the well-known “equal-letters” problem on languages. Our results close the decidability frontier for asynchronous programs.
{"title":"General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond","authors":"R. Majumdar, R. Thinniyam, Georg Zetzsche","doi":"10.46298/lmcs-18(4:2)2022","DOIUrl":"https://doi.org/10.46298/lmcs-18(4:2)2022","url":null,"abstract":"The model of asynchronous programming arises in many contexts, from low-level systems software to high-level web programming. We take a language-theoretic perspective and show general decidability and undecidability results for asynchronous programs that capture all known results as well as show decidability of new and important classes. As a main consequence, we show decidability of safety, termination and boundedness verification for higher-order asynchronous programs—such as OCaml programs using Lwt—and undecidability of liveness verification already for order-2 asynchronous programs. We show that under mild assumptions, surprisingly, safety and termination verification of asynchronous programs with handlers from a language class are decidable iff emptiness is decidable for the underlying language class. Moreover, we show that configuration reachability and liveness (fair termination) verification are equivalent, and decidability of these problems implies decidability of the well-known “equal-letters” problem on languages. Our results close the decidability frontier for asynchronous programs.","PeriodicalId":93056,"journal":{"name":"Tools and algorithms for the construction and analysis of systems : 26th International Conference, TACAS 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, ...","volume":"45 1","pages":"449 - 467"},"PeriodicalIF":0.0,"publicationDate":"2021-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89316686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-21DOI: 10.1007/978-3-030-72013-1_13
Rosa Abbasi Boroujeni, Jonas Schiffl, Eva Darulova, Mattias Ulbrich, Wolfgang Ahrendt
{"title":"Deductive Verification of Floating-Point Java Programs in KeY","authors":"Rosa Abbasi Boroujeni, Jonas Schiffl, Eva Darulova, Mattias Ulbrich, Wolfgang Ahrendt","doi":"10.1007/978-3-030-72013-1_13","DOIUrl":"https://doi.org/10.1007/978-3-030-72013-1_13","url":null,"abstract":"","PeriodicalId":93056,"journal":{"name":"Tools and algorithms for the construction and analysis of systems : 26th International Conference, TACAS 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, ...","volume":"35 1","pages":"242 - 261"},"PeriodicalIF":0.0,"publicationDate":"2021-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85820880","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-20DOI: 10.1007/978-3-030-72016-2_19
D. Yellin, Gail Weiss
{"title":"Synthesizing Context-free Grammars from Recurrent Neural Networks","authors":"D. Yellin, Gail Weiss","doi":"10.1007/978-3-030-72016-2_19","DOIUrl":"https://doi.org/10.1007/978-3-030-72016-2_19","url":null,"abstract":"","PeriodicalId":93056,"journal":{"name":"Tools and algorithms for the construction and analysis of systems : 26th International Conference, TACAS 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, ...","volume":"9 1","pages":"351 - 369"},"PeriodicalIF":0.0,"publicationDate":"2021-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85268163","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-18DOI: 10.46298/lmcs-18(3:26)2022
Makai Mann, A. Irfan, A. Griggio, O. Padon, Clark W. Barrett
We develop a framework for model checking infinite-state systems by automatically augmenting them with auxiliary variables, enabling quantifier-free induction proofs for systems that would otherwise require quantified invariants. We combine this mechanism with a counterexample-guided abstraction refinement scheme for the theory of arrays. Our framework can thus, in many cases, reduce inductive reasoning with quantifiers and arrays to quantifier-free and array-free reasoning. We evaluate the approach on a wide set of benchmarks from the literature. The results show that our implementation often outperforms state-of-the-art tools, demonstrating its practical potential.
{"title":"Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays","authors":"Makai Mann, A. Irfan, A. Griggio, O. Padon, Clark W. Barrett","doi":"10.46298/lmcs-18(3:26)2022","DOIUrl":"https://doi.org/10.46298/lmcs-18(3:26)2022","url":null,"abstract":"We develop a framework for model checking infinite-state systems by automatically augmenting them with auxiliary variables, enabling quantifier-free induction proofs for systems that would otherwise require quantified invariants. We combine this mechanism with a counterexample-guided abstraction refinement scheme for the theory of arrays. Our framework can thus, in many cases, reduce inductive reasoning with quantifiers and arrays to quantifier-free and array-free reasoning. We evaluate the approach on a wide set of benchmarks from the literature. The results show that our implementation often outperforms state-of-the-art tools, demonstrating its practical potential.","PeriodicalId":93056,"journal":{"name":"Tools and algorithms for the construction and analysis of systems : 26th International Conference, TACAS 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, ...","volume":"33 1","pages":"113 - 132"},"PeriodicalIF":0.0,"publicationDate":"2021-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81275356","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-15DOI: 10.1007/978-3-030-72013-1_17
P. Ashok, Mathias Jackermeier, Jan Křetínský, Christoph Weinhuber, Maximilian Weininger, Mayank Yadav
{"title":"dtControl 2.0: Explainable Strategy Representation via Decision Tree Learning Steered by Experts","authors":"P. Ashok, Mathias Jackermeier, Jan Křetínský, Christoph Weinhuber, Maximilian Weininger, Mayank Yadav","doi":"10.1007/978-3-030-72013-1_17","DOIUrl":"https://doi.org/10.1007/978-3-030-72013-1_17","url":null,"abstract":"","PeriodicalId":93056,"journal":{"name":"Tools and algorithms for the construction and analysis of systems : 26th International Conference, TACAS 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, ...","volume":"17 1","pages":"326 - 345"},"PeriodicalIF":0.0,"publicationDate":"2021-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78646031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-09DOI: 10.1007/s10009-023-00695-1
Matthew Sotoudeh, Zhen-Zhong Tao, Aditya V. Thakur
{"title":"SyReNN: A Tool for Analyzing Deep Neural Networks","authors":"Matthew Sotoudeh, Zhen-Zhong Tao, Aditya V. Thakur","doi":"10.1007/s10009-023-00695-1","DOIUrl":"https://doi.org/10.1007/s10009-023-00695-1","url":null,"abstract":"","PeriodicalId":93056,"journal":{"name":"Tools and algorithms for the construction and analysis of systems : 26th International Conference, TACAS 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, ...","volume":"35 1","pages":"281 - 302"},"PeriodicalIF":0.0,"publicationDate":"2021-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86254136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-06DOI: 10.1007/978-3-030-72016-2_2
Suguman Bansal, K. Chatterjee, Moshe Y. Vardi
{"title":"On Satisficing in Quantitative Games","authors":"Suguman Bansal, K. Chatterjee, Moshe Y. Vardi","doi":"10.1007/978-3-030-72016-2_2","DOIUrl":"https://doi.org/10.1007/978-3-030-72016-2_2","url":null,"abstract":"","PeriodicalId":93056,"journal":{"name":"Tools and algorithms for the construction and analysis of systems : 26th International Conference, TACAS 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, ...","volume":"112 21","pages":"20 - 37"},"PeriodicalIF":0.0,"publicationDate":"2021-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91403700","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-28DOI: 10.1007/978-3-030-72016-2_9
Margarida Ferreira, Miguel Terra-Neves, M. Ventura, I. Lynce, R. Martins
{"title":"FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions","authors":"Margarida Ferreira, Miguel Terra-Neves, M. Ventura, I. Lynce, R. Martins","doi":"10.1007/978-3-030-72016-2_9","DOIUrl":"https://doi.org/10.1007/978-3-030-72016-2_9","url":null,"abstract":"","PeriodicalId":93056,"journal":{"name":"Tools and algorithms for the construction and analysis of systems : 26th International Conference, TACAS 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, ...","volume":"55 1","pages":"152 - 169"},"PeriodicalIF":0.0,"publicationDate":"2020-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83900002","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Tools and algorithms for the construction and analysis of systems : 26th International Conference, TACAS 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, ...
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：