By Topic

Logic in Computer Science, 1998. Proceedings. Thirteenth Annual IEEE Symposium on

Date 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
  • Type theory via exact categories

    Publication Year: 1998, Page(s):188 - 198
    Cited by:  Papers (1)
    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.
  • 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.
  • 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.
  • Efficient representation and validation of proofs

    Publication Year: 1998, Page(s):93 - 104
    Cited by:  Papers (7)
    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.
  • The relation between second-order unification and simultaneous rigid E-unification

    Publication Year: 1998, Page(s):264 - 275
    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.
  • 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.
  • 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.
  • A fully abstract game semantics for general references

    Publication Year: 1998, Page(s):334 - 344
    Cited by:  Papers (18)
    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.
  • Herbrand's theorem, automated reasoning and semantic tableaux

    Publication Year: 1998, Page(s):252 - 263
    Cited by:  Papers (2)
    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.
  • Secure implementation of channel abstractions

    Publication Year: 1998, Page(s):105 - 116
    Cited by:  Papers (7)
    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 fusion calculus: expressiveness and symmetry in mobile processes

    Publication Year: 1998, Page(s):176 - 185
    Cited by:  Papers (5)
    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.
  • Phase semantics and verification of concurrent constraint programs

    Publication Year: 1998, Page(s):141 - 152
    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.
  • Freedom, weakness, and determinism: from linear-time to branching-time

    Publication Year: 1998, Page(s):81 - 92
    Cited by:  Papers (6)
    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.
  • 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.
  • On counting logics and local properties

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

    The expressive power of first-order logic over finite structures is limited in two ways: it lacks a recursion mechanism, and it cannot count. Overcoming the first limitation has been a subject of extensive study. A number of fixpoint logics have been introduced, and shown to be subsumed by an infinitary logic L∞ωω . This logic is easier to analyze than fixpo... 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.
  • On model checking for non-deterministic infinite-state systems

    Publication Year: 1998, Page(s):70 - 80
    Cited by:  Papers (5)
    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.
  • Coinductive techniques for operational equivalence of interaction nets

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

    In this paper we study a notion of operational equivalence for interaction nets, following the recent success of applying methods based on bisimulation to functional and object oriented programming languages. We set up notions of contextual equivalence and bisimilarity and show that they coincide. A coinduction principle then gives a simple and robust way of showing when two interaction nets are c... 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 (3)  |  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.
  • Fixed-point logics on planar graphs

    Publication Year: 1998, Page(s):6 - 15
    Cited by:  Papers (4)
    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.
  • The Horn mu-calculus

    Publication Year: 1998, Page(s):58 - 69
    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.
  • 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.
  • Higher dimensional multigraphs

    Publication Year: 1998, Page(s):199 - 206
    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.