Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.

17-17 July 2004

Filter Results

Displaying Results 1 - 25 of 56
  • Proceedings of The 19th Annual IEEE Symposium on Logic in Computer Science

    Publication Year: 2004, Page(s): 0_1
    Request permission for reuse | PDF file iconPDF (160 KB)
    Freely Available from IEEE
  • Dedicated to the memory of Harald Ganzinger

    Publication Year: 2004, Page(s): 0_2
    Request permission for reuse | PDF file iconPDF (207 KB) | HTML iconHTML
    Freely Available from IEEE
  • Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science

    Publication Year: 2004
    Request permission for reuse | PDF file iconPDF (209 KB)
    Freely Available from IEEE
  • Copyright page

    Publication Year: 2004, Page(s): 0_4
    Request permission for reuse | PDF file iconPDF (200 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2004, Page(s):0_5 - 0_8
    Request permission for reuse | PDF file iconPDF (195 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2004, Page(s): 0_9
    Request permission for reuse | PDF file iconPDF (172 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference organization

    Publication Year: 2004, Page(s): 0_10
    Request permission for reuse | PDF file iconPDF (174 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2004, Page(s): 0_11
    Request permission for reuse | PDF file iconPDF (172 KB)
    Freely Available from IEEE
  • Referees

    Publication Year: 2004, Page(s):0_12 - 0_13
    Request permission for reuse | PDF file iconPDF (172 KB)
    Freely Available from IEEE
  • Model checking synchronized products of infinite transition systems

    Publication Year: 2004, Page(s):2 - 11
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (548 KB) | HTML iconHTML

    Formal verification using the model-checking paradigm has to deal with two aspects. The systems models are structured, often as products of components, and the specification logic has to be expressive enough to allow the formalization of reachability properties. The present paper is a study on what can be achieved for infinite transition systems under these premises. As models, we consider product... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model checking probabilistic pushdown automata

    Publication Year: 2004, Page(s):12 - 21
    Cited by:  Papers (19)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (419 KB) | HTML iconHTML

    We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be formulated as instances of a generalized random walk problem. We prove that both qualitative and quantitative model checking for this class of properties and pPDA is decidable. Then, we show that model checking for the qu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spi calculus translated to /spl pi/-calculus preserving may-tests

    Publication Year: 2004, Page(s):22 - 31
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (548 KB) | HTML iconHTML

    We present a concise and natural encoding of the spi-calculus into the more basic /spl pi/-calculus and establish its correctness with respect to a formal notion of testing. This is particularly relevant for security protocols modelled in spi since the tests can be viewed as adversaries. The translation has been implemented in a prototype tool. As a consequence, protocols can be described in the s... View full abstract»

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

    Publication Year: 2004, Page(s):32 - 41
    Cited by:  Papers (64)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (481 KB) | HTML iconHTML

    Proof rules for program verification rely on auxiliary assertions. We propose a (sound and relatively complete) proof rule whose auxiliary assertions are transition invariants. A transition invariant of a program is a binary relation over program states that contains the transitive closure of the transition relation of the program. A relation is disjunctively well-founded if it is a finite union o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic structures: richness and limitations

    Publication Year: 2004, Page(s):44 - 53
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1057 KB) | HTML iconHTML

    This paper studies the existence of automatic presentations for various algebraic structures. The automatic Boolean algebras are characterised, and it is proven that the free Abelian group of infinite rank and many Fraisse limits do not have automatic presentations. In particular, the countably infinite random graph and the universal partial order do not have automatic presentations. Furthermore, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the language inclusion problem for timed automata: closing a decidability gap

    Publication Year: 2004, Page(s):54 - 63
    Cited by:  Papers (18)  |  Patents (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (574 KB) | HTML iconHTML

    We consider the language inclusion problem for timed automata: given two timed automata A and B, are all the timed traces accepted by B also accepted by A? While this problem is known to be undecidable, we show here that it becomes decidable if A is restricted to having at most one clock. This is somewhat surprising, since it is well-known that there exist timed automata with a single clock that c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vector addition tree automata

    Publication Year: 2004, Page(s):64 - 73
    Cited by:  Papers (10)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (405 KB) | HTML iconHTML

    We introduce a new class of automata, which we call vector addition tree automata. These automata are a natural generalization of vector addition systems with states, which are themselves equivalent to Petri-nets. Then, we prove that the decidability of provability in multiplicative exponential linear logic (which is an open problem) is equivalent to the decidability of the reachability relation f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing, optimization, and games

    Publication Year: 2004, Page(s):78 - 88
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (342 KB) | HTML iconHTML

    We discuss algorithmic problems arising in the testing of reactive systems, i.e. systems that interact with their environment. The goal is to design test sequences so that we can deduce desired information about the given system under test, such as whether it conforms to a given specification model, or whether it satisfies given requirement properties. Test generation can be approached from differ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proving termination assertions in dynamic logics

    Publication Year: 2004, Page(s):89 - 98
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (919 KB) | HTML iconHTML

    Total correctness assertions (TCAs) have long been considered a natural formalization of successful program termination. However, research dating back to the 1980s suggests that validity of TCAs is a notion of limited interest; we corroborate this by proving compactness and Herbrand properties for the valid TCAs, defining in passing a new sound, complete, and syntax-directed deductive system for T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deciding quantifier-free Presburger formulas using parameterized solution bounds

    Publication Year: 2004, Page(s):100 - 109
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (365 KB) | HTML iconHTML

    Given a formula /spl Phi/ in quantifier-free Presburger arithmetic, it is well known that, if there is a satisfying solution to /spl Phi/, there is one whose size, measured in bits, is polynomially bounded in the size of /spl Phi/. In this paper, we consider a special class of quantifier-free Presburger formulas in which most linear constraints are separation (difference-bound) constraints, and th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the automata size for Presburger arithmetic

    Publication Year: 2004, Page(s):110 - 119
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (672 KB) | HTML iconHTML

    Automata provide an effective mechanization of decision procedures for Presburger arithmetic. However, only crude lower and upper bounds are known on the sizes of the automata produced by this approach. In this paper, we prove that the number of states of the minimal deterministic automaton for a Presburger arithmetic formula is triple exponentially bounded in the length of the formula. This upper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From automata to formulas: convex integer polyhedra

    Publication Year: 2004, Page(s):120 - 129
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (556 KB) | HTML iconHTML

    Automata-based representations have recently been investigated as a tool for representing and manipulating sets of integer vectors. In this paper, we study some structural properties of automata accepting the encodings (most significant digit first) of the natural solutions of systems of linear Diophantine inequations, i.e., convex polyhedra in /spl Nopf//sup n/. Based on those structural properti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feasible proofs and computations: partnership and fusion

    Publication Year: 2004, Page(s):134 - 138
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (269 KB) | HTML iconHTML

    A computation or a proof is called feasible if it obeys prescribed bounds on the resources consumed during its execution. It turns out that when restricted to this world of feasibility, proofs and computations become extremely tightly interrelated, sometimes even indistinguishable. Moreover, many of these rich relations, underlying concepts, techniques etc. look very different from their "'classic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A sequent calculus for nominal logic

    Publication Year: 2004, Page(s):139 - 148
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (403 KB) | HTML iconHTML

    Nominal logic is a theory of names and binding based on the primitive concepts of freshness and swapping, with a self-dual N- (or "new")-quantifier, originally presented as a Hilbert-style axiom system extending first-order logic. We present a sequent calculus for nominal logic called fresh logic, or FL, admitting cut-elimination. We use FL to provide a proof-theoretic foundation for nominal logic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nominal games and full abstraction for the nu-calculus

    Publication Year: 2004, Page(s):150 - 159
    Cited by:  Papers (16)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (642 KB) | HTML iconHTML

    We introduce nominal games for modelling programming languages with dynamically generated local names, as exemplified by Pitts and Stark's nu-calculus. Inspired by Pitts and Gabbay's recent work on nominal sets, we construct arenas and strategies in the world (or topos) of Fraenkel-Mostowski sets (or simply FM-sets). We fix an infinite set N of names to be the "atoms" of the FM-theory, and interpr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Games with secure equilibria

    Publication Year: 2004, Page(s):160 - 169
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (548 KB) | HTML iconHTML

    In 2-player nonzero-sum games, Nash equilibria capture the options for rational behavior if each player attempts to maximize her payoff. In contrast to classical game theory, we consider lexicographic objectives: first, each player tries to maximize her own payoff, and then, the player tries to minimize the opponent's payoff. Such objectives arise naturally in the verification of systems with mult... View full abstract»

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