Scheduled Maintenance on May 23rd, 2017:
IEEE Xplore will undergo an upgrade from 1:00 - 4:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

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
  • Advice about logical AI

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

    Formalized nonmonotonic reasoning emerged in relation to the study of artificial intelligence. The paper discusses some uses of nonmonotonic reasoning that has become a mathematical subject, observations regarding AI, and the problems logical AI encountered before it can reach human level intelligence. 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.
  • 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.
  • Dependent intersection: a new way of defining records in type theory

    Publication Year: 2003, Page(s):86 - 95
    Cited by:  Papers (2)
    Request permission for commercial 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.
  • 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.
  • Strong bisimilarity on basic parallel processes in PSPACE-complete

    Publication Year: 2003, Page(s):218 - 227
    Cited by:  Papers (3)
    Request permission for commercial 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.
  • Orienting equalities with the Knuth-Bendix order

    Publication Year: 2003, Page(s):75 - 84
    Cited by:  Papers (1)
    Request permission for commercial 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 s1 ≃ t1, . . . , sn ≃ tn, does there exist a simplification ordering > which orients the system, that is for every i ∈ {1, ..., n}, either si > ti or ti > si. This problem can be used in rewriting for fi... 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.
  • Logical definability and query languages over unranked trees

    Publication Year: 2003, Page(s):178 - 187
    Cited by:  Papers (1)
    Request permission for commercial 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.
  • System ST β-reduction and completeness

    Publication Year: 2003, Page(s):21 - 31
    Request permission for commercial 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.
  • 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.
  • An NP decision procedure for protocol insecurity with XOR

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

    We provide a method for deciding the insecurity of cryptographic protocols in presence of the standard Dolev-Yao intruder (with a finite number of sessions) extended with so-called oracle rules, i.e., deduction rules that satisfy certain conditions. As an instance of this general framework, we ascertain that protocol insecurity is in NP for an intruder that can exploit the properties of the XOR op... 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.
  • Abstract saturation-based inference

    Publication Year: 2003, Page(s):65 - 74
    Cited by:  Papers (1)
    Request permission for commercial 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.
  • 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.
  • On automatic partial orders

    Publication Year: 2003, Page(s):168 - 177
    Cited by:  Papers (3)
    Request permission for commercial 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.
  • 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.
  • Model checking guarded protocols

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

    The parameterized model checking problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, C||Un, comprised of a control process, C, and finitely, but arbitrarily, many copies of a user process, U, executing concurrently with interleaving semantics. We delineate the decidability/undecidability boundary of the PMCP for all possible systems that arise ... View full abstract»

    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 (9)
    Request permission for commercial 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 → B = !A → 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. Second... 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.
  • 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.