2010 25th Annual IEEE Symposium on Logic in Computer Science

11-14 July 2010

Filter Results

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

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

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

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

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

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

    Publication Year: 2010, Page(s):xii - xiii
    Request permission for commercial reuse | PDF file iconPDF (106 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2010, Page(s):xiv - xvi
    Request permission for commercial reuse | PDF file iconPDF (84 KB)
    Freely Available from IEEE
  • Querying the Guarded Fragment

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

    Evaluating a boolean conjunctive query q over a guarded first-order theory T is equivalent to checking whether (T & not q) is unsatisfiable. This problem is relevant to the areas of database theory and description logic. Since q may not be guarded, well known results about the decidability, complexity, and finite-model property of the guarded fragment do not obviously carry over to conjunctive... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment

    Publication Year: 2010, Page(s):11 - 20
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (367 KB) | HTML iconHTML

    We construct finite groups whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class, and only counts transitions between colour classes. These groups are shown to be useful in the construction of finite bisimilar hypergraph covers that avoid any small cyclic configurations. We present two applicatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equality Is Typable in Semi-full Pure Type Systems

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

    There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed judgement of beta-equality directly in the typing system. After being an open problem for some time, the general equivalence between both approaches has been solved by Adams for a class of pure type systems (PTSs) called fu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strong Normalization for System F by HOAS on Top of FOAS

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

    We present a point of view concerning HOAS(Higher-Order Abstract Syntax) and an extensive exercise in HOAS along this point of view. The point of view is that HOAS can be soundly and fruitfully regarded as a definitional extension on top of FOAS (First-Order Abstract Syntax). As such, HOAS is not only an encoding technique, but also a higher-order view of a first-order reality. A rich collection o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Game Semantics for a Polymorphic Programming Language

    Publication Year: 2010, Page(s):41 - 49
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (381 KB) | HTML iconHTML

    A fully abstract game semantics for an idealized programming language with local state and higher rank polymorphism - System F extended with general references - is described. It quite concrete, and extends existing games models by a simple development of the existing question/answer labelling to represent "copycat links" between positive and negative occurrences of type variables, using a notion ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Intuitionistic Logic that Proves Markov's Principle

    Publication Year: 2010, Page(s):50 - 56
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (401 KB) | HTML iconHTML

    We design an intuitionistic predicate logic that supports a limited amount of classical reasoning, just enough to prove a variant of Markov's principle suited for predicate logic. At the computational level, the extraction of an existential witness out of a proof of its double negation is done by using a form of statically-bound exception mechanism, what can be seen as a direct-style variant of Fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Amir Pnueli: A Gentle Giant, Lord of the Phi's and the Psi's

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

    The following topics are dealt with: finite model theory; logic and automata; semantics; process calculi; and coalgebras. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robin Milner, a Craftsman of Tools for the Mind

    Publication Year: 2010, Page(s):58 - 59
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (187 KB) | HTML iconHTML

    The paper discusses about the programming language ML (or MetaLanguage) as a language for manipulating formal systems. It has also had much influence on the further development of functional programming languages. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Alternating Timed Automata over Bounded Time

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

    Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, in providing verification algorithms for prominent specification formalisms such as Metric Temporal Logic. Unfortunately, when interpreted over an infinite dense time domain (such as the reals), alternating time automata ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regular Cost Functions over Finite Trees

    Publication Year: 2010, Page(s):70 - 79
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (371 KB) | HTML iconHTML

    We develop the theory of regular cost functions over finite trees: aquantitative extension to the notion of regular languages of trees: Cost functions map each input (tree) to a value in ω + 1, and are considered modulo an equivalence relation which forgets about specific values, but preserves boundedness of functions on all subsets of the domain. We introduce nondeterministic and alternati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parikh Images of Grammars: Complexity and Applications

    Publication Year: 2010, Page(s):80 - 89
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (393 KB) | HTML iconHTML

    Parikh's Theorem states that semilinear sets are effectively equivalent with the Parikh images of regular languages and those of context-free languages. In this paper, we study the complexity of Parikh's Theorem over any fixed alphabet size d. We prove various normal form the oremsin the case of NFAs and CFGs. In particular, the normalform theorems ensure that a union of linear sets with dgenerato... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction

    Publication Year: 2010, Page(s):90 - 99
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (386 KB) | HTML iconHTML

    The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously been applied to the study of CSPs with finite or (infinite) ω-categorical templates. Our first result is an exact characterization of those CSPs that can be formulated with (a finite or) an ω-categorical temp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Conditions for Taylor Varieties and CSP

    Publication Year: 2010, Page(s):100 - 109
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (354 KB) | HTML iconHTML

    We provide two new characterizations for finitely generated varieties with Taylor terms. The first characterization is using "absorbing sets" and the second one "cyclic operations". These new conditions allow us to reprove the conjecture of Bang-Jensen and Hell (proved by the authors, comp. STOC'08, SICOMP'09) and the characterization of locally finite Taylor varieties using weak near-unanimity op... View full abstract»

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

    Publication Year: 2010, Page(s): 110
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (173 KB)

    Summary form only given. Simple views of systems are often convenient in their design and analysis. However, attackers may attempt to exploit any oversimplification. For security, it is therefore useful to understand the value and the limitations of simplistic models. Computational-soundness theorems, which are the main subject of this lecture, can sometimes shed light on this question. We discuss... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modular Construction of Fixed Point Combinators and Clocked Böhm Trees

    Publication Year: 2010, Page(s):111 - 119
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (390 KB) | HTML iconHTML

    Fixed point combinators (and their generalization: looping combinators) are classic notions belonging to the heart of λ-calculus and logic. We start with an exploration of the structure of fixed point combinators (fpc's), vastly generalizing the wellknown fact that if Yis an fpc, Y(SI) is again an fpc, generating the Böhm sequence of fpc's. Using the infinitary λ-calculus we ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursion Schemes and Logical Reflection

    Publication Year: 2010, Page(s):120 - 129
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    Let R be a class of generators of node-labelled infinite trees, and Lbe a logical language for describing correctness properties of the setrees. Given r in R and phi in L, we say that r_phi is aphi-reflection of r just if (i) r and r_phi generate the same underlying tree, and (ii) suppose a node u of the tree t(r) generated by r has label f, then the label of the node u of t(r_phi) is f* if uin t(... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Undecidability of Propositional Separation Logic and Its Neighbours

    Publication Year: 2010, Page(s):130 - 139
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (373 KB) | HTML iconHTML

    Separation logic has proven an effective formalism for the analysis of memory-manipulating programs. We show that the purely propositional fragment of separation logic is undecidable. In fact, for any choice of concrete heap-like model of separation logic, validity in that model remains undecidable. Besides its intrinsic technical interest, this result also provides new insights into the nature of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Undecidability of Boolean BI through Phase Semantics

    Publication Year: 2010, Page(s):140 - 149
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (366 KB) | HTML iconHTML

    We solve the open problem of the decidability of Boolean BI logic (BBI), which can be considered as the core of separation and spatial logics. For this, we define a complete phase semantics for BBI and characterize it as trivial phase semantics. We deduce an embedding between trivial phase semantics for intuitionistic linear logic (ILL) and Kripke semantics for BBI. We single out a fragment of ILL... View full abstract»

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