2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)最新文献_第2页

From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata 从有限值不确定传感器到确定双带自动机

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-06-29 DOI: 10.1109/LICS52264.2021.9470688

E. Burjons, F. Frei, Martin Raszyk

引用次数: 0

A Compositional Cost Model for the λ-calculus λ微积分的组合代价模型

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-06-29 DOI: 10.1109/LICS52264.2021.9470567

J. Laird

{"title":"A Compositional Cost Model for the λ-calculus","authors":"J. Laird","doi":"10.1109/LICS52264.2021.9470567","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470567","url":null,"abstract":"We describe a (time) cost model for the (call-by-value) λ-calculus based on a natural presentation of its game semantics: the cost of computing a finite approximant to the denotation of a term (its evaluation tree) is the size of its smallest derivation in the semantics. This measure has an optimality property enabling compositional reasoning about cost bounds: for any term A, context C[_] and approximants a and c to the trees of A and C[A], the cost of computing c from C[A] is no more than the cost of computing a from A and c from C[a].Although the natural semantics on which it is based is nondeterministic, our cost model is reasonable: we describe a deterministic algorithm for recognizing evaluation tree approximants which satisfies it (up to a constant factor overhead) on a Random Access Machine. This requires an implementation of the λv-calculus on the RAM which is completely lazy: compositionality of costs entails that work done to evaluate any part of a term cannot be duplicated. This is achieved by a novel implementation of graph reduction for nameless explicit substitutions, to which we compile the λv-calculus via a series of linear cost reductions.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"435 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116010181","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

Fixed-Points for Quantitative Equational Logics 定量等式逻辑的不动点

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-06-29 DOI: 10.1109/LICS52264.2021.9470662

R. Mardare, P. Panangaden, G. Plotkin

引用次数: 10

Higher Lenses 更高的镜头

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-06-29 DOI: 10.1109/LICS52264.2021.9470613

Paolo Capriotti, Nils Anders Danielsson, Andrea Vezzosi

引用次数: 1

A Relational Theory of Monadic Rewriting Systems, Part I 一元重写系统的关系理论，第一部分

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-06-29 DOI: 10.1109/LICS52264.2021.9470633

Francesco Gavazzo, C. Faggian

{"title":"A Relational Theory of Monadic Rewriting Systems, Part I","authors":"Francesco Gavazzo, C. Faggian","doi":"10.1109/LICS52264.2021.9470633","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470633","url":null,"abstract":"Motivated by the study of effectful programming languages and computations, we introduce a relational theory of monadic rewriting systems. The latter are rewriting systems whose notion of reduction is effectful, where effects are modelled as monads. Contrary to what happens in the ordinary operational semantics of monadic programming languages, defining meaningful notions of monadic rewriting turns out to problematic for several monads, including the distribution, powerset, reader, and global state monad. This raises the question of when monadic rewriting is possible. We answer that question by identifying a class of monads, known as weakly cartesian monads, that guarantee monadic rewriting to be well-behaved. In case monads are given as equational theories, as it is the case for algebraic effects, we also show that a sufficient condition to have a well-behaved notion of monadic rewriting is that all equations in the theory are linear. Finally, we apply the abstract theory of monadic rewriting systems to the call-by-value λ-calculus with algebraic effects, this way obtaining effectful (surface) standardisation and confluence theorems.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116772175","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}

引用次数: 4

Universal Skolem Sets 通用Skolem集

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-06-29 DOI: 10.1109/LICS52264.2021.9470513

F. Luca, J. Ouaknine, J. Worrell

引用次数: 4

Perspective Multi-Player Games 视角多人游戏

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-06-29 DOI: 10.1109/LICS52264.2021.9470616

O. Kupferman, Noam Shenwald

{"title":"Perspective Multi-Player Games","authors":"O. Kupferman, Noam Shenwald","doi":"10.1109/LICS52264.2021.9470616","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470616","url":null,"abstract":"Perspective games model multi-agent systems in which agents can view only the parts of the system that they own. Unlike the observation-based model of partial visibility, where uncertainty is longitudinal – agents partially observe the full history, uncertainty in perspective games is transverse – agents fully observe parts of the history. So far, researchers studied zero-sum two-player perspective games. There, the objective of one agent (the system) is to satisfy a given specification, and the objective of the second agent (the environment) is to fail the specification.We study richer and more realistic settings of perspective games. We consider games with more than two players, and distinguish between zero-sum games, where the objectives of the players form a partition of all possible behaviors, zero-sum games among coalitions, where agents in a coalition share their objectives but do not share their visibility, and non-zero-sum games, where each agent has her own objectives and is assumed to be rational rather than hostile. In the non-zero-sum setting, we are interested in stable outcomes of the game; in particular, Nash equilibria.We show that, as is the case with longitudinal uncertainty, transverse uncertainty leads to undecidability in settings with three or more players that include coalitions or non-zero-sum objectives. We then focus on two-player non-zero-sum perspective games. There, finding and reasoning about stable outcomes is decidable, and in fact, unlike the case with longitudinal uncertainty, can be done in the same complexity as in games with full visibility. In particular, we study rational synthesis in the perspective setting, where the goal is to generate systems that satisfy their specification when interacting with rational environments. Our study includes Boolean objectives given by automata or LTL formulas, as well as a multi-valued setting, where the objectives are ${text{LTL}}left[ {mathcal{F}} right]$ formulas with satisfaction values in [0, 1], and the agents aim to maximize the satisfaction value of their objectives.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123642842","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}

引用次数: 1

Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments 没有贝丝和克雷格的生活:守卫和双变量片段中的定义和插入

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-06-29 DOI: 10.1109/LICS52264.2021.9470585

J. C. Jung, F. Wolter

引用次数: 11

Verifying higher-order concurrency with data automata 用数据自动机验证高阶并发性

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-06-29 DOI: 10.1109/LICS52264.2021.9470691

Alex Dixon, R. Lazic, A. Murawski, I. Walukiewicz

引用次数: 1

Evidenced Frames: A Unifying Framework Broadening Realizability Models 证据框架:扩展可实现性模型的统一框架

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-06-29 DOI: 10.1109/LICS52264.2021.9470514

L. Cohen, Étienne Miquey, R. Tate

{"title":"Evidenced Frames: A Unifying Framework Broadening Realizability Models","authors":"L. Cohen, Étienne Miquey, R. Tate","doi":"10.1109/LICS52264.2021.9470514","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470514","url":null,"abstract":"Constructive foundations have for decades been built upon realizability models for higher-order logic and type theory. However, traditional realizability models have a rather limited notion of computation, which only supports non-termination and avoids many other commonly used effects. Work to address these limitations has typically overlaid structure on top of existing models, such as by using powersets to represent non-determinism, but kept the realizers themselves deterministic. This paper alternatively addresses these limitations by making the structure underlying realizability models more flexible. To this end, we introduce evidenced frames: a general-purpose framework for building realizability models that support diverse effectful computations. We demonstrate that this flexibility permits models wherein the realizers themselves can be effectful, such as λ-terms that can manipulate state, reduce non-deterministically, or fail entirely. Beyond the broader notions of computation, we demonstrate that evidenced frames form a unifying framework for (realizability) models of higher-order dependent predicate logic. In particular, we prove that evidenced frames are complete with respect to these models, and that the existing completeness construction for implicative algebras—another foundational framework for realizability—factors through our simpler construction. As such, we conclude that evidenced frames offer an ideal domain for unifying and broadening realizability models.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121937671","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}

引用次数: 3