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

LATA 2020 & 2021: 3rd call for papers
by IRDTA 01 Oct '20

01 Oct '20

LATA 2020 & 2021: 3rd call for papers*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line* ******************************************************************************* 14th-15th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS LATA 2020 & 2021 Milan, Italy March 1-5, 2021 Co-organized by: Department of Informatics, Systems and Communication University of Milano-Bicocca and Institute for Research Development, Training and Advice Brussels/London https://irdta.eu/lata2020-2021/ ******************************************************************************* AIMS: LATA is a conference series on theoretical computer science and its applications. LATA 2020 & 2021 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from classical theory fields as well as application areas. LATA 2020 & 2021 will merge the scheduled program for LATA 2020, which could not take place because of the Covid-19 crisis, with a new series of papers submitted on this occasion. VENUE: LATA 2020 & 2021 will be held in Milan, the third largest economy among European cities and one of the Four Motors for Europe. The venue will be: University of Milano-Bicocca Viale Piero e Alberto Pirelli 22 Building U6 Aula Mario Martini (Aula U6-04) Milan SCOPE: Topics of either theoretical or applied interest include, but are not limited to: algebraic language theory algorithms for semi-structured data mining algorithms on automata and words automata and logic automata for system analysis and programme verification automata networks automatic structures codes combinatorics on words computational complexity concurrency and Petri nets data and image compression descriptional complexity foundations of finite state technology foundations of XML grammars (Chomsky hierarchy, contextual, unification, categorial, etc.) grammatical inference, inductive inference and algorithmic learning graphs and graph transformation language varieties and semigroups language-based cryptography mathematical and logical foundations of programming methodologies parallel and regulated rewriting parsing patterns power series string processing algorithms symbolic dynamics term rewriting transducers trees, tree languages and tree automata weighted automata STRUCTURE: LATA 2020 & 2021 will consist of: invited talks peer-reviewed contributions KEYNOTE SPEAKERS: Eric Allender (Rutgers University), The New Complexity Landscape around Circuit Minimization Laure Daviaud (City, University of London), About Decision Problems for Weighted Automata Christoph Haase (University College London), Approaching Arithmetic Theories with Finite-state Automata Artur Jeż (University of Wrocław), Recompression: Technique for Word Equations and Compressed Data Jean-Éric Pin (CNRS), How to Prove that a Language Is Regular or Star-free? Thomas Place (University of Bordeaux), Deciding Classes of Regular Languages: A Language Theoretic Point of View PROGRAMME COMMITTEE: Jorge Almeida (University of Porto, PT) Franz Baader (Technical University of Dresden, DE) Alessandro Barenghi (Polytechnic University of Milan, IT) Marie-Pierre Béal (University of Paris-Est, FR) Djamal Belazzougui (CERIST, DZ) Marcello Bonsangue (Leiden University, NL) Flavio Corradini (University of Camerino, IT) Bruno Courcelle (University of Bordeaux, FR) Laurent Doyen (ENS Paris-Saclay, FR) Manfred Droste (Leipzig University, DE) Rudolf Freund (Technical University of Vienna, AT) Paweł Gawrychowski (University of Wrocław, PL) Amélie Gheerbrant (Paris Diderot University, FR) Tero Harju (University of Turku, FI) Lane A. Hemaspaandra (University of Rochester, US) Jarkko Kari (University of Turku, FI) Dexter Kozen (Cornell University, US) Markus Lohrey (University of Siegen, DE) Parthasarathy Madhusudan (University of Illinois, Urbana-Champaign, US) Sebastian Maneth (University of Bremen, DE) Nicolas Markey (IRISA, Rennes, FR) Carlos Martín-Vide (Rovira i Virgili University, ES, chair) Giancarlo Mauri (University of Milano-Bicocca, IT) Victor Mitrana (University of Bucharest, RO) Paliath Narendran (University at Albany, US) Gennaro Parlato (University of Molise, IT) Dominique Perrin (University of Paris-Est, FR) Nir Piterman (Chalmers University of Technology, SE) Sanguthevar Rajasekaran (University of Connecticut, US) Antonio Restivo (University of Palermo, IT) Wojciech Rytter (University of Warsaw, PL) Kai Salomaa (Queen’s University, CA) Helmut Seidl (Technical University of Munich, DE) William F. Smyth (McMaster University, CA) Jiří Srba (Aalborg University, DK) Edward Stabler (University of California, Los Angeles, US) Benjamin Steinberg (City University of New York, US) Frank Stephan (National University of Singapore, SG) Jan van Leeuwen (Utrecht University, NL) Margus Veanes (Microsoft Research, US) Mikhail Volkov (Ural Federal University, RU) ORGANIZING COMMITTEE: Alberto Leporati (Milan, co-chair) Sara Morales (Brussels) Manuel Parra-Royón (Granada) Rafael Peñaloza Nyssen (Milan) Dana Shapira (Ariel) David Silva (London, co-chair) Bianca Truthe (Giessen) Claudio Zandron (Milan, co-chair) SUBMISSIONS: Authors are invited to submit non-anonymized papers in English presenting original and unpublished research. Papers should not exceed 12 single-spaced pages (all included) and should be prepared according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). If necessary, exceptionally authors are allowed to provide missing proofs in a clearly marked appendix. Upload submissions to: https://easychair.org/conferences/?conf=lata20202021 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of Information and Computation (Elsevier, 2019 JCR impact factor: 0.872) will be later published containing peer-reviewed substantially extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The registration form can be found at: https://irdta.eu/lata2020-2021/registration/ DEADLINES (all at 23:59 CET): Paper submission: October 19, 2020 Notification of paper acceptance or rejection: November 23, 2020 Final version of the paper for the LNCS proceedings: November 30, 2020 Early registration: November 30, 2020 Late registration: February 15, 2021 Submission to the journal special issue: June 5, 2021 QUESTIONS AND FURTHER INFORMATION: david (at) irdta.eu ACKNOWLEDGMENTS: Università degli Studi di Milano-Bicocca IRDTA – Institute for Research Development, Training and Advice, Brussels/London

