Logical Foundations of Computer Science

1. Front Matter

   PDF

2. Compositional Reasoning for Multi-modal Logics

   • Luca Aceto, Anna Ingólfsdóttir, Cristian Prisacariu, Joshua Sack

   Pages 1-15

3. Explicit Generic Common Knowledge

   • Evangelia Antonakos

   Pages 16-28

4. Beyond 2-Safety: Asymmetric Product Programs for Relational Program Verification

   • Gilles Barthe, Juan Manuel Crespo, César Kunz

   Pages 29-43

5. Assignment Calculus: A Pure Imperative Language

   • Marc Bender, Jeffery Zucker

   Pages 44-58

6. Multiplayer Cost Games with Simple Nash Equilibria

   • Thomas Brihaye, Julie De Pril, Sven Schewe

   Pages 59-73

7. Forward Chaining for Hybrid ASP

   • Alex Brik, Jeffrey B. Remmel

   Pages 74-88

8. Effectivity Questions for Kleene’s Recursion Theorem

   • John Case, Sanjay Jain, Frank Stephan

   Pages 89-103

9. Sub-computable Bounded Pseudorandomness

   • Douglas Cenzer, Jeffrey B. Remmel

   Pages 104-118

10. Automated Support for the Investigation of Paraconsistent and Other Logics

    • Agata Ciabattoni, Ori Lahav, Lara Spendier, Anna Zamansky

    Pages 119-133

11. A Modal BI Logic for Dynamic Resource Properties

    • J. R. Courtault, D. Galmiche

    Pages 134-148

12. Stuttering for Abstract Probabilistic Automata

    • Benoît Delahaye, Kim G. Larsen, Axel Legay

    Pages 149-163

13. Call-by-Value Non-determinism in a Linear Logic Type Discipline

    • Alejandro Díaz-Caro, Giulio Manzonetto, Michele Pagani

    Pages 164-178

14. The Wadge Hierarchy of Petri Nets ω-Languages

    • Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre

    Pages 179-193

15. Iterated Contraction Based on Indistinguishability

    • Konstantinos Georgatos

    Pages 194-205

16. A Note on Extensions: Admissible Rules via Semantics

    • Jeroen Goudsmit

    Pages 206-218

17. Subset Space vs Relational Semantics of Bimodal Logic: Bringing Out the Difference

    • Bernhard Heinemann

    Pages 219-233

18. Quantified Differential Temporal Dynamic Logic for Verifying Properties of Distributed Hybrid Systems

    • Ping Hou, Hao Zheng

    Pages 234-251

19. Computational Hardness of Validity in Probability Logic

    • Rutger Kuyper

    Pages 252-265

20. Update as Evidence: Belief Expansion

    • Roman Kuznets, Thomas Studer

    Pages 266-279

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2013, held in San Diego, CA, USA in January 2013. The volume presents 29 revised refereed papers carefully selected by the program committee. 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.

• algorithmic randomness
• effective symbolic dynamics
• inductive inference
• multi-modal logic
• probabilistic automata

• Computer Science, CUNY Graduate Center, New York, USA

  Sergei Artemov

• Department of Mathematics, Cornell University, Ithaca, USA

  Anil Nerode

Policies and ethics