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

The WhyRel Prototype for Modular Relational Verification of Pointer Programs 指针程序模块化关系验证的WhyRel原型

International Conference on Tools and Algorithms for Construction and Analysis of Systems Pub Date : 2023-03-25 DOI: 10.1007/978-3-031-30820-8_11

Ramana Nagasamudram, A. Banerjee, D. Naumann

引用次数: 0

Stack-Aware Hyperproperties Stack-Aware Hyperproperties

International Conference on Tools and Algorithms for Construction and Analysis of Systems Pub Date : 2023-01-27 DOI: 10.48550/arXiv.2301.11521

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的深度神经网络遮挡鲁棒性验证

International Conference on Tools and Algorithms for Construction and Analysis of Systems Pub Date : 2023-01-27 DOI: 10.48550/arXiv.2301.11912

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的显式状态模型检查

International Conference on Tools and Algorithms for Construction and Analysis of Systems Pub Date : 2023-01-26 DOI: 10.48550/arXiv.2301.11229

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中稳健的几乎确定可达性

International Conference on Tools and Algorithms for Construction and Analysis of Systems Pub Date : 2023-01-26 DOI: 10.48550/arXiv.2301.11296

Marck van der Vegt, N. Jansen, Sebastian Junges

引用次数: 1

LTL Reactive Synthesis with a Few Hints LTL反应合成的几点提示

International Conference on Tools and Algorithms for Construction and Analysis of Systems Pub Date : 2023-01-25 DOI: 10.48550/arXiv.2301.10485

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) 从有界活性规范中驯服合成中的大界(完整版)

International Conference on Tools and Algorithms for Construction and Analysis of Systems Pub Date : 2023-01-24 DOI: 10.48550/arXiv.2301.10032

Philippe Heim, Rayna Dimitrova

引用次数: 0

The Packing Chromatic Number of the Infinite Square Grid is 15 无限方格网格的填充色数为15

International Conference on Tools and Algorithms for Construction and Analysis of Systems Pub Date : 2023-01-23 DOI: 10.48550/arXiv.2301.09757

Bernardo Subercaseaux, Marijn J. H. Heule

引用次数: 2

Verified reductions for optimization 经过验证的优化缩减

International Conference on Tools and Algorithms for Construction and Analysis of Systems Pub Date : 2023-01-23 DOI: 10.48550/arXiv.2301.09347

A. Bentkamp, Ramon Fern'andez Mir, J. Avigad

引用次数: 0

Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration 基于乐观值迭代的概率下推自动机证书

International Conference on Tools and Algorithms for Construction and Analysis of Systems Pub Date : 2023-01-20 DOI: 10.48550/arXiv.2301.08657

Tobias Winkler, J. Katoen

引用次数: 2