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

Modeling and Verifying Transaction Scheduling for Software Transactional Memory using CSP 基于CSP的软件事务性内存事务调度建模与验证

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

Chao Xu, Xi Wu, Huibiao Zhu, M. Popovic

{"title":"Modeling and Verifying Transaction Scheduling for Software Transactional Memory using CSP","authors":"Chao Xu, Xi Wu, Huibiao Zhu, M. Popovic","doi":"10.1109/TASE.2019.00009","DOIUrl":"https://doi.org/10.1109/TASE.2019.00009","url":null,"abstract":"Transaction Memory (TM) is designed for simplifying parallel programming, while some key problems exist in it, such as starvation and reduced performance with high contention among transactions. In order to improve the performance of TM, researchers have designed several transaction scheduling algorithms and given their experimental results. However, the evaluations on the algorithms given by these researches are rather partial and lack of generality. Since these experimental results ignore the verification of properties which are necessary for transaction scheduling and could be greatly affected by the execution environment, thus it is still challenging for us to judge the quality of the algorithms for TM. In this paper, we provide a formal approach to evaluate transaction scheduling algorithms in a more comprehensive and strict way. We choose three recently proposed algorithms as motivating examples and formalize them using the process algebra CSP. We also use a model checker PAT to verify the properties (e.g., deadlock freeness and starvation freeness) of the models. Besides, it is also easier to compare the performance of the algorithms, from the perspective of makespan, speedup, aborts time and throughput, based on the statistics given by PAT. Consequently, a formal approach can be achieved to evaluate transaction scheduling algorithms, which is also a good guide for the further design of the algorithms for TM.","PeriodicalId":183749,"journal":{"name":"2019 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"32 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":"133648922","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}

引用次数: 4

Understanding Ineffective Events and Reducing Test Sequences for Android Applications 理解无效事件并减少Android应用程序的测试序列

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

Ping Wang, Jiwei Yan, Xi Deng, Jun Yan, Jian Zhang

{"title":"Understanding Ineffective Events and Reducing Test Sequences for Android Applications","authors":"Ping Wang, Jiwei Yan, Xi Deng, Jun Yan, Jian Zhang","doi":"10.1109/TASE.2019.00012","DOIUrl":"https://doi.org/10.1109/TASE.2019.00012","url":null,"abstract":"Monkey, which is integrated with the Android system, becomes the most widely used test input generation tool, owing to the simplicity, effectiveness and good compatibility. However, Monkey is based on coordinates of screen and oblivious to the widgets and the GUI states, which results in a great many ineffective events that have no contribution to the test. To address the major drawbacks, this paper parses the events of 200 test sequences generated by Monkey into human-readable scripts and manually investigate the effects of these events. We find three types of patterns on the ineffective events, including no-ops, single and combination of effect-free ones, and summarize them into ten rules for sequence reduction. Then, we implement a tool CHARD to match these patterns in real-world traces and prune the redundant events. The evaluation on 923 traces from various apps covering 16 categories shows that CHARD can process 1,000 events in a few seconds and identifies 41.3% events as ineffective ones. Meanwhile, the reduced sequence keeps the same functionality with the original one that can trigger the same behaviors. Our work can be applied to lessen the diagnose effort for record-and-replay, and as a preprocessing step for other works on analyzing sequences. For instance, CHARD can remove 72.6% ineffective events and saves 67.6% time of delta debugging in our experiments.","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":"130552028","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

Certified Embedding of B Models in an Integrated Verification Framework 集成验证框架中B模型的认证嵌入

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

Alexandra Halchin, Y. A. Ameur, N. Singh, Abderrahmane Feliachi, J. Ordioni

{"title":"Certified Embedding of B Models in an Integrated Verification Framework","authors":"Alexandra Halchin, Y. A. Ameur, N. Singh, Abderrahmane Feliachi, J. Ordioni","doi":"10.1109/TASE.2019.000-4","DOIUrl":"https://doi.org/10.1109/TASE.2019.000-4","url":null,"abstract":"To check the correctness of heterogeneous models of a complex critical system is challenging to meet the certification standard. Such guarantee can be provided by embedding the heterogeneous models into an integrated modelling framework. This work is proposed in the B-PERFect project of RATP (Parisian Public Transport Operator and Maintainer), it aims to apply formal verification using the PERF approach on the integrated safety-critical software related to railway domain expressed in a single modelling language: HLL. This paper presents a certified translation from B formal language to HLL. The proposed approach uses HOL as a unified logical framework to describe the formal semantics and to formalize the translation relation of both languages. The developed Isabelle/HOL models are proved in order to guarantee the correctness of our translation process. Moreover, we have also used weak-bisimulation relation to check the correctness of translation steps. The overall approach is illustrated through a case study issued from a railway software system: onboard localization function. Furthermore, it discusses the integrated verification at system level.","PeriodicalId":183749,"journal":{"name":"2019 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"16 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":"134402285","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}

引用次数: 6

Efficient Counter-factual Type Error Debugging 有效的反事实类型错误调试

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

Sheng Chen, Baijun Wu

{"title":"Efficient Counter-factual Type Error Debugging","authors":"Sheng Chen, Baijun Wu","doi":"10.1109/TASE.2019.00-13","DOIUrl":"https://doi.org/10.1109/TASE.2019.00-13","url":null,"abstract":"Type inference is an important part of functional programming languages and has been increasingly adopted to imperative programming. However, providing effective error messages in response to type inference failures (due to type errors in programs) continues to be a challenge. Type error messages generated by compilers and existing error debugging approaches often point to bogus error locations or lack sufficient information for removing the type error, making error debugging ineffective. Counter-factual typing (CFT) addressed this problem by generating comprehensive error messages with each message includes a rich set of information. However, CFT has a large response time, making it too slow for interactive use. In particular, our recent study shows that programmers usually have to go through multiple iterations of updating and recompiling programs to remove a type error. Interestingly, our study also reveals that program updates are minor in each iteration during type error debugging. We exploit this fact and develop eCFT, an efficient version of CFT, which doesn't recompute all error fixes from scratch for each updated program but only recomputes error fixes that are changed in response to the update. Our key observation is that minor program changes lead to minor error suggestion changes. eCFT is based on principal typing, a typing scheme more amenable to reuse previous typing results. We have evaluated our approach and found it is about 12.4× faster than CFT in updating error fixes.","PeriodicalId":183749,"journal":{"name":"2019 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"20 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":"131892207","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

Non-Intrusive MC/DC Measurement Based on Traces 基于走线的非侵入式MC/DC测量

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

Faustin Ahishakiye, S. Jaksic, F. D. Lange, Malte Schmitz, V. Stolz, Daniel Thoma

引用次数: 3

Identify Blackboard Pattern Based on Ontology 基于本体的黑板模式识别

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

Lihui Tang, Lulu Wang, Bixin Li

引用次数: 0

A Logical Approach for the Schedulability Analysis of CCSL CCSL可调度性分析的逻辑方法

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

Yuanrui Zhang, F. Mallet, Huibiao Zhu, Yixiang Chen

引用次数: 2

Learning-based Probabilistic Modeling and Verifying Driver Behavior using MDP 基于学习的概率建模及基于MDP的驾驶员行为验证

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

Xin Bai, Chenghao Xu, Yi Ao, Biao Chen, Dehui Du

{"title":"Learning-based Probabilistic Modeling and Verifying Driver Behavior using MDP","authors":"Xin Bai, Chenghao Xu, Yi Ao, Biao Chen, Dehui Du","doi":"10.1109/TASE.2019.000-6","DOIUrl":"https://doi.org/10.1109/TASE.2019.000-6","url":null,"abstract":"Assisted driving has always been a hot research issue. The existing work mainly focuses on modeling vehicles behavior. However, there still lacks research work of modeling and verifying driver behavior. To solve these problems, we are committed to modeling and analyzing the driver behavior with Markov Decision Process (MDP). The aim is to achieve safe driving by monitoring and predicting the driver's states. In this paper, we propose a novel approach to construct MDP models of driver behavior. It comprises four phases: (1) data preprocessing using Convolutional Neural Network (CNN), wherein we adopt CNN to extract the features of driver behavior with the simulation data; (2) Bayes-based learning, wherein we construct a training set and use the Naive Bayes algorithm to train the State Prediction Model (SPM); (3) MDP generating, wherein we propose an algorithm to generate MDP models for the driver behavior with the help of SPM; and (4) quantitative analysis, wherein we analyze the uncertain behavior of the driver with probabilistic model checking technology. The main novelty of our work is to model and verify the driver behavior by integrating the learning and the model checking technology. To implement our approach, we have developed the MDP generator. Moreover, the quantitative analyses of the driver behavior are conducted with the model checker PRISM. The experiment results show that our approach facilitates generating MDP models, which helps to model and analyze the uncertain behavior of the driver.","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":"128755635","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

Using Recurrent Neural Network to Predict Tactics for Proving Component Connector Properties in Coq 基于递归神经网络的Coq组件连接件性能验证预测策略

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

Xiyue Zhang, Yi Li, Weijiang Hong, Mengyong Sun

引用次数: 3

Verifying the Relationship Among Three Descriptions in Problem Frames Using CSP 用CSP验证问题框架中三个描述之间的关系

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

Xiaohong Chen, Xi Wu, Mengyao Zhao, Haiying Sun

引用次数: 1