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

Global guidance for local generalization in model checking 模型检验中局部泛化的全局指导

4区计算机科学

Formal Methods in System Design Pub Date : 2023-03-28 DOI: 10.1007/s10703-023-00412-3

Hari Govind V K, YuTing Chen, Sharon Shoham, Arie Gurfinkel

{"title":"Global guidance for local generalization in model checking","authors":"Hari Govind V K, YuTing Chen, Sharon Shoham, Arie Gurfinkel","doi":"10.1007/s10703-023-00412-3","DOIUrl":"https://doi.org/10.1007/s10703-023-00412-3","url":null,"abstract":"Abstract SMT -based model checkers, especially IC3 -style ones, are currently the most effective techniques for verification of infinite state systems. They infer global inductive invariants via local reasoning about a single step of the transition relation of a system, while employing SMT -based procedures, such as interpolation, to mitigate the limitations of local reasoning and allow for better generalization. Unfortunately, these mitigations intertwine model checking with heuristics of the underlying SMT -solver, negatively affecting stability of model checking. In this paper, we propose to tackle the limitations of locality in a systematic manner. We introduce explicit global guidance into the local reasoning performed by IC3 -style algorithms. To this end, we extend the SMT - IC3 paradigm with three novel rules, designed to mitigate fundamental sources of failure that stem from locality. We instantiate these rules for Linear Integer Arithmetic and Linear Rational Aritmetic and implement them on top of Spacer solver in Z3. Our empirical results show that GSpacer , Spacer extended with global guidance, is significantly more effective than both Spacer and sole global reasoning, and, furthermore, is insensitive to interpolation.","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135628729","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}

引用次数: 0

On multi-language abstraction: Towards a static analysis of multi-language programs 论多语言抽象:面向多语言程序的静态分析

4区计算机科学

Formal Methods in System Design Pub Date : 2023-03-28 DOI: 10.1007/s10703-022-00405-8

Samuele Buro, Roy Crole, Isabella Mastroeni

引用次数: 0

Finite-trace and generalized-reactivity specifications in temporal synthesis 时间合成中的有限痕量和广义反应性规范

4区计算机科学

Formal Methods in System Design Pub Date : 2023-03-15 DOI: 10.1007/s10703-023-00413-2

Giuseppe De Giacomo, Antonio Di Stasio, Lucas M. Tabajara, Moshe Y. Vardi, Shufang Zhu

{"title":"Finite-trace and generalized-reactivity specifications in temporal synthesis","authors":"Giuseppe De Giacomo, Antonio Di Stasio, Lucas M. Tabajara, Moshe Y. Vardi, Shufang Zhu","doi":"10.1007/s10703-023-00413-2","DOIUrl":"https://doi.org/10.1007/s10703-023-00413-2","url":null,"abstract":"Abstract Linear Temporal Logic ( LTL ) synthesis aims at automatically synthesizing a program that complies with desired properties expressed in LTL . Unfortunately it has been proved to be too difficult computationally to perform full LTL synthesis. There have been two success stories with LTL synthesis, both having to do with the form of the specification. The first is the GR(1) approach: use safety conditions to determine the possible transitions in a game between the environment and the agent, plus one powerful notion of fairness, Generalized Reactivity(1), or GR(1) . The second, inspired by AI planning, is focusing on finite-trace temporal synthesis, with LTL $$_f$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:msub> <mml:mrow /> <mml:mi>f</mml:mi> </mml:msub> </mml:math> ( LTL on finite traces) as the specification language. In this paper we take these two lines of work and bring them together. We first study the case in which we have an LTL $$_f$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:msub> <mml:mrow /> <mml:mi>f</mml:mi> </mml:msub> </mml:math> agent goal and a GR(1) environment specification. We then add to the framework safety conditions for both the environment and the agent, obtaining a highly expressive yet still scalable form of LTL synthesis.","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135648424","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}

引用次数: 0

Stochastic games with lexicographic objectives 具有字典目标的随机对策

IF 0.8 4区计算机科学

Formal Methods in System Design Pub Date : 2023-03-08 DOI: 10.1007/s10703-023-00411-4

K. Chatterjee, J. Katoen, Stefanie Mohr, Maximilian Weininger, Tobias Winkler

引用次数: 1

Formal Methods: 25th International Symposium, FM 2023, Lübeck, Germany, March 6–10, 2023, Proceedings 正式方法:第25届国际研讨会，FM 2023，德国l<e:2>贝克，2023年3月6日至10日，论文集

IF 0.8 4区计算机科学

Formal Methods in System Design Pub Date : 2023-01-01 DOI: 10.1007/978-3-031-27481-7

引用次数: 0

Stratified guarded first-order transition systems 分层保护一阶过渡系统

IF 0.8 4区计算机科学

Formal Methods in System Design Pub Date : 2022-11-22 DOI: 10.1007/s10703-022-00404-9

Christian Müller, Helmut Seidl

{"title":"Stratified guarded first-order transition systems","authors":"Christian Müller, Helmut Seidl","doi":"10.1007/s10703-022-00404-9","DOIUrl":"https://doi.org/10.1007/s10703-022-00404-9","url":null,"abstract":"<p>First-order transition systems are a convenient formalism to specify parametric systems such as multi-agent workflows or distributed algorithms. In general, any nontrivial question about such systems is undecidable. Here, we present three subclasses of first-order transition systems where every universal invariant can effectively be decided via fixpoint iteration. These subclasses are defined in terms of syntactical restrictions: negation, stratification and guardedness. While guardedness represents a particular pattern how input predicates control existential quantifiers, stratification limits the information flow between predicates. Guardedness implies that the weakest precondition for every universal invariant is again universal, while the remaining sufficient criteria enforce that either the number of occurring negated literals decreases in every iteration, or the number of required instances of input predicates or the number of first-order variables remains bounded. We argue for each of these three cases that termination of the fixpoint iteration can be guaranteed. We apply these results to identify classes of multi-agent systems, when formalized as first-order transition systems, where noninterference in presence of declassification is decidable for coalitions of attackers of bounded size.</p>","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"4 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2022-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138539744","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}

引用次数: 0

Stratified guarded first-order transition systems 分层保护一阶过渡系统

IF 0.8 4区计算机科学

Formal Methods in System Design Pub Date : 2022-11-22 DOI: 10.1007/s10703-022-00404-9

Christian Müller, Helmut Seidl

{"title":"Stratified guarded first-order transition systems","authors":"Christian Müller, Helmut Seidl","doi":"10.1007/s10703-022-00404-9","DOIUrl":"https://doi.org/10.1007/s10703-022-00404-9","url":null,"abstract":"<p>First-order transition systems are a convenient formalism to specify parametric systems such as multi-agent workflows or distributed algorithms. In general, any nontrivial question about such systems is undecidable. Here, we present three subclasses of first-order transition systems where every universal invariant can effectively be decided via fixpoint iteration. These subclasses are defined in terms of syntactical restrictions: negation, stratification and guardedness. While guardedness represents a particular pattern how input predicates control existential quantifiers, stratification limits the information flow between predicates. Guardedness implies that the weakest precondition for every universal invariant is again universal, while the remaining sufficient criteria enforce that either the number of occurring negated literals decreases in every iteration, or the number of required instances of input predicates or the number of first-order variables remains bounded. We argue for each of these three cases that termination of the fixpoint iteration can be guaranteed. We apply these results to identify classes of multi-agent systems, when formalized as first-order transition systems, where noninterference in presence of declassification is decidable for coalitions of attackers of bounded size.</p>","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"4 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2022-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138539764","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}

引用次数: 0

Introducing robust reachability 引入鲁棒可达性

IF 0.8 4区计算机科学

Formal Methods in System Design Pub Date : 2022-11-21 DOI: 10.1007/s10703-022-00402-x

Guillaume Girol, Benjamin Farinier, S. Bardin

引用次数: 0

Machine learning and logic: a new frontier in artificial intelligence 机器学习与逻辑：人工智能的新前沿

IF 0.8 4区计算机科学

Formal Methods in System Design Pub Date : 2022-06-01 DOI: 10.1007/s10703-023-00430-1

Vijay Ganesh, S. Seshia, S. Jha

引用次数: 0

On monitoring linear temporal properties 关于监测线性时间特性