2019 International Symposium on Theoretical Aspects of Software Engineering (TASE)最新文献

Steering Interpolants Generation with Efficient Interpolation Abstraction Exploration 基于高效插值抽象探索的转向插值生成

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/TASE.2019.00-11

Xiaozhen Zhang, W. Kong, Jianguo Jiang, Gang Hou, Akira Fukuda

{"title":"Steering Interpolants Generation with Efficient Interpolation Abstraction Exploration","authors":"Xiaozhen Zhang, W. Kong, Jianguo Jiang, Gang Hou, Akira Fukuda","doi":"10.1109/TASE.2019.00-11","DOIUrl":"https://doi.org/10.1109/TASE.2019.00-11","url":null,"abstract":"Craig interpolation has emerged as an effective approximation method and can be widely applied in hardware and software model checking. Since the quality of interpolants can critically affect the success and failure, or convergence and divergence of model checking, researchers have put forward a novel and flexible interpolation abstraction-based technique to guide the computation of promising interpolants. In this technique, abstraction lattice is constructed to arrange families of interpolation abstraction for improving the quality of resulting interpolants. However, the original search strategy to explore an abstraction lattice is not efficient when abstraction lattice enlarges and the elapsed time to perform multiple search on the same abstraction lattice is obviously distinct for many problems. In this paper, in order to alleviate these problems, we propose a top-down search space pruning-based algorithm to search the abstraction lattice and implement this algorithm in the well-known model checker Eldarica. We conduct experiments on 179 benchmarks to compare our algorithm respectively against the original search algorithm in Eldarica and the state-of-the-art SMT solver Z3. The experimental results show that our algorithm performs much better in the sense that it is more efficient than Eldarica for most of the benchmarks and it can solve much more benchmarks than Z3.","PeriodicalId":183749,"journal":{"name":"2019 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115192538","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

A HOL Theory of the Differential for Matrix Functions 矩阵函数微分的HOL理论

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/TASE.2019.00-10

Yuhan Nie, Zhiping Shi, Aixuan Wu, Ximeng Li, Guohui Wang, Yong Guan

引用次数: 0

Multi-Agent Automated Reasoning Toward Machine Self-Awareness: A Case Study 面向机器自我意识的多智能体自动推理:一个案例研究

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/TASE.2019.00-17

Zhenbing Zeng, Jianlin Wang, Zhengfeng Yang

引用次数: 0

A Denotational Semantics for Dynamic Architectures 动态体系结构的指称语义

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/TASE.2019.000-8

Diego Marmsoler

引用次数: 1

Constructing Benchmarks for Supporting Explainable Evaluations of Static Application Security Testing Tools 为支持可解释的静态应用程序安全测试工具的评估构建基准

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/TASE.2019.00-18

Gaojian Hao, Feng Li, Wei Huo, Qing Sun, Wei Wang, Xinhua Li, Wei Zou

{"title":"Constructing Benchmarks for Supporting Explainable Evaluations of Static Application Security Testing Tools","authors":"Gaojian Hao, Feng Li, Wei Huo, Qing Sun, Wei Wang, Xinhua Li, Wei Zou","doi":"10.1109/TASE.2019.00-18","DOIUrl":"https://doi.org/10.1109/TASE.2019.00-18","url":null,"abstract":"When evaluating Static Application Security Testing (SAST) tools, benchmarks based on real-world softwares are considered more representative than synthetic micro benchmarks. Generated from real-world software, the test cases in such kind of benchmarks usually contain multiple syntactic features which affect the vulnerability detection results reflecting SAST tools' capabilities in real-world settings. However, most existing benchmarks based on real-world software pay little attention to these syntactic features so that only limited information about the capabilities of SAST tools can be obtained from the evaluation results. In this paper, we provide a method of constructing benchmarks and evaluating SAST tools, which leverages the syntactic features to support the evaluation to be more explainable. To demonstrate the effectiveness, we applied our method to the benchmark built by Misha Zitser et al., generated 10 groups of test cases, and evaluated 2 SAST tools with them. The result shows that, with the benchmark constructed by our method, the evaluation could be more explainable which helps us to gain more information about the SAST tools' capabilities of vulnerability detection.","PeriodicalId":183749,"journal":{"name":"2019 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129710083","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}

引用次数: 5

Optimized Step Semantics Encoding for Bounded Model Checking of Timed Automata 时间自动机有界模型检验的优化步进语义编码

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/TASE.2019.00-14

Zuxi Chen, Huixing Fang, Xiangyu Luo

引用次数: 0

Handling Refinement of Continuous Behaviors: A Proof Based Approach with Event-B 处理连续行为的细化:基于Event-B的证明方法

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/TASE.2019.00-25

G. Dupont, Y. A. Ameur, M. Pantel, N. Singh

{"title":"Handling Refinement of Continuous Behaviors: A Proof Based Approach with Event-B","authors":"G. Dupont, Y. A. Ameur, M. Pantel, N. Singh","doi":"10.1109/TASE.2019.00-25","DOIUrl":"https://doi.org/10.1109/TASE.2019.00-25","url":null,"abstract":"Cyber-physical systems (CPS) are taking a crucial role in various areas of our society and industry. Yet, because of their hybrid nature (i.e. the integration of both continuous and discrete features), their design and verification are not easy to handle, in particular when they are part of a critical system. Their certification requires to exhibit a formal argumentation that formal methods should be able to provide. This paper addresses the formal development of CPS using correct-by-construction refinement and proof based approaches. It relies on the Event-B formal method. In addition to modeling both the discrete and continuous parts of a CPS, this paper presents a novel approach in two steps. First it shows that the generic formal model we have defined, integrating both discrete and continuous behaviors, can be instantiated by various kinds of CPS. Fundamentally, continuous behaviors modeled by differential equations mingle with discrete transition systems (mode automaton), which model discrete behaviors. Here, refinement is used as a decomposition mechanism. Second, it expands the refinement operation, well mastered in the discrete world, to cover continuous behaviors. We show that different levels of abstraction of continuous aspects can be glued in a refinement chain. The proposed approach has been completely formalized using Event-B on the Rodin platform and a case study based on water tanks is used to illustrate it.","PeriodicalId":183749,"journal":{"name":"2019 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133096928","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}

引用次数: 10

Stuttering for Markov Automata 马尔可夫自动机的口吃

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/TASE.2019.000-7

Arpit Sharma

引用次数: 2

Verifying Opacity of a Modified PSTM 验证修改后的PSTM的不透明度

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/TASE.2019.00008

Yucheng Fang, Huibiao Zhu, Jiaqi Yin

引用次数: 0

A Co-Occurrence Recommendation Model of Software Security Requirement 软件安全需求的共生推荐模型

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/TASE.2019.00-21

Yi Xu, Weimin Ge, Xiaohong Li, Zhiyong Feng, Xiaofei Xie, Yude Bai

引用次数: 3