2008 23rd Annual IEEE Symposium on Logic in Computer Science

24-27 June 2008

Filter Results

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

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

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

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

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

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

    Publication Year: 2008, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (148 KB) | HTML iconHTML
    Freely Available from IEEE
  • Committee Lists

    Publication Year: 2008, Page(s):xi - xii
    Request permission for commercial reuse | PDF file iconPDF (150 KB)
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2008, Page(s):xiii - xiv
    Request permission for commercial reuse | PDF file iconPDF (138 KB)
    Freely Available from IEEE
  • Cryptographically-Sound Protocol-Model Abstractions

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

    We present a formal theory for cryptographically-sound theorem proving. Our starting point is the Backes-Pfitzmann-Waidner (BPW) model, which is a symbolic protocol model that is cryptographically sound in the sense of blackbox reactive simulatability. To achieve cryptographic soundness, this model is substantially more complex than standard symbolic models and the main challenge in formalizing an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Expressiveness and Complexity of Randomization in Finite State Monitors

    Publication Year: 2008, Page(s):18 - 29
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (333 KB) | HTML iconHTML

    The continuous run-time monitoring of the behavior of a system is a technique that is used both as a complementary approach to formal verification and testing to ensure reliability, as well as a means to discover emergent properties in a distributed system, like intrusion and event correlation. The monitors in all these scenarios can be abstractly viewed as automata that process a (unbounded) stre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining Generic Judgments with Recursive Definitions

    Publication Year: 2008, Page(s):33 - 44
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (293 KB) | HTML iconHTML

    Many semantical aspects of programming languages, such as their operational semantics and their type assignment calculi, are specified by describing appropriate proof systems. Recent research has identified two proof-theoretic features that allow direct, logic-based reasoning about such descriptions: the treatment of atomic judgments as fixed points (recursive definitions) and an encoding of bindi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mechanizing the Metatheory of LF

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

    LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as proofs of correctness of decision procedures for LF's judgments. Although detailed informal proofs of these properties have been published, they have not been formally verified in a theorem prover. We have formalized these... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Second-Order and Dependently-Sorted Abstract Syntax

    Publication Year: 2008, Page(s):57 - 68
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB) | HTML iconHTML

    The paper develops a mathematical theory in the spirit of categorical algebra that provides a model theory for second-order and dependently-sorted syntax. The theory embodies notions such as alpha-equivalence, variable binding, capture-avoiding simultaneous substitution, term metavariable, meta-substitution, mono and multi sorting, and sort dependency. As a matter of illustration, a model is used ... View full abstract»

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

    Publication Year: 2008, Page(s):69 - 80
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (265 KB) | HTML iconHTML

    Tait's method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed lambda-calculi. Historically, these proofs have been extremely difficult to formalize in proof assistants with weak meta-logics, such as Twelf, and yet they are often straightforward in proof assistants with stronger meta-logics. In this pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Types for Hereditary Permutators

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

    This paper answers the open problem of finding a type system that characterizes hereditary permutators. First this paper shows that there does not exist such a type system by showing that the set of hereditary permutators is not recursively enumerable. The set of positive primitive recursive functions is used to prove it. Secondly this paper gives a best-possible solution by providing a countably ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Context Matching for Compressed Terms

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

    This paper is an investigation of the matching problem for term equations s = t where s contains context variables and first-order variables, and both terms s and t are given using some kind of compressed representation. The main result is a polynomial time algorithm for context matching with dags, when the number of different context variables is fixed for the problem. NP-completeness is obtained... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonlocal Flow of Control and Kleene Algebra with Tests

    Publication Year: 2008, Page(s):105 - 117
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (303 KB) | HTML iconHTML

    Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. It can model basic programming and verification constructs such as conditional tests, while loops, and Hoare triples, thus providing a relatively simple equational approach to program equivalence and partial correctness. In... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Logic for Algebraic Effects

    Publication Year: 2008, Page(s):118 - 129
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (325 KB) | HTML iconHTML

    We present a logic for algebraic effects, based on the algebraic representation of computational effects by operations and equations. We begin with the a-calculus, a minimal calculus which separates values, effects, and computations and thereby canonises the order of evaluation. This is extended to obtain the logic, which is a classical first-order multi-sorted logic with higher-order value and co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algebraic Process Calculus

    Publication Year: 2008, Page(s):130 - 141
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    We present an extension of the piI-calculus with formal sums of terms. A study of the properties of this sum reveals that its neutral element can be used to make assumptions about the behaviour of the environment of a process. Furthermore, the formal sum appears as a fundamental construct that can be used to decompose both internal and external choice. From these observations, we derive an enriche... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Expressiveness and Decidability of Higher-Order Process Calculi

    Publication Year: 2008, Page(s):145 - 155
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (333 KB) | HTML iconHTML

    In higher-order process calculi the values exchanged in communications may contain processes. A core calculus of higher-order concurrency is studied; it has only the operators necessary to express higher-order communications: input prefix, process output, and parallel composition. By exhibiting a nearly deterministic encoding of Minsky machines, the calculus is shown to be Turing complete and ther... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Axiomatizability of Impossible Futures: Preorder versus Equivalence

    Publication Year: 2008, Page(s):156 - 165
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (261 KB) | HTML iconHTML

    We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We prove that no finite, sound axiomatization for BCCSP modulo impossible futures equivalence is ground-complete. By contrast, we present a finite, sound, ground-complete axiomatization for BCCSP modulo impossible futures preorder. If the alphabet of actions is infinite, then this axiomatizatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • General Structural Operational Semantics through Categorical Logic

    Publication Year: 2008, Page(s):166 - 177
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (350 KB) | HTML iconHTML

    Certain principles are fundamental to operational semantics, regardless of the languages or idioms involved. Such principles include rule-based definitions and proof techniques for congruence results. We formulate these principles in the general context of categorical logic. From this general formulation we recover precise results for particular language idioms by interpreting the logic in particu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent Programs

    Publication Year: 2008, Page(s):181 - 192
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (337 KB) | HTML iconHTML

    Dataflow analysis for concurrent programs is a problem of critical importance but, unfortunately, also an undecidable one. A key obstacle is to determine precisely how dataflow facts at a location in a given thread could be affected by operations of other threads.This problem, in turn, boils down to pairwise reachability, i.e., given program locations c<sub>1</sub> and c<sub>2<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Winning Regions of Higher-Order Pushdown Games

    Publication Year: 2008, Page(s):193 - 204
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (270 KB) | HTML iconHTML

    In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested "stack of stacks" structures. Representing higher-order stacks as well-bracketed words in the usual way, we show that the winning regions of these games are regular sets of words. Moreover a finite automaton recognising th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Ordinal Recursive Complexity of Lossy Channel Systems

    Publication Year: 2008, Page(s):205 - 216
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (305 KB) | HTML iconHTML

    We show that reachability and termination for lossy channel systems is exactly at level F<sub>omega</sub>omega in the fast-growing hierarchy of recursive functions, the first level that dominates all multiply-recursive functions. View full abstract»

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