By Topic

Logic in Computer Science (LICS), 2011 26th Annual IEEE Symposium on

Date 21-24 June 2011

Filter Results

Displaying Results 1 - 25 of 52
  • [Title page i]

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

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

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

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

    Publication Year: 2011, Page(s):ix - x
    Request permission for commercial reuse | PDF file iconPDF (109 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference organization

    Publication Year: 2011, Page(s):xi - xii
    Request permission for commercial reuse | PDF file iconPDF (87 KB)
    Freely Available from IEEE
  • List of Additional Reviewers

    Publication Year: 2011, Page(s):xiii - xiv
    Request permission for commercial reuse | PDF file iconPDF (55 KB)
    Freely Available from IEEE
  • A Why-on-Earth Tutorial on Finite Model Theory

    Publication Year: 2011, Page(s): 3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB) | HTML iconHTML

    This note advertises the topics that will be covered in the tutorial on finite model theory. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Meaning of Semantics

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

    I will present three main themes in current research in semantics: (a) models of programming languages, (b) concurrency and (c) approximation. The first theme covers denotational semantics and operational semantics and the search for tight connections between them. This led to the full abstraction problem and ultimately to game semantics. The second theme began with the attempt to understand proce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logic in Software, Dynamical and Biological Systems

    Publication Year: 2011, Page(s):9 - 10
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (170 KB) | HTML iconHTML

    Formal methods is a key area within the Computer Science discipline. Formal methods is concerned with analyzing systems formally. Here, we focus on three different systems: software systems, dynamical control systems, and biological systems. Software systems are discrete-time systems, whereas control systems are continuous-time dynamical systems. Systems consisting of interaction between the two a... View full abstract»

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

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

    We study finite automata running over infinite binary trees and we relax the notion of accepting run by allowing a negligible set (in the sense of measure theory) of non-accepting branches. In this qualitative setting, a tree is accepted by the automaton if there exists a run over this tree in which almost every branch is accepting. This leads to a new class of tree languages, called the qualitati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Languages of Dot-Depth One over Infinite Words

    Publication Year: 2011, Page(s):23 - 32
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB) | HTML iconHTML

    Over finite words, languages of dot-depth one are expressively complete for alternation-free first-order logic. This fragment is also known as the Boolean closure of existential first-order logic. Here, the atomic formulas comprise order, successor, minimum, and maximum predicates. Knast (1983) has shown that it is decidable whether a language has dot-depth one. We extend Knast's result to infinit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes

    Publication Year: 2011, Page(s):33 - 42
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (494 KB) | HTML iconHTML

    We study Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) functions. We consider two different objectives, namely, expectation and satisfaction objectives. Given an MDP with k reward functions, in the expectation objective the goal is to maximize the expected limit-average value, and in the satisfaction objective the goal is to maximize the probability of runs such tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal Specifications with Accumulative Values

    Publication Year: 2011, Page(s):43 - 52
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (330 KB) | HTML iconHTML

    There is recently a significant effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions, aiming for a general and flexible framework for quantitative-oriented specifications. In the heart of quantitative objectives lies the accumulation of values along a computation. It is either t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees

    Publication Year: 2011, Page(s):55 - 64
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (314 KB) | HTML iconHTML

    We present the topos S of trees as a model of guarded recursion. We study the internal dependently-typed higher-order logic of S and show that S models two modal operators, on predicates and types, which serve as guards in recursive definitions of terms, predicates, and types. In particular, we show how to solve recursive type equations involving dependent types. We propose that the internal logic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Imperative Programs as Proofs via Game Semantics

    Publication Year: 2011, Page(s):65 - 74
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (299 KB) | HTML iconHTML

    Game semantics extends the Curry-Howard isomorphism to a three-way correspondence: proofs, programs, strategies. But the universe of strategies goes beyond intuitionistic logics and lambda calculus, to capture stateful programs. In this paper we describe a logical counterpart to this extension, in which proofs denote such strategies. We can embed intuitionistic first-order linear logic into this s... View full abstract»

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

    Publication Year: 2011, Page(s):75 - 84
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    We present a new fully abstract and effectively presentable denotational model for RefML, a paradigmatic higher-order programming language combining call-by-value evaluation and general references in the style of ML. Our model is built using game semantics. In contrast to the previous model by Abramsky, Honda and McCusker, it provides a faithful account of reference types, and the full abstraction... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Computational Meaning of Probabilistic Coherence Spaces

    Publication Year: 2011, Page(s):87 - 96
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB) | HTML iconHTML

    We study the probabilistic coherent spaces - a denotational semantics interpreting programs by power series with non negative real coefficients. We prove that this semantics is adequate for a probabilistic extension of the untyped λ-calculus: the probability that a term reduces to ahead normal form is equal to its denotation computed on a suitable set of values. The result gives, in a proba... View full abstract»

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

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

    We introduce the domain of continuous random variables (CRV) over a domain, as an alternative to Jones and Plotkin's probabilistic power domain. While no known Cartesian-closed category is stable under the latter, we show that the so-called thin (uniform) CRVs define a strong monad on the Cartesian-closed category of bc-domains. We also characterize their inequational theory, as (fair-)coin algebr... View full abstract»

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

    Publication Year: 2011, Page(s):107 - 116
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (287 KB) | HTML iconHTML

    We study the computability of conditional probability, a fundamental notion in probability theory and Bayesian statistics. In the elementary discrete setting, a ratio of probabilities defines conditional probability. In more general settings, conditional probability is defined axiomatically, and the search for more constructive definitions is the subject of a rich literature in probability theory ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent Results

    Publication Year: 2011, Page(s): 119
    Request permission for commercial reuse | PDF file iconPDF (122 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Type System for Complexity Flow Analysis

    Publication Year: 2011, Page(s):123 - 132
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (477 KB) | HTML iconHTML

    We propose a type system for an imperative programming language, which certifies program time bounds. This type system is based on secure flow information analysis. Each program variable has a level and we prevent information from flowing from low level to higher level variables. We also introduce a downgrading mechanism in order to delineate a broader class of programs. Thus, we propose a relatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear Dependent Types and Relative Completeness

    Publication Year: 2011, Page(s):133 - 142
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB) | HTML iconHTML

    A system of linear dependent types for the lambda calculus with full higher-order recursion, called dℓPCF, is introduced and proved sound and relatively complete. Completeness holds in a strong sense: dℓPCF is not only able to precisely capture the functional behaviour of PCF programs (i.e. how the output relates to the input) but also some of their intensional properties, namely the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CoQMTU: A Higher-Order Type Theory with a Predicative Hierarchy of Universes Parametrized by a Decidable First-Order Theory

    Publication Year: 2011, Page(s):143 - 151
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (422 KB) | HTML iconHTML

    We study a complex type theory, a Calculus of Inductive Constructions with a predicative hierarchy of universes and a first-order theory T built in its conversion relation. The theory T is specified abstractly, by a set of constructors, a set of defined symbols, axioms expressing that constructors are free and defined symbols completely defined, and a generic elimination principle relying on cruci... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Isomorphisms of Types in the Presence of Higher-Order References

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

    We investigate the problem of type isomorphisms in a programming language with higher-order references. We first recall the game-theoretic model of higher-order references by Abramsky, Honda and McCusker. Solving an open problem by Laurent, we show that two finitely branching arenas are isomorphic if and only if they are geometrically the same, up to renaming of moves (Laurent's forest isomorphism... View full abstract»

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