Scheduled Maintenance on August 31st, 2016:
IEEE Xplore will undergo system maintenance from 1:00 - 3:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

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

Date 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.
  • Author index

    Publication Year: 2003, Page(s): 393
    Request permission for commercial reuse | PDF file iconPDF (222 KB)
    Freely Available from IEEE
  • 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.
  • Reasoning about hierarchical storage

    Publication Year: 2003, Page(s):33 - 44
    Cited by:  Papers (4)
    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.
  • Tractable conservative constraint satisfaction problems

    Publication Year: 2003, Page(s):321 - 330
    Cited by:  Papers (18)
    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.
  • 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.
  • Homomorphism closed vs. existential positive

    Publication Year: 2003, Page(s):311 - 320
    Cited by:  Papers (4)
    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.
  • On program equivalence in languages with ground-type references

    Publication Year: 2003, Page(s):108 - 117
    Cited by:  Papers (1)
    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.
  • Micro-macro stack systems: a new frontier of elementary decidability for sequential systems

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

    We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack graphs are the configuration graphs of stack automata whose states are partitioned into micro and macro states. Nodes of the graph are configurations of the stack automaton where the state is a macro state. Edges of the graph c... 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.
  • 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.
  • Structural subtyping of non-recursive types is decidable

    Publication Year: 2003, Page(s):96 - 107
    Request permission for commercial 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 Σ be a language consisting of function symbol and let 𝒞; (with a finite or infinite domain C) be an L-structure where L is a language consisting of relation symbols. We introduce the notio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model-checking trace event structures

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

    Given regular collection of Mazurkiewicz traces, which can be seen as the behaviors of a finite-state concurrent system, one can associate with it a canonical regular event structure. This event structure is a single (often infinite) structure that captures both the concurrency and conflict information present in the system. We study the problem of model-checking such structures against logics suc... 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 (7)
    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.
  • About translations of classical logic into polarized linear logic

    Publication Year: 2003, Page(s):11 - 20
    Cited by:  Papers (3)
    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.
  • 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.
  • Spectra of monadic second-order formulas with one unary function

    Publication Year: 2003, Page(s):291 - 300
    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.
  • Logic in access control

    Publication Year: 2003, Page(s):228 - 233
    Cited by:  Papers (23)  |  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.
  • Model checking guarded protocols

    Publication Year: 2003, Page(s):361 - 370
    Cited by:  Papers (5)
    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.
  • An NP decision procedure for protocol insecurity with XOR

    Publication Year: 2003, Page(s):261 - 270
    Cited by:  Papers (10)
    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.
  • Revisiting digitization, robustness, and decidability for timed automata

    Publication Year: 2003, Page(s):198 - 207
    Cited by:  Papers (1)
    Request permission for commercial 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.
  • New directions in instantiation-based theorem proving

    Publication Year: 2003, Page(s):55 - 64
    Cited by:  Papers (3)
    Request permission for commercial 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.
  • A constraint-based presentation and generalization of rows

    Publication Year: 2003, Page(s):331 - 340
    Cited by:  Papers (1)
    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.
  • 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.