Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science最新文献_第5页

Black Ninjas in the Dark: Formal Analysis of Population Protocols 黑暗中的黑忍者:人口协议的形式分析

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-07-09 DOI: 10.1145/3209108.3209110

Michael Blondin, J. Esparza, Stefan Jaax, A. Kucera

引用次数: 5

Separability by piecewise testable languages and downward closures beyond subwords 分段可测试语言的可分离性和子词以外的向下闭包

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-07-09 DOI: 10.1145/3209108.3209201

Georg Zetzsche

引用次数: 13

Wreath Products of Distributive Forest Algebras 分布森林代数的环积

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-07-09 DOI: 10.1145/3209108.3209158

Michael Hahn, Andreas Krebs, Howard Straubing

引用次数: 1

MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras 树上的MSO查询:用森林代数枚举更新下的答案

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-07-09 DOI: 10.1145/3209108.3209144

Matthias Niewerth

引用次数: 10

Every λ-Term is Meaningful for the Infinitary Relational Model 每个λ项对于无穷大关系模型都是有意义的

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-07-09 DOI: 10.1145/3209108.3209133

Pierre Vial

引用次数: 0

ReLoC

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-07-09 DOI: 10.1145/3209108.3209174

D. Frumin, R. Krebbers, L. Birkedal

{"title":"ReLoC","authors":"D. Frumin, R. Krebbers, L. Birkedal","doi":"10.1145/3209108.3209174","DOIUrl":"https://doi.org/10.1145/3209108.3209174","url":null,"abstract":"We present ReLoC: a logic for proving refinements of programs in a language with higher-order state, fine-grained concurrency, polymorphism and recursive types. The core of our logic is a judgement e ⪯ e': τ, which expresses that a program e refines a program e' at type τ. In contrast to earlier work on refinements for languages with higher-order state and concurrency, ReLoC provides type- and structure-directed rules for manipulating this judgement, whereas previously, such proofs were carried out by unfolding the judgement into its definition in the model. These more abstract proof rules make it simpler to carry out refinement proofs. Moreover, we introduce logically atomic relational specifications: a novel approach for relational specifications for compound expressions that take effect at a single instant in time. We demonstrate how to formalise and prove such relational specifications in ReLoC, allowing for more modular proofs. ReLoC is built on top of the expressive concurrent separation logic Iris, allowing us to leverage features of Iris such as invariants and ghost state. We provide a mechanisation of our logic in Coq, which does not just contain a proof of soundness, but also tactics for interactively carrying out refinements proofs. We have used these tactics to mechanise several examples, which demonstrates the practicality and modularity of our logic.","PeriodicalId":389131,"journal":{"name":"Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"8 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114878229","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}

引用次数: 43

Sequential Relational Decomposition 顺序关系分解

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-07-09 DOI: 10.1145/3209108.3209203

Dror Fried, Axel Legay, J. Ouaknine, Moshe Y. Vardi

{"title":"Sequential Relational Decomposition","authors":"Dror Fried, Axel Legay, J. Ouaknine, Moshe Y. Vardi","doi":"10.1145/3209108.3209203","DOIUrl":"https://doi.org/10.1145/3209108.3209203","url":null,"abstract":"The concept of decomposition in computer science and engineering is considered a fundamental component of computational thinking and is prevalent in design of algorithms, software construction, hardware design, and more. We propose a simple and natural formalization of sequential decomposition, in which a task is decomposed into two sequential sub-tasks, with the first sub-task to be executed out before the second sub-task is executed. These tasks are specified by means of input/output relations. We define and study decomposition problems, which is to decide whether a given specification can be sequentially decomposed. Our main result is that decomposition itself is a difficult computational problem. More specifically, we study decomposition problems in three settings: where the input task is specified explicitly, by means of Boolean circuits, and by means of automatic relations. We show that in the first setting decomposition is NP-complete, in the second setting it is NEXPTIME-complete, and in the third setting there is evidence to suggest that it is undecidable. Our results indicate that the intuitive idea of decomposition as a system-design approach requires further investigation. In particular, we show that adding human to the loop by asking for a decomposition hint lowers the complexity of decomposition problems considerably.","PeriodicalId":389131,"journal":{"name":"Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124516646","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}

引用次数: 6

Rational Synthesis Under Imperfect Information 不完全信息下的理性综合

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-07-09 DOI: 10.1145/3209108.3209164

E. Filiot, R. Gentilini, Jean-François Raskin

{"title":"Rational Synthesis Under Imperfect Information","authors":"E. Filiot, R. Gentilini, Jean-François Raskin","doi":"10.1145/3209108.3209164","DOIUrl":"https://doi.org/10.1145/3209108.3209164","url":null,"abstract":"In this paper, we study the rational synthesis problem for turn-based multiplayer non zero-sum games played on finite graphs for omega-regular objectives. Rationality is formalized by the concept of Nash equilibrium (NE). Contrary to previous works, we consider here the more general and more practically relevant case where players are imperfectly informed. In sharp contrast with the perfect information case, NE are not guaranteed to exist in this more general setting. This motivates the study of the NE existence problem. We show that this problem is ExpTime-C for parity objectives in the two-player case (even if both players are imperfectly informed) and undecidable for more than 2 players. We then study the rational synthesis problem and show that the problem is also ExpTime-C for two imperfectly informed players and undecidable for more than 3 players. As the rational synthesis problem considers a system (Player 0) playing against a rational environment (composed of k players), we also consider the natural case where only Player 0 is imperfectly informed about the state of the environment (and the environment is considered as perfectly informed). In this case, we show that the ExpTime-C result holds when k is arbitrary but fixed. We also analyse the complexity when k is part of the input.","PeriodicalId":389131,"journal":{"name":"Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117016691","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}

引用次数: 15

A modal μ perspective on solving parity games in quasi-polynomial time 拟多项式时间内求解奇偶对策的模态μ视角

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-07-09 DOI: 10.1145/3209108.3209115

K. Lehtinen

引用次数: 59

Classical realizability as a classifier for nondeterminism 经典可实现性作为非确定性的分类器

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-05-29 DOI: 10.1145/3209108.3209140

Guillaume Geoffroy

引用次数: 4