1 0

Open positions for PhD students at RWTH Aachen
by Grädel, Erich 29 Sep '20

29 Sep '20

====================================================================== Various Open Positions for Research Assistants/Associates in the post-graduate program UnRAVeL “Uncertainty and Randomness in Algorithms, Verification and Logic” at RWTH Aachen University, Aachen, Germany https://www.unravel.rwth-aachen.de/ ====================================================================== Context. The RWTH Aachen University is looking for enthusiastic and highly qualified doctoral researchers. Various positions are available within the interdisciplinary Research Training Group (RTG) UnRAVeL founded by Deutsche Forschungsgemeinschaft (DFG). The key emphasis of an RTG is on the qualification of doctoral researchers with a focused research program and a structured training strategy. The RTG UnRAVeL aims to significantly advance probabilistic modelling and analysis for uncertainty by developing new theories, algorithms, and tool-supported verification techniques, and to apply them to core problems from security (e.g., probabilistic protocols), planning (robotics and railway engineering), and safety and performance analysis (railway systems). To tackle these research challenges, theoretical computer scientists from computer-aided verification, automata, logic and games, algorithms and complexity, together with experts from management science (robust optimization), applied computer science (robotics and security), and railway engineering intensively cooperate within the RTG UnRAVeL. Required profile. Candidates must have (or soon obtain) a master degree in Computer Science, Mathematics or related area and have completed their studies with excellent grades. You should have interest in performing original, highly competitive scientific research, publishing your results in top conferences and scientific journals. Self-motivation and the ability to work both independently and as a team player in local and international research groups are expected. Fluency in English is required; proficiency in German is helpful but not compulsory. How to apply? Your written application should contain: - a curriculum vitae - a transcript of records (list of courses and grades) - a cover letter including a statement of interest in (some of) the RTG topics (Algorithms and Complexity, Verification, Logic, or Application Scenarios) that can be found on our web-site, and - a recommendation letter e.g., by your master thesis supervisor(s). All documents should be formatted as a single pdf-file. You should send your application ultimately by ** October 30, 2020 (AoE) ** to the e-mail address: unravel-appl(a)cs.rwth-aachen.de<mailto:unravel-appl@cs.rwth-aachen.de>. We check applications once they are received, and will conduct interview until our vacancies are filled. What do we offer? We offer a stimulating international research environment, the possibility to participate in highly competitive and interdisciplinary research and the opportunity to involve students in your research through project work. Doctoral researchers have a status as employee with a salary according to the German federal employee scale TV-L E13; the exact salary is subject to your family situation. The duration of the positions is three years. RWTH Aachen University offers excellent facilities for professional and personal development. Starting date of the positions: January 1, 2021 and June 1, 2021. Enquiries can be directed to Prof. Joost-Pieter Katoen (e-mail: katoen(a)cs.rwth-aachen.de<mailto:katoen@cs.rwth-aachen.de>). RWTH Aachen University is certified as a “Family-Friendly University”. We particularly welcome and encourage applications from women, disabled persons and ethnic minority groups, recognizing they are underrepresented across RWTH Aachen University. The principles of fair and open competition apply and appointments will be made on merit.

1 0

LATA 2020 & 2021: 2nd call for papers
by IRDTA 14 Sep '20

14 Sep '20

