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

Formal specification of security guidelines for program certification 程序认证安全指南的正式规范

2017 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2017-09-13 DOI: 10.1109/TASE.2017.8285634

Zeineb Zhioua, Y. Roudier, R. Ameur-Boulifa

{"title":"Formal specification of security guidelines for program certification","authors":"Zeineb Zhioua, Y. Roudier, R. Ameur-Boulifa","doi":"10.1109/TASE.2017.8285634","DOIUrl":"https://doi.org/10.1109/TASE.2017.8285634","url":null,"abstract":"Secure software can be obtained out of two distinct processes: security by design, and security by certification. The former approach has been quite extensively formalized as it builds upon models, which are verified to ensure security properties are attained and from which software is then derived manually or automatically. In contrast, the latter approach has always been quite informal in both specifying security best practices and verifying that the code produced conforms to them. In this paper, we focus on the latter approach and describe how security guidelines might be captured by security experts and verified formally by developers. Our technique relies on abstracting actions in a program based on modularity, and on combining model checking together with information flow analysis. Our goal is to formalize the existing body of knowledge in security best practices using formulas in the MCL language and to conduct formal verifications of the conformance of programs with such security guidelines. We also discuss our first results in creating a methodology for the formalization of security guidelines.","PeriodicalId":221968,"journal":{"name":"2017 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132046921","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

Formal verification of user-level real-time property patterns 用户级实时属性模式的正式验证

2017 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2017-09-13 DOI: 10.1109/TASE.2017.8285630

Ning Ge, M. Pantel, Silvano Dal-Zilio

引用次数: 3

Time-sensitive information flow control in timed event-B 定时事件 B 中的时敏信息流控制

2017 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2017-09-13 DOI: 10.1109/TASE.2017.8285631

C. Mu, S. Qin

{"title":"Time-sensitive information flow control in timed event-B","authors":"C. Mu, S. Qin","doi":"10.1109/TASE.2017.8285631","DOIUrl":"https://doi.org/10.1109/TASE.2017.8285631","url":null,"abstract":"Protecting confidential data in today's computing environments is an important problem. Information flow control can help to avoid information leakage and violations introduced by executing the software applications. In software development cycle, it is important to handle security related issues from the beginning specifications at the level of abstract. Mu [1] investigated the problem of preserving information flow security in the Event-B specification models. A typed Event-B model was presented to enforce information flow security and to prevent direct flows introduced by the system. However, in practice, timing behaviours of programs can also introduce a covert flow. The problem of run-time flow monitoring and controlling must also be addressed. This paper investigates information flow control in the Event-B specification language with timing constructs. We present a timed Event-B system by introducing timers and relevant time constraints into the system events. We suggest a time-sensitive flow security condition for the timed Event-B systems, and present a type system to close the covert channels of timing flows for the system by ensuring the security condition. We then investigate how to refine timed events during the stepwise refinement modelling to satisfy the security condition.","PeriodicalId":221968,"journal":{"name":"2017 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130773278","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

Formal development process of safety-critical embedded human machine interface systems 安全关键型嵌入式人机界面系统的正式开发过程

2017 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2017-09-13 DOI: 10.1109/TASE.2017.8285636

Ning Ge, Arnaud Dieumegard, E. Jenn, Bruno d'Ausbourg, Y. A. Ameur

引用次数: 8

Assembly program verification for multiprocessors with relaxed memory model using SMT solver 用SMT求解器验证具有宽松内存模型的多处理器汇编程序

2017 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2017-09-01 DOI: 10.1109/TASE.2017.8285629

Pattaravut Maleehuan, Yuki Chiba, Toshiaki Aoki

引用次数: 1

Optimizing backbone filtering 优化骨干过滤

2017 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2017-09-01 DOI: 10.1109/TASE.2017.8285627

Yueling Zhang, Jianwen Li, Min Zhang, G. Pu, Fu Song

{"title":"Optimizing backbone filtering","authors":"Yueling Zhang, Jianwen Li, Min Zhang, G. Pu, Fu Song","doi":"10.1109/TASE.2017.8285627","DOIUrl":"https://doi.org/10.1109/TASE.2017.8285627","url":null,"abstract":"Backbone is the common part of each solution in a given propositional formula, which is a key to improving the performance of SAT solving and SAT-based applications, such as model checking and program analysis. In this paper, we propose an optimized approach that combines implication-driven (IDF), conflict-driven (CDF), and unique-driven (UDF) heuristics to improve backbone computing. IDF uses the particular binary structure of the form a ↔ b ∧ c to find more backbone literals. CDF comes from the observation that for a clause ¬a ∨ b, if a is a backbone literal, then b is also a backbone literal. Besides CDF, we are also able to detect new non-backbone literals by UDF. A literal l is not a backbone literal, if there is no clause Φ ∊ Φ that is only satisfied by l. We implemented our approach in a tool named DUCIBone with the above optimizations (IDF+CDF+UDF), and conducted experiments on formulas used in previous work and SAT competitions (2015, 2016). Results demonstrate that DUCIBone solved 4% (507 formulas) more formulas than minibones (minibones-RLD, 490 formulas) does under its best configuration. Among 486 formulas solved by all tools (DUCIBone, minibones-RLD, minibonescb100), DUCIBone reduced 7% (35131 seconds) than minibones (37454 seconds). Experiments indicate that the advantage of DUCIBone is more obvious when the formulas are harder.","PeriodicalId":221968,"journal":{"name":"2017 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128189564","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

On the semantics of temporal specifications of component-behavior for dynamic architectures 动态体系结构中构件行为时态规范的语义研究

2017 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2017-09-01 DOI: 10.1109/TASE.2017.8285638

Diego Marmsoler

引用次数: 9

A bounded multi-dimensional modal logic for autonomous cars based on local traffic and estimation 基于局部交通和估计的自动驾驶汽车有界多维模态逻辑

2017 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2017-09-01 DOI: 10.1109/TASE.2017.8285637

Bingqing Xu, Qin Li

{"title":"A bounded multi-dimensional modal logic for autonomous cars based on local traffic and estimation","authors":"Bingqing Xu, Qin Li","doi":"10.1109/TASE.2017.8285637","DOIUrl":"https://doi.org/10.1109/TASE.2017.8285637","url":null,"abstract":"The decision-making module on an autonomous car is usually a periodic program. In every cycle, the program makes a decision such as acceleration, brake, initiating a lane change process or a turn process based on the current traffic information gathered from car sensors. In urban traffic with mixed type of vehicles, the real-time performance requirement is critical for the decision-making program while acquiring global knowledge of the traffic is less practical. In such an environment, communications between vehicles are unreliable and time-consuming, so it is often difficult to know the exact driving decisions of other cars in the next cycle. In order to guarantee safety, a feasible solution requires the reasonable estimation on the driving decisions of other cars in the near future. In this paper, we propose a BMML (Bounded Multi-dimensional Modal Logic) to specify the traffic situations with spatio-temproral properties taking account of the estimated evolvement on them in the near future. The logic contains a primitive spatial logic with navigation operators and estimation operators as modal operators. The satisfaction of a BMML formula depends on a snapshot of the current traffic condition and an estimation structure capturing the believed information on the driving decisions of other cars. Given a snapshot and an estimation structure, the satisfaction of a BMML formula can be determined with simple and deterministic reasoning, so it is feasible for taking a BMML formula as the guard condition of the decision-making program of an autonomous car. The usage of BMML is illustrated with a series of small examples.","PeriodicalId":221968,"journal":{"name":"2017 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125572297","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

Two under-approximation techniques for 3-modal abstraction coverage of event systems: Joint effort? 事件系统三模态抽象覆盖的两种欠近似技术:共同努力?

2017 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2017-09-01 DOI: 10.1109/TASE.2017.8285632

J. Julliand, O. Kouchnarenko, P. Masson, G. Voiron

引用次数: 2

Automatic fine-grained locking generation for shared data structures 为共享数据结构自动生成细粒度锁

2017 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2017-09-01 DOI: 10.1109/TASE.2017.8285633

Haiyang Liu, Tingting Hu, Z. Qiu

引用次数: 0