Mathematical Foundations of Computer Science 2015

40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I

  • Giuseppe F Italiano
  • Giovanni Pighizzini
  • Donald T. Sannella
Conference proceedings MFCS 2015

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9234)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9234)

Table of contents

  1. Front Matter
    Pages I-XXVI
  2. Invited Contributions

  3. Logic, Semantics, Automata and Theory of Programming

    1. Front Matter
      Pages 61-61
    2. Samy Abbes, Jean Mairesse
      Pages 63-75
    3. L. Aceto, D. Della Monica, I. Fábregas, A. Ingólfsdóttir
      Pages 76-88
    4. Guy Avni, Orna Kupferman
      Pages 89-102
    5. Mikhail Berlinkov, Marek Szykuła
      Pages 103-115
    6. Valérie Berthé, Eda Cesaratto, Pablo Rotondo, Brigitte Vallée, Alfredo Viola
      Pages 116-128
    7. Michaël Cadilhac, Andreas Krebs, Michael Ludwig, Charles Paperman
      Pages 141-153
    8. Stefano Crespi Reghizzi, Violetta Lonati, Dino Mandrioli, Matteo Pradella
      Pages 154-166
    9. Laure Daviaud, Charles Paperman
      Pages 167-178
    10. Cătălin Dima, Bastien Maubert, Sophie Pinchinat
      Pages 179-191
    11. Manfred Droste, Stefan Dück
      Pages 192-204
    12. Marius Dumitran, Florin Manea
      Pages 205-217
    13. Bruno Durand, Andrei Romashchenko
      Pages 218-230

About these proceedings


This two volume set LNCS 9234 and 9235 constitutes the refereed conference proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015, held in Milan, Italy, in August 2015. The 82 revised full papers presented together with 5 invited talks were carefully selected from 201 submissions. The papers feature high-quality research in all branches of theoretical computer science. They have been organized in the following topical main sections: logic, semantics, automata, and theory of programming (volume 1) and algorithms, complexity, and games (volume 2).


algebra and categories in computer science algorithmic game theory algorithmic learning theory algorithms and data structures approximation algorithms automata-computational complexity concurrency theory cryptography and security databases and knowledge-based systems distributed computing formal specifications foundations of computing grammars and formal languages lambda-calculus linear programming logic-networks parallel computing program development quantum computing semantics and verification of programs

Editors and affiliations

  • Giuseppe F Italiano
    • 1
  • Giovanni Pighizzini
    • 2
  • Donald T. Sannella
    • 3
  1. 1.Università di Roma "Tor Vergata"RomeItaly
  2. 2.Università degli Studi di MilanoMilanItaly
  3. 3.University of EdinburghEdinburghUnited Kingdom

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2015
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-662-48056-4
  • Online ISBN 978-3-662-48057-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Finance, Business & Banking
IT & Software
Energy, Utilities & Environment