Monthly 211
March 01, 2021
Monthly 211Past Issues - How to submit an announcement
Table of Content
- DEADLINES
- COVID UPDATES
- CALLS
Deadlines
| SPIN 2021: | Mar 1, 2021 (Paper) |
| Alonzo Church Award: | Mar 1, 2021 (Deadline for Nominations) |
| QPL 2021: | Mar 12, 2021 (Paper deadline (extended)) |
| TARK 2021: | Mar 15, 2021 (Abstract), Mar 20, 2021 (Extended abstract) |
| SOAP: | Mar 22, 2021 (Paper) |
| NALOMA'21: | Mar 26, 2021 (Papers & extended abstracts) |
| Diagrams 2021: | Apr 01, 2021 (Titles+short abstracts), Apr 08, 2021 (Long and Short Papers), Apr 15, 2021 (Abstracts and Posters) |
| MGS 21: | Apr 01, 2021 (Registration deadline) |
| FORMATS 2021: | Apr 06, 2021 (Abstract), Apr 13, 2021 (Paper) |
| E. W. Beth Outstanding Dissertation Prize 2021: | Apr 15, 2021 (Deadline for nominations) |
| CONCUR 2021: | Apr 23, 2021 (Abstract), Apr 30, 2021 (Paper) |
| MFCS 2021: | Apr 30, 2021 (Abstract), May 03, 2021 (Paper) |
| ICGI 2020/21: | May 25, 2021 (Paper) |
| ACKERMANN AWARD 2021: | Jul 01, 2021 (Deadline for nomination) |
| CSL22: | Jul 05, 2021 (Abstract), Jul 12, 2021 (Paper) |
LICS 2021:
COVID UPDATE- LICS 2021 will be online only.
SOAP: The 10th ACM SIGPLAN International Workshop on the State of the Art in Program Analysis
CALL FOR PAPERS- Static and dynamic analysis techniques and tools for Java, and other programming languages, have received widespread attention for a long time. The application domains of these analyses range from core libraries to modern technologies such as web services and Android applications. Over time, various analysis frameworks have been developed to provide techniques for optimizing programs, ensuring code quality, and assessing security and compliance.
SOAP 2021 aims to bring together the members of the program analysis community to share new developments and shape new innovations in program analysis. For SOAP 2021, we invite contributions and inspirations from researchers and practitioners working with program analysis. We are particularly interested in exciting analysis framework ideas, innovative designs, and analysis techniques, including preliminary results of work in progress. We will also focus on the state of the practice for program analysis by encouraging submissions by industrial participants, including tool demonstration submissions. The workshop agenda will continue its tradition of lively discussions on extensions of existing frameworks, development of new analyses and tools, and how program analysis is used in real-world scenarios. - Possible submissions include, but are not limited to:
- A report on a novel implementation of a program analysis, with a focus on practical details or optimization techniques for obtaining precision and performance.
- A new research tool, data, and other artifacts, that showcase early implementations of novel program analysis concepts, as well as mature prototypes.
- A description of a new analysis component, for example, front-ends or abstract domains.
- A report describing an innovative tool built on top of an existing framework.
- A compelling use case for a feature that is not yet supported by existing analysis tools, with good examples and an informal design of the proposed feature.
- An idea paper proposing the integration of existing program analyses to answer interesting novel questions about programs, for example in IDEs.
- An experience report on the use of a program analysis framework.
- A description of a program analysis tool and screenshots of main parts of the demo.
- SUBMISSIONS
Submissions should be four to six-page papers and should be formatted according to the two-column ACM proceedings format (http://www.sigplan.org/Resources/Author). Each reference must list all authors of the paper. The citations should be in numerical style, e.g., [52]. The preprint template should be set to use 10pt font and ‘numbers’ to ensure numerical style citations, that is: \documentclass[10pt, numbers]{sigplanconf}.
Submissions should be made on EasyChair: https://easychair.org/conferences/?conf=soap2021 - IMPORTANT DATES
Paper submission: Mar 22, 2021 Author notification: Apr 20, 2021 Camera ready deadline: May 03, 2021 - CONTACT:
Contact the chairs Lisa Nguyen Quang Do nqd.lisa@gmail.com and Caterina Urban caterina.urban@inria.fr and follow @SOAP_Workshop on Twitter.
MGS 21: 21st Midlands Graduate School in the Foundations of Computing Science
CALL FOR PARTICIPATION- OVERVIEW
The annual Midlands Graduate School in the Foundations of Computing Science (MGS) offers an intensive programme of lectures on the mathematical foundations of computing. It addresses first of all PhD students in their first or second year, but is open to anyone interested in its topics, from academia to industry and around the world. The MGS has been run since 1999 and is hosted alternately by the Universities of Birmingham, Leicester, Nottingham and Sheffield. MGS 21 is its 21st incarnation. Information about previous events can be found at the MGS web site: http://www.cs.nott.ac.uk/MGS - PROGRAMME
MGS 21 consists of eight courses, each with four or five hours of lectures and a similar number of exercise sessions. Three courses are introductory; one is given by an invited lecturer. These should be attended by all participants. The remaining more advanced courses should be selected based on interest. MGS 21 aims at a mix of livestreamed and prerecorded lectures and livestreamed exercise sessions, with additional social online events. - INVITED LECTURES:
- Monads and Interactions, Tarmo Uustalu, Reykjavik
- Category Theory, Jacopo Emmenegger, Birmingham
- Type Theory, Thorsten Altenkirch, Nottingham
- Proof Theory, Anupam Das, Birmingham
- Homotopy Type Theory, Nicolai Kraus, Nottingham
- Inductive and Coinductive Reasoning with Isabelle/HOL, Andrei Popescu, Seffield
- Effects and Call-by-Push-Value, Paul Levy, Birmingham
- Formal Modelling and Analysis of Concurrent Systems, Mohammad Mousavi, Licester
- REGISTRATION
Participation at MGS 21 is free of charge, but selective. Requests must be submitted online via https://staffwww.dcs.shef.ac.uk/people/G.Struth/mgs21.html
Registration deadline: Apr 01, 2021 - ORGANISATION
Please direct all queries about MGS 21 to Georg Struth G.Struth@sheffield.ac.uk
CONCUR 2021: The 32nd International Conference on Concurrency Theory
CALL FOR PAPERS- The purpose of CONCUR 2021, the 32nd International Conference on Concurrency Theory, is to bring together researchers, developers, and students in order to advance the theory of concurrency, and promote its applications.
Due the pandemic situation, the organization committee decided that the conference will take place online as last year's CONCUR: the talks will be pre-recorded and then streamed on Zoom. The participants will be able to ask questions on Slack, and the speakers will answer them live during the online Zoom session.
Should the situation improve, and allow some international travel, we will be able to cater for a few people that would like to meet in person in Paris. - Invited Speakers: Patricia Bouyer-Decitre (ENS Paris Saclay), Davide Sangiorgi (University of Bologna), Boudewijn Haverkort (Tilburg University (Joint with QEST))
- IMPORTANT DATES (All dates are AoE).
Abstract submission: Apr 23, 2021 Paper submission: Apr 30, 2021 Notification: Jun 23, 2021 Camera ready copy: Jul 09, 2021 Conference: Aug 23-27, 2021 - TOPICS
Submissions are solicited in semantics, logics, verification and analysis of concurrent systems. The principal topics include (but are not limited to):- Basic models of concurrency such as abstract machines, domain-theoretic models, game-theoretic models, process algebras, graph transformation systems, Petri nets, hybrid systems, mobile and collaborative systems, probabilistic systems, real-time systems, biology-inspired systems, and synchronous systems;
- Logics for concurrency such as modal logics, probabilistic and stochastic logics, temporal logics, and resource logics;
- Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, pre-order and equivalence checking, run-time verification, state-space exploration, static analysis, synthesis, testing, theorem proving, type systems, and security analysis;
- Distributed algorithms and data structures: design, analysis, complexity, correctness, fault tolerance, reliability, availability, consistency, self-organization, self-stabilization, protocols;
- Theoretical foundations of architectures, execution environments, and software development for concurrent systems such as geo-replicated systems, communication networks, multiprocessor and multi-core architectures, shared and transactional memory, resource management and awareness, compilers and tools for concurrent programming, programming models such as component-based, object- and service-oriented.
- PAPER SUBMISSION
CONCUR 2021 solicits high quality papers reporting research results and/or experience related to the topics mentioned below. All papers must be original, unpublished, and not submitted for publication elsewhere.
Each paper will undergo a thorough review process. The paper may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee.
Papers must be submitted in PDF format (LIPIcs style) via EasyChair and not exceed 14 pages (excluding references and clearly marked appendices). The CONCUR 2021 proceedings will be published by LIPIcs. - SPECIAL ISSUE
A special issue dedicated to selected papers from CONCUR 2021 will appear in Logical Methods in Computer Science. - TEST OF TIME AWARDS
Last year, the first CONCUR Test-of-Time awards were given. In 2021, the jury of the Test-of-Time award will consist of Rob van Glabbeek (chair), Luca de Alfaro, Nathalie Bertrand, Catuscia Palamidessi, and Nobuko Yoshida. The winners will be announced at the conference.
ICGI 2020/21: THE 15TH INTERNATIONAL CONFERENCE ON GRAMMATICAL INFERENCE
CALL FOR PAPERS- It is our pleasure to inform you about ICGI 2020/21, the major forum for presentation and discussion of original research papers on all aspects of grammar learning. ICGI, which has been organized bi-annually since the early nineties, will be held on-line in August 2021 after being postponed due to COVID-19 last year. ICGI 2020/21 is the place to present your work on learning formal grammars, finite state machines, context-free grammars, Markov models, or any models related to language theory, stochastic or otherwise. Both theoretical work and experimental analyses are welcomed as submissions. This year we especially encourage submissions related to connectionist models such as neural networks, since there are tutorials scheduled on that topic.
- The conference will be spread out over August 23-27, featuring a mix of live talks, asynchronous video presentations, tutorials, and an online competition. There will be one synchronous event per day plus dedicated time for each accepted paper; further details will be announced by email.
- INVITED SPEAKERS:
- Dana Fisman (Ben-Gurion University)
- Robert Frank (Yale University)
- Guillaume Rabusseau (Université de Montréal)
- Gail Weiss (Technion - Israel Institute of Technology)
- Others to be confirmed
- ON-LINE COMPETITION
ICGI 2020/21 is hosting a shared task on morphological inflection. An example of English inflection is the conversion of the lemma ‘run’ to its present participle, ‘running’. To participate in the shared task, you will build a system that can learn to solve inflection problems. More details at https://aryamccarthy.github.io/icgi2020/ - TOPICS OF INTEREST
- Theoretical aspects of grammatical inference: learning paradigms, learnability results, complexity of learning;
- Empirical and theoretical research on query learning, active learning, and other interactive learning paradigms;
- Empirical and theoretical research on methods using or including, but not limited to, spectral learning, state-merging, distributional learning, statistical relational learning, statistical inference and/or Bayesian learning;
- Learning algorithms for language classes inside and outside the Chomsky hierarchy. Learning tree and graph grammars;
- Learning probability distributions over strings, trees or graphs, or transductions thereof;
- Learning with contextualized data: for instance, Grammatical inference from strings or trees paired with semantics representations, or learning by situated agents and robots;
- Experimental and theoretical analysis of different approaches to grammar induction, including artificial neural networks, statistical methods, symbolic methods, information-theoretic approaches, minimum description length, complexity-theoretic approaches, heuristic methods, etc;
- Novel approaches to grammatical inference: induction by DNA computing or quantum computing, evolutionary approaches, new representation spaces, etc;
- Successful applications of grammatical learning to tasks in fields including, but not limited to, natural language processing and computational linguistics, model checking and software verification, bioinformatics, robotic planning and control, and pattern recognition.
- TYPES OF CONTRIBUTIONS
- Formal and/or technical papers describe original solutions (theoretical, methodological or conceptual) in the field of grammatical inference. A technical paper should clearly describe the situation or problem tackled, the relevant state of the art, the position or solution suggested and the benefits of the contribution;
- Position papers can describe completely new research positions or approaches, open problems. Current limits can be discussed. In all cases rigor in presentation will be required. Such papers must describe precisely the situation, problem, or challenge addressed, and demonstrate how current methods, tools, ways of reasoning, may be inadequate;
- Tool papers describing a new tool for grammatical inference. The tool must be publicly available and the paper has to contain several use-case studies describing the use of the tool. In addition, the paper should clearly describe the implemented algorithms, input parameters and syntax, and the produced output.
- GUIDELINES FOR AUTHORS
Accepted papers will be published within the Proceedings of Machine Learning Research series (http://proceedings.mlr.press/).
Max 12 pages, A4 pdf via EasyChair. JMLR style recommended (https://ctan.org/tex-archive/macros/latex/contrib/jmlr) since it will be the required format for the final published version. - Important Dates
Paper submission: May 25, 2021 Notification of acceptance: Jul 05, 2021 Camera-ready copy: Jul 30, 2021 Conference: Aug 23-27, 2021
ACKERMANN AWARD 2021: THE EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE
CALL FOR NOMINATIONS- INTRODUCTION
Nominations are now invited for the 2021 Ackermann Award. - ELIGIBILITY
PhD dissertations in topics specified by the CSL and LICS conferences, which were formally accepted as PhD theses at a university or equivalent institution between 1 January 2019 and 31 December 2020 are eligible for nomination for the award. - PRESENTATION OF THE AWARD
The 2021 Ackermann award will be presented to the recipient(s) at CSL 2022, the annual conference of the EACSL. The award consists of a certificate, an invitation to present the thesis at the CSL conference, the publication of the laudatio in the CSL proceedings, an invitation to the winner to publish thethesis in the FoLLI subseries of Springer LNCS, and financial support to attend the conference. - JURY
- Christel Baier (TU Dresden);
- Michael Benedikt (Oxford University);
- Mikolaj Bojanczyk (University of Warsaw);
- Jean Goubault-Larrecq (ENS Paris-Saclay);
- Prakash Panangaden (McGill University);
- Simona Ronchi Della Rocca (University of Torino), the vice-president of EACSL;
- Thomas Schwentick (TU Dortmund) , the president of EACSL;
- Alexandra Silva, (University College London), ACM SigLog representative.
- WHAT TO SUBMIT
The candidate or his/her supervisor should submit- the thesis (ps or pdf file);
- a detailed description (not longer than 20 pages) of the thesis in ENGLISH (ps or pdf file); it is recommended to not squeeze as much material as possible into these 20 pages, but rather to use them for a gentle introduction and overview, stressing the novel results obtained in the thesis and their impact;
- a supporting letter by the PhD advisor and two supporting letters by other senior researchers (in English); supporting letters can also be sent directly to Thomas Schwentick (thomas.schwentick@tu-dortmund.de);
- a short CV of the candidate;
- a copy of the document asserting that the thesis was accepted as a PhD thesis at a recognized University (or equivalent institution) and that the candidate has received his/her PhD within the specified period.
- HOW TO SUBMIT
The submission should be sent by e-mail as attachments to the chairman of the jury, Thomas Schwentick: thomas.schwentick@tu-dortmund.de, with- Subject: Ackermann Award 2021 Submission
- Text: Name of candidate, list of attachments
CSL22: Computer Science Logic
CALL FOR PAPERS- CONFERENCE
CSL is the annual conference of the European Association for Computer Science Logic (EACSL), see https://www.eacsl.org/.
It is an interdisciplinary conference, spanning across both basic and application oriented research in mathematical logic and computer science.
Currently, we expect that the conference will be organized in a hybrid way: both with an in-presence component and an online component. - SUBMISSION GUIDELINES:
The CSL 2022 conference proceedings will be published in LIPIcs. Submitted papers must be in English and must provide sufficient detail to allow the Programme Committee to assess the merits of the paper. Full proofs may appear in a clearly marked technical appendix which will be read at the reviewers' discretion. Authors are strongly encouraged to include a well written introduction which is directed at all members of the PC.
Authors are invited to submit contributed papers of no more than 15 pages in LIPIcs style (not including references), presenting unpublished work fitting the scope of the conference. Papers may not be submitted concurrently to another conference with refereed proceedings. The PC chairs should be informed of closely related work submitted to a conference or a journal.
Papers authored or co-authored by members of the PC are not allowed. At least one of the authors of each accepted paper is expected to register for the conference and attend it in person or online, in order to present their papers. - LIST OF TOPICS:
- automated deduction and interactive theorem proving
- constructive mathematics and type theory
- equational logic and term rewriting
- automata and games, game semantics
- modal and temporal logic
- model checking
- decision procedures
- logical aspects of computational complexity
- finite model theory
- computability
- computational proof theory
- logic programming and constraints
- lambda calculus and combinatory logic
- domain theory
- categorical logic and topological semantics
- database theory
- specification, extraction and transformation of programs
- logical aspects of quantum computing
- logical foundations of programming paradigms
- verification and program analysis
- linear logic
- higher-order logic
- nonmonotonic reasoning
- IMPORTANT DATES: (AoE)
Abstract submission: Jul 05, 2021 Paper submission: Jul 12, 2021 Notification: Sep 30, 2021 Conference: Feb 14-19, 2022 - CONTACT: csl2022@easychair.org
To the SIGLOG or LICS website