- finite-model-theory - lists.rwth-aachen.de

FM'19: Second Call for Papers
by Renato Neves 10 Jan '19

10 Jan '19

================================================================================================== Second Call for Papers FM 2019 - 23rd International Symposium on Formal Methods - 3rd World Congress on Formal Methods Porto, Portugal, October 7-11, 2019 http://formalmethods2019.inesctec.pt/ ================================================================================================== NEW: announcement of three invited speakers and confirmation of two special issues !!! ================================================================================================== FM 2019 is the 23rd international symposium in a series organised by Formal Methods Europe (FME), an independent association whose aim is to stimulate the use of, and research on, formal methods for software development. Every 10 years the symposium is organised as a World Congress. Twenty years after FM 1999 in Toulouse, and 10 years after FM 2009 in Eindhoven, FM 2019 is the 3rd World Congress on Formal Methods. This is reflected in a PC with members from over 40 countries. Thus, FM 2019 will be both an occasion to celebrate and a platform for enthusiastic researchers and practitioners from a diversity of backgrounds to exchange their ideas and share their experience. FORMAL METHODS: THE NEXT 30 YEARS It is now more than 30 years since the first VDM symposium in 1987 brought together researchers with the common goal of creating methods to produce high quality software based on rigour and reason. Since then the diversity and complexity of computer technology has changed enormously and the formal methods community has stepped up to the challenges those changes brought by adapting, generalising and improving the models and analysis techniques that were the focus of that first symposium. The theme for FM 2019 is a reflection on how far the community has come and the lessons we can learn for understanding and developing the best software for future technologies. Important Dates ================ Abstract submission: 28 March, 2019 Full paper submission: 11 April, 2019, 23:59 AoE Notification: 11 June, 2019 Camera ready: 9 July, 2019 Conference: 7-11 October, 2019 Invited Speakers ================= - June Andronick (CSIRO/Data61 and UNSW, Sydney, Australia) - Shriram Krishnamurthi (Brown University, Providence, RI, USA) - Erik Poll (Radboud University, Nijmegen, The Netherlands) Topics of Interest ====================== FM 2019 encourages submissions on formal methods in a wide range of domains including software, computer-based systems, systems-of-systems, cyber-physical systems, human-computer interaction, manufacturing, sustainability, energy, transport, smart cities, and healthcare. We particularly welcome papers on techniques, tools and experiences in interdisciplinary settings. We also welcome papers on experiences of formal methods in industry, and on the design and validation of formal methods tools. The broad topics of interest for FM 2019 include, but are not limited to: - Interdisciplinary formal methods: Techniques, tools and experiences demonstrating the use of formal methods in interdisciplinary settings. - Formal methods in practice: Industrial applications of formal methods, experience with formal methods in industry, tool usage reports, experiments with challenge problems. The authors are encouraged to explain how formal methods overcame problems, led to improved designs, or provided new insights. - Tools for formal methods: Advances in automated verification, model checking, and testing with formal methods, tools integration, environments for formal methods, and experimental validation of tools. The authors are encouraged to demonstrate empirically that the new tool or environment advances the state of the art. - Formal methods in software and systems engineering: Development processes with formal methods, usage guidelines for formal methods, and method integration. The authors are encouraged to evaluate process innovations with respect to qualitative or quantitative improvements. Empirical studies and evaluations are also solicited. - Theoretical foundations of formal methods: All aspects of theory related to specification, verification, refinement, and static and dynamic analysis. The authors are encouraged to explain how their results contribute to the solution of practical problems with formal methods or tools. Submission Guidelines ======================= Papers should be original work, not published or submitted elsewhere, in Springer LNCS format, written in English, submitted through EasyChair: https://easychair.org/conferences/?conf=fm2019 Each paper will be evaluated by at least three members of the Programme Committee. Authors of papers reporting experimental work are strongly encouraged to make their experimental results available for use by the reviewers. Similarly, case study papers should describe significant case studies, and the complete development should be made available at the time of review. The usual criteria for novelty, reproducibility, correctness and the ability for others to build upon the described work apply. Tool papers should explain enhancements made compared to previously published work. A tool paper need not present the theory behind the tool but should focus on the tool's features, how it is used, its evaluation, and examples and screen shots illustrating the tool's use. Authors of tool papers should make their tool available for use by the reviewers. We solicit two categories of papers: - Regular Papers should not exceed 15 pages, not counting references and appendices. - Short papers, including tool papers, should not exceed 6 pages, not counting references and appendices. Besides tool papers, short papers are encouraged for any topic that can be described within the page limit, and in particular for novel ideas without an extensive experimental evaluation. Short papers will be accompanied by short presentations. For regular and tool papers, an appendix can provide additional material such as details on proofs or experiments. The appendix is not part of the page count and not guaranteed to be read or taken into account by the reviewers. It should not contain information necessary to the understanding and the evaluation of the presented work. Papers will be accepted or rejected in the category in which they were submitted. At least one author of an accepted paper is expected to present the paper at the conference as a registered participant. Best Paper Award ================= At the conference, the PC Chairs will present an award to the authors of the submission selected as the FM 2019 Best Paper. Publication ============ Accepted papers will be published in the Symposium Proceedings to appear in Springer's Lecture Notes in Computer Science in the subline on Formal Methods. Authors of selected papers will be invited to submit an extended version of their paper to one of the special issues in "Formal Aspects of Computing" and "Formal Methods in System Design". General Chair ============== José Nuno Oliveira, INESC TEC & University of Minho, PT Program Committee Chairs ========================= Maurice ter Beek, ISTI-CNR, Pisa, IT Annabelle McIver, Macquarie University, Sydney, AU Program Committee ================== Bernhard Aichernig, TU Graz, AT Elvira Albert, Complutense University of Madrid, ES María Alpuente, Polytechnic University of Valencia, ES Dalal Alrajeh, Imperial College, UK Mário S. Alvim, Federal University of Minas Gerais, BR June Andronick, CSIRO/Data61, AU Christel Baier, TU Dresden, DE Luís Barbosa, University of Minho and UN University, PT Gilles Barthe, IMDEA Software Institute, ES Marcello Bersani, Polytechnic University of Milan, IT Gustavo Betarte, Tilsor SA and University of the Republic, UY Nikolaj Bjørner, Microsoft Research, US Frank de Boer, CWI, NL Sergiy Bogomolov, Australian National University, AU Julien Brunel, ONERA, FR Néstor Cataño, Pontifical Xavierian University of Cali, CO Ana Cavalcanti, University of York, UK Antonio Cerone, Nazarbayev University, KZ Marsha Chechik, University of Toronto, CA David Chemouil, ONERA, FR Alessandro Cimatti, FBK-IRST, IT Alcino Cunha, University of Minho, PT Michael Dierkes, Rockwell Collins, FR Alessandro Fantechi, University of Florence, IT Carla Ferreira, New University of Lisbon, PT João Ferreira, Teesside University, UK José Fiadeiro, Royal Holloway University of London, UK Marcelo Frias, Buenos Aires Institute of Technology, AR Fatemeh Ghassemi, University of Tehran, IR Silvia Ghilezan, University of Novi Sad, RS Stefania Gnesi, ISTI-CNR, IT Reiner Hähnle, TU Darmstadt, DE Osman Hasan, National University of Sciences and Technology, PK Klaus Havelund, NASA Jet Propulsion Laboratory, US Anne Haxthausen, TU Denmark, DK Ian Hayes, University of Queensland, AU Constance Heitmeyer, Naval Research Laboratory, US Jane Hillston, University of Edinburgh, UK Thai Son Hoang, University of Southampton, UK Zhenjiang Hu, National Institute of Informatics, JP Dang Van Hung, Vietnam National University, VN Atsushi Igarashi, Kyoto University, JP Suman Jana, Columbia University, US Ali Jaoua, Qatar University, QA Einar Broch Johnson, University of Oslo, NO Joost-Pieter Katoen, RWTH Aachen University, DE Laura Kovács, TU Vienna, AT Axel Legay, KU Leuven, BE Alberto Lluch Lafuente, TU Denmark, DK Malte Lochau, TU Darmstadt, DE Michele Loreti, University of Camerino, IT Gabriele Lenzini, University of Luxembourg, LU Yang Liu, Nanyang Technical University, SG Anastasia Mavridou, NASA Ames, US Hernán Melgratti, University of Buenos Aires, AR Sun Meng, Peking University, CN Dominique Méry, LORIA and University of Lorraine, FR Rosemary Monahan, Maynooth University, IE Olfa Mosbahi, University of Carthage, TN Mohammad Mousavi, University of Leicester, UK César Muñoz, NASA Langley, US Tim Nelson, Brown University, US Gethin Norman, University of Glasgow, UK Colin O'Halloran, D-RisQ Software Systems, UK Federico Olmedo, University of Chile, CL Gordon Pace, University of Malta, MT Jan Peleska, University of Bremen, DE Marielle Petit-Doche, Systerel, FR Alexandre Petrenko, Computer Research Institute of Montréal, CA Anna Philippou, University of Cyprus, CY Jorge Sousa Pinto, University of Minho, PT André Platzer, Carnegie Mellon University, US Jaco van de Pol, Aarhus University, DK Tahiry Rabehaja, Macquarie University, AU Steve Reeves, University of Waikato, NZ Matteo Rossi, Polytechnic University of Milan, IT Augusto Sampaio, Federal University of Pernambuco, BR Gerardo Schneider, Chalmers University of Gothenburg, SE Daniel Schwartz-Narbonne, Amazon Web Services, US Natasha Sharygina, University of Lugano, CH Nikolay Shilov, Innopolis University, RU Ana Sokolova, University of Salzburg, AT Marielle Stoelinga, University of Twente, NL Jun Sun, Singapore University of Technology and Design, SG Helen Treharne, University of Surrey, UK Elena Troubitsyna, Åbo Akademi University, FI Tarmo Uustalu, Reykjavik University, IS Andrea Vandin, TU Denmark, DK R. Venkatesh, TCS Research, IN Erik de Vink, TU Eindhoven and CWI, NL Willem Visser, Stellenbosch University, ZA Farn Wang, National Taiwan University, TW Bruce Watson, Stellenbosch University, ZA Tim Willemse, TU Eindhoven, NL Kirsten Winter, University of Queensland, AU Jim Woodcock, University of York, UK Lijun Zhang, Chinese Academy of Sciences, CN Publicity Chair ================ Luís Soares Barbosa, INESC TEC & University of Minho, PT Organizing Committee ===================== José Creissac Campos, INESC TEC & University of Minho, PT João Pascoal Faria, INESC TEC and University of Porto, PT Sara Fernandes, University of Minho & INESC TEC, PT Luís Neves, Critical Software, PT Local Arrangements =================== Catarina Fernandes, INESC TEC & University of Minho, PT Paula Rodrigues, INESC TEC, PT Web Team ========= Francisco Neves, INESC TEC & University of Minho, PT Rogério Pontes, INESC TEC & University of Minho, PT Paula Rodrigues, INESC TEC, PT

