Pub Date : 2021-03-05DOI: 10.1007/s10703-021-00362-8
R. Alur, Joseph Devietti, O. N. Leija, N. Singhania
{"title":"Static detection of uncoalesced accesses in GPU programs","authors":"R. Alur, Joseph Devietti, O. N. Leija, N. Singhania","doi":"10.1007/s10703-021-00362-8","DOIUrl":"https://doi.org/10.1007/s10703-021-00362-8","url":null,"abstract":"","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"60 1","pages":"1 - 32"},"PeriodicalIF":0.8,"publicationDate":"2021-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10703-021-00362-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48491671","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-02-02DOI: 10.1007/s10703-020-00358-w
Sandro Stucki, César Sánchez, G. Schneider, Borzoo Bonakdarpour
{"title":"Gray-box monitoring of hyperproperties with an application to privacy","authors":"Sandro Stucki, César Sánchez, G. Schneider, Borzoo Bonakdarpour","doi":"10.1007/s10703-020-00358-w","DOIUrl":"https://doi.org/10.1007/s10703-020-00358-w","url":null,"abstract":"","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"58 1","pages":"126 - 159"},"PeriodicalIF":0.8,"publicationDate":"2021-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10703-020-00358-w","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43219218","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-18DOI: 10.1007/S10703-020-00357-X
Daryl Stewart, Georg Weissenbacher
{"title":"Preface of the special issue on the Conference on Formal Methods in Computer-Aided Design 2017","authors":"Daryl Stewart, Georg Weissenbacher","doi":"10.1007/S10703-020-00357-X","DOIUrl":"https://doi.org/10.1007/S10703-020-00357-X","url":null,"abstract":"","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"57 1","pages":"303 - 304"},"PeriodicalIF":0.8,"publicationDate":"2021-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/S10703-020-00357-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47321141","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-08DOI: 10.1007/s10703-020-00354-0
Rekha R. Pai, Abhishek Singh, D. D'Souza, Meenakshi D'Souza, Prathibha Prakash
{"title":"Static analysis for detecting high-level races in RTOS kernels","authors":"Rekha R. Pai, Abhishek Singh, D. D'Souza, Meenakshi D'Souza, Prathibha Prakash","doi":"10.1007/s10703-020-00354-0","DOIUrl":"https://doi.org/10.1007/s10703-020-00354-0","url":null,"abstract":"","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"58 1","pages":"294 - 321"},"PeriodicalIF":0.8,"publicationDate":"2021-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10703-020-00354-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42993249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-01Epub Date: 2022-10-21DOI: 10.1007/s10703-022-00398-4
Corto Mascle, Daniel Neider, Maximilian Schwenger, Paulo Tabuada, Alexander Weinert, Martin Zimmermann
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.
{"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":"<p><p>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.</p>","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}
Pub Date : 2021-01-01Epub Date: 2021-04-14DOI: 10.1007/s10703-021-00367-3
Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J Meyer
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 of well-specified strongly-silent protocols and we prove that it is suitable for automatic verification. More precisely, we show that 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 reduce to solving boolean combinations of linear constraints over . This allowed us to develop the first software able to automatically prove correctness for all of the infinitely many possible inputs.
{"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":"<p><p>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 <i>well-specification problem</i>: 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 <i>all</i> of the infinitely many possible inputs.</p>","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}
Pub Date : 2021-01-01Epub Date: 2021-07-06DOI: 10.1007/s10703-021-00380-6
Maurice H Ter Beek, Annabelle McIver
{"title":"Formal methods: practical applications and foundations: Editorial.","authors":"Maurice H Ter Beek, Annabelle McIver","doi":"10.1007/s10703-021-00380-6","DOIUrl":"https://doi.org/10.1007/s10703-021-00380-6","url":null,"abstract":"","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"58 1-2","pages":"1-4"},"PeriodicalIF":0.8,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10703-021-00380-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39173325","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}
Pub Date : 2021-01-01DOI: 10.1007/978-3-030-90870-6
{"title":"Formal Methods: 24th International Symposium, FM 2021, Virtual Event, November 20–26, 2021, Proceedings","authors":"","doi":"10.1007/978-3-030-90870-6","DOIUrl":"https://doi.org/10.1007/978-3-030-90870-6","url":null,"abstract":"","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"56 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82628052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-26DOI: 10.1007/s10703-021-00387-z
Sahil Verma, Subhajit Roy
{"title":"Debug-localize-repair: a symbiotic construction for heap manipulations","authors":"Sahil Verma, Subhajit Roy","doi":"10.1007/s10703-021-00387-z","DOIUrl":"https://doi.org/10.1007/s10703-021-00387-z","url":null,"abstract":"","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"58 1","pages":"399 - 439"},"PeriodicalIF":0.8,"publicationDate":"2020-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42305624","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-10-21DOI: 10.1007/s10703-020-00351-3
Philipp Körner, Jens Bendisposto, Jannik Dunkelau, Sebastian Krings, M. Leuschel
{"title":"Integrating formal specifications into applications: the ProB Java API","authors":"Philipp Körner, Jens Bendisposto, Jannik Dunkelau, Sebastian Krings, M. Leuschel","doi":"10.1007/s10703-020-00351-3","DOIUrl":"https://doi.org/10.1007/s10703-020-00351-3","url":null,"abstract":"","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"58 1","pages":"160 - 187"},"PeriodicalIF":0.8,"publicationDate":"2020-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10703-020-00351-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43991609","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号