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 reuse | PDF file iconPDF (350 KB)
    Freely Available from IEEE
  • Little engines of proof

    Publication Year: 2002
    Cited by:  Papers (1)
    Request permission for 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.
  • Automatic decidability

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

    Publication Year: 2002, Page(s):30 - 39
    Cited by:  Papers (1)
    Request permission for 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.
  • Semantic minimization of 3-valued propositional formulae

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

    This paper presents an algorithm for a non-standard logic-minimization problem that arises in 3-valued propositional logic. The problem is motivated by the potential for obtaining better answers in applications that use 3-valued logic. An answer of 0 or 1 provides precise (definite) information; an answer of 1/2 provides imprecise (indefinite) information. By replacing a formula /spl phi/ with a "... 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 (382)  |  Patents (2)
    Request permission for 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.
  • A stratified semantics of general references embeddable in higher-order logic

    Publication Year: 2002, Page(s):75 - 86
    Cited by:  Papers (6)
    Request permission for 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.
  • A syntactic approach to foundational proof-carrying code

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

    Proof-carrying code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language-specific typing rules. In foundational proof-carrying code (FPCC), on the other hand, proofs are constructed and verified using strictly the foundations of mathematical logic, with no type-specific axioms. FPCC is more f... 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 (5)
    Request permission for 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.
  • Semantics and logic of object calculi

    Publication Year: 2002, Page(s):113 - 122
    Request permission for 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.
  • Efficient type inference for record concatenation and subtyping

    Publication Year: 2002, Page(s):125 - 136
    Cited by:  Papers (1)
    Request permission for 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.
  • Semantic subtyping

    Publication Year: 2002, Page(s):137 - 146
    Cited by:  Papers (16)
    Request permission for 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.
  • 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 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.
  • On the lambda Y calculus

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

    In this paper we consider three problems concerning the lambda Y calculus obtained from the simply typed lambda calculus by the addition of fixed point combinators Y: (A/spl rarr/A)/spl rarr/A. The "paradoxical" combinator Y was first discussed in by Curry & Feys Vol 1 (1958). It appears first in a typed context by A. Scott (1969) and also by R. Platek's thesis (1963), and forms the basis for ... 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 (8)
    Request permission for 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.
  • Computing reachability relations in timed automata

    Publication Year: 2002, Page(s):177 - 186
    Cited by:  Papers (2)
    Request permission for 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.
  • Monadic queries over tree-structured data

    Publication Year: 2002, Page(s):189 - 202
    Cited by:  Papers (19)  |  Patents (1)
    Request permission for 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.
  • Tree extension algebras: logics, automata, and query languages

    Publication Year: 2002, Page(s):203 - 212
    Cited by:  Papers (2)
    Request permission for 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<T', holding if and only if every branch of T extends to a branch of T', unary node-tests, and a binary relation checking if the domains of two trees are equal. We show that from such a formula one can generate a tree automaton that accepts the set of tuples of trees defin... 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 (17)
    Request permission for 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.
  • 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 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.
  • Some results on automatic structures

    Publication Year: 2002, Page(s):235 - 242
    Cited by:  Papers (5)
    Request permission for 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.
  • Observational equivalence of 3rd-order Idealized Algol is decidable

    Publication Year: 2002, Page(s):245 - 256
    Cited by:  Papers (11)
    Request permission for 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 f/sub M/. Given any such f/sub M/, we co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Games on graphs and sequentially realizable functionals. Extended abstract

    Publication Year: 2002, Page(s):257 - 264
    Cited by:  Papers (4)
    Request permission for 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.
  • Polarized games

    Publication Year: 2002, Page(s):265 - 274
    Cited by:  Papers (7)
    Request permission for 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, /spl lambda//spl mu/-calculus,... fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Domain theory and differential calculus (functions of one variable)

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

    A data-type for differential calculus is introduced, which is based on domain theory. We define the integral and also the derivative of a Scott continuous function on the domain of intervals, and present a domain-theoretic generalization of the fundamental theorem of calculus. We then construct a domain for differentiable real valued functions of a real variable. The set of classical C/sup 1/ func... View full abstract»

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