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

LICS 2020 Call for Papers
by Sam Staton 11 Oct '19

11 Oct '19

CALL FOR PAPERS Thirty-Fifth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS) 8–12 July 2020, Beijing https://lics.siglog.org/lics20/ NOTICE: LICS 2020 will use a double-blind reviewing process. See below for details. SCOPE LICS 2020 will be hosted in Beijing in the period 8–12 July 2020, in co-location with ICALP 2020. The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed. We invite submissions on topics that fit under that rubric. Suggested, but not exclusive, topics of interest include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, games and logic, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security and privacy, rewriting, type systems and type theory, and verification. IMPORTANT DATES Authors are required to submit a paper title and a short abstract of about 100 words in advance of submitting the extended abstract of the paper. The exact deadline time on these dates is given by anywhere on earth (AoE). Titles and Short Abstracts Due: 6 January 2020 Full Papers Due: 10 January 2020 Author Feedback/Rebuttal Period: 16–20 March 2020 Author Notification: 10 April 2020 Deadlines are firm; late submissions will not be considered. All submissions will be electronic via https://www.easychair.org/conferences/?conf=lics2020. SUBMISSION INSTRUCTIONS Every full paper must be submitted in the ACM SIGPLAN Proceedings 2-column 10pt format and may be at most 12 pages, excluding references. The LaTeX style files are available from http://www.sigplan.org/Resources/Author/. The extended abstract must be in English and provide sufficient detail to allow the program committee to assess the merits of the paper. It should begin with a succinct statement of the issues, a summary of the main results, and a brief explanation of their significance and relevance to the conference and to computer science, all phrased for the non-specialist. Technical development directed to the specialist should follow. References and comparisons with related work must be included. (If necessary, detailed proofs of technical results may be included in a clearly-labeled appendix, to be consulted at the discretion of program committee members.) Submissions not conforming to the above requirements will be rejected without further consideration. Paper selection will be merit-based, with no a priori limit on the number of accepted papers. Papers authored or co-authored by members of the program committee are not allowed. Results must be unpublished and not submitted for publication elsewhere, including the proceedings of other symposia or workshops. The program chair must be informed, in advance of submission, of any closely related work submitted or about to be submitted to a conference or journal. Authors of accepted papers are expected to sign copyright release forms. One author of each accepted paper is expected to present it at the conference. LICS 2020 will use a lightweight double-blind reviewing process. Following this process means that reviewers will not see the authors' names or affiliations as they initially review a paper. The authors' names will then be revealed to the reviewers only once their reviews have been submitted. To facilitate this process, submitted papers must adhere to the following: Author names and institutions must be omitted and References to the 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 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, makes the job of reviewing the paper more difficult, or interferes with the process of disseminating new ideas. For example, important background references should not be omitted or anonymized, even if they are written by the same authors and share common ideas, techniques, or infrastructure. Authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas. KLEENE AWARD FOR BEST STUDENT PAPER An award in honour of the late Stephen C. Kleene will be given for the best student paper(s), as judged by the program committee. SPECIAL ISSUES Full versions of up to three accepted papers, to be selected by the program committee, will be invited for submission to the Journal of the ACM. Additional selected papers will be invited to a special issue of Logical Methods in Computer Science.

1 0

27th WoLLIC 2020 (Lima, Peru) - 1st Call for Papers
by Ruy de Queiroz 09 Oct '19

09 Oct '19

