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
  • Higher dimensional multigraphs

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

    We introduce the notion of higher dimensional multigraph. This notion extends that of multigraph, which underlies multicategories and is essentially equivalent to the notion of context-free grammar. We develop the definition and explain how it gives a semantically coherent category theoretic approach to the notion of higher order context-free grammar. It also gives a conceptual framework in which ... 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 (13)
    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.
  • The fusion calculus: expressiveness and symmetry in mobile processes

    Publication Year: 1998, Page(s):176 - 185
    Cited by:  Papers (25)
    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.
  • Freedom, weakness, and determinism: from linear-time to branching-time

    Publication Year: 1998, Page(s):81 - 92
    Cited by:  Papers (14)
    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.
  • 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.
  • The logical role of the four-valued bilattice

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

    In his well-known paper “How computer should think” (1977) Belnap argues that four-valued semantics is a very suitable setting for computerized reasoning. In this paper we vindicate this thesis by showing that the logical role that the four-valued structure has among Ginsberg's well-known bilattices is similar to the role that the two-valued algebra has among Boolean algebras View full abstract»

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

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

    Coinduction is often seen as a way of implementing infinite objects. Since real numbers are typical infinite objects, it may not come as a surprise that calculus, when presented in a suitable way, is permeated by coinductive reasoning. What is surprising is that mathematical techniques, recently developed in the context of computer science, seem to be shedding a new light on some basic methods of ... 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 (28)
    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.
  • 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.
  • A congruence theorem for structured operational semantics of higher-order languages

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

    In this paper we describe the promoted tyft/tyxt rule format for defining higher-order languages. The rule format is a generalization of Groote and Vaandrager's tyft/tyxt format in which terms are allowed as labels on transitions in rules. We prove that bisimulation is a congruence for any language defined in promoted tyft/tyxt format and demonstrate the usefulness of the rule format by presenting... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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.
  • 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.
  • Secure implementation of channel abstractions

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

    Communication in distributed systems often relies on useful abstractions such as channels, remote procedure calls, and remote method invocations. The implementations of these abstractions sometimes provide security properties, in particular through encryption. In this paper we study those security properties, focusing on channel abstractions. We introduce a simple high-level language that includes... 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.
  • 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.
  • A fully abstract game semantics for general references

    Publication Year: 1998, Page(s):334 - 344
    Cited by:  Papers (40)
    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.
  • 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.
  • 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.
  • Realizability for constructive theory of functions and classes and its application to program synthesis

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

    This paper gives a q-realizability interpretation for Feferman's constructive theory T0 of functions and classes by using a set completion program without doubling variables, and proves its soundness. This result solves an open problem proposed by Feferman in 1979. Moreover by using this interpretation we can prove a program extraction theorem for T0, which enables us to use ... 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 (15)
    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.
  • 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.
  • 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.
  • 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.