LATA 2020 & 2021: 2nd call for papers*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line* ******************************************************************************* 14th-15th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS LATA 2020 & 2021 Milan, Italy March 1-5, 2021 Co-organized by: Department of Informatics, Systems and Communication University of Milano-Bicocca and Institute for Research Development, Training and Advice Brussels/London https://irdta.eu/lata2020-2021/ ******************************************************************************* AIMS: LATA is a conference series on theoretical computer science and its applications. LATA 2020 & 2021 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from classical theory fields as well as application areas. LATA 2020 & 2021 will merge the scheduled program for LATA 2020, which could not take place because of the Covid-19 crisis, with a new series of papers submitted on this occasion. VENUE: LATA 2020 & 2021 will be held in Milan, the third largest economy among European cities and one of the Four Motors for Europe. The venue will be: University of Milano-Bicocca Viale Piero e Alberto Pirelli 22 Building U6 Aula Mario Martini (Aula U6-04) Milan SCOPE: Topics of either theoretical or applied interest include, but are not limited to: algebraic language theory algorithms for semi-structured data mining algorithms on automata and words automata and logic automata for system analysis and programme verification automata networks automatic structures codes combinatorics on words computational complexity concurrency and Petri nets data and image compression descriptional complexity foundations of finite state technology foundations of XML grammars (Chomsky hierarchy, contextual, unification, categorial, etc.) grammatical inference, inductive inference and algorithmic learning graphs and graph transformation language varieties and semigroups language-based cryptography mathematical and logical foundations of programming methodologies parallel and regulated rewriting parsing patterns power series string processing algorithms symbolic dynamics term rewriting transducers trees, tree languages and tree automata weighted automata STRUCTURE: LATA 2020 & 2021 will consist of: invited talks peer-reviewed contributions KEYNOTE SPEAKERS: Eric Allender (Rutgers University), The New Complexity Landscape around Circuit Minimization Laure Daviaud (City, University of London), About Decision Problems for Weighted Automata Christoph Haase (University College London), Approaching Arithmetic Theories with Finite-state Automata Artur Jeż (University of Wrocław), Recompression: Technique for Word Equations and Compressed Data Jean-Éric Pin (CNRS), How to Prove that a Language Is Regular or Star-free? Thomas Place (University of Bordeaux), Deciding Classes of Regular Languages: A Language Theoretic Point of View PROGRAMME COMMITTEE: Jorge Almeida (University of Porto, PT) Franz Baader (Technical University of Dresden, DE) Alessandro Barenghi (Polytechnic University of Milan, IT) Marie-Pierre Béal (University of Paris-Est, FR) Djamal Belazzougui (CERIST, DZ) Marcello Bonsangue (Leiden University, NL) Flavio Corradini (University of Camerino, IT) Bruno Courcelle (University of Bordeaux, FR) Laurent Doyen (ENS Paris-Saclay, FR) Manfred Droste (Leipzig University, DE) Rudolf Freund (Technical University of Vienna, AT) Paweł Gawrychowski (University of Wrocław, PL) Amélie Gheerbrant (Paris Diderot University, FR) Tero Harju (University of Turku, FI) Lane A. Hemaspaandra (University of Rochester, US) Jarkko Kari (University of Turku, FI) Dexter Kozen (Cornell University, US) Markus Lohrey (University of Siegen, DE) Parthasarathy Madhusudan (University of Illinois, Urbana-Champaign, US) Sebastian Maneth (University of Bremen, DE) Nicolas Markey (IRISA, Rennes, FR) Carlos Martín-Vide (Rovira i Virgili University, ES, chair) Giancarlo Mauri (University of Milano-Bicocca, IT) Victor Mitrana (University of Bucharest, RO) Paliath Narendran (University at Albany, US) Gennaro Parlato (University of Molise, IT) Dominique Perrin (University of Paris-Est, FR) Nir Piterman (Chalmers University of Technology, SE) Sanguthevar Rajasekaran (University of Connecticut, US) Antonio Restivo (University of Palermo, IT) Wojciech Rytter (University of Warsaw, PL) Kai Salomaa (Queen’s University, CA) Helmut Seidl (Technical University of Munich, DE) William F. Smyth (McMaster University, CA) Jiří Srba (Aalborg University, DK) Edward Stabler (University of California, Los Angeles, US) Benjamin Steinberg (City University of New York, US) Frank Stephan (National University of Singapore, SG) Jan van Leeuwen (Utrecht University, NL) Margus Veanes (Microsoft Research, US) Mikhail Volkov (Ural Federal University, RU) ORGANIZING COMMITTEE: Alberto Leporati (Milan, co-chair) Sara Morales (Brussels) Manuel Parra-Royón (Granada) Rafael Peñaloza Nyssen (Milan) Dana Shapira (Ariel) David Silva (London, co-chair) Bianca Truthe (Giessen) Claudio Zandron (Milan, co-chair) SUBMISSIONS: Authors are invited to submit non-anonymized papers in English presenting original and unpublished research. Papers should not exceed 12 single-spaced pages (all included) and should be prepared according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). If necessary, exceptionally authors are allowed to provide missing proofs in a clearly marked appendix. Upload submissions to: https://easychair.org/conferences/?conf=lata20202021 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of Information and Computation (Elsevier, 2019 JCR impact factor: 0.872) will be later published containing peer-reviewed substantially extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The registration form can be found at: https://irdta.eu/lata2020-2021/registration/ DEADLINES (all at 23:59 CET): Paper submission: October 19, 2020 Notification of paper acceptance or rejection: November 23, 2020 Final version of the paper for the LNCS proceedings: November 30, 2020 Early registration: November 30, 2020 Late registration: February 15, 2021 Submission to the journal special issue: June 5, 2021 QUESTIONS AND FURTHER INFORMATION: david (at) irdta.eu ACKNOWLEDGMENTS: Università degli Studi di Milano-Bicocca IRDTA – Institute for Research Development, Training and Advice, Brussels/London

1 0

[fm-announcements] Certified Programs and Proofs (CPP) 2021: Final Call for Papers
by Munoz, Cesar (LARC-D320) via fm-announcements 27 Aug '20

27 Aug '20

--- To opt-out from this mailing list, send an email to fm-announcements-request(a)lists.nasa.gov with the word 'unsubscribe' as subject or in the body. You can also make the request by contacting fm-announcements-owner(a)lists.nasa.gov

1 0

