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

Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom 假设足够公平以使会话类型完整以实现锁自由

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

R. V. Glabbeek, P. Höfner, Ross Horne

引用次数: 15

The Logic of Graph Neural Networks 图神经网络的逻辑

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

Martin Grohe

引用次数: 57

A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis 高效布尔Skolem函数合成的一种范式表征

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

Preey Shah, Aman Bansal, S. Akshay, Supratik Chakraborty

{"title":"A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis","authors":"Preey Shah, Aman Bansal, S. Akshay, Supratik Chakraborty","doi":"10.1109/LICS52264.2021.9470741","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470741","url":null,"abstract":"Boolean Skolem function synthesis concerns syn¬thesizing outputs as Boolean functions of inputs such that a relational specification between inputs and outputs is satisfied. This problem, also known as Boolean functional synthesis, has several applications, including design of safe controllers for autonomous systems, certified QBF solving, cryptanalysis etc. Recently, complexity theoretic hardness results have been shown for the problem, although several algorithms proposed in the literature are known to work well in practice. This dichotomy between theoretical hardness and practical efficacy has motivated research on normal forms of specification representation that guarantee efficient synthesis, thus partially explaining the efficacy of some of these algorithms.In this paper we go one step further and ask if there exists a normal form representation of the specification that precisely characterizes \"efficient\" synthesis. We present a normal form called SAUNF that answers this question affirmatively. Specifically, a specification is polynomial time synthesizable iff it can be compiled to SAUNF in polynomial time. Additionally, a specification admits a polynomial-sized functional solution iff there exists a semantically equivalent polynomial-sized SAUNF representation. SAUNF is exponentially more succinct than well- established normal forms like BDDs and DNNFs, used in the context of AI problems, and strictly subsumes other more recently proposed forms like SynNNF. It enjoys compositional properties that are similar to those of DNNF. Thus, SAUNF provides the right trade-off in knowledge representation for Boolean functional synthesis.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117151702","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

On Linear Time Decidability of Differential Privacy for Programs with Unbounded Inputs 输入无界规划微分隐私的线性时间可判定性

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

Rohit Chadha, A. Sistla, Mahesh Viswanathan

引用次数: 2

Axiomatizations and Computability of Weighted Monadic Second-Order Logic 加权一元二阶逻辑的公理化和可计算性

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

A. Achilleos, M. R. Pedersen

引用次数: 1

Session Logical Relations for Noninterference 无干扰会话逻辑关系

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

Farzaneh Derakhshan, Stephanie Balzer, Limin Jia

{"title":"Session Logical Relations for Noninterference","authors":"Farzaneh Derakhshan, Stephanie Balzer, Limin Jia","doi":"10.1109/LICS52264.2021.9470654","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470654","url":null,"abstract":"Information flow control type systems statically restrict the propagation of sensitive data to ensure end-to-end confidentiality. The property to be shown is noninterference, asserting that an attacker cannot infer any secrets from made observations. Session types delimit the kinds of observations that can be made along a communication channel by imposing a protocol of message exchange. These protocols govern the exchange along a single channel and leave unconstrained the propagation along adjacent channels. This paper contributes an information flow control type system for linear session types. The type system stands in close correspondence with intuitionistic linear logic. Intuitionistic linear logic typing ensures that process configurations form a tree such that client processes are parent nodes and provider processes child nodes. To control the propagation of secret messages, the type system is enriched with secrecy levels and arranges these levels to be aligned with the configuration tree. Two levels are associated with every process: the maximal secrecy denoting the process' security clearance and the running secrecy denoting the highest level of secret information obtained so far. The computational semantics naturally stratifies process configurations such that higher-secrecy processes are parents of lower-secrecy ones, an invariant enforced by typing. Noninterference is stated in terms of a logical relation that is indexed by the secrecy-level-enriched session types. The logical relation contributes a novel development of logical relations for session typed languages as it considers open configurations, allowing for a more nuanced equivalence statement.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128511556","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

The Space of Interaction 互动的空间

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

Beniamino Accattoli, Ugo Dal Lago, G. Vanoni

{"title":"The Space of Interaction","authors":"Beniamino Accattoli, Ugo Dal Lago, G. Vanoni","doi":"10.1109/LICS52264.2021.9470726","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470726","url":null,"abstract":"The space complexity of functional programs is not well understood. In particular, traditional implementation techniques are tailored to time efficiency, and space efficiency induces time inefficiencies, as it prefers re-computing to saving. Girard’s geometry of interaction underlies an alternative approach based on the interaction abstract machine (IAM), claimed as space efficient in the literature. It has also been conjectured to provide a reasonable notion of space for the λ-calculus, but such an important result seems to be elusive.In this paper we introduce a new intersection type system precisely measuring the space consumption of the IAM on the typed term. Intersection types have been repeatedly used to measure time, which they achieve by dropping idempotency, turning intersections into multisets. Here we show that the space consumption of the IAM is connected to a further structural modification, turning multisets into trees. Tree intersection types lead to a finer understanding of some space complexity results from the literature. They also shed new light on the conjecture about reasonable space: we show that the usual way of encoding Turing machines into the λ-calculus cannot be used to prove that the space of the IAM is a reasonable cost model.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"495 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123064389","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

On Generalized Metric Spaces for the Simply Typed Lambda-Calculus 关于简型λ微积分的广义度量空间

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

Paolo Pistone

引用次数: 9

Separating Rank Logic from Polynomial Time 从多项式时间中分离秩逻辑

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

Moritz Lichter

引用次数: 14

Combinatorial Proofs and Decomposition Theorems for First-order Logic 一阶逻辑的组合证明与分解定理

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

Dominic J. D. Hughes, Lutz Straßburger, Jui-Hsuan Wu

引用次数: 4