发布求助
文献互助 智能选刊 最新文献

2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)最新文献

筛选
英文 中文
Probabilistic Reachability for Uncertain Stochastic Hybrid Systems via Gaussian Processes 基于高斯过程的不确定随机混合系统的概率可达性
2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE) Pub Date : 2020-12-02 DOI: 10.1109/MEMOCODE51338.2020.9315182
M. Vasileva, F. Shmarov, P. Zuliani
{"title":"Probabilistic Reachability for Uncertain Stochastic Hybrid Systems via Gaussian Processes","authors":"M. Vasileva, F. Shmarov, P. Zuliani","doi":"10.1109/MEMOCODE51338.2020.9315182","DOIUrl":"https://doi.org/10.1109/MEMOCODE51338.2020.9315182","url":null,"abstract":"Cyber-physical system models often feature stochastic behaviour that itself depends on uncertain parameters (e.g., transition rates). For these systems, verifying reachability amounts to computing a range of probabilities depending on how uncertainty is resolved. In general, this is a hard problem for which rigorous solutions suffer from the well-known curse of dimensionality. In this paper we focus on hybrid systems with random parameters whose distribution is subject to nondeterministic uncertainty. We show that for these systems the reachability probability is a smooth function of the nondeterministic parameters, and thus Gaussian processes can be used to approximate the reachability probability function itself very efficiently over its entire domain. Furthermore, we introduce a novel approach that exploits rigorous probability enclosures for training Gaussian processes. We apply our approaches to non-trivial hybrid systems case studies, and we empirically demonstrate their advantages with respect to standard statistical model checking.","PeriodicalId":212741,"journal":{"name":"2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124631114","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
Security Types for Synchronous Data Flow Systems 同步数据流系统的安全类型
2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE) Pub Date : 2020-12-02 DOI: 10.1109/MEMOCODE51338.2020.9315053
Sanjiva Prasad, R. Yerraguntla, Subodh Sharma
{"title":"Security Types for Synchronous Data Flow Systems","authors":"Sanjiva Prasad, R. Yerraguntla, Subodh Sharma","doi":"10.1109/MEMOCODE51338.2020.9315053","DOIUrl":"https://doi.org/10.1109/MEMOCODE51338.2020.9315053","url":null,"abstract":"Synchronous reactive data flow is a paradigm that provides a high-level abstract programming model for embedded and cyber-physical systems, including the locally synchronous components of IoT systems. Security in such systems is severely compromised due to low-level programming, ill-defined interfaces and inattention to security classification of data. By incorporating a Denning-style lattice-based secure information flow framework into a synchronous reactive data flow language, we provide a framework in which correct-and-secure-by-construction implementations for such systems can be specified and derived. In particular, we propose an extension of the Lustre programming framework with a security type system. We prove the soundness of our type system with respect to the co-inductive operational semantics of Lustre by showing that well-typed programs exhibit non-interference.","PeriodicalId":212741,"journal":{"name":"2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129505792","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
Lightweight Formal Method for Robust Routing in Track-based Traffic Control Systems 基于轨道的交通控制系统鲁棒路由的轻量级形式化方法
2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE) Pub Date : 2020-12-02 DOI: 10.1109/MEMOCODE51338.2020.9315135
Maryam Bagheri, Edward A. Lee, Eunsuk Kang, M. Sirjani, Ehsan, Khamespanah, A. Movaghar
{"title":"Lightweight Formal Method for Robust Routing in Track-based Traffic Control Systems","authors":"Maryam Bagheri, Edward A. Lee, Eunsuk Kang, M. Sirjani, Ehsan, Khamespanah, A. Movaghar","doi":"10.1109/MEMOCODE51338.2020.9315135","DOIUrl":"https://doi.org/10.1109/MEMOCODE51338.2020.9315135","url":null,"abstract":"In this paper, we propose a robust solution for the path planning and scheduling of the moving objects in a Track-based Traffic Control System (TTCS). The moving objects in a TTCS pass over pre-specified sub-tracks. Each sub-track accommodates at most one moving object in-transit. Due to the uncertainties in the context of a TTCS, we assign an arrival time window to each moving object for each sub-track in its route, instead of an exact value. The moving object can safely enter into the sub-track in the mentioned time window. To develop a safe plan, we adapt the tagged-signal model and provide a rigorous mathematical formalism for the actor model of a TTCS. To illustrate the applicability of the provided semantics, we provide a formal model of TTCSs in the Alloy language and use its analyzer to verify the developed model against system safety properties.","PeriodicalId":212741,"journal":{"name":"2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133904919","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
Dependence Analysis and Automated Partitioning for Scalable Formal Analysis of SystemC Designs 系统设计可伸缩形式化分析的依赖分析和自动划分
2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE) Pub Date : 2020-12-02 DOI: 10.1109/MEMOCODE51338.2020.9314998
Paula Herber, Timm Liebrenz
{"title":"Dependence Analysis and Automated Partitioning for Scalable Formal Analysis of SystemC Designs","authors":"Paula Herber, Timm Liebrenz","doi":"10.1109/MEMOCODE51338.2020.9314998","DOIUrl":"https://doi.org/10.1109/MEMOCODE51338.2020.9314998","url":null,"abstract":"Embedded systems often consist of deeply intertwined hardware and software components. At the same time, they are often used in safety-critical applications, where an error may result in enormous costs or even loss of human lives. Existing verification techniques that show the absence of errors do not scale well for complex integrated HW/SW systems. In this paper, we present a dependence analysis and automated partitioning approach for the formal analysis of HW/SW codesigns that are modeled in SystemC. The key idea of our approach is threefold: first, we partition a given system into loosely coupled submodels. Second, we analyze the dependences between these submodels and compute an abstract verification interface for each of them, which captures all possible influences of all other submodels. Third, we verify global properties of the overall system by verifying them separately for each subsystem. We demonstrate that our approach significantly reduces verification times and increases scalability with results for an anti-lock braking system.","PeriodicalId":212741,"journal":{"name":"2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131738945","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
Bayesian Statistical Model Checking for Continuous Stochastic Logic 连续随机逻辑的贝叶斯统计模型检验
2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE) Pub Date : 2020-12-02 DOI: 10.1109/MEMOCODE51338.2020.9315001
Ratan Lal, Weikang Duan, P. Prabhakar
{"title":"Bayesian Statistical Model Checking for Continuous Stochastic Logic","authors":"Ratan Lal, Weikang Duan, P. Prabhakar","doi":"10.1109/MEMOCODE51338.2020.9315001","DOIUrl":"https://doi.org/10.1109/MEMOCODE51338.2020.9315001","url":null,"abstract":"In this paper, we propose a Bayesian approach to statistical model-checking (SMC) of discrete-time Markov chains with respect to continuous stochastic logic (CSL) specifications. While Bayesian approaches for simpler logic without nested probabilistic operators and Frequentist approaches for nested logic have been previously explored, the Bayesian approach for CSL consisting of nested probabilistic operators has not been addressed. The challenge in the nested case arises from the fact that unlike in probabilistic model-checking (PMC), where we obtain a definitive answer for the model-checking problem for the sub-formulas, instead, we only obtain a correct answer with a certain confidence, which needs to be factored into the recursive SMC algorithm. Here, we propose a Bayesian test based algorithm for CSL that has nested probabilistic operators. We have implemented our algorithm in a Python Toolbox. Our experimental evaluation shows that our Bayesian SMC approach performs better than both the frequentist SMC approach and PMC algorithms.","PeriodicalId":212741,"journal":{"name":"2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","volume":"72 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114023146","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
Cephalopode: A custom processor aimed at functional language execution for IoT devices. Cephalopode:针对物联网设备的功能语言执行的自定义处理器。
2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE) Pub Date : 2020-12-02 DOI: 10.1109/MEMOCODE51338.2020.9315094
J. Pope, Jules Saget, C. Seger
{"title":"Cephalopode: A custom processor aimed at functional language execution for IoT devices.","authors":"J. Pope, Jules Saget, C. Seger","doi":"10.1109/MEMOCODE51338.2020.9315094","DOIUrl":"https://doi.org/10.1109/MEMOCODE51338.2020.9315094","url":null,"abstract":"The Internet of Things (IoT) conceives a future where \"things\" are interconnected by means of suitable information and communication technologies. Unfortunately, recent events have demonstrated the high vulnerability of IoT. One of the main reasons for this is the use of low-level programming languages. The Octopi project is developing technologies to easily and securely program IoT devices by the use of functional high-level languages. Unfortunately, a traditional implementation of a modern functional language that runs on traditional hardware is very resource demanding. So resource demanding that few, if any, IoT devices can run them.In the Cephalopode project (which is a subproject of Octopi) we are exploring the implementation of a very low power hardware device directly aimed at running a high-level functional language. By integrating many resource-heavy tasks into dedicated hardware, we aim at creating an execution engine for IoT devices that will allow secure programming.","PeriodicalId":212741,"journal":{"name":"2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133145125","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
Safe and efficient collision avoidance control for autonomous vehicles 自动驾驶汽车安全高效的避碰控制
2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE) Pub Date : 2020-08-10 DOI: 10.1109/MEMOCODE51338.2020.9315034
Qiang Wang, Dachuan Li, J. Sifakis
{"title":"Safe and efficient collision avoidance control for autonomous vehicles","authors":"Qiang Wang, Dachuan Li, J. Sifakis","doi":"10.1109/MEMOCODE51338.2020.9315034","DOIUrl":"https://doi.org/10.1109/MEMOCODE51338.2020.9315034","url":null,"abstract":"We study a novel principle for safe and efficient collision avoidance that adopts a mathematically elegant and general framework making as much as possible abstraction of the controlled vehicle’s dynamics and of its environment. Vehicle dynamics is characterized by pre-computed functions for accelerating and braking to a given speed. Environment is modeled by a function of time giving the free distance ahead of the controlled vehicle under the assumption that the obstacles are either fixed or are moving in the same direction. The main result is a control policy enforcing the vehicle’s speed so as to avoid collision and efficiently use the free distance ahead, provided some initial safety condition holds.The studied principle is applied to the design of a synchronous controller. We show that the controller is safe by construction. Furthermore, we show that the efficiency strictly increases for decreasing granularity of discretization. We present the implementation and experimental evaluations in the Carla autonomous driving simulator and investigate various performance issues.","PeriodicalId":212741,"journal":{"name":"2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125757571","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
Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions 具有时间触发过渡的参数线性混合系统的有效可达性分析
2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE) Pub Date : 2020-06-22 DOI: 10.1109/MEMOCODE51338.2020.9314994
M. Forets, Daniel Freire, Christian Schilling
{"title":"Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions","authors":"M. Forets, Daniel Freire, Christian Schilling","doi":"10.1109/MEMOCODE51338.2020.9314994","DOIUrl":"https://doi.org/10.1109/MEMOCODE51338.2020.9314994","url":null,"abstract":"Efficiently handling time-triggered and possibly nondeterministic switches for hybrid systems reachability is a challenging task. In this paper we focus on periodically controlled systems with fast-switching controller dynamics, which often require simulation time scales of the order of nanoseconds. Accurate set-based computations for such systems with relatively large time horizons are expensive due to the accumulation of errors in the discrete transitions. We present an approach based on conservative set-based enclosure of the dynamics that can handle systems with uncertain parameters and inputs. We demonstrate our algorithm on the plant model of an experimental electro-mechanical braking system with periodic controller.","PeriodicalId":212741,"journal":{"name":"2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127493407","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
REAFFIRM: Model-Based Repair of Hybrid Systems for Improving Resiliency 重申:基于模型的混合动力系统修复，以提高弹性
2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE) Pub Date : 2019-02-09 DOI: 10.1109/MEMOCODE51338.2020.9315153
L. V. Nguyen, G. Mohan, James Weimer, O. Sokolsky, Insup Lee, R. Alur
{"title":"REAFFIRM: Model-Based Repair of Hybrid Systems for Improving Resiliency","authors":"L. V. Nguyen, G. Mohan, James Weimer, O. Sokolsky, Insup Lee, R. Alur","doi":"10.1109/MEMOCODE51338.2020.9315153","DOIUrl":"https://doi.org/10.1109/MEMOCODE51338.2020.9315153","url":null,"abstract":"Model-based design offers a promising approach for assisting developers to build reliable and secure cyber-physical systems in a systematic manner. In this methodology, a designer first constructs a model, with mathematically precise semantics, of the system under design, and performs extensive analysis with respect to correctness requirements before generating the implementation from the model. However, as new vulnerabilities are discovered, requirements evolve aimed at ensuring resiliency. There is currently a shortage of an inexpensive, automated software that can effectively repair the initial design, and a model-based system developer regularly needs to redesign and reimplement the system from scratch. In this paper, we propose a new methodology along with a MATLAB software called REAFFIRM to facilitate the model-based repair for improving the resiliency of cyber-physical systems. REAFFIRM takes as inputs 1) an original hybrid system modeled as a Simulink/Stateflow diagram, 2) a given resiliency pattern specified as a model transformation script, and 3) a safety requirement expressed as a Signal Temporal Logic formula, and outputs a repaired model which satisfies the requirement. The tool consists of two main modules, model transformation followed by model synthesis. While the latter component is built on top of the falsification tool Breach, to implement the former, we introduce a new model transformation language for hybrid systems, which we call HATL, to allow a designer to specify resiliency patterns. To evaluate the proposed approach, we use REAFFIRM to automatically synthesize the repaired models of four different case studies.","PeriodicalId":212741,"journal":{"name":"2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124989542","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
首页 上一页
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学术文献互助群
群 号：481959085
Book学术官方微信