2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science

6-10 July 2015

Filter Results

Displaying Results 1 - 25 of 77
  • [Front cover]

    Publication Year: 2015, Page(s): C4
    Request permission for commercial reuse | PDF file iconPDF (1351 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2015, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (26 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2015, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (57 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2015, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (125 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2015, Page(s):v - x
    Request permission for commercial reuse | PDF file iconPDF (164 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 2015, Page(s):xi - xii
    Request permission for commercial reuse | PDF file iconPDF (115 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference Organization

    Publication Year: 2015, Page(s):xiii - xiv
    Request permission for commercial reuse | PDF file iconPDF (130 KB)
    Freely Available from IEEE
  • Citation for the Test-of-Time Award from LICS 1995

    Publication Year: 2015, Page(s): xv
    Request permission for commercial reuse | PDF file iconPDF (75 KB)
    Freely Available from IEEE
  • External reviewers

    Publication Year: 2015, Page(s):xvi - xx
    Request permission for commercial reuse | PDF file iconPDF (103 KB)
    Freely Available from IEEE
  • Higher-Order Model Checking: An Overview

    Publication Year: 2015, Page(s):1 - 15
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (339 KB) | HTML iconHTML

    Higher-order model checking is about the model checking of trees generated by recursion schemes. The past fifteen years or so have seen considerable progress in both theory and practice. Advances have been made in determining the expressive power of recursion schemes and other higher-order families of generators, automata-theoretic characterisations of these generator families, and the algorithmic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Privacy and the Price of Data

    Publication Year: 2015, Page(s): 16
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (101 KB) | HTML iconHTML

    Several important application areas in data science involve assigning numbers to (possibly randomized) algorithms. In the case of statistical privacy, it is important to quantify the amount of information leaked by a data processing algorithm. In the case of data marketplaces, it is important to properly set the prices for data queries (which, in general, can be specified by arbitrary algorithms).... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From Categorical Logic to Facebook Engineering

    Publication Year: 2015, Page(s):17 - 20
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (161 KB) | HTML iconHTML

    I chart a line of development from category-theoretic models of programs and logics to automatic program verification/analysis techniques that are in deployment at Facebook. Our journey takes in a number of concepts from the computer science logician's toolkit -- including categorical logic and model theory, denotational semantics, the Curry-Howard isomorphism, sub structural logic, Hoare Logic an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Names and Symmetry in Computer Science (Invited Tutorial)

    Publication Year: 2015, Page(s):21 - 22
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (106 KB) | HTML iconHTML

    Nominal sets provide a mathematical theory for some of the key concepts that arise when representing and computing with data involving atomic (or 'pure') names: freshness, abstraction and scoping of names, and finiteness modulo symmetry. This tutorial introduces the notion of nominal set and explains selected applications of it to logic in computer science, to automata, languages and programming. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recent Developments in Quantitative Information Flow (Invited Tutorial)

    Publication Year: 2015, Page(s):23 - 31
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (602 KB) | HTML iconHTML

    In computer security, it is frequently necessary in practice to accept some leakage of confidential information. This motivates the development of theories of Quantitative Information Flow aimed at showing that some leaks are "small" and therefore tolerable. We describe the fundamental view of channels as mappings from prior distributions on secrets to hyper-distributions, which are distributions ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete

    Publication Year: 2015, Page(s):32 - 43
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (741 KB)

    Known to be decidable since 1981, there still remains a huge gap between the best known lower and upper bounds for the reach ability problem for vector addition systems with states (VASS). Here the problem is shown PSPACE-complete in the two-dimensional case, vastly improving on the doubly exponential time bound established in 1986 by Howell, Rosier, Huynh and Yen. Cover ability and bounded ness f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Long-Run Average Behaviour of Probabilistic Vector Addition Systems

    Publication Year: 2015, Page(s):44 - 55
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (321 KB)

    We study the pattern frequency vector for runs in probabilistic Vector Addition Systems with States (pVASS). Intuitively, each configuration of a given pVASS is assigned one of finitely many patterns, and every run can thus be seen as an infinite sequence of these patterns. The pattern frequency vector assigns to each run the limit of pattern frequencies computed for longer and longer prefixes of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Demystifying Reachability in Vector Addition Systems

    Publication Year: 2015, Page(s):56 - 67
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (331 KB)

    More than 30 years after their inception, the decidability proofs for reach ability in vector addition systems (VAS) still retain much of their mystery. These proofs rely crucially on a decomposition of runs successively refined by Mayr, Kosaraju, and Lambert, which appears rather magical, and for which no complexity upper bound is known. We first offer a justification for this decomposition techn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Petri Automata for Kleene Allegories

    Publication Year: 2015, Page(s):68 - 79
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (327 KB) | HTML iconHTML

    Kleene algebra axioms are complete with respect to both language models and binary relation models. In particular, two regular expressions recognise the same language if and only if they are universally equivalent in the model of binary relations. We consider Kleene allegories, i.e., Kleene algebras with two additional operations which are natural in binary relation models: intersection and conver... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets

    Publication Year: 2015, Page(s):80 - 91
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (310 KB) | HTML iconHTML

    We investigate efficient algorithms for the additive fragment of linear logic. This logic is an internal language for categories with finite sums and products, and describes concurrent two-player games of finite choice. In the context of session types, typing disciplines for communication along channels, the logic describes the communication of finite choice along a single channel. We give a simpl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Cubical Approach to Synthetic Homotopy Theory

    Publication Year: 2015, Page(s):92 - 103
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (243 KB)

    Homotopy theory can be developed synthetically in homotopy type theory, using types to describe spaces, the identity type to describe paths in a space, and iterated identity types to describe higher-dimensional paths. While some aspects of homotopy theory have been developed synthetically and formalized in proof assistants, some seemingly easy examples have proved difficult because the required ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Game Semantics for Type Soundness

    Publication Year: 2015, Page(s):104 - 114
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (257 KB) | HTML iconHTML

    The key idea of game semantics is that a term can interact with its enclosing context via various events, such as function calls and returns. A trace is a sequence of such interaction events. The meaning of the term is then naturally represented by the set of all event traces that the term can generate. Game semantics allows us to define the meaning of both expressions and types in the same domain... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Programs for Cheap!

    Publication Year: 2015, Page(s):115 - 126
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (249 KB) | HTML iconHTML

    Write down the definition of a recursion operator on a piece of paper. Tell me its type, but be careful not to let me see the operator's definition. I will tell you an optimization theorem that the operator satisfies. As an added bonus, I will also give you a proof of correctness for the optimisation, along with a formal guarantee about its effect on performance. The purpose of this paper is to ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polarised Intermediate Representation of Lambda Calculus with Sums

    Publication Year: 2015, Page(s):127 - 140
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (299 KB) | HTML iconHTML

    The theory of the λ-calculus with extensional sums is more complex than with only pairs and functions. We propose an untyped representation-an intermediate calculus-for the λ-calculus with sums, based on the following principles: 1) Computation is described as the reduction of pairs of an expression and a context; the context must be represented inside-out, 2) operations are represen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Relative Usefulness of Fireballs

    Publication Year: 2015, Page(s):141 - 155
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (338 KB) | HTML iconHTML

    In CSL-LICS 2014, Accattoli and Dal Lago [1] showed that there is an implementation of the ordinary (i.e. strong, pure, call-by-name) λ-calculus into models like RAM machines which is polynomial in the number of β-steps, answering a long-standing question. The key ingredient was the use of a calculus with useful sharing, a new notion whose complexity was shown to be polynomial, but w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bisimilarity in Fresh-Register Automata

    Publication Year: 2015, Page(s):156 - 167
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (335 KB)

    Register automata are a basic model of computation over infinite alphabets. Fresh-register automata extend register automata with the capability to generate fresh symbols in order to model computational scenarios involving name creation. This paper investigates the complexity of the bisimilarity problem for classes of register and fresh-register automata. We examine all main disciplines that have ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.