2017 IEEE/ACM 5th International FME Workshop on Formal Methods in Software Engineering (FormaliSE)最新文献

筛选
英文 中文
Verifying the Reliability of Operating System-Level Information Flow Control Systems in Linux 验证Linux操作系统级信息流控制系统的可靠性
Laurent Georget, M. Jaume, F. Tronel, G. Piolle, Valérie Viet Triem Tong
{"title":"Verifying the Reliability of Operating System-Level Information Flow Control Systems in Linux","authors":"Laurent Georget, M. Jaume, F. Tronel, G. Piolle, Valérie Viet Triem Tong","doi":"10.1109/FormaliSE.2017.1","DOIUrl":"https://doi.org/10.1109/FormaliSE.2017.1","url":null,"abstract":"Information Flow Control at Operating System (OS) level features interesting properties and have been an active topic of research for years. However, no implementation can work reliably if there does not exist a way to correctly and precisely track all information flows occurring in the system. The existing implementations for Linux are based on the Linux Security Modules (LSM) framework which implements hooks at specific points in code where any security mechanism may interpose a security decision in the execution. However, previous works on the verification of LSM only addressed access control and no work has raised the question of the reliability of information flow control systems built on LSM@. In this work, we present a compiler-assisted and reproducible static analysis on the Linux kernel to verify that the LSM hooks are correctly placed with respect to operations generating information flows so that LSM-based information flow monitors can properly track all information flows. Our results highlight flaws in LSM that we propose to solve, thus improving the suitability of this framework for the implementation of information flow monitors.","PeriodicalId":266540,"journal":{"name":"2017 IEEE/ACM 5th International FME Workshop on Formal Methods in Software Engineering (FormaliSE)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126587121","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}
引用次数: 16
Using BDD and SBVR to Refine Business Goals into an Event-B Model: A Research Idea 使用BDD和SBVR将业务目标细化为Event-B模型:一个研究思路
F. Siqueira, T. Sousa, P. S. M. Silva
{"title":"Using BDD and SBVR to Refine Business Goals into an Event-B Model: A Research Idea","authors":"F. Siqueira, T. Sousa, P. S. M. Silva","doi":"10.1109/FormaliSE.2017.5","DOIUrl":"https://doi.org/10.1109/FormaliSE.2017.5","url":null,"abstract":"The transition from a requirements document to a formal specification in Event-B is usually manual and ad-hoc. In order to bridge this gap, we propose a method based on Behavior-Driven Development, an agile approach, and that uses a structured natural language conformant to the formalism of the Semantics of Business Vocabulary and Business Rules (SBVR) standard. This method will successively refine a list of high-level business goals into an Event-B model using transformations. In this paper we present our research idea, describing the steps of this method and showing an example based on the Train System scenario described by Abrial.","PeriodicalId":266540,"journal":{"name":"2017 IEEE/ACM 5th International FME Workshop on Formal Methods in Software Engineering (FormaliSE)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115052634","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
A Trusted Approach to Design a Network Monitor 一种可信的网络监视器设计方法
Koichi Shimizu, Teruyoshi Yamaguchi, Tsunato Nakai, Takeshi Ueda, Nobuhiro Kobayashi, B. Boyer
{"title":"A Trusted Approach to Design a Network Monitor","authors":"Koichi Shimizu, Teruyoshi Yamaguchi, Tsunato Nakai, Takeshi Ueda, Nobuhiro Kobayashi, B. Boyer","doi":"10.1109/FormaliSE.2017.3","DOIUrl":"https://doi.org/10.1109/FormaliSE.2017.3","url":null,"abstract":"Cyber security has been an issue in industrial control systems (ICS) of critical infrastructures. Existing security measures for ordinary enterprise systems are hardly applicable to ICS because they have different requirements. In contrast, whitelisting network monitors attract wide attention as a security measure for ICS that meets the demand for availability during a long lifetime, as well as to exploit the static nature of system configuration. Once defined, the whitelist of allowed packets can detect ever-increasing new attacks without requiring any update. This paper presents a framework for developing reliable and secure whitelisting network monitors for ICS networks such as used in SCADA systems. The proposed approach relies on a model-based development combined with formal verification and proof steps, such that the normal communication model can be verified, the whitelist can be automatically generated from the model and the soundness of the network monitor program can be proven.","PeriodicalId":266540,"journal":{"name":"2017 IEEE/ACM 5th International FME Workshop on Formal Methods in Software Engineering (FormaliSE)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122443316","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
Model Checking for Mobile Android Malware Evolution 手机Android恶意软件演化的模型检测
A. Cimitile, Fabio Martinelli, F. Mercaldo, Vittoria Nardone, A. Santone, G. Vaglini
{"title":"Model Checking for Mobile Android Malware Evolution","authors":"A. Cimitile, Fabio Martinelli, F. Mercaldo, Vittoria Nardone, A. Santone, G. Vaglini","doi":"10.1109/FormaliSE.2017.4","DOIUrl":"https://doi.org/10.1109/FormaliSE.2017.4","url":null,"abstract":"Software engineering researchers have largely demonstrated that newer versions of software make use of previous versions of existing software. No exception to this rule for the so-called malicious software, that frequently evolves in order to evade the detection by antimalware. As matter of fact, mobile malicious programs, such as trojans, are frequently related to previous malware through evolutionary relationships. Discovering those relationships and constructing a phylogenetic model is expected to be helpful for analyzing new malware and for establishing a principled naming scheme. In this paper we propose a model checking based method to infer mobile malware phylogenetic trees. We demonstrate, implementing our approach in the droid-Sapiens tool, that mobile malware families come from an ancestor and they infuence own descendant, basing on the payload that they exhibit.","PeriodicalId":266540,"journal":{"name":"2017 IEEE/ACM 5th International FME Workshop on Formal Methods in Software Engineering (FormaliSE)","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121835423","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}
引用次数: 16
Correct Safety Critical Hardware Descriptions via Static Analysis and Theorem Proving 通过静态分析和定理证明正确的安全关键硬件描述
Nicholas Moore, M. Lawford
{"title":"Correct Safety Critical Hardware Descriptions via Static Analysis and Theorem Proving","authors":"Nicholas Moore, M. Lawford","doi":"10.1109/FormaliSE.2017.11","DOIUrl":"https://doi.org/10.1109/FormaliSE.2017.11","url":null,"abstract":"We propose a new method for embedding Bluespec SystemVerilog descriptions in PVS's higher-order proof logic. In contrast to previous embeddings, our approach accepts a greater subset of BSV and provides a far greater degree of automation. Our custom software tool transforms the action-oriented semantics of BSV to a state-centric Kripke structure, enabling automated theorem proving. We demonstrate our verification technique by applying it to one of the function blocks of the IEC 61131-3 standard for PLCs.","PeriodicalId":266540,"journal":{"name":"2017 IEEE/ACM 5th International FME Workshop on Formal Methods in Software Engineering (FormaliSE)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133365686","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
Efficient SAT-Based Software Analysis: From Automated Testing to Automated Verification and Repair 基于sat的高效软件分析:从自动化测试到自动化验证和修复
Nazareno Aguirre
{"title":"Efficient SAT-Based Software Analysis: From Automated Testing to Automated Verification and Repair","authors":"Nazareno Aguirre","doi":"10.1109/FormaliSE.2017.21","DOIUrl":"https://doi.org/10.1109/FormaliSE.2017.21","url":null,"abstract":"Formal approaches to software development have traditionally aimed at guaranteeing software correctness, through the use of notations, analysis mechanisms and other elements founded on solid mathematical grounds. Since the seminal works of Hoare, Floyd and others, formal methods have used logical notations to capture intended software behavior, and proposed techniques for reasoning about software correctness, originally mainly through deductive approaches. Formal methods for software development have been presented as a stronger correctness guarantee compared to informal, widely employed techniques such as testing. While advantages of formal methods make them appealing, the above-described original composition of formal methods implied two main difficulties for their effective use, namely, the need to dominate the logical notations used to specify intended software behavior, and mastering the associated deductive techniques necessary for analysis, i.e., for verifying software correctness.","PeriodicalId":266540,"journal":{"name":"2017 IEEE/ACM 5th International FME Workshop on Formal Methods in Software Engineering (FormaliSE)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130408097","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
Modeling Families of Public Licensing Services: A Case Study 公共许可服务家族建模:一个案例研究
G. Cledou, L. Barbosa
{"title":"Modeling Families of Public Licensing Services: A Case Study","authors":"G. Cledou, L. Barbosa","doi":"10.1109/FormaliSE.2017.8","DOIUrl":"https://doi.org/10.1109/FormaliSE.2017.8","url":null,"abstract":"Software Product Lines (SPLs) enable the development of families of software systems by taking advantage of the commonalities and variabilities of the members of the family. Despite its many advantages, it is an unexplored area in the electronic government domain, an area with evident families of services, and with high demands to develop faster and better services to citizens and businesses while reducing costs. This paper discusses the need of formal methods to model SPLs for such domain. It presents a case study of a family of public licensing services modeled in UPPAAL and based on Featured Timed Automata, an extension of Timed Automata to model real-time SPLs. It analyzes the suitability of FTA to model distributed families of services, while provides hints on a possible enrichment of FTA to better support modularization and compositionality of services.","PeriodicalId":266540,"journal":{"name":"2017 IEEE/ACM 5th International FME Workshop on Formal Methods in Software Engineering (FormaliSE)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130940279","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
Partition-Based Coverage Metrics and Type-Guided Search in Concolic Testing for JavaScript Applications 基于分区的覆盖度量和类型导向的搜索在JavaScript应用程序Concolic测试中
Sora Bae, Joonyoung Park, Sukyoung Ryu
{"title":"Partition-Based Coverage Metrics and Type-Guided Search in Concolic Testing for JavaScript Applications","authors":"Sora Bae, Joonyoung Park, Sukyoung Ryu","doi":"10.1109/FormaliSE.2017.10","DOIUrl":"https://doi.org/10.1109/FormaliSE.2017.10","url":null,"abstract":"JavaScript extends its uses from client-side web applications to mobile applications, but testing JavaScript applications is not yet satisfactory. Researchers have not spent much attention on testing JavaScript programs, and existing coverage metrics and testing mechanisms for C and Java may not be applicable to JavaScript because of its extremely dynamic semantics without any compile-time checks. Because, in JavaScript, any variable may have any kinds of types during evaluation, and because varying types change program execution flows, testing JavaScript programs requires more cases to cover different execution flows. Thus, test cases with 100% coverage levels in terms of the existing coverage metrics for statically typed languages may miss faults in JavaScript. Moreover, existing search strategies for statically typed languages may not exercise increased test requirements by dynamic languages effectively. In this paper, we identify JavaScript characteristics that make thorough testing of JavaScript programs more difficult than testing C and Java programs. To address such characteristics, we propose new partition-based coverage metrics that expose implicit execution flows using varying types. To generate test cases satisfying the coverage metrics effectively, we develop type-guided search strategies for concolic testing using program analysis results. We evaluate the new coverage metrics and search strategies for concolic testing with open-source web applications, and the preliminary experimental results show that their practical uses in JavaScript testing are promising.","PeriodicalId":266540,"journal":{"name":"2017 IEEE/ACM 5th International FME Workshop on Formal Methods in Software Engineering (FormaliSE)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128139418","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 ROS-Based Robotic Applications Using Timed-Automata 基于ros的定时自动机机器人应用的形式化验证
Raju Halder, J. Proença, Nuno Macedo, A. Santos
{"title":"Formal Verification of ROS-Based Robotic Applications Using Timed-Automata","authors":"Raju Halder, J. Proença, Nuno Macedo, A. Santos","doi":"10.1109/FormaliSE.2017.9","DOIUrl":"https://doi.org/10.1109/FormaliSE.2017.9","url":null,"abstract":"Robotic technologies are continuously transforming the domestic and the industrial environments. Recently the Robotic Operating System (ROS), has been widely adopted both by industry and academia, becoming one of the most popular middleware frameworks for developing robot applications. Guaranteeing the correct behaviour of robotic systems is, however, challenging due to their potential for parameterization and heterogeneity. Although different approaches exist, focusing on concrete domain spaces for specific scenarios, no general approach to reason about ROS systems has yet arisen. This paper proposes an approach to model and verify ROS systems using real time properties, focusing on one of the main features of ROS, the communication between nodes. It takes low-level parameters into account, such as queue sizes and timeouts, and uses timed automata as the modelling language. The robot Kobuki is used as a complex case study, over which properties are automatically verified using the UPPAAL model checker, enabling the identification of problematic parameter combinations.","PeriodicalId":266540,"journal":{"name":"2017 IEEE/ACM 5th International FME Workshop on Formal Methods in Software Engineering (FormaliSE)","volume":"19 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132792888","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}
引用次数: 42
A Generic Algorithm for Program Repair 一种通用的程序修复算法
Besma Khaireddine, Aleksandr Zakharchenko, A. Mili
{"title":"A Generic Algorithm for Program Repair","authors":"Besma Khaireddine, Aleksandr Zakharchenko, A. Mili","doi":"10.1109/FormaliSE.2017.7","DOIUrl":"https://doi.org/10.1109/FormaliSE.2017.7","url":null,"abstract":"Relative correctness is the property of a program to be more-correct than another with respect to a specification, whereas traditional (absolute) correctness distinguishes between two classes of candidate programs with respect to a specification (correct and incorrect), relative correctness defines a partial ordering between candidate programs, whose maximal elements are the (absolutely) correct programs. In this paper we argue that relative correctness ought to be an integral part of the study of program repair, as it plays for program repair the role that absolute correctness plays for program construction: in the same way that absolute correctness is the criterion by which we judge the process of deriving a program P from a specification R, we argue that relative correctness ought to be the criterion by which we judge the process of repairing a program P to produce a program P' that is more-correct than P with respect to R. In this paper we build on this premise to design a generic program repair algorithm, which proceeds by successive increases of relative correctness until we achieve absolute correctness. We further argue that in the same way that correctness ideas were used, a few decades ago, as a basis for correct-by-design programming, relative correctness ideas may be used, in time, as a basis for more-correct-by-design program repair.","PeriodicalId":266540,"journal":{"name":"2017 IEEE/ACM 5th International FME Workshop on Formal Methods in Software Engineering (FormaliSE)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121423000","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}
引用次数: 8
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书