Automated Technology for Verification and Analysis最新文献_第2页

Optimistic and Topological Value Iteration for Simple Stochastic Games 简单随机对策的乐观和拓扑值迭代

Automated Technology for Verification and Analysis Pub Date : 2022-07-29 DOI: 10.48550/arXiv.2207.14417

Muqsit Azeem, Alexandros Evangelidis, Jan Křetínský, Alexander Slivinskiy, Maximilian Weininger

引用次数: 3

Optimal Repair For Omega-regular Properties 最佳修复Omega-regular属性

Automated Technology for Verification and Analysis Pub Date : 2022-07-27 DOI: 10.48550/arXiv.2207.13416

V. Dave, S. Krishna, Vishnu Murali, Ashutosh Trivedi

{"title":"Optimal Repair For Omega-regular Properties","authors":"V. Dave, S. Krishna, Vishnu Murali, Ashutosh Trivedi","doi":"10.48550/arXiv.2207.13416","DOIUrl":"https://doi.org/10.48550/arXiv.2207.13416","url":null,"abstract":"This paper presents an optimization based framework to automate system repair against omega-regular properties. In the proposed formalization of optimal repair, the systems are represented as Kripke structures, the properties as $omega$-regular languages, and the repair space as repair machines -- weighted omega-regular transducers equipped with B\"uchi conditions -- that rewrite strings and associate a cost sequence to these rewritings. To translate the resulting cost-sequences to easily interpretable payoffs, we consider several aggregator functions to map cost sequences to numbers -- including limit superior, supremum, discounted-sum, and average-sum -- to define quantitative cost semantics. The problem of optimal repair, then, is to determine whether traces from a given system can be rewritten to satisfy an $omega$-regular property when the allowed cost is bounded by a given threshold. We also consider the dual challenge of impair verification that assumes that the rewritings are resolved adversarially under some given cost restriction, and asks to decide if all traces of the system satisfy the specification irrespective of the rewritings. With a negative result to the impair verification problem, we study the problem of designing a minimal mask of the Kripke structure such that the resulting traces satisfy the specifications despite the threshold-bounded impairment. We dub this problem as the mask synthesis problem. This paper presents automata-theoretic solutions to repair synthesis, impair verification, and mask synthesis problem for limit superior, supremum, discounted-sum, and average-sum cost semantics.","PeriodicalId":335085,"journal":{"name":"Automated Technology for Verification and Analysis","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129534735","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

Dynamic Shielding for Reinforcement Learning in Black-Box Environments 黑盒环境下强化学习的动态屏蔽

Automated Technology for Verification and Analysis Pub Date : 2022-07-27 DOI: 10.48550/arXiv.2207.13446

Masaki Waga, Ezequiel Castellano, Sasinee Pruekprasert, Stefan Klikovits, Toru Takisaka, I. Hasuo

引用次数: 3

Specification sketching for Linear Temporal Logic 线性时序逻辑规范草图

Automated Technology for Verification and Analysis Pub Date : 2022-06-14 DOI: 10.48550/arXiv.2206.06722

Simon Lutz, D. Neider, Rajarshi Roy

{"title":"Specification sketching for Linear Temporal Logic","authors":"Simon Lutz, D. Neider, Rajarshi Roy","doi":"10.48550/arXiv.2206.06722","DOIUrl":"https://doi.org/10.48550/arXiv.2206.06722","url":null,"abstract":"Virtually all verification and synthesis techniques assume that the formal specifications are readily available, functionally correct, and fully match the engineer's understanding of the given system. However, this assumption is often unrealistic in practice: formalizing system requirements is notoriously difficult, error-prone, and requires substantial training. To alleviate this severe hurdle, we propose a fundamentally novel approach to writing formal specifications, named specification sketching for Linear Temporal Logic (LTL). The key idea is that an engineer can provide a partial LTL formula, called an LTL sketch, where parts that are hard to formalize can be left out. Given a set of examples describing system behaviors that the specification should or should not allow, the task of a so-called sketching algorithm is then to complete a given sketch such that the resulting LTL formula is consistent with the examples. We show that deciding whether a sketch can be completed falls into the complexity class NP and present two SAT-based sketching algorithms. We also demonstrate that sketching is a practical approach to writing formal specifications using a prototype implementation.","PeriodicalId":335085,"journal":{"name":"Automated Technology for Verification and Analysis","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123812013","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

Prioritizing Corners in OoD Detectors via Symbolic String Manipulation 通过符号字符串操作确定OoD检测器拐角的优先级

Automated Technology for Verification and Analysis Pub Date : 2022-05-16 DOI: 10.48550/arXiv.2205.07736

Chih-Hong Cheng, Changshun Wu, Emmanouil Seferis, S. Bensalem

{"title":"Prioritizing Corners in OoD Detectors via Symbolic String Manipulation","authors":"Chih-Hong Cheng, Changshun Wu, Emmanouil Seferis, S. Bensalem","doi":"10.48550/arXiv.2205.07736","DOIUrl":"https://doi.org/10.48550/arXiv.2205.07736","url":null,"abstract":". For safety assurance of deep neural networks (DNNs), out-of-distribution (OoD) monitoring techniques are essential as they ﬁlter spurious input that is distant from the training dataset. This paper stud-ies the problem of systematically testing OoD monitors to avoid cases where an input data point is tested as in-distribution by the monitor, but the DNN produces spurious output predictions. We consider the def-inition of “in-distribution” characterized in the feature space by a union of hyperrectangles learned from the training dataset. Thus the testing is reduced to ﬁnding corners in hyperrectangles distant from the available training data in the feature space. Concretely, we encode the abstract lo-cation of every data point as a ﬁnite-length binary string, and the union of all binary strings is stored compactly using binary decision diagrams (BDDs). We demonstrate how to use BDDs to symbolically extract corners distant from all data points within the training set. Apart from test case generation, we explain how to use the proposed corners to ﬁne-tune the DNN to ensure that it does not predict overly conﬁdently. The result is evaluated over examples such as number and traﬃc sign recognition.","PeriodicalId":335085,"journal":{"name":"Automated Technology for Verification and Analysis","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130670969","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

Reactive Synthesis of Smart Contract Control Flows 智能合约控制流的响应式综合

Automated Technology for Verification and Analysis Pub Date : 2022-05-12 DOI: 10.48550/arXiv.2205.06039

B. Finkbeiner, Jana Hofmann, F. Kohn, Noemi E. Passing

引用次数: 2

Runtime Enforcement of Hyperproperties 超属性的运行时强制

Automated Technology for Verification and Analysis Pub Date : 2022-03-08 DOI: 10.1007/978-3-030-88885-5_19

Norine Coenen, B. Finkbeiner, Christopher Hahn, Jana Hofmann, Yannick Schillo

引用次数: 4

Projected Model Counting: Beyond Independent Support 预测模型计数:超越独立支持

Automated Technology for Verification and Analysis Pub Date : 2021-10-18 DOI: 10.1007/978-3-031-19992-9_11

Jiong Yang, Supratik Chakraborty, Kuldeep S. Meel

引用次数: 3

A Formal Semantics of the GraalVM Intermediate Representation GraalVM中间表示的形式化语义

Automated Technology for Verification and Analysis Pub Date : 2021-07-05 DOI: 10.1007/978-3-030-88885-5_8

Brae J. Webb, M. Utting, I. Hayes

引用次数: 4

Incorporating Monitors in Reactive Synthesis without Paying the Price 在反应合成中不付出代价地加入监视器

Automated Technology for Verification and Analysis Pub Date : 2021-07-02 DOI: 10.1007/978-3-030-88885-5_22

S. Azzopardi, Nir Piterman, G. Schneider

引用次数: 2