20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)

26-29 June 2005

Filter Results

Displaying Results 1 - 25 of 57
  • Proceedings. 20th Annual IEEE Symposium on Logic in Computer Science

    Publication Year: 2005
    Request permission for reuse | PDF file iconPDF (48 KB)
    Freely Available from IEEE
  • [Cover]

    Publication Year: 2005, Page(s):i - iv
    Request permission for reuse | PDF file iconPDF (67 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2005, Page(s):v - ix
    Request permission for reuse | PDF file iconPDF (49 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 2005, Page(s): x
    Request permission for reuse | PDF file iconPDF (25 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference organization

    Publication Year: 2005, Page(s): xi
    Request permission for reuse | PDF file iconPDF (19 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2005, Page(s): xii
    Request permission for reuse | PDF file iconPDF (13 KB)
    Freely Available from IEEE
  • Additional reviewers

    Publication Year: 2005, Page(s): xiii
    Request permission for reuse | PDF file iconPDF (20 KB)
    Freely Available from IEEE
  • Relations in concurrency

    Publication Year: 2005, Page(s):2 - 11
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (291 KB) | HTML iconHTML

    The theme of this paper is profunctors, and their centrality and ubiquity in understanding concurrent computation. Profunctors (a.k.a. distributors, or bimodules) are a generalisation of relations to categories. Here they are first presented and motivated via spans of event structures, and the semantics of nondeterministic dataflow. Profunctors are shown to play a key role in relating models for c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regular expressions in process algebra

    Publication Year: 2005, Page(s):12 - 19
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (205 KB) | HTML iconHTML

    We tackle an open question of Milner (1984). We define a set of so-called well-behaved finite automata that, modulo bisimulation equivalence, corresponds exactly to the set of regular expressions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modal characterisation theorems over special classes of frames

    Publication Year: 2005, Page(s):21 - 30
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (277 KB) | HTML iconHTML

    We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthem's theorem, which says that a first-order formula is invariant under bisimulation if and only if it is equivalent to a formula of basic modal logic. The present investigation primarily concerns ramifications for specific cl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal logics over unranked trees

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

    We consider unranked trees that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of first-order (FO) and monadic second-order logic (MSO) for them via various temporal logics. We look at both unordered trees and ordered trees (in which children of the same node are ordered by the next-sibling relation), and characterize Boolean and u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On locality and uniform reduction

    Publication Year: 2005, Page(s):41 - 50
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (306 KB) | HTML iconHTML

    Uniform reduction for pairs originates from abstract logic but it has not been studied much in the context of finite model theory. The paper demonstrates its relationship to locality. The first part of the paper is motivated by the question when first-order logic extended with quantifiers is Hanf-local. Two properties, tolerant Hanf-locality and separable Hanf-locality are defined, both of which e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Looping caterpillars [semistructured data querying]

    Publication Year: 2005, Page(s):51 - 60
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (277 KB) | HTML iconHTML

    There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis is given by a small addition to tree walk automata and the corresponding caterpillar expressions. These are evaluated on unranked finite sibling-ordered trees. At the expression level we add an operator whose meaning is in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalizing parametricity using information-flow

    Publication Year: 2005, Page(s):62 - 71
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (269 KB) | HTML iconHTML

    Run-time type analysis allows programmers to easily and concisely define operations based upon type structure, such as serialization, iterators, and structural equality. However, when types can be inspected at run time, nothing is secret. A module writer cannot use type abstraction to hide implementation details from clients: clients can determine the structure of these supposedly "abstract" data ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relational parametricity and control

    Publication Year: 2005, Page(s):72 - 81
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (292 KB) | HTML iconHTML

    We study the equational theory of Parigot's second-order /spl lambda//spl mu/-calculus in connection with a call-by-name continuation-passing style (CPS) translation into a fragment of the second-order /spl lambda/-calculus. It is observed that the relational parametricity on the target calculus induces a natural notion of equivalence on the /spl lambda//spl mu/-terms. On the other hand, the uncon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive polymorphic types and parametricity in an operational framework

    Publication Year: 2005, Page(s):82 - 91
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (323 KB) | HTML iconHTML

    We construct a realizability model of recursive polymorphic types, starting from an untyped language of terms and contexts. An orthogonality relation e/spl perp//spl pi/ indicates when a term e and a context /spl pi/ may be safely combined in the language. Types are interpreted as sets of terms closed by biorthogonality. Our main result states that recursive types are approximated by converging se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantic subtyping for the /spl pi/-calculus

    Publication Year: 2005, Page(s):92 - 101
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (334 KB) | HTML iconHTML

    Subtyping relations for the /spl pi/-calculus are usually defined in a syntactic way, by means of structural rules. We propose a semantic characterisation of channel types and use it to derive a subtyping relation. The type system we consider includes read-only and write-only channel types, as well as Boolean combinations of types. A set-theoretic interpretation of types is provided, in which Bool... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An insider's guide to logic in telecommunications data

    Publication Year: 2005, Page(s):104 - 105
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (76 KB) | HTML iconHTML

    Most of the functionality of modern telecommunication systems has migrated to software, and much of that software consists of code for manipulating data: data describing either subscriber features or equipment configuration. The data is generally hierarchically structured but extremely complex - it consists of hundreds or even thousands of "classes" (roughly speaking, distinct labels on a tree), w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On digraph coloring problems and treewidth duality

    Publication Year: 2005, Page(s):106 - 115
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (294 KB) | HTML iconHTML

    It is known that every constraint satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructions, we observe that the reduction is quantifier-free. Using this, we illustrate the power of the logical approach to CSPs by resolving two conjectures about treewidth duality in the digraph case. The point is that the ana... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantitative analysis of probabilistic pushdown automata: expectations and variances

    Publication Year: 2005, Page(s):117 - 126
    Cited by:  Papers (11)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (343 KB) | HTML iconHTML

    Probabilistic pushdown automata (pPDA) have been identified as a natural model for probabilistic programs with recursive procedure calls. Previous works considered the decidability and complexity of the model-checking problem for pPDA and various probabilistic temporal logics. In this paper we concentrate on computing the expected values and variances of various random variables defined over runs ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verifying infinite Markov chains with a finite attractor or the global coarseness property

    Publication Year: 2005, Page(s):127 - 136
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (302 KB) | HTML iconHTML

    We consider infinite Markov chains which either have a finite attractor or satisfy the global coarseness property. Markov chains derived from probabilistic lossy channel systems (PLCS) or probabilistic vector addition systems with states (PVASS) are classic examples for these types, respectively. We consider three different variants of the reachability problem and the repeated reachability problem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recognizing /spl omega/-regular languages with probabilistic automata

    Publication Year: 2005, Page(s):137 - 146
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (297 KB) | HTML iconHTML

    Probabilistic finite automata as acceptors for languages over finite words have been studied by many researchers. In this paper, we show how probabilistic automata can serve as acceptors for /spl omega/-regular languages. Our main results are that our variant of probabilistic Buchi automata (PBA) is more expressive than non-deterministic /spl omega/-automata, but a certain subclass of PBA, called ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A polynomial time Presburger criterion and synthesis for number decision diagrams

    Publication Year: 2005, Page(s):147 - 156
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (301 KB) | HTML iconHTML

    Number decision diagrams (NDD) are the automata-based symbolic representation for manipulating sets of integer vectors encoded as strings of digit vectors (least or most significant digit first). Since 1969 (A. Cobham, 1969, A. Semenov, 1977), we know that any Presburger-definable set (M. Presburger, 1929) (a set of integer vectors satisfying a formula in the first-order additive theory of the int... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model checking vs. generalized model checking: semantic minimizations for temporal logics

    Publication Year: 2005, Page(s):158 - 167
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (290 KB) | HTML iconHTML

    Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions generated by automatic techniques such as predicate abstraction. Indeed, for the same cost, model checking three-valued abstractions can be used to both prove and disprove any temporal-logic property, whereas traditional c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model-checking hierarchical structures

    Publication Year: 2005, Page(s):168 - 177
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (301 KB) | HTML iconHTML

    Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph definitions allow to specify graphs of exponential size using polynomial size descriptions. In many cases, this succinctness increases the computational complexity of decision problems when input graphs are defined hierarchic... View full abstract»

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