Formal Methods in System Design最新文献_第9页

Static detection of uncoalesced accesses in GPU programs GPU程序中非合并访问的静态检测

IF 0.8 4区计算机科学

Formal Methods in System Design Pub Date : 2021-03-05 DOI: 10.1007/s10703-021-00362-8

R. Alur, Joseph Devietti, O. N. Leija, N. Singhania

引用次数: 2

Gray-box monitoring of hyperproperties with an application to privacy 超属性的灰盒监控及其在隐私保护中的应用

IF 0.8 4区计算机科学

Formal Methods in System Design Pub Date : 2021-02-02 DOI: 10.1007/s10703-020-00358-w

Sandro Stucki, César Sánchez, G. Schneider, Borzoo Bonakdarpour

引用次数: 3

Preface of the special issue on the Conference on Formal Methods in Computer-Aided Design 2017 2017计算机辅助设计形式化方法会议特刊前言

IF 0.8 4区计算机科学

Formal Methods in System Design Pub Date : 2021-01-18 DOI: 10.1007/S10703-020-00357-X

Daryl Stewart, Georg Weissenbacher

引用次数: 0

Static analysis for detecting high-level races in RTOS kernels 用于检测RTOS内核中高级竞争的静态分析

IF 0.8 4区计算机科学

Formal Methods in System Design Pub Date : 2021-01-08 DOI: 10.1007/s10703-020-00354-0

Rekha R. Pai, Abhishek Singh, D. D'Souza, Meenakshi D'Souza, Prathibha Prakash

引用次数: 0

From LTL to rLTL monitoring: improved monitorability through robust semantics. 从 LTL 到 rLTL 监控：通过稳健语义提高可监控性。

IF 0.7 4区计算机科学

Formal Methods in System Design Pub Date : 2021-01-01 Epub Date: 2022-10-21 DOI: 10.1007/s10703-022-00398-4

Corto Mascle, Daniel Neider, Maximilian Schwenger, Paulo Tabuada, Alexander Weinert, Martin Zimmermann

{"title":"From LTL to rLTL monitoring: improved monitorability through robust semantics.","authors":"Corto Mascle, Daniel Neider, Maximilian Schwenger, Paulo Tabuada, Alexander Weinert, Martin Zimmermann","doi":"10.1007/s10703-022-00398-4","DOIUrl":"10.1007/s10703-022-00398-4","url":null,"abstract":"Runtime monitoring is commonly used to detect the violation of desired properties in safety critical cyber-physical systems by observing its executions. Bauer et al. introduced an influential framework for monitoring Linear Temporal Logic (LTL) properties based on a three-valued semantics for a finite execution: the formula is already satisfied by the given execution, it is already violated, or it is still undetermined, i.e., it can still be satisfied and violated by appropriate extensions of the given execution. However, a wide range of formulas are not monitorable under this approach, meaning that there are executions for which satisfaction and violation will always remain undetermined no matter how it is extended. In particular, Bauer et al. report that 44% of the formulas they consider in their experiments fall into this category. Recently, a robust semantics for LTL was introduced to capture different degrees by which a property can be violated. In this paper we introduce a robust semantics for finite strings and show its potential in monitoring: every formula considered by Bauer et al. is monitorable under our approach. Furthermore, we discuss which properties that come naturally in LTL monitoring-such as the realizability of all truth values-can be transferred to the robust setting. We show that LTL formulas with robust semantics can be monitored by deterministic automata, and provide tight bounds on the size of the constructed automaton. Lastly, we report on a prototype implementation and compare it to the LTL monitor of Bauer et al. on a sample of examples.","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"59 1-3","pages":"170-204"},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9794548/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10472646","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Towards efficient verification of population protocols. 促进有效核查人口议定书。

IF 0.8 4区计算机科学

Formal Methods in System Design Pub Date : 2021-01-01 Epub Date: 2021-04-14 DOI: 10.1007/s10703-021-00367-3

Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J Meyer

{"title":"Towards efficient verification of population protocols.","authors":"Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J Meyer","doi":"10.1007/s10703-021-00367-3","DOIUrl":"https://doi.org/10.1007/s10703-021-00367-3","url":null,"abstract":"Population protocols are a well established model of computation by anonymous, identical finite-state agents. A protocol is well-specified if from every initial configuration, all fair executions of the protocol reach a common consensus. The central verification question for population protocols is the well-specification problem: deciding if a given protocol is well-specified. Esparza et al. have recently shown that this problem is decidable, but with very high complexity: it is at least as hard as the Petri net reachability problem, which is TOWER-hard, and for which only algorithms of non-primitive recursive complexity are currently known. In this paper we introduce the class <math> <msup><mrow><mi>WS</mi></mrow> <mn>3</mn></msup> </math> of well-specified strongly-silent protocols and we prove that it is suitable for automatic verification. More precisely, we show that <math> <msup><mrow><mi>WS</mi></mrow> <mn>3</mn></msup> </math> has the same computational power as general well-specified protocols, and captures standard protocols from the literature. Moreover, we show that the membership and correctness problems for <math> <msup><mrow><mi>WS</mi></mrow> <mn>3</mn></msup> </math> reduce to solving boolean combinations of linear constraints over <math><mi>N</mi></math> . This allowed us to develop the first software able to automatically prove correctness for all of the infinitely many possible inputs.","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"57 3","pages":"305-342"},"PeriodicalIF":0.8,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10703-021-00367-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39946454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Formal methods: practical applications and foundations: Editorial. 正式方法:实际应用和基础:编辑。

IF 0.8 4区计算机科学

Formal Methods in System Design Pub Date : 2021-01-01 Epub Date: 2021-07-06 DOI: 10.1007/s10703-021-00380-6

Maurice H Ter Beek, Annabelle McIver

引用次数: 0

Formal Methods: 24th International Symposium, FM 2021, Virtual Event, November 20–26, 2021, Proceedings 正式方法:第24届国际研讨会，FM 2021，虚拟事件，11月20日至26日，2021，会议录

IF 0.8 4区计算机科学

Formal Methods in System Design Pub Date : 2021-01-01 DOI: 10.1007/978-3-030-90870-6

引用次数: 0

Debug-localize-repair: a symbiotic construction for heap manipulations 调试-本地化修复：堆操作的共生构造

IF 0.8 4区计算机科学

Formal Methods in System Design Pub Date : 2020-11-26 DOI: 10.1007/s10703-021-00387-z

Sahil Verma, Subhajit Roy

引用次数: 7

Integrating formal specifications into applications: the ProB Java API 将正式规范集成到应用程序中：ProB Java API

IF 0.8 4区计算机科学

Formal Methods in System Design Pub Date : 2020-10-21 DOI: 10.1007/s10703-020-00351-3

Philipp Körner, Jens Bendisposto, Jannik Dunkelau, Sebastian Krings, M. Leuschel

引用次数: 4