Lecture Notes in Computer Science 7734

Transcription

1 Lecture Notes in Computer Science 7734 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Germany Madhu Sudan Microsoft Research, Cambridge, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany

2 Sergei Artemov Anil Nerode (Eds.) Logical Foundations of Computer Science International Symposium, LFCS 2013 San Diego, CA, USA, January 6-8, 2013 Proceedings 13

3 Volume Editors Sergei Artemov CUNY Graduate Center Computer Science 365 Fifth Avenue New York, NY 10016, USA Anil Nerode Cornell University Department of Mathematics 545 Malott Hall Ithaca, NY 14853, USA ISSN e-issn ISBN e-isbn DOI / Springer Heidelberg Dordrecht London New York Library of Congress Control Number: CR Subject Classification (1998): F.4.1, F.4, F.3, I.2.3, I.2.2, F.2 LNCS Sublibrary: SL 1 Theoretical Computer Science and General Issues Springer-Verlag Berlin Heidelberg 2013 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper Springer is part of Springer Science+Business Media (

4 Preface The Symposium on Logical Foundations of Computer Science series provides a forum for the fast-growing body of work in the logical foundations of computer science, e.g., those areas of fundamental theoretical logic related to computer science. The LFCS series began with Logic at Botik, Pereslavl-Zalessky, 1989, which was co-organized by Albert R. Meyer (MIT) and Michael Taitslin (Tver). After that, organization was taken over by Anil Nerode. Currently LFCS is governed by a Steering Committee consisting of Anil Nerode (General Chair), Stephen Cook, Dirk van Dalen, Yuri Matiyasevich, J. Alan Robinson, Gerald Sacks, and Dana Scott. The 2013 Symposium on Logical Foundations of Computer Science (LFCS 2013) took place in the Catamaran Resort Hotel, San Diego, California, during January 6 8. This volume contains the extended abstracts of talks selected by the Program Committee for presentation at LFCS The scope of the symposium is broad and includes constructive mathematics and type theory; logic, automata and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logic; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple agent system logics; logics of proof and justification; nonmonotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; and other logics in computer science. We thank the authors and reviewers for their contributions. We acknowledge the support of the U.S. National Science Foundation, the Graduate Center of the City University of New York, and the University of California, San Diego. We are grateful to Yu Junhua for preparing this volume for Springer. October 2012 Anil Nerode Sergei Artemov

5 LFCS 2013 Organization Steering Committee Stephen Cook University of Toronto, Canada Yuri Matiyasevich Steklov Mathematical Institute, St. Petersburg, Russia Anil Nerode Cornell University, USA - General Chair J. Alan Robinson Syracuse University, USA Gerald Sacks Harvard University, USA Dana Scott Carnegie-Mellon University, USA Dirk van Dalen Utrecht University, The Netherlands Program Committee Sergei Artemov Steve Awodey Alexandru Baltag Andreas Blass Samuel Buss Walter Dean Rod Downey Ruy de Queiroz Antonio Montalban Rosalie Iemhoff Bakhadyr Khoussainov Roman Kuznets Robert Lubarsky Victor Marek Franco Montagna Lawrence Moss Anil Nerode Mati Pentus Michael Rathjen Jeffrey Remmel Bryan Renne Philip Scott Alex Simpson Sonja Smets Alasdair Urquhart Michael Zakharyaschev CUNY Graduate Center, New York, USA - Chair Carnegie-Mellon University, Pittsburgh, USA University of Amsterdam, The Netherlands University of Michigan, Ann Arbor, USA University of California, San Diego, USA University of Warwick, UK Victoria University of Wellington, New Zealand Universidade Federal de Pernambuco, Recife, Brazil University of Chicago, USA Utrecht University, The Netherlands The University of Auckland, New Zealand University of Bern, Switzerland Florida Atlantic University, Boca Raton, USA University of Kentucky, Lexington, USA Università Degli Studi di Siena, Italy Indiana University Bloomington, USA Cornell University, Ithaca, USA Moscow State University, Russia University of Leeds, UK University of California, San Diego, USA University of Amsterdam, The Netherlands University of Ottawa, Canada University of Edinburgh, UK University of Groningen, The Netherlands University of Toronto, Canada Birkbeck College, University of London, UK

6 VIII LFCS 2013 Organization Additional Reviewers Laurent Bienvenu Samuel Bucheli Adam Chlipala Alexander Clark Chris Conidis Giovanni Curi Adam Day Eduardo Fermé Melvin Fitting Jörg Flum Nicola Gambino William Gasarch Konstantinos Georgatos Giorgio Ghelli Norihiro Kamide Kohei Kishida Hidenori Kurokawa Andrew Lewis Dan Licata Iris Loeb Glyn Morrill Andre Nies R. Ramanujam Jan Reimann Cody Roux Kristina Sojakova Mariya Soskova Kazushige Terui Sebastiaan Terwijn Jan van Eijck

7 Table of Contents Compositional Reasoning for Multi-modal Logics... 1 Luca Aceto, Anna Ingólfsdóttir, Cristian Prisacariu, and Joshua Sack Explicit Generic Common Knowledge Evangelia Antonakos Beyond 2-Safety: Asymmetric Product Programs for Relational Program Verification Gilles Barthe, Juan Manuel Crespo, and César Kunz Assignment Calculus: A Pure Imperative Language Marc Bender and Jeffery Zucker Multiplayer Cost Games with Simple Nash Equilibria Thomas Brihaye, Julie De Pril, and Sven Schewe Forward Chaining for Hybrid ASP Alex Brik and Jeffrey B. Remmel Effectivity Questions for Kleene s Recursion Theorem John Case, Sanjay Jain, and Frank Stephan Sub-computable Bounded Pseudorandomness Douglas Cenzer and Jeffrey B. Remmel Automated Support for the Investigation of Paraconsistent and Other Logics Agata Ciabattoni, Ori Lahav, Lara Spendier, and Anna Zamansky A Modal BI Logic for Dynamic Resource Properties J.R. Courtault and D. Galmiche Stuttering for Abstract Probabilistic Automata Benoît Delahaye, Kim G. Larsen, and Axel Legay Call-by-Value Non-determinism in a Linear Logic Type Discipline Alejandro Díaz-Caro, Giulio Manzonetto, and Michele Pagani The Wadge Hierarchy of Petri Nets ω-languages Jacques Duparc, Olivier Finkel, and Jean-Pierre Ressayre Iterated Contraction Based on Indistinguishability Konstantinos Georgatos

8 X Table of Contents A Note on Extensions: Admissible Rules via Semantics Jeroen Goudsmit Subset Space vs Relational Semantics of Bimodal Logic: Bringing Out the Difference Bernhard Heinemann Quantified Differential Temporal Dynamic Logic for Verifying Properties of Distributed Hybrid Systems Ping Hou and Hao Zheng Computational Hardness of Validity in Probability Logic Rutger Kuyper Update as Evidence: Belief Expansion Roman Kuznets and Thomas Studer Separating the Fan Theorem and Its Weakenings Robert S. Lubarsky and Hannes Diener The Logic of Uncertain Justifications Bob Milnikel Justifications, Awareness and Epistemic Dynamics Igor Sedlár Normal Forms for Multiple Context-Free Languages and Displacement Lambek Grammars Alexey Sorokin Constructive Polychronous Systems Jean-Pierre Talpin, Jens Brandt, Mike Gemünde, Klaus Schneider, and Sandeep Shukla On Tolerance Analysis of Games with Belief Revision Çağıl Taşdemir Temporalizing Modal Epistemic Logic Ren-June Wang Contextual Natural Deduction Bruno Woltzenlogel Paleo Conservatively Approximable Functions Sebastian Wyman Self-referentiality in the Brouwer Heyting Kolmogorov Semantics of Intuitionistic Logic Junhua Yu Author Index