CSL-LICS 2014 FULL AND FINAL PROCEEDINGS: EDITOR'S PREFACE

This volume contains the proceedings of the Joint Meeting of the Twenty-Third Annual EACSL Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).  CSL is the annual meeting of the European Association for Computer Science Logic (EACSL) intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science.  LICS is an annual international forum on theoretical and practical topics in computer science that relate to logic.  Every 3--4 years,  LICS has been part of the Federated Logic Conference (FLoC). Given that FLoC was to be held as part of the Vienna Summer of Logic (VSL) during July 2014, the organizers of CSL and LICS have chosen to merge the 2014 editions of these meetings into a single event within FLoC and VSL.  Thus, in 2014, the joint meeting had one program committee, one program, and one proceedings.

The CSL-LICS 2014 program included invited lectures by Christel Baier (TU Dresden) and Patrick Cousot (Courant Institute of Mathematical Sciences, NYU) as well as invited tutorials by Jasmin Fisher (Microsoft Research Cambridge, UK) and Assia Mahboubi (INRIA Saclay).  The 74 contributed papers in these proceedings were accepted from 212 papers that were submitted.  A total of 864 reviews were gathered for these papers and the program committee debated electronically, using the EasyChair conference utility, for more than two weeks in order to decide on all papers.

Three different awards presentations were also part of the CSL-LICS program.

• The LICS conference awards the Kleene Award annually to the best student paper or papers accepted for presentation at LICS that year. This year there were seven eligible student papers accepted to CSL-LICS 2014.  The program committee chose two students to share the 2014 award: Flavien Breuvart for his paper ``On the characterization of models of H*''' and Yaron Velner for his paper ``Finite-memory strategy synthesis for robust multidimensional mean-payoff objectives.''
• To acknowledge the long-term, foundational nature of papers appearing in LICS, the Test-of-Time Award is now awarded every year to the paper or papers that were published in LICS twenty years ago and that have ``stood the test of time.''  The Test-of-Time Award winners for papers published in LICS 1994 are described in an article by Dexter Kozen.
• The Ackermann Award is the EACSL Outstanding Dissertation Award for Logic in Computer Science and is presented during CSL.  The citation for the Ackermann Award for 2014 is described in an article by Anuj Dawar.

A program as large as the one in these proceedings is not possible without a great deal of support from many people.  On behalf of the entire CSL and LICS communities, we would like to thank the authors of the submitted papers and the reviewers for their support of this joint meeting.  The large number of submitted papers and the willingness of over 450 reviewers to contribute to the evaluation of papers clearly indicates that there is a great deal of enthusiasm for computational logic.

Special thanks are due to both Anuj Dawar, the President of the EACSL, and Luke Ong, the General Chair of LICS, for their wise advice; to Andrzej Murawski and Kaustuv Chaudhuri for their assistance with publicity; to Patricia Bouyer-Decitre and Georg Moser for helping to organize the workshops associate with CSL-LICS; to Krishnendu Chatterjee and Jan Otop for their assistance with local organization; and to the members of the CSL-LICS 2014 program committee.  Thanks also to the FLoC General Chair Moshe Vardi, and especially to the FLoC 2014 Chair Helmut Veith for being our interface to the VSL organizers.

This joint meeting has been sponsored by the Association for Computing Machinery, the IEEE Computer Society, the European Association for Computer Science Logic, and the ACM Special Interest Group on Logic and Computation (SIGLOG) and in cooperation with the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), the Association for Symbolic Logic, and the European Association for Theoretical Computer Science.