Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

20-23 June 2017

Filter Results

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

    Publication Year: 2017, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (38 KB)
    Freely Available from IEEE
  • Copyright and reprint permission

    Publication Year: 2017, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (49 KB)
    Freely Available from IEEE
  • LICS 2017 foreword

    Publication Year: 2017, Page(s):ii - iv
    Request permission for commercial reuse | PDF file iconPDF (73 KB)
    Freely Available from IEEE
  • Committees

    Publication Year: 2017, Page(s):v - vi
    Request permission for commercial reuse | PDF file iconPDF (62 KB)
    Freely Available from IEEE
  • External reviewers

    Publication Year: 2017, Page(s):vii - ix
    Request permission for commercial reuse | PDF file iconPDF (47 KB)
    Freely Available from IEEE
  • Logic and regular cost functions

    Publication Year: 2017, Page(s):1 - 4
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    Regular cost functions offer a toolbox for automatically solving problems of existence of bounds, in a way similar to the theory of regular languages. More precisely, it allows to test the existence of bounds for quantities that can be defined in cost monadic second-order logic (a quantitative variant of monadic second-order logic) with inputs that range over finite words, infinite words, finite t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symbolic execution and probabilistic reasoning

    Publication Year: 2017, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (48 KB)

    Summary form only given. Symbolic execution is a systematic program analysis technique which explores multiple program behaviors all at once by collecting and solving symbolic path conditions over program paths. The technique has been recently extended with probabilistic reasoning. This approach computes the conditions to reach target program events of interest and uses model counting to quantify ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for some infinite-state MDPs and stochastic games

    Publication Year: 2017, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (51 KB)

    I will survey a body of work, developed over the past decade or so, on algorithms for, and the computational complexity of, analyzing and model checking some important families of countably infinite-state Markov chains, Markov decision processes (MDPs), and stochastic games. These models arise by adding natural forms of recursion, branching, or a counter, to finite-state models, and they correspon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantitative semantics of the lambda calculus: Some generalisations of the relational model

    Publication Year: 2017, Page(s):1 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (506 KB) | HTML iconHTML

    We present an overview of some recent work on the quantitative semantics of the λ-calculus. Our starting point is the fundamental degenerate model of linear logic, the relational model MRel. We show that three quantitative semantics of the simply-typed λ-calculus are equivalent: the relational semantics, HO/N game semantics, and the Taylor expansion semantics. We then consider two re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear combinations of unordered data vectors

    Publication Year: 2017, Page(s):1 - 11
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (353 KB) | HTML iconHTML

    Data vectors generalise finite multisets: they are finitely supported functions into a commutative monoid. We study the question whether a given data vector can be expressed as a finite sum of others, only assuming that 1) the domain is countable and 2) the given set of base vectors is finite up to permutations of the domain. Based on a succinct representation of the involved permutations as integ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An interpretation of system F through bar recursion

    Publication Year: 2017, Page(s):1 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (353 KB) | HTML iconHTML

    There are two possible computational interpretations of second-order arithmetic: Girard's system F or Spector's bar recursion and its variants. While the logic is the same, the programs obtained from these two interpretations have a fundamentally different computational behavior and their relationship is not well understood. We make a step towards a comparison by defining the first translation of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the extension of computable real functions

    Publication Year: 2017, Page(s):1 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (295 KB) | HTML iconHTML

    We investigate interrelationships among different notions from mathematical analysis, effective topology, and classical computability theory. Our main object of study is the class of computable functions defined over an interval with the boundary being a left-c.e. real number. We investigate necessary and sufficient conditions under which such functions can be computably extended. It turns out tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logics for continuous reachability in Petri nets and vector addition systems with states

    Publication Year: 2017, Page(s):1 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB) | HTML iconHTML

    This paper studies sets of rational numbers definable by continuous Petri nets and extensions thereof. First, we identify a polynomial-time decidable fragment of existential FO(ℚ,+,<;) and show that the sets of rationals definable in this fragment coincide with reachability sets of continuous Petri nets. Next, we introduce and study continuous vector addition systems with states (CVASS),... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Foundation for a series of efficient simulation algorithms

    Publication Year: 2017, Page(s):1 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    Compute the coarsest simulation preorder included in an initial preorder is used to reduce the resources needed to analyze a given transition system. This technique is applied on many models like Kripke structures, labeled graphs, labeled transition systems or even word and tree automata. Let (Q,→) be a given transition system and ℛinit be an initial preorder over Q. Until... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Separation for dot-depth two

    Publication Year: 2017, Page(s):1 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (582 KB) | HTML iconHTML

    The dot-depth hierarchy of Brzozowski and Cohen is a classification of all first-order definable languages. It rose to prominence following the work of Thomas, who established an exact correspondence with the quantifier alternation hierarchy of first-order logic: each level contains languages that can be defined with a prescribed number of quantifier blocks. One of the most famous open problems in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Foundational nonuniform (Co)datatypes for higher-order logic

    Publication Year: 2017, Page(s):1 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (294 KB) | HTML iconHTML

    Nonuniform (or “nested” or “heterogeneous”) datatypes are recursively defined types in which the type arguments vary recursively. They arise in the implementation of finger trees and other efficient functional data structures. We show how to reduce a large class of nonuniform datatypes and codatatypes to uniform types in higher-order logic. We programmed this reduction ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Common knowledge and multi-scale locality analysis in Cayley structures

    Publication Year: 2017, Page(s):1 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (348 KB) | HTML iconHTML

    We investigate multi-agent epistemic modal logic with common knowledge modalities for groups of agents and obtain van Benthem style model-theoretic characterisations, in terms of bisimulation invariance of classical first-order logic over the non-elementary classes of (finite or arbitrary) common knowledge Kripke frames. The fixpoint character of common knowledge modalities and the rôle th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queries

    Publication Year: 2017, Page(s):1 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB) | HTML iconHTML

    A structure enjoys the Herbrand property if, whenever it satisfies an equality between some terms, these terms are unifiable. On such structures the expressive power of equalities becomes trivial, as their semantic satisfiability is reduced to a purely syntactic check. In this work, we introduce the notion of Herbrand property and develop it in a finite model-theoretic perspective. We provide, ind... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bar induction: The good, the bad, and the ugly

    Publication Year: 2017, Page(s):1 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (255 KB) | HTML iconHTML

    We present an extension of the computation system and logic of the Nuprl proof assistant with intuitionistic principles, namely versions of Brouwer's bar induction principle, which is equivalent to transfinite induction. We have substantially extended the formalization of Nuprl's type theory within the Coq proof assistant to show that two such bar induction principles are valid w.r.t. Nuprl's sema... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructive completeness for the linear-time μ-calculus

    Publication Year: 2017, Page(s):1 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (362 KB) | HTML iconHTML

    We give a new proof of completeness for the linear-time μ-calculus w.r.t. Kozens's axiomatization. Our proof has the advantage of being constructive, i.e., it builds a proof for every valid formula. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gödel logic: From natural deduction to parallel computation

    Publication Year: 2017, Page(s):1 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (546 KB) | HTML iconHTML

    Propositional Gödel logic G extends intuitionistic logic with the non-constructive principle of linearity (A → B) ⋁ (B → A). We introduce a Curry-Howard correspondence for G and show that a simple natural deduction calculus can be used as a typing system. The resulting functional language extends the simply typed λ-calculus via a synchronous communication mechan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Higher-order parity automata

    Publication Year: 2017, Page(s):1 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1015 KB) | HTML iconHTML

    We introduce a notion of higher-order parity automaton which extends to infinitary simply-typed λ-terms the traditional notion of parity tree automaton on infinitary ranked trees. Our main result is that the acceptance of an infinitary λ-term by a higher-order parity automaton A is decidable, whenever the infinitary λ-term is generated by a finite and simply-typed λY-te... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large scale geometries of infinite strings

    Publication Year: 2017, Page(s):1 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (150 KB) | HTML iconHTML

    We introduce geometric consideration into the theory of formal languages. We aim to shed light on our understanding of global patterns that occur on infinite strings. We utilise methods of geometric group theory. Our emphasis is on large scale geometries. Two infinite strings have the same large scale geometry if there are colour preserving bi-Lipschitz maps with distortions between the strings. C... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regular separability of one counter automata

    Publication Year: 2017, Page(s):1 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (269 KB) | HTML iconHTML

    The regular separability problem asks, for two given languages, if there exists a regular language including one of them but disjoint from the other. Our main result is decidability, and PSPACE-completeness, of the regular separability problem for languages of one counter automata without zero tests (also known as one counter nets). This contrasts with undecidability of the regularity problem for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning first-order definable concepts over structures of small degree

    Publication Year: 2017, Page(s):1 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (294 KB) | HTML iconHTML

    We consider a declarative framework for machine learning where concepts and hypotheses are defined by formulas of a logic over some “background structure”. We show that within this framework, concepts defined by first-order formulas over a background structure of at most polylogarithmic degree can be learned in polylogarithmic time in the “probably approximately correct”... View full abstract»

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