Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science

29 June-2 July 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
  • 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 (1199 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 E/sub 1/-compatible reduction orderings total on /spl Sigma//sub 1/-ground terms and E/sub 2/-compatible reduction orderings total on /spl Sigma//... 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 (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1119 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.
  • Ground reducibility is EXPTIME-complete

    Publication Year: 1997, Page(s):26 - 34
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (735 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 A/sub R,t/ to a rewrite system R and a term t. This automaton i... 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 (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1009 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 /spl lambda/x-calculus is strongly normalizing, as well as of all the calculi that can be translated to it keeping normalization properties such as ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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 (687 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.
  • Full abstraction for functional languages with control

    Publication Year: 1997, Page(s):58 - 67
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (795 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.
  • 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 (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 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 (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (905 KB)

    We develop a game-theoretic model of the polymorphic /spl lambda/-calculus, system F, as a fibred category F. Our main result is that every morphism /spl sigma/ of the model defines a normal form s/sub /spl sigma// of system F, whose interpretation is /spl sigma/. 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.
  • Boolean expression diagrams

    Publication Year: 1997, Page(s):88 - 98
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (991 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.
  • How much memory is needed to win infinite games?

    Publication Year: 1997, Page(s):99 - 110
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1130 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.
  • Quantitative analysis and model checking

    Publication Year: 1997, Page(s):111 - 122
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (977 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 /spl mu/x./spl phi//vx./spl phi/ are interpreted as least/greatest fired points over the infinite lattice of map... 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 (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1184 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.
  • 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 (796 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.
  • Bisimulation for labelled Markov processes

    Publication Year: 1997, Page(s):149 - 158
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (977 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.
  • A Kleene theorem for timed automata

    Publication Year: 1997, Page(s):160 - 171
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (943 KB)

    In this paper we define timed regular expressions, and extension of regular expressions for specifying sets of dense-time discrete-valued signals. We show that this formalism is equivalent in expressive power to the timed automata of Alur and Dill by providing a translation procedure from expressions to automata and vice versa. the result is extended to /spl omega/-regular expressions (Buchi's the... 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 (947 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 /spl Lambda/ commutes in a rough sense with all other ... 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 (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1091 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.
  • 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 (693 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/spl rarr/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... 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 (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1150 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 the relationsh... 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/sup /spl kappa//-types

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

    Far each /spl kappa//spl ges/3, we show that there is no recursive bound for the size of the smallest finite model of an L/sup /spl kappa//-theory in terms of its /spl kappa/-size. Here L/sup /spl kappa// denotes the /spl kappa/-variable fragment of first-order logic. An L/sup /spl kappa//-theory is a maximal consistent set of L/sup /spl kappa//-sentences, and the /spl kappa/-size of an L/sup /spl... 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 (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (843 KB)

    We investigate the power of first-order logic with only two variables over /spl omega/-words and finite words, a logic denoted by FO/sup 2/. We prove that FO/sup 2/ 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", a logic we denote by unary-TL. Moreover, our transla... 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 (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (929 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-Fraisse games) a... 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 (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (828 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.
  • 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 (883 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.