Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science

June 29 1997-July 2 1997

Filter Results

Displaying Results 1 - 25 of 41
  • Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science

    Publication Year: 1997
    Request permission for commercial reuse | PDF file iconPDF (231 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1997, Page(s): 447
    Request permission for commercial reuse | PDF file iconPDF (61 KB)
    Freely Available from IEEE
  • Towards a mathematical operational semantics

    Publication Year: 1997, Page(s):280 - 291
    Cited by:  Papers (55)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1052 KB)

    We present a categorical theory of `well-behaved' operational semantics which aims at complementing the established theory of domains and denotational semantics to form a coherent whole. It is shown that, if the operational rules of a programming language can be modelled as a natural transformation of a suitable general form, depending on functorial notions of syntax and behaviour, then one gets t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complete cuboidal sets in axiomatic domain theory

    Publication Year: 1997, Page(s):268 - 278
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (964 KB)

    We study the enrichment of models of axiomatic domain theory. To this end, we introduce a new and broader notion of domain, via, that of complete cuboidal set, that complies with the axiomatic requirements. We show that the category of complete cuboidal sets provides a general notion of enrichment for a wide class of axiomatic domain-theoretic structures View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A relational account of call-by-value sequentiality

    Publication Year: 1997, Page(s):258 - 267
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    We construct a model for FPC, a purely functional, sequential, call-by-value language. The model is built from partial continuous functions, in the style of Plotkin, further constrained to be uniform with respect to a class of logical relations. We prove that the model is fully abstract View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ground reducibility is EXPTIME-complete

    Publication Year: 1997, Page(s):26 - 34
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the computations of an alternating Turing machine whose space is polynomially bounded. It is more difficult to show that ground reducibility belongs to DEXPTIME. We associate first an automaton with disequality constraints AR,t to a rewrite system R and a term t. This automa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantics of exact real arithmetic

    Publication Year: 1997, Page(s):248 - 257
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    In this paper, we incorporate a representation of the non-negative extended real numbers based on the composition of linear fractional transformations with non-negative integer coefficients into the Programming Language for Computable Functions (PCF) with products. We present two models for the extended language and show that they are computationally adequate with respect to the operational semant... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Games and definability for system F

    Publication Year: 1997, Page(s):76 - 86
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    We develop a game-theoretic model of the polymorphic λ-calculus, system F, as a fibred category F. Our main result is that every morphism σ of the model defines a normal form sσ of system F, whose interpretation is σ. Thus the model gives a precise, non-syntactic account of the calculus View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A partially deadlock-free typed process calculus

    Publication Year: 1997, Page(s):128 - 139
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1052 KB)

    We propose a novel static type system for a process calculus, which ensures both partial deadlock-freedom and partial confluence. The key novel ideas are: (1) introduction of the order of channel use as type information and (2) classification of communication channels into reliable and unreliable channels based on their usage and a guarantee of the usage by the type system. We can ensure that comm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity of power default reasoning

    Publication Year: 1997, Page(s):328 - 339
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (908 KB)

    This paper derives a new and surprisingly low complexity result for inference in a new form of Reiter's propositional default logic (1980). The problem studied here is the default inference problem whose fundamental importance was pointed out by Kraus, Lehmann, and Magidor (1980). We prove that “normal” default inference, in propositional logic, is a problem complete for co-NP(3), the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The monadic quantifier alternation hierarchy over graphs is infinite

    Publication Year: 1997, Page(s):236 - 244
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    We show that in monadic second-order logic over finite directed graphs, a strict hierarchy of expressiveness is obtained by increasing the (second-order) quantifier alternation depth of formulas. thus, the “monadic analogue” of the polynomial hierarchy is found to be strict, which solves a problem of Fagin. The proof is based on automata theoretic concepts (rather than Ehrenfeucht-Frai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the complexity of reasoning in Kleene algebra

    Publication Year: 1997, Page(s):195 - 202
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    We study the complexity of reasoning in Kleene algebra and *-continuous Kleene algebra in the presence of extra equational assumptions E; that is, the complexity of deciding the validity of universal Horn formulas E→s=t, where E is a finite set of equations. We obtain various levels of complexity based on the form of the assumptions E. Our main results are: for *-continuous Kleene algebra, if... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combination of compatible reduction orderings that are total on ground terms

    Publication Year: 1997, Page(s):2 - 13
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1072 KB)

    Reduction orderings that are compatible with an equational theory E and total on (the E-equivalence classes of) ground terms play an important role in automated deduction. This paper presents a general approach for combining such orderings: it shows how E1-compatible reduction orderings total on Σ1-ground terms and E2-compatible reduction orderings total on &... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strong normalization of explicit substitutions via cut elimination in proof nets

    Publication Year: 1997, Page(s):35 - 46
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    In this paper, we show the correspondence existing between normalization in calculi with explicit substitution and cut elimination in sequent calculus for linear logic, via proof nets. This correspondence allows us to prove that a typed version of the λx-calculus is strongly normalizing, as well as of all the calculi that can be translated to it keeping normalization properties such as &lam... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bisimulation for labelled Markov processes

    Publication Year: 1997, Page(s):149 - 158
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    In this paper we introduce a new class of labelled transition systems-Labelled Markov Processes-and define bisimulation for them. Labelled Markov processes are probabilistic labelled transition systems where the state space is not necessarily discrete, it could be the reals, for example. We assume that it is a Polish space (the underlying topological space for a complete separable metric space). T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity of subtype entailment for simple types

    Publication Year: 1997, Page(s):352 - 361
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    A subtyping τ⩽τ' is entailed by a set of subtyping constraints C, written C |=τ⩽τ', if every valuation (mapping of type variables to ground types) that satisfies C also satisfies τ⩽τ'. We study the complexity of subtype entailment for simple types over lattices of base types. We show that: deciding C |=τ⩽τ' is coNP-complete; deciding C |=α⩽... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automata-driven automated induction

    Publication Year: 1997, Page(s):14 - 25
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (992 KB)

    This work investigates inductive theorem proving techniques for first-order functions whose meaning and domains can be specified by Horn Clauses built up from the equality and finitely many unary membership predicates. In contrast with other works in the area, constructors are not assumed to be free. Techniques originating from tree automata are used to describe ground constructor terms in normal ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantitative analysis and model checking

    Publication Year: 1997, Page(s):111 - 122
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    Many notions of models in computer science provide quantitative information, or uncertainties, which necessitate a quantitative model checking paradigm. We present such a framework for reactive and generative systems based on a non-standard interpretation of the modal mu-calculus, where μx.φ/vx.φ are interpreted as least/greatest fired points over the infinite lattice of maps from state... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity of two-variable logic with counting

    Publication Year: 1997, Page(s):318 - 327
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    Let Ck2 denote the class of first order sentences with two variables and with additional quantifiers “there exists exactly (at most, at least) m”, for m⩽k, and let C2 be the union of Ck2 taken over all integers k. We prove that the problem of satisfiability of sentences of C12 is NEXPTIME-complete. This st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Boolean expression diagrams

    Publication Year: 1997, Page(s):88 - 98
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB)

    This paper presents a new data structure called Boolean Expression Diagrams (BEDs) for representing and manipulating Boolean functions. BEDs are a generalization of Binary Decision Diagrams (BDDs) which can represent any Boolean circuit in linear space and still maintain many of the desirable properties of BDDs. Two algorithms are described for transforming a BED into a reduced ordered BDD. One cl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • First-order logic with two variables and unary temporal logic

    Publication Year: 1997, Page(s):228 - 235
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    We investigate the power of first-order logic with only two variables over ω-words and finite words, a logic denoted by FO2. We prove that FO2 can express precisely the same properties as linear temporal logic with only the unary temporal operators: “next”, “previously”, “sometime in the future”, and “sometime in the past”... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An expressively complete linear time temporal logic for Mazurkiewicz traces

    Publication Year: 1997, Page(s):183 - 194
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (960 KB)

    A basic result concerning LTL, the propositional temporal logic of linear time is that it is expressively complete; it is equal in expressive power to the first order theory of sequences. We present here a smooth extension of this result to the class of partial orders known as Mazurkiewicz traces. These partial orders arise in a variety of contexts in concurrency theory and they provide the concep... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Believe it or not, AJM's games model is a model of classical linear logic

    Publication Year: 1997, Page(s):68 - 75
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    A general category of games is constructed. A subcategory of saturated strategies, closed under all possible codings in copy games, is shown to model reduction in classical linear logic View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discrimination by parallel observers

    Publication Year: 1997, Page(s):396 - 407
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (924 KB)

    The main result of the paper is a proof of the following equivalence: two pure lambda terms are observationally equivalent in the lazy concurrent lambda calculus if they have the same Levy-Longo trees. It follows that contextual equivalence coincides with behavioural equivalence (bisimulation) as considered by Sangiorgi (1994). Another consequence is that the discriminating power of concurrent lam... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The “Hardest” natural decidable theory

    Publication Year: 1997, Page(s):294 - 305
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1012 KB)

    We prove that any decision procedure for a modest fragment of L. Henkin's theory of pure propositional types requires time exceeding a tower of 2's of height exponential in the length of input. Until now the highest known lower bounds for natural decidable theories were at most linearly high towers of 2's and since mid-seventies it was an open problem whether natural decidable theories requiring m... View full abstract»

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