Automated Technology for Verification and Analysis最新文献

Fast Equivalence Checking of Quantum Circuits of Clifford Gates 克利福德门量子电路的快速等价检验

Automated Technology for Verification and Analysis Pub Date : 2023-08-02 DOI: 10.1007/978-3-031-45332-8_10

D. Thanos, T. Coopmans, A. Laarman

引用次数: 0

An Automata-Theoretic Approach to Synthesizing Binarized Neural Networks 综合二值化神经网络的自动机理论方法

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

Ye Tao, Wanwei Liu, Fu Song, Zhen Liang, J. Wang, Hongxu Zhu

{"title":"An Automata-Theoretic Approach to Synthesizing Binarized Neural Networks","authors":"Ye Tao, Wanwei Liu, Fu Song, Zhen Liang, J. Wang, Hongxu Zhu","doi":"10.48550/arXiv.2307.15907","DOIUrl":"https://doi.org/10.48550/arXiv.2307.15907","url":null,"abstract":"Deep neural networks, (DNNs, a.k.a. NNs), have been widely used in various tasks and have been proven to be successful. However, the accompanied expensive computing and storage costs make the deployments in resource-constrained devices a significant concern. To solve this issue, quantization has emerged as an effective way to reduce the costs of DNNs with little accuracy degradation by quantizing floating-point numbers to low-width fixed-point representations. Quantized neural networks (QNNs) have been developed, with binarized neural networks (BNNs) restricted to binary values as a special case. Another concern about neural networks is their vulnerability and lack of interpretability. Despite the active research on trustworthy of DNNs, few approaches have been proposed to QNNs. To this end, this paper presents an automata-theoretic approach to synthesizing BNNs that meet designated properties. More specifically, we define a temporal logic, called BLTL, as the specification language. We show that each BLTL formula can be transformed into an automaton on finite words. To deal with the state-explosion problem, we provide a tableau-based approach in real implementation. For the synthesis procedure, we utilize SMT solvers to detect the existence of a model (i.e., a BNN) in the construction process. Notably, synthesis provides a way to determine the hyper-parameters of the network before training.Moreover, we experimentally evaluate our approach and demonstrate its effectiveness in improving the individual fairness and local robustness of BNNs while maintaining accuracy to a great extent.","PeriodicalId":335085,"journal":{"name":"Automated Technology for Verification and Analysis","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125254685","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

Syntactic vs Semantic Linear Abstraction and Refinement of Neural Networks 神经网络的句法与语义线性抽象与细化

Automated Technology for Verification and Analysis Pub Date : 2023-07-20 DOI: 10.48550/arXiv.2307.10891

Calvin Chau, Jan Křetínský, S. Mohr

引用次数: 0

Synthesis of Distributed Protocols by Enumeration Modulo Isomorphisms 基于枚举模同构的分布式协议综合

Automated Technology for Verification and Analysis Pub Date : 2023-06-05 DOI: 10.48550/arXiv.2306.02967

D. Egolf, S. Tripakis

引用次数: 1

Minimally Comparing Relational Abstract Domains 最小比较关系抽象域

Automated Technology for Verification and Analysis Pub Date : 2023-05-25 DOI: 10.48550/arXiv.2305.16212

Kenny Ballou, Elena Sherman

{"title":"Minimally Comparing Relational Abstract Domains","authors":"Kenny Ballou, Elena Sherman","doi":"10.48550/arXiv.2305.16212","DOIUrl":"https://doi.org/10.48550/arXiv.2305.16212","url":null,"abstract":"Value-based static analysis techniques express computed program invariants as logical formula over program variables. Researchers and practitioners use these invariants to aid in software engineering and verification tasks. When selecting abstract domains, practitioners weigh the cost of a domain against its expressiveness. However, an abstract domain's expressiveness tends to be stated in absolute terms; either mathematically via the sub-polyhedra the domain is capable of describing, empirically using a set of known properties to verify, or empirically via logical entailment using the entire invariant of the domain at each program point. Due to carry-over effects, however, the last technique can be problematic because it tends to provide a simplistic and imprecise comparisons. We address limitations of comparing, in general, abstract domains via logical entailment in this work. We provide a fixed-point algorithm for including the minimally necessary variables from each domain into the compared formula. Furthermore, we empirically evaluate our algorithm, comparing different techniques of widening over the Zones domain and comparing Zones to an incomparable Relational Predicates domain. Our empirical evaluation of our technique shows an improved granularity of comparison. It lowered the number of more precise invariants when comparing analysis techniques, thus, limiting the prevalent carry-over effects. Moreover, it removed undecidable invariants and lowered the number of incomparable invariants when comparing two incomparable relational abstract domains.","PeriodicalId":335085,"journal":{"name":"Automated Technology for Verification and Analysis","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126647075","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

On the Difficulty of Intersection Checking with Polynomial Zonotopes 关于多项式分区交点检验的困难问题

Automated Technology for Verification and Analysis Pub Date : 2023-05-17 DOI: 10.48550/arXiv.2305.09901

Yushen Huang, Ertai Luo, Stanley Bak, Yifan Sun

{"title":"On the Difficulty of Intersection Checking with Polynomial Zonotopes","authors":"Yushen Huang, Ertai Luo, Stanley Bak, Yifan Sun","doi":"10.48550/arXiv.2305.09901","DOIUrl":"https://doi.org/10.48550/arXiv.2305.09901","url":null,"abstract":"Polynomial zonotopes, a non-convex set representation, have a wide range of applications from real-time motion planning and control in robotics, to reachability analysis of nonlinear systems and safety shielding in reinforcement learning. Despite this widespread use, a frequently overlooked difficulty associated with polynomial zonotopes is intersection checking. Determining whether the reachable set, represented as a polynomial zonotope, intersects an unsafe set is not straightforward. In fact, we show that this fundamental operation is NP-hard, even for a simple class of polynomial zonotopes. The standard method for intersection checking with polynomial zonotopes is a two-part algorithm that overapproximates a polynomial zonotope with a regular zonotope and then, if the overapproximation error is deemed too large, splits the set and recursively tries again. Beyond the possible need for a large number of splits, we identify two sources of concern related to this algorithm: (1) overapproximating a polynomial zonotope with a zonotope has unbounded error, and (2) after splitting a polynomial zonotope, the overapproximation error can actually increase. Taken together, this implies there may be a possibility that the algorithm does not always terminate.We perform a rigorous analysis of the method and detail necessary conditions for the union of overapproximations to provably converge to the original polynomial zonotope.","PeriodicalId":335085,"journal":{"name":"Automated Technology for Verification and Analysis","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121161970","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

Graph-Based Reductions for Parametric and Weighted MDPs 基于图的参数化和加权mdp约简

Automated Technology for Verification and Analysis Pub Date : 2023-05-09 DOI: 10.48550/arXiv.2305.05739

Kasper Engelen, Guillermo A. P'erez, Shrisha Rao

引用次数: 0

Scenario Approach for Parametric Markov Models 参数马尔可夫模型的场景方法

Automated Technology for Verification and Analysis Pub Date : 2023-04-17 DOI: 10.48550/arXiv.2304.08330

Ying Liu, Andrea Turrini, E. M. Hahn, Bai Xue, Lijun Zhang

引用次数: 0

Learning nonlinear hybrid automata from input-output time-series data 从输入输出时间序列数据中学习非线性混合自动机

Automated Technology for Verification and Analysis Pub Date : 2023-01-10 DOI: 10.48550/arXiv.2301.03915

Amit Gurung, Masaki Waga, Kohei Suenaga

引用次数: 0

Fence Synthesis under the C11 Memory Model C11内存模型下的篱笆合成

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

Sanjana Singh, Divyanjali Sharma, Ishita Jaju, Subodh Sharma

引用次数: 0