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 reuse | PDF file iconPDF (268 KB)
    Freely Available from IEEE
  • Logic and over-simplification

    Publication Year: 1998, Page(s):2 - 3
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (61 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.
  • Fixed-point logics on planar graphs

    Publication Year: 1998, Page(s):6 - 15
    Cited by:  Papers (19)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (180 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.
  • Existential second-order logic over strings

    Publication Year: 1998, Page(s):16 - 27
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (283 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.
  • Ordering finite variable types with generalized quantifiers

    Publication Year: 1998, Page(s):28 - 43
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    Let Q be a finite set of generalized quantifiers. By L/sup k/(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 L/sup k/(Q)-types in 21. For some special classes of generalized quantifiers Q, we show that such an ordering of L/sup k/(Q)-... 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 reuse | Click to expandAbstract | PDF file iconPDF (237 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(a/sub 1/, ..., a/sub n/) on first-order properties of a/sub 1/, ..., a/sub n/ that have been established by previous random decisions. In this paper we investiga... 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 (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (222 KB)

    The Horn /spl mu/-calculus is a logic programming language allowing arbitrary nesting of least and greatest fixed points. The Horn /spl mu/-programs can naturally express safety and liveness properties for reactive systems. We extend the set-based analysis of classical logic programs by mapping arbitrary /spl mu/-programs into "uniform" /spl mu/-programs. Our two main results are that uniform /spl... 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 (34)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (257 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 on the cover... 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 (21)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (245 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 /spl mu/-calculus is a branching-time temporal logic with fixed-point operators. As such, it is a convenient logic for symbolic model-checking t... 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 (22)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (240 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.
  • Secure implementation of channel abstractions

    Publication Year: 1998, Page(s):105 - 116
    Cited by:  Papers (15)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (197 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 logical role of the four-valued bilattice

    Publication Year: 1998, Page(s):118 - 126
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (195 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.
  • Completeness of a relational calculus for program schemes

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

    The relational calculus MU/sub 2/, 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.
  • Monadic logic and automata: recent developments

    Publication Year: 1998, Page(s):136 - 138
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (82 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.
  • Phase semantics and verification of concurrent constraint programs

    Publication Year: 1998, Page(s):141 - 152
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (272 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 "semantical" pro... 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 (12)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (246 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.
  • Bisimulation in name-passing calculi without matching

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

    We study barbed equivalence in name-passing languages where there is no matching construct for testing equality between names. We concentrate on the /spl pi/-calculus with capability types and subtypes, of which the untyped /spl pi/-calculus without matching is a special case. We give a coinductive characterisation of typed barbed equivalence, and present "bisimulation up-to" techniques to enhance... 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 (30)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    We present the fusion calculus as a significant step towards a canonical calculus of concurrency. It simplifies and extends the /spl pi/-calculus. The fusion calculus contains the polyadic /spl pi/-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.... 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 reuse | Click to expandAbstract | PDF file iconPDF (143 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.
  • Higher dimensional multigraphs

    Publication Year: 1998, Page(s):199 - 206
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (223 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.
  • An axiomatics for categories of transition systems as coalgebras

    Publication Year: 1998, Page(s):207 - 213
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (193 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.
  • A theory of recursive domains with applications to concurrency

    Publication Year: 1998, Page(s):214 - 225
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (221 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.
  • 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 reuse | Click to expandAbstract | PDF file iconPDF (299 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.
  • Process operations in extended dynamic logic

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

    Modal logic becomes action logic by adding programs as in propositional dynamic logic or the /spl mu/-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 serv... 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 (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (278 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.