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
  • How to specify and verify the long-run average behaviour of probabilistic systems

    Publication Year: 1998, Page(s):454 - 465
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    Long-run average properties of probabilistic systems refer to the average behaviour of the system, measured over a period of time whose length diverges to infinity. These properties include many relevant performance and reliability indices, such as system throughput, average response time, and mean time between failures. In this paper, we argue that current formal specification methods cannot be u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The fusion calculus: expressiveness and symmetry in mobile processes

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

    We present the fusion calculus as a significant step towards a canonical calculus of concurrency. It simplifies and extends the π-calculus. The fusion calculus contains the polyadic π-calculus as a proper subcalculus and thus inherits all its expressive power. The gain is that fusion contains actions akin to updating a shared state, and a scoping construct for bounding their effects. Therefo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fixed-point logics on planar graphs

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

    We study the expressive power of inflationary fixed-point logic IFP and inflationary fixed-point logic with counting IFP+C on planar graphs. We prove the following results: (1) IFP captures polynomial time on 3-connected planar graphs, and IFP+C captures polynomial time on arbitrary planar graphs. (2) Planar graphs can be characterized up to isomorphism in a logic with finitely many variables and ... 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.
  • On proofs about threshold circuits and counting hierarchies

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

    We define theories of Bounded Arithmetic characterizing classes of functions computable by constant-depth threshold circuits of polynomial and quasipolynomial size. Then we define certain second-order theories and show that they characterize the functions in the Counting Hierarchy. Finally we show that the former theories are isomorphic to the latter via the so-called RSUV-isomorphism View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A logical characterization of bisimulation for labeled Markov processes

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

    This paper gives a logical characterization of probabilistic bisimulation for Markov processes. Bisimulation can be characterized by a very weak modal logic. The most striking feature is that one has no negation or any kind of negative proposition. Bisimulation can be characterized by several inequivalent logics; we report five in this paper and there are surely many more. We do not need any finit... 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 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→h... 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.
  • Bisimulation in name-passing calculi without matching

    Publication Year: 1998, Page(s):165 - 175
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB)

    We study barbed equivalence in name-passing languages where there is no matching construct for testing equality between names. We concentrate on the π-calculus with capability types and subtypes, of which the untyped π-calculus without matching is a special case. We give a coinductive characterisation of typed barbed equivalence, and present “bisimulation up-to” techniques to enh... 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 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.
  • A fully abstract game semantics for general references

    Publication Year: 1998, Page(s):334 - 344
    Cited by:  Papers (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    A games model of a programming language with higher-order store in the style of ML-references is introduced. The category used for the model is obtained by relaxing certain behavioural conditions on a category of games previously used to provide fully abstract models of pure functional languages. The model is shown to be fully abstract by means of factorization arguments which reduce the question ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Full abstraction for first-order objects with recursive types and subtyping

    Publication Year: 1998, Page(s):380 - 391
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    We present a new interpretation of typed object-oriented concepts in terms of well-understood, purely procedural concepts, that preserves observational equivalence. More precisely, we give compositional translations of (a) Ob1μ, an object calculus supporting method invocation and functional method update with first-order object types and recursive types, and (b) Ob1<:μ View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The first-order theory of ordering constraints over feature trees

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

    The system FT⩽ of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate the first-order theory of FT⩽ and its fragments, both over finite trees and over possibly infinite trees. We prove that the first-order theory of FT⩽ is undecidable, in contrast to the ... 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 (17)
    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.
  • 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.
  • Compositional analysis of expected delays in networks of probabilistic I/O automata

    Publication Year: 1998, Page(s):466 - 477
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of composition, for constructing a PIOA for a composite system from a collection of PIOAs representing the components. We present a method for computing completion probability and expected completion time for PIOAs. Our meth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Type theory via exact categories

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

    Partial equivalence relations (and categories of these) are a standard tool in semantics of type theories and programming languages, since they often provide a cartesian closed category with extended definability. Using the theory of exact categories, we give a category-theoretic explanation of why the construction of a category of partial equivalence relations often produces a cartesian closed ca... 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.
  • Phase semantics and verification of concurrent constraint programs

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

    The class CC of concurrent constraint programming languages and its non-monotonic extension LCC based on linear constraint systems can be given a logical semantics in Girard's intuitionistic linear logic for a variety of observables. In this paper we settle basic completeness results and we show how the phase semantics of linear logic can be used to provide simple and very concise “semantica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedded finite models, stability theory, and the impact of order

    Publication Year: 1998, Page(s):490 - 500
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    We extend bounds on the expressive power of first-order logic over finite structures and over ordered finite structures, by generalizing to the situation where the finite structures are embedded in an infinite structure M, where M satisfies some simple combinatorial properties studied in model-theoretic stability theory. We first consider first-order logic over finite structures embedded in a stab... 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.