1 0

CiE 2019 Final CFP
by Gianluca Della Vedova 09 Jan '19

09 Jan '19

============================ CiE 2019 FINAL CALL FOR PAPERS: ============================ CiE 2019: Computing with Foresight and Industry Durham, United Kingdom July 15 - July 19, 2019 https://community.dur.ac.uk/cie.2019/ http://www.computability.org.uk IMPORTANT DATES: ============================ Deadline for abstract registration and article submission: 21 January 2019 AOENotification of acceptance: 18 March 2019 Final versions due: 4 April 2019 Deadline for informal presentations submission: 1 May 2019 (The notifications of acceptance for informal presentations will be sent a few days after submission.) Early registration before: 15 May 2019 CiE 2019 is the 15th conference organized by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010), Sofia (2011), Cambridge (2012), Milan (2013), Budapest (2014), Bucharest (2015), Paris (2016), Turku (2017) and Kiel (2018). TUTORIAL SPEAKERS: ================== - Markus Holzer (JLU Giessen) - Assia Mahboubi (University of Nantes) INVITED SPEAKERS: ================= - Felipe Cucker (City University of Hong Kong) - Ursula Martin (University of Oxford) - Alexander Schönhuth (CWI, Amsterdam) - Sonja Smets (University of Amsterdam) - Linda Brown Westrick (Penn State) HOSTED BY: ============= Algorithms and Complexity in Durham (ACiD), a research group in the Department of Computer Science, Durham University For questions please contact the organisers at the e-mail address cie.2019(a)durham.ac.uk. SPECIAL SESSIONS: ================= Computational Neuroscience, organised by Noura Al Moubayed (Durham University) and Jason Connolly (Durham University) - Ulrik Beierholm (Durham University) - Evelyne Sernagor (Newcastle University) History and Philosophy of Computing, organised by the Council of the HaPoC Commission - Tony Hoare (University of Oxford, via Skype) - Michael Jackson (Open University) - Ray Turner (University of Essex) Lowness Notions in Computability, organised by Johanna Franklin (Hofstra University) and Joseph S. Miller (University of Wisconsin-Madison) - Kenshi Miyabe (Meiji University) - Benoit Monin (LACL, Créteil University) - Keng Meng Ng (Nanyang Technological University) - Don Stull (LORIA) Probabilistic Programming and Higher-Order Computation, organised by Christine Tasson (Paris Diderot University) - Thomas Ehrhard (IRIF, Paris Diderot University) - Cameron Freer (MIT) - Joost-Pieter Katoen (RWTH Aachen) - Sam Staton (University of Oxford) Smoothed and Probabilistic Analysis of Algorithms, organised by Bodo Manthey (University of Twente) - Sophie Huiberts (CWI, Amsterdam) - Stefan Klootwijk (University of Twente) - Clemens Rösner (University of Bonn) - Sebastian Wild (University of Waterloo) Transfinite Computations, organised by Sabrina Ouazzani (Paris-Est Créteil University) - Lorenzo Galeotti (University of Hamburg) - Benjamin Rin (Utrecht University) - Philip Welch (University of Bristol) CONTRIBUTED PAPERS: =================== Contributed papers will be selected from submissions received by the PROGRAMME COMMITTEE consisting of: Erika Abraham (RWTH Aachen) Merlin Carl (University of Konstanz) Erzsébet Csuhaj-Varjú (Eötvös Loránd University) Walter Dean (University of Warwick) Henning Fernau (University of Trier) Gianluca Della Vedova (University of Milano-Bicocca) Liesbeth De Mol (University of Lille) Valeria de Paiva (Nuance Communications) Alessandra Di Pierro (University of Verona) Johanna Franklin (Hofstra University) Pawel Gawrychowski (University of Wrocław) Pinar Heggernes (University of Bergen) Mathieu Hoyrup (LORIA) Peter Jonsson (Linköping University) Dietrich Kuske (TU Ilmenau) Stephane Le Roux (TU Darmstadt) Benedikt Löwe (University of Amsterdam) Florin Manea (Christian-Albrechts-University) Barnaby Martin (Durham University) Elvira Mayordomo (University of Zaragoza) Klaus Meer (BTU Cottbus-Senftenberg) Dirk Nowotka (Christian-Albrechts-University) Arno Pauly (Swansea University) Daniel Paulusma (Durham University, co-chair) Daniela Petrisan (Paris Diderot University) Giuseppe Primiero (University of Milan, co-chair) Christine Tasson (Paris Diderot University) Hélène Touzet (University of Lille) Peter Van Emde Boas (University of Amsterdam) Georg Zetzsche (Paris Diderot University) The CiE conferences serve as an interdisciplinary forum for research in all aspects of computability, foundations of computer science, logic, and theoretical computer science, as well as the interplay of these areas with practical issues in computer science and with other disciplines such as biology, mathematics, philosophy, or physics. THE PROGRAMME COMMITTEE cordially invites all researchers (European and non-European) to submit their papers in all areas related to the above for presentation at the conference and inclusion in the proceedings of CiE 2019 at https://easychair.org/conferences/?conf=cie2019 . Papers must be submitted in PDF format, using the LNCS style (available at https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…) and must have a maximum of 12 pages, including references but excluding a possible appendix in which one can include proofs and other additional material. Papers building bridges between different parts of the research community are particularly welcome. The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag.