[Please circulate. Apologies for multiple copies.] CALL FOR PAPERS WoLLIC 2020 27th Workshop on Logic, Language, Information and Computation August 4th to 7th, 2020 Lima, Peru ORGANISATION Universidad de Ingenieria y Tecnologia, Lima, Peru 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-seventh WoLLIC will be held at Universidad de Ingenieria y Tecnologia, Lima, Peru from August 4th to 7th, 2020. It is scientifically 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), 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). 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 2020 EasyChair website. (Please go to http://wollic.org/wollic2020/instructions.html for instructions.) PROCEEDINGS The proceedings of WoLLIC 2020, 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 2020 issue of a scientific journal (to be confirmed). INVITED SPEAKERS (tba) STUDENT GRANTS ASL sponsorship of WoLLIC 2020 will permit ASL student members to apply for a limited travel grant (deadline: 90 days before the event starts). Visit https://aslonline.org/meetings/student-travel-awards/ for details. IMPORTANT DATES April 15, 2020: Full paper deadline May 23, 2020: Author notification May 30, 2019: Final version deadline (firm) PROGRAMME COMMITTEE Carlos Areces (Cordoba, Argentina) Arthur Amorim Azevedo (CMU, USA) Paul Brunet (UCL, UK) Nina Gierasimczuk (Technical University of Denmark, Denmark) Helle Hansen (TU Delft, The Netherlands) Justin Hsu (University of Wisconsin–Madison, USA) Fairouz Kamareddine (Heriot-Watt University, UK) Sandra Kiefer (Aachen University, Germany) Clemens Kupke (Strathclyde University, Scotland) Konstantinos Mamouras (Rice University, USA) Maria Vanina Martinez (Universidad de Buenos Aires, Argentina) Larry Moss (Indiana Univ, USA) Claudia Nalon (University of Brasília, Brazil) Valeria de Paiva (Samsung Research, USA) Elaine Pimentel (UFRN, Brazil) Revantha Ramanayake (TU Wien, Austria) Jurriaan Rot (Radboud University, The Netherlands) Yamilet Serrano (UTEC, Peru) Alexandra Silva (Univ College London) (Co-Chair) Christine Tasson (IRIF, France) Sebastiaan Terwijn (Radboud University, The Netherlands) Renata Wassermann (Univ São Paulo) (Co-Chair) STEERING COMMITTEE Samson Abramsky, Anuj Dawar, Juliette Kennedy, Ulrich Kohlenbach, Daniel Leivant, Leonid Libkin, Lawrence Moss, Luke Ong, Valeria de Paiva, Ruy de Queiroz. ADVISORY COMMITTEE Johan van Benthem, Joe Halpern, Wilfrid Hodges, Angus Macintyre, Hiroakira Ono, Jouko Väänänen. ORGANISING COMMITTEE Ernesto Quadro-Vargas (Universidad de Ingenieria y Tecnologia, Lima, Peru) (Local 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) ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC) Sociedade Brasileira de Computação (SBC) Sociedade Brasileira de Lógica (SBL) SPECIAL SESSION: SCREENING OF MOVIES ABOUT MATHEMATICIANS It is planned to have a special session with the exhibition of a one-hour documentary film about a remarkable mathematician whose contributions were recognized with a Fields Medal just a few years before her untimely death. It is a joint production (still on its course) of The Mathematical Sciences Research Institute (MSRI) and George Csicsery (Zala Films): ‘Secrets of the Surface - The Mathematical Vision of Maryam Mirzakhani’. “The biographical film is about Maryam Mirzakhani, a brilliant woman, and Muslim immigrant to the United States who became a superstar in her field. The story of her life will be complemented with sections about Mirzakhani’s mathematical contributions, as explained by colleagues and illustrated with animated sequences. Throughout, we will look for clues about the sources of Mirzakhani’s insights and creativity." (http://www.zalafilms.com/secrets/) FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee. WEB PAGE http://wollic.org/wollic2020/

1 0

Deadline extension and final CFP
by Michael Winter 07 Oct '19

07 Oct '19

DEADLINE EXTENSION AND FINAL CALL FOR PAPERS 18th International Conference on Relational and Algebraic Methods in Computer Science RAMiCS 2020 08. April to 11. April 2020, Palaiseau, France URL: http://ramics18.gforge.inria.fr/ Please see the new deadline for submission of papers below. IMPORTANT DATES: Abstract Submission: 20. October 2019 Paper Submission: 27. October 2019 Author Notification: 15. December 2019 Final Version: 16. January 2020 RAMiCS 2020: 08. April to 11. April 2020 INVITED TALKS: Christel Baier, Technische Universitaet Dresden, Germany Manfred Droste, Universitaet Leipzig, Germany Daniela Petrisan, Universite Paris Diderot, France GENERAL INFORMATION: Since 1994, the RAMiCS conference series has been the main venue for research on relation algebras, Kleene algebras and similar algebraic formalisms, and their applications as conceptual and methodological tools in computer science and beyond. TOPICS: We invite submissions in the general fields of algebras relevant to computer science and applications of such algebras. Topics include but are not limited to: * Theory - algebras such as semigroups, residuated lattices, semirings, Kleene algebras, relation algebras and quantales - their connections with program logics and other logics - their use in the theories of automata, concurrency, formal languages, games, networks and programming languages - the development of algebraic, algorithmic, category-theoretic, coalgebraic and proof-theoretic methods for these theories - their formalisation with theorem provers * Applications - tools and techniques for program correctness, specification and verification - quantitative and qualitative models and semantics of computing systems and processes - algorithm design, automated reasoning, network protocol analysis, social choice, optimisation and control - industrial applications WATA 2020 WATA 2020, the 10th International Workshop on Weighted Automata: Theory and Applications, will take place just after RAMICS, from 14 to 17 April, in Marseille. We encourage participants to combine the two events. SUBMISSION INSTRUCTIONS: Submission is via EasyChair at https://www.easychair.org/conferences/?conf=ramics2020 All papers will be peer-reviewed by at least three referees. The proceedings will be published in an LNCS volume by Springer, ready at the conference. Submissions must not be published or under review for publication elsewhere. Submissions must be in English using a PDF not exceeding 16 pages in LNCS style. Submissions must provide sufficient information to judge their merits. Additional material may be provided in a clearly marked appendix or by a reference to a manuscript on a web site. Experimental data, software or mathematical components for theorem provers must be available in sufficient detail for referees. Deviation from these requirements may lead to rejection. One author of each accepted paper is expected to present the paper at the conference. Accepted papers must be produced with LaTeX. Formatting instructions and LNCS style files are available at http://www.springer.de/comp/lncs/authors.html As for earlier RAMiCS conferences, we intend to publish a journal special issue with revised and extended versions of a selection of the best papers. COMMITTEES: Organising Committee -------------------- Conf. & PC Co-Chair: Peter Jipsen, Chapman University, USA Conf. & PC Co-Chair: Uli Fahrenberg, École polytechnique, France Conf. & PC Co-Chair: Michael Winter, Brock University, Canada Programme Committee ------------------- Roland Backhouse University of Nottingham, UK Rudolf Berghammer Kiel University, Germany Manuel Bodirsky TU Dresden, Germany Jules Desharnais Laval University, Canada Amina Doumane PPS, France Uli Fahrenberg École polytechnique, France Hitoshi Furusawa Kagoshima University, Japan Mai Gehrke LIAFA, France Walter Guttmann University of Canterbury, New Zealand Robin Hirsch University College London, UK Peter Höfner CSIRO, Australia Marcel Jackson La Trobe University, Australia Jean-Baptiste Jeannin University of Michigan, USA Peter Jipsen Chapman University, USA Stef Joosten Open Universiteit, Netherlands Wolfram Kahl McMaster University, Canada Dexter Kozen Cornell University, USA Tadeusz Litak FAU Erlangen-Nürnberg, Germany Wendy MacCaull St. Francis Xavier University, Canada Roger Maddux Iowa State University, USA Annabelle McIver Macquarie University, Australia Szabolcs Mikulas University of London, UK Ali Mili NJIT, USA Jose Oliveira University of Minho, Portugal Alessandra Palmigiano Technical University of Delft, Netherlands Damien Pous CNRS - ENS Lyon, France Mehrnoosh Sadrzadeh University College London, UK Luigi Santocanale LIS, Aix-Marseille Université, France John Stell University of Leeds, UK Georg Struth University of Sheffield, UK Michael Winter Brock University, Canada

1 0

LATA 2020: 3rd call for papers
by IRDTA 05 Oct '19

05 Oct '19

LATA 2020: 3rd 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 Milan, Italy March 2-6, 2020 Co-organized by: Department of Informatics, Systems and Communication University of Milano-Bicocca and Institute for Research Development, Training and Advice Brussels/London https://lata2020.irdta.eu ************************************************************************* AIMS: LATA is a conference series on theoretical computer science and its applications. LATA 2020 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. VENUE: LATA 2020 will take place 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 will consist of: invited talks peer-reviewed contributions INVITED SPEAKERS: Eric Allender (Rutgers University), The New Complexity Landscape around Circuit Minimization 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) 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) Tero Harju (University of Turku, FI) Jeffrey Heinz (Stony Brook University, US) Lane A. Hemaspaandra (University of Rochester, US) Marcin Jurdziński (University of Warwick, UK) Juhani Karhumäki (University of Turku, FI) Jarkko Kari (University of Turku, FI) Dexter Kozen (Cornell University, US) François Le Gall (Kyoto University, JP) 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) Tomáš Vojnar (Brno University of Technology, CZ) Mikhail Volkov (Ural Federal University, RU) James Worrell (University of Oxford, UK) 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. Submissions have to be uploaded to: https://easychair.org/conferences/?conf=lata2020 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 the journal Information and Computation (Elsevier, 2018 JCR impact factor: 1.077) 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://lata2020.irdta.eu/registration DEADLINES (all at 23:59 CET): Paper submission: October 18, 2019 Notification of paper acceptance or rejection: November 25, 2019 Final version of the paper for the LNCS proceedings: December 2, 2019 Early registration: December 2, 2019 Late registration: February 17, 2020 Submission to the journal special issue: June 6, 2020 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

post-doc positions in Oxford and Cambridge
by Anuj Dawar 04 Oct '19

04 Oct '19

Two three-year post-doc positions in Semantics and Descriptive Complexity at Oxford and Cambridge. There are two post-doctoral research positions open, one at Oxford and one at Cambridge, to work on a new EPSRC-funded project on "Resources and co-Resources: A junction between semantics and descriptive complexity" which is jointly led by Prof. Samson Abramsky FRS at Oxford, and Prof. Anuj Dawar at the University of Cambridge. The positions are available to start as soon as possible, and are funded for 36 months. The project seeks to explore ways in which methods from the study of logic and algorithms (specifically finite model theory and descriptive complexity) can be combined with methods from semantics (such as category theory) to build a cohesive algebraic theory of resources. This builds on recent work obtaining categorical accounts of essential constructions in finite model theory (by Abramsky, Dawar and Wang and Abramsky and Shah), as well as categorical accounts of quantum resources (by Abramsky, Barbosa, de Silva and Zapata). This work made essential use of monads -- seen as encapsulating quantum and other resources -- and of comonads, which encapsulate “coresources”, i.e. ways of limiting access to a structure corresponding to definability in various logics. The project will seek to apply these new tools to major results in descriptive complexity, to expand them to cover other important constructions, to find ways of combining accounts of quantum resources and logical co-resources, and to build a general theory of these. There are separate application processes for applying for the two positions. Details of these and further information may be found at these webpages: http://www.cs.ox.ac.uk/news/1735-full.html http://www.jobs.cam.ac.uk/job/23436/ For further questions or enquiries, contact samson.abramsky(a)cs.ox.ac.uk or anuj.dawar(a)cl.cam.ac.uk

1 0

FSCD 2020 - First CFP
by Sandra Alves 03 Oct '19

03 Oct '19

(Apologies for multiple copies of this announcement. Please circulate.) ------------ CALL FOR PAPERS Fifth International Conference on Formal Structures for Computation and Deduction (FSCD 2020) June 29 – July 5, 2020, Paris, France http://fscd2020.org/ IMPORTANT DATES --------------- All deadlines are midnight anywhere-on-earth (AoE); late submissions will not be considered. Abstract: February 6, 2020 Submission: February 9, 2020 Rebuttal: March 27-29, 2020 Notification: April 13, 2020 Final version: April 27, 2020 FSCD (http://fscdconference.org/ ) covers all aspects of formal structures for computation and deduction from theoretical foundations to applications. Building on two communities, RTA (Rewriting Techniques and Applications) and TLCA (Typed Lambda Calculi and Applications), FSCD embraces their core topics and broadens their scope to closely related areas in logics, models of computation, semantics and verification in new challenging areas. The suggested, but not exclusive, list of topics for submission is: 1. Calculi: Rewriting systems (string, term, higher-order, graph, conditional, modulo, infinitary, etc.); Lambda calculus; Logics (first-order, higher-order, equational, modal, linear, classical, constructive, etc.); Proof theory (natural deduction, sequent calculus, proof nets, etc.); Type theory and logical frameworks; Homotopy type theory; Quantum calculi. 2. Methods in Computation and Deduction: Type systems (polymorphism, dependent, recursive, intersection, session, etc.); Induction, coinduction; Matching, unification, completion, orderings; Strategies (normalization, completeness, etc.); Tree automata; Model building and model checking; Proof search and theorem proving; Constraint solving and decision procedures. 3. Semantics: Operational semantics and abstract machines; Game Semantics and applications; Domain theory and categorical models; Quantitative models (timing, probabilities, etc.); Quantum computation and emerging models in computation. 4. Algorithmic Analysis and Transformations of Formal Systems: Type Inference and type checking; Abstract Interpretation; Complexity analysis and implicit computational complexity; Checking termination, confluence, derivational complexity and related properties; Symbolic computation. 5. Tools and Applications: Programming and proof environments; Verification tools; Proof assistants and interactive theorem provers; Applications in industry; Applications of formal systems in other sciences. 6. Semantics and Verification in new challenging areas: Certification; Security; Blockchain protocols; Data Bases; Deep learning and machine learning algorithms; Planning. PUBLICATION ----------- The proceedings will be published as an electronic volume in the Leibniz International Proceedings in Informatics (LIPIcs) of Schloss Dagstuhl. All LIPIcs proceedings are open access. SPECIAL ISSUE ------------- Authors of selected papers will be invited to submit an extended version to a special issue of Logical Methods in Computer Science. SUBMISSION GUIDELINES --------------------- Submissions can be made in two categories. Regular research papers are limited to 15 pages (including references, with the possibility to add an annex for technical details, e.g. proofs) and must present original research which is unpublished and not submitted elsewhere. System descriptions are limited to 15 pages (including references) and must present new software tools in which FSCD topics play an important role, or significantly new versions of such tools. Complete instructions on submitting a paper can be found on the conference web site. BEST PAPER AWARD BY JUNIOR RESEARCHERS -------------------------------------- The program committee will select a paper in which at least one author is a junior researcher, i.e. either a student or whose PhD award date is less than three years from the first day of the meeting. Other authors should declare to the PC Chair that at least 50% of contribution is made by the junior researcher(s). PROGRAM COMMITTEE CHAIR ----------------------- Zena M. Ariola, University of Oregon fscd2020(a)easychair.org PROGRAM COMMITTEE ----------------- M. Alpuente, Technical Univ. of Valencia S. Alves, University of Porto A. Bauer, University of Ljubljana M. P. Bonacina, Università degli studi di Verona P-L. Curien, CNRS - Univ. of Paris Diderot P. Dybjer, Chalmers Univ. of Technology U. De’Liguoro, University of Torino M. Fernandez, King’s College London M. Gaboardi, Boston University D. Ghica, University of Birmingham S. Ghilezan, University of Novi Sad J. Giesl, RWTH Aachen University S. Guerrini, University of Paris 13 R. Harper, Carnegie Mellon University M. Hasegawa, Kyoto University N. Hirokawa, JAIST P. Johann, Appalachian State University O. Kammar, University of Edinburgh D. Kesner, University of Paris Diderot C. Kop, Radboud University O. Laurent, ENS Lyon D. Licata, Wesleyan University A. Middeldorp, University of Innsbruck J. Mitchell, Stanford University K. Nakata, SAP Postdam M. Pagani, University of Paris Diderot E. Pimentel, Fed. Univ. Rio Grande do Norte Vrije F. van Raamsdonk, University Amsterdam G. Rosu, University of Illinois A. Sabry, Indiana University A. Stump, University of Iowa P. Urzyczyn, University of Warsaw T. Uustalu, Reykjavik University S. Zdancewic, University of Pennsylvania CONFERENCE CHAIR ---------------- Stefano Guerrini, University of Paris 13 WORKSHOP CHAIR -------------- Giulio Manzonetto, University of Paris 13 STEERING COMMITTEE WORKSHOP CHAIR -------------------------------- J. Vicary, Oxford University PUBLICITY CHAIR --------------- S. Alves, University of Porto FSCD STEERING COMMITTEE ----------------------- S. Alves (University of Porto), M. Ayala-Rincón (University of Brasilia) C. Fuhs (Birkbeck, London University) H. Geuvers (Radboud University) D. Kesner (Chair, University of Paris Diderot ) H. Kirchner (Inria) C. Kop (Radboud University) D. Mazza (University of Paris 13) D. Miller (Inria) L. Ong (Oxford University) J. Rehof (TU Dortmund) S. Staton (Oxford University)

1 0

The Highlights of Logic, Games, and Automata advertisement mailing list
by Nathanaël Fijalkow 27 Sep '19

27 Sep '19

The annual Highlights of Logic, Games, and Automata conference has grown into a well-known and well-attended event, with already 7 past editions ( http://highlights-conference.org/). We would like to introduce a new tool for strengthening its community: an advertisement mailing list. This is the place to post about job openings (including PhD studentships and research internships), calls for events, and other announcements relevant to the research community working on Logic, Games, and Automata, broadly construed. *Please consider signing up here:* https://diff.u-bordeaux.fr/sympa/info/highlights_community or by sending an email to sympa(a)diff.u-bordeaux.fr with subject line: subscribe highlights_community Firstname Lastname The list is moderated to make sure that the emails are pertinent. It is not meant to be a discussion forum, so only "announcements" will be disseminated. There are several features offered by the sympa manager, including: publicly available archives, digests, RSS. Please note that this is a different mailing list than labri.highlights(a)diff.u-bordeaux.fr, which is exclusively used for announcements of the Highlights of Logic, Games, and Automata conference (and collocated events).

1 0

Third CFP - RAMiCS 2020
by Michael Winter 13 Sep '19

13 Sep '19

THIRD CALL FOR PAPERS 18th International Conference on Relational and Algebraic Methods in Computer Science RAMiCS 2020 08. April to 11. April 2020, Palaiseau, France URL: http://ramics18.gforge.inria.fr/ IMPORTANT DATES: Abstract Submission: 06. October 2019 Paper Submission: 13. October 2019 Author Notification: 15. December 2019 Final Version: 16. January 2020 RAMiCS 2020: 08. April to 11. April 2020 INVITED TALKS: Christel Baier, Technische Universitaet Dresden, Germany Manfred Droste, Universitaet Leipzig, Germany Daniela Petrisan, Universite Paris Diderot, France GENERAL INFORMATION: Since 1994, the RAMiCS conference series has been the main venue for research on relation algebras, Kleene algebras and similar algebraic formalisms, and their applications as conceptual and methodological tools in computer science and beyond. TOPICS: We invite submissions in the general fields of algebras relevant to computer science and applications of such algebras. Topics include but are not limited to: * Theory - algebras such as semigroups, residuated lattices, semirings, Kleene algebras, relation algebras and quantales - their connections with program logics and other logics - their use in the theories of automata, concurrency, formal languages, games, networks and programming languages - the development of algebraic, algorithmic, category-theoretic, coalgebraic and proof-theoretic methods for these theories - their formalisation with theorem provers * Applications - tools and techniques for program correctness, specification and verification - quantitative and qualitative models and semantics of computing systems and processes - algorithm design, automated reasoning, network protocol analysis, social choice, optimisation and control - industrial applications WATA 2020 WATA 2020, the 10th International Workshop on Weighted Automata: Theory and Applications, will take place just after RAMICS, from 14 to 17 April, in Marseille. We encourage participants to combine the two events. SUBMISSION INSTRUCTIONS: Submission is via EasyChair at https://www.easychair.org/conferences/?conf=ramics2020 All papers will be peer-reviewed by at least three referees. The proceedings will be published in an LNCS volume by Springer, ready at the conference. Submissions must not be published or under review for publication elsewhere. Submissions must be in English using a PDF not exceeding 16 pages in LNCS style. Submissions must provide sufficient information to judge their merits. Additional material may be provided in a clearly marked appendix or by a reference to a manuscript on a web site. Experimental data, software or mathematical components for theorem provers must be available in sufficient detail for referees. Deviation from these requirements may lead to rejection. One author of each accepted paper is expected to present the paper at the conference. Accepted papers must be produced with LaTeX. Formatting instructions and LNCS style files are available at http://www.springer.de/comp/lncs/authors.html As for earlier RAMiCS conferences, we intend to publish a journal special issue with revised and extended versions of a selection of the best papers. COMMITTEES: Organising Committee -------------------- Conf. & PC Co-Chair: Peter Jipsen, Chapman University, USA Conf. & PC Co-Chair: Uli Fahrenberg, École polytechnique, France Conf. & PC Co-Chair: Michael Winter, Brock University, Canada Programme Committee ------------------- Roland Backhouse University of Nottingham, UK Rudolf Berghammer Kiel University, Germany Manuel Bodirsky TU Dresden, Germany Jules Desharnais Laval University, Canada Amina Doumane PPS, France Uli Fahrenberg École polytechnique, France Hitoshi Furusawa Kagoshima University, Japan Mai Gehrke LIAFA, France Walter Guttmann University of Canterbury, New Zealand Robin Hirsch University College London, UK Peter Höfner CSIRO, Australia Marcel Jackson La Trobe University, Australia Jean-Baptiste Jeannin University of Michigan, USA Peter Jipsen Chapman University, USA Stef Joosten Open Universiteit, Netherlands Wolfram Kahl McMaster University, Canada Dexter Kozen Cornell University, USA Tadeusz Litak FAU Erlangen-Nürnberg, Germany Wendy MacCaull St. Francis Xavier University, Canada Roger Maddux Iowa State University, USA Annabelle McIver Macquarie University, Australia Szabolcs Mikulas University of London, UK Ali Mili NJIT, USA Jose Oliveira University of Minho, Portugal Alessandra Palmigiano Technical University of Delft, Netherlands Damien Pous CNRS - ENS Lyon, France Mehrnoosh Sadrzadeh University College London, UK Luigi Santocanale LIS, Aix-Marseille Université, France John Stell University of Leeds, UK Georg Struth University of Sheffield, UK Michael Winter Brock University, Canada

1 0

LATA 2020: 2nd call for papers
by IRDTA 10 Sep '19

10 Sep '19

LATA 2020: 2nd 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 Milan, Italy March 2-6, 2020 Co-organized by: Department of Informatics, Systems and Communication University of Milano-Bicocca and Institute for Research Development, Training and Advice Brussels/London https://lata2020.irdta.eu ************************************************************************* AIMS: LATA is a conference series on theoretical computer science and its applications. LATA 2020 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. VENUE: LATA 2020 will take place in Milan, the third largest economy among European cities and one of the Four Motors for Europe. 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 will consist of: invited talks peer-reviewed contributions INVITED SPEAKERS: Eric Allender (Rutgers University), The New Complexity Landscape around Circuit Minimization 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) 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) Tero Harju (University of Turku, FI) Jeffrey Heinz (Stony Brook University, US) Lane A. Hemaspaandra (University of Rochester, US) Marcin Jurdziński (University of Warwick, UK) Juhani Karhumäki (University of Turku, FI) Jarkko Kari (University of Turku, FI) Dexter Kozen (Cornell University, US) François Le Gall (Kyoto University, JP) 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) Tomáš Vojnar (Brno University of Technology, CZ) Mikhail Volkov (Ural Federal University, RU) James Worrell (University of Oxford, UK) 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. Submissions have to be uploaded to: https://easychair.org/conferences/?conf=lata2020 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 a major journal 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://lata2020.irdta.eu/registration DEADLINES (all at 23:59 CET): Paper submission: October 18, 2019 Notification of paper acceptance or rejection: November 25, 2019 Final version of the paper for the LNCS proceedings: December 2, 2019 Early registration: December 2, 2019 Late registration: February 17, 2020 Submission to the journal special issue: June 6, 2020 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

Post Doctoral position in Parameterized Complexity at TU Wien, Vienna, Austria
by Mihaela Rozman 10 Sep '19

10 Sep '19

There is an opening for a postdoc position at the Algorithms and Complexity group at TU Wien (Vienna University of Technology), Vienna, Austria. - The position is for two years with the possibility of an extension. - The position is research-only, but interested candidates have the opportunity get involved in teaching. - The employment is full-time (40 hrs/week) and the salary is internationally competitive (the yearly entry-level gross salary is approx. 53K for postdocs). - The working language at the university is English, knowledge of German is not required. REQUIREMENTS Required are a PhD degree in Computer Science or related area and excellent knowledge of algorithms and complexity, preferably in the setting of parameterized complexity and fixed-parameter tractability. Some background in graph theory, combinatorics, satisfiability, computational logic, or constraint satisfaction is of advantage. APPLICATION -Applications must be made by September 27, 2019. -The application should include the candidate's CV, an abstract of their PhD thesis, a motivation letter, and a list of three references. INFORMAL INQUIRES - Informal inquires by email (Stefan Szeider, <sz[AT]ac.tuwien.ac.at>) are welcome.

1 0