Call for registration and participation: Highlights of Logic, Games, and Automata, Online, 15 - 18 Sept
by Nathanaël Fijalkow 26 Aug '20

26 Aug '20

HIGHLIGHTS 2020: 8th annual conference on Highlights of LOGIC, GAMES, and AUTOMATA 15-18 September 2020, Online http://highlights-conference.org The registration is open (and free)! http://highlights-conference.org/register/ ================================================ ONLINE PLATFORM The conference will be hosted on http://gather.town/ Each participant controls an avatar moving around a "town" designed for the conference (with lecture halls and such). Each Contributed presentation will be five minutes long (plus two minutes for questions). There are a couple of innovations to make this online experience as interactive as possible. More details will be given to registered participants. ================================================ HIGHLIGHTS 2020 is the 8th conference on Highlights of Logic, Games, and Automata that aims to integrate the diverse research community working in the areas of Logic and Finite Model Theory, Automata Theory, and Games for Logic and Verification. Individual papers are dispersed across many conferences, which makes them challenging to follow. Participating in the annual Highlights conference offers a wide picture of the latest research in the field and a chance to meet and interact with most of the members of the research community. The speakers are encouraged to present their best recent work at Highlights, whether already published elsewhere or not. The conference is short (from 15 to 18 September). The participation costs are modest (zero) and the location is easy to reach (your office). The programme is online: http://highlights-conference.org/#program TUTORIAL (September 15) Two tutorials of 3 hours each: + Laure Daviaud, Probabilistic Automata, + Uri Zwick, Algorithms for Turn-based Stochastic games. KEYNOTES + Michael Benedikt + Stéphane Demri + Mehryar Mohri + Anca Muscholl

1 0

Certified Programs and Proofs (CPP) 2021: Final Call for Papers
by Andrei Popescu 18 Aug '20

18 Aug '20

