Theoretical Aspects of Software Engineering最新文献

Maximizing Reachability Probabilities in Rectangular Automata with Random Clocks 随机时钟矩形自动机的可达概率最大化

Theoretical Aspects of Software Engineering Pub Date : 2023-04-28 DOI: 10.48550/arXiv.2304.14996

Joanna Delicaris, Stefan Schupp, Erika 'Abrah'am, Anne Remke

引用次数: 2

Identifying Minimal Changes in the Zone Abstract Domain 识别区域抽象域的最小变化

Theoretical Aspects of Software Engineering Pub Date : 2023-04-27 DOI: 10.48550/arXiv.2304.14550

Kenny Ballou, Elena Sherman

{"title":"Identifying Minimal Changes in the Zone Abstract Domain","authors":"Kenny Ballou, Elena Sherman","doi":"10.48550/arXiv.2304.14550","DOIUrl":"https://doi.org/10.48550/arXiv.2304.14550","url":null,"abstract":"Verification techniques express program states as logical formulas over program variables. For example, symbolic execution and abstract interpretation encode program states as a set of integer inequalities. However, for real-world programs these formulas tend to become large, which affects scalability of analyses. To address this problem, researchers developed complementary approaches which either remove redundant inequalities or extract a subset of inequalities sufficient for specific reasoning. For arbitrary integer inequalities, such reduction approaches either have high complexities or over-approximate. However, efficiency and precision of these approaches can be improved for a restricted type of logical formulas used in relational numerical abstract domains. While previous work investigated custom efficient redundant inequality elimination for Zones states, our work examines custom semantic slicing algorithms that identify a minimal set of changed inequalities in Zones states. The client application of the minimal changes in Zones is an empirical study on comparison between invariants computed by data-flow analysis using Zones, Intervals and Predicates numerical domains. In particular, evaluations compare how our proposed algorithms affect the precision of comparing Zones vs. Intervals and Zones vs. Predicates abstract domains. The results show our techniques reduce the number of variables by more than 70% and the number of inequalities by 30%, compared to full states. The approach refines the granularity of comparison between domains, reducing incomparable invariants between Zones and Predicates from 52% to 4%, and increases equality of Intervals and Zones, invariants from 27% to 71%. The techniques improve the comparison efficiency by reducing total runtime for all subject comparisons for Zones and Predicates from over 4 minutes to a few seconds.","PeriodicalId":349699,"journal":{"name":"Theoretical Aspects of Software Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129386914","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

Technical-Report: Automating Recoverability Proofs for Cyber-Physical Systems with Runtime Assurance Architectures 技术报告:使用运行时保证体系结构自动化网络物理系统的可恢复性证明

Theoretical Aspects of Software Engineering Pub Date : 2023-04-23 DOI: 10.48550/arXiv.2304.11564

Vivek Nigam, C. Talcott

{"title":"Technical-Report: Automating Recoverability Proofs for Cyber-Physical Systems with Runtime Assurance Architectures","authors":"Vivek Nigam, C. Talcott","doi":"10.48550/arXiv.2304.11564","DOIUrl":"https://doi.org/10.48550/arXiv.2304.11564","url":null,"abstract":"Cyber-physical systems (CPSes), such as autonomous vehicles, use sophisticated components like ML-based controllers. It is difficult to provide evidence about the safe functioning of such components. To overcome this problem, Runtime Assurance Architecture (RTA) solutions have been proposed. The RAP's decision component evaluates the system's safety risk and whenever the risk is higher than acceptable the RTA switches to a safety mode that, for example, activates a controller with strong evidence for its safe functioning. In this way, RTAs increase CPS runtime safety and resilience by recovering the system from higher to lower risk levels. The goal of this paper is to automate recovery proofs of CPSes using RTAs. We first formalize the key verification problems, namely, the decision sampling-time adequacy problem and the time-bounded recoverability problem. We then demonstrate how to automatically generate proofs for the proposed verification problems using symbolic rewriting modulo SMT. Automation is enabled by integrating the rewriting logic tool (Maude), which generates sets of non-linear constraints, with an SMT-solver (Z3) to produce proofs","PeriodicalId":349699,"journal":{"name":"Theoretical Aspects of Software Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127742062","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

Safety Verification for Neural Networks Based on Set-boundary Analysis 基于集边界分析的神经网络安全性验证

Theoretical Aspects of Software Engineering Pub Date : 2022-10-09 DOI: 10.48550/arXiv.2210.04175

Zhen Liang, Dejin Ren, Wanwei Liu, Ji Wang, Wenjing Yang, Bai Xue

{"title":"Safety Verification for Neural Networks Based on Set-boundary Analysis","authors":"Zhen Liang, Dejin Ren, Wanwei Liu, Ji Wang, Wenjing Yang, Bai Xue","doi":"10.48550/arXiv.2210.04175","DOIUrl":"https://doi.org/10.48550/arXiv.2210.04175","url":null,"abstract":"Neural networks (NNs) are increasingly applied in safety-critical systems such as autonomous vehicles. However, they are fragile and are often ill-behaved. Consequently, their behaviors should undergo rigorous guarantees before deployment in practice. In this paper we propose a set-boundary reachability method to investigate the safety verification problem of NNs from a topological perspective. Given an NN with an input set and a safe set, the safety verification problem is to determine whether all outputs of the NN resulting from the input set fall within the safe set. In our method, the homeomorphism property of NNs is mainly exploited, which establishes a relationship mapping boundaries to boundaries. The exploitation of this property facilitates reachability computations via extracting subsets of the input set rather than the entire input set, thus controlling the wrapping effect in reachability analysis and facilitating the reduction of computation burdens for safety verification. The homeomorphism property exists in some widely used NNs such as invertible NNs. Notable representations are invertible residual networks (i-ResNets) and Neural ordinary differential equations (Neural ODEs). For these NNs, our set-boundary reachability method only needs to perform reachability analysis on the boundary of the input set. For NNs which do not feature this property with respect to the input set, we explore subsets of the input set for establishing the local homeomorphism property, and then abandon these subsets for reachability computations. Finally, some examples demonstrate the performance of the proposed method.","PeriodicalId":349699,"journal":{"name":"Theoretical Aspects of Software Engineering","volume":"353 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132313100","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

Repairing Adversarial Texts through Perturbation 通过扰动修复对抗性文本

Theoretical Aspects of Software Engineering Pub Date : 2021-12-29 DOI: 10.1007/978-3-031-10363-6_3

Guoliang Dong, Jingyi Wang, Jun Sun, Sudipta Chattopadhyay, Xinyu Wang, Ting Dai, Jie Shi, J. Dong

引用次数: 0

Towards Parallel Model Generation for Random Performance Testing of Model-Oriented Operations 面向模型操作随机性能测试的并行模型生成研究

Theoretical Aspects of Software Engineering Pub Date : 2016-07-17 DOI: 10.1109/TASE.2016.26

Xiao He, Wenfeng Li, Tian Zhang, Yi Liu

{"title":"Towards Parallel Model Generation for Random Performance Testing of Model-Oriented Operations","authors":"Xiao He, Wenfeng Li, Tian Zhang, Yi Liu","doi":"10.1109/TASE.2016.26","DOIUrl":"https://doi.org/10.1109/TASE.2016.26","url":null,"abstract":"Model-oriented operations, such as model transformation, model query, and model comparison, are the core of Model-Driven Engineering. Their scalability becomes an important issue when they are to be applied in industry. Large-scale models, however, are not widely available, making it hard to test the performance and coverage of those operations without any bias. To do so, one must be able to generate large models, which are syntactically correct, as test inputs efficiently and randomly. This paper proposes a parallel approach to generating large random model, which improves on our previous sequential algorithm. First, the paper identifies the dependencies existing in the process of model generation, which hinders parallelization. Then, the paper proposes a partitioning strategy that is able to turn a sequential generation task into a series of parallelizable subtasks. Experimental results of performance are also presented, which show that the parallel approach proposed can reduce 50% time costs compared to the sequential one in most cases, while the correctness and the randomness of the models generated by this approach are kept.","PeriodicalId":349699,"journal":{"name":"Theoretical Aspects of Software Engineering","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124889626","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

How Should We Build That? Evolving a Development Environment That's Suitable for Constructing Today's Systems 我们应该如何构建它?发展适合构建当今系统的开发环境

Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.44

Neil White, Janet Barnes

引用次数: 0

A Static Analyser for Resource Sensitive Workflow Models 资源敏感工作流模型的静态分析器

Theoretical Aspects of Software Engineering Pub Date : 1900-01-01 DOI: 10.1007/978-3-031-35257-7_18

Muhammad Ishtiaq Ali, Ka I Pun

引用次数: 0

View-Based Axiomatic Reasoning for PSO 基于视图的粒子群公理推理

Theoretical Aspects of Software Engineering Pub Date : 1900-01-01 DOI: 10.1007/978-3-031-35257-7_17

Lara Bargmann, H. Wehrheim

引用次数: 1

Decomposing Synthesized Strategies for Reactive Multi-agent Reinforcement Learning 反应性多智能体强化学习的分解综合策略

Theoretical Aspects of Software Engineering Pub Date : 1900-01-01 DOI: 10.1007/978-3-031-35257-7_4

Chenyang Zhu, Jinyu Zhu, Yujie Cai, Fang Wang

引用次数: 0