2016 ACM/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)最新文献_第3页

Control-flow guided property directed reachability for imperative synchronous programs 命令式同步程序的控制流引导属性定向可达性

2016 ACM/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE) Pub Date : 2016-11-18 DOI: 10.1109/MEMCOD.2016.7797742

Xian Li, K. Schneider

{"title":"Control-flow guided property directed reachability for imperative synchronous programs","authors":"Xian Li, K. Schneider","doi":"10.1109/MEMCOD.2016.7797742","DOIUrl":"https://doi.org/10.1109/MEMCOD.2016.7797742","url":null,"abstract":"Property directed reachability (PDR) has been introduced as a very efficient verification method for synchronous hardware circuits that is based on induction rather than fixpoint iteration. However, hardware circuits are usually synthesized from more abstract high-level languages like synchronous languages (or synchronous subsets of hardware description languages). In this paper, we show that it is possible to derive from such high-level languages additional control-flow information that can be added to the transition relation to make PDR even more efficient. As will be shown, PDR can benefit from this additional information since many safety properties become inductive only with respect to the enhanced transition relations. The added control-flow information is not needed for the synthesis and is therefore not explicitly encoded in the generated systems, but it can be easily derived from the original programs and used for verification. We present two methods to compute additional control-flow information that differ in how precisely they approximate the reachable control-flow states and also in the runtime required for their computation.","PeriodicalId":180873,"journal":{"name":"2016 ACM/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115815269","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

Keynote talk III: Trusted cloud: How to make the cloud more secure 主题演讲III:可信云:如何使云更加安全

2016 ACM/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE) Pub Date : 2016-11-01 DOI: 10.1109/MEMCOD.2016.7797757

S. Rajamani

{"title":"Keynote talk III: Trusted cloud: How to make the cloud more secure","authors":"S. Rajamani","doi":"10.1109/MEMCOD.2016.7797757","DOIUrl":"https://doi.org/10.1109/MEMCOD.2016.7797757","url":null,"abstract":"Cloud computing is growing because of cost advantages and convenience it offers to customers. However, security and privacy continue to be major concerns. We wish to guard against a powerful adversary who can compromise the CloudOS, and uses all privileges of the CloudOS to compromise the integrity and confidentiality of user applications. Secure hardware and/or small trusted hypervisors are the main weapons in our arsenal to guard against such powerful adversaries. Secure hardware (such as Intel SGX) enables user mode applications to package code and data into regions that are isolated from all other software running on the machine. Isolated regions can also be implemented with a small trusted hypervisor. However, it is an open research question as to how entire cloud services can be built using trusted hardware as a primitive, while maintaining a small TCB, providing good performance and end-to-end security guarantees. The Trusted Cloud project at Microsoft Research explores ways to answer this question, and it builds on techniques spanning hardware, OS, compilers and verification tools. In this talk, I will describe our efforts on architecting trusted and more secure cloud services using these principles.","PeriodicalId":180873,"journal":{"name":"2016 ACM/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","volume":"287 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134172920","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

Keynote talk I: How to prove hybrid systems 主题演讲1:如何证明混合系统

2016 ACM/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE) Pub Date : 2016-11-01 DOI: 10.1109/MEMCOD.2016.7797739

André Platzer

引用次数: 0

Parallel reachability analysis for hybrid systems 混合系统并行可达性分析

2016 ACM/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE) Pub Date : 2016-06-17 DOI: 10.1109/MEMCOD.2016.7797741

Amit Gurung, Arup Deka, E. Bartocci, Sergiy Bogomolov, R. Grosu, Rajarshi Ray

{"title":"Parallel reachability analysis for hybrid systems","authors":"Amit Gurung, Arup Deka, E. Bartocci, Sergiy Bogomolov, R. Grosu, Rajarshi Ray","doi":"10.1109/MEMCOD.2016.7797741","DOIUrl":"https://doi.org/10.1109/MEMCOD.2016.7797741","url":null,"abstract":"We propose two parallel state-space-exploration algorithms for hybrid automaton (HA), with the goal of enhancing performance on multi-core shared-memory systems. The first uses the parallel, breadth-first-search algorithm (PBFS) of the SPIN model checker, when traversing the discrete modes of the HA, and enhances it with a parallel exploration of the continuous states within each mode. We show that this simple-minded extension of PBFS does not provide the desired load balancing in many HA benchmarks. The second algorithm is a task-parallel BFS algorithm (TP-BFS), which uses a cheap precomputation of the cost associated with the post operations (both continuous and discrete) in order to improve load balancing. We illustrate the TP-BFS and the cost precomputation of the post operators on a support-function-based algorithm for state-space exploration. The performance comparison of the two algorithms shows that, in general, TP-BFS provides a better utilization/load-balancing of the CPU. Both algorithms are implemented in the model checker XSpeed. Our experiments show a maximum speed-up of more than 2000 χ on a navigation benchmark, with respect to SpaceEx LGG scenario. In order to make the comparison fair, we employed an equal number of post operations in both tools. To the best of our knowledge, this paper represents the first attempt to provide parallel, reachability-analysis algorithms for HA.","PeriodicalId":180873,"journal":{"name":"2016 ACM/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127431089","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