1 0

Call for Papers - Computer Science Logic (CSL 2020)
by EACSL Mail-Account 09 Jan '19

09 Jan '19

Call for Papers - Computer Science Logic (CSL 2020) 13-16 January 2020, Barcelona, Spain Paper Submission: 4 July 2019 https://easychair.org/cfp/CSL2020 Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). It is an interdisciplinary conference, spanning across both basic and application oriented research in mathematical logic and computer science. Submission Guidelines: Submitted papers must be in English and must provide sufficient detail to allow the Programme Committee to assess the merits of the paper. Full proofs may appear in a clearly marked technical appendix which will be read at the reviewers' discretion. Authors are strongly encouraged to include a well written introduction which is directed at all members of the PC. The CSL 2020 conference proceedings will be published by LIPIcs. Authors are invited to submit contributed papers of no more than 15 pages in LIPIcs style (not including references), presenting unpublished work fitting the scope of the conference. Papers may not be submitted concurrently to another conference with refereed proceedings. The PC chairs should be informed of closely related work submitted to a conference or a journal. Papers authored or co-authored by members of the PC are not allowed. Dates: paper submission: 4 July 2019 notifications: 14 October 2019 Program Committee Sandra Alves, University of Porto, Portugal Takahito Aoto, Niigata University, Japan Albert Atserias, Technical University of Catalonia, Spain Manuel Bodirsky, TU Dresden, Germany James Brotherston, University College London, UK Rohit Chadha, University of Missouri, USA Krishnendu Chatterjee, Institute of Science and Technology, Austria Adriana Compagnoni, Stevens Institute of Technology, USA Arnaud Durand, University Paris Diderot, France Maribel Fernandez, King's College London, UK (co-chair) Bernd Finkbeiner, Saarland University, Germany Masahito Hasegawa, Kyoto University, Japan Dietrich Kuske, TU Ilmenau, Germany Kamal Lodaya, IMSc Chennai, India Salvador Lucas, Technical University of Valencia, Spain Angelo Montanari, University of Udine, Italy Anca Muscholl, University of Bordeaux, France (co-chair) Prakash Panangaden, McGill University, Canada Elaine Pimentel, University of Rio Grande do Norte, Brazil Damien Pous, CNRS - ENS Lyon, France Femke van Raamsdonk, Vrije Universiteit Amsterdam, Netherlands Simona Ronchi Della Rocca, University of Torino, Italy Manfred Schmidt-Schauss, Goethe University, Germany Lutz Schröder, Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany Lidia Tendera, Opole University, Poland Szymon Torunczyk, University of Warsaw, Poland Glynn Winskel, University of Cambridge, UK Organizing committee Albert Atserias, Technical University of Catalonia, Spain Juan Carlos Martínez, University of Barcelona, Spain Venue The conference will be held in the University of Barcelona, Spain. Contact All questions about submissions should be emailed to the PC co-chairs: Maribel Fernandez Maribel.Fernandez(a)kcl.ac.uk Anca Muscholl anca(a)labri.fr

