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
  • 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.
  • 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.
  • 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.
  • 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.
  • Fixed-point logics on planar graphs

    Publication Year: 1998, Page(s):6 - 15
    Cited by:  Papers (15)
    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.
  • 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.
  • 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.
  • Logic and over-simplification

    Publication Year: 1998, Page(s):2 - 3
    Cited by:  Papers (2)
    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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • On the boundedness problem for two-variable first-order logic

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

    A positive first-order formula is bounded if the sequence of its stages converges to the least fixed point of the formula within a fixed finite number of steps independent of the input structure. The boundedness problem for a fragment C of first-order logic is the following decision problem: given a positive formula in L, is it bounded? In this paper, we investigate the boundedness problem for two... View full abstract»

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

    Publication Year: 1998, Page(s):418 - 429
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    This paper investigates invertibility properties of subjective and bijective terms in the closed term model of λη. With the help of insolvable terms, it will be shown that some special subjective terms are right-invertible and that all bijective terms are invertible 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
    Cited by:  Papers (2)
    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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.