2012 27th Annual IEEE Symposium on Logic in Computer Science

25-28 June 2012

Filter Results

Displaying Results 1 - 25 of 75
  • [Cover art]

    Publication Year: 2012, Page(s): C4
    Request permission for commercial reuse | PDF file iconPDF (479 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2012, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (34 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2012, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (90 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2012, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (168 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 2012, Page(s):x - xi
    Request permission for commercial reuse | PDF file iconPDF (82 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference Organization

    Publication Year: 2012, Page(s):xii - xiii
    Request permission for commercial reuse | PDF file iconPDF (85 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2012, Page(s):xiv - xv
    Request permission for commercial reuse | PDF file iconPDF (81 KB)
    Freely Available from IEEE
  • Backward induction in games of perfect information

    Publication Year: 2012, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (90 KB)

    Summary form only given. One of the areas of Game Theory that are of most interest to Computer Scientists, and in which Formal Logic is most heavily used, is that of Games of Perfect Information (like Chess or Checkers). Of central interest in this connectioOne of the areas of Game Theory that are of most interest to Computer Scientists, and in which Formal Logic is most heavily used, is that of G... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer

    Publication Year: 2012, Page(s):2 - 8
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (187 KB) | HTML iconHTML

    In this article I will examine a few key concepts and design decisions that account for the high value of implemented constructive type theories in computer science. I'll stress the historical fact that these theories, and the proof assistants that animate them, were born from a strong partnership linking computer science, logic, and mathematics. I will recall how modern type theory researchers bu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Privacy, Anonymity, and Accountability in Ad-Supported Services

    Publication Year: 2012, Page(s):9 - 10
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (170 KB) | HTML iconHTML

    In this talk, I will address three aspects of user privacy in advertiser-supported, online services. First, I present the design of a novel browser plug-in that enables anonymous search. Next, I consider economic aspects of user privacy from the point of view of the operator of an advertiser-supported website. Finally, I present recent work on "accountability" in online activity, where the goal is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Turing's Password: What Internet Cannot Leak

    Publication Year: 2012, Page(s): 11
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (79 KB) | HTML iconHTML

    Summary form only given. I use a revised, more robust, notion of computability to answer bothersome questions that are not even easy to ask with any clarity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Term rewriting and lambda calculus

    Publication Year: 2012, Page(s): 12
    Request permission for commercial reuse | PDF file iconPDF (115 KB) | HTML iconHTML
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logics of Dynamical Systems

    Publication Year: 2012, Page(s):13 - 24
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (541 KB) | HTML iconHTML

    We study the logic of dynamical systems, that is, logics and proof principles for properties of dynamical systems. Dynamical systems are mathematical models describing how the state of a system evolves over time. They are important in modeling and understanding many applications, including embedded systems and cyber-physical systems. In discrete dynamical systems, the state evolves in discrete ste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower Bounds for Existential Pebble Games and k-Consistency Tests

    Publication Year: 2012, Page(s):25 - 34
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (325 KB) | HTML iconHTML

    The existential k-pebble game characterizes the expressive power of the existential-positive k-variable fragment of first-order logic on finite structures. The winner of the existential k-pebble game on two given finite structures can easily be determined in polynomial time, where the degree of the polynomial is linear in k. We show that this linear dependence on the parameter k is necessary by pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dense-Timed Pushdown Automata

    Publication Year: 2012, Page(s):35 - 44
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (305 KB) | HTML iconHTML

    We propose a model that captures the behavior of real-time recursive systems. To that end, we introduce dense-timed pushdown automata that extend the classical models of pushdown automata and timed automata, in the sense that the automaton operates on a finite set of real-valued clocks, and each symbol in the stack is equipped with a real-valued clock representing its "age". The model induces a tr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coproducts of Monads on Set

    Publication Year: 2012, Page(s):45 - 54
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB) | HTML iconHTML

    Coproducts of monads on Set have arisen in both the study of computational effects and universal algebra. We describe coproducts of consistent monads on Set by an initial algebra formula, and prove also the converse: if the coproduct exists, so do the required initial algebras. That formula was, in the case of ideal monads, also used by Ghani and Uustalu. We deduce that coproduct embeddings of con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate Verification of the Symbolic Dynamics of Markov Chains

    Publication Year: 2012, Page(s):55 - 64
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (311 KB) | HTML iconHTML

    A finite state Markov chain M is often viewed as a probabilistic transition system. An alternative view - which we follow here - is to regard M as a linear transform operating on the space of probability distributions over its set of nodes. The novel idea here is to discretize the probability value space [0,1] into a finite set of intervals. A concrete probability distribution over the nodes is th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regular Transformations of Infinite Strings

    Publication Year: 2012, Page(s):65 - 74
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (294 KB) | HTML iconHTML

    The theory of regular transformations of finite strings is quite mature with appealing properties. This class can be equivalently defined using both logic (Monadic second-order logic) and finite-state machines (two-way transducers, and more recently, streaming string transducers); is closed under operations such as sequential composition and regular choice; and problems such as functional equivale... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Semantics of Parsing with Semantic Actions

    Publication Year: 2012, Page(s):75 - 84
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (275 KB) | HTML iconHTML

    The recovery of structure from flat sequences of input data is a problem that almost all programs need to solve. Computer Science has developed a wide array of declarative languages for describing the structure of languages, usually based on the context-free grammar formalism, and there exist parser generators that produce efficient parsers for these descriptions. However, when faced with a proble... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics

    Publication Year: 2012, Page(s):85 - 94
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    This paper makes a substantial step towards automatization of Para consistent reasoning by providing a general method for a systematic and modular generation of cut-free calculi for thousands of Para consistent logics known as Logics of Formal (In)consistency. The method relies on the use of non-deterministic semantics for these logics. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Inductive Types in Homotopy Type Theory

    Publication Year: 2012, Page(s):95 - 104
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB) | HTML iconHTML

    Homotopy type theory is an interpretation of Martin-Lof's constructive type theory into abstract homotopy theory. There results a link between constructive mathematics and algebraic topology, providing topological semantics for intensional systems of type theory as well as a computational approach to algebraic topology via type theory-based proof assistants such as Coq. The present work investigat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining Deduction Modulo and Logics of Fixed-Point Definitions

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

    Inductive and coinductive specifications are widely used in formalizing computational systems. Such specifications have a natural rendition in logics that support fixed-point definitions. Another useful formalization device is that of recursive specifications. These specifications are not directly complemented by fixed-point reasoning techniques and, correspondingly, do not have to satisfy strong ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graph Logics with Rational Relations and the Generalized Intersection Problem

    Publication Year: 2012, Page(s):115 - 124
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (523 KB) | HTML iconHTML

    We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications. Such logics use conditions on paths expressed by regular languages and relations, but they often need to be extended by rational relations such as subword (factor) or... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Near Unanimity Constraints Have Bounded Pathwidth Duality

    Publication Year: 2012, Page(s):125 - 134
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (317 KB) | HTML iconHTML

    We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded pathwidth duality, putting the problem in nondeterministic logspace. This generalizes the analogous result of Dalmau and Krokhin for majority polymorphisms and lends further support to a conjecture suggested by Larose and Te... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Computational Interpretation of Parametricity

    Publication Year: 2012, Page(s):135 - 144
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (681 KB) | HTML iconHTML

    Reynolds' abstraction theorem has recently been extended to lambda-calculi with dependent types. In this paper, we show how this theorem can be internalized. More precisely, we describe an extension of the Pure Type Systems with a special parametricity rule (with computational content), and prove fundamental properties such as Church-Rosser's and strong normalization. All instances of the abstract... View full abstract»

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