1 0

Research assistant position, University Koblenz-Landau
by Prof. Dr. Viorica Sofronie-Stokkermans 09 Jan '19

09 Jan '19

The Computer Science department of the University Koblenz-Landau (Campus Koblenz) invites applications for the position of a research assistant (wissenschaftlicher Mitarbeiter/Mitarbeiterin) (1,0 EGr. 13 TV-L) at PhD or postdoc level, in the research groups ``Formal methods and theoretical computer science'' (Prof. Dr. Viorica Sofronie-Stokkermans) and ``Computer Networks'' (Prof. Dr. Hannes Frey). The position is available for 2 years. A further extension is planned. The prospective scientific assistant will study theoretical modelling and verification of wireless networked automatic assistant systems like driver assistant systems, self-organizing fleet management, air traffic management, or UAV swarm robotics. Such systems will be modelled as graphs with certain structural properties which are typically satisfied by wireless networks (e.g. limited communication range, spatial correlated communication links). In this project such properties will be described by graph axioms. Based on the axioms local algorithms for structuring wireless graphs will be developed. Objectives are for example intersection free drawings, limited degree, connectivity, or spanner property. The project covers three areas: (1) based on automatic verification, correctness of local algorithms shall either be verified or falsified (in the latter case, counterexamples have to be generated), (2) local algorithms are to be designed which are correct or correct with high probability under the considered graph axioms, (3) validity of the graph axioms for describing wireless networks has to be investigated by stochastic analysis or by means of simulation. Focus of the three areas will be decided depending on the skills of the candidate. Besides participation in research the position includes teaching obligations in theoretical and technical fields of computer science. Application letters (including a CV) must be sent by e-mail as a single .pdf file to: bewerbung(a)uni-koblenz-landau.de with Cc to sofronie(a)uni-koblenz.de. *** In the subject line please indicate your name and the position number 140/2018 *** To receive full consideration, applications should be received by ** January 31, 2019 **. Applications sent after this date will be considered until the position is filled. Informal enquiries are welcome and may be sent to Viorica Sofronie-Stokkermans (sofronie(a)uni-koblenz.de). ====================================== Position code number: 140/2018 Application deadline: 31 January 2019 =======================================

