2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

25-28 June 2013

Filter Results

Displaying Results 1 - 25 of 72
  • [Front-cover]

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

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

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

    Publication Year: 2013, Page(s): iv
    Request permission for commercial reuse | |PDF file iconPDF (130 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2013, Page(s):v - x
    Request permission for commercial reuse | |PDF file iconPDF (191 KB)
    Freely Available from IEEE
  • Foreword

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

    Publication Year: 2013, Page(s):xiii - xiv
    Request permission for commercial reuse | |PDF file iconPDF (68 KB)
    Freely Available from IEEE
  • List of Additional Reviewers

    Publication Year: 2013, Page(s): xv
    Request permission for commercial reuse | |PDF file iconPDF (39 KB)
    Freely Available from IEEE
  • LICS: Logic in Computer Security -- Some Attacker's Models and Related Decision Problems

    Publication Year: 2013, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (92 KB) | HTML iconHTML

    Logic plays an important role in formal aspects of computer security, for instance in access control, security of communications or even intrusion detection. The peculiarity of security problems is the presence of an attacker, whose goal is to break the intended properties of a system/database/protocol... In this tutorial, we will consider several attacker's models and study how to find attacks (o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic

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

    Security protocols, such as key-exchange and key management protocols, are short, but notoriously difficult to prove correct. Flaws have been found in numerous protocols, ranging from the the 802.11 Wired Equivalent Privacy (WEP) protocol used to protect link-layer communications from eavesdropping and other attacks to standards and proposed standards for Secure Socket Layer to Kerberos. Not surpr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Duality in Logic and Computation

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

    I give a brief introduction to Stone duality and then survey a number of duality theories that arise in logic and computer science. I mention some more unfamiliar dualities at the end which may be of importance to emerging fields within computer science. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Timed and Probabilistic I/O Automata

    Publication Year: 2013, Page(s): 12
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (138 KB) | HTML iconHTML

    Summary form only given. The Timed I/O Automata (TIOA) modeling framework has been used for describing and analyzing many distributed algorithms, ranging from data-management algorithms to clock-synchronization algorithms to robot-coordination algorithms. These algorithms include timing aspects, and both discrete and continuous behavior. In this talk, I will describe the TIOA framework in some det... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regular Functions and Cost Register Automata

    Publication Year: 2013, Page(s):13 - 22
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (292 KB) | HTML iconHTML

    We propose a deterministic model for associating costs with strings that is parameterized by operations of interest (such as addition, scaling, and minimum), a notion of regularity that provides a yardstick to measure expressiveness, and study decision problems and theoretical properties of resulting classes of cost functions. Our definition of regularity relies on the theory of string-to-tree tra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Presburger Vector Addition Systems

    Publication Year: 2013, Page(s):23 - 32
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (336 KB) | HTML iconHTML

    The reachability problem for Vector Addition Systems (VAS) is a central problem of net theory. The problem is known to be decidable by inductive invariants definable in the Presburger arithmetic. When the reachability set is definable in the Presburger arithmetic, the existence of such an inductive invariant is immediate. However, in this case, the computation of a Presburger formula denoting the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reasoning about Data Repetitions with Counter Systems

    Publication Year: 2013, Page(s):33 - 42
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (314 KB) | HTML iconHTML

    We study linear-time temporal logics interpreted over data words with multiple attributes. We restrict the atomic formulas to equalities of attribute values in successive positions and to repetitions of attribute values in the future or past. We demonstrate correspondences between satisfiability problems for logics and reachability-like decision problems for counter systems. We show that allowing/... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Context-Freeness Problem for Vector Addition Systems

    Publication Year: 2013, Page(s):43 - 52
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (330 KB) | HTML iconHTML

    Petri nets, or equivalently vector addition systems (VAS), are widely recognized as a central model for concurrent systems. Many interesting properties are decidable for this class, such as boundedness, reachability, regularity, as well as context-freeness, which is the focus of this paper. The context-freeness problem asks whether the trace language of a given VAS is context-free. This problem wa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Groupoids, Hypergraphs, and Symmetries in Finite Models

    Publication Year: 2013, Page(s):53 - 62
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (383 KB) | HTML iconHTML

    We propose a novel construction of finite hypergraphs and relational structures that is based on reduced products with Cayley graphs of groupoids. The universal algebraic and combinatorial properties of groupoids are abstracted form the composition behaviour of partial injections and support a very natural approach to the construction of certain highly symmetric finite instances of hypergraphs and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree

    Publication Year: 2013, Page(s):63 - 72
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (315 KB) | HTML iconHTML

    This paper's main result presents a 3-fold exponential algorithm that transforms a first-order formula φ together with a number d into a formula in Gaifman normal form that is equivalent to φ on the class of structures of degree at most d. For structures of polynomial growth, we even get a 2-fold exponential algorithm. These results are complemented by matching lower bounds: We show ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-Variable Logic with Counting and Trees

    Publication Year: 2013, Page(s):73 - 82
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (279 KB) | HTML iconHTML

    We consider the two-variable logic with counting quantifiers (C2) interpreted over finite structures that contain two forests of ranked trees. This logic is strictly more expressive than standard C2 and it is no longer a fragment of the first order logic. In particular, it can express that a structure is a ranked tree, a cycle or a connected graph of bounded degree. It is als... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measurable Spaces and Their Effect Logic

    Publication Year: 2013, Page(s):83 - 92
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (321 KB) | HTML iconHTML

    So-called effect algebras and modules are basic mathematical structures that were first identified in mathematical physics, for the study of quantum logic and quantum probability. They incorporate a double negation law p⊥⊥ = p. Since then it has been realised that these effect structures form a useful abstraction that covers not only quantum logic, but also Boolean logic a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Topological Structure of Quantum Algorithms

    Publication Year: 2013, Page(s):93 - 102
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (234 KB) | HTML iconHTML

    We use a categorical topological semantics to examine the Deutsch-Jozsa, hidden subgroup and single-shot Grover algorithms. This reveals important structures hidden by conventional algebraic presentations, and allows novel proofs of correctness via local topological operations, giving for the first time a satisfying high-level explanation for why these procedures work. We also investigate generali... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Query Complexity of Real Functionals

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

    Recently Kawamura and Cook developed a framework to define the computational complexity of operators arising in analysis. Our goal is to understand the effects of complexity restrictions on the analytical properties of the operator. We focus on the case of norms over C[0,1] and introduce the notion of dependence of a norm on a point and relate it to the query complexity of the norm. We show that t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantitative Monadic Second-Order Logic

    Publication Year: 2013, Page(s):113 - 122
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (414 KB) | HTML iconHTML

    While monadic second-order logic is a prominent logic for specifying languages of finite words, it lacks the power to compute quantitative properties, e.g. to count. An automata model capable of computing such properties are weighted automata, but logics equivalent to these automata have only recently emerged. We propose a new framework for adding quantitative properties to logics specifying Boole... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory

    Publication Year: 2013, Page(s): 123
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (272 KB) | HTML iconHTML

    Cost monadic logic extends monadic second-order logic with the ability to measure the cardinality of sets and comes with decision procedures for boundedness related questions. We provide new decidability results allowing the systematic investigation of questions involving “relative boundedness”. We first introduce a suitable logic, magnitude monadic logic. We then establish the decid... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantitative Reasoning for Proving Lock-Freedom

    Publication Year: 2013, Page(s):124 - 133
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (292 KB) | HTML iconHTML

    This article describes a novel quantitative proof technique for the modular and local verification of lock-freedom. In contrast to proofs based on temporal rely-guarantee requirements, this new quantitative reasoning method can be directly integrated in modern program logics that are designed for the verification of safety properties. Using a single formalism for verifying memory safety and lock-f... View full abstract»

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