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
  • 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.
  • Domain theory and differential calculus (functions of one variable)

    Publication Year: 2002, Page(s):277 - 286
    Cited by:  Papers (2)
    Request permission for commercial 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 C1... 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 (5)
    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.
  • 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.
  • Deciding confluence of certain term rewriting systems in polynomial time

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

    We present a polynomial time algorithm for deciding confluence of ground term rewrite systems. We generalize the decision procedure to get a polynomial time algorithm, assuming that the maximum arity of a symbol in the signature is a constant, for deciding confluence of rewrite systems where each rule contains a shallow linear term on one side and a ground term on the other. The existence of a pol... 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.
  • Observational equivalence of 3rd-order Idealized Algol is decidable

    Publication Year: 2002, Page(s):245 - 256
    Cited by:  Papers (8)
    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 fM 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.
  • Semantic minimization of 3-valued propositional formulae

    Publication Year: 2002, Page(s):40 - 51
    Cited by:  Papers (4)
    Request permission for commercial 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 φ with a "bett... 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.
  • Some results on automatic structures

    Publication Year: 2002, Page(s):235 - 242
    Cited by:  Papers (3)
    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.
  • The complexity of first-order and monadic second-order logic revisited

    Publication Year: 2002, Page(s):215 - 224
    Cited by:  Papers (11)
    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.
  • Monadic queries over tree-structured data

    Publication Year: 2002, Page(s):189 - 202
    Cited by:  Papers (15)  |  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.
  • Separability, expressiveness, and decidability in the ambient logic

    Publication Year: 2002, Page(s):423 - 432
    Cited by:  Papers (5)
    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.
  • 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.
  • 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.
  • Expressive equivalence of least and inflationary fixed-point logic

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

    We study the relationship between least and inflationary fixed-point logic. By results of Gurevich and Shelah (1986), it has been known that on finite structures both logics have the same expressive power. On infinite structures however the question whether there is a formula in IFP not equivalent to any LFP-formula was still open. In this paper, we settle the question by showing that both logics ... View full abstract»

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