By Topic

Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226)

24-24 June 1998

Filter Results

Displaying Results 1 - 25 of 49
  • Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226)

    Publication Year: 1998
    Request permission for commercial reuse | PDF file iconPDF (268 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1998, Page(s):537 - 538
    Request permission for commercial reuse | PDF file iconPDF (129 KB)
    Freely Available from IEEE
  • Linear logic with boxes

    Publication Year: 1998, Page(s):309 - 320
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    Interaction nets provide a graphical paradigm of computation based on net rewriting. By encoding the cut-elimination process of linear logic they have proved successful in understanding the dynamics of reduction in the λ-calculus. G. Gonthier et al. (1992) gave an optimal infinite system of interaction nets for linear logic by removing the global boxes. However efficient implementations of ... View full abstract»

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

    Publication Year: 1998, Page(s):300 - 308
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    Much effort has been recently devoted to the study of polytime formal (and especially logical) systems. The purpose of such systems is manyfold. On the theoretical side, they provide a better understanding of what is the logical essence of polytime reduction (and other complexity classes). On the practical side, via the well known Curry-Howard correspondence, they yield sophisticated typing system... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A stability theorem in rewriting theory

    Publication Year: 1998, Page(s):287 - 298
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    One key property of the λ-calculus is that there exists a minimal computation (the head-reduction) M→eV from a λ-term M to the set of its head-normal forms. Minimality here means categorical “reflectivity” i.e. that every reduction path M→fW to a head-normal form W factors (up to redex permutation) to a path M→eV→... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient representation and validation of proofs

    Publication Year: 1998, Page(s):93 - 104
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    This paper presents a logical framework derived from the Edinburgh Logical Framework (LF) that can be used to obtain compact representations of proofs and efficient proof checkers. These are essential ingredients of any application that manipulates proofs as first-class objects, such as a Proof-Carrying Code system, in which proofs are used to support easy validation of properties of safety-critic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decision problems in ordered rewriting

    Publication Year: 1998, Page(s):276 - 286
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    A term rewrite system (TRS) terminates if its rules are contained in a reduction ordering >. In order to deal with any set of equations, including inherently non-terminating ones (like commutativity), TRS have been generalised to ordered TRS (E, >), where equations of E are applied in whatever direction agrees with >. The confluence of terminating TRS is well-known to be decidable, but fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Freedom, weakness, and determinism: from linear-time to branching-time

    Publication Year: 1998, Page(s):81 - 92
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    Model checking is a method for the verification of systems with respect to their specifications. Symbolic model-checking, which enables the verification of large systems, proceeds by calculating fixed-point expressions over the system's set of states. The μ-calculus is a branching-time temporal logic with fixed-point operators. As such, it is a convenient logic for symbolic model-checking tools... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The relation between second-order unification and simultaneous rigid E-unification

    Publication Year: 1998, Page(s):264 - 275
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    Simultaneous rigid E-unification, or SREU for short, is a fundamental problem that arises in global methods of automated theorem proving in classical logic with equality. In order to do proof search in intuitionistic logic with equality one has to handle SREU as well. Furthermore, restricted forms of SREU are strongly related to word equations and finite tree automata. It was recently shown that s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On model checking for non-deterministic infinite-state systems

    Publication Year: 1998, Page(s):70 - 80
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    We demonstrate that many known algorithms for model checking infinite-state systems can be derived uniformly from a reachability procedure that generates a “covering graph”, a generalization of the Karp-Miller graph for Petri Nets. Each node of the covering graph has an associated non-empty set of reachable states, which makes it possible to model check safety properties of the system ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Herbrand's theorem, automated reasoning and semantic tableaux

    Publication Year: 1998, Page(s):252 - 263
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    We overview recent results related to Herbrand's theorem and tableau-like methods of automated deduction and prove some new results. Based on an analysis and discussion of these results, new research directions are suggested View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Horn mu-calculus

    Publication Year: 1998, Page(s):58 - 69
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    The Horn μ-calculus is a logic programming language allowing arbitrary nesting of least and greatest fixed points. The Horn μ-programs can naturally express safety and liveness properties for reactive systems. We extend the set-based analysis of classical logic programs by mapping arbitrary μ-programs into “uniform” μ-programs. Our two main results are that uniform μ-pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Process operations in extended dynamic logic

    Publication Year: 1998, Page(s):244 - 250
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    Modal logic becomes action logic by adding programs as in propositional dynamic logic or the μ-calculus. Modal languages can be seen as decidable fragments of first-order logic that admit a natural bisimulation, and hence enjoy a good model theory. Recently, much stronger `guarded fragments' of first-order logic have been identified that enjoy the same pleasant features. The latter can serve as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence results for relational Bayesian networks

    Publication Year: 1998, Page(s):44 - 55
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB)

    Relational Bayesian networks are an extension of the method of probabilistic model construction by Bayesian networks. They define probability distributions on finite relational structures by conditioning the probability of a ground atom r(a1, ..., a n) on first-order properties of a1, ..., an that have been established by previous random decisions. In t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • L.E.J. Brouwer's intuitionism: a revolution in two installments

    Publication Year: 1998, Page(s):228 - 241
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    There are two main periods in Brouwer's foundational activities. The first one is covered by the dissertation of 1907 and subsequent papers. The second one starts in 1918 with the introduction of choice sequences. Both periods have their own specific characteristics. The first period is less mature, with a stronger critical component, the second is more the scholarly presentation of a program and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ordering finite variable types with generalized quantifiers

    Publication Year: 1998, Page(s):28 - 43
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    Let Q be a finite set of generalized quantifiers. By Lk(Q) we denote the k-variable fragment of FO(Q), first order logic extended with Q. We show that for each k, there is a PFP(Q)-definable linear pre-order whose equivalence classes in any finite structure 21 are the Lk(Q)-types in 21. For some special classes of generalized quantifiers Q, we show that such an ordering of L... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A theory of recursive domains with applications to concurrency

    Publication Year: 1998, Page(s):214 - 225
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    We develop a 2-categorical theory for recursively defined domains. In particular we generalise the traditional approach based on order-theoretic structures to category-theoretic ones. A motivation for this development is the need of a domain theory for concurrency, with an account of bisimulation. Indeed, the leading examples throughout the paper are provided by recursively defined presheaf models... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monadic logic and automata: recent developments

    Publication Year: 1998, Page(s):136 - 138
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    This tutorial surveys selected recent results on the connection between monadic second-order logic and finite automata. As a unifying idea, the role of automata as normal forms of monadic formulas is pursued. In the first part we start from an automata-theoretic interpretation of existential monadic second-order formulas and in this framework explain the monadic quantifier alternation hierarchy ov... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Existential second-order logic over strings

    Publication Year: 1998, Page(s):16 - 27
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    Existential second-order logic (ESO) and monadic second-order logic (MSO) have attracted much interest in logic and computer science. ESO is a much more expressive logic over word structures than MSO. However, little was known about the relationship between MSO and syntactic fragments of ESO. We shed light on this issue by completely characterizing this relationship for the prefix classes of ESO o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear vs. branching time: a complexity-theoretic perspective

    Publication Year: 1998, Page(s):394 - 405
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB)

    The discussion of the relative merits of linear versus branching time frameworks goes back to early 1980s. One of the beliefs dominating this discussion has been that “while specifying is easier in LTL (linear-temporal logic), verification is easier for CTL (branching-temporal logic)”. Indeed, the restricted syntax of CTL limits its expressive power and many important behaviours (e.g.,... View full abstract»

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

    Publication Year: 1998, Page(s):2 - 3
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (64 KB)

    The author looks at the development of BAN logic, and with hindsight, considers the oversimplifications that were made View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Completeness of type assignment systems with intersection, union, and type quantifiers

    Publication Year: 1998, Page(s):368 - 379
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    This paper develops type assignment systems for intersection and union types, and type quantifiers. The known system for these types is not semantically complete. We introduce a certain class of typing statements, called stable statements, which include all statements without type quantifiers, and we show that the known system is complete for stable statements if we add two axiom schemas expressin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An axiomatics for categories of transition systems as coalgebras

    Publication Year: 1998, Page(s):207 - 213
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    We consider a finitely branching transition system as a coalgebra for an endofunctor on the category Set of small sets. A map in that category is a functional bisimulation. So, we study the structure of the category of finitely branching transition systems and functional bisimulations by proving general results about the category H-Coalg of H-coalgebras for an endofunctor H on Set. We give conditi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive types in games: axiomatics and process representation

    Publication Year: 1998, Page(s):345 - 356
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    This paper presents two basic results on game-based semantics of FPC, a metalanguage with sums, products, exponentials and recursive types. First we give an axiomatic account of the category of games G, offering a fundamental structural analysis of the category as well as a transparent way to prove computational adequacy. As a consequence we obtain an intensional full-abstraction result through a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Completeness of a relational calculus for program schemes

    Publication Year: 1998, Page(s):127 - 134
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    The relational calculus MU2, presented in de Roever's dissertation as a framework for describing and proving properties of programs, was conjectured by David Park to be complete. In this paper we confirm Park's conjecture View full abstract»

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