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 commercial 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.
  • Types and programming languages: the next generation

    Publication Year: 2003
    Request permission for commercial 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.
  • Author index

    Publication Year: 2003, Page(s): 393
    Request permission for commercial reuse | PDF file iconPDF (222 KB)
    Freely Available from IEEE
  • Labeled Markov processes: stronger and faster approximations

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

    This paper proposes a measure-theoretic reconstruction of the approximation schemes developed for labeled Markov processes: approximants are seen as quotients with respect to sets of temporal properties expressed in a simple logic. This gives the possibility of customizing approximants with respect to properties of interest and is thus an important step towards using automated techniques intended ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A constraint-based presentation and generalization of rows

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

    We study the combination of possibly conditional nonstructural subtyping constraints with rows. We give a new presentation of rows, where row terms disappear; instead, we annotate constraints with filters. We argue that, in the presence of subtyping, this approach is simpler and more general. In the case where filters are finite or cofinite sets of row labels, we give a constraint solving algorith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tractable conservative constraint satisfaction problems

    Publication Year: 2003, Page(s):321 - 330
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (526 KB) | HTML iconHTML

    In a constraint satisfaction problem (CSP), the aim is to find an assignment of values to a given set of variables, subject to specified constraints. The CSP is known to be NP-complete in general. However, certain restrictions on the form of the allowed constraints can lead to problems solvable in polynomial time. Such restrictions are usually imposed by specifying a constraint language. The princ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Homomorphism closed vs. existential positive

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

    Preservations theorems, which establish connection between syntactic and semantic properties of formulas, are a major topic of investigation in model theory. In the context of finite-model theory, most, but not all, preservation theorems are known to fail. It is not known, however, whether the Los-Tarski-Lyndon theorem, which asserts that a first-order sentence is preserved under homomorphisms if ... 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 (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (402 KB) | HTML iconHTML

    A first-order sentence θ of vocabulary σ ∪ {S} is successor-invariant in the finite if for every finite σ-structure M and successor relations S1 and S2 on M, (M, S1) ╞ θ ⇔ (M, S2) ╞ θ. In this pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence law for random graphs with specified degree sequence

    Publication Year: 2003, Page(s):301 - 310
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (549 KB) | HTML iconHTML

    The degree sequence of an n-vertex graph is d0, ..., dn - 1, where each di is the number of vertices of degree i in the graph. A random graph with degree sequence d0, ..., dn - 1 is a randomly selected member of the set of graphs on {0, ..., n - 1} with that degree sequence, all choices being equally likely. Let λ 0, λ... 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
    Request permission for commercial 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.
  • Spectra of monadic second-order formulas with one unary function

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

    We establish the eventual periodicity of the spectrum of any monadic second-order formula where: (i) all relation symbols, except equality, are unary, and (ii) there is only one function symbol and that symbol is unary. 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 commercial 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 Π20-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ω plus quantifier-free choice QF-AC. We shall als... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The planning spectrum - one, two, three, infinity

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

    Linear temporal logic (LTL) is widely used for defining conditions on the execution paths of dynamic systems. In the case of dynamic systems that allow for nondeterministic evolutions, one has to specify, along with an LTL formula φ, which are the paths that are required to satisfy the formula. Two extreme cases are the universal interpretation A.φ, which requires to satisfy the formula fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectrum hierarchies and subdiagonal functions

    Publication Year: 2003, Page(s):281 - 290
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB) | HTML iconHTML

    The spectrum of a first-order sentence is the set of cardinalities of its finite models. Relatively little is known about the subclasses of spectra that are obtained by looking only at sentences with a specific signature. In this paper, we study natural subclasses of spectra and their closure properties under simple subdiagonal functions. We show that many natural closure properties turn out to be... 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 (1)
    Request permission for commercial 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.
  • A proof theory for generic judgments: an extended abstract

    Publication Year: 2003, Page(s):118 - 127
    Cited by:  Papers (6)
    Request permission for commercial 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.
  • Logic in access control

    Publication Year: 2003, Page(s):228 - 233
    Cited by:  Papers (26)  |  Patents (8)
    Request permission for commercial 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.
  • Satisfiability in alternating-time temporal logic

    Publication Year: 2003, Page(s):208 - 217
    Cited by:  Papers (1)
    Request permission for commercial 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.
  • Query evaluation on compressed trees

    Publication Year: 2003, Page(s):188 - 197
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial 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.
  • Intruder deductions, constraint solving and insecurity decision in presence of exclusive or

    Publication Year: 2003, Page(s):271 - 280
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (495 KB) | HTML iconHTML

    We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties such as xor, we extend the conventional Dolev-Yao model by permitting the intruder to exploit these properties. We show ... 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 commercial 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.
  • Proof nets for unit-free multiplicative-additive linear logic (extended abstract)

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

    First Page of the Article
    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 (3)
    Request permission for commercial 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.
  • Model checking for probability and time: from theory to practice

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

    Probability features increasingly often in software and hardware systems: it is used in distributed coordination and routing problems, to model fault-tolerances and performance, and to provide adaptive resource management strategies. Probabilistic model checking is an automatic procedure for establishing if a desired property holds in a probabilistic specifications such as "leader election is even... 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 commercial 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.