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

An Asynchronous Soundness Theorem for Concurrent Separation Logic 并发分离逻辑的异步稳健性定理

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

Paul-André Melliès, Léo Stefanesco

引用次数: 5

Dialectica models of type theory 类型论的辩证法模型

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

Sean K. Moss, Tamara von Glehn

引用次数: 8

An answer to the Gamma question 伽玛问题的答案

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

B. Monin

{"title":"An answer to the Gamma question","authors":"B. Monin","doi":"10.1145/3209108.3209117","DOIUrl":"https://doi.org/10.1145/3209108.3209117","url":null,"abstract":"We answer in this paper an open question (known as the \"Gamma question\"), related to the recent notion of coarse computability, which stems from complexity theory. The question was formulated by Andrews, Cai, Diamondstone, Jockusch and Lempp in \"Asymptotic density, computable traceability and 1-randomness\" [1]. The Gamma value of an oracle set measures to what extent each set computable with the oracle is approximable in the sense of density by a computable set. The closer to 1 this value is, the closer the oracle is to being computable. The Gamma question asks whether this value can be strictly in between 0 and 1/2. In this paper, we pursue some work initiated by Monin and Nies in \"A unifying approach to the Gamma question\" [19]. Using notions from computability theory, developed by Monin and Nies, together with some basic techniques from the field of error-correcting codes, we are able to give a negative answer to this question. The proof we give also provides an answer to a related question, asked by Denis Hirschfeldt in the expository paper \"Some questions in computable mathematics\" [12]. We also solve the Gamma problem for bases other than 2, answering another question of Monin and Nies.","PeriodicalId":389131,"journal":{"name":"Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"45 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":"121419467","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

Riesz Modal Logic with Threshold Operators 具有阈值算子的Riesz模态逻辑

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

M. Mio

引用次数: 6

Boolean-Valued Semantics for the Stochastic λ-Calculus 随机λ微积分的布尔值语义

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

G. Bacci, Robert Furber, D. Kozen, R. Mardare, P. Panangaden, D. Scott

{"title":"Boolean-Valued Semantics for the Stochastic λ-Calculus","authors":"G. Bacci, Robert Furber, D. Kozen, R. Mardare, P. Panangaden, D. Scott","doi":"10.1145/3209108.3209175","DOIUrl":"https://doi.org/10.1145/3209108.3209175","url":null,"abstract":"The ordinary untyped λ-calculus has a λ-theoretic model proposed in two related forms by Scott and Plotkin in the 1970s. Recently Scott showed how to introduce probability by extending these models with random variables. However, to reason about correctness and to add further features, it is useful to reinterpret the construction in a higher-order Boolean-valued model involving a measure algebra. We develop the semantics of an extended stochastic λ-calculus suitable for modeling a simple higher-order probabilistic programming language. We exhibit a number of key equations satisfied by the terms of our language. The terms are interpreted using a continuation-style semantics with an additional argument, an infinite sequence of coin tosses, which serves as a source of randomness. We also introduce a fixpoint operator as a new syntactic construct, as β-reduction turns out not to be sound for unrestricted terms. Finally, we develop a new notion of equality between terms interpreted in a measure algebra, allowing one to reason about terms that may not be equal almost everywhere. This provides a new framework and reasoning principles for probabilistic programs and their higher-order properties.","PeriodicalId":389131,"journal":{"name":"Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"10 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":"115768198","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}

引用次数: 12

The concurrent game semantics of Probabilistic PCF 概率PCF的并发博弈语义

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

Simon Castellan, P. Clairambault, Hugo Paquet, G. Winskel

引用次数: 29

A functional interpretation with state 带状态的功能解释

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

Thomas Powell

引用次数: 8

A parameterized halting problem, the linear time hierarchy, and the MRDP theorem 一个参数化停机问题，线性时间层次，和MRDP定理

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

Yijia Chen, M. Müller, K. Yokoyama

引用次数: 3

A Hybrid, Dynamic Logic for Hybrid-Dynamic Information Flow 混合动态信息流的混合动态逻辑

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

Rose Bohrer, André Platzer

{"title":"A Hybrid, Dynamic Logic for Hybrid-Dynamic Information Flow","authors":"Rose Bohrer, André Platzer","doi":"10.1145/3209108.3209151","DOIUrl":"https://doi.org/10.1145/3209108.3209151","url":null,"abstract":"Information-flow security is important to the safety and privacy of cyber-physical systems (CPSs) across many domains: information leakage can both violate user privacy and reveal vulnerabilities to physical attacks. CPSs face the challenge that information can flow both in discrete cyber channels and in continuous real-valued physical channels ranging from time to motion to electrical currents. We call these hybrid-dynamic information flows (HDIFs) and introduce dHL, the first logic for verifying HDIFs in hybrid-dynamical models of CPSs. Our logic extends differential dynamic logic (dL) for hybrid-dynamical systems with hybrid-logical features for explicit program state representation, supporting relational reasoning used for information flow arguments. By verifying HDIFs, we ensure security even under a strong attacker model wherein an attacker can observe time and physical values continuously. We present a Hilbert-style proof calculus for dHL, prove it sound, and compare the expressive power of dHL with dL. We develop a hybrid system model based on the smart electrical grid FREEDM, with which we showcase dHL. We prove that the naive model has a previously unknown information flow vulnerability, which we verify is resolved in a revised model. This is the first information flow proof both for HDIFs and for a hybrid-dynamical model in general.","PeriodicalId":389131,"journal":{"name":"Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"27 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":"134619150","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}

引用次数: 21

Strong Sums in Focused Logic 聚焦逻辑中的强和

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

Karl Crary

引用次数: 1