1 0

Ackermann Award 2019: Call for Nominations
by Thomas Schwentick 06 Jan '19

06 Jan '19

ACKERMANN AWARD 2019 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE CALL FOR NOMINATIONS Nominations are now invited for the 2019 Ackermann Award. PhD dissertations in topics specified by the CSL and LICS conferences, which were formally accepted as PhD theses at a university or equivalent institution between 1.1.2017 and 31.12.2018 are eligible for nomination for the award. The deadline for submission is 1 April 2019. Submission details follow below. Nominations can be submitted from 1 January 2019 and should be sent to the chair of the Jury, Thomas Schwentick, by e-mail: thomas.schwentick(a)tu-dortmund.de The Award The 2019 Ackermann award will be presented to the recipient(s) at CSL 2020, the annual conference of the EACSL, 13-16 January 2020, in Barcelona. The award consists of * a certificate, * an invitation to present the thesis at the CSL conference, * the publication of the laudatio in the CSL proceedings, and * financial support to attend the conference. The jury is entitled to give the award to more (or less) than one dissertation in a year. Jury The jury consists of: * Christel Baier (TU Dresden); * Michael Benedikt (Oxford University); * Mikolaj Bojanczyk (University of Warsaw); * Jean Goubault-Larrecq (ENS Paris-Saclay); * Dexter Kozen (Cornell University); * Dale Miller (INRIA and Ecole Polytechnique), ACM SigLog representative; * Simona Ronchi Della Rocca (University of Torino), the vice-president of EACSL; * Thomas Schwentick (TU Dortmund) , the president of EACSL. How to submit The candidate or his/her supervisor should submit 1. the thesis (ps or pdf file); 2. a detailed description (not longer than 20 pages) of the thesis in ENGLISH (ps or pdf file); 3. a supporting letter by the PhD advisor and two supporting letters by other senior researchers (in English); supporting letters can also be sent directly to Thomas Schwentick (thomas.schwentick(a)tu-dortmund.de); 4. a short CV of the candidate; 5. a copy of the document asserting that the thesis was accepted as a PhD thesis at a recognized University (or equivalent institution) and that the candidate has received his/her PhD within the specified period. The submission should be sent by e-mail as attachments to the chairman of the jury, Thomas Schwentick: thomas.schwentick(a)tu-dortmund.de With the following subject line and text: * Subject: Ackermann Award 2019 Submission * Text: Name of candidate, list of attachments Submission can be sent via several e-mail messages. If this is the case, please indicate it in the text.

1 0

EPIT 2019 - Pre-registration deadline approaching - Databases, logic and automata, April 7-12, CIRM, Marseille, France
by Cristina Sirangelo 03 Jan '19

03 Jan '19

===================================================================== EPIT 2019 - Spring school on databases, logic and automata CIRM - Centre International de Rencontres Mathématiques - Marseille Luminy - France April 7-12, 2019 https://conferences.cirm-math.fr/1934.html ===================================================================== **** NEWS **** *** Pre-registration deadline approaching ! (January 13, 2019) Please pre-register at https://conferences.cirm-math.fr/1934.html IMPORTANT : Note that registration will be finalised only after receiving confirmation from us, and paying registration fees. *** Registration fees are fixed to 50 Euros per participant. Registration is free for CNRS agents. ===================================================================== EPIT (École de Printemps d'Informatique Théorique, https://epit.irif.fr/) is a French recurrent spring school in theoretical computer science, initiated by Maurice Nivat in 1973. It has since then spanned many exciting topics in foundational computer science, and has become a major event for the research community in France and beyond. The 2019 edition of the EPIT will cover the foundations of data management. It will in particular focus on the fruitful interaction between database theory and two other main areas of theoretical computer science : logic and automata - as well as other closely related fields, such as finite model theory, descriptive complexity, game theory, and inference. Programme --------- Sunday * Arrival before dinner Monday * Morning: Introduction to database theory (Pierre Senellart, ENS Paris) * Afternoon : - Optimal joins (Szymon Toruńczyk, Warsaw) - Poster session Tuesday * Morning: Logic and automata for semi-structured data (Diego Figueira, Bordeaux) * Afternoon: - Logic-based distributed query processing (Frank Neven, Hasselt) - Incremental query evaluation (Thomas Schwentick, Dortmund) Wednesday * Morning: Graph data management (Wim Martens, Beyreuth) Thursday * Morning: Databases and descriptive complexity (Nicole Schweikardt, Humboldt) * Afternoon: - View-based query processing (Nadime Francis, Marne la Vallée) - Incomplete data management (Leonid Libkin, Edinburgh) Friday * Morning : Ontologies and rules (Meghyn Bienvenu, Montpellier) Poster sessions will be organised, so that participants who are willing to, will be able to present their work. All courses will be given in English. A detailed schedule of activities is available here https://www.cirm-math.fr/ProgWeebly/2019/Renc1934/Prog1934.pdf. Audience ------------ Lectures are intended to be accessible to a wide audience. No prior knowledge of database theory will be assumed, but some familiarity with basic automata theory and logic is recommended. The EPIT 2019 Spring School is primarily addressed to PhD students and young researchers, but more senior participants are also encouraged to join. Date and Venue -------------- The EPIT 2019 Spring School will take place from Monday, April 8th to Friday, April 12th, 2019 in France, at CIRM, the International Center for Mathematical Meetings (https://www.cirm-math.fr/) in Luminy, Marseille. Directions for reaching CIRM are available here https://www.cirm-math.com/getting-to-cirm.html. Consider arriving at CIRM on Sunday April 7th before dinner and leaving on Friday April 12th after lunch. Registration ----------- Pre-registration is open on the Webpage of the event https://conferences.cirm-math.fr/1934.html until January 13th 2019. IMPORTANT : after pre-registration you will have to wait for our confirmation before proceeding to the payment of registration fees. Only then the registration will be finalised. We plan to enable registration a week after the pre-registration deadline at the latest. Registration fees, including accommodation and meals at CIRM, will be 50 Euros per participant (much less than initially announced). Registration will be free for CNRS agents. Organisation ------------ The school is organised by : Amélie Gheerbrant <amelie(a)irif.fr> Leonid Libkin <libkin(a)inf.ed.ac.uk> Luc Segoufin <luc.segoufin(a)inria.fr> Pierre Senellart <pierre(a)senellart.com> Cristina Sirangelo <cristina(a)irif.fr> For any further information please contact the organisers.

