2009 24th Annual IEEE Symposium on Logic In Computer Science

11-14 Aug. 2009

Filter Results

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

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

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

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

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

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

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

    Publication Year: 2009, Page(s):x - xi
    Request permission for commercial reuse | PDF file iconPDF (113 KB)
    Freely Available from IEEE
  • Additional reviewers

    Publication Year: 2009, Page(s):xii - xiii
    Request permission for commercial reuse | PDF file iconPDF (84 KB)
    Freely Available from IEEE
  • My 27-year Quest to Overcome the State Explosion Problem

    Publication Year: 2009, Page(s): 3
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (93 KB) | HTML iconHTML

    Model checking is an automatic verification technique for state-transition systems that are finite-state or that have finite-state abstractions. In the early 1980's in a series of joint papers with my graduate students E.A. Emerson and A.P. Sistla, we proposed that model checking could be used for verifying concurrent systems and gave algorithms for this purpose. At roughly the same time, Joseph S... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The General Vector Addition System Reachability Problem by Presburger Inductive Invariants

    Publication Year: 2009, Page(s):4 - 13
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the classical Kosaraju-Lambert-Mayr-Sacerdote-Tenney decomposition. This decomposition is used in this paper to prove that the Parikh images of languages accepted by VASs are semi-pseudo-linear; a class that extends the semi-linea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applications of Game Semantics: From Program Analysis to Hardware Synthesis

    Publication Year: 2009, Page(s):17 - 26
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (409 KB) | HTML iconHTML

    After informally reviewing the main concepts from game semantics and placing the development of the field in a historical context we examine its main applications. We focus in particular on finite state model checking, higher order model checking and more recent developments in hardware design. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks

    Publication Year: 2009, Page(s):27 - 36
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (239 KB) | HTML iconHTML

    The problem of pairwise CFL-reachability is to decide whether two given program locations in different threads are simultaneously reachable in the presence of recursion in threads and scheduling constraints imposed by synchronization primitives. Pairwise CFL-reachability is the core problem underlying concurrent program analysis especially dataflow analysis. Unfortunately, it is undecidable even f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Psi-calculi: Mobile Processes, Nominal Data, and Logic

    Publication Year: 2009, Page(s):39 - 48
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted between processes and their names can be statically scoped using the standard pi-calculus mechanism to allow for scope migrations. Other proposed extensions of the pi-calculus can be formulated as psi-calculi; examples incl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algebra for Kripke Polynomial Coalgebras

    Publication Year: 2009, Page(s):49 - 58
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB) | HTML iconHTML

    Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from constants and identities, using product, coproduct and powerset. Locally finite Kripke polynomial coalgebras can be characterized up to bisimulation by a specification language that generalizes Kleenepsilas regular expressi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trace Semantics is Fully Abstract

    Publication Year: 2009, Page(s):59 - 68
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (229 KB) | HTML iconHTML

    The discussion in the computer-science literature of the relative merits of linear- versus branching-time frameworks goes back to the early 1980s. One of the beliefs dominating this discussion has been that the linear-time framework is not expressive enough semantically, making linear-time logics lacking in expressiveness. In this work we examine the branching-linear issue from the perspective of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logical Step-Indexed Logical Relations

    Publication Year: 2009, Page(s):71 - 80
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (311 KB) | HTML iconHTML

    We show how to reason about "step-indexed" logical relations in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially to be an essential element of the method. Specifically, we define a logic LSLR, which is inspired by Plotkin and Abadi's logic for parametricity, but also supports recursively defined relations by means of the modal "... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fully Abstract Logical Bisimilarity for a Polymorphic Object Calculus

    Publication Year: 2009, Page(s):81 - 90
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (277 KB) | HTML iconHTML

    We characterise type structurally the termination observational congruence of Abadi and Cardellipsilas Sforall calculus. Pittspsila operational reasoning approach for polymorphic lambda calculi is enhanced with subtyping and primitive covariant object types. Labelling each object with a bound ordinal of terminating method invocations and regarding omega-bounded as unlabelled reduction w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reflexive Scott Domains are Not Complete for the Extensional Lambda Calculus

    Publication Year: 2009, Page(s):91 - 100
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (337 KB) | HTML iconHTML

    A longstanding open problem is whether there exists a model of the untyped lambda calculus in the category CPO of complete partial orderings and Scott continuous functions, whose theory is exactly the least lambda-theory lambda-beta or the least extensional lambda-theory lambda-beta-eta. In this paper we analyze the class of reflexive Scott domains, the models of lambda-calculus living in the cate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Substructural Operational Semantics as Ordered Logic Programming

    Publication Year: 2009, Page(s):101 - 110
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB) | HTML iconHTML

    We describe a substructural logic with ordered, linear, and persistent propositions and then endow a fragment with a committed choice forward-chaining operational interpretation. Exploiting higher-order terms in this metalanguage, we specify the operational semantics of a number of object language features, such as call-by-value, call-by-name, call-by-need, mutable store, parallelism, communicatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logics with Rank Operators

    Publication Year: 2009, Page(s):113 - 122
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (338 KB) | HTML iconHTML

    We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations of the counting operations in FP+C (i.e. fixed-point logic with counting) that allow us to count the dimension of a definable vector space, rather than just count the cardinality of a definable set. The logics we define have da... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations

    Publication Year: 2009, Page(s):123 - 132
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (333 KB) | HTML iconHTML

    We show that every finitely satisfiable two-variable first-order formula with two equivalence relations has a model of size at most triply exponential with respect to its length. Thus the finite satisfiability problem for two-variable logic over the class of structures with two equivalence relations is decidable in nondeterministic triply exponential time. We also show that replacing one of the eq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pointer Programs and Undirected Reachability

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

    Pointer programs are a model of structured computation within LOGSPACE. They capture the common description of LOGSPACE algorithms as programs that take as input some structured data (e.g. a graph) and that store in memory only a constant number of pointers to the input (e.g. to the graph nodes). In this paper we study undirected s-t-reachability for a class of pure pointer programs in which one c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it

    Publication Year: 2009, Page(s):145 - 156
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (334 KB) | HTML iconHTML

    This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to Voege and Jurdzinski. First, we informally show which structures are difficult to solve for the algorithm. Second, we outline a family of games on which the algorithm requires exponentially many strategy iterations, answering in the negative the long-standing question whether this ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graph Reachability and Pebble Automata over Infinite Alphabets

    Publication Year: 2009, Page(s):157 - 166
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (265 KB) | HTML iconHTML

    We study the graph reachability problem as a language over an infinite alphabet. Namely, we view a word of even length a0b0 ... an b_n over an infinite alphabet as a directed graph with the symbols that appear in a0b0 ... anbn as the vertices and (a0, b0),...,(an, bn) as the edges. We prov... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Improved Lower Bound for the Complementation of Rabin Automata

    Publication Year: 2009, Page(s):167 - 176
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (279 KB) | HTML iconHTML

    Automata on infinite words (omega-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of omega-automata is a crucial instrument in many these applications, and hence there have been great interests in determining the state complexity of the complementation problem. However, obtaining nontrivial lower bounds has been diff... View full abstract»

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