By Topic

Proceedings 17th Annual IEEE Symposium on Logic in Computer Science

22-25 July 2002

Filter Results

Displaying Results 1 - 25 of 42
  • Proceedings 17th Annual IEEE Symposium on Logic in Computer Science

    Publication Year: 2002
    Request permission for commercial reuse | PDF file iconPDF (350 KB)
    Freely Available from IEEE
  • Dense real-time games

    Publication Year: 2002, Page(s):167 - 176
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (414 KB) | HTML iconHTML

    The rapid development of complex and safety-critical systems requires the use of reliable verification methods and tools for system design (synthesis). Many systems of interest are reactive, in the sense that their behavior depends on the interaction with the environment. A natural framework to model them is a two-player game: the system versus the environment. In this context, the central problem... View full abstract»

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

    Publication Year: 2002, Page(s): 457
    Request permission for commercial reuse | PDF file iconPDF (180 KB)
    Freely Available from IEEE
  • Games on graphs and sequentially realizable functionals. Extended abstract

    Publication Year: 2002, Page(s):257 - 264
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (327 KB) | HTML iconHTML

    We present a new category of games on graphs and derive from it a model for Intuitionistic Linear Logic. Our category has the computational flavour of concrete data structures but embeds fully and faithfully in an abstract games model. It differs markedly from the usual Intuitionistic Linear Logic setting for sequential algorithms. However, we show that with a natural exponential we obtain a model... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Observational equivalence of 3rd-order Idealized Algol is decidable

    Publication Year: 2002, Page(s):245 - 256
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (451 KB) | HTML iconHTML

    We prove that observational equivalence of 3rd-order finitary Idealized Algol (IA) is decidable using Game Semantics. By modelling state explicitly in our games, we show that the denotation of a term M of this fragment of IA (built up from finite base types) is a compactly innocent strategy-with-state i.e. the strategy is generated by a finite view function fM. Given any such f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantics and logic of object calculi

    Publication Year: 2002, Page(s):113 - 122
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (391 KB) | HTML iconHTML

    The main contribution of this paper is a formal characterization of recursive object specifications based on a denotational untyped semantics of the object calculus and the discussion of existence of those (recursive) specifications. The semantics is then applied to prove soundness of a programming logic for the object calculus and to suggest possible extensions. For the purposes of this discussio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Separability, expressiveness, and decidability in the ambient logic

    Publication Year: 2002, Page(s):423 - 432
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB) | HTML iconHTML

    The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data. We study some basic questions concerning the descriptive and discriminating power of AL, focusing on the equivalence on processes induced by the logic (=L). We consider MA, and two Turing complete subse... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monadic queries over tree-structured data

    Publication Year: 2002, Page(s):189 - 202
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (383 KB)

    Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widespread database query problem in the context of XML. Partly a survey of recent work done by the authors and their group on logical query languages for this problem and their expressiveness, this paper provides a number of new ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity of first-order and monadic second-order logic revisited

    Publication Year: 2002, Page(s):215 - 224
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (358 KB)

    The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower bounds for fixed-parameter tractable model-checking problems for first-order and monadic second-order logic. We show that unless PTIME=NP, the model-checking problem for monadic second-order logic on finite words is not ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some results on automatic structures

    Publication Year: 2002, Page(s):235 - 242
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (353 KB) | HTML iconHTML

    We study the class of countable structures which can be presented by synchronous finite automata. We reduce the problem of existence of an automatic presentation of a structure to that for a graph. We exhibit a series of properties of automatic equivalence structures, linearly ordered sets and permutation structures. These serve as a first step in producing practical descriptions of some automatic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal logic with forgettable past

    Publication Year: 2002, Page(s):383 - 392
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (459 KB) | HTML iconHTML

    We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL+Past (which in turn can be more succinct than LTL). We study satisfiability and model checking for NLTL and provide optimal automata-theoretic algorithms for these EXPSPACE-complete problems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fully abstract may testing semantics for concurrent objects

    Publication Year: 2002, Page(s):101 - 112
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB) | HTML iconHTML

    This paper provides a fully abstract semantics for a variant of the concurrent object calculus. We define may testing for concurrent object components and then characterise it using a trace semantics inspired by UML interaction diagrams. The main result of this paper is to show that the trace semantics is fully abstract for may testing. This is the first such result for a concurrent object languag... View full abstract»

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

    Publication Year: 2002, Page(s):7 - 16
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    We give a set of inference rules with constant constraints. Then we show how to extend a set of equational clauses, so that if the application of these inference rules halts on these clauses, then the theory is decidable by applying a standard set of Paramodulation inference rules. In addition, we can determine the number of clauses generated in this decision procedure. For some theories, such as ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Remarks on isomorphisms in typed lambda calculi with empty and sum types

    Publication Year: 2002, Page(s):147 - 156
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (373 KB) | HTML iconHTML

    Tarski asked whether the arithmetic identities taught in high school are complete for showing all arithmetic equations valid for the natural numbers. The answer to this question for the language of arithmetic expressions using a constant for the number one and the operations of product and exponentiation is affirmative, and the complete equational theory also characterises isomorphism in the typed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The metric analogue of weak bisimulation for probabilistic processes

    Publication Year: 2002, Page(s):413 - 422
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (379 KB) | HTML iconHTML

    We observe that equivalence is not a robust concept in the presence of numerical information - such as probabilities-in the model. We develop a metric analogue of weak bisimulation in the spirit of our earlier work on metric analogues for strong bisimulation. We give a fixed point characterization of the metric. This makes available conductive reasoning principles and allows us to prove metric ana... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing reachability relations in timed automata

    Publication Year: 2002, Page(s):177 - 186
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (451 KB) | HTML iconHTML

    We give an algorithmic calculus of the reachability relations on clock values defined by timed automata. Our approach is a modular one, by computing unions, compositions and reflexive-transitive closure (star) of "atomic" relations. The essential tool is a new representation technique for n-clock relations - the 2n-automata - and our strategy is to show the closure under union, composition and sta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Description logics: foundations for class-based knowledge representation

    Publication Year: 2002, Page(s):359 - 370
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (371 KB) | HTML iconHTML

    Class-based languages express knowledge in terms of objects and classes, and have inspired a huge number of formalisms in computer science. Description logics forma family of both class-based and logic-based knowledge representation languages which allow for modeling an application domain in terms of objects, classes and relationships between classes, and for reasoning about them. This paper prese... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complete problems for dynamic complexity classes

    Publication Year: 2002, Page(s):313 - 322
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (348 KB)

    We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC0, the dynamic classes corresponding to relational calculus and (polynomially bounded) SQL, respectively. The first problem we show complete for Dyn-FO is a single-step version of the circuit value problem (SSCV). Of independent interest, our construction also produces a first-o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A stratified semantics of general references embeddable in higher-order logic

    Publication Year: 2002, Page(s):75 - 86
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB) | HTML iconHTML

    We demonstrate a semantic model of general references - that is, mutable memory cells that may contain values of any (statically-checked) closed type, including other references. Our model is in terms of execution sequences on a von Neumann machine; thus, it can be used in a Proof-Carrying Code system where the skeptical consumer checks even the proofs of the typing rules. The model allows us to p... View full abstract»

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

    Publication Year: 2002, Page(s):265 - 274
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (358 KB) | HTML iconHTML

    We generalize the intuitionistic Hyland-Ong games to a notion of polarized games allowing games with plays starting by proponent moves. The usual constructions on games are adjusted to fit this setting yielding a game model for polarized linear logic with a definability result. As a consequence this gives a complete game model for various classical systems: LC, λμ-calculus,... for both c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient type inference for record concatenation and subtyping

    Publication Year: 2002, Page(s):125 - 136
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (355 KB) | HTML iconHTML

    Record concatenation, multiple inheritance, and multiple-object cloning are closely related and part of various language designs. For example, in Cardelli's untyped Obliq language, a new object can be constructed from several existing objects by cloning followed by concatenation; an error is given in case of field name conflicts. Type systems for record concatenation have been studied by M. Wand (... View full abstract»

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

    Publication Year: 2002, Page(s):433 - 444
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (449 KB)

    The meaning and mathematical consequences of linearity (managing without a presumed ability to copy) are studied for a path-based model of processes which is also a model of affine-linear logic. This connection yields an affine-linear language for processes, automatically respecting open-map bisimulation, in which a range of process operations can be expressed. An operational semantics is provided... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tree extension algebras: logics, automata, and query languages

    Publication Year: 2002, Page(s):203 - 212
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (402 KB) | HTML iconHTML

    We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation T View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The 0-1 law fails for frame satisfiability of propositional modal logic

    Publication Year: 2002, Page(s):225 - 234
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (402 KB) | HTML iconHTML

    The digraph property KERNEL is a very simple and wellknown property studied in various areas. We previously defined a variant of this property as a counterexample of 0-1 law for the monadic existential second order logic with at most two first-order variables, over structures with 16 binary relations. Goranko and Kapron have defined two variants in frames which expresses frame satisfiability of pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decidable and undecidable fragments of first-order branching temporal logics

    Publication Year: 2002, Page(s):393 - 402
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (433 KB) | HTML iconHTML

    In this paper we analyze the decision problem for fragments of first-order extensions of branching time temporal logics such as computational tree logics CTL and CTL* or Prior's Ockhamist logic of historical necessity. On the one hand, we show that the one-variable fragments of logics like first-order CTL*-such as the product of propositional CTL* with simple propositional modal logic S5, or even ... View full abstract»

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