1 0

26th WoLLIC 2019 (Utrecht, The Netherlands) - 2nd Call for Papers
by Ruy de Queiroz 01 Jan '19

01 Jan '19

[Please circulate. Apologies for multiple copies.] CALL FOR PAPERS WoLLIC 2019 26th Workshop on Logic, Language, Information and Computation July 2nd to 5th, 2019 Utrecht, The Netherlands ORGANISATION Utrecht University, Faculty of Humanities, The Netherlands (host university) Centro de Informática, Universidade Federal de Pernambuco, Brazil CALL FOR PAPERS WoLLIC is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The twenty-fifth WoLLIC will be held at Utrecht University, The Netherlands, from July 2nd to 5th, 2019. It is sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the The Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), the European Association for Computer Science Logic (EACSL), ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC), the Sociedade Brasileira de Computação (SBC), and the Sociedade Brasileira de Lógica (SBL). Just before and after the main WoLLIC 2019 event, Utrecht University will host two satellite workshops: -Proof Theory in Logic on July 1-2, 2019. This workshop on the role of structural proof theory in the study of logics will consist of invited talks by researchers in that area. -Compositionality in formal and distributional models of natural language semantics, on July 6, 2019. The workshop programs will be announced end of December 2018 via the WoLLIC 2019 website (https://wollic2019.sites.uu.nl). Attendance of these satellite workshops is free, but registration is required. PAPER SUBMISSION Contributions are invited on all pertinent subjects, with particular interest in cross-disciplinary topics. Typical but not exclusive areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; proof mining, type theory, effective learnability; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection; foundations of mathematics; philosophy of mathematics; philosophical logic; philosophy of language. Proposed contributions should be in English, and consist of a scholarly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. Articles should be written in the LaTeX format of LNCS by Springer (see authors instructions at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). They must not exceed 12 pages, with up to 5 additional pages for references and technical appendices. The paper's main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting by one of its authors. (At least one author is required to pay the registration fee before granting that the paper will be published in the proceedings.) Papers must be submitted electronically at the WoLLIC 2019 EasyChair website. (Please go to http://wollic.org/wollic2019/instructions.html for instructions.) A title and single-paragraph abstract should be submitted by Feb 22, 2019, and the full paper by Feb 26, 2019 (firm date). Notifications are expected by April 5, 2019, and final papers for the proceedings will be due by April 15, 2019 (firm date). PROCEEDINGS The proceedings of WoLLIC 2019, including both invited and contributed papers, will be published in advance of the meeting as a volume in Springer's LNCS series. In addition, abstracts will be published in the Conference Report section of the Logic Journal of the IGPL, and selected contributions will be published (after a new round of reviewing) as a special post-conference WoLLIC 2019 issue of a scientific journal (to be confirmed). INVITED SPEAKERS (TBA) STUDENT GRANTS ASL sponsorship of WoLLIC 2019 will permit ASL student members to apply for a modest travel grant (deadline: May 1st, 2019). See http://www.aslonline.org/studenttravelawards.html for details. IMPORTANT DATES Feb 22, 2019: Paper title and abstract deadline Feb 26, 2019: Full paper deadline April 5, 2019: Author notification Apr 15, 2019: Final version deadline (firm) PROGRAMME COMMITTEE Raffaella Bernardi (University of Trento) Nick Bezhanishvili (University of Amsterdam) Ivano Ciardelli (Ludwig-Maximilians-Universität, Munich) Giuseppe Greco (Utrecht University) Philippe de Groote (INRIA Nancy) Rosalie Iemhoff (Utrecht University) (Co-CHAIR) Roberto Maieli (Department of Mathematics and Physics, University "Roma Tre”) Michael Moortgat (Utrecht University) (Co-CHAIR) Richard Moot (CNRS (LIRMM) & University of Montpellier) Larry Moss (Indiana University Bloomington) Sara Negri (University of Helsinki) Carlo Nicolai (King's College London) Valeria de Paiva (Nuance Comms and University of Birmingham) Alessandra Palmigiano (Delft University of Technology) Ruy de Queiroz (Centro de Informatica, Univ Federal de Pernambuco) Yde Venema (University of Amsterdam) Fan Yang (University of Helsinki) STEERING COMMITTEE Samson Abramsky, Johan van Benthem, Anuj Dawar, Joe Halpern, Wilfrid Hodges, Juliette Kennedy, Ulrich Kohlenbach, Daniel Leivant, Leonid Libkin, Angus Macintyre, Lawrence Moss, Luke Ong, Hiroakira Ono, Valeria de Paiva, Ruy de Queiroz, Jouko Väänänen. (Former Member: Grigori Mints (deceased).) ORGANISING COMMITTEE Giuseppe Greco (Utrecht University, The Netherlands) (Local co-chair) Anjolina G. de Oliveira (Univ Federal de Pernambuco, Brasil) Ruy de Queiroz (Univ Federal de Pernambuco, Brasil) (co-chair) SCIENTIFIC SPONSORSHIP Interest Group in Pure and Applied Logics (IGPL) The Association for Logic, Language and Information (FoLLI) Association for Symbolic Logic (ASL) European Association for Theoretical Computer Science (EATCS) European Association for Computer Science Logic (EACSL) ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC) Sociedade Brasileira de Computação (SBC) Sociedade Brasileira de Lógica (SBL) FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee. WEB PAGE http://wollic.org/wollic2019/

1 0

STACS 2019: Accepted Papers and First Call for Participation
by Rolf Niedermeier 21 Dec '18

21 Dec '18

======================================================================== STACS 2019 36th International Symposium on Theoretical Aspects of Computer Science March 13—16, 2019, TU Berlin, Berlin, Germany ======================================================================== The accepted papers and more information can be found via https://stacs2019.akt.tu-berlin.de/ The scientific program consists of three invited talks, two tutorial talks, and presentations of 54 contributed papers (selected from more than 260 submitted papers). It will start on March 13 early afternoon with the two tutorials and it will end on March 16 early afternoon. More details concerning program arrangements etc. will be added soon. The registration (via webpage above) is open. Early registration deadline: January 31, 2019, AoE.

1 0

ICDT2020 CfP - First Submission Cycle
by Carsten Lutz 20 Dec '18

20 Dec '18

CALL FOR PAPERS 23rd INTERNATIONAL CONFERENCE ON DATABASE THEORY (ICDT 2020) Copenhagen, Denmark, March 30 - April 2, 2020 * About ICDT ICDT is an international conferences series that addresses the principles and theory of data management. Since 2009, it is annually and jointly held with EDBT, the international conference on extending database technology. See also https://databasetheory.org/icdt-pages. * Broadening Scope As ICDT strives to broaden its scope, ICDT 2020 will have a Reach Out Track that calls for - novel formal frameworks or directions for database theory and/or - connections between principles of data management and other communities. The aim of the Reach Out track is to present novel and important directions for database theory and to expand the scope and impact of ICDT towards neighboring communities such as Database Systems, Artificial Intelligence, Knowledge Representation, Machine Learning, Programming Languages, Distributed Computing, and Operating Systems. It is reasonable for articles submitted to this track to be be shorter than regular ICDT submissions. Submissions will be judged mainly in terms of their potential to lead to valuable and impactful theoretical developments. We encourage authors to illustrate the potential impact via convincing examples, preliminary results, and clearly specified open problems. * Topics of Interest Every topic related to the principles of data management is relevant to ICDT. Particularly welcome are contributions that connect data management to theoretical computer science, and those that connect database theory and database practice. Examples of relevant topics include: - Data mining, information extraction, information retrieval, and database aspects of machine learning - Data models, design, structures, semantics, query languages, and algorithms for data management - Distributed and parallel databases, cloud computing - Databases and knowledge representation - Graph databases, (semantic) Web data, and Web services - Data streams and sketching - Data-centric (business) process management and workflows - Data and knowledge integration and exchange, data provenance, views, and data warehouses - Domain-specific databases (multimedia, scientific, spatial, etc) - Data privacy and security, concurrency, and recovery * Submission Cycles and Dates ICDT has two submission cycles, the first providing the possibility of a revision. First cycle abstract deadline: March 27, 2019 Full paper submission deadline: April 3, 2019 Notification: May 29, 2019 Second cycle abstract deadline: September 15, 2019 Full paper submission deadline: September 23, 2019 Notification: December 5, 2019 * Program Committee Program Committee Chair: Carsten Lutz (University of Bremen) Program Committee Members: Marcelo Arenas (PUC, Santiago de Chile) Michael Benedikt (University of Oxford) Christoph Berkholz (HU Berlin) Angela Bonifati (University Lyon 1) Pierre Bourhis (University of Lille) James Cheney (University of Edinburgh) Graham Cormode (University of Warwick) Victor Dalmau (UPF, Barcelona) Claire David (University Paris-Est) Floris Geerts (University of Antwerp) Bas Ketsman (EPFL, Lausanne) Daniel Kifer (Penn State University) Leonid Libkin (University of Edinburgh) Sebatian Maneth (University of Bremen) Filip Murlak (University of Warsaw) Reinhard Pichler (TU Vienna) Andreas Pieris (University of Edinburgh) Sebastian Rudolph (TU Dresden) Thomas Schwentick (University of Dortmund) Uri Stemmer (Ben-Gurion University, Negev) Domagoj Vrgoc (PUC, Santiago de Chile) Frank Wolter (University of Liverpool) * Submission Instructions Submissions will be electronic via EasyChair at https://easychair.org/conferences/?conf=icdt2020. Papers must be written in English and provide sufficient detail to allow the program committee to assess their merits. The results must be unpublished and not submitted for publication elsewhere, including the proceedings of other symposia, workshops, and journals. Papers must be submitted as a PDF document and use the LIPIcs style (http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors). Paper length is limited to 15 pages excluding references, both for regular submissions and for the Reach Out Track. Additional details may be included in a clearly marked appendix which will be read at the discretion of the program committee. Online appendices are not allowed. Papers that do not conform to these requirements may be rejected without further consideration. The proceedings will appear in the Leibniz International Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. This guarantees that the proceedings will be available under the gold open access model, that is, online and free of charge while the authors retain the rights over their work. At least one author of each accepted paper is expected to register at the conference and to present the paper. * Awards An award will be given to the Best Paper and to the Best Newcomer Paper where `newcomer' refers to the field of database theory. The latter award will preferentially be given to a paper authored only by students and in that case be called Best Student-Paper Award. The program committee reserves the right to not give any award and to split an award among several papers. Papers co-authored by program committee members are not eligible for an award.

1 0

Call for Nominations: VCLA International Student Awards 2019 - Logic and Computer Science
by Mihaela Rozman 18 Dec '18

18 Dec '18

The Vienna Center for Logic and Algorithms (VCLA) at TU Wien seeks nominations for the VCLA International Student Awards 2019. The annually awarded VCLA International Student Awards for Outstanding Master and Undergraduate Research (Bachelor) Theses (or equivalent) recognize authors of scientific works across the wide spectrum of Logic and Computer Science. Final Submission Deadline: 15.3.2019 AWARD *Outstanding Master Thesis Award: 1200 EUR *Outstanding Undergraduate Research (Bachelor) Award: 800 EUR *The winners will be invited to present their work at an award ceremony in Vienna, Austria. ELIGIBILITY *The degree must have been awarded between November 15th, 2017, and December 31st, 2018, (inclusive). *Students who obtained their degree at TU Wien are excluded from the nomination. MAIN AREAS OF INTEREST *Computational Logic, covering theoretical and mathematical foundations such as proof theory, model theory, computability theory, algorithmic lower and upper bounds, Boolean satisfiability (SAT), QBF, constraint satisfaction, satisfiability modulo theories, automated deduction (resolution, refutation, theorem proving), non-classical logics (substructural logics, multi-valued logics, deontic logics, modal and temporal logics), computational complexity and algorithms (complexity analysis, parameterized and exact algorithms, decomposition methods). *Databases and Artificial Intelligence, concerned with logical methods for modeling, storing, and drawing inferences from data and knowledge. This includes subjects like query languages based on logical concepts (Datalog, variants of SQL, XML, and SPARQL), novel database-theoretical methods (schema mappings, information extraction and integration), logic programming, knowledge representation and reasoning (ontologies, answer-set programming, belief change, inconsistency handling, argumentation, planning). *Verification, concerned with logical methods and automated tools for reasoning about the behavior and correctness of complex state-based systems such as software and hardware designs as well as hybrid systems. This ranges from model checking, program analysis and abstraction to new interdisciplinary areas such as fault localization, program repair, program synthesis, and the analysis of biological systems. NOMINATION REQUIREMENTS *For nomination instructions, please visit <https://logic-cs.at/award-call-2019/> https://logic-cs.at/award-call-2019/ *Kindly address all inquiries to <mailto:award@logic-cs.at> award(a)logic-cs.at IMPORTANT DATES *Final submission deadline: March 15, 2019 (AoE) *Notification of decision: end of June 2019 *Award ceremony: September 2019, Vienna (Austria) AWARD COMMITTEE 2019 To be announced in January 2019. For the VCLA Award Committee 2018 see: <http://www.vcla.at/vcla-awards/> http://www.vcla.at/vcla-awards/ *Robert Ganian (committee co-chair) *Magdalena Ortiz (general chair) *Revantha Ramanayake (committee co-chair) IN MEMORIAM The award is dedicated to the memory of Helmut Veith, the brilliant computer scientist who tragically passed away in March 2016, and aims to carry on his commitment to promoting young talent and promising researchers in these areas. RECIPIENTS OF THE VCLA INTERNATIONAL STUDENT AWARDS <http://www.vcla.at/vcla-awards/> http://www.vcla.at/vcla-awards/ Please feel free to distribute as appropriate.

1 0