2016 Formal Methods in Computer-Aided Design (FMCAD)最新文献

The FMCAD 2022 Student Forum FMCAD 2022学生论坛

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2022-01-01 DOI: 10.34727/2022/isbn.978-3-85448-053-2_5

Mathias Preiner

引用次数: 0

How Testable is Business Software? 商业软件的可测试性如何?

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2020-11-01 DOI: 10.34727/2020/isbn.978-3-85448-042-6_4

P. Schrammel

引用次数: 1

From Correctness to High Quality 从正确性到高质量

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2020-01-01 DOI: 10.34727/2020/isbn.978-3-85448-042-6_5

O. Kupferman

引用次数: 0

The FMCAD 2020 Student Forum FMCAD 2020学生论坛

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2020-01-01 DOI: 10.34727/2020/isbn.978-3-85448-042-6_6

P. Schrammel

引用次数: 1

Concurrent Chaining Hash Maps for Software Model Checking 用于软件模型检查的并发链哈希映射

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2019-10-01 DOI: 10.23919/FMCAD.2019.8894279

F. V. D. Berg, J. V. D. Pol

{"title":"Concurrent Chaining Hash Maps for Software Model Checking","authors":"F. V. D. Berg, J. V. D. Pol","doi":"10.23919/FMCAD.2019.8894279","DOIUrl":"https://doi.org/10.23919/FMCAD.2019.8894279","url":null,"abstract":"Stateful model checking creates numerous states which need to be stored and checked if already visited. One option for such storage is a hash map and this has been used in many model checkers. In particular, we are interested in the performance of concurrent hash maps for use in multi-core model checkers with a variable state vector size. Previous research claimed that open addressing was the best performing method for the parallel speedup of concurrent hash maps. However, here we demonstrate that chaining lends itself perfectly for use in a concurrent setting.We implemented 12 hash map variants, all aiming at multicore efficiency. 8 of our implementations support variable-length key-value pairs. We compare our implementations and 22 other hash maps by means of an extensive test suite. Of these 34 hash maps, we show the representative performance of 11 hash maps. Our implementations not only support state vectors of variable length, but also feature superior scalability compared with competing hash maps. Our benchmarks show that on 96 cores, our best hash map is between 1.3 and 2.6 times faster than competing hash maps, for a load factor under 1. For higher load factors, it is an order of magnitude faster.","PeriodicalId":6479,"journal":{"name":"2016 Formal Methods in Computer-Aided Design (FMCAD)","volume":"1 1","pages":"46-54"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75782805","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

An Increasing Need for Formality (Keynote) 日益增长的形式需求(主题演讲)

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2019-10-01 DOI: 10.23919/fmcad.2019.8894255

M. Dixon

引用次数: 0

The FMCAD 2019 Student Forum FMCAD 2019学生论坛

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2019-10-01 DOI: 10.23919/fmcad.2019.8894257

Grigory Fedyukovich

引用次数: 0

Safe and Interactive Autonomy: A Journey Starting from Formal Methods (Keynote) 安全和交互式自治:从形式化方法开始的旅程(主题演讲)

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2019-10-01 DOI: 10.23919/fmcad.2019.8894247

Dorsa Sadigh

{"title":"Safe and Interactive Autonomy: A Journey Starting from Formal Methods (Keynote)","authors":"Dorsa Sadigh","doi":"10.23919/fmcad.2019.8894247","DOIUrl":"https://doi.org/10.23919/fmcad.2019.8894247","url":null,"abstract":"Todays society is rapidly advancing towards autonomous systems that interact and collaborate with humans, e.g., semiautonomous vehicles interacting with drivers and pedestrians, medical robots used in collaboration with doctors, or service robots interacting with their users in smart homes. With the emergence of autonomous systems in our every day lives, we need to design algorithms and tools that enable safe and seamless interactions with people.In this talk, I will start with my journey in providing safety for human-robot systems by discussing a spectrum of views on safe autonomous systems including a formal methods perspective for synthesizing provably correct controllers, a robust control approach, and more recent advances in safe learning and verification. I will then discuss one of the main challenges of safety of human-robot systems, i.e., studying how robots influence humans actions in one-on-one or group settings. This is usually overlooked by assuming humans act as external disturbances just like moving obstacles, or assuming that automation can always help societies without actually considering how humans can be impacted. I will talk about our recent work in building computational models of human behavior from expert demonstrations and preferences in interaction with autonomous systems and challenges it introduces for safety and robustness verification.","PeriodicalId":6479,"journal":{"name":"2016 Formal Methods in Computer-Aided Design (FMCAD)","volume":"83 1","pages":"1"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87250674","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

Lazy proofs for DPLL(T)-based SMT solvers 基于DPLL(T)的SMT求解器的惰性证明

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2016-10-03 DOI: 10.1109/FMCAD.2016.7886666

Guy Katz, Clark W. Barrett, C. Tinelli, Andrew Reynolds, Liana Hadarean

引用次数: 28

Verifiable hierarchical protocols with network invariants on parametric systems 参数系统上具有网络不变量的可验证分层协议

2016 Formal Methods in Computer-Aided Design (FMCAD) Pub Date : 2016-10-03 DOI: 10.1109/FMCAD.2016.7886667

Opeoluwa Matthews, Jesse D. Bingham, Daniel J. Sorin

{"title":"Verifiable hierarchical protocols with network invariants on parametric systems","authors":"Opeoluwa Matthews, Jesse D. Bingham, Daniel J. Sorin","doi":"10.1109/FMCAD.2016.7886667","DOIUrl":"https://doi.org/10.1109/FMCAD.2016.7886667","url":null,"abstract":"We present Neo, a framework for designing pre-verified protocol components that can be instantiated and connected in an arbitrarily large hierarchy (tree), with a guarantee that the whole system satisfies a given safety property. We employ the idea of network invariants to handle correctness for arbitrary depths in the hierarchy. Orthogonally, we leverage a parameterized model checker (Cubicle) to allow for a parametric number of children at each internal node of the tree. We believe this is the first time these two distinct dimensions of configuration have been together tackled in a verification approach, and also the first time a proof of an observational preorder (as required by network invariants) has been formulated inside a parametric model checker. Aside from the natural up/down communication between a child and a parent, we allow for peer-to-peer communication, since many real protocol optimizations rely on this paradigm. The paper details the Neo theory, which is built upon the Input-Output Automata formalism, and demonstrates the approach on an example hierarchical cache coherence protocol.","PeriodicalId":6479,"journal":{"name":"2016 Formal Methods in Computer-Aided Design (FMCAD)","volume":"30 1","pages":"101-108"},"PeriodicalIF":0.0,"publicationDate":"2016-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77683254","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}

引用次数: 9