International Conference on Tools and Algorithms for Construction and Analysis of Systems最新文献

筛选
英文 中文
The WhyRel Prototype for Modular Relational Verification of Pointer Programs 指针程序模块化关系验证的WhyRel原型
Ramana Nagasamudram, A. Banerjee, D. Naumann
{"title":"The WhyRel Prototype for Modular Relational Verification of Pointer Programs","authors":"Ramana Nagasamudram, A. Banerjee, D. Naumann","doi":"10.1007/978-3-031-30820-8_11","DOIUrl":"https://doi.org/10.1007/978-3-031-30820-8_11","url":null,"abstract":"","PeriodicalId":285074,"journal":{"name":"International Conference on Tools and Algorithms for Construction and Analysis of Systems","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133199192","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}
引用次数: 0
Stack-Aware Hyperproperties Stack-Aware Hyperproperties
A. Bajwa, Minjia Zhang, Rohit Chadha, Mahesh Viswanathan
{"title":"Stack-Aware Hyperproperties","authors":"A. Bajwa, Minjia Zhang, Rohit Chadha, Mahesh Viswanathan","doi":"10.48550/arXiv.2301.11521","DOIUrl":"https://doi.org/10.48550/arXiv.2301.11521","url":null,"abstract":"A hyperproperty relates executions of a program and is used to formalize security objectives such as confidentiality, non-interference, privacy, and anonymity. Formally, a hyperproperty is a collection of allowable sets of executions. A program violates a hyperproperty if the set of its executions is not in the collection specified by the hyperproperty. The logic HyperCTL^* has been proposed in the literature to formally specify and verify hyperproperties. The problem of checking whether a finite-state program satisfies a HyperCTL^* formula is known to be decidable. However, the problem turns out to be undecidable for procedural (recursive) programs. Surprisingly, we show that decidability can be restored if we consider restricted classes of hyperproperties, namely those that relate only those executions of a program which have the same call-stack access pattern. We call such hyperproperties, emph{stack-aware hyperproperties.} Our decision procedure can be used as a proof method for establishing security objectives such as noninference for recursive programs, and also for refuting security objectives such as observational determinism. Further, if the call stack size is observable to the attacker, the decision procedure provides exact verification.","PeriodicalId":285074,"journal":{"name":"International Conference on Tools and Algorithms for Construction and Analysis of Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123519460","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}
引用次数: 0
OccRob: Efficient SMT-Based Occlusion Robustness Verification of Deep Neural Networks OccRob:高效的基于smt的深度神经网络遮挡鲁棒性验证
Xingwu Guo, Ziwei Zhou, Yueling Zhang, Guy Katz, M. Zhang
{"title":"OccRob: Efficient SMT-Based Occlusion Robustness Verification of Deep Neural Networks","authors":"Xingwu Guo, Ziwei Zhou, Yueling Zhang, Guy Katz, M. Zhang","doi":"10.48550/arXiv.2301.11912","DOIUrl":"https://doi.org/10.48550/arXiv.2301.11912","url":null,"abstract":"Occlusion is a prevalent and easily realizable semantic perturbation to deep neural networks (DNNs). It can fool a DNN into misclassifying an input image by occluding some segments, possibly resulting in severe errors. Therefore, DNNs planted in safety-critical systems should be verified to be robust against occlusions prior to deployment. However, most existing robustness verification approaches for DNNs are focused on non-semantic perturbations and are not suited to the occlusion case. In this paper, we propose the first efficient, SMT-based approach for formally verifying the occlusion robustness of DNNs. We formulate the occlusion robustness verification problem and prove it is NP-complete. Then, we devise a novel approach for encoding occlusions as a part of neural networks and introduce two acceleration techniques so that the extended neural networks can be efficiently verified using off-the-shelf, SMT-based neural network verification tools. We implement our approach in a prototype called OccRob and extensively evaluate its performance on benchmark datasets with various occlusion variants. The experimental results demonstrate our approach's effectiveness and efficiency in verifying DNNs' robustness against various occlusions, and its ability to generate counterexamples when these DNNs are not robust.","PeriodicalId":285074,"journal":{"name":"International Conference on Tools and Algorithms for Construction and Analysis of Systems","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121607733","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}
引用次数: 3
AutoHyper: Explicit-State Model Checking for HyperLTL AutoHyper: HyperLTL的显式状态模型检查
Raven Beutner, B. Finkbeiner
{"title":"AutoHyper: Explicit-State Model Checking for HyperLTL","authors":"Raven Beutner, B. Finkbeiner","doi":"10.48550/arXiv.2301.11229","DOIUrl":"https://doi.org/10.48550/arXiv.2301.11229","url":null,"abstract":"HyperLTL is a temporal logic that can express hyperproperties, i.e., properties that relate multiple execution traces of a system. Such properties are becoming increasingly important and naturally occur, e.g., in information-flow control, robustness, mutation testing, path planning, and causality checking. Thus far, complete model checking tools for HyperLTL have been limited to alternation-free formulas, i.e., formulas that use only universal or only existential trace quantification. Properties involving quantifier alternations could only be handled in an incomplete way, i.e., the verification might fail even though the property holds. In this paper, we present AutoHyper, an explicit-state automata-based model checker that supports full HyperLTL and is complete for properties with arbitrary quantifier alternations. We show that language inclusion checks can be integrated into HyperLTL verification, which allows AutoHyper to benefit from a range of existing inclusion-checking tools. We evaluate AutoHyper on a broad set of benchmarks drawn from different areas in the literature and compare it with existing (incomplete) methods for HyperLTL verification.","PeriodicalId":285074,"journal":{"name":"International Conference on Tools and Algorithms for Construction and Analysis of Systems","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127408818","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}
引用次数: 8
Robust Almost-Sure Reachability in Multi-Environment MDPs 多环境mdp中稳健的几乎确定可达性
Marck van der Vegt, N. Jansen, Sebastian Junges
{"title":"Robust Almost-Sure Reachability in Multi-Environment MDPs","authors":"Marck van der Vegt, N. Jansen, Sebastian Junges","doi":"10.48550/arXiv.2301.11296","DOIUrl":"https://doi.org/10.48550/arXiv.2301.11296","url":null,"abstract":"Multiple-environment MDPs (MEMDPs) capture finite sets of MDPs that share the states but differ in the transition dynamics. These models form a proper subclass of partially observable MDPs (POMDPs). We consider the synthesis of policies that robustly satisfy an almost-sure reachability property in MEMDPs, that is, one policy that satisfies a property for all environments. For POMDPs, deciding the existence of robust policies is an EXPTIME-complete problem. In this paper, we show that this problem is PSPACE-complete for MEMDPs, while the policies in general require exponential memory. We exploit the theoretical results to develop and implement an algorithm that shows promising results in synthesizing robust policies for various benchmarks.","PeriodicalId":285074,"journal":{"name":"International Conference on Tools and Algorithms for Construction and Analysis of Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132242529","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}
引用次数: 1
LTL Reactive Synthesis with a Few Hints LTL反应合成的几点提示
M. Balachander, E. Filiot, Jean-François Raskin
{"title":"LTL Reactive Synthesis with a Few Hints","authors":"M. Balachander, E. Filiot, Jean-François Raskin","doi":"10.48550/arXiv.2301.10485","DOIUrl":"https://doi.org/10.48550/arXiv.2301.10485","url":null,"abstract":"We study a variant of the problem of synthesizing Mealy machines that enforce LTL specifications against all possible behaviours of the environment including hostile ones. In the variant studied here, the user provides the high level LTL specification {phi} of the system to design, and a set E of examples of executions that the solution must produce. Our synthesis algorithm works in two phases. First, it generalizes the decisions taken along the examples E using tailored extensions of automata learning algorithms. This phase generalizes the user-provided examples in E while preserving realizability of {phi}. Second, the algorithm turns the (usually) incomplete Mealy machine obtained by the learning phase into a complete Mealy machine that realizes {phi}. The examples are used to guide the synthesis procedure. We provide a completeness result that shows that our procedure can learn any Mealy machine M that realizes {phi} with a small (polynomial) set of examples. We also show that our problem, that generalizes the classical LTL synthesis problem (i.e. when E = {emptyset}), matches its worst-case complexity. The additional cost of learning from E is even polynomial in the size of E and in the size of a symbolic representation of solutions that realize {phi}. This symbolic representation is computed by the synthesis algorithm implemented in Acacia-Bonzai when solving the plain LTL synthesis problem. We illustrate the practical interest of our approach on a set of examples.","PeriodicalId":285074,"journal":{"name":"International Conference on Tools and Algorithms for Construction and Analysis of Systems","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116488868","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}
引用次数: 0
Taming Large Bounds in Synthesis from Bounded-Liveness Specifications (Full Version) 从有界活性规范中驯服合成中的大界(完整版)
Philippe Heim, Rayna Dimitrova
{"title":"Taming Large Bounds in Synthesis from Bounded-Liveness Specifications (Full Version)","authors":"Philippe Heim, Rayna Dimitrova","doi":"10.48550/arXiv.2301.10032","DOIUrl":"https://doi.org/10.48550/arXiv.2301.10032","url":null,"abstract":"Automatic synthesis from temporal logic specifications is an attractive alternative to manual system design, due to its ability to generate correct-by-construction implementations from high-level specifications. Due to the high complexity of the synthesis problem, significant research efforts have been directed at developing practically efficient approaches for restricted specification language fragments. In this paper, we focus on the Safety LTL fragment of Linear Temporal Logic (LTL) syntactically extended with bounded temporal operators. We propose a new synthesis approach with the primary motivation to solve efficiently the synthesis problem for specifications with bounded temporal operators, in particular those with large bounds. The experimental evaluation of our method shows that for this type of specifications, it outperforms state-of-art synthesis tools, demonstrating that it is a promising approach to efficiently treating quantitative timing constraints in safety specifications.","PeriodicalId":285074,"journal":{"name":"International Conference on Tools and Algorithms for Construction and Analysis of Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124276861","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}
引用次数: 0
The Packing Chromatic Number of the Infinite Square Grid is 15 无限方格网格的填充色数为15
Bernardo Subercaseaux, Marijn J. H. Heule
{"title":"The Packing Chromatic Number of the Infinite Square Grid is 15","authors":"Bernardo Subercaseaux, Marijn J. H. Heule","doi":"10.48550/arXiv.2301.09757","DOIUrl":"https://doi.org/10.48550/arXiv.2301.09757","url":null,"abstract":"A packing $k$-coloring is a natural variation on the standard notion of graph $k$-coloring, where vertices are assigned numbers from ${1, ldots, k}$, and any two vertices assigned a common color $c in {1, ldots, k}$ need to be at a distance greater than $c$ (as opposed to $1$, in standard graph colorings). Despite a sequence of incremental work, determining the packing chromatic number of the infinite square grid has remained an open problem since its introduction in 2002. We culminate the search by proving this number to be 15. We achieve this result by improving the best-known method for this problem by roughly two orders of magnitude. The most important technique to boost performance is a novel, surprisingly effective propositional encoding for packing colorings. Additionally, we developed an alternative symmetry-breaking method. Since both new techniques are more complex than existing techniques for this problem, a verified approach is required to trust them. We include both techniques in a proof of unsatisfiability, reducing the trusted core to the correctness of the direct encoding.","PeriodicalId":285074,"journal":{"name":"International Conference on Tools and Algorithms for Construction and Analysis of Systems","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127180409","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}
引用次数: 2
Verified reductions for optimization 经过验证的优化缩减
A. Bentkamp, Ramon Fern'andez Mir, J. Avigad
{"title":"Verified reductions for optimization","authors":"A. Bentkamp, Ramon Fern'andez Mir, J. Avigad","doi":"10.48550/arXiv.2301.09347","DOIUrl":"https://doi.org/10.48550/arXiv.2301.09347","url":null,"abstract":"Numerical and symbolic methods for optimization are used extensively in engineering, industry, and finance. Various methods are used to reduce problems of interest to ones that are amenable to solution by such software. We develop a framework for designing and applying such reductions, using the Lean programming language and interactive proof assistant. Formal verification makes the process more reliable, and the availability of an interactive framework and ambient mathematical library provides a robust environment for constructing the reductions and reasoning about them.","PeriodicalId":285074,"journal":{"name":"International Conference on Tools and Algorithms for Construction and Analysis of Systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126594867","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}
引用次数: 0
Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration 基于乐观值迭代的概率下推自动机证书
Tobias Winkler, J. Katoen
{"title":"Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration","authors":"Tobias Winkler, J. Katoen","doi":"10.48550/arXiv.2301.08657","DOIUrl":"https://doi.org/10.48550/arXiv.2301.08657","url":null,"abstract":"Probabilistic pushdown automata (pPDA) are a standard model for discrete probabilistic programs with procedures and recursion. In pPDA, many quantitative properties are characterized as least fixpoints of polynomial equation systems. In this paper, we study the problem of certifying that these quantities lie within certain bounds. To this end, we first characterize the polynomial systems that admit easy-to-check certificates for validating bounds on their least fixpoint. Second, we present a sound and complete Optimistic Value Iteration algorithm for computing such certificates. Third, we show how certificates for polynomial systems can be transferred to certificates for various quantitative pPDA properties. Experiments demonstrate that our algorithm computes succinct certificates for several intricate example programs as well as stochastic context-free grammars with $>10^4$ production rules.","PeriodicalId":285074,"journal":{"name":"International Conference on Tools and Algorithms for Construction and Analysis of Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130636937","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}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信