Proceedings 16th Annual IEEE Symposium on Logic in Computer Science

16-19 June 2001

Filter Results

Displaying Results 1 - 25 of 43
  • Proceedings 16th Annual IEEE Symposium on Logic in Computer Science

    Publication Year: 2001
    Request permission for reuse | PDF file iconPDF (242 KB)
    Freely Available from IEEE
  • Probabilistic polynomial-time process calculus and security protocol analysis

    Publication Year: 2001, Page(s):3 - 5
    Cited by:  Papers (2)
    Request permission for reuse | PDF file iconPDF (265 KB) | HTML iconHTML
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Definitions by rewriting in the calculus of constructions

    Publication Year: 2001, Page(s):9 - 18
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (876 KB) | HTML iconHTML

    Considers an extension of the calculus of constructions where predicates can be defined with a general form of rewrite rules. We prove the strong normalization of the reduction relation generated by the /spl beta/-rule and user-defined rules under some general syntactic conditions, including confluence. As examples, we show that two important systems satisfy these conditions: (i) a sub-system of t... View full abstract»

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

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

    Decision procedures for equality in a combination of theories are at the core of a number of verification systems. R.E. Shostak's (J. of the ACM, vol. 31, no. 1, pp. 1-12, 1984) decision procedure for equality in the combination of solvable and canonizable theories has been around for nearly two decades. Variations of this decision procedure have been implemented in a number of specification and v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A decision procedure for an extensional theory of arrays

    Publication Year: 2001, Page(s):29 - 37
    Cited by:  Papers (30)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (729 KB) | HTML iconHTML

    A decision procedure for a theory of arrays is of interest for applications in formal verification, program analysis and automated theorem proving. This paper presents a decision procedure for an extensional theory of arrays and proves it correct. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On ordering constraints for deduction with built-in Abelian semigroups, monoids and groups

    Publication Year: 2001, Page(s):38 - 47
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (954 KB) | HTML iconHTML

    It is crucial for the performance of ordered resolution or paramodulation-based deduction systems that they incorporate specialized techniques to work efficiently with standard algebraic theories E. Essential ingredients for this purpose are term orderings that are E-compatible, for the given E, and algorithms deciding constraint satisfiability for such orderings. In this paper, we introduce a uni... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Successive approximation of abstract transition relations

    Publication Year: 2001, Page(s):51 - 58
    Cited by:  Papers (22)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (671 KB) | HTML iconHTML

    Recently, we have improved the efficiency of the predicate abstraction scheme presented by Das, Dill and Park (1999). As a result, the number of validity checks needed to prove the necessary verification condition has been reduced. The key idea is to refine an approximate abstract transition relation based on the counter-example generated. The system starts with an approximate abstract transition ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bound on attacks on payment protocols

    Publication Year: 2001, Page(s):61 - 70
    Cited by:  Papers (9)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (958 KB) | HTML iconHTML

    Electronic payment protocols are designed to work correctly in the presence of an adversary that can prompt honest principals to engage in an unbounded number of concurrent instances of the protocol. This paper establishes an upper bound on the number of protocol instances needed to attack a large class of protocols, which contains versions of some well-known electronic payment protocols, includin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dichotomy in the complexity of propositional circumscription

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

    The inference problem for propositional circumscription is known to be highly intractable and, in fact, harder than the inference problem for classical propositional logic. More precisely, in its full generality this problem in /spl Pi//sub 2//sup P/-complete, which means that it has the same inherent computational complexity as the satisfiability problem for quantified Boolean formulas with two a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relating semantic and proof-theoretic concepts for polynomial time decidability of uniform word problems

    Publication Year: 2001, Page(s):81 - 90
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1025 KB) | HTML iconHTML

    Compares three approaches to polynomial-time decidability for uniform word problems for quasi-varieties. Two of the approaches, by T. Evans (1951) and S. Burris (1995), respectively, are semantic, referring to certain embeddability and axiomatizability properties. The third approach is more proof-theoretic in nature, inspired by D. McAllester's (1993) concept of local inference. We define two clos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantics of name and value passing

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

    Provides a semantic framework for (first-order) message-passing process calculi by combining categorical theories of abstract syntax with binding and operational semantics. In particular, we obtain abstract rule formats for name and value passing with both late and early interpretations. These formats induce an initial-algebra/final-coalgebra semantics that is compositional, respects substitution ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fully abstract game semantics of local exceptions

    Publication Year: 2001, Page(s):105 - 114
    Cited by:  Papers (13)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (891 KB) | HTML iconHTML

    A fully abstract game semantics for an extension of Idealized Algol with locally declared exceptions is presented. It is based on "Hyland-Ong games" (J.M.E. Hyland & C.-H.L. Ong, 1995), but as well as relaxing the constraints which impose functional behavior (as in games models of other computational effects, such as continuations and references), new structure is added to plays in the form of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A universal characterization of the closed Euclidean interval

    Publication Year: 2001, Page(s):115 - 125
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (978 KB) | HTML iconHTML

    We propose a notion of interval object in a category with finite products, providing a universal property for closed and bounded real line segments. The universal property gives rise to an analogue of primitive recursion for defining computable functions on the interval. We use this to define basic arithmetic operations and to verify equations between them. We test the notion in categories of inte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logician in the land of OS: abstract state machines in Microsoft

    Publication Year: 2001, Page(s):129 - 136
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (647 KB) | HTML iconHTML

    Analysis of foundational problems like "What is computation" leads to a sketch of the paradigm of abstract state machines (ASMs). This is followed by a brief discussion on ASMs applications. Then we present some theoretical problems that bridge between the traditional LICS themes and abstract state machines. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Eliminating definitions and Skolem functions in first-order logic

    Publication Year: 2001, Page(s):139 - 146
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (647 KB) | HTML iconHTML

    In any classical first-order theory that proves the existence of at least two elements, one can eliminate definitions with a polynomial bound on the increase in proof length. The author considers how in any classical first-order theory strong enough to code finite functions, including sequential theories, one can also eliminate Skolem functions with a polynomial bound on the increase in proof leng... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the decision problem for the guarded fragment with transitivity

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

    The guarded fragment with transitive guards, [GF+TG], is an extension of GF in which certain relations are required to be transitive, transitive predicate letters appear only in guards of the quantifiers and the equality symbol may appear everywhere. We prove that the decision problem for [GF+TG] is decidable. This answers the question posed in (Ganzinger et al., 1999). Moreover, we show that the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The hierarchy inside closed monadic /spl Sigma//sub 1/ collapses on the infinite binary tree

    Publication Year: 2001, Page(s):157 - 166
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (923 KB) | HTML iconHTML

    Closed monadic /spl Sigma//sub 1/, as proposed in (Ajtai et al., 1998), is the existential monadic second order logic where alternation between existential monadic second order quantifiers and first order quantifiers is allowed. Despite some effort very little is known about the expressive power of this logic on finite structures. We construct a tree automaton which exactly characterizes closed mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On definability of order in logic with choice

    Publication Year: 2001, Page(s):167 - 172
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (560 KB) | HTML iconHTML

    We will answer questions due to Blass and Gurevich (2000) on definability of order in the first-order logic with Hilbert's epsilon operation. We show that a linear ordering is almost surely definable in models with random choice. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A second-order system for polytime reasoning using Gradel's theorem

    Publication Year: 2001, Page(s):177 - 186
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (936 KB) | HTML iconHTML

    We introduce a second-order system V/sub 1/-Horn of bounded arithmetic formalizing polynomial-time reasoning, based on Gradel's (1992) second-order Horn characterization of P. Our system has comprehension over P predicates (defined by Gradel's second-order Horn formulas), and only finitely, many function symbols. Other systems of polynomial-time reasoning either allow induction on NP predicates (s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Crane Beach Conjecture

    Publication Year: 2001, Page(s):187 - 196
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (896 KB) | HTML iconHTML

    A language L over an alphabet A is said to have a neutral letter if there is a letter e/spl isin/A such that inserting or deleting e's from any word in A* does not change its membership (or non-membership) in L. The presence of a neutral letter affects the definability of a language in first-order logic. It was conjectured that it renders all numerical predicates apart from the order predicate use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • "An n! lower bound on formula size"

    Publication Year: 2001, Page(s):197 - 206
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (896 KB) | HTML iconHTML

    We introduce a new Ehrenfeucht-Fraisse game for proving lower bounds on the size of first-order formulas. Up until now such games have only been used to prove bounds on the operator depth of formulas, not their size. We use this game to prove that the CTL/sup +/ formula Occur/sub n//spl equiv/E[Fp/sub 1//spl and/Fp/sub 2//spl and//spl middot//spl middot//spl middot//spl and/F/sub n/] which says th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Light affine lambda calculus and polytime strong normalization

    Publication Year: 2001, Page(s):209 - 220
    Cited by:  Papers (12)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (868 KB) | HTML iconHTML

    Light linear logic (LLL) and its variant, intuitionistic light affine logic (ILAL), are logics of polytime computation. All polynomial-time functions are representable by proofs of these logics (via the proofs-as-programs correspondence), and, conversely, that there is a specific reduction (cut-elimination) strategy which normalizes a given proof in polynomial time (the latter may well be called t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intensionality, extensionality, and proof irrelevance in modal type theory

    Publication Year: 2001, Page(s):221 - 230
    Cited by:  Papers (16)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (812 KB) | HTML iconHTML

    We develop a uniform type theory that integrates intensionality, extensionality and proof irrelevance as judgmental concepts. Any object may be treated intensionally (subject only to /spl alpha/-conversion), extensionally (subject also to /spl beta//spl eta/-conversion), or as irrelevant (equal to any other object at the same type), depending on where it occurs. Modal restrictions developed by R. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dependent types for program termination verification

    Publication Year: 2001, Page(s):231 - 242
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1035 KB) | HTML iconHTML

    Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is still undeniably a difficult task to design a termination checker for a realistic programming language that supports general recursion. In this paper, we present an approach to program termination verification that makes use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Foundational proof-carrying code

    Publication Year: 2001, Page(s):247 - 256
    Cited by:  Papers (56)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (776 KB) | HTML iconHTML

    Proof-carrying code is a framework for the mechanical verification of safety properties of machine-language programs, but the problem arises of "quis custodiat ipsos custodes" - i.e. who verifies the verifier itself? Foundational proof-carrying code is verification from the smallest possible set of axioms, using the simplest possible verifier and the smallest possible runtime system. I describe ma... View full abstract»

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