18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.

22-25 June 2003

Filter Results

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

    Publication Year: 2003
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the abstract representation of cut-free proofs modulo inessential commutations of rules. The only known extension to additives, based on monomial weights, fails to preserve this key feature: a host of cut-free monomial proof nets can correspond to the same cut-free proof. Thus the problem of finding a sati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proof nets for unit-free multiplicative-additive linear logic (extended abstract)

    Publication Year: 2003, Page(s):1 - 10
    Cited by:  Papers (3)
    Request permission for reuse | PDF file iconPDF (402 KB) | HTML iconHTML
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • About translations of classical logic into polarized linear logic

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

    We show that the decomposition of intuitionistic logic into linear logic along the equation A /spl rarr/ B = !A /spl rarr/ B may be adapted into a decomposition of classical logic into LLP, the polarized version of Linear Logic. Firstly, we build a categorical model of classical logic (a control category) from a categorical model of linear logic by a construction similar to the co-Kleisli category... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • System ST /spl beta/-reduction and completeness

    Publication Year: 2003, Page(s):21 - 31
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (367 KB) | HTML iconHTML

    We prove that system ST (introduced in a previous work) enjoys subject reduction and is complete for realizability semantics. As far as the author knows, this is the only type system enjoying the second property. System ST is a very expressive type system, whose principle is to use two kinds of formulae: types (formulae with algorithmic content) and propositions (formulae without algorithmic conte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Types and programming languages: the next generation

    Publication Year: 2003
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (177 KB)

    Summary form only given. This tutorial surveys the state of the art in type systems for programming languages, focusing on the achievements and changes in emphasis during the past decade. The first part of the talk considers the trajectory of work on object types, one of the major hot topics of the early and mid-'90s. Following some fundamental conceptual breakthroughs, the focus of attention in t... View full abstract»

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

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

    In this paper, we develop a new substructural logic that can encode invariants necessary for reasoning about hierarchical storage. We show how the logic can be used to describe the layout of bits in a memory word, the layout of memory words in a region, the layout of regions in an address space, or even the layout of address spaces in a multiprocessing environment. We provide a semantics for our f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal verification at Intel

    Publication Year: 2003, Page(s):45 - 54
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (436 KB) | HTML iconHTML

    As designs become more complex, formal verification techniques are becoming increasingly important in the hardware industry. Many different methods are used, ranging from propositional tautology checking up to use of interactive higher-order theorem provers. Our own work is mainly concerned with the formal verification of floating-point mathematical functions. As this paper illustrates, such appli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New directions in instantiation-based theorem proving

    Publication Year: 2003, Page(s):55 - 64
    Cited by:  Papers (23)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (359 KB) | HTML iconHTML

    We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by proposition tests. We give a model construction proof of completeness by which restrictive inference systems as well as admissible simplification techniques can be justified. Another contribution of the paper are inference systems that allow one t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstract saturation-based inference

    Publication Year: 2003, Page(s):65 - 74
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (324 KB) | HTML iconHTML

    Solving goals - like deciding word problems or resolving constraints - is much easier in some theory presentations than in others. What have been called "completion processes", in particular in the study of equational logic, involve finding appropriate presentations of a given theory to solve easily a given class of problems. We provide a general proof-theoretic setting within which completion-lik... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Orienting equalities with the Knuth-Bendix order

    Publication Year: 2003, Page(s):75 - 84
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (347 KB) | HTML iconHTML

    Orientability of systems of equalities is the following problem: given a system of equalities s/sub 1/ /spl sime/ t/sub 1/, . . . , s/sub n/ /spl sime/ t/sub n/, does there exist a simplification ordering > which orients the system, that is for every i /spl isin/ {1, ..., n}, either s/sub i/ > t/sub i/ or t/sub i/ > s/sub i/. This problem can be used in rewriting for finding a canonical r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dependent intersection: a new way of defining records in type theory

    Publication Year: 2003, Page(s):86 - 95
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (333 KB) | HTML iconHTML

    Records and dependent records are a powerful tool for programming, representing mathematical concepts, and program verification. In this last decade several type systems with records as primitive types were proposed. The question is arisen whether it is possible to define record type in existent type theories using standard types without introducing new primitives. It was known that independent re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structural subtyping of non-recursive types is decidable

    Publication Year: 2003, Page(s):96 - 107
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (669 KB) | HTML iconHTML

    We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of decidable theories. Let /spl Sigma/ be a language consisting of function symbol and let /spl Cscr/; (with a finite or infinite domain C) be an L-structure where L is a language consisting of relation symbols. We introduce t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On program equivalence in languages with ground-type references

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

    Using game semantics we prove that program equivalence is undecidable in finitary Idealized Algol with active expressions as well as in its call-by-value counterpart. It is also shown that strategies corresponding to Idealized Algol terms of respectively second, third and higher orders define exactly regular, context-free and recursively enumerable languages. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A proof theory for generic judgments: an extended abstract

    Publication Year: 2003, Page(s):118 - 127
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (966 KB)

    A powerful and declarative means of specifying computations containing abstractions involves meta-level, universally quantified generic judgments. We present a proof theory for such judgments in which signatures are associated to each sequent (used to account for eigenvariables of sequent) and to each formula in the sequent (used to account for generic variables locally scoped over the formula). A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polynomial-time algorithms from ineffective proofs

    Publication Year: 2003, Page(s):128 - 137
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (383 KB) | HTML iconHTML

    We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of /spl Pi//sub 2//sup 0/-theorems in feasible analysis. By ineffective proof we mean a proof which involves the noncomputational principle weak Konig's lemma WKL, and by feasible analysis we mean Cook and Urquhart's system CPV/sup /spl omega// plus quantifier-free choice QF-AC. We shall also discu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity of resolution refinements

    Publication Year: 2003, Page(s):138 - 147
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (415 KB) | HTML iconHTML

    Resolution is the most widely studied approach to propositional theorem proving. In developing efficient resolution-based algorithms, dozens of variants and refinements of resolution have been studied from both the empirical and analytical sides. The most prominent of these refinements are: DP (Davis-Putnam) (ordered), DLL (tree), semantic, negative, linear and regular resolution. In this paper, w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Successor-invariance in the finite

    Publication Year: 2003, Page(s):148 - 157
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (402 KB) | HTML iconHTML

    A first-order sentence /spl theta/ of vocabulary /spl sigma/ /spl cup/ {S} is successor-invariant in the finite if for every finite /spl sigma/-structure M and successor relations S/sub 1/ and S/sub 2/ on M, (M, S/sub 1/) /spl vDash/ /spl theta/ /spl hArr/ (M, S/sub 2/) /spl vDash/ /spl theta/. In this paper I give an example of a non-first-order definable class of finite structures, which is, how... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Will deflation lead to depletion? On non-monotone fixed point inductions

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

    We survey logical formalisms based on inflationary and deflationary fixed points, and compare them to the (more familiar) logics based on least and greatest fixed points. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On automatic partial orders

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

    We investigate partial orders that are computable, in a precise sense, by finite automata. Our emphasis is on trees and linear orders. We study the relationship between automatic linear orders and trees in terms of rank functions that are versions of Cantor-Bendixson rank. We prove that automatic linear orders and automatic trees have finite rank. As an application we provide a procedure for decid... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logical definability and query languages over unranked trees

    Publication Year: 2003, Page(s):178 - 187
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    Unranked trees, that is, trees with no restriction on the number of children of nodes, have recently attracted much attention, primarily as an abstraction of XML (Extensible Markup Language) documents. In this paper, we study logical definability over unranked trees, as well as collections of unranked trees, that can be viewed as databases of XML documents. The traditional approach to definability... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query evaluation on compressed trees

    Publication Year: 2003, Page(s):188 - 197
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (379 KB) | HTML iconHTML

    This paper studies the problem of evaluating unary (or node-selecting) queries on unranked trees compressed in a natural structure-preserving way, by the sharing of common subtrees. The motivation to study unary queries on unranked trees comes from the database field, where querying XML (Extensible Markup Language) documents, which can be considered as unranked labeled trees, is an important task.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Revisiting digitization, robustness, and decidability for timed automata

    Publication Year: 2003, Page(s):198 - 207
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (558 KB) | HTML iconHTML

    We consider several questions related to the use of digitization techniques for timed automata. These very successful techniques reduce dense-time language inclusion problems to discrete time, but are applicable only when the implementation is closed under digitization and the specification is closed under inverse digitization. We show that, for timed automata, the former (whether the implementati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Satisfiability in alternating-time temporal logic

    Publication Year: 2003, Page(s):208 - 217
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (542 KB) | HTML iconHTML

    Alternating-time temporal logic (ATL) is a branching-time temporal logic that naturally describes computations of multi-agent distributed systems and multi-player games. In particular, ATL explicitly allows for the expression of coalitional ability in such situations. We present an automata-based decision procedure for ATL, by translating the satisfiability problem for ATL to the nonemptiness prob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strong bisimilarity on basic parallel processes in PSPACE-complete

    Publication Year: 2003, Page(s):218 - 227
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (357 KB) | HTML iconHTML

    The paper shows an algorithm which, given a basic parallel processes (BPP) system, constructs a set of linear mappings which characterize the (strong) bisimulation equivalence on the system. Though the number of the constructed mappings can be exponential, they can be generated in polynomial space; this shows that the problem of deciding bisimulation equivalence on BPP is in PSAPCE. Combining with... View full abstract»

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

    Publication Year: 2003, Page(s):228 - 233
    Cited by:  Papers (36)  |  Patents (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (228 KB) | HTML iconHTML

    Access control is central to security in computer systems. Over the years, there have been many efforts to explain and improve access control, sometimes with logical ideas and tools. This paper is a partial survey and discussion of the role of logic in access control. It considers logical foundations for access control and their applications, in particular in languages for programming security pol... View full abstract»

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