Certified Programs and Proofs (CPP) is an international conference on practical and theoretical topics in all areas that consider formal verification and certification as an essential paradigm for their work. CPP spans areas of computer science, mathematics, logic, and education. CPP 2021 (https://popl21.sigplan.org/home/CPP-2021) will be held on 18-19 January 2021 and will be co-located with POPL 2021. CPP 2021 is sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG. NEWS * CPP 2021 will feature Distinguished Paper Awards. * CPP 2021 will take place on January 18-19, 2021 as a virtual or hybrid physical-virtual meeting. This means that the authors will be able to present their papers online. The POPL and CPP organizers are monitoring the COVID-19 situation, and in September/October they will make an announcement on whether there will also be a physical meeting in Copenhagen; but irrespective of that decision, the online paper presentation option will be guaranteed. * The submission deadline is one month earlier than usual. IMPORTANT DATES * Abstract Deadline: 16 September 2020 at 23:59 AoE (UTC-12h) * Paper Submission Deadline: 22 September 2020 at 23:59 AoE (UTC-12h) * Notification: 24 November 2020 * Camera Ready Deadline: 15 December 2020 * Conference: 18-19 January 2021 Deadlines expire at the end of the day, anywhere on earth. Abstract and submission deadlines are strict and there will be no extensions. TOPICS OF INTEREST We welcome submissions in research areas related to formal certification of programs and proofs. The following is a non-exhaustive list of topics of interest to CPP: * certified or certifying programming, compilation, linking, OS kernels, runtime systems, security monitors, and hardware; * certified mathematical libraries and mathematical theorems; * proof assistants (e.g, ACL2, Agda, Coq, Dafny, F*, HOL4, HOL Light, Idris, Isabelle, Lean, Mizar, Nuprl, PVS, etc); * new languages and tools for certified programming; * program analysis, program verification, and program synthesis; * program logics, type systems, and semantics for certified code; * logics for certifying concurrent and distributed systems; * mechanized metatheory, formalized programming language semantics, and logical frameworks; * higher-order logics, dependent type theory, proof theory, logical systems, separation logics, and logics for security; * verification of correctness and security properties; * formally verified blockchains and smart contracts; * certificates for decision procedures, including linear algebra, polynomial systems, SAT, SMT, and unification in algebras of interest; * certificates for semi-decision procedures, including equality, first-order logic, and higher-order unification; * certificates for program termination; * formal models of computation; * mechanized (un)decidability and computational complexity proofs; * formally certified methods for induction and coinduction; * integration of interactive and automated provers; * logical foundations of proof assistants; * applications of AI and machine learning to formal certification; * user interfaces for proof assistants and theorem provers; * teaching mathematics and computer science with proof assistants. DISTINGUISHED PAPER AWARDS Around 10% of the accepted papers at CPP 2021 will be designated as Distinguished Papers. This award highlights papers that the CPP program committee thinks should be read by a broad audience due to their relevance, originality, significance and clarity. SUBMISSION GUIDELINES Prior to the paper submission deadline, the authors should upload their anonymized paper in PDF format through the HotCRP system at https://cpp2021.hotcrp.com The submissions must be written in English and provide sufficient detail to allow the program committee to assess the merits of the contribution. They must be formatted following the ACM SIGPLAN Proceedings format (http://www.sigplan.org/Resources/Author/) using the acmart style with the sigplan option, which provides a two-column style, using 10 point font for the main text, and a header for double blind review submission, i.e., \documentclass[sigplan,10pt,anonymous,review]{acmart}\settopmatter{printfolios=true,printccs=false,printacmref=false} The submitted papers should not exceed 12 pages, including tables and figures, but excluding bibliography and clearly marked appendices. The papers should be self-contained without the appendices. Shorter papers are welcome and will be given equal consideration. Submissions not conforming to the requirements concerning format and maximum length may be rejected without further consideration. CPP 2021 will employ a lightweight double-blind reviewing process. To facilitate this, the submissions must adhere to two rules: (1) author names and institutions must be omitted, and (2) references to authors' own related work should be in the third person (e.g., not "We build on our previous work ..." but rather “We build on the work of ..."). The purpose of this process is to help the PC and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing it more difficult. In particular, important background references should not be omitted or anonymized. In addition, authors are free to disseminate their ideas or draft versions of their papers as usual. For example, authors may post drafts of their papers on the web or give talks on their research ideas. POPL has answers to frequently asked questions addressing many common concerns: https://popl20.sigplan.org/track/POPL-2020-Research-Papers#Submission-and-R… We encourage the authors to provide any supplementary material that is required to support the claims made in the paper, such as proof scripts or experimental data. This material must be uploaded at submission time, as an archive, not via a URL. Two forms of supplementary material may be submitted: (1) Anonymous supplementary material is made available to the reviewers before they submit their first-draft reviews. (2) Non-anonymous supplementary material is made available to the reviewers after they have submitted their first-draft reviews and have learned the identity of the authors. Please use anonymous supplementary material whenever possible, so that it can be taken into account from the beginning of the reviewing process. The submitted papers must adhere to the SIGPLAN Republication Policy (https://www.sigplan.org/Resources/Policies/Republication/) and the ACM Policy on Plagiarism (https://www.acm.org/publications/policies/plagiarism). Concurrent submissions to other conferences, journals, workshops with proceedings, or similar forums of publication are not allowed. The PC chairs should be informed of closely related work submitted to a conference or journal in advance of submission. One author of each accepted paper is expected to present it at the (totally or partly virtual) conference. PUBLICATION, COPYRIGHT AND OPEN ACCESS The limit for the camera-ready version is 14 pages, excluding the bibliography (so 2 pages extra compared with the submission). The CPP proceedings will be published by the ACM, and authors of accepted papers will be required to choose one of the following publication options: (1) Author retains copyright of the work and grants ACM a non-exclusive permission-to-publish license and, optionally, licenses the work under a Creative Commons license. (2) Author retains copyright of the work and grants ACM an exclusive permission-to-publish license. (3) Author transfers copyright of the work to ACM. For authors who can afford it, we recommend option 1, which will make the paper Gold Open Access, and also encourage such authors to license their work under the CC-BY license. ACM will charge you an article processing fee for this option (currently, US$700), which you have to pay directly with the ACM. For everyone else, we recommend option (2), which is free and allows you to achieve Green Open Access, by uploading a preprint of your paper to a repository that guarantees permanent archival such as arXiv (https://arxiv.org) or HAL (https://hal.archives-ouvertes.fr). This is anyway a good idea for timely dissemination even if you chose option (1). Ensuring timely dissemination is particularly important for this edition, since, because of the very tight schedule, the official proceedings might not be available in time for CPP. The official CPP 2021 proceedings will also be available via SIGPLAN OpenTOC (http://www.sigplan.org/OpenTOC/#cpp). For ACM's take on this, see their Copyright Policy (http://www.acm.org/publications/policies/copyright-policy) and Author Rights (http://authors.acm.org/main.html). PROGRAM COMMITTEE Cătălin Hriţcu, MPI-SP, Germany (co-chair) Andrei Popescu, University of Sheffield, UK (co-chair) Reynald Affeldt, National Institute of Advanced Industrial Science and Technology (AIST), Japan June Andronick, CSIRO's Data61 and UNSW, Australia Arthur Azevedo de Amorim, Carnegie Mellon University, USA Joachim Breitner, DFINITY Foundation, Germany Jesper Cockx, TU Delft, Netherlands Cyril Cohen, Université Côte d’Azur, Inria, France Nils Anders Danielsson, University of Gothenburg / Chalmers University of Technology, Sweden Brijesh Dongol, University of Surrey, UK Floris van Doorn, University of Pittsburgh, USA Yannick Forster, Saarland University, Germany Shilpi Goel, Centaur Technology, Inc., USA Chung-Kil Hur, Seoul National University, South Korea Moa Johansson, Chalmers University of Technology, Sweden Ekaterina Komendantskaya, Heriot-Watt University, UK Angeliki Koutsoukou-Argyraki, University of Cambridge, UK Robert Y. Lewis, Vrije Universiteit Amsterdam, Netherlands Hongjin Liang, Nanjing University, China Andreas Lochbihler, Digital Asset GmbH, Switzerland Petar Maksimović, Imperial College London, UK William Mansky, University of Illinois at Chicago, USA Anders Mörtberg, Stockholm University, Sweden Sam Owre, SRI International, USA Karl Palmskog, KTH Royal Institute of Technology, Sweden Johannes Åman Pohjola, CSIRO's Data61 / University of New South Wales, Australia Damien Pous, CNRS, ENS Lyon, France Tahina Ramananandro, Microsoft Research, USA Ilya Sergey, Yale-NUS College and National University of Singapore, Singapore Natarajan Shankar, SRI International, USA Kathrin Stark, Princeton University, USA René Thiemann, University of Innsbruck, Austria Amin Timany, Aarhus University, Denmark Josef Urban, Czech Technical University in Prague, Czech Republic Christoph Weidenbach, MPI-INF, Germany Freek Wiedijk, Radboud University Nijmegen, Netherlands Yannick Zakowski, University of Pennsylvania, USA CONTACT For any questions please contact the two PC chairs: Catalin Hritcu <catalin.hritcu(a)gmail.com>, Andrei Popescu <andrei.h.popescu(a)gmail.com>

1 0

LATA 2020 & 2021: 1st call for papers
by IRDTA 04 Aug '20

04 Aug '20

LATA 2020 & 2021: 1st call for papers*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line* ************************************************************************* 14th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS LATA 2020 & 2021 Milan, Italy March 1-5, 2021 Co-organized by: Department of Informatics, Systems and Communication University of Milano-Bicocca and Institute for Research Development, Training and Advice Brussels/London https://irdta.eu/lata2020-2021/ ************************************************************************* AIMS: LATA is a conference series on theoretical computer science and its applications. LATA 2020 & 2021 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from classical theory fields as well as application areas. LATA 2020 & 2021 will merge the scheduled program for LATA 2020, which could not take place because of the Covid-19 crisis, with a new series of papers submitted on this occasion. VENUE: LATA 2020 & 2021 will be held in Milan, the third largest economy among European cities and one of the Four Motors for Europe. The venue will be: University of Milano-Bicocca Viale Piero e Alberto Pirelli 22 Building U6 Aula Mario Martini (Aula U6-04) Milan SCOPE: Topics of either theoretical or applied interest include, but are not limited to: algebraic language theory algorithms for semi-structured data mining algorithms on automata and words automata and logic automata for system analysis and programme verification automata networks automatic structures codes combinatorics on words computational complexity concurrency and Petri nets data and image compression descriptional complexity foundations of finite state technology foundations of XML grammars (Chomsky hierarchy, contextual, unification, categorial, etc.) grammatical inference, inductive inference and algorithmic learning graphs and graph transformation language varieties and semigroups language-based cryptography mathematical and logical foundations of programming methodologies parallel and regulated rewriting parsing patterns power series string processing algorithms symbolic dynamics term rewriting transducers trees, tree languages and tree automata weighted automata STRUCTURE: LATA 2020 & 2021 will consist of: invited talks peer-reviewed contributions KEYNOTE SPEAKERS: Eric Allender (Rutgers University), The New Complexity Landscape around Circuit Minimization Laure Daviaud (City, University of London), About Decision Problems for Weighted Automata Christoph Haase (University College London), Approaching Arithmetic Theories with Finite-state Automata Artur Jeż (University of Wrocław), Recompression: Technique for Word Equations and Compressed Data Jean-Éric Pin (CNRS), How to Prove that a Language Is Regular or Star-free? Thomas Place (University of Bordeaux), Deciding Classes of Regular Languages: A Language Theoretic Point of View PROGRAMME COMMITTEE: Jorge Almeida (University of Porto, PT) Franz Baader (Technical University of Dresden, DE) Alessandro Barenghi (Polytechnic University of Milan, IT) Marie-Pierre Béal (University of Paris-Est, FR) Djamal Belazzougui (CERIST, DZ) Marcello Bonsangue (Leiden University, NL) Flavio Corradini (University of Camerino, IT) Bruno Courcelle (University of Bordeaux, FR) Laurent Doyen (ENS Paris-Saclay, FR) Manfred Droste (Leipzig University, DE) Rudolf Freund (Technical University of Vienna, AT) Paweł Gawrychowski (University of Wrocław, PL) Amélie Gheerbrant (Paris Diderot University, FR) Tero Harju (University of Turku, FI) Lane A. Hemaspaandra (University of Rochester, US) Jarkko Kari (University of Turku, FI) Dexter Kozen (Cornell University, US) Markus Lohrey (University of Siegen, DE) Parthasarathy Madhusudan (University of Illinois, Urbana-Champaign, US) Sebastian Maneth (University of Bremen, DE) Nicolas Markey (IRISA, Rennes, FR) Carlos Martín-Vide (Rovira i Virgili University, ES, chair) Giancarlo Mauri (University of Milano-Bicocca, IT) Victor Mitrana (University of Bucharest, RO) Paliath Narendran (University at Albany, US) Gennaro Parlato (University of Molise, IT) Dominique Perrin (University of Paris-Est, FR) Nir Piterman (Chalmers University of Technology, SE) Sanguthevar Rajasekaran (University of Connecticut, US) Antonio Restivo (University of Palermo, IT) Wojciech Rytter (University of Warsaw, PL) Kai Salomaa (Queen’s University, CA) Helmut Seidl (Technical University of Munich, DE) William F. Smyth (McMaster University, CA) Jiří Srba (Aalborg University, DK) Edward Stabler (University of California, Los Angeles, US) Benjamin Steinberg (City University of New York, US) Frank Stephan (National University of Singapore, SG) Jan van Leeuwen (Utrecht University, NL) Margus Veanes (Microsoft Research, US) Mikhail Volkov (Ural Federal University, RU) ORGANIZING COMMITTEE: Alberto Leporati (Milan, co-chair) Sara Morales (Brussels) Manuel Parra-Royón (Granada) Rafael Peñaloza Nyssen (Milan) Dana Shapira (Ariel) David Silva (London, co-chair) Bianca Truthe (Giessen) Claudio Zandron (Milan, co-chair) SUBMISSIONS: Authors are invited to submit non-anonymized papers in English presenting original and unpublished research. Papers should not exceed 12 single-spaced pages (all included) and should be prepared according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). If necessary, exceptionally authors are allowed to provide missing proofs in a clearly marked appendix. Upload submissions to: https://easychair.org/conferences/?conf=lata20202021 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of Information and Computation (Elsevier, 2019 JCR impact factor: 0.872) will be later published containing peer-reviewed substantially extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The registration form can be found at: https://irdta.eu/lata2020-2021/registration/ DEADLINES (all at 23:59 CET): Paper submission: October 19, 2020 Notification of paper acceptance or rejection: November 23, 2020 Final version of the paper for the LNCS proceedings: November 30, 2020 Early registration: November 30, 2020 Late registration: February 15, 2021 Submission to the journal special issue: June 5, 2021 QUESTIONS AND FURTHER INFORMATION: david (at) irdta.eu ACKNOWLEDGMENTS: Università degli Studi di Milano-Bicocca IRDTA – Institute for Research Development, Training and Advice, Brussels/London

1 0

PhD position(s) in Structural and Algorithmic Aspects of Preference-based Problems in Social Choice - Vienna, Austria - Deadline: July 31, 2020
by Mihaela Rozman 22 Jul '20

22 Jul '20

PhD POSITION(S) PROJECT Structural and Algorithmic Aspects of Preference-based Problems in Social Choice STARTING DATE: Negotiable LOCATION: Vienna, Austria INSTITUTION: Algorithms and complexity group at the Faculty of Informatics, Technische Universität Wien (Vienna University of Technology) FUNDING: The PhD candidates receive an employment contract for the initial period of 3 years, thus study fees do not apply. Salary range starts at 22.000 net/year EUR for 30h/week. APPLICATION DEADLINE: July 31, 2020 ========================================================== We invite applications for PhD position(s) (3 years with the possibility of extension), working with Jiehua Chen in the Algorithms and Complexity Group at the Vienna University of Technology (Technische Universität Wien – TU Wien), Vienna, Austria. The PhD position(s) is available for the WWTF research project (Vienna Science and Technology Fund) titled Structural and Algorithmic Aspects of Preference-based Problems in Social Choice: https://www.wwtf.at/programmes/vienna_research_groups/VRG18-012/index.php?l… The research topics include voting, structured preferences, stable matching (matchings under preferences) with a focus on parameterized and approximation algorithm design. =============================== YOUR PROFILE =============================== Applicants with a solid background in areas such as algorithm design (including BUT NOT LIMITED to parameterized algorithms and approximation algorithms), computational complexity, and/or discrete mathematics are welcome to apply. =============================== WE OFFER =============================== -The PhD position(s) entails an employment contract. -The position(s) is available immediately and the starting date is quite flexible - A research and study environment that is friendly and gender-balanced - TU Wien is a great place for professional growth (e.g., the Austrian Science Fund and other funding agencies offer multiple funding opportunities for young researchers to advance their independent scientific careers) - Vienna, the city, features a vibrant and excellence-driven research landscape, with several leading research institutes (e.g., University of Vienna, IST, AIT, SBA) and universities continuously establishing collaborations in various fields - Vienna has been consistently ranked by Mercer over the last years the best city for quality of life worldwide. =============================== APPLICATION =============================== Please send your application, including - your academic CV, - a motivation letter, including an explanation of your research interests, - your Master's thesis and - a list of subjects studied, giving sufficient details and grades/marks obtained directly to Jiehua Chen: jiehua.chen(a)tuwien.ac.at <mailto:jiehua.chen@tuwien.ac.at> (If possible all in a single PDF file) DEADLINE: 31. July 2020 For informal inquiries you can also contact via the above email address. =============================== ADDITIONAL INFORMATION =============================== Faculty of Informatics: https://informatics.tuwien.ac.at/ Research group website: https://www.ac.tuwien.ac.at/ Outreach: www.vcla.at <http://www.vcla.at> Twitter: @vclaTUwien

1 0

FTfJP 2020 (virtual) - Call for Participation - 23.07.2020
by Oortwijn Wytse 16 Jul '20

16 Jul '20

# CALL FOR PARTICIPATION 22th Workshop on Formal Techniques for Java-like Programs, FTfJP 2020 https://2020.ecoop.org/track/FTfJP-2020-papers Virtual event, to be held using Zoom, on Thursday, 23 July 2020, from 10:00 to 17:30 (GMT+2 Amsterdam time). Participation is free. For more details please see the webpage linked above. ## INVITED SPEAKERS * Frank de Boer and Hans-Dieter Hiep (CWI, the Netherlands): History-based Specification and Verification of Java Collections in KeY * Sung-Shik Jongmans (Open University, CWI; the Netherlands): Discourje: Runtime Verification of Communication Protocols in Clojure ## INVITED TUTORIAL * Alexander Summers (University of British Columbia, Canada): Prusti – Deductive Verification for Rust ## PROGRAM The program of (virtual) FTfJP 2020, July 23th, is as follows. All times are in GMT+2 Amsterdam time. Session One * 10:00 - 11:00: History-based Specification and Verification of Java Collections in KeY (invited talk) (Frank de Boer and Hans-Dieter Hiep) * 11:00 - 11:30: Dalarna: A Simplistic Capability-Based Dynamic Language Design For Data Race Freedom (Kiko Fernandez-Reyes, James Noble, Isaac Oscar Gariano, Erin Greenwood-Thessman, Michael Homer and Tobias Wrigstad) * 11:30 - 11:50: ConSysT: Tunable, Safe Consistency meets Object-Oriented Programming (Mirko Köhler, Nafise Eskandani Masoule, Alessandro Margara and Guido Salvaneschi) -- lunch break -- Session Two * 13:15 - 13:45: Salsa: Static Analysis of Serialization Features (Joanna Cecilia da Silva Santos, Reese Jones and Mehdi Mirakhorli) * 13:45 - 14:05: Towards Verified Construction of Correct and Optimised GPU Software (Marieke Huisman and Anton Wijs) * 14:05 - 14:35: An inductive abstract semantics for coFJ (Pietro Barbieri, Francesco Dagnino and Elena Zucca) * 14:35 - 15:05: A Separation Logic to Verify Termination of Busy-Waiting for Abrupt Program Exit (Tobias Reinhard, Amin Timany and Bart Jacobs) -- break -- Session Three * 15:30 - 16:30: Prusti – Deductive Verification for Rust (invited tutorial) (Alexander Summers) * 16:30 - 17:30: Discourje: Runtime Verification of Communication Protocols in Clojure (invited talk) (Sung-Shik Jongmans) ## ABOUT FTfJP 2020 Formal techniques can help analyse programs, precisely describe program behaviour, and verify program properties. Modern programming languages are interesting targets for formal techniques due to their ubiquity and wide user base, stable and well-defined interfaces and platforms, and powerful (but also complex) libraries. New languages and applications in this space are continually arising, resulting in new programming languages (PL) research challenges. Work on formal techniques and tools and on the formal underpinnings of programming languages themselves naturally complement each other. FTfJP is an established workshop which has run annually since 1999 alongside ECOOP, with the goal of bringing together people working in both fields. The workshop has a broad PL theme; the most important criterion is that submissions will generate interesting discussions within this community. The term “Java-like” is somewhat historic and should be interpreted broadly: FTfJP solicits and welcomes submission relating to programming languages in general, beyond Java, C#, Scala, etc.

1 0

2020 ALONZO CHURCH AWARD ANNOUNCEMENT
by Andrzej Murawski 15 Jul '20

15 Jul '20

2020 ALONZO CHURCH AWARD ANNOUNCEMENT The ACM Special Interest Group on Logic (SIGLOG), the European Association for Theoretical Computer Science (EATCS), the European Association for Computer Science Logic (EACSL), and the Kurt Gödel Society (KGS) are pleased to announce that Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, Lucian Popa, and Wang Chiew Tan have been selected as the winners of the 2020 Alonzo Church Award for Outstanding Contributions to Logic and Computation. The award recognizes their ground-breaking work on laying the logical foundations for data exchange, described in the following papers: (1) Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Renée J. Miller. Data exchange: Semantics and Query Answering, Proceedings of the 9th International Conference on Database Theory (ICDT 2003), pp. 207-223, 2003. Full journal version: Theoretical Computer Science, Vol. 336, No. 1, pp. 89-124, 2005. (2) Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan. Composing Schema Mappings: Second-Order Dependencies to the Rescue, Proceedings of the 23rd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2004), pp. 83-94, 2004. Full journal version: ACM Transactions on Database Systems, Vol. 30, No. 4, pp. 994-1055, 2005. Data exchange is the problem of transforming data structured under a schema, called the source schema, into data conforming to a different schema, called the target schema. The results and techniques developed have in addition to gaining theoretical insights influenced the development of industrial and academic tools. The 2020 Church Award was selected by a panel consisting of Mariangiola Dezani, Thomas Eiter (chair), Javier Esparza, Radha Jagadeesan and Natarajan Shankar. THE CONTRIBUTION Data exchange is an old and ubiquitous problem in data management that was described by Philip Bernstein as the "oldest problem in databases". Early work on data exchange used low-level, ad hoc programs to transform data from the source schema to the target schema, which resulted into inefficiencies and limited reusability. Publications (1) and (2) laid the logical foundations for data exchange and became the catalyst for the development of data exchange as a research area in its own right. Publication (1) is about logic in computer science: a fragment of first-order logic, called source-to-target tuple-generating dependencies (in short, s-t tgds), is systematically used as a specification language in data exchange. The algorithmic and structural properties of s-t tgds are explored, and the concept of a universal solution is introduced as the preferred way to carry out the data exchange task. Publication (2) is about logic from computer science: first, it is shown that the language of s-t tgds is not closed under composition; second, a new fragment of second-order logic, called second-order tuple-generating dependencies (in short, SO tgds) is identified and shown to be the “right" logic-based specification language for composing s-t tgds. The award publications are well-cited and have been recognized with two test-of-time awards.

1 0