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
  • Little engines of proof

    Publication Year: 2002
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (239 KB)

    Summary form only given. The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of thought. One school, best represented by Alan Robinson's resolution method, is based on simple uniform proof search procedures guided by heuristics. The other school, pioneered by Hao Wang, argues fo... View full abstract»

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

    Publication Year: 2002, Page(s):137 - 146
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (410 KB)

    Usually subtyping relations are defined either syntactically by a formal system or semantically by an interpretation of types in an untyped denotational model. In this paper we show how to define a subtyping relation semantically, for a language whose operational semantics is driven by types; we consider a rich type algebra, with product, arrow, recursive, intersection, union and complement types.... View full abstract»

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

    Publication Year: 2002, Page(s):167 - 176
    Cited by:  Papers (7)
    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.
  • Temporal logic with forgettable past

    Publication Year: 2002, Page(s):383 - 392
    Cited by:  Papers (25)
    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.
  • Decidable and undecidable fragments of first-order branching temporal logics

    Publication Year: 2002, Page(s):393 - 402
    Cited by:  Papers (10)
    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.
  • The metric analogue of weak bisimulation for probabilistic processes

    Publication Year: 2002, Page(s):413 - 422
    Cited by:  Papers (44)
    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.
  • Author index

    Publication Year: 2002, Page(s): 457
    Request permission for commercial reuse | PDF file iconPDF (180 KB)
    Freely Available from IEEE
  • Modal and guarded characterisation theorems over finite transition systems

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

    Characterisation theorems for modal and guarded fragments of first-order logic are explored over finite transition systems. We show that the classical characterisations in terms of semantic invariance under the appropriate forms of bisimulation equivalence can be recovered at the level of finite model theory. The new, more constructive proofs naturally extend to alternative proofs of the classical... 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 (4)
    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.
  • Calibrating computational feasibility by abstraction rank

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

    We characterize computationally the functions provable in second order logic with set existence restricted to natural classes of first order formulas. A classification of first-order set-existence by implicational rank yields a natural hierarchy of complexity classes within the class of Kalmar-elementary functions: The functions over {0, 1}* constructively provable using set existence for formulas... 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 (2)
    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 proof complexity of linear algebra

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

    We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We give what is apparently the first feasible proofs of the Cayley-Hamilton theorem and other properties of the determinant, and study the propositional proof complexity of matrix identities. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unsatisfiable random formulas are hard to certify

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

    We prove that every property of 3CNF formulas that implies unsatisfiability and is expressible in Datalog has asymptotic probability zero when formulas are randomly generated by taking 6n non-trivial clauses of exactly three literals uniformly and independently. Our result is a consequence of designing a winning strategy for Duplicator in the existential k-pebble game on the structure that encodes... 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.
  • Complete problems for dynamic complexity classes

    Publication Year: 2002, Page(s):313 - 322
    Cited by:  Papers (3)
    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.
  • Probabilistic abstraction for model checking: an approach based on property testing

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

    The goal of model checking is to verify the correctness of a given program, on all its inputs. The main obstacle, in many cases, is the intractably large size of the program's transition system. Property testing is a randomized method to verify whether some fixed property holds on individual inputs, by looking at a small random part of that input. We join the strengths of both approaches by introd... 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.
  • The powerdomain of indexed valuations

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

    This paper is about combining nondeterminism and probabilities. We study this phenomenon from a domain theoretic point of view. In domain theory, nondeterminism is modeled using the notion of powerdomain, while probability is modeled using the powerdomain of valuations. Those two functors do not combine well, as they are. We define the notion of powerdomain of indexed valuations, which can be comb... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tree-like counterexamples in model checking

    Publication Year: 2002, Page(s):19 - 29
    Cited by:  Papers (34)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (446 KB) | HTML iconHTML

    Counter examples for specification violations provide engineers with important debugging information. Although counterexamples are considered one of the main advantages of model checking, state-of the art model checkers are restricted to relatively simple counterexamples, and surprisingly little research effort has been put into counterexamples. In this paper, we introduce a new general framework ... 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 (3)
    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.
  • Computational adequacy for recursive types in models of intuitionistic set theory

    Publication Year: 2002, Page(s):287 - 298
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    We present a general axiomatic construction of models of FPC, a recursively typed lambda-calculus with call-by-value operational semantics. Our method of construction is to obtain such models as full subcategories of categorical models of intuitionistic set theory. This allows us to obtain a notion of model that encompasses both domain-theoretic and realizability models. We show that the existence... 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 (2)
    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.
  • Separation logic: a logic for shared mutable data structures

    Publication Year: 2002, Page(s):55 - 74
    Cited by:  Papers (286)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (478 KB) | HTML iconHTML

    In joint work with Peter O'Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about low-level imperative programs that use shared mutable data structure. The simple imperative programming language is extended with commands (not expressions) for accessing and modifying shared structures, and for explicit allocation and deallocati... 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 (5)
    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.