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
  • Temporal linear logic specifications for concurrent processes

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

    The aim of the paper is to develop comprehensive logical systems capable of handling both resource-sensitive and time-dependent properties of concurrent processes. As a language for specifying such properties, we introduce `temporal linear logic' (TLL) an extension of linear logic with certain features of temporal logic. A semantic setting for TLL is given in terms of `time-state universes'. TLL i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large finite structures with few Lκ-types

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

    Far each κ⩾3, we show that there is no recursive bound for the size of the smallest finite model of an Lκ-theory in terms of its κ-size. Here Lκ denotes the κ-variable fragment of first-order logic. An Lκ-theory is a maximal consistent set of L κ-sentences, and the κ-size of an Lκ -theo... 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 (2)
    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.
  • 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.
  • 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.
  • 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.
  • On the forms of locality over finite models

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

    Most proofs showing limitations of expressive power of first-order logic rely on Ehrenfeucht-Fraisse games. Playing the game often involves a nontrivial combinatorial argument, so it was proposed to find easier tools for proving expressivity bounds. Most of those known for first-order logic are based on its “locality”, that is defined in different ways. In this paper we characterize th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How much memory is needed to win infinite games?

    Publication Year: 1997, Page(s):99 - 110
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB)

    We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of the size of the I/O automata realizing winning strategies in games with this condition. This problem is relevant to synthesis of reactive programs and to the theory of automata on infinite objects. We provide matching upp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the cubic bottleneck in subtyping and flow analysis

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

    We prove that certain data-flow and control-flow problems are 2NPDA-complete. This means that these problems are in the class 2NPDA and that they are hard for that class. The fact that they are in 2NPDA demonstrates the richness of the class. The fact that they are hard for 2NPDA can be interpreted as evidence they can not be solved in sub-cubic time-the cubic time decision procedure for an arbitr... 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.
  • Unique fixpoint induction for value-passing processes

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

    We investigate the use of unique fixpoint induction as a proof method for value-passing process languages with recursion. An intuitive generalisation of unique fixpoint induction based on loop invariants for symbolic graphs yields strong completeness results; we give an axiomatic characterisation of both late and early observational congruence for a class of fully parameterised processes. This new... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automata, tableaus and a reduction theorem for fixpoint calculi in arbitrary complete lattices

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

    Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notion of automaton is defined and shown, by means of a tableau technique, to capture the expressive power of fixpoint expressions. For interpretation over continuous and complete lattices when, moreover, the meet symbol Λ commutes in a rough sense with all other func... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Continuation models are universal for λμ-calculus

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

    We show that a certain simple call-by-name continuation semantics of Parigot's λμ-calculus (1992) is complete. More precisely, for every λμ-theory we construct a cartesian closed category such that the ensuing continuation-style interpretation of λμ, which maps terms to functions sending abstract continuations to responses, is full and faithful. ... 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 (19)
    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.
  • Full abstraction for functional languages with control

    Publication Year: 1997, Page(s):58 - 67
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    This paper considers the consequences of relaxing the bracketing condition on `dialogue games', showing that this leads to a category of games which can be `factorized' into a well-bracketed substructure, and a set of classically typed morphisms. These are shown to be sound denotations for control operators, allowing the factorization to be used to extend the definability result for PCF to one for... 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 (9)
    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.
  • 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.
  • 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.
  • 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.
  • 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.
  • Quantitative analysis and model checking

    Publication Year: 1997, Page(s):111 - 122
    Cited by:  Papers (29)
    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.
  • The complexity of subtype entailment for simple types

    Publication Year: 1997, Page(s):352 - 361
    Cited by:  Papers (5)
    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.