From genaim at gmail.com Sun Jan 3 04:44:48 2021 From: genaim at gmail.com (Samir Genaim) Date: Sun, 3 Jan 2021 10:44:48 +0100 Subject: [TYPES/announce] WST 2021 - 1st Call for Papers Message-ID: ====================================================================== WST 2021 - Call for Papers 17th International Workshop on Termination http://costa.fdi.ucm.es/wst2021 July 16, 2021, Pittsburgh, PA, United States Co-located with CADE-28 ====================================================================== The Workshop on Termination (WST) traditionally brings together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop also provides a ground for cross-fertilization of ideas from the different communities interested in termination (e.g., working on computational mechanisms, programming languages, software engineering, constraint solving, etc.). The friendly atmosphere enables fruitful exchanges leading to joint research and subsequent publications. IMPORTANT DATES: * submission deadline: April 18, 2021 * notification: May 23, 2021 * final version due: June 13, 2021 * workshop: July 16, 2021 TOPICS: The 17th International Workshop on Termination welcomes contributions on all aspects of termination. In particular, papers investigating applications of termination (for example in complexity analysis, program analysis and transformation, theorem proving, program correctness, modeling computational systems, etc.) are very welcome. Topics of interest include (but are not limited to): * abstraction methods in termination analysis * certification of termination and complexity proofs * challenging termination problems * comparison and classification of termination methods * complexity analysis in any domain * implementation of termination methods * non-termination analysis and loop detection * normalization and infinitary normalization * operational termination of logic-based systems * ordinal notation and subrecursive hierarchies * SAT, SMT, and constraint solving for (non-)termination analysis * scalability and modularity of termination methods * termination analysis in any domain (lambda calculus, declarative programming, rewriting, transition systems, etc.) * well-founded relations and well-quasi-orders SUBMISSION GUIDELINES: Submissions are short papers/extended abstracts which should not exceed 5 pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and provides additional feedback for each submission. The accepted papers will be made available electronically before the workshop. Papers should be submitted electronically via the submission page: https://easychair.org/conferences/?conf=wst2021 Please, use LaTeX and the LIPIcs style file http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz to prepare your submission. PROGRAM COMMITTEE: * Martin Avanzini - INRIA Sophia, Antipolis * Carsten Fuhs - Birkbeck, U. of London * Samir Genaim (chair) - U. Complutense de Madrid * J?rgen Giesl - RWTH Aachen * Matthias Heizmann - U. of Freiburg * Cynthia Kop - Radboud U. Nijmegen * Salvador Lucas - U. Polit?cnica de Val?ncia * ?tienne Payet - U. de La R?union * Albert Rubio - U. Complutense de Madrid * Ren? Thiemann - U. of Innsbruck * Johannes Waldmann - HTWK Leipzig -------------- next part -------------- An HTML attachment was scrubbed... URL: From p.gardner at imperial.ac.uk Sun Jan 3 05:36:06 2021 From: p.gardner at imperial.ac.uk (Gardner, Philippa A) Date: Sun, 3 Jan 2021 10:36:06 +0000 Subject: [TYPES/announce] Fwd: permanent academic positions, Imperial References: <3BA02209-20FB-4CC6-83FE-BAFC3FF31410@ic.ac.uk> Message-ID: Hello all, Here?s a reminder of the open academic positions at Imperial, deadline 7th January, details below. These positions are advertised as general positions. I have however recently learnt that the case made to obtain these positions included an argument about PL and systems positions, so I really do encourage you to apply. Happy New Year. Philippa ---------------------------------------------------------------------------------------- Professor Philippa Gardner Department of Computing Imperial College 180 Queen?s Gate London SW7 2AZ My working day may not be the same as yours. Please do not feel obliged to reply to this email outside your normal working hours. Begin forwarded message: From: "Gardner, Philippa A" > Subject: permanent academic positions, Imperial Date: 14 November 2020 at 14:12:29 GMT To: "types-announce at lists.seas.upenn.edu" > Dear all, [Sorry if you receive multiple postings of this email.] I would like to draw your attention to a current Imperial advert for several academic positions (roughly equivalent to assistant/associate professor) in the Department of Computing at Imperial; details can be found here. **Deadline: 7th January 2020** We seek excellent applicants from all areas of Computer Science. I would very much like to encourage PL, theory and verification experts to apply. Please don?t hesitate to contact me, or other academics in the Department, if you have any questions. In particular, there are some exciting plans for growth and interaction with industry that we would be happy to share with you. Best wishes, Philippa ---------------------------------------------------------------------------------------- Professor Philippa Gardner Department of Computing Imperial College 180 Queen?s Gate London SW7 2AZ My working day may not be the same as yours. Please do not feel obliged to reply to this email outside your normal working hours. -------------- next part -------------- An HTML attachment was scrubbed... URL: From carsten at dcs.bbk.ac.uk Mon Jan 4 12:08:16 2021 From: carsten at dcs.bbk.ac.uk (Carsten Fuhs) Date: Mon, 4 Jan 2021 17:08:16 +0000 Subject: [TYPES/announce] FSCD 2021: Second Call for Papers Message-ID: <7ad557ae-4b3b-74f6-ae6c-4ca82b4fdac6@dcs.bbk.ac.uk> (Apologies for multiple copies of this announcement. Please circulate.) ================================================================== Updated information on: invited speakers, affiliated workshops ================================================================== CALL FOR PAPERS Sixth International Conference on Formal Structures for Computation and Deduction (FSCD 2021) July 17 - July 24, 2021, Buenos Aires, Argentina https://fscd2021.dc.uba.ar/ In-cooperation with ACM SIGLOG and SIGPLAN NOTE: Due to the Covid 19 pandemic situation, the 2021 edition of FSCD and its satellite workshops will be held online. IMPORTANT DATES --------------- All deadlines are midnight anywhere-on-earth (AoE); late submissions will not be considered. Abstract: February 12, 2021 Submission: February 15, 2021 Rebuttal: April 2-5, 2021 Notification: April 19, 2021 Final version: May 3, 2021 INVITED SPEAKERS ---------------- - Zena M. Ariola, University of Oregon https://ix.cs.uoregon.edu/~ariola/ - Nao Hirokawa, JAIST https://www.jaist.ac.jp/~hirokawa/ - Elaine Pimentel, Federal University of Rio Grande do Norte https://sites.google.com/site/elainepimentel/ - Sam Staton, University of Oxford https://www.cs.ox.ac.uk/people/samuel.staton/main.html AFFILIATED WORKSHOPS -------------------- - HoTT/UF: 6th Workshop on Homotopy Type Theory/Univalent Foundations - ITRS: 10th Workshop on Intersection Types and Related Systems - WPTE: 7th International Workshop on Rewriting Techniques for Program Transformations and Evaluation - UNIF: 35th International Workshop on Unification - LSFA: 16th Logical and Semantics Frameworks with Applications - IWC: 10th International Workshop on Confluence - IFIP WG 1.6: 24th meeting of the IFIP Working Group 1.6: Rewriting FSCD (http://fscd-conference.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 --------------------- The submission site is: https://easychair.org/conferences/?conf=fscd2021 Submissions can be made in two categories. Regular research papers are limited to 15 pages, excluding references and appendices. They 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. An archive of the code with instructions on how to install and run the tool must be submitted. In addition, a webpage where the system can be experimented with should be provided. Complete instructions on submitting a paper can be found on the conference web site: https://fscd2021.dc.uba.ar/ One author of an accepted paper is expected to present it at the conference 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 ----------------------- Naoki Kobayashi, The University of Tokyo fscd2021 at easychair.org PROGRAM COMMITTEE ----------------- M. Ayala-Rinc?n, Universidade de Bras?lia S. Berardi, University of Torino F. Blanqui, INRIA E. Bonelli, Stevens Institute of Technology ?. Contejean, CNRS, Universit? Paris-Saclay T. Coquand, University of Gothenburg T. Ehrhard, Universit? de Paris, CNRS S. Escobar, Univ. Polit?cnica de Val?ncia J. Esp?rito Santo, University of Minho C. Faggian, Universit? de Paris, CNRS A. Felty, University of Ottawa S. Figueira, Universidad de Buenos Aires M. Fiore, University of Cambridge M. Gaboardi, Boston University S. Ghilezan, University of Novi Sad I. Hasuo, National Institute of Informatics D. Kesner, Universit? de Paris R. Krebbers, Radboud University Nijmegen T. Kutsia, Johannes Kepler University Linz B. K?nig, University of Duisburg-Essen M. Lenisa, University of Udine N. Nishida, Nagoya University L. Ong, University of Oxford P. Parys, University of Warsaw J. Rehof, TU Dortmund University C. Rocha, Pontificia Univ. Javeriana Cali A. Silva, University College London N. Szasz, Universidad ORT Uruguay A. Tiu, Australian National University S. Winkler, University of Verona H. Yang, KAIST, South Korea CONFERENCE CHAIR ---------------- Alejandro D?az-Caro, Quilmes Univ. & ICC/CONICET WORKSHOP CHAIRS -------------- Mauricio Ayala-Rinc?n, Universidade de Bras?lia Carlos L?pez Pombo, Universidad de Buenos Aires STEERING COMMITTEE WORKSHOP CHAIR -------------------------------- Jamie Vicary, Oxford University PUBLICITY CHAIR --------------- Carsten Fuhs, Birkbeck, University of London FSCD STEERING COMMITTEE ----------------------- Z. Ariola, University of Oregon M. Ayala-Rinc?n, University of Brasilia C. Fuhs, Birkbeck, University of London H. Geuvers, Radboud University S. Ghilezan, University of Novi Sad S. Guerrini, University of Paris 13 D. Kesner (Chair), University of Paris Diderot H. Kirchner, Inria C. Kop, Radboud University D. Mazza, University of Paris 13 L. Ong, Oxford University J. Rehof, TU Dortmund J. Vicary, Oxford University From walther.neuper at jku.at Sun Jan 3 11:36:25 2021 From: walther.neuper at jku.at (Walther Neuper) Date: Sun, 3 Jan 2021 17:36:25 +0100 Subject: [TYPES/announce] CfP Theorem Proving Components for Educational Software at CADE-28 Message-ID: Call for Extended Abstracts & Demonstrations ************************************************************************** ThEdu'21 Theorem Proving Components for Educational Software July 2021 http://www.uc.pt/en/congressos/thedu/ThEdu21 ************************************************************************** at CADE-28 The 28th International Conference on Automated Deduction Carnegie Mellon University, Pittsburgh, PA, United States July 11-16, 2021 http://www.cade-28.info ************************************************************************** ThEdu'21 Scope: Computer Theorem Proving is becoming a paradigm as well as a technological base for a new generation of educational software in science, technology, engineering and mathematics. The workshop brings together experts in automated deduction with experts in education in order to further clarify the shape of the new software generation and to discuss existing systems. Invited Talk Gilles Dowek, ENS Paris-Saclay Important Dates * Extended Abstracts: 25 April 2021 * Author Notification: 23 May 2021 * Workshop Day: July 2021 Topics of interest include: * methods of automated deduction applied to checking students' input; * methods of automated deduction applied to prove post-conditions for particular problem solutions; * combinations of deduction and computation enabling systems to propose next steps; * automated provers specific for dynamic geometry systems; * proof and proving in mathematics education. Submission We welcome submission of extended abstracts and demonstration proposals presenting original unpublished work which is not been submitted for publication elsewhere. All accepted extended abstracts and demonstrations will be presented at the workshop. The extended abstracts will be made available online. Extended abstracts and demonstration proposals should be submitted via easychair, https://easychair.org/conferences/?conf=thedu21 formatted according to http://www.easychair.org/publications/easychair.zip Extended abstracts and demonstration proposals should be approximately 5 pages in length and are to be submitted in PDF format. At least one author of each accepted extended abstract/demonstration proposal is expected to attend ThEdu'21 and presents his/her extended abstract/demonstration. Contingency Plans (COVID19) If the pandemic status, at the time of the conference, should force CADE-28 to be implemented as an online event, ThEdu'21 will follow through, as a online workshop. Program Committee Francisco Botana, University of Vigo at Pontevedra, Spain David Cerna, Johannes Kepler University, Austria Joao Marcos, Universidade Federal do Rio Grande do Norte, Brazil (co-chair) Filip Maric, University of Belgrade, Serbia Adolfo Neto, Universidade Tecnol?gica Federal do Paran?, Brazil Walther Neuper, Graz University of Technology, Austria (co-chair) Pedro Quaresma, University of Coimbra, Portugal (co-chair) Philippe R. Richard, Universit? de Montr?al, Canada (tentative) Vanda Santos, University of Aveiro, Portugal Wolfgang Schreiner, Johannes Kepler University, Austria J?rgen Villadsen, Technical University of Denmark, Denmark Proceedings The extended abstracts and system descriptions will be available in ThEdu'21 Web-page. After presentation at the conference, selected authors will be invited to submit a substantially revised version, extended to 14--20 pages, for publication by the Electronic Proceedings in Theoretical Computer Science (EPTCS). -------------- next part -------------- An HTML attachment was scrubbed... URL: From P.Achten at cs.ru.nl Mon Jan 4 10:30:23 2021 From: P.Achten at cs.ru.nl (Peter Achten) Date: Mon, 4 Jan 2021 16:30:23 +0100 Subject: [TYPES/announce] [TFPIE'21] Third and Final Call For Papers: Trends in Functional Programming *in Education* 2021, 16 February 2021 (with Lambda Days 2021 & TFP 2021) Message-ID: <62a05740-ed6c-2584-a11a-db5ea3cd7885@cs.ru.nl> ---------------------------------------------- ?? TFPIE 2021 3rd and Final Call for papers ---------------------------------------------- *************************************************************** -? Submission deadline: January 11 2021, Anywhere on Earth. *************************************************************** https://wiki.tfpie.science.ru.nl/TFPIE2021#TFPIE_2021 (February 16 2021, co-organized with TFP 2021 and Lambda Days 2021) Because of the covid pandemic, the events are online this year. The goal of the International Workshops on Trends in Functional Programming in Education is to gather researchers, professors, teachers, and all professionals that use or are interested in the use of functional programming in education. TFPIE aims to be a venue where novel ideas, classroom-tested ideas, and work in progress on the use of functional programming in education are discussed. The one-day workshop will foster a spirit of open discussion by having a review process for publication after the workshop. TFPIE 2021 welcomes submissions in the above mentioned areas. This year many teaching programmes have had to make a rapid transition to online teaching, and we explicitly solicit papers that explore this area of teaching functional programming. Topics of interest include, but are not limited to: -? FP and beginning CS students -? FP and Computational Thinking -? FP and Artificial Intelligence -? FP in Robotics -? FP and Music -? Advanced FP for undergraduates -? FP in graduate education -? Engaging students in research using FP -? FP in Programming Languages -? FP in the high school curriculum -? FP as a stepping stone to other CS topics -? FP and Philosophy -? The pedagogy of teaching FP -? FP and e-learning: MOOCs, automated assessment etc. -? Best Lectures - more details below In addition to papers, we are requesting best lecture presentations. What's your best lecture topic in an FP related course? Do you have a fun way to present FP concepts to novices or perhaps an especially interesting presentation of a difficult topic? In either case, please consider sharing it. Best lecture topics will be selected for presentation based on a short abstract describing the lecture and its interest to TFPIE attendees. The length of the presentation should be comparable to that of a paper. On top of the lecture itself, the presentation can also provide commentary on the lecture. Submissions Potential presenters are invited to submit an extended abstract (4-6 pages) or a draft paper (up to 20 pages) in EPTCS style. The authors of accepted presentations will have their preprints and their slides made available on the workshop's website. Papers and abstracts can be submitted via easychair at the following link: https://easychair.org/conferences/?conf=tfpie2021 After the workshop, presenters are invited to submit (a revised version of) their article for review. The PC will select the best articles for publication in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and extended abstracts will not be formally reviewed by the PC. Dates -? Submission deadline: January 11 2021, Anywhere on Earth. -? Notification: January 15 2021 -? Workshop: February 16 2021 -? Submission for formal review: April 20 2021, Anywhere on Earth. -? Notification of full article: June 7 2021 -? Camera ready: July 1st 2021 Program Committee - Peter Achten,??? Radboud University, Netherlands (chair) - Edwin Brady,???? University of St Andrews, UK - Laura Castro,??? Universidade da Coru?a, Spain - Stephen Chang,?? University of Massachusetts Boston, USA - Youyou Cong,???? Tokyo Institute of Technology, Japan - Matthew Flatt,?? University of Utah, USA - Seth Fogarty,??? Trinity University, USA - Alex Gerdes,???? University of Gothenburg, Sweden - Gabriele Keller, Utrecht University, Netherlands - Prabhakar Ragde, University of Waterloo, Canada - Melinda T?th,??? E?tv?s Lor?nd University, Budapest, Hungary Registration TFPIE is part of Lambda Days. Please visit the Lambda Days 2021 pages when registration information becomes available. Only papers that have been presented at TFPIE may be submitted to the post-reviewing process. Information on Lambda Days is available at https://www.lambdadays.org/lambdadays2021 Information on TFP???????? is available at http://tfp2021.org From gtan at cse.psu.edu Mon Jan 4 21:36:50 2021 From: gtan at cse.psu.edu (Gang (Gary) Tan) Date: Mon, 4 Jan 2021 21:36:50 -0500 Subject: [TYPES/announce] CFP: LangSec 2021 (affiliated with IEEE S&P) due on Jan 15th, 2021 Message-ID: <026b302f-1269-57f5-a5dc-83b4e44fa508@cse.psu.edu> Call for Papers 7th Workshop on Language-Theoretic Security (LangSec) Affiliated with 42nd IEEE Symposium on Security and Privacy (Oakland) May 27th, 2021 The Language-Theoretic Security (LangSec) workshop solicits contributions of research papers, work-in-progress reports, and panels related to the growing area of language-theoretic security. Submission Guidelines: see http://langsec.org/spw21/ Submission link: https://easychair.org/conferences/?conf=langsec2021 Important Dates: Research paper submissions due: January 15 2021, AOE Work-in-progress reports and panels submissions due: ? February 1 2021, AOE Notification to authors: February 15 2021 Camera ready: March 5 2021 Topics: LangSec posits that the only path to trustworthy computer software that takes untrusted inputs is treating all valid or expected inputs as a formal language, and the respective input-handling routine as a parser for that language. The parsing must be feasible, and the parser must match the language in required computation power and convert the input for the consumption of subsequent computation. The 7th installation of the workshop will continue the tradition and further focus on research that apply the language-theoretic perspective to policy mechanisms, such as treating policy formulation and enforcement as language definition and language recognition problems. The following is a non-exhaustive list of topics that are of relevance to LangSec: * formalization of vulnerabilities and exploits in terms of language ? theory * inference of formal language specifications of data from samples * generation of secure parsers from formal language specifications * complexity hierarchy of verifying parser implementations * science of protocol design: layering, fragmentation and re-assembly, ? extensibility, etc. * architectural constructs for enforcing limits on computational ? complexity * empirical data on programming language features/programming styles ? that affect bug introduction rates (e.g., syntactic redundancy) * systems architectures and designs based on LangSec principles * computer languages, file formats, and network protocols built on ? LangSec principles * re-engineering efforts of existing languages, formats, and protocols ? to reduce computational power Chairs PC co-chair: Gang Tan (Pennsylvania State University) PC co-chair: Sergey Bratus (Dartmouth College) Contact: All questions about submissions should be emailed to the PC chairs: Gang Tan (gtan at psu.edu) and Sergey Bratus (sergey at cs.dartmouth.edu) -- Gang (Gary) Tan Professor, Penn State CSE and ICDS W358 Westgate Building http://www.cse.psu.edu/~gxt29 Tel:814-8657364 -------------- next part -------------- An HTML attachment was scrubbed... URL: From A.Lisitsa at liverpool.ac.uk Tue Jan 5 06:38:27 2021 From: A.Lisitsa at liverpool.ac.uk (Lisitsa, Alexei) Date: Tue, 5 Jan 2021 11:38:27 +0000 Subject: [TYPES/announce] Third CFP VPT 2021 Ninth International Workshop on Verification and Program Transformation Message-ID: THIRD CALL FOR PAPERS Ninth International Workshop on Verification and Program Transformation Devoted to the achievements of the research career of Professor Alberto Pettorossi http://www.iasi.cnr.it/~adp/ March 27th and 28th, 2021, Luxembourg, Luxembourg http://refal.botik.ru/vpt/vpt2021 Co-Located with the 24th European joint Conference on Theory and Practice of Software (ETAPS 2021) The VPT 2021 event will consist of two parts: Day 1: Invited and contributed presentations of the postponed VPT 2020 workshop devoted to the achievements of the research career of Professor Alberto Pettorossi http://refal.botik.ru/vpt/vpt2020 The Proceedings of VPT-2020 was published as EPTCS 320: http://eptcs.web.cse.unsw.edu.au/content.cgi?VPTHCVS2020 Day 2: new Invited and contributed presentations of VPT 2021 workshop. *************************************************************** *************************************************************** VPT-2020 Keynote Speaker: Professor Alberto Pettorossi, Universita di Roma Tor Vergata and Istituto di Analisi dei Sistemi ed Informatica "A. Ruberti", Italy http://www.iasi.cnr.it/~adp/ *************************************************************** The VPT-2020 Invited Speakers: Alain Finkel, LSV, ENS Paris-Saclay, CNRS Universite Paris-Saclay, France http://www.lsv.fr/~finkel/ John P. Gallagher, Roskilde University, Denmark and IMDEA Software Institute, Spain http://www.ruc.dk/~jpg/ Moa Johansson, Chalmers University, Gothenburg, Sweden http://www.cse.chalmers.se/~jomoa/ Neil D. Jones, Professor emeritus at University of Copenhagen, Denmark http://hjemmesider.diku.dk/~neil/ Michael Leuschel, Heinrich-Heine-Universitaet Duesseldorf, Germany https://www.cs.hhu.de/en/research-groups/software-engineering-and-programming-languages/our-team/team/michael-leuschel.html Maurizio Proietti, IASI-CNR, Rome, Italy http://www.iasi.cnr.it/~proietti/ Sophie Renault, European Patent Office - The Hague, The Netherlands Andrzej Skowron, Professor emeritus at University of Warsaw, Poland *************************************************************** *************************************************************** VPT-2021 Invited Speakers: Nikos Gorogiannis, Middlesex University, UK https://ngorogiannis.bitbucket.io/ Fritz Henglein, DIKU, University of Copenhagen, Denmark http://hjemmesider.diku.dk/~henglein/ .......................................................................... .................................. TBA ................................... *************************************************************** The Ninth International Workshop on Verification and Program Transformation (VPT 2021) aims to bring together researchers working in the areas of Program Verification and Program Transformation. The workshop will be held fully online mode by ETAPS decision, and remote participation and lectures and talks delivery will be possible. The previous workshops in this series were: VPT 2013, Saint Petersburg, Russia VPT 2014, Vienna, Austria VPT 2015, London, UK VPT 2016, Eindhoven, The Netherlands VPT 2017, Uppsala, Sweden MARS/VPT 2018, Thessaloniki, Greece VPT 2019, Genova, Italy VPT 2020, Dublin, Ireland The VPT-2020 Workshop was postponed in-line with ETAPS-2020, The Proceedings of VPT-2020 was published as EPTCS 320. The workshop solicits research, position, application, and system description papers with a special emphasis on case studies, demonstrating viability of the interactions between the research fields of program transformation and program verification in a broad sense. Also papers in related areas, such as program testing and program synthesis are welcomed. Topics of interest include, but are not limited to: * Verification by Program Transformation * Verification Techniques in Program Transformation and Synthesis * Verification and Certification of Programs Transformations * Program Analysis and Transformation * Program Testing and Transformation * Verifiable Computing and Program Transformation * Case studies *Important Dates* * January 24th, 2021: Regular paper submission deadline (The deadline has been extended.) * January 24th, 2021: Extended abstracts and presentation-only papers submission deadline * February 16th, 2021: Acceptance notification * March 1st, 2021: Camera ready version (for the informal pre-proceedings) * March 27th and 28th, 2021: Workshop * May 10th, 2021: Revised paper submission for the formal proceedings in EPTCS deadline *Submission Guidelines* Authors should submit an electronic copy of the paper in PDF, formatted in the Electronic Proceedings in Theoretical Computer Science LaTeX Style (http://style.eptcs.org/), via the Easychair submission website for VPT 2021 : https://easychair.org/conferences/?conf=vpt2021 Regular papers must describe original work that has not been published, or currently submitted, to a journal, conference, or workshop with refereed proceedings. Also papers that already appeared in unpublished or informally published workshop proceedings may be submitted. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email; abstract; and three to four keywords that will be used to assist the PC in selecting appropriate reviewers for the paper. Page numbers should appear on the manuscript to help the reviewers in writing their report. Regular paper submissions should not exceed 15 pages including references but excluding well-marked appendices not intended for publication. Reviewers are not required to read the appendices, and thus papers should be intelligible without them. *Proceedings* Revised versions of all the accepted papers and accepted extended abstracts, taking into account the feedback received at the workshop, will be published in a volume of the Electronic Proceedings in Theoretical Computer (EPTCS) series after the workshop. If the workshop will attract sufficiently many high quality papers, a special issue of a journal on the topic of the workshop will be considered. The special issue will be open to high quality papers accepted for presentation in previous editions of the workshop. Program Committee: Emanuele De Angelis, IASI-CNR, Rome, Italy Grigory Fedyukovich, Princeton University, USA Laurent Fribourg, CNRS & ENS Paris-Saclay, France John P. Gallagher, Roskilde University, Denmark and IMDEA Software Institute, Spain Geoff W. Hamilton, Dublin City University, Republic of Ireland Alexei Lisitsa, The University of Liverpool, UK (co-Chair) Andrei P. Nemytykh, Program Systems Institute of RAS, Russia (co-Chair) Philipp Ruemmer, Uppsala University, Sweden Peter Sestoft, The IT University of Copenhagen, Denmark German Vidal, Universitat Politecnica de Valencia, Spain Organisers: Alexei Lisitsa (The University of Liverpool, UK) Andrei P. Nemytykh (Program Systems Institute of RAS, Russia) Contacts E-mail: Alexei Lisitsa, a.lisitsa at csc.liv.ac.uk Andrei P. Nemytykh, nemytykh at math.botik.ru , nemytykh at gmail.com Web: http://refal.botik.ru/vpt/vpt2021/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From itp2021-workshops at easyconferences.eu Tue Jan 5 10:05:45 2021 From: itp2021-workshops at easyconferences.eu (itp2021-workshops at easyconferences.eu) Date: Tue, 05 Jan 2021 10:05:45 -0500 Subject: [TYPES/announce] ITP2021: Second Call for Workshops (Deadline 11 January 2021) Message-ID: -------------------------------------------------------------------- ITP2021: Interactive Theorem Proving, 12th International Conference 2021, June 29-July 1, Rome, Italy http://easyconferences.eu/itp2021/ [1] -------------------------------------------------------------------- SECOND CALL FOR WORKSHOPS The ITP conference series is concerned with all topics related to interactive theorem proving, ranging from theoretical foundations to implementation aspects and applications in system verification, security, and formalization of mathematics. The 12th ITP conference, ITP 2021, will be held in Rome between 29 June and 1 July. It will be co-located with LICS and ICTCS conferences. ITP will carefully monitor the development of the COVID-19 pandemic, and take guidance from the health authorities to determine whether ITP21 will be held physically, virtually, or in a hybrid manner. Researchers and practitioners are invited to submit proposals for co-located workshops on topics relating to interactive theorem proving. Workshops can target the ITP community in general, focus on a particular ITP system, or highlight more specific issues or recent developments. Proposals for in-depth tutorials or tool introductions are also welcome. Co-located events will take place on 28 June and 2 July and will be held on the same premises as the main conference. In case of needs, we are ready to discuss and try to accommodate requests for two-day workshops. Conference facilities are offered free of charge to one of the organizers and one of the invited speakers. Workshop-only attendees will enjoy a significantly reduced registration fee. Detailed organizational matters such as paper submission and review process, or publication of proceedings, are up to the organizers of individual workshops. All accepted workshops will be expected to have their program ready by 4 June, 2021. Proposals for workshops should contain at least the following pieces of information: * name and contact details of the main organizer(s) * (if applicable:) names of additional organizers * title and organizational style of the workshop (tutorial, public workshop, project workshop, etc.) * preferred length of the workshop (half day or full day) * estimated number of attendees * short (up to one page) description of the topic * (if applicable:) pointers to previous editions of the workshop, or to similar events * (if applicable:) special needs for an online event Proposals should be submitted by email to itp2021-workshops at easyconferences.eu, no later than 11 January, 2021. Selected workshops will be notified by 15 January, 2021. Links: ------ [1] http://easyconferences.eu/itp2021/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From matteo.maffei at tuwien.ac.at Tue Jan 5 10:11:22 2021 From: matteo.maffei at tuwien.ac.at (Maffei, Matteo) Date: Tue, 5 Jan 2021 15:11:22 +0000 Subject: [TYPES/announce] PhD openings in Security and Privacy at TU Wien Message-ID: <7178B816-BCFD-4D8E-868B-D7DC76D2469F@tuwien.ac.at> The Security & Privacy group at TU Wien (https://secpriv.wien) is currently looking for outstanding PhD candidates to conduct cutting edge research in - web security - formal methods for security and privacy - security and privacy in machine learning Successful candidates will join the newly established SecInt doctoral school at TU Wien (https://secint.visp.wien) and will have the opportunity to engage in research collaborations within the Vienna Security and Privacy Research Center (https://visp.wien). TU Wien offers an outstanding research environment and numerous professional development opportunities. The Faculty of Informatics is the largest one in Austria and is consistently ranked among the best in Europe. Finally, Vienna has been consistently ranked by Mercer over the last years the best city for quality of life worldwide. The employment is full-time (40 hrs/week) and the salary is internationally competitive (the yearly entry-level gross salary is approx. 41.000 EUR, which roughly corresponds to 2.400 EUR net per month). Interested candidates should send at their earliest convenience - a motivation letter - transcripts of records (Bachelor and Master) - a curriculum vitae - contact information of two referees to matteo.maffei at tuwien.ac.at. More information on the application procedure and on additional hiring opportunities is available at https://secpriv.wien/work/ The working language in the group is English, knowledge of German is not required. --- Univ.-Prof. Dr. Matteo Maffei Security and Privacy Group TU Wien Favoritenstrasse 9-11, Stiege 2, 1. Stock Wien, A-1040 Website: secpriv.tuwien.ac.at Phone: +43(1)58801184860 -------------- next part -------------- An HTML attachment was scrubbed... URL: From david.monniaux at univ-grenoble-alpes.fr Tue Jan 5 15:32:57 2021 From: david.monniaux at univ-grenoble-alpes.fr (DAVID MONNIAUX) Date: Tue, 5 Jan 2021 21:32:57 +0100 (CET) Subject: [TYPES/announce] two industrially-funded PhD positions at VERIMAG, Grenoble, France Message-ID: <95818850.122307787.1609878777973.JavaMail.zimbra@univ-grenoble-alpes.fr> VERIMAG, a leading academic research laboratory, co-operated by the University of Grenoble and the National center for scientific research (CNRS), proposes two industrially-funded (CIFRE) positions : 1) With industry partner The MathWorks: algorithmics of convex polyhedra in floating-point. [ https://www-verimag.imag.fr/Convex-polyhedra-in-floating-point.html?lang= | https://www-verimag.imag.fr/Convex-polyhedra-in-floating-point.html?lang= ] 2) With industry partner STMicroelectronics: certified compilation for security [ https://www-verimag.imag.fr/Certified-compilation-for-security.html?lang=en | https://www-verimag.imag.fr/Certified-compilation-for-security.html?lang=en ] In both cases, the candidate is to be hired on a 3-year contract by the industry partner, and will spend half time in the academic laboratory, half time in industry. These topics and related areas are also available as regular PhDs, but then the candidate will need to apply for a 3-year scholarship, granted on a competitive basis. Contact me for more information. -------------- next part -------------- An HTML attachment was scrubbed... URL: From dom.orchard at gmail.com Tue Jan 5 17:12:08 2021 From: dom.orchard at gmail.com (Dominic Orchard) Date: Tue, 5 Jan 2021 22:12:08 +0000 Subject: [TYPES/announce] Practical Aspects of Declarative Languages (PADL 2021) Final Call for Participation Message-ID: We have a really exciting lineup of papers and keynote speakers at PADL this year, co-located with POPL 2021 and scheduled for Monday 18th - Tuesday 19th of January. PADL continues to be a stimulating forum for research into the practical and applied sides of the broad spectrum of declarative languages (functional, logic, constraints) and their combinations. The list of accepted papers can be found online: https://popl21.sigplan.org/home/PADL-2021 Topics this year include gradual types, logic programming for repairing states, reversible debugging, fuzzing, validation, declarative debugging, server-side web programming, foundations of logic programming implementation, blockchain safety, concurrency primitives, and pattern matching. We have two keynotes: - Semantics-based Synthesis in miniKanren - William Byrd (University of Alabama at Birmingham) - SMT-based Constraint Answer Set Solver EZSMT - Yuliya Lierler (University of Nebraska) Participation is of course online and anyone can register either as part of POPL or just to attend PADL itself: https://popl21.sigplan.org/attending/Registration This year the registration price is modest ($100 for ACM members or $50 for ACM students, + $25 for non ACM members) and there is even a discount option of $10 for those who do not have a source of external funding, to further enable wide participation. Early registration rates end January 10th, after this the price goes up by $25 (but the discount rate remains $10). We do hope you will join us and/or catch the recorded videos which will be made available online. Dominic Orchard and Jose Morales -------------- next part -------------- An HTML attachment was scrubbed... URL: From andrei.h.popescu at gmail.com Wed Jan 6 12:28:07 2021 From: andrei.h.popescu at gmail.com (Andrei Popescu) Date: Wed, 6 Jan 2021 17:28:07 +0000 Subject: [TYPES/announce] fully funded PhD position on verification of industrial robots at University of Sheffield -- application deadline coming soon (Jan. 13) Message-ID: Greetings, This fast approaching deadline could be of interest to UK or EU residents currently looking for a PhD position and willing to start in mid February. It is an opportunity to do high impact verification research in an excellent academic environment. Background in robotics is not required. The program is for 3.5 years, with no teaching obligations. There is the possibility to work remotely until the pandemic is over. The PhD will be supervised by myself (https://www.andreipopescu.uk/) in collaboration with experts from Sheffield's Advanced Manufacturing Research Centre (https://www.amrc.co.uk/). So far, my students have published in top tier conferences such as CAV, LICS, ICFP, IJCAR, POPL and Oakland S&P on the topics of their PhD and MSc dissertations. More details on the position can be found at: https://www.findaphd.com/phds/project/formal-specification-and-verification-of-the-safe-interaction-between-humans-and-industrial-robots/?p127388 Please feel free to contact me with any questions. Best wishes, Andrei From P.Achten at cs.ru.nl Fri Jan 8 03:11:48 2021 From: P.Achten at cs.ru.nl (Peter Achten) Date: Fri, 8 Jan 2021 09:11:48 +0100 Subject: [TYPES/announce] [TFP'21] final call for papers: Trends in Functional Programming 2021, 17-19 February (online event with Lambda Days 2021 & TFPIE 2021) Message-ID: <010c7411-4929-929f-d738-d975402f226a@cs.ru.nl> ------------------------------------------------------------------------- ????????????????????? Final call for papers ??????? 22nd Symposium on Trends in Functional Programming ????????????????????????? tfp2021.org ?????????????????? *deadline: January 15 2021* ------------------------------------------------------------------------- Did you miss the deadline to submit a paper to Trends in Functional Programming http://tfp2021.org/? No worries -- it's not too late! Submission is open until January 15th 2021, for a presentation slot at the event and post-symposium reviewing. The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions. * TFP offers a supportive reviewing process designed to help less experienced ? authors succeed, with two rounds of review, both before and after the ? symposium itself. Authors have an opportunity to address reviewers' concerns ? before final decisions on publication in the proceedings. * TFP offers two "best paper" awards, the John McCarthy award for best paper, ? and the David Turner award for best student paper. * TFP is co-located with Lambda Days in beautiful Krakow. Lambda Days is a vibrant ? developer conference with hundreds of attendees and a lively programme of talks on ? functional programming in practice. Due to the covid pandemic, the event is online ? with a lot of attention to interaction and getting to socialize with the community. Important Dates --------------- Submission deadline for pre-symposium review:?? 20th November, 2020? -- passed -- Submission deadline for draft papers:?????????? 15th January, 2021 Symposium dates:??????????????????????????????? 17-19th February, 2021 Visit http://tfp2021.org/ for more information. From m.sadrzadeh at ucl.ac.uk Fri Jan 8 05:07:49 2021 From: m.sadrzadeh at ucl.ac.uk (Sadrzadeh, Mehrnoosh) Date: Fri, 8 Jan 2021 10:07:49 +0000 Subject: [TYPES/announce] UNESCO World Logic Day@UCL: Logical Journeys Message-ID: Dear colleagues, We are organising a UNESCO World Logic Day (WLD) event in UCL, titled Logical Journeys! Details are available on our website: https://www.ucl.ac.uk/engineering/events/2021/jan/logical-journeys-webinar-world-logic-day-event [https://www.ucl.ac.uk/engineering/sites/engineering/files/styles/medium_image/public/events/wld-logo-page-001_0.jpg?itok=ZJRzvp5D] Logical Journeys Webinar (World Logic Day Event) | UCL Engineering - UCL ? University College London Logical Journeys is a one day event organised by Renato Neves, Mehrnoosh Sadrzadeh, and Alexandra Silva (UCL) for discussing the past use of logic in different domains and the challenges it faces from emerging paradigms, such as machine learning, probabilistic, cyber-physical, and quantum computing. The event is framed in the context of UNESCO?s World Logic Day, which was proclaimed (last ... www.ucl.ac.uk Logical Journeys will consist of a keynote talk by Samson Abramsky and a discussion session on ?the many facets of logic? which will be led by a panel of researchers with different backgrounds but with logic as a central pillar in their careers. Date: 14th January 2021. Start Time: 14h00 (UTC). End Time: 16h00 (UTC). The event will be hosted online, via Zoom. UCL uses third parties such as Zoom to administer virtual events and manage your personal information on our behalf. If you are happy for us to process your data solely for this purpose, please register for our webinar by clicking the booking link above. Outline of Programme * 14.00-15.00: Keynote talk by Prof. Samson Abramsky. * 15.00-15.30: Panelists' short talks/opinions about the discussion topics. * 15.30-16.00: Discussion amongst the panel members with questions from the audience. Panel The panel will consist of researchers working in different areas where logic is applied: * Samson Abramsky (Oxford University): Logic, quantum, and program semantics. * Robin Hirsch (University College London): Logic and mathematical foundations. * Nathan Klinedinst (University College London): Logic in linguistics. * Pasquale Minervini (University College London): Logic in machine learning. * Lavinia Picollo (National University of Singapore/UCL): Philosophical logic. * Alessandra Russo (Imperial College): Logic in symbolic reasoning. Discussion points 1- A CONTRARIAN ?EXPANSION? OF WORLD LOGIC DAY: THE WORLD IS NOISY AND UNCERTAIN: HAS LOGIC HAD ITS DAY? The idea here is the challenge we currently see to logic in CS and AI coming from the rise in machine learning and probabilistic methods. Of course, we will all want to rebut this, but it might be fun to tension our positive story against this challenge, rather than ignoring it! 2- EACH PANELIST'S PERSONAL JOURNEY INTO THE WORLD OF LOGIC: All panelists have experience in working with logic: some have enjoyed proving theorems in and about it, some have used machine learning and neural networks to automate the proofs. Some panelists have used the logic in exotic fields such as AI, linguistics, and philosophy. We would love to hear about each and everyone's stories. Please note, this webinar is open to all, but is aimed at an academic audience. Links on this page may lead to external sites. Visit UNESCO?s World Logic Day website for further information about the initiative. -------------- next part -------------- An HTML attachment was scrubbed... URL: From Simon.Gay at glasgow.ac.uk Fri Jan 8 06:40:13 2021 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Fri, 8 Jan 2021 11:40:13 +0000 Subject: [TYPES/announce] ICALP 2021 - Second Call For Papers Message-ID: =================================== ICALP 2021 - Second Call for Papers =================================== http://easyconferences.eu/icalp2021/ The 48th International Colloquium on Automata, Languages, and Programming (ICALP) will take place from 13-16 July 2021. ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS). As usual, ICALP will be preceded by a series of workshops, which will take place on 12 July 2021. *** ICALP 2021 and its workshops will be online-only, hosted by the University of Glasgow, UK. *** =============== Important dates ======================= Submission deadline: Friday 12 February 2021, 23:59 AoE Notification: Wednesday 28 April 2021 Camera-ready deadline: Friday 7 May 2021 Deadlines are firm; late submissions will not be considered. ================ Invited Speakers ================ Unifying Invited Speakers: Adi Shamir, Weizmann Institute of Science, Israel Toniann Pitassi, University of Toronto, Canada Andrei Bulatov, Simon Fraser University, Canada Track A Invited Speakers: Keren Censor-Hillel, Technion, Israel David Woodruff, Carnegie Mellon University, USA Track B Invited Speaker: Christel Baier, Technical University of Dresden, Germany =========================== Submissions and Proceedings =========================== ICALP proceedings are published in the Leibniz International Proceedings in Informatics (LIPIcs) series. This is a series of high-quality conference proceedings across all fields in informatics established in cooperation with Schloss Dagstuhl - Leibniz Center for Informatics. LIPIcs volumes are published according to the principle of Open Access, i.e., they are available online and free of charge. Submission Guidelines --------------------- Authors are invited to submit an extended abstract of no more than 12 pages, excluding references presenting original research on the theory of computer science. All submissions must be formatted in the LIPIcs style https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/) and submitted via Easychair to the appropriate track of the conference. The use of pdflatex and the LIPIcs style are mandatory: papers that deviate significantly from the required format may be rejected without consideration of merit. No prior publication and no simultaneous submission to other publication outlets (either a conference or a journal) is allowed. Technical details necessary for a proper scientific evaluation of a submission must be included in the 12-page submission or in a clearly labelled appendix, to be consulted at the discretion of program committee members. Authors are strongly encouraged to also make full versions of their submissions freely accessible in an on-line repository such as ArXiv, HAL, ECCC. Best Paper Awards ----------------- As in previous editions of ICALP, there will be best paper and best student paper awards for each track of the conference. In order to be eligible for a best student paper award, a paper should be authored only by students and should be marked as such upon submission. Topics ====== Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are: Track A: Algorithms, Complexity and Games ----------------------------------------- * Algorithmic and Complexity Aspects of Network Economics * Algorithmic Aspects of Networks and Networking * Algorithmic Aspects of Security and Privacy * Algorithms for Computational Biology * Algorithmic Game Theory and Mechanism Design * Approximation and Online Algorithms * Combinatorial Optimization * Combinatorics in Computer Science * Computational Complexity * Computational Geometry * Computational Learning Theory * Cryptography * Data Structures * Design and Analysis of Algorithms * Distributed and Mobile Computing * Foundations of Machine Learning * Graph Mining and Network Analysis * Parallel and External Memory Computing * Quantum Computing * Randomness in Computation * Theoretical Foundations of Algorithmic Fairness Track B: Automata, Logic, Semantics, and Theory of Programming ------------------------------------------------------------- * Algebraic and Categorical Models of Computation * Automata, Logic, and Games * Database Theory, Constraint Satisfaction Problems, and Finite Model Theory * Formal and Logical Aspects of Learning * Formal and Logical Aspects of Security and Privacy * Logic in Computer Science and Theorem Proving * Models of Computation: Complexity and Computability * Models of Concurrent, Distributed, and Mobile Systems * Models of Reactive, Hybrid, and Stochastic Systems * Principles and Semantics of Programming Languages * Program Analysis, Verification, and Synthesis * Type Systems and Typed Calculi =============================== ICALP 2021 Programme Committees =============================== Track A: Track A: Algorithms, Complexity and Games --------------------------------------------------- * Nikhil Bansal (CWI Amsterdam, Netherlands), Chair * Yossi Azar (Tel Aviv University, Israel) * Luca Becchetti (Sapienza University of Rome, Italy) * Aleksander Belov (University of Latvia, Latvia) * Eric Blais (University of Waterloo, Canada) * Niv Buchbinder (Tel Aviv University, Israel) * Kevin Buchin (TU Eindhoven, Netherlands) * Parinya Chalermsook (Aalto University, Finland) * Vincent Cohen-Addad (Google Research, Switzerland) * Shahar Dobzinski (Weizmann Institute, Israel) * Ran Duan (Tsinghua University, China) * Vida Dujmovic (University of Ottawa, Canada) * Yuval Filmus (Technion, Israel) * Samuel Fiorini (Universit? libre de Bruxelles, Belgium) * Andreas Galanis (University of Oxford, UK) * Mika G??s (EPFL, Switzerland) * Inge Li G?rtz (TU Denmark, Denmark) * Heng Guo (University of Edinburgh, UK) * Prahladh Harsha (TIFR, Mumbai, India) * Sungjin Im (UC Merced, USA) * Stacey Jeffery (CWI Amsterdam, Netherlands) * Iordanis Kerenidis (CNRS - Universit? Paris Diderot, France) * Michael Kapralov (EPFL, Switzerland) * Ravi Kumar (Google Research, USA) * Stefan Kratsch (HU Berlin, Germany) * Silvio Lattanzi (Google Research, Switzerland) * Shi Li (SUNY Buffalo, USA) * Konstantin Makarychev (Northwestern University, USA) * Marcin Mucha (University of Warsaw, Poland) * Wolfgang Mulzer (FU Berlin, Germany) * Jesper Nederlof (Utrecht University, Netherlands) * Aleksandar Nikolov (University of Toronto, Canada) * Neil Olver (LSE, UK) * Rasmus Pagh (IT University of Copenhagen, Denmark) * Merav Parter (Weizmann Institute, Israel) * Alexandros Psomas (Purdue University, USA) * Barna Saha (UC Berkeley, USA) * Thatchaphol Saranurak (University of Michigan, USA) * Rahul Savani (University of Liverpool, UK) * Mohit Singh (Georgia Tech, USA) * Sahil Singla (IAS/Princeton, USA) * Noah Stephens-Davidowitz (Cornell University, USA) * L?szl? V?gh (LSE, UK) * Meirav Zehavi (Ben-Gurion University, Israel) Track B: Automata, Logic, Semantics, and Theory of Programming --------------------------------------------------------------- * James Worrell (University of Oxford, UK), Chair * Parosh Aziz Abdulla (Uppsala University, Sweden) * S. Akshay (Indian Institute of Technology Bombay, India) * Nathalie Bertrand (Inria Rennes, France) * Michael Blondin (Universit? de Sherbrooke, Canada) * Olivier Carton (IRIF, Universit? de Paris, France) * Corina C?rstea (University of Southampton, UK) * Dana Fisman (Ben Gurion University, Israel) * Paul Gastin (LSV, ENS Paris-Saclay, France) * Stefan G?ller (University of Kassel, Germany) * Radha Jagadeesan (DePaul University Chicago, USA) * Bakhadyr Khoussainov (University of Auckland, New Zealand) * Emanuel Kiero?ski (Wroc?aw University, Poland) * Bartek Klin (Warsaw University, Poland) * Barbara K?nig (University of Duisburg-Essen, Germany) * Laura Kovacs (Vienna University of Technology, Austria) * Ugo Dal Lago (University of Bologna and Inria, Italy) * Christoph L?ding (RWTH Aachen University, Germany) * Madhavan Mukund (Chennai Mathematical Institute, India) * Sebastian Maneth (University of Bremen, Germany) * Richard Mayr (University of Edinburgh, UK) * Annabelle McIver (Macquarie University, Australia) * Sophie Pinchinat (IRISA, Universit? de Rennes, France) * Cristian Riveros (Pontificia Universidad Cat?lica de Chile, Chile) * Davide Sangiorgi (University of Bologna and Inria, Italy) * Lijun Zhang (Institute of Software, Chinese Academy of Sciences, China) =============================== ICALP 2021 Organizing Committee =============================== Simon Gay, Conference Chair Oana Andrei Ornela Dardha Jessica Enright David Manlove Kitty Meeks Alice Miller Gethin Norman Sofiat Olaosebikan Michele Sevegnani From andrei.paskevich at lri.fr Fri Jan 8 12:52:48 2021 From: andrei.paskevich at lri.fr (Andrei Paskevich) Date: Fri, 8 Jan 2021 18:52:48 +0100 Subject: [TYPES/announce] F-IDE 2021 - 2nd Call for Papers Message-ID: An embedded and charset-unspecified text was scrubbed... Name: not available URL: From michael.greenberg at pomona.edu Fri Jan 8 14:19:11 2021 From: michael.greenberg at pomona.edu (Michael Greenberg) Date: Fri, 08 Jan 2021 11:19:11 -0800 Subject: [TYPES/announce] POPL 2021 - Talks are live! - Second Call for Participation Message-ID: POPL 2021 Call for Participation (https://popl21.sigplan.org/) Important Dates: Sun 10 Jan 2021 Early registration ends Sun 17 - Tue 19 Jan 2021 Co-located events Wed 20 - Fri 22 Jan 2021 POPL General chair: Andreas Podelski Program chair: Azadeh Farzan Organizing committee: https://popl21.sigplan.org/committee/POPL-2021-organizing-committee PC members: https://popl21.sigplan.org/committee/POPL-2021-research-papers-program-committee Talk videos: https://app.clowdr.org/conference/popl2021 LIVE and PUBLIC Accepted papers: https://popl21.sigplan.org/track/POPL-2021-research-papers#event-overview Program: https://popl21.sigplan.org/program/program-POPL-2021 Registration: https://regmaster.com/2021conf/POPL21/register.php # POPL videos are live Whether or not you register, you can watch all of the POPL talks on Clowdr: https://app.clowdr.org/conference/popl2021 Browse the five-minute "lightning" talks, watch the full thirty-minute talks, and check out the student videos in the SRC. All talks offer subtitles. # How to POPL in 2021 Detailed information: https://popl21.sigplan.org/venue/POPL-2021-venue POPL 2021 was set to be in Copenhagen, Denmark. Instead, it?ll be on the Clowdr virtual conference platform. You can register now, with early registration until January 10th (just two days from now). A discounted option is available on the registration page for those unable to pay the full registration fee. ## When does the conference take place? POPL 2021 will take place from Wednesday, January 20th through Friday, January 22nd. Co-located events will start on Sunday, January 17th. Asynchronous chat will open no later than January 16th, and it will remain open after the conference for at least one month. Live events (including social times) will take place in a narrow time band: 15:15 through 20:00 in Copenhagen?s timezone, Central European Time (CET), which is GMT+1.. Co-located events will also use this time band (from 15:30 to 20:00, to be precise). Each day of the conference, you can attend dedicated social times, plenary sessions (invited talks, awards, etc.), and parallel sessions (two tracks at a time). The plenary and parallel sessions will be broadcast (i.e., a livestream). From Sam.Lindley at ed.ac.uk Fri Jan 8 14:45:44 2021 From: Sam.Lindley at ed.ac.uk (Sam Lindley) Date: Fri, 8 Jan 2021 19:45:44 +0000 Subject: [TYPES/announce] PEPM 2021 - Call for Participation Message-ID: <4967aecb-84fc-1ea1-835e-5a658f8c69c9@ed.ac.uk> -- CALL FOR PARTICIPATION -- ACM SIGPLAN Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM) 2021 =============================================================================== * Website : https://popl21.sigplan.org/home/pepm-2021 * Time : 18th--19th January 2021 * Place : Online (co-located with POPL 2021) Registration ------------ https://popl21.sigplan.org/attending/Registration The registration fee for POPL and all associated events (including PEPM) is a nominal US$10 (or optionally, if you are willing and able to pay more, some other amount based on your status). Early registration deadline: **Sunday 10th January, 2021** Keynote speakers ---------------- Pat Hanrahan (Stanford) TBC Julia Lawall (Inria) Program manipulation of C code: from partial evaluation to semantic patches for the Linux kernel Mat?? Teji???k (Chordify) Erasure in dependently typed programming Preliminary Schedule -------------------- (All talks are live. All times are CET, i.e. UTC+1.) Monday 18th January 2021 1000--1030 A functional Abstraction of Type Trails Kenichi Asai, *Youyou Cong*, Chiaki Ishio 1030--1100 A Text-based Syntax Completion Method Using LR Parsing *Isao Sasano*, Kwanghoon Choi 1100--1130 break 1130--1200 Coq to C Translation with Partial Evaluation Akira Tanaka 1200--1230 Counterexample Generation for Program Verification based on Ownership Refinement Types *Hideto Ueno*, John Toman, Naoki Kobayashi, Takeshi Tsukada 1230--1330 break 1330--1400 Control Flow Obfuscation for Featherweight Java using Continuation Passing Kenny Zhuo Ming Lu 1400--1430 Efficient Fair Conjunction for Structurally-Recursive Relations Petr Lozov, Dmitri Boulytchev 1430--1500 break 1500--1600 keynote 1 Program manipulation of C code: from partial evaluation to semantic patches for the Linux kernel Julia Lawall (Inria) Tuesday 19th January 2021 1500--1600 keynote 2 Erasure in dependently typed programming Mat?? Teji???k (Chordify) 1600--1630 break 1630--1700 Staged Effects and Handlers for Modular Languages with Abstraction *Casper Bach Poulsen*, Cas van der Rest, Tom Schrijvers 1700--1730 Automatic Differentiation via Effects and Handlers: An Implementation in Frank Jesse Sigal 1730--1800 break 1800--1830 A Type-Safe Structure Editor Calculus Christian Godiksen, Thomas Herrmann, Hans H?ttel, Mikkel Korup Lauridsen, Iman Owliaie 1830--1900 Strictly Capturing Non-Strict Closures Zachary Sullivan, Paul Downen, Zena M. Ariola 1900--1930 break 1930--2030 keynote 3 TBC Pat Hanrahan (Stanford) Best paper award ---------------- PEPM 2021 continues the tradition of a Best Paper award. The winner will be announced at the workshop. The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From dimitrova at cispa.de Sat Jan 9 07:58:17 2021 From: dimitrova at cispa.de (Dimitrova, Rayna) Date: Sat, 9 Jan 2021 12:58:17 +0000 Subject: [TYPES/announce] ATVA 2021 - Call for Workshops Message-ID: <7BAE8C17-FEA8-4CC8-B055-956D1F55F494@cispa.de> ATVA 2021: The 19th International Symposium on Automated Technology for Verification and Analysis October 18-22 2021, Gold Coast, Australia CALL FOR WORKSHOPS https://formal-analysis.com/atva/2021/workshop.html IMPORTANT DATES All deadlines are AoE (Anywhere on Earth). PROPOSALS - Proposals are due by email to the Workshop chairs: 28 February 2021 - Organizers will be notified about the participation: 15 March 2021 CONFERENCE - Workshops: October 18, 2021 - Main conference: October 19-22, 2021 WORKSHOP PROPOSAL SUBMISSION The ATVA 2021 organizing committee invites proposals for workshops that will complement the main conference. The topics of the workshops should fall within the scope of ATVA. This encompasses all theoretical and practical aspects of automated analysis, synthesis, and verification of hardware and software systems. We particularly encourage submissions from workshops on topics related to testing, analysis, verification, and security (TAVS) of machine learning (ML) systems. ATVA 2021 Workshops will be held on October 18, before the main conference. Workshop proposals will be reviewed by the Workshop Chairs along with the program and general chairs. Proposals must consist of the following three parts: PART I: TECHNICAL INFORMATION A short (about 1 page) scientific justification of the proposed topic, its significance and relevance to ATVA, and the particular benefits of the workshop to the ATVA community, as well as a list of previous or related workshops (if relevant). PART II: ORGANIZATIONAL INFORMATION - Contact information of the workshop organizers - Main contact for the workshop (i.e., a workshop chair) - Estimate of the audience size - Proposed format and agenda (e.g., demo sessions, tutorials, etc.) - Potential invited speakers (if known) - Procedures for selecting papers and participants - Plans for dissemination, if any (e.g., special issues of journals) - Special technical, AV, or USB stick needs - Links to a preliminary website of the workshop and call for papers (if possible) - Information if workshop has been previously held PART III: VIRTUAL WORKSHOP INFORMATION A paragraph describing how the workshop will proceed in the case that the conference meeting is virtual. This includes the form of participation (if different from the physical meeting), video conferencing requirements, time zone preferences, etc. EVALUATION CRITERIA The workshop proposals will be reviewed and evaluated on the following criteria: - Potential to advance the state of the art in automated verification and analysis technologies - Ability to break new ground and create bridges with other disciplines - Relevance to ATVA - Overlap of topics with other proposed workshops - Past successes of the workshop and association with previous conferences - Organizers' ability and experience to lead a successful workshop All accepted workshops will be asked to provide a webpage, call for papers, and a list of invited speakers. (The workshop participants will be required to register for the workshop through the ATVA main registration page.) CONTACT For any questions please contact the workshop chairs: Rayna Dimitrova (dimitrova at cispa.de) and Guy Katz (guykatz at cs.huji.ac.il). -------------- next part -------------- An HTML attachment was scrubbed... URL: From j.a.perez at rug.nl Mon Jan 11 01:03:00 2021 From: j.a.perez at rug.nl (Jorge A. Perez) Date: Mon, 11 Jan 2021 07:03:00 +0100 Subject: [TYPES/announce] PhD scholarship on Concurrency and Logic Message-ID: [Please share widely with potential candidates; apologies for any cross-postings.] PHD SCHOLARSHIP ON ?CONCURRENCY AND LOGIC? University of Groningen, The Netherlands (Posted: January 10, 2021) Supervisors: - Prof. Barteld Kooi (https://www.philos.rug.nl/~barteld/) - Prof. Jorge A. P?rez (https://www.jperez.nl) We seek excellent candidates for one four-year PhD scholarship on the topics of message-passing concurrency, modal logic, and type systems. The PhD scholarship concerns the interdisciplinary project "Knowledge is Power: Reliable Communicating Software by Epistemic Logics", supported by the Young Academy Groningen (https://www.rug.nl/research/young-academy/). Details on the PhD Scholarship program can be found here: https://www.rug.nl/education/phd-programmes/phd-scholarship-programme/ The starting point of the proposed research is "propositions as sessions", a remarkable principle that connects concurrency and logic in the style of the well-known Curry-Howard correspondence. In this project, you will enhance the expressiveness of analysis techniques for message-passing programs by incorporating forms of knowledge and belief in formal specifications of communicating programs. To this end, you will develop new extensions of "propositions as sessions" by exploiting elements from epistemic logics and modal logics. - Qualifications You have an MSc degree (or equivalent) in Computer Science, (Philosophical) Logic, Mathematics, or Artificial Intelligence, with proven experience in at least two of the following: - Modal logics and (their) proof theory - Concurrency theory and/or process calculi - Semantics of programming languages - Program verification and type systems - The Curry-Howard correspondence - Application Details on the application procedure will be made available shortly at https://www.rug.nl/about-us/work-with-us/ You will be asked to provide the following documents: 1. A brief letter of motivation 2. A CV, including contact details of two academic referees 3. A research proposal of max. 1500 words 4. A certified transcript of records 5. Scan of diploma/transcripts - Additional Information Prospective applicants are strongly encouraged to contact the supervisors for further details on the research project and also advice on how to prepare their applications: - Prof. Barteld Kooi (b.p.kooi[at]rug.nl) - Prof. Jorge A. P?rez (j.a.perez[at]rug.nl) From elaine.pimentel at gmail.com Mon Jan 11 06:20:41 2021 From: elaine.pimentel at gmail.com (Elaine Pimentel) Date: Mon, 11 Jan 2021 08:20:41 -0300 Subject: [TYPES/announce] LFMTP 2021 - 1st call for papers Message-ID: ============================================================= Call for papers Logical Frameworks and Meta-Languages: Theory and Practice LFMTP 2021 Pittsburgh, USA, 16 July 2021 Affiliated with CADE-28 http://lfmtp.org/workshops/2021/ ============================================================= Abstract submission deadline: 19 April 2021 Paper submission deadline: 26 April 2021 Logical frameworks and meta-languages form a common substrate for representing, implementing and reasoning about a wide variety of deductive systems of interest in logic and computer science. Their design, implementation and their use in reasoning tasks, ranging from the correctness of software to the properties of formal systems, have been the focus of considerable research over the last two decades. This workshop will bring together designers, implementors and practitioners to discuss various aspects impinging on the structure and utility of logical frameworks, including the treatment of variable binding, inductive and co-inductive reasoning techniques and the expressiveness and lucidity of the reasoning process. LFMTP 2021 will provide researchers a forum to present state-of-the-art techniques and discuss progress in areas such as the following: * Encoding and reasoning about the meta-theory of programming languages, logical systems and related formally specified systems. * Theoretical and practical issues concerning the treatment of variable binding, especially the representation of, and reasoning about, datatypes defined from binding signatures. * Logical treatments of inductive and co-inductive definitions and associated reasoning techniques, including inductive types of higher dimension in homotopy type theory * Graphical languages for building proofs, applications in geometry, equational reasoning and category theory. * New theory contributions: canonical and substructural frameworks, contextual frameworks, proof-theoretic foundations supporting binders, functional programming over logical frameworks, homotopy and cubical type theory. * Applications of logical frameworks: proof-carrying architectures, proof exchange and transformation, program refactoring, etc. * Techniques for programming with binders in functional programming languages such as Haskell, OCaml or Agda, and logic programming languages such as lambda Prolog or Alpha-Prolog. LFMTP 2021 will hold a special session in honour of Frank Pfenning. Important Dates Abstract submission deadline: Monday April 19 Submission deadline: Monday April 26 Notification to authors: Monday May 31 Final version due: Monday June 14 Workshop date: Friday July 16 Submission In addition to regular papers, we welcome/encourage the submission of "work in progress" reports, in a broad sense. Those do not need to report fully polished research results, but should be of interest for the community at large. Submitted papers should be in PDF, formatted using the EPTCS style guidelines. The length is restricted to 15 pages for regular papers and 8 pages for "Work in Progress" papers. Submission is via EasyChair: https://easychair.org/conferences/?conf=lfmtp2021 Proceedings A selection of the presented papers will be published online in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Program Committee * David Baelde (LSV, ENS Paris-Saclay & Inria Paris) * Alberto Ciaffaglione (University of Udine) * Claudio Sacerdoti Coen (University of Bologna) * Marina Lenisa (Universit? degli Studi di Udine) * Dennis M?ller (Friedrich-Alexander-University) * Michael Norrish (CSIRO) * Elaine Pimentel (Universidade Federal do Rio Grande do Norte) co-chair * Ulrich Sch?pp (fortiss GmbH) * Kathrin Stark (Princeton University) * Aaron Stump (The University of Iowa) * Nora Szasz (Universidad ORT Uruguay) * Enrico Tassi (Inria) co-chair * Alwen Tiu (The Australian National University) * Tjark Weber (Uppsala University) Invited Speakers TBA -- Elaine. ------------------------------------------------- Elaine Pimentel - DMAT/UFRN Address: Departamento de Matem?tica Universidade Federal do Rio Grande do Norte Campus Universit?rio - Av. Senador Salgado Filho, s/n? Lagoa Nova, CEP: 59.078-970 - Natal - RN Phone: +55 84 3215-3820 http://sites.google.com/site/elainepimentel/ Lattes: http://lattes.cnpq.br/3298246411086415 -------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From fioravanti at unich.it Mon Jan 11 13:50:33 2021 From: fioravanti at unich.it (Fabio Fioravanti) Date: Mon, 11 Jan 2021 19:50:33 +0100 Subject: [TYPES/announce] CfP HCVS 2021 @ ETAPS Message-ID: <2fb165c4-31a9-6711-86cc-e791d45583b8@unich.it> (apologies for multiple copies) Call for Papers *8th Workshop on Horn Clauses for Verification and Synthesis (HCVS) **Co-located with ETAPS 2021 https://etaps.org/ https://www.sci.unich.it/hcvs21/ 28 March 2021 - virtual only Invited speakers: TBA. Please visit the webpage for updates. Submission deadlines: - Paper submission: Jan 28, 2021 - Paper notification: Feb 27, 2021 - Workshop: Mar 28, 2021 Many Program Verification and Synthesis problems of interest can be modelled directly using Horn clauses and many recent advances in the CLP and CAV communities have centred around efficiently solving problems presented as Horn clauses. This series of workshops aims to bring together researchers working in the two communities of Constraint/Logic Programming (e.g., ICLP and CP), Program Verification (e.g., CAV, TACAS, and VMCAI), and Automated Deduction (e.g., CADE, IJCAR), on the topic of Horn clause based analysis, verification, and synthesis. Horn clauses for verification and synthesis have been advocated by these communities at different times and from different perspectives and HCVS is organized to stimulate interaction and a fruitful exchange and integration of experiences. The workshop follows seven previous meetings: HCVS 2020 in Dublin, Ireland (ETAPS 2020), HCVS 2019 in Prague, Czech Republic (ETAPS 2019), HCVS 2018 in Oxford, UK (CAV, ICLP and IJCAR at FLoC 2018), HCVS 2017 in Gothenburg, Sweden (CADE), HCVS 2016 in Eindhoven, The Netherlands (ETAPS), HCVS 2015 in San Francisco, CA, USA (CAV), and HCVS 2014 in Vienna, Austria (VSL). Topics of interest include, but are not limited to the use of Horn clauses, constraints, and related formalisms in the following areas: -Analysis and verification of programs and systems of various kinds (e.g., imperative, object-oriented, functional, logic, higher-order, concurrent, transition systems, Petri-nets, smart contracts) -Program synthesis -Program testing -Program transformation -Constraint solving -Type systems -Machine learning and automated reasoning -CHC encoding of analysis and verification problems -Resource analysis -Case studies and tools -Challenging problems We solicit regular papers describing the theory and implementation of Horn-clause based analysis and tool descriptions. We also solicit extended abstracts describing work-in-progress, as well as presentations covering previously published results and posters that are of interest to the workshop. CHC Competition HCVS 2021 will host the 4th competition on constraint Horn clauses (CHC-COMP ), which will compare state-of-the-art tools for CHC solving for performance and effectiveness on a set of publicly available benchmarks. A report on the 4th CHC-COMP will be part of the workshop's proceedings. The report also contains tool descriptions of the participating solvers. Program Chairs Bishoksan Kafle, IMDEA Software Institute, Madrid, Spain (co-chair) Hossein Hojjat, Rochester Institute of Technology, NY, USA (co-chair) Program Committee Emanuele De Angelis, IASI-CNR, Italy Gidon Ernst, Ludwig Maximilian University of Munich, Germany John Gallagher, Roskilde University, Denmark Gopal Gupta, University of Texas at Dallas, USA Pedro Lopez-Garcia, CSIC and IMDEA Software Institute, Madrid, Spain Grigory Fedyukovich, Florida State University, USA Fabio Fioravanti, University of Chieti-Pescara, Italy Arie Gurfinkel, University of Waterloo, Canada Ranjit Jhala, University of California San Diego, USA David Monniaux, CNRS, VERIMAG, France Daniel Neider, Max Planck Institute for Software Systems, Germany Steven Ramsay, University of Bristol, UK Philipp Ruemmer, Uppsala University, Sweden Andrey Rybalchenko, Microsoft Research, Cambridge, UK Martin Sch?f, SRI International, USA He Zhu, Rutgers University, New Brunswick, USA The submission has to be done in one of the following formats: -Regular papers (up to 12 pages plus bibliography in EPTCS (http://www.eptcs.org/ ) format), which should present previously unpublished work (completed or in progress), including descriptions of research, tools, and applications. -Tool papers (up to 4 pages in EPTCS format), including the papers written by the CHC-COMP participants, which can outline the theoretical framework, the architecture, the usage, and experiments of the tool. -Extended abstracts (up to 3 pages in EPTCS format), which describe work in progress or aim to initiate discussions. -Presentation-only papers, i.e., papers already submitted or presented at a conference or another workshop. Such papers can be submitted in any format, and will not be included in the workshop post-proceedings. -Posters that are of interest to the workshop All submitted papers will be refereed by the program committee and will be selected for inclusion in accordance with the referee reports. Accepted regular papers and extended abstracts will be published electronically as a volume in the Electronic Proceedings in Theoretical Computer Science (EPTCS) series, see http://www.eptcs.org/ (provided that enough regular papers are accepted). Papers must be submitted through the EasyChair system using the web page: https://easychair.org/conferences/?conf=hcvs2021 From nqd.lisa at gmail.com Tue Jan 12 10:48:38 2021 From: nqd.lisa at gmail.com (Lisa Nguyen Quang Do) Date: Tue, 12 Jan 2021 16:48:38 +0100 Subject: [TYPES/announce] Call for workshops: 35th European Conference on Object-Oriented Programming (ECOOP'21) & 30th ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA'21) Message-ID: ================================================================== The 30th Edition of ISSTA and the 35th Edition of ECOOP Call for Workshops 12th-16th July 2021 Aarhus, Denmark https://conf.researchr.org/track/ecoop-issta-2021/ecoop-issta-2021-workshops ================================================================== ECOOP is a conference about programming. Originally its primary focus was on object orientation, but now it looks at a much broader range of programming topics. Areas of interest include the design, implementation, optimization, analysis, testing, verification, and theory of programs, programming languages, and programming environments. Papers may focus on new tools (e.g., language implementations, program analyses, runtime systems), techniques (e.g., code organization approaches, methodologies), principles (e.g., semantics, proofs, paradigms), evaluations (e.g., experiments, corpora analyses, user studies), or some combination of the above. ECOOP solicits both innovative and creative solutions to real problems as well as evaluations of existing solutions that provide new insights. It also encourages the submission of reproduction studies. ISSTA is the leading research symposium on software testing and analysis, bringing together academics, industrial researchers, and practitioners to exchange new ideas, problems, and experience on how to analyze and test software systems. Both conferences will be co-located in Aarhus, Denmark, on July 12-16, 2021. Call for Workshops ================ ECOOP and ISSTA will host a diverse offering of workshops bringing together academics, industrial researchers, and practitioners to exchange new ideas, problems, and experiences. Topics for workshops may include, but are not limited to, the theory, design, implementation, optimization, testing, and analysis of programs and programming languages. Workshop organizers are encouraged to take advantage of the co-location of the two conferences to broaden participation and offer topics that may be of interest to multiple communities. To submit a proposal for an ECOOP/ISSTA workshop, please complete the online application form linked to below. After submitting, you will receive an automated email confirmation of your submission and, within four weeks, a formal response notifying you if the workshop has been accepted for ECOOP/ISSTA. Proposals will be reviewed on a rolling basis until January 31, 2021. Link to Online Application Form: https://forms.gle/acnyGJTRaVKa9Rku5 Each workshop must conform to the following schedule constraints: - The workshop?s website must be live within two weeks of notification of the workshop?s acceptance and include relevant information about any call for papers. - The paper submission date for the workshop must be at least one week after the final technical paper notification date for both main conferences, i.e. the earliest workshop submission date can be April 26th, 2021. - Final notification dates for paper acceptance to workshops must be at least 3 days before the early registration period ends. More Information ================ For additional information, please visit the website [1] or contact the chairs Maria Christakis [2] and Marcel B?hme [3]. [1] https://conf.researchr.org/track/ecoop-issta-2021/ecoop-issta-2021-workshops . [2] maria at mpi-sws.org [3] marcel.boehme at acm.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From m.backens at cs.bham.ac.uk Wed Jan 13 09:18:30 2021 From: m.backens at cs.bham.ac.uk (Miriam Backens) Date: Wed, 13 Jan 2021 14:18:30 +0000 Subject: [TYPES/announce] =?utf-8?q?CFP_Quantum_Physics_and_Logic_=28QPL_?= =?utf-8?q?2021=29=2C_June_7-11=2C_Gda=C5=84sk_=26_online?= Message-ID: <725db8c4-62c0-7b50-b247-24af70d60b21@cs.bham.ac.uk> *18th International Conference on Quantum Physics and Logic (QPL 2021), June 7-11, 2021. Gda?sk, Poland and online* CALL FOR PAPERS QPL is an annual conference that brings together researchers working on mathematical foundations of quantum physics, quantum computing, and related areas, with a focus on structural perspectives and the use of logical tools, ordered algebraic and category-theoretic structures, formal languages, semantical methods, and other computer science techniques applied to the study of physical behaviour in general. Work that applies structures and methods inspired by quantum theory to other fields (including computer science) is also welcome. QPL 2021 will be held both virtually online and physically in Gdansk (COVID permitting). INVITED SPEAKERS Matty Hoban Flaminia Giacomini Anna Jencova Hl?r Kristj?nsson Ariel Bendersky Martha Lewis IMPORTANT DATES Submission deadline: February 12, 2021 Author notification: March 31, 2021 Early registration: May 14, 2021 Proceedings paper ready: May 28, 2021 Conference: June 7-11, 2021 SUBMISSION GUIDELINES Recent work that is relevant to the conference is solicited in one (or more) of three tracks: * Proceedings submissions consist of a 5-12 page extended abstract. Only proceedings-track submissions are eligible to be published in Electronic Proceedings in Theoretical Computer Science (EPTCS) after the conference. * Non-proceedings submissions consist of a 3 page extended abstract and a link to a separate published paper, pre-print, or an attached draft. * Poster submissions consist of a 1-3 page abstract and may contain a link to a separate published paper or pre-print. Submission of partial results of work in progress is encouraged. Submissions should be prepared using LaTeX, and must be submitted in PDF format. Use of the EPTCS style is encouraged. Submission is done via EasyChair: https://www.easychair.org/conferences/?conf=qpl2021 BEST STUDENT PAPER There will be an award for the best student paper at the discretion of the programme committee. Papers eligible for the award are those where all the authors are students at the time of submission. PROGRAMME COMMITTEE Antonio Acin Barbara Amaral Pablo Arrighi Miriam Backens (co-chair) Jonathan Barrett Alessandro Bisio Anne Broadbent Ulysse Chabaud Bob Coecke Alejandro Diaz-Caro Ross Duncan Yuan Feng Alexandru Gheorghiu Stefano Gogioso Teiko Heinosaari Chris Heunen (co-chair) Matthew Hoban Kohei Kishida Aleks Kissinger Ravi Kunjwal Ciaran Lee Matt Leifer Martha Lewis Shane Mansfield Simon Martiel Hector Miller-Bakewell Mio Murao Glaucia Murta Ognyan Oreshkov Prakash Panangaden Simon Perdrix Lidia del Rio Julien Ross Mehrnoosh Sadrzadeh Ana Bele?n Sainz John Selby Rui Soares Barbosa Rob Spekkens Isar Stubbe Benoit Valiron Jamie Vicary John van de Wetering Alexander Wilce Mingsheng Ying Vladimir Zamdzhiev Margherita Zorzi -- Dr Miriam Backens (they/them) Lecturer School of Computer Science, University of Birmingham From gtan at cse.psu.edu Wed Jan 13 19:45:47 2021 From: gtan at cse.psu.edu (Gang (Gary) Tan) Date: Wed, 13 Jan 2021 19:45:47 -0500 Subject: [TYPES/announce] (Deadline extended to Feb 7th, 2021) LangSec 2021, affiliated with IEEE S&P Message-ID: <524410e5-6b71-a983-a7a0-14b6597f9b1a@cse.psu.edu> We are extending the LangSec 2021 deadline to Feb 7th, 2021; apologies for multiple postings. Call for Papers 7th Workshop on Language-Theoretic Security (LangSec) Affiliated with 42nd IEEE Symposium on Security and Privacy (Oakland) May 27th, 2021 The Language-Theoretic Security (LangSec) workshop solicits contributions of research papers, work-in-progress reports, and panels related to the growing area of language-theoretic security. Submission Guidelines: see http://langsec.org/spw21/ Submission link: https://easychair.org/conferences/?conf=langsec2021 Important Dates: Research paper submissions due: Feb 7th 2021, AOE Work-in-progress reports and panels submissions due: ? Feb 7th 2021, AOE Notification to authors: Feb 28th 2021 Camera ready: March 15 2021 Topics: LangSec posits that the only path to trustworthy computer software that takes untrusted inputs is treating all valid or expected inputs as a formal language, and the respective input-handling routine as a parser for that language. The parsing must be feasible, and the parser must match the language in required computation power and convert the input for the consumption of subsequent computation. The 7th installation of the workshop will continue the tradition and further focus on research that apply the language-theoretic perspective to policy mechanisms, such as treating policy formulation and enforcement as language definition and language recognition problems. The following is a non-exhaustive list of topics that are of relevance to LangSec: * formalization of vulnerabilities and exploits in terms of language ? theory * inference of formal language specifications of data from samples * generation of secure parsers from formal language specifications * complexity hierarchy of verifying parser implementations * science of protocol design: layering, fragmentation and re-assembly, ? extensibility, etc. * architectural constructs for enforcing limits on computational ? complexity * empirical data on programming language features/programming styles ? that affect bug introduction rates (e.g., syntactic redundancy) * systems architectures and designs based on LangSec principles * computer languages, file formats, and network protocols built on ? LangSec principles * re-engineering efforts of existing languages, formats, and protocols ? to reduce computational power Chairs PC co-chair: Gang Tan (Pennsylvania State University) PC co-chair: Sergey Bratus (Dartmouth College) Contact: All questions about submissions should be emailed to the PC chairs: Gang Tan (gtan at psu.edu) and Sergey Bratus (sergey at cs.dartmouth.edu) -- Gang (Gary) Tan Professor, Penn State CSE and ICDS W358 Westgate Building http://www.cse.psu.edu/~gxt29 Tel:814-8657364 -------------- next part -------------- An HTML attachment was scrubbed... URL: From nqd.lisa at gmail.com Thu Jan 14 04:38:42 2021 From: nqd.lisa at gmail.com (Lisa Nguyen Quang Do) Date: Thu, 14 Jan 2021 10:38:42 +0100 Subject: [TYPES/announce] Call for papers: 30th ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA'21) Message-ID: ============================================================ The 30th Edition of ISSTA Call for Papers 12th-16th July 2021 Aarhus, Denmark https://conf.researchr.org/home/issta-2021 Co-located with ECOOP 2021 ============================================================ The ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA) is the leading research symposium on software testing and analysis, bringing together academics, industrial researchers, and practitioners to exchange new ideas, problems, and experience on how to analyze and test software systems. ISSTA 2021 will be held in Aarhus, Denmark, on July 12-16, 2021, co-located with ECOOP 2021 [1]. 2021 will mark the 30th edition of ISSTA. Technical Papers =================== Authors are invited to submit research papers describing original contributions in testing or analysis of computer software. Papers describing original theoretical or empirical research, new techniques, methods for emerging systems, in-depth case studies, infrastructures of testing and analysis, or tools are welcome. Experience Papers =================== Authors are invited to submit experience papers describing a significant experience in applying software testing and analysis methods or tools and should carefully identify and discuss important lessons learned so that other researchers and/or practitioners can benefit from the experience. Of special interest are experience papers that report on industrial applications of software testing and analysis methods or tools. Reproducibility Studies =================== ISSTA would like to encourage researchers to reproduce results from previous papers. A reproducibility study must go beyond simply re-implementing an algorithm and/or re-running the artifacts provided by the original paper. It should at the very least apply the approach to new, significantly broadened inputs. Particularly, reproducibility studies are encouraged to target techniques that previously were evaluated only on proprietary subject programs or inputs. A reproducibility study should clearly report on results that the authors were able to reproduce as well as on aspects of the work that were irreproducible. In the latter case, authors are encouraged to make an effort to communicate or collaborate with the original paper?s authors to determine the cause for any observed discrepancies and, if possible, address them (e.g., through minor implementation changes). We explicitly encourage authors to not focus on a single paper/artifact only, but instead to perform a comparative experiment of multiple related approaches. In particular, reproducibility studies should follow the ACM guidelines on reproducibility (different team, different experimental setup): The measurement can be obtained with stated precision by a different team, a different measuring system, in a different location on multiple trials. For computational experiments, this means that an independent group can obtain the same result using artifacts which they develop completely independently. This means that it is also insufficient to focus on repeatability (i.e., same experiment) alone. Reproducibility Studies will be evaluated according to the following standards: - Depth and breadth of experiments - Clarity of writing - Appropriateness of conclusions - Amount of useful, actionable insights - Availability of artifacts We expect reproducibility studies to clearly point out the artifacts the study is built on, and to submit those artifacts to artifact evaluation (see below). Artifacts evaluated positively will be eligible to obtain the highly prestigious badges Results Replicated or Results Reproduced. Submissions Guideline =================== Submissions must be original and should not have been published previously or be under consideration for publication while being evaluated for this symposium. Authors are required to adhere to the ACM Policy and Procedures on Plagiarism and the ACM Policy on Prior Publication and Simultaneous Submissions. More details are available at the Submission Policies page. Research and Experience Papers as well as Reproducibility Studies should be at most 10 pages in length, with at most 2 additional pages for references. Experience papers and reproducibility studies should clearly specify their category in the paper title upon submission, e.g., ?XXX (Experience Paper)?. All authors should use the official ?ACM Master article template?, which can be obtained from the ACM Proceedings Template pages [2]. Latex users should use the ?sigconf? option, as well as the ?review? (to produce line numbers for easy reference by the reviewers) and ?anonymous? (omitting author names) options. To that end, the following latex code can be placed at the start of the latex document: \documentclass[sigconf,review, anonymous]{acmart} \acmConference[ISSTA 2021]{ACM SIGSOFT International Symposium on Software Testing and Analysis}{12-16 July, 2021}{ Aarhus, Denmark} Submit your papers via the HotCRP ISSTA 2021 submission website [3]. Double-blind Reviewing =================== ISSTA 2021 will conduct double-blind reviewing. Submissions should not reveal the identity of the authors in any way. Authors should leave out author names and affiliations from the body of their submission. They should also ensure that any citations to related work by themselves are written in third person, that is, ?the prior work of XYZ? as opposed to ?our prior work?. Double-blind reviewing should not hinder the usual communication of results. But, during the review period, please don?t broadcast the work on social media. Also, to the extent to which this is possible, please avoid publishing the preprint of your work (e.g., on arXiv or on your website) until it is accepted for publication. In exceptional cases this might be required, but then please avoid spreading the paper more actively. Authors with further questions on double-blind reviewing are encouraged to contact the Program Chair by email. Supplementary Material =================== Authors are free to provide supplementary material if that material supports the claims in the paper. Such material may include proofs, experimental results, and/or data sets. This material should be uploaded at the same time as the submission. Any supplementary material must also be anonymized. Reviewers are not required to examine the supplementary material but may refer to it if they would like to find further evidence supporting the claims in the paper. Reviews and Responses =================== Each paper will receive three reviews, followed by an author response. After the response, some papers might receive additional reviews where necessary, to which authors can respond in a second author-response phase. Important Dates =============== - Paper submission: 29 January 2021 (Fri) - Author response: 24-27 March 2021 (Wed?Sat) - Additional response: 08-09 April 2021 (Thu-Fri) - Author notification: 19 April 2021 (Mon) More Information ================ For additional information, please visit the ISSTA?21 website [4]. [1] https://conf.researchr.org/home/ecoop-2021 [2] https://www.acm.org/publications/proceedings-template [3] https://issta2021.hotcrp.com/ [4] https://conf.researchr.org/home/issta-2021 -------------- next part -------------- An HTML attachment was scrubbed... URL: From jes at math.uminho.pt Mon Jan 18 12:54:36 2021 From: jes at math.uminho.pt (=?UTF-8?Q?Jos=c3=a9_Carlos_Esp=c3=adrito_Santo?=) Date: Mon, 18 Jan 2021 17:54:36 +0000 Subject: [TYPES/announce] Hiring of researcher by University of Minho Message-ID: <008e338a-3ebb-5387-f060-16d967d0a436@math.uminho.pt> An international selection tender is open for recruitment of a researcher by the Centre of Mathematics, University of Minho, Portugal. One of the domains of interest is Logic. The Centre has a research group interested in proof theory, type theory and lambda-calculus. The researcher must hold a PhD degree completed at least 5 years ago. The contract has maximum duration of 4 years. The call is open until?the 28th of January 2021. The formal announcement is available at http://www.cmat.uminho.pt/Default.aspx?lang=en-US For further inquiries, please contact Jose Espirito Santo: jes AT math.uminho.pt From bishoksan at gmail.com Mon Jan 18 22:30:30 2021 From: bishoksan at gmail.com (bishoksan kafle) Date: Tue, 19 Jan 2021 14:30:30 +1100 Subject: [TYPES/announce] CFP HCVS 2021 Message-ID: (apologies for multiple copies) Call for Papers 8th Workshop on Horn Clauses for Verification and Synthesis (HCVS) Co-located with ETAPS 2021 28 March 2021 - Virtual https://www.sci.unich.it/hcvs21/ Invited speakers: TBA. Please visit the webpage for updates. Submission deadlines: - Paper submission: Jan 28, 2021 - Paper notification: Feb 27, 2021 - Workshop: Mar 28, 2021 Many Program Verification and Synthesis problems of interest can be modelled directly using Horn clauses and many recent advances in the CLP and CAV communities have centred around efficiently solving problems presented as Horn clauses. This series of workshops aims to bring together researchers working in the two communities of Constraint/Logic Programming (e.g., ICLP and CP), Program Verification (e.g., CAV, TACAS, and VMCAI), and Automated Deduction (e.g., CADE, IJCAR), on the topic of Horn clause based analysis, verification, and synthesis. Horn clauses for verification and synthesis have been advocated by these communities at different times and from different perspectives and HCVS is organized to stimulate interaction and a fruitful exchange and integration of experiences. The workshop follows seven previous meetings: HCVS 2020 in Dublin, Ireland (ETAPS 2020), HCVS 2019 in Prague, Czech Republic (ETAPS 2019), HCVS 2018 in Oxford, UK (CAV, ICLP and IJCAR at FLoC 2018), HCVS 2017 in Gothenburg, Sweden (CADE), HCVS 2016 in Eindhoven, The Netherlands (ETAPS), HCVS 2015 in San Francisco, CA, USA (CAV), and HCVS 2014 in Vienna, Austria (VSL). Topics of interest include, but are not limited to the use of Horn clauses, constraints, and related formalisms in the following areas: -Analysis and verification of programs and systems of various kinds (e.g., imperative, object-oriented, functional, logic, higher-order, concurrent, transition systems, Petri-nets, smart contracts) -Program synthesis -Program testing -Program transformation -Constraint solving -Type systems -Machine learning and automated reasoning -CHC encoding of analysis and verification problems -Resource analysis -Case studies and tools -Challenging problems We solicit regular papers describing the theory and implementation of Horn-clause based analysis and tool descriptions. We also solicit extended abstracts describing work-in-progress, as well as presentations covering previously published results and posters that are of interest to the workshop. CHC Competition: HCVS 2021 will host the 4th competition on constraint Horn clauses ( CHC-COMP ), which will compare state-of-the-art tools for CHC solving for performance and effectiveness on a set of publicly available benchmarks. A report on the 4th CHC-COMP will be part of the workshop's proceedings. The report also contains tool descriptions of the participating solvers. Program Committee: - Bishoksan Kafle , IMDEA Software Institute, Madrid, Spain (co-chair) - Hossein Hojjat , Rochester Institute of Technology, NY, USA (co-chair) - Gopal Gupta , University of Texas at Dallas, USA - John Gallagher , Roskilde University, Denmark - Philipp Ruemmer , Uppsala University, Sweden - Andrey Rybalchenko , Microsoft Research, Cambridge, UK - Pedro Lopez-Garcia , CSIC and IMDEA Software Institute, Madrid, Spain - Emanuele De Angelis , IASI-CNR, Italy - Fabio Fioravanti , University of Chieti-Pescara, Italy - Daniel Neider , Max Planck Institute for Software Systems, Germany - Arie Gurfinkel , University of Waterloo, Canada - Ranjit Jhala , University of California San Diego, USA - Martin Sch?f , SRI International, USA - He Zhu , Rutgers University, New Brunswick, USA - Steven Ramsay , University of Bristol, UK - Grigory Fedyukovich , Florida State University, USA - Gidon Ernst , Ludwig Maximilian University of Munich, Germany - David Monniaux , CNRS, VERIMAG, France - Jorge A. Navas , SRI International, USA The submission has to be done in one of the following formats: -Regular papers (up to 12 pages plus bibliography in EPTCS (http://www.eptcs.org/) format), which should present previously unpublished work (completed or in progress), including descriptions of research, tools, and applications. -Tool papers (up to 4 pages in EPTCS format), including the papers written by the CHC-COMP participants, which can outline the theoretical framework, the architecture, the usage, and experiments of the tool. -Extended abstracts (up to 3 pages in EPTCS format), which describe work in progress or aim to initiate discussions. -Presentation-only papers, i.e., papers already submitted or presented at a conference or another workshop. Such papers can be submitted in any format, and will not be included in the workshop post-proceedings. -Posters that are of interest to the workshop All submitted papers will be refereed by the program committee and will be selected for inclusion in accordance with the referee reports. Accepted regular papers and extended abstracts will be published electronically as a volume in the Electronic Proceedings in Theoretical Computer Science (EPTCS) series, see http://www.eptcs.org/ (provided that enough regular papers are accepted). Papers must be submitted through the EasyChair system using the web page: https://easychair.org/conferences/?conf=hcvs2021 -- The race is not always won by the fastest runner, but sometimes by those who just keep running. -------------- next part -------------- An HTML attachment was scrubbed... URL: From acie at acie.eu Tue Jan 19 08:58:33 2021 From: acie at acie.eu (acie at acie.eu) Date: Tue, 19 Jan 2021 14:58:33 +0100 Subject: [TYPES/announce] Final CfP. CiE 2021: Connecting with computability Message-ID: <0cacc1568e2143287eca59fd632dec0c@acie.eu> (Apologies for multiple postings.) ========================= FINAL CALL FOR PAPERS: ========================= CiE 2021: Connecting with computability 5 - 9 July 2021 website: www.CiE2021.ugent.be [1] **Due to the current pandemic CiE 2021 will be held as a virtual conference.** CiE 2021 is the seventeenth conference organized by the Association Computability in Europe. The /Computability in Europe/ conference (CiE) series has built up a strong tradition for developing a scientific program which is interdisciplinary at its core bringing together all aspects of computability and foundations of computer science, as well as the interplay of these theoretical areas with practical issues in CS and other disciplines such as biology, mathematics, history, philosophy, and physics. For more information about the CiE conferences and the Association CiE, please have a look at: https://www.acie.eu/ [2]. CiE 2021 will be the second CiE conference that is organized as a virtual event and aims at a high-quality meeting that allows and invites active participation from all participants. It will be hosted virtually by Ghent University. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010), Sofia (2011), Cambridge (2012), Milan (2013), Budapest (2014), Bucharest (2015), Paris (2016), Turku (2017), Kiel (2018), Durham (2019) and virtually in Salerno (2020) PLENARY SPEAKERS ========================= * Laura Crosilla (University of Oslo, Norway) * Markus Lohrey (Universit?t Siegen. Germany) * Russell Miller (tutorial speaker, CUNY, US) * Joan Rand Moschovakis (UCLA, US) * Jo?l Ouaknine (Max Planck Institute for software systems, Germany) * Christine Tasson (tutorial speaker, Universit? Paris Diderot, France) * Keita Yokoyama (Japan Advanced Institute of Science and Technology, Japan) * Henry Yuen (University of Toronto, Canada) SPECIAL SESSIONS ========================= /Church's thesis in constructive mathematics (HaPoC session)/ Marianna Antonutti-Marfori (Ludwig-Maximilians-Universit?t M?nchen, Germany) and Alberto Naibo (Universit? Paris 1 Panth?on-Sorbonne) _/Classical Computability theory: Open problems and solutions/_ Noam Greenberg (Victoria University of Wellington, New Zealand) and Steffen Lempp (University of Wisconsin) Speakers: Marat Faizrakhmanov (Kazan Federal University), Andrea Sorbi (University of Siena), Liang Yu (Nanjing University), Ning Zhong (University of Cincinnati) _/Computational geometry/_ Maike Buchin (Ruhr-Universit?t Bochum, Germany) and Maarten L?ffler (Utrecht University, Netherlands) Speakers: Wolfgang Mulzer (Free University Berlin)_, _Tillmann Miltzow (Utrecht University), Esther Ezra (Bar-Ilan University), Karl Bringmann (Saarland University) /Computational Pangenomics/ Nadia Pisanti (University of Pisa, Italy) and Solon Pissis (University of Amsterdam, Netherlands) Speakers: Francesca Ciccarelli (King's College London, UK), Benedict Paten (University of California Santa Cruz, USA), Brona Brejova (Comenius University in Bratislava, Slovakia), Rayan Chikhi (Pasteur Institute, France) _/Proof theory and computation/_ David Fern?ndez Duque (Ghent University, Belgium) and Juan Pablo Aguilera (Ghent University, Belgium) Speakers: Lorenzo Carlucci (University of Rome I "La Sapienza"), Francesca Poggiolesi (CNRS, Universit? Paris 1 Panth?on-Sorbonne), Yue Yang (National university of Singapore), Leszek Kolodziejczyk (University of Warsa) _/Quantum computation and information/_ Harry Buhrman (Universiteit van Amsterdam, Netherlands) and Frank Verstraete (Ghent University, Belgium) WOMEN IN COMPUTABILITY ========================= The Computability in Europe conference series has a long tradition in setting up a Women in Computability program. For CiE 2021 we plan a Women in Computability workshop combined with an online mentoring program. For more details on the Special Interest Group Women in Computability, see: https://www.acie.eu/cie-conference-series/cie-cs-women-in-computability/ [3] IMPORTANT DATES: ========================= Deadline for article registration (abstract submission): January 17, 2021 Deadline for article submission: February 5, 2021 Notification of acceptance: April 13, 2021 Final versions due: April 27, 2021 Deadline for informal presentations submission: May 1, 2021 The notifications of acceptance for informal presentations will be sent a few days after submission. Please note that article registration is not necessary for article submission. ORGANIZED BY: ========================= Department of Mathematics WE16, Ghent University Organizing Committee: David Fern?ndez-Duque, chair (Ghent University) Juan Pablo Aguilera (Ghent University) David Belanger (Ghent University) Ana Borges (University of Barcelona) Liesbeth De Mol (University of Lille) Andreas Debrouwere (Ghent University) Lorenz Demey (Catholic University of Leuven) Eduardo Hermo-Reyes (University of Barcelona) Christian Michaux (University of Mons) Fedor Pakhomov (Ghent University) Pawel Pawlowski (Ghent University) Frederik Van De Putte (Ghent University) Peter Verd?e (Catholic University of Louvain) Andreas Weiermann (Ghent University) CONTRIBUTED PAPERS: ========================= The Programme Committee cordially invites all researchers (European and non-European) to submit their papers in computability related areas for presentation at the conference and inclusion in the proceedings. Papers building bridges between different parts of the research community are particularly welcome. Papers should be in English and anonymized. They must be submitted in PDF format, using the LNCS style (available at ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip [4]) and should have a maximum of 10 pages, including references but excluding a possible appendix in which one can include proofs and other additional material. Authors should submit their papers electronically using EasyChair: https://easychair.org/conferences/?conf=cie2021 [5] Abstracts should be submitted by January 17th 2021, followed by the full papers to be submitted by February 5 2021. Each submitted paper will be peer-reviewed by a panel of PC members based on originality, significance, technical soundness, clarity of exposition, and relevance for the conference. For each accepted paper, at least one author is required to register for the conference and should plan to present the paper. The CONFERENCE PROCEEDINGS will be published with LNCS, Springer Verlag. INFORMAL PRESENTATIONS: ========================= Continuing the tradition of past CiE conferences, in addition to the formal presentations based on the LNCS proceedings volume, CiE 2021 will host a track of informal presentations, that are prepared very shortly before the conference and inform the participants about current research and work in progress. The deadline for the submission of abstracts for informal presentations is May 1st, 2021. PROGRAMME COMMITTEE ========================= Marianna Antonutti Marfori (Ludwig Maximilian University of Munich) Nathalie Aubrun (CNRS, Universit? Paris-Saclay) Christel Baier (TU Dresden) Nikolay Bazhenov (Sobolev Institute of Mathematics) Marie-Pierre B?al (Universit? Paris-Est) Arnold Beckmann (Swansea University) David B?langer (Ghent University) Joel Day (Loughborough University) Liesbeth De Mol (CNRS, Universit? de Lille, PC co-chair) Carola Doerr (Sorbonne University, CNRS) J?r?me Durand-Lose (Universit? d'Orl?ans) David Fern?ndez-Duque (Ghent University) Zuzana Hanikov? (Academy of Sciences of the Czech Republic) Mathieu Hoyrup (LORIA) Assia Mahboubi (INRIA) Florin Manea (University of G?ttingen) Ir?ne Marcovici (Universit? de Lorraine) Klaus Meer (BTU Cottbus-Senftenberg) Ludovic Patey (Institut Camille Jordan) Cinzia Pizzi (University of Padova) Giuseppe Primiero (University of Milan) Simona Ronchi Della Rocca (Universit? di Torino) Paul Schafer (University of Leeds) Svetlana Selivanova (KAIST) Monika Seisenberger (Swansea University) Alexander Shen (CNRS & Univ. Montpellier 2) Alexandra Soskova (Sofia University) Mariya Soskova (University of Wisconsin-Madison) Frank Stephan (National University of Singapore) Peter Van Emde Boas (Universiteit van Amsterdam) Sergey Verlan (Universit? Paris Est - Cr?teil Val de Marne) Andreas Weiermann (Ghent University, PC co-chair) Damien Woods (Maynooth University) Links: ------ [1] http://www.cie2021.ugent.be/ [2] https://www.acie.eu/ [3] https://www.acie.eu/cie-conference-series/cie-cs-women-in-computability/ [4] ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip [5] https://easychair.org/conferences/?conf=cie2021 -------------- next part -------------- An HTML attachment was scrubbed... URL: From abb at cs.stir.ac.uk Tue Jan 19 14:56:31 2021 From: abb at cs.stir.ac.uk (Andrea Bracciali) Date: Tue, 19 Jan 2021 19:56:31 +0000 Subject: [TYPES/announce] WTSC21 - workshop on trusted smart contracts @ financial crypto Message-ID: <40D2D3F9-6C35-4E46-A2F3-02EC3FC69677@cs.stir.ac.uk> [APOLOGIES FOR CROSS-POSTING / PLEASE DISSEMINATE] --------------------------------------------------------------------------- Latest news >>> ONLINE: FC and WTSC will be held online >>> Close to the LAST SUBMISSION DEADLINE >>> Darren Tapp (Dash) invited speaker --------------------------------------------------------------------------- 5th International Workshop on Trusted Smart Contracts (WTSC?21) - https://fc21.ifca.ai/wtsc/ March 5, 2021 - Online - In Association with Financial Cryptography - https://fc21.ifca.ai/ ?????????????????????????????????????? CALL FOR PAPERS Smart contracts, an highly transformational technology, are self-enforcing agreements in the form of executable programs that are deployed to and run on top of blockchains. Several proposals have developed the idea of algorithmic validation of decentralised trust, along Szabo's intuition. The first significant example was the Ethereum blockchain. A myriad of possible further directions have been proposed, many of them are in active development. These technologies introduce a novel programming framework and execution environment, which are not satisfactorily understood at the moment. Multidisciplinary and multifactorial aspects affect correctness, safety, privacy, authentication, efficiency, sustainability, resilience and trust in smart contracts. Existing frameworks, which are competing for their market share, adopt different solutions to issues like the above ones. Merits of proposed solutions are still to be fully evaluated and compared by means of systematic scientific investigation, and further research is needed towards laying the foundations of Trusted Smart Contracts. A non-exhaustive list of topics of interest, open problems and future directions includes: - validation and definition of the programming abstractions and execution model, - verification of the properties expected to be enforced by smart contracts, - incentives, governance, participatory models, and implications on smart contracts, - resilience of the consensus/validation/mining/execution model, - fairness and decentralisation of contracts and their management, - rewards, economics and sustainability/stability of the framework, - on- and off-chain interaction modalities, protocols and context, - (smart-contract supported) multi-chain interoperability - (smart-contract supported) decentralised exchanges - sharding, concurrency, and parallelism in smart contracts, - effects of consensus mechanisms and proof-of mechanisms on smart contracts, - game-theoretic approaches for security and validation, - digital and ring signatures - multiparty computation and homomorphic encryption for the privacy of smart contract execution - privacy and privacy-preserving contracts, - authentication and anonymity management, - oblivious transfer, - data provenance, - access rights, - foundations of software engineering for smart contracts, - blockchain data analysis, - comparison of the permissioned and non-permissioned scenarios, - use cases and killer applications of smart contracts, - regulation and law enforcement, - future outlook on smart contract technologies, WTSC focuses on smart contracts as an application layer on top of blockchains, however aspects of the underlying supporting blockchains clearly become relevant in so much as they affect properties of the smart contracts, and are of great interest for WTSC. WTSC aims to gather together researchers from both academia and industry interested in the many facets of Trusted Smart Contract engineering, and to provide a multi-disciplinary forum for discussing open problems, proposed solutions and the vision on future developments. Associated to Financial Cryptography, a recognised premiere conference for the blockchain world, WTSC aims to become a reference venue for the discussion of cutting-edge smart contracts and associated blockchain technologies. Experts in fields including (but not limited to): - programming languages, - verification, - security, - software engineering, - decision and game theory, - cryptography, - finance and economics, - monetary systems, - finance and economics, - regulation and law, as well as, practitioners and companies interested in blockchain technologies, are invited to submit their findings, case studies and reports on open problems for presentation at the workshop, to take part in this third edition of WTSC and make it a lively forum. INVITED SPEAKERS (TBC) Continuing on WTSC tradition (slides on the web) ? Buterin (Ethereum) 2017, - Breitman (Tezos) and Mishra (NYU) 2018, ? Artamonov (Splix - Ethereum Classic) and Ian Grigg (www.iang.org) 2019, ? Gutmann (University of Auckland, with Workshop on Coordination of Decentralized Finance) 2020, we are defining the 2021 list, including: ? Darren Tapp (Arizona State University) - TBC IMPORTANT DATES WTSC adopts for the second year a submission schedule ** with double deadline **. A first deadline will allow authors to plan their participation well in advance. A second deadline will allow authors who need extra time to develop their contributions, to have a further opportunity to participate. Selected borderline papers from the first deadline will be considered for and also allowed to resubmit to the second deadline. Abstract registration is kindly requested in advance. Abstract Registration: 16 December 2020 Paper Submission Deadline: 23 December Early Author Notification: 12 January 2021 >>> Late Submission Deadline: 5 February <<< Late Author Notification: 21 February Early registration deadline: TBA Final Papers: TBA WTSC: 5 March 2021 Financial Cryptography: 1-5 March 2021 Final Papers TBA (Springer post-proceeding) SUBMISSION WTSC solicits submissions of manuscripts that represent significant and novel research contributions. Submissions must not substantially overlap with works that have been published or that are simultaneously submitted to a journal or a conference with proceedings. Submissions should follow the Springer Lecture Notes in Computer Science format and should be no more than 15 pages including references and appendices. Papers may also be in a short format, no more than 8 pages including references and appendices. In-progress work and developing ideas can be submitted as a poster. Also "Systemisation of Knowledge" papers will be accepted and have a page limit of 20 pages but *excluding* references. These should be marked "SoK: ? ?. Accepted papers will appear in the proceedings published by Springer Lecture Notes in Computer Science. Authors who seek to submit their works to journals may opt-out by publishing an extended abstract only. All submissions will be reviewed double-blind, and as such, must be anonymous, with no author names, affiliations, acknowledgements, or obvious references. SUBMISSION PAGE Contributions can be submitted at this link: https://easychair.org/conferences/?conf=wtsc2021 PROGRAM CHAIRS Andrea Bracciali University of Stirling, UK Massimiliano Sala University of Trento, IT PROGRAM COMMITTEE (TBC) Monika di Angelo Vienna University of Technology, AT Igor Artamonov Ethereum Classic Dev, UK Daniel Augot INRIA, FR Surya Bakshi University of Illinois, USA Fadi Barbara University of Turin, IT Massimo Bartoletti University of Cagliari, IT Devraj Basu Strathclyde University, UK Stefano Bistarelli University of Perugia, IT Christina Boura Versailles SQT Univ., FR Andrea Bracciali University of Stirling, UK Daniel Broby Strathclyde University, UK James Chapman IOHK, UK Martin Chapman King?s College London, UK Nicola Dimitri University of Siena, IT Nadia Fabrizio Cefriel, IT Murdoch Gabbay Heriot-Watt University, UK Oliver Giudice Banca d'Italia, IT Davide Grossi University of Groningen, NL Yoichi Hirai BedRock Systems, Inc. US Lars R. Knudsen Technical University of Denmark, DK Ioannis Kounelis Joint Research Centre, European Commission, IT Pascal Lafourcade University Clermont Auvergne, Clermont-Ferrand, FR Andrew Lewis-Pye London School of Economics, UK Carsten Maple Warwick University, UK Michele Marchesi University of Cagliari, IT Fabio Martinelli IIT-CNR, IT Akaki Mamageishvili ETHZ, CH Luca Mazzola Lucerne University, CH Sihem Mesnager University of Paris VIII, FR Philippe Meyer Avaloq, CH Bud Mishra NYU, USA Carlos Molina-Jimenez University of Cambridge, UK Massimo Morini Algorand Foundation, SP Immaculate Motsi-Omoijiade University of Warwick, UK Alex Norta Tallin University of Technology, EE Akira Otsuka Institute of Information Security, JP Federico Pintore University of Oxford, UK Massimiliano Sala University of Trento, IT Darren Tapp Arizona State University, US Jason Teutsch Truebit, USA Roberto Tonelli University of Cagliari, IT Philip Wadler University of Edinburgh, UK Yilei Wang Hong Kong Polytechnic University, HK Tim Weing?rtner Lucerne University, CH Ales Zamuda University of Maribor, SLO Santiago Zanella-Beguelin Microsoft, UK Dionysis Zindros University of Athens, GR From alcsc at dtu.dk Tue Jan 19 10:38:07 2021 From: alcsc at dtu.dk (Alceste Scalas) Date: Tue, 19 Jan 2021 16:38:07 +0100 Subject: [TYPES/announce] Assistant Professor in Formal Methods @ DTU Compute Message-ID: DTU Compute (Technical University of Denmark) is recruiting a Tenure Track Assistant Professor in the Formal Methods section: * details: https://www.dtu.dk/english/About/JOB-and-CAREER/vacant-positions/job?id=78af4617-2d83-4775-b7ed-f46dbbcac8ee (also below) * application deadline: 28 February 2021 (note: in the link above, in the "Apply for this job" box, you may see an earlier deadline --- it will be fixed soon) ------------------------------------------------------------------------ DTU Tenure Track Assistant Professor in Formal Methods If you are establishing your career as a scientist and you are looking for the best possible foundation for fulfilling your dreams and ambitions in the area of formal methods, it is right here in the section on Formal Methods at DTU. We are looking for a tenure-track assistant professor to join our vision of a safe and secure digital society supported by reliable and trustworthy IT-based systems with theoretically well-founded guarantees. You will help us lead the advancement of scientific knowledge in this area and to educate new generations of computer scientists and engineers. The position is part of DTU?s Tenure Track program. We offer a rewarding and challenging job in an international environment. We strive for academic excellence in an environment characterized by collegial respect and academic freedom tempered by responsibility. We develop talent by offering a career mentor, state-of-the-art research infrastructure, and postgraduate teacher training. DTU?s Tenure Track is an appointment of at most six years, during which you will receive career support in the form of professional and personal guidance. At the end of the tenure track appointment you will be evaluated by an external assessment committee, who will assess your appointment to a permanent Associate Professorship. Read more about the DTU Tenure Track program at DTU at this homepage . Responsibilities and qualifications You will be conducting high-quality scientific research at international level, publishing your results in highly-reputed venues, combining theoretical and practical aspects of formal methods, as well as leading and participating in collaborative research projects. You will take part in the development of research-based teaching at the bachelor, master, and PhD levels at DTU. Our teaching portfolio includes courses in topics tightly connected to our research expertise and activities: models of computation, programming languages, semantics, interpreters and compilers, formal methods, program analysis, model checking, security, and distributed and concurrent programming. You will be strengthening our research and research-based teaching competences within formal methods, and expanding them in new directions. You will be responsible for the teaching of courses. Master and PhD courses are taught in English, while bachelor courses are taught in Danish and in English. ?You will be expected to learn Danish and be able to teach in Danish after 3 years. DTU can provide Danish language courses. As formal qualification you must hold a PhD degree (or equivalent). You will be assessed against the responsibilities and qualifications stated above and the following general criteria: * Experience and quality of teaching * Research experience * Research vision and potential * International impact and experience * Societal impact * Innovativeness, including commercialization and collaboration with industry * Leadership, collaboration, and interdisciplinary skills * Communication skills Salary and terms of employment The appointment will be based on the collective agreement with the Danish Confederation of Professional Associations. The salary for the position will be determined by the applicants qualifications and in agreement with the relevant union. Further information on qualification requirements and job content may be found in the Ministerial Order on Job Structure for Academic Staff at Universities . The position is available from July 1st or according to mutual agreement. Further information Further information may be obtained from Head of Section Alberto Lluch Lafuente (albl at dtu.dk ). You are welcome to contact him before submitting the formal application. You can read more about DTU Compute?s section for Formal Methods at www.compute.dtu.dk/english/research/research-sections/formalmethods . If you are applying from abroad, you may find useful information on working in Denmark and at DTU at DTU ? Moving to Denmark . Application procedure Your complete online application must be submitted no later than 28 February 2021 (Danish time). Applications must be submitted as one PDF file containing all materials to be given consideration. To apply, please open the link "Apply online", fill out the online application form, and attach all your materials in English in one PDF file. The file must include: * Application (cover letter) * Vision for teaching and research for the tenure track period * CV including employment history, list of publications, H-index, and profiles in ORCID (see http://orcid.org/ ), Google Scholar (https://scholar.google.com/ ) and DBLP (https://dblp.uni-trier.de/) * Teaching portfolio including documentation of teaching experience * Academic Diplomas (MSc/PhD) All interested candidates irrespective of age, gender, disability, race, religion or ethnic background are encouraged to apply. DTU Compute DTU Compute is a unique and internationally recognized academic environment spanning the science disciplines mathematics, statistics, computer science, and engineering. We conduct research, teaching and innovation of high international standard - producing new knowledge and technology-based solutions to societal challenges. We have a long-term involvement in applied and interdisciplinary research, big data and data science, artificial intelligence (AI), internet of things (IoT), smart and secure societies, smart manufacturing, and life science. Technology for people DTU develops technology for people. With our international elite research and study programmes, we are helping to create a better world and to solve the global challenges formulated in the UN?s 17 Sustainable Development Goals. Hans Christian ?rsted founded DTU in 1829 with a clear vision to develop and create value using science and engineering to benefit society. That vision lives on today. DTU has 12,000 students and 6,000 employees. We work in an international atmosphere and have an inclusive, evolving, and informal working environment. Our main campus is in Kgs. Lyngby north of Copenhagen and we have campuses in Roskilde and Ballerup and in Sisimiut in Greenland. -- Alceste Scalas -https://people.compute.dtu.dk/alcsc Assistant Professor @ DTU Compute - Section for Formal Methods Technical University of Denmark Richard Petersens Plads, Building 324, Room 180 2800 Kgs. Lyngby -------------- next part -------------- An HTML attachment was scrubbed... URL: From duncan.attard.01 at um.edu.mt Tue Jan 19 13:07:45 2021 From: duncan.attard.01 at um.edu.mt (Duncan Paul Attard) Date: Tue, 19 Jan 2021 19:07:45 +0100 Subject: [TYPES/announce] CFP DisCoTec 2021 [3rd Call] Message-ID: [Apologies for multiple postings] ************************************************************************ Joint Call for Papers 16th International Federated Conference on Distributed Computing Techniques DisCoTec 2021 Valletta, Malta, 14-18 June 2021 https://www.discotec.org/2021 ************************************************************************ DisCoTec 2021 is one of the major events sponsored by the International Federation for Information Processing (IFIP) and the European Association for Programming Languages and Systems (EAPLS). It gathers conferences and workshops that cover a broad spectrum of distributed computing subjects ? from theoretical foundations and formal description techniques, testing and verification methods, to language design and system implementation approaches. * Main Conferences * - COORDINATION (https://www.discotec.org/2021/coordination) 23rd International Conference on Coordination Models and Languages PC Chairs: Ferruccio Damiani (University of Turin, IT) and Ornela Dardha (University of Glasgow, UK) - DAIS (https://www.discotec.org/2021/dais) 21st International Conference on Distributed Applications and Interoperable Systems PC Chairs: Fab?ola Greve (Federal University of Bahia, BR) and Miguel Matos (University of Lisboa & INESC-ID, PT) - FORTE (https://www.discotec.org/2021/forte) 41st International Conference on Formal Techniques for Distributed Objects, Components and Systems PC Chairs: Kirstin Peters (Technical University of Darmstadt, DE) and Tim Willemse (Eindhoven University of Technology, NL) Important dates (for all main conferences): - January 29, 2021: Abstract submission deadline - February 5, 2021: Paper submission deadline - April 2, 2021: Notification of accepted papers - April 23, 2021: Camera-ready papers deadline - June 14-18, 2021: Conferences and workshops * Keynote Speakers * - Gilles Fedak (iExec, FR) - Mira Mezini (Technical University of Darmstadt, DE) - Alexandra Silva (University College London, UK) * Submission Categories * COORDINATION - Full papers (up to 15 pages + 2 pages references) - Short papers (up to 6 pages + 2 pages references) - Survey papers (up to 25 pages + 2 pages references) - Tool papers (up to 6 pages + 2 pages references + 10 minute demo video) DAIS - Full papers (up to 15 pages + 2 pages references) - Full practical experience reports (up to 15 pages + 2 pages references) - Work-in-progress (up to 6 pages + 2 pages references) FORTE - Full papers (up to 15 pages + 2 pages references) - Short papers (up to 6 pages + 2 pages references) - ?Journal First? papers (up to 4 pages, including references) * Proceedings * The proceedings of the DisCoTec 2021 main conferences will be published in Springer's LNCS-IFIP volumes. * Special issue * The individual conferences will organise special issues of extended and selected papers in a reputable journal such as Logical Methods in Computer Science and the Journal of Parallel and Distributed Computing. More information is available on the conference website. * Submission Instructions * Authors are invited to submit their contributions electronically in PDF using a two-phase online submission process. The registration of the paper information and abstract (max. 250 words) must be completed before January 29, 2021. Submission of the manuscript is due by no later than February 5, 2021. Submissions are handled through the EasyChair conference management system: - https://easychair.org/conferences/?conf=dais2021 - https://easychair.org/conferences/?conf=forte21 - https://easychair.org/conferences/?conf=coordination2021 Contributions must be written in English and report on original, unpublished work that has not been submitted for publication elsewhere (cf. IFIP's Author Code of Conduct, see http://www.ifip.org/ under Publications/Links). The submissions ? prepared using Springer?s LNCS style ? must not exceed the total page limit, including figures and references. Submissions not adhering to the above-specified constraints may be rejected without review. For each accepted paper, one of the authors must register to DisCoTec 2021, and attend the corresponding conference to present the paper. * Satellite Events * DisCoTec also features workshops, tutorials, and a tool track. Workshops, tutorials, and tools demonstrations should fall in the areas of the DisCoTec conferences. For more information refer to the website. * Organising Committee * - Adrian Francalanza (University of Malta, MT ? General Chair) - Caroline Caruana (University of Malta, MT ? Publicity Chair) - Jasmine Xuereb (University of Malta, MT ? Publicity Chair) - Duncan Paul Attard (University of Malta, MT ? Workshops Chair) - Christian Bartolo Burl? (Gran Sasso Science Institute, IT ? Workshops Chair) - Lucienne Bugeja (University of Malta, MT ? Logistics) * Steering Committee * - Rocco De Nicola (IMT Lucca, IT) - Pascal Felber (University of Neuch?tel, CH) - Adrian Francalanza (University of Malta, MT) - Kurt Geihs (University of Kasel, DE) - Alberto Lluch Lafuente (Technical University of Denmark, DK) - Kostas Magoutis (ICS-FORTH, GR) - Elie Najm (Telecom Paris Tech, FR) - Manuel N??ez (Universidad Complutense de Madrid, ES) - Rui Oliveira (University of Minho, PT) - Jean-Bernard Stefani (INRIA Grenoble, FR) - Gianluigi Zavattaro (University of Bologna, IT ? Chair) To receive live, up-to-date information, follow us on Twitter @DisCoTecConf. From duncan.attard.01 at um.edu.mt Tue Jan 19 13:19:50 2021 From: duncan.attard.01 at um.edu.mt (Duncan Paul Attard) Date: Tue, 19 Jan 2021 19:19:50 +0100 Subject: [TYPES/announce] CFW DisCoTec 2021 [2nd Call] Message-ID: ************************************************************************ Call for Satellite Events: Workshops, Tutorials and Tool Tracks 16th International Federated Conference on Distributed Computing Techniques DisCoTec 2021 Valletta, Malta, 14-18 June 2021 https://www.discotec.org/2021 ************************************************************************ DisCoTec 2021 is one of the major events sponsored by the International Federation for Information Processing (IFIP) and the European Association for Programming Languages and Systems (EAPLS). It gathers conferences and workshops that cover a broad spectrum of distributed computing subjects ? from theoretical foundations and formal description techniques, testing and verification methods, to language design and system implementation approaches. * Main Conferences * - COORDINATION (https://www.discotec.org/2021/coordination) 23rd International Conference on Coordination Models and Languages PC Chairs: Ferruccio Damiani (University of Turin, IT) and Ornela Dardha (University of Glasgow, UK) - DAIS (https://www.discotec.org/2021/dais) 21st International Conference on Distributed Applications and Interoperable Systems PC Chairs: Fab?ola Greve (Federal University of Bahia, BR) and Miguel Matos (University of Lisboa & INESC-ID, PT) - FORTE (https://www.discotec.org/2021/forte) 41st International Conference on Formal Techniques for Distributed Objects, Components and Systems PC Chairs: Kirstin Peters (Technical University of Darmstadt, DE) and Tim Willemse (Eindhoven University of Technology, NL) * Workshops * The DisCoTec 2021 organising committee invites proposals for workshops to complement the three main conferences. The aim is to provide a vivid and open forum for discussions, presentations of preliminary research results and ongoing work, as well as presentations of research work to a focussed audience. The workshops will be held in conjunction with the main events. Prospective workshop chairs should contact the organisers and provide the following information: - contact information of the workshop chairs - name of the workshop - number of (expected) participants - brief description of the topic of the event (max. 500 words) - any other relevant information (e.g., invited speakers) Important dates (for all workshops): - January 20, 2021: Workshop proposal submission deadline - January 31, 2021: Notification of accepted workshop proposals - Mid April 2021: Workshop paper submission deadline - Mid May 2021: Notification of accepted workshop papers - June 14-18, 2021: Conferences and workshops The submission and notification deadlines of the workshops are at the discretion of the individual workshop chairs. However, the notification must be no later than the early registration deadline for DisCoTec 2021 (to be announced). * Tutorials * The DisCoTec 2021 organising committee invites proposals for tutorials on topics related to those of the three main conferences of DisCoTec. The tutorials will be held in conjunction with the main events. Prospective speakers should contact the workshops chairs and provide the following information: - contact information of the speaker - title of the tutorial - abstract of the tutorial (max. 500 words) - description of the tutorial (max. two A4 pages) Important dates: - April 10, 2020: Tutorial proposal submission deadline - May 1, 2020: Notification of accepted tutorials - June 14-18, 2021: Conferences and tutorials * Tool Track * The DisCoTec 2021 organising committee invites proposals for tool demonstrations on topics related to those of the three main conferences of DisCoTec. This call is open to anyone. However, authors of the papers accepted at DisCoTec are strongly encouraged to present the tool accompanying their publication. The tool demos will be held in conjunction with the main events. Prospective speakers should contact the workshops chairs and provide the following information: - contact information of the speaker - title of the demo and tool - brief description of the actual demo (max. three A4 pages) Important dates: - April 24, 2020: Demo proposal submission deadline - May 8, 2020: Notification of accepted demos - June 14-18, 2021: Conferences and tool demos * DisCoTec 2021 Workshop Organisers * - Duncan Paul Attard (University of Malta, MT), duncan.attard.01 at um.edu.mt - Christian Bartolo Burl? (Gran Sasso Science Institute, IT), christian.bartolo at gssi.it To receive live, up-to-date information, follow us on Twitter @DisCoTecConf. From pangjun at gmail.com Wed Jan 20 02:43:18 2021 From: pangjun at gmail.com (Jun PANG) Date: Wed, 20 Jan 2021 08:43:18 +0100 Subject: [TYPES/announce] Formal Methods 2021 -- 2nd call for workshop & tutorial proposals In-Reply-To: References: Message-ID: --------------------------------------------------------------------------------------------------------- FM 2021 ? 24th International Symposium on Formal Methods Beijing, China, November 20-26, 2021 http://formalmethods2021.csp.escience.cn ---------------- CALL FOR WORKSHOP & TUTORIAL PROPOSALS --------------- ------------------------------------------------------------------------- Deadline for workshop & tutorial proposals: February 15, 2021 Notification of decision on workshops and tutorials: March 15, 2021 ------------------------------------------------------------------------- ABOUT FM 2021 ============= FM 2021 is the 24th International Symposium in a series organised by Formal Methods Europe (FME), which focuses on the development and application of formal methods in a wide range of domains including software, cyber-physical systems, and integrated computer-based systems. The symposium is planned to take place during November 20-26, 2021, at the Institute of Software, Chinese Academy of Sciences. The organisers are monitoring closely the COVID-19 situation; although hoping for an in-person event, they are also planning carefully for a virtual event or a hybrid virtual/in-person event, in case there will be travel restrictions or health advisories following the global COVID-19 crisis. A decision on the nature of the meeting will be announced in due course. PROPOSALS ========= For this major event, we are now inviting proposals for workshops, tutorials, or other similar events that will complement the main FM Symposium. The general purpose of workshops and tutorials is to provide an informal setting for participants to discuss technical issues, exchange research ideas and educational approaches, and to discuss and/or demonstrate applications. These may be driven by fundamental academic interests or by needs from specific application domains. A workshop is an event with an open call for contributions. A tutorial is an event based entirely on invited talks by the organizers or by other speakers. Events that mix open and invited presentations will also be considered. We encourage a diversity of topics relating to different ways of developing and using formal methods. Workshops and tutorials will take place on November 20-21, 2021. Each event (workshop or tutorial) should typically run for 1/2 or 1 day, but 2-day events will also be considered. The FM 2021 organising committee aims to contribute to at least partial support for one invited speaker per event. SUBMISSION INFORMATION ====================== Researchers and practitioners wishing to organise a workshop or tutorial are invited to submit proposals by e-mail to the Workshops & Tutorials Chairs: Tutorial chairs: Luigia Petre (lpetre at abo.fi) and Tim Willemse (t.a.c.willemse at tue.nl) Workshop chairs: Carlo A. Furia (furiac at usi.ch) and Lijun Zhang (zhanglj at ios.ac.cn) A proposal should not exceed three pages and should include the following information: * Title and brief technical description of the event, specifying its goals and formal methods focus, and whether the event is a workshop, tutorial, or any other kind of event. * The names and contact information (web page, email address) of the organisers. The organisers of a workshop will also be its Programme Committee (PC) chairs; in this case, the proposal may also list prospective international PC members. * Pointers to information about past editions of the event, if applicable. Workshop proposals should specify whether it has taken place before; how often it has been co-located with FM or with other conferences, and the number of participants in the most recent instalments. * A discussion of the proposed format and agenda (for example: paper presentations, tutorials, demo sessions, etc). The organisers are encouraged to describe their vision for an online event, should the need occur in light of the current global pandemic crisis. * The proposed duration: half or one day. Exceptionally, two days events may be considered. * Potential invited speaker(s). * Procedures for selecting papers and participants and plans for the publication of proceedings, if any. * A tentative schedule for paper submission and notification of acceptance. The organisers of the proposed events are expected to create and maintain a website for the event; handle paper selection, reviewing and acceptance; draw up a programme of talks; advertise their event though specialist mailing lists; prepare the informal pre-proceedings (if applicable) in a timely fashion; and arrange any post-proceedings. IMPORTANT DATES =============== Submission of proposals: February 15, 2021 Notification of success of proposals: March 15, 2021 FM 2021: November 20-26, 2021 Workshop/Tutorial dates: November 20-21, 2021 Best Wishes, Carlo A. Furia (furiac at usi.ch) Luigia Petre (lpetre at abo.fi) Tim Willemse (t.a.c.willemse at tue.nl) Lijun Zhang (zhanglj at ios.ac.cn) From duncan.attard.01 at um.edu.mt Wed Jan 20 04:01:13 2021 From: duncan.attard.01 at um.edu.mt (Duncan Paul Attard) Date: Wed, 20 Jan 2021 10:01:13 +0100 Subject: [TYPES/announce] CFW DisCoTec 2021 [2nd Call, ERRATUM] Message-ID: <81CC4903-C3B9-4C14-95DC-F8117F99F258@um.edu.mt> [Apologies for multiple postings] ERRATUM: Please note that the DisCoTec tutorials will be organised via a different selection process. We would also like to announce that the workshop proposal submission deadline has been extended to January 27, 2021. ************************************************************************ Call for Satellite Events: Workshops 16th International Federated Conference on Distributed Computing Techniques DisCoTec 2021 Valletta, Malta, 14-18 June 2021 https://www.discotec.org/2021 ************************************************************************ DisCoTec 2021 is one of the major events sponsored by the International Federation for Information Processing (IFIP) and the European Association for Programming Languages and Systems (EAPLS). It gathers conferences and workshops that cover a broad spectrum of distributed computing subjects ? from theoretical foundations and formal description techniques, testing and verification methods, to language design and system implementation approaches. * Main Conferences * - COORDINATION (https://www.discotec.org/2021/coordination) 23rd International Conference on Coordination Models and Languages PC Chairs: Ferruccio Damiani (University of Turin, IT) and Ornela Dardha (University of Glasgow, UK) - DAIS (https://www.discotec.org/2021/dais) 21st International Conference on Distributed Applications and Interoperable Systems PC Chairs: Fab?ola Greve (Federal University of Bahia, BR) and Miguel Matos (University of Lisboa & INESC-ID, PT) - FORTE (https://www.discotec.org/2021/forte) 41st International Conference on Formal Techniques for Distributed Objects, Components and Systems PC Chairs: Kirstin Peters (Technical University of Darmstadt, DE) and Tim Willemse (Eindhoven University of Technology, NL) * Workshops * The DisCoTec 2021 organising committee invites proposals for workshops to complement the three main conferences. The aim is to provide a vivid and open forum for discussions, presentations of preliminary research results and ongoing work, as well as presentations of research work to a focussed audience. The workshops will be held in conjunction with the main events. Prospective workshop chairs should contact the organisers and provide the following information: - contact information of the workshop chairs - name of the workshop - number of (expected) participants - brief description of the topic of the event (max. 500 words) - any other relevant information (e.g., invited speakers) Important dates (for all workshops): - January 27, 2021: Workshop proposal submission deadline - February 1, 2021: Notification of accepted workshop proposals - Mid April, 2021: Workshop paper submission deadline - Mid May, 2021: Notification of accepted workshop papers - June 18, 2021: Workshops The submission and notification deadlines of the workshops are at the discretion of the individual workshop chairs. However, the notification will be no later than the early registration deadline for DisCoTec 2021 (to be announced). * DisCoTec 2021 Workshop Organisers * - Duncan Paul Attard (University of Malta, MT), duncan.attard.01 at um.edu.mt - Christian Bartolo Burl? (Gran Sasso Science Institute, IT), christian.bartolo at gssi.it To receive live, up-to-date information, follow us on Twitter @DisCoTecConf. From i.hasuo at acm.org Wed Jan 20 20:46:06 2021 From: i.hasuo at acm.org (Ichiro Hasuo) Date: Thu, 21 Jan 2021 10:46:06 +0900 Subject: [TYPES/announce] CFP: 6th Workshop On Monitoring And Testing Of Cyber-physical Systems (MT-CPS 2021) In-Reply-To: <202101202204.10KM4ewc001506@easychair.org> References: <202101202204.10KM4ewc001506@easychair.org> Message-ID: [Sorry for multiple postings] -------------------------------------------------------------------------------------------- Call for Papers 6th Workshop on Monitoring And Testing Of Cyber-physical Systems MT-CPS 2021 May 18, 2021 - Online https://sites.google.com/virginia.edu/mt-cps2021 Part of CPS-IoT Week 2021 -------------------------------------------------------------------------------------------- Cyber-physical systems (CPS) model the integration of computational modules, like decision logic, with physical phenomena in the environment, such as the phenomenon being controlled by the logic. Several CPS applications, such as self-driving cars and other autonomous ground/aerial/underwater vehicles, medical devices, surgical robots, as well as many Internet of Things (IoT) applications, particularly for Industrial IoT or Industry 4.0, are safety-critical, where human lives can be at stake. CPS exhibit complex and unpredictable behaviors, thus making their correctness and robustness analysis a challenging task. Given the gap between the complexity of such systems and the scalability of current formal methods, exhaustive formal verification remains an elusive goal. However, simulation-based lightweight verification techniques, such as monitoring and testing, achieve both rigor and efficiency by enabling the evaluation of systems according to the properties of their exemplar! behaviors. The Workshop on Monitoring and Testing of Cyber-Physical Systems (MT-CPS) aims to bring together researchers and practitioners interested in the problems of detecting, testing, measuring, and extracting qualitative and quantitative properties from individual behaviors of CPS. Topics of interest include (but are not limited to): * Specification languages for monitoring and testing * Runtime verification and monitoring of CPS * Model/Software/Hardware/Processor-in-the-loop (MIL/SIL/HIL/PIL) testing * Testing the integration of heterogeneous components * Monitoring and testing of streaming and/or historical IoT data * Interpretation of multi-dimensional counter-examples * Black-box and white-box testing * Measuring and statistical information gathering for data-driven analyses * Simulation-based verification and parameter synthesis * Fault diagnostics, localization, and recovery * Combination of static and dynamic analysis * Applications and case studies from safety-critical domains -------------------------------------------------------------------------------------------- Workshop format MT-CPS is intended to be a forum for exchanging the latest scientific activity and emerging trends between researchers and practitioners. We encourage submission of abstracts that address any of the aforementioned topics of interest and cover recently published or work in progress. In addition to the contributed material, the workshop will include a combination of invited talks from leading researchers and/or practitioners from industry, academia, and government research labs around the world. The workshop is intended to be an informal gathering about latest results and, as such, it will not have formal proceedings. However, we will make accepted abstracts and presentation material publicly available on the website of the workshop. -------------------------------------------------------------------------------------------- Important Dates: * Abstract submission deadline: March 18, 2021 23:59pm (AoE) * Notification: April 19, 2020 * Final version: May 4, 2020 * Workshop: May 18, 2020 -------------- next part -------------- An HTML attachment was scrubbed... URL: From stourret at mpi-inf.mpg.de Thu Jan 21 07:15:32 2021 From: stourret at mpi-inf.mpg.de (Sophie Tourret) Date: Thu, 21 Jan 2021 13:15:32 +0100 Subject: [TYPES/announce] CADE-28: Call for Papers In-Reply-To: <47475eb3-94e1-b720-10a2-f887b6b364f9@mpi-inf.mpg.de> References: <1c179272-7300-62f8-8fcb-3ccdeb1d1c23@mpi-inf.mpg.de> <47475eb3-94e1-b720-10a2-f887b6b364f9@mpi-inf.mpg.de> Message-ID: CADE-28: Call for Papers The 28th International Conference on Automated Deduction (CADE-28) Carnegie Mellon University, Pittsburgh, USA. 11-16th July 2021. http://www.cade-28.info In cooperation with ACM SIGLOG CADE will carefully monitor the development of the COVID-19 pandemic, and take guidance from the health authorities, to determine whether CADE-28 will be physical or online or hybrid. CADE is the major international forum for presenting research on all aspects of automated deduction. High-quality submissions on the general topic of automated deduction, including logical foundations, theory and principles, applications in and beyond STEM, implementations, and the use/contribution of automated deduction in AI, are solicited. CADE-28 aims to present research that reflects the broad range of interesting and relevant topics in automated deduction. Important Dates + Abstract deadline: 15 February 2021 + Submission deadline: 22 February 2021 + Rebuttal phase: 2 April 2021 + Notification: 19 April 2021 + Final version: 31 May 2021 + Conference: 12-15 July 2021 Submissions can be made in two categories: + Regular papers. Up to 15 pages in LNCS style. Proofs of theoretical results that do not fit in the page limit may be provided in an appendix. Reviewers may consider additional material in appendices, but submissions must be self- contained within the page limit. + Short papers (including system descriptions, user experiences, domain models, etc.) Up to 10 pages in LNCS style. Submissions must be unpublished and not submitted for publication elsewhere. They will be judged on relevance, originality, significance, correctness, and readability. If software or data is relevant to a paper, a link that provides access to the software/data must be provided to enable reproduction of results. The review process will include a feedback/rebuttal period where authors will have the option to respond to reviewer comments. The PC chairs may solicit further reviews after the rebuttal period. The proceedings of the conference will be published in the Springer LNCS/LNAI series. Formatting instructions and the LNCS style files can be obtained at http://www.springer.de/comp/lncs/authors.html Papers must be submitted to the CADE-28 track via https://easychair.org/conferences/?conf=cade28 All questions about submissions should be emailed to Andr? Platzer (aplatzer at cs.cmu.edu) and Geoff Sutcliffe (geoff at cs.miami.edu). -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 5242 bytes Desc: S/MIME Cryptographic Signature URL: From bove at chalmers.se Thu Jan 21 07:40:03 2021 From: bove at chalmers.se (Ana Bove) Date: Thu, 21 Jan 2021 13:40:03 +0100 Subject: [TYPES/announce] Two fully funded PhD positions in type theory at Chalmers/Gothenburg Univ Message-ID: <4fffd01e-50db-e98c-147e-50ab5eab54b9@chalmers.se> _Please distribute to undergraduate and master's students and appropriate counsellors and supervisors. _ The type theory group at Chalmers/Gothenburg Univ has two fully funded PhD positions. Observe that you will get employed at the Univ. of Gothenburg with full employment benefits (health care, pension, etc). Our research ranges from foundational studies (models, homotopy type theory) to actual implementations of interactive proof systems (Agda). The selected candidates will work mainly with Thierry Coquand but also Andreas Abel and the rest of the group. The research group consists, besides Thierry and Andreas, of Nils Anders Danielsson, Peter Dybjer, Ulf Norell and Christian Sattler. PhD positions usually extend to 5 years, where every year you spend 80% of your time reading courses and working on your research, and 20% on teaching. Deadline for application: _February 14th 2021_ For information on how to apply and whom to contact if you have further questions please visit this link https://web103.reachmee.com/ext/I005/1035/job?site=7&lang=UK&validator=9b89bead79bb7258ad55c8d75228e5b7&job_id=18601 -------------- next part -------------- An HTML attachment was scrubbed... URL: From ayala at unb.br Thu Jan 21 08:46:43 2021 From: ayala at unb.br (Mauricio Ayala-Rincon) Date: Thu, 21 Jan 2021 10:46:43 -0300 Subject: [TYPES/announce] Special Issue on Confluence - Mathematical Structures in Computer Science - Extended deadline In-Reply-To: References: Message-ID: Special Issue on Confluence in Mathematical Structures in Computer Science https://www.cambridge.org/core/news/confluence This Special Issue on Confluence aims to publish recent advances presented at, but not restricted to leading conferences and workshops such as IWC (collocated with FSCD in recent editions: FLoC 2018, FSCD 2019, Paris Nord Summer of LoVe 2020). Submissions of papers related to aspects of confluence such as commutation, ground confluence, nominal confluence, completion, CP criteria, decidability, complexity, system and tool descriptions, certification, and applications of confluence, are welcome. All submissions will pass a thorough and rigorous reviewing process, according to the standards of MSCS. The reviewing process of each paper will start as soon as it is submitted, and? accepted papers will undergo production before being published online in MSCS. Submissions should be submitted to the ScholarOne system here: https://mc.manuscriptcentral.com/mscs When submitting your paper please select the Special Issue on "Confluence" from the drop-down list on the ScholarOne system, as thisis the only way the papers can be correctly tagged for this special issue. Guest Editors: Mauricio Ayala-Rinc?n (Universidade de Bras?lia),? ayala(at)unb.br Samuel Mimram (LIX, ?cole Polytechnique), samuel.mimram(at)lix.polytechnique.fr Deadline: 1st March 2021 -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: ayala.vcf Type: text/x-vcard Size: 4 bytes Desc: not available URL: From ayala at unb.br Thu Jan 21 13:55:31 2021 From: ayala at unb.br (Mauricio Ayala-Rincon) Date: Thu, 21 Jan 2021 15:55:31 -0300 Subject: [TYPES/announce] First CFPs LSFA 2021 - affiliated to FSCD 2021 In-Reply-To: <19aa17e4-3650-2c82-7afe-32b016329e8e@unb.br> References: <19aa17e4-3650-2c82-7afe-32b016329e8e@unb.br> Message-ID: <2bfca58f-d25b-e3a8-3068-6f0b07b837ae@unb.br> ??????????????????//?????????????????? ??????? 16th Logical and Semantic Frameworks with Applications - LSFA 2021 ??????????????????????????? 23-24 July 2021 ?????????????????????? https://mat.unb.br/lsfa2021 ????????????? Affiliated to FSCD 2021, Buenos Aires, Argentina (Online) ???????????????????????????? First Call For Papers ??????????????????//?????????????????? Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for the formal specification of systems and computational languages, supporting tool development and reasoning. The LSFA series' objective is to put together theoreticians and practitioners to promote new techniques and results, from the theoretical side, and feedback on the implementation and use of such techniques and results, from the practical side. See lsfa.cic.unb.br for more information. LSFA topics of interest include, but are not limited to: * Automated deduction * Applications of logical and semantic frameworks * Computational and logical properties of semantic frameworks * Formal semantics of languages and systems * Implementation of logical and semantic frameworks * Lambda and combinatory calculi * Logical aspects of computational complexity * Logical frameworks * Process calculi * Proof theory * Semantic frameworks * Specification languages and meta-languages * Type theory Submissions Contributions should be written in English and submitted in full paper (with a maximum of 16 pages) or short papers (with a maximum of 6 pages). They must be unpublished and not submitted simultaneously for publication elsewhere. The papers should be prepared in LaTeX using the EPTCS style. The submission should be in the form of a PDF file uploaded to Easychair: https://easychair.org/conferences/?conf=lsfa2021 The pre-proceedings, containing the reviewed extended abstracts, will be handed out at event registration. After the meeting, the authors will be invited to submit full versions of their works for the post-proceedings publication. At least one of the authors should register for the conference. Presentations should be in English. According to the submissions' quality, the chairs will promote the further publication of journal revised versions of the papers. Previous LSFA Special Issues have been published in journals such as The Logical J. of the IGPL, Theoretical Computer Science and Mathematical Structures in Computer Sciences (see the LSFA page http://lsfa.cic.unb.br). Important dates * Abstract: Monday 26th April * Submission: Sunday 2nd May * Notification: Friday 4th June * Preliminary proceedings version due: Monday 14th June * Submission for final proceedings: Sunday 19th October * Final version: Sunday 21st December Program Committee ? Mar?a Alpuente (Universitat Polit?cnica de Val?ncia) ? Sandra Alves (Universidade de Porto, Portugal) ? Takahito Aoto (Niigata University) ? Mauricio Ayala-Rinc?n (Universidade de Bras?lia) - Co-Chair ? Eduardo Bonelli (Stevens University) - Co-Chair ? Evelyne Contejean (LRI, CNRS, Univ Paris-Sud, Orsay) ? Valeria de Paiva (Samsung Research America and University of Birmingham) ? Marcelo Finger (Universidade de S?o Paulo) ? Yannick Forster (Saarland University) ? Lourdes del Carmen Gonz?lez Huesca (UNAM) ? Edward Hermann Haeusler (PUC-Rio, Brazil) ? Cynthia Kop (Radboud University) ? Temur Kutsia (RISC, Johannes Kepler University Linz) ? Hernan Melgratti (Universidad de Buenos Aires) ? Alexandre Miquel (Universidad de La Rep?blica) ? Barbara Morawska (Ahmedabad University) ? Mariano Moscato (National Institute of Aerospace) ? Cesar Munoz (NASA LaRC) ? Daniele Nantes-Sobrinho (U. de Bras?lia) ? Carlos Olarte (U. Federal do Rio Grande do Norte) ? Federico Olmedo (Universidad de Chile) ? Alberto Pardo (Universidad de la Rep?blica) ? Jorge A. P?rez (University of Groningen) ? Camilo Rocha (Pontificia Universidad Javeriana - Cali) ? Aleksy Schubert (University of Warsaw) ? Ren? Thiemann (University of Innsbruck) Organisers ?? Daniele Nantes (UnB, Brasil) ?? Cristian F. Sotille (UBA, Argentina) ??????????????????//?????????????????? -------------- next part -------------- A non-text attachment was scrubbed... Name: ayala.vcf Type: text/x-vcard Size: 4 bytes Desc: not available URL: From deligu at di.unito.it Fri Jan 22 04:28:56 2021 From: deligu at di.unito.it (Ugo de Liguoro) Date: Fri, 22 Jan 2021 10:28:56 +0100 Subject: [TYPES/announce] CfP - Intersection Types and Related Systems - ITRS2021 Message-ID: <02ea165d-01fa-2c8a-0f16-18a7f23b08a0@di.unito.it> ITRS 2021 Call for papers Tenth Workshop on Intersection Types and Related Systems - ITRS 2021 17 July 2021, Online Affiliated withFSCD , 17-24 July 2021, Buenos Aires Web page:http://www.di.unito.it/~deligu/ITRS2021/ Aims and Scope Intersection types were introduced near the end of the 1970s to overcome the limitations of Curry's type assignment system and to provide a characterization of the strongly normalizing terms of the Lambda Calculus. The key idea is to introduce an intersection type constructor ? such that a term of type t ? s can be used at both type t and s within the same context. This provides a finite polymorphism where various, even unrelated, types of the term are listed explicitly, differently from the more widely used universally quantified types where the polymorphic type is the common schema which stands for its various type instances. As a consequence, more terms (all and only the normalizing terms) can be typed than with universal polymorphism. Although intersection types were initially intended for use in analyzing and/or synthesizing lambda models as well as in analyzing normalization properties, over the last twenty years the scope of the research on intersection types and related systems has broadened in many directions. Restricted (and more manageable) forms have been investigated, such as refinement types. Type systems based on intersection type theory have been extensively studied for practical purposes, such as program analysis and higher-order model checking. The dual notion of union types turned out to be quite useful for programming languages. Finally, the behavioural approach to types, which can give a static specification of computational properties, has become central in the most recent research on type theory. The ITRS 2021 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches. Possible topics for submitted papers include, but are not limited to: * Formal properties of systems with intersection types. * Results for related systems, such as union types, refinement types, or singleton types. * Applications to lambda calculus, pi-calculus and similar systems. * Applications for programming languages, program analysis, and program verification. * Applications for other areas, such as database query languages and program extraction from proofs. * Related approaches using behavioural/intensional types and/or denotational semantics to characterize computational properties. * Quantitative refinements of intersection types. ITRS workshops have been held every two years (with the exception of 2020, because of COVID-19 outbreak). Information about the previous events is available at theITRS home page . Invited Speaker * Jeremy Siek (Indiana University Bloomington) Paper Submissions Papers must be original and not previously published, nor submitted elsewhere. Papers should be prepared in LaTeX using theEPTCS macro package and should be in the range of 3-16 pages, plus at most 2 pages of references. Submissions will be collected via EasyChair and reviewed by anonymous referees. Important Dates * Paper submission: 12 April 2021 * Author notification: 24 May 2021 * Final version: 18 June 2021 * Workshop: 17 July 2021 Program Committee * Antonio Bucciarelli, Universit? de Paris, France * Daniel De Carvalho, Innopolis University, Russia * Andrej Dudenhefner, Saarland University, Germany * Silvia Ghilezan, University of Novi Sad, Serbia * Ugo de' Liguoro, Universit? di Torino, Italy (chair) * Jeremy Siek, Indiana University Bloomington, USA (co-chair) Organizers: Ugo de' Liguoro, Universit? di Torino, Italy Riccardo Treglia, Universit? di Torino, Italy (riccardo.treglia at unito.it) Steering Committee * Mariangiola Dezani-Ciancaglini, Universit? di Torino, Italy * Jakob Rehof, TU University of Dortmund, Germany * Joe Wells, Heriot-Watt University, Scotland -- Ugo de'Liguoro Associate Professor of Computer Science Dipartimento di Informatica Universit? di Torino Corso Svizzera 185, 10149, Torino, Italy phone: +39 011 6706766 - fax: +39 011 751603 -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- An HTML attachment was scrubbed... URL: From P.Achten at cs.ru.nl Fri Jan 22 08:55:32 2021 From: P.Achten at cs.ru.nl (Peter Achten) Date: Fri, 22 Jan 2021 14:55:32 +0100 Subject: [TYPES/announce] [Lambda Days + TFP + TFPIE 2021] call for participation Message-ID: <8bc33bfc-8cbe-7971-4188-821fbad7c1bc@cs.ru.nl> ------------------------------------------------------------------------------- ????????????? C A L L? F O R? P A R T I C I P A T I O N ?????????????????????????? 8th Lambda Days ????????????????????????????????? + ?10th International Workshop on Trends in Functional Programming in Education ????????????????????????????????? + ?????????? 22nd Symposium on Trends in Functional Programming ???????????????????????? 16 - 19 February 2021 ?????????????????? https://www.lambdadays.org/lambdadays2021 ------------------------------------------------------------------------------- The programmes for Lambda Days, TFPIE, and TFP are online: - Lambda Days overall program at: https://www.lambdadays.org/lambdadays2021 - TFPIE????? specific program at: https://wiki.tfpie.science.ru.nl/TFPIE2021 - TFP??????? specific program at: http://tfp2021.org/ (all times are in Central European Time Zone: 12.00:18.00 (CEST)) Lambda Days is a place where academia meets industry, where research and practical application collide. Once again Lambda Days joins forces with Trends in Functional Programming (TFP) and Trends in Functional Programming in Education (TFPiE) so that for four days you can be at the centre of the functional programming world. The program has a lot of interesting talks, possibilities for interaction, and a host of keynote presentations: Lambda Days keynote speakers: ----------------------------- Perdita Stevens, Pat Hannahan, Simon Peyton Jones, Andy Gordon, Philip Wadler. Trends in Functional Programming in Education keynote speakers: --------------------------------------------------------------- Francesco Cesarini, Simon Thompson, and Bartosz Milewski. Trends in Functional Programming keynote speaker: ------------------------------------------------- Zhenjiang Hu. Thanks to a generous sponsor, TFP has a limited number of free tickets for PhD, Msc, Bsc students with an interest in functional programming. To apply, send a mail to the program chair of TFP, Vikt?ria Zs?k (zsv at elte.hu) with your name, university, 2-3 lines of motivation, and a valid student card photo to get the registration code. Tickets will be delivered in the order of application. From tyokoyama at acm.org Sun Jan 24 07:32:36 2021 From: tyokoyama at acm.org (Tetsuo Yokoyama) Date: Sun, 24 Jan 2021 21:32:36 +0900 Subject: [TYPES/announce] Reversible Computation 2021 2nd CfP Message-ID: <2d38377f-4d65-81b8-1060-45286bb01bdb@acm.org> We apologize if you receive multiple copies of this Call for Papers. Please distribute to anyone who may be interested. ======================================================================= 2nd Call for Papers 13th Conference on Reversible Computation (RC 2021) July 7th-8th, 2021, Nagoya, Japan (the conference will be held online) Abstract Submission: Sun, February 14th, 2021 Submission Deadline: Sun, February 21st, 2021 http://www.reversible-computation.org ======================================================================= Reversible computation has a growing number of promising application areas such as low power design, coding/decoding, debugging, testing and verification, database recovery, discrete event simulation, reversible algorithms, reversible specification formalisms, reversible programming languages, process algebras, and the modeling of biochemical systems. Furthermore, reversible logic provides a basis for quantum computation with its applications, for example, in cryptography and in the development of highly efficient algorithms. First reversible circuits and quantum circuits have been implemented and are seen as promising alternatives to conventional CMOS technology. The conference will bring together researchers from computer science, mathematics, and physics to discuss new developments and directions for future research in Reversible Computation. This includes applications of reversibility in quantum computation. Research papers, tutorials, tool demonstrations, and work-in-progress reports are within the scope of the conference. Invited talks by leading international experts will complete the program. Contributions on all areas of Reversible Computation are welcome, including---but not limited to---the following topics: * Applications * Architectures * Algorithms * Bidirectional transformations * Circuit Design * Debugging * Fault Tolerance and Error Correction * Hardware * Information Theory * Physical Realizations * Programming Languages * Quantum Computation * Software * Synthesis * Theoretical Results * Testing * Verification ===== Important Dates ===== - Abstract Submission: Sun, February 14th, 2021 - Submission Deadline: Sun, February 21st, 2021 - Notification to Authors: Sat, March 27th, 2021 - Final Version: Sat, April 17th, 2021 - Conference: Wed-Thu, July 7th-8th, 2021 (the conference will be held online) ===== Invited speakers ===== TBA ===== Paper submission ===== In order to submit a paper to Reversible Computation conference, please follow these guidelines: * You can submit full research papers (16 pages maximum), tutorials (16 pages maximum), as well as work-in-progress or tool demonstration papers (6 pages maximum). Please do not forget to clearly indicate the type of your submission by choosing the proper category on the submission page. * Additional material intended for reviewers but not for publication in the final version?for example, details of proofs?may be placed in a clearly marked appendix that is not included in the page limit. Reviewers are at liberty to ignore appendices and papers must be understandable without them. * The paper submission will be accepted as a PDF file using the LNCS style. Further information on the style is available at http://www.springer.com/gb/computer-science/lncs/conference-proceedings-guidelines * All accepted research papers will be published in Springer's Lecture Notes in Computer Science (LNCS). * Author(s) of accepted papers are expected to participate in the conference and to present their papers. We would appreciate if one person would not present more than two papers at the conference. If more than two papers are accepted by a group of authors, we kindly ask that the papers be presented by different co-authors, as far as possible. * PC chairs and general chairs are not permitted to submit papers to the conference. If you have further questions, please do not hesitate to ask us (info at reversible-computation.org). ===== Submission system ===== The papers will be submitted via EasyChair. In order to submit your paper, please use EasyChair: https://easychair.org/conferences/?conf=rc2021 ===== Organizers ===== * General Chair Shoji Yuen Nagoya University, Japan * Program co-chairs Shigeru Yamashita Ritsumeikan University, Japan Tetsuo Yokoyama Nanzan University, Japan ===== Program Committee ===== Gerhard Dueck (University of New Brunswic, Canada) Michael P. Frank (Sandia National Laboratories, US) Robert Gl?ck (University of Copenhagen, Denmark) Eva Graversen (Imperial College London, UK) James Hoey (University of Leicester, UK) Jarkko Kari (University of Turku, Finland) Jean Krivine (CNRS, France) Ivan Lanese (University of Bologna/INRIA, Italy) Martin Lukac (Nazarbayev University, Kazakhstan) Claudio Antares Mezzina (Universit? di Urbino, Italy) Claudio Moraga (TU Dortmund University, Germany) Keisuke Nakano (Tohoku University, Japan) Luca Paolini (Universita degli Studi di Torino, Italy) Krzysztof Podlaski (University of Lodz, Poland) Mariusz Rawski (Warsaw University of Technology, Poland) Markus Schordan (Lawrence Livermore National Laboratory, US) Mathias Soeken (Ecole Polytechnique F?d?rale de Lausanne, Switzerland) Milena Stankovic (University of Nis, Serbia) Himanshu Thapliyal (University of Kentucky, US) Michael Kirkedal Thomsen (University of Copenhagen, Denmark) Irek Ulidowski (University of Leicester, UK) Rodney Van Meter (Keio University, Japan) Robert Wille (Johannes Kepler University Linz, Austria) info at reversible-computation.org http://www.reversible-computation.org From alexander.nadel at intel.com Mon Jan 25 02:11:16 2021 From: alexander.nadel at intel.com (Nadel, Alexander) Date: Mon, 25 Jan 2021 07:11:16 +0000 Subject: [TYPES/announce] SMT 2021 Workshop CFP Message-ID: SMT 2021: 19th International Workshop on Satisfiability Modulo Theories Los Angeles, CA, United States, July 16-25, 2021 Conference website: http://smt-workshop.cs.uiowa.edu/2021/ Submission link: https://easychair.org/conferences/?conf=smt2021 Submission deadline: April 30, 2021 ***Overview*** SMT 2021 will be co-located with CAV 2021 in Los Angeles. The aim of the workshop is to bring together researchers and users of SMT tools and techniques. Relevant topics include but are not limited to: ? Decision procedures and theories of interest ? Combinations of decision procedures ? Novel implementation techniques ? Benchmarks and evaluation methodologies ? Applications and case studies ? Theoretical results Papers on pragmatic aspects of implementing and using SMT tools, as well as novel applications of SMT, are especially encouraged. ***Important Dates*** ? Paper submission: April 30, 2021 ? Notification: May 28, 2021 ? Workshop: July 18-19, 2021 ***Submission Guidelines*** We invite researchers to submit extended abstracts, original papers, and presentation only-papers. We intend to publish open-access proceedings for SMT 2021 as a volume of the EPiC Series EasyChair Proceedings. Extended abstracts and original papers must not have been published or submitted elsewhere and will be included in the proceedings. ? Extended abstracts: given the informal style of the workshop, we strongly encourage the submission of preliminary reports of work in progress. They may range in length from very short (a couple of pages) to the full 10 pages and they will be judged based on the expected level of interest for the SMT community. ? Original papers: contain original research and sufficient detail to assess the merits and relevance of the submission. For papers reporting experimental results, authors are strongly encouraged to make their data available. ? Presentation-only papers: describe work recently published or submitted and will not be included in the proceedings. We see this as a way to provide additional access to important developments that SMT Workshop attendees may be unaware of. Papers in all three categories will be peer-reviewed. Papers should not exceed 10 pages and should be in standard-conforming PDF. Technical details may be included in an appendix to be read at the reviewers' discretion. Final versions should be prepared in LaTeX using the easychair.cls class file. (The 10 page limit does not include references.) To submit, please go to the EasyChair page https://easychair.org/conferences/?conf=smt2021 and follow the instructions there. ***Organizers and Program Committee*** See http://smt-workshop.cs.uiowa.edu/2021/committees.shtml ***Invited Speakers*** ? Karem Sakallah, University of Michigan ? Guy Katz, University of Jerusalem --------------------------------------------------------------------- Intel Israel (74) Limited This e-mail and any attachments may contain confidential material for the sole use of the intended recipient(s). Any review or distribution by others is strictly prohibited. If you are not the intended recipient, please contact the sender and delete all copies. From Gethin.Norman at glasgow.ac.uk Tue Jan 26 02:21:09 2021 From: Gethin.Norman at glasgow.ac.uk (Gethin Norman) Date: Tue, 26 Jan 2021 07:21:09 +0000 Subject: [TYPES/announce] ICALP 2021 Second Call for Workshops Message-ID: ================================================== ICALP 2021 Second Call for Workshops and Tutorials ================================================== *** It has now been decided that ICALP 2021 and its workshops will be online-only, hosted by the University of Glasgow, UK. *** As the decision for online workshops has now been confirmed, we are sending out a second call for those that want to take advantage of the logistics of this format. ICALP 2021 (http://easyconferences.eu/icalp2021/) will take place on the 13th - 16th of July 2021 in Glasgow, United Kingdom. The conference will be preceded by one day of workshops, held on July 12th. We invite proposals for workshops (or tutorials) affiliated with ICALP 2021 on all topics covered by ICALP, as well as other areas of theoretical computer science. Proposals should be submitted no later than *** February 19th, 2021 *** by sending an email to the workshop selection committee (details at the end of the call). You should expect notification on the acceptance of your proposal within one week. A workshop or tutorial proposal submission should consist of: - workshop's name and URL (if already available) - workshop's organisers together with their email addresses and web pages; - short description of the area covered by the workshop and the motivation behind it; - expected number of participants (if available, please include the data of previous years); - planned format of the event. As for the format, a standard option is a full one-day workshop consisting of invited talks by leading experts and of shorter contributed talks, either directly invited by the organisers or selected among submissions. Deviations from this standard are also warmly welcome, including a shorter or a longer time span than a full day, or other elements of the schedule like open problem sessions, discussion panels, or working sessions. If you plan to have invited speakers, please specify their expected number and, if possible, tentative names. If you plan a call for papers or for contributed talks followed by a selection procedure, the submission date should be scheduled after ICALP 2021 notification (April 28, 2021), while the notification should take place before the early registration deadline. In your submission please include details on the schedule, planned procedure of selecting papers and/or contributed talks. If you plan to have published proceedings of your workshop, please provide the name of the publisher. Please be advised that ICALP 2021 is not able to provide any financial support for publishing workshop proceedings. Important dates: Workshop Proposals Deadline: Friday February 19, 2021 Workshop Notification: Monday Friday February 26, 2021 Workshops: Monday July 12, 2021 Conference: Tuesday July 13 - Friday July 16, 2021 Workshop selection committee: Ornela Dardha ornela.dardha at glasgow.ac.uk Gethin Norman gethin.norman at glasgow.ac.uk From serge.autexier at dfki.de Wed Jan 27 03:19:21 2021 From: serge.autexier at dfki.de (Serge Autexier) Date: Wed, 27 Jan 2021 09:19:21 +0100 (CET) Subject: [TYPES/announce] 14th Conference on Intelligent Computer Mathematics (CICM 2021), First call for papers & Save-the-Conference-Date: July 26-31, 2021 Message-ID: <20210127081921.09C9914248C4@gigondas.localdomain> Call for Papers formal papers - informal papers - doctoral programme 14th Conference on Intelligent Computer Mathematics - CICM 2021 - July 26-31, 2020 Timisoara, Romania http://www.cicm-conference.org/2021 ---------------------------------------------------------------------- Digital and computational solutions are becoming the prevalent means for the generation, communication, processing, storage and curation of mathematical information. CICM brings together the many separate communities that have developed theoretical and practical solutions for mathematical applications such as computation, deduction, knowledge management, and user interfaces. It offers a venue for discussing problems and solutions in each of these areas and their integration. CICM 2021 Programme committee: see https://www.cicm-conference.org/2021/cicm.php?event=&menu=pc CICM 2021 invites submissions in all topics relating to intelligent computer mathematics, in particular but not limited to * theorem proving and computer algebra * mathematical knowledge management * digital mathematical libraries CICM appreciates the varying nature of the relevant research in this area and invites submissions of different forms: 1) Formal submissions will be reviewed rigorously and accepted papers will be published in a volume of Springer LNCS: * regular papers (up to 15 pages including references) present novel research results * project and survey papers (up to 15 pages + bibliography) summarize existing results * system and dataset descriptions (up to 5 pages including references) present digital artifacts * system entry (1 page according to the given LaTeX template) provides metadata and a quick overview of a new tool or a new release of an existent tool 2) Informal submissions will be reviewed with a positive bias and selected for presentation based on their relevance for the community. * informal papers may present work-in-progress, project announcements, position statements, etc. * posters and system demos will be presented in parallel in special sessions 3) The doctoral programme provides PhD students with a forum to present early results and receive constructive feedback and mentoring. *** Important Dates *** - Abstract deadline: March 15, 2021 - Full paper deadline: March 26, 2021 - Reviews sent to authors: May 4, 2021 - Rebuttals due: May 8, 2021 - Notification of acceptance: May 13, 2021 - Camera-ready copies due: May 29, 2021 - Conference: July 26-31, 2021 Informal submissions and doctoral programme - Submission deadline: May 15, 2021 - Notification of acceptance: June 1, 2021 All submissions should be made via easychair at https://easychair.org/conferences/?conf=cicm2021 As in previous years, we will publish the CICM 2021 proceedings with Springer LNCS. From harley.eades at gmail.com Thu Jan 28 11:12:23 2021 From: harley.eades at gmail.com (Harley D. Eades III) Date: Thu, 28 Jan 2021 11:12:23 -0500 Subject: [TYPES/announce] Seminar talk on the semantics of bisimilarity Message-ID: Hi, everyone. On Friday, Feb. 5, 2021 between 9am and 10am EST (2pm - 3pm UTC), Dr. Shin-ya Katsumata will be giving a presentation as part of the CS Colloquium Series at Augusta University. Presentation details can be found here: https://the-au-forml-lab.github.io/colloquium_talks/Katsumata.html Shin-ya will discuss his work on a purely categorical characterization of bisimilarity. It's going to be a great talk! These talks are open to the general public via Zoom. I'll also be living streaming it on Youtube. So if you are interested in attending the Zoom meeting please RSVP with me before the talk. Questions will be taken from those on Zoom and YouTube. If you care to watch via YouTube, please use the following link: https://youtu.be/8auEgwMvoOc Feel free to share this message with everyone you know. I hope all of you, your family and friends are doing well! Very best, Harley -------------- next part -------------- An HTML attachment was scrubbed... URL: From m.sadrzadeh at ucl.ac.uk Fri Jan 29 04:50:00 2021 From: m.sadrzadeh at ucl.ac.uk (Sadrzadeh, Mehrnoosh) Date: Fri, 29 Jan 2021 09:50:00 +0000 Subject: [TYPES/announce] First Call for Nominations: Beth Outstanding Dissertation Prize (BODP) 2021 Message-ID: First Call for Nominations: E. W. Beth Outstanding Dissertation Prize 2021 Since 2002, the Association for Logic, Language, and Information (FoLLI) has been awarding the annual E.W. Beth Dissertation Prize to outstanding Ph.D. dissertations in Logic, Language, and Information (http://www.folli.info/?page_id=74), with financial support of the E.W. Beth Foundation (https://www.knaw.nl/en/awards/funds/evert-willem-beth-stichting/evert-willem-beth-foundation). Nominations are now invited for the best dissertation in these areas resulting in a Ph.D. degree awarded in 2020. The deadline for nominations is the 15th of April 2021. Qualifications: - A Ph.D. dissertation on a topic concerning Logic, Language, or Information is eligible for the Beth Dissertation Prize 2021, if the degree was awarded between January 1st and December 31st, 2020. - There are no restrictions on the nationality, ethnicity, age, gender or employment status of the author of the nominated dissertation, nor on the university, academic department or scientific institution formally conferring the Ph.D. degree, nor on the language in which the dissertation has originally been written. - In accordance with the aim of the Beth Foundation to continue and extend the work of the Dutch logician Evert Willem Beth, nominations are invited of excellent dissertations on topics in the broad remit of ESSLLI, including current topics in philosophical and mathematical logic, computer science logic, philosophy of science, philosophy of language, history of logic, history of the philosophy of science and scientific philosophy in general, as well as the current theoretical and foundational developments in information and computation, language, and cognition. Dissertations with results more broadly impacting various research areas in their interdisciplinary investigations are especially solicited. - If a nominated dissertation has originally been written in a language other than English, its dossier should still contain the required 10 page English abstract, see below. If the committee decides that a nominated dissertation in a language other than English requires translation to English for proper evaluation, the committee can transfer its nomination to the competition in 2022. The English translation must in such cases be submitted before the deadline of the call for nominations in 2022. The committee may recommend the Beth Foundation to consider supporting such nominated dissertations for English translation, upon request by the author of the dissertation. The prize consists of: - a certificate - a donation of 3000 euros, provided by the E.W. Beth Foundation - an invitation to submit the dissertation, possibly after revision, for publication in FoLLI Publications on Logic, Language and Information (Springer). Only digital submissions are accepted, without exception. Hard copy submissions are not allowed. The following documents are to be submitted in the nomination dossier: - The original dissertation in pdf format (ps/doc/rtf etc. not acceptable). - A ten-page English abstract of the dissertation, presenting the main results of each chapter. - A letter of nomination from the dissertation supervisor, which concisely describes the scope and significance of the dissertation, stating when the degree was officially awarded and the members of the Ph.D. committee. Nominations should contain the address, phone and email details of the nominator. - Two additional letters of support, including at least one from a referee not affiliated with the academic institution that awarded the Ph.D. degree, nor otherwise related to the nominee (e.g. former teachers, supervisors, co-authors, publishers or relatives) or the dissertation. - Self-nominations are not possible. All pdf documents must be submitted electronically, as one zip file, via EasyChair by following the link https://easychair.org/conferences/?conf=bodp2021. In case of any problems or questions please contact the chair of the committee Mehrnoosh Sadrzadeh (m.sadrzadeh at ucl.ac.uk). The prize will be awarded by the chair of the FoLLI board at a ceremony during the 32nd ESSLLI summer school in Utrecht, August 2-13, 2021. Beth dissertation prize committee 2021: Samson Abramsky (University of Oxford) Maria Aloni (University of Amsterdam) Cleo Condoravdi(Stanford University) Robin Cooper (University of Gothenburg) Guy Emerson (University of Cambridge) Katrin Erk (University of Texas at Austin) Sujata Ghosh (ISI, Chennai) Davide Grossi (Universities of Groningen and Amsterdam) Christoph Haase (University of Oxford) Louise McNally (Universitat Pompeu Fabra Barcelona) Reinhard Muskens (University of Amsterdam) Mehrnoosh Sadrzadeh (University College London, chair) Mark Steedman (University of Edinburgh) Matthew Stone (Rutgers University) Jouko Vaananen (University of Helsinki and University of Amsterdam) FoLLI is committed to diversity and inclusion and we welcomes dissertations from all under-represented groups -------------- next part -------------- An HTML attachment was scrubbed... URL: From delphine.demange at irisa.fr Fri Jan 29 13:29:05 2021 From: delphine.demange at irisa.fr (Delphine Demange) Date: Fri, 29 Jan 2021 19:29:05 +0100 Subject: [TYPES/announce] Compiler Construction (CC) 2021 - Call for Participation Message-ID: <377AFE6C-D9F9-49B2-AAD4-267E27666857@irisa.fr> ACM SIGPLAN 2021 International Conference on Compiler Construction (CC 2021) Co-located with CGO, HPCA and PPoPP Sat 27 February - Wed 3 March 2021 https://conf.researchr.org/home/CC-2021 The International Conference on Compiler Construction (CC) is interested in work on processing programs in the most general sense: analyzing, transforming or executing input that describes how a system operates, including traditional compiler construction as a special case. CC 2021 is the 30th edition of the conference. CC is now an ACM SIGPLAN conference, and implements guidelines and procedures recommended by SIGPLAN (https://www.sigplan.org). IMPORTANT INFORMATION Registration is now open! CC Conference date : 2-3 March 2021 CC 2021 will be held virtually and co-located with CGO, PPoPP, and HPCA, on the Whova platform. Any person registering for CC can attend any of the co-located workshops and conferences. Register for the conference at: https://conf.researchr.org/attending/CC-2021/registration PROGRAM and VENUE INFORMATION List of Accepted Papers: https://conf.researchr.org/track/CC-2021/cc-research-papers#event-overview Program: https://conf.researchr.org/track/CC-2021/cc-research-papers#program For more information, please visit the CC 2021 conference web site at: https://conf.researchr.org/home/CC-2021 SPONSORS AND SUPPORTERS ACM - Association for Computing Machinery SIGPLAN - ACM Special Interest Group on Programming Languages The University of Edinburgh, School of Informatics ICSA - Institute for Computing Systems Architecture From johannp at appstate.edu Sun Jan 31 17:22:56 2021 From: johannp at appstate.edu (Patricia Johann) Date: Sun, 31 Jan 2021 17:22:56 -0500 (EST) Subject: [TYPES/announce] Postdoc opening in categorical semantics Message-ID: Dear Folks, I have an opening for a postdoc, as described in the ad below. In addition to accepting applications, I will be very happy to respond to informal enquiries about any aspect of the position, from technical ones to ones about life in a beautiful, "alternative" mountain town in western North Carolina. Best wishes, -patricia -------- Applications are invited for a postdoctoral researcher position in the Computer Science Department at Appalachian State University. The position is part of an NSF-funded project on the categorical semantics of advanced data types, such as nested types, GADTs, and other higher-kinded data types. The project aims to build on recent work on higher-kinded data types to understand the categorical settings in which they have initial algebra semantics. One primary goal is to classify such types according to the complexity of the categorical settings in which they have well-defined initial algebra semantics. Another is to understand what parametricity means, practically speaking, for them. The ideal applicant will have a strong background in functional programming, type theory, and category theory, although more expertise in one area may, together with a commitment to developing the required competencies, compensate for less in another. The successful applicant will also be excited about working on fundamental research questions on the themes of categorical semantics of data types and parametricity. Interests in applications and/or formalizing computer science theory in, e.g., Agda, are also welcome. The successful hire will work on the funded project with Prof. Patricia Johann at Appalachian State University, her students, and collaborating researchers. (Due to COVID-19, remote work may be possible for some initial portion of the position.) The duration of the position is initially one year, with guaranteed continuation by mutual agreement. The position will start at a mutually agreeable date, ideally on or around 1 July 2021. Compensation will be competitive and commensurate with experience. Interested persons should first contact Patricia Johann at johannp at appstate.edu, briefly outlining their academic background and research interests, and why they are interested in the position. A complete application will consist of a cover letter and CV, including contact information for three academic references. Complete applications should be made online at https://appstate.peopleadmin.com/postings/27464 Review of applications will begin on 15 February 2021 and continue until the position is filled. Appalachian State University is an Affirmative Action/Equal Opportunity Employer. The University does not discriminate in access to its educational programs and activities, or with respect to hiring or the terms and conditions of employment, on the basis of race, color, national origin, religion, sex, gender identity and expression, political affiliation, age, disability, veteran status, genetic information or sexual orientation. Individuals with disabilities may request accommodations in the application process by contacting Patricia Johann. Any offer of employment to a successful candidate will be conditioned upon the University's receipt of a satisfactory criminal background report. From Simon.Fowler at glasgow.ac.uk Mon Feb 1 11:54:35 2021 From: Simon.Fowler at glasgow.ac.uk (Simon Fowler) Date: Mon, 1 Feb 2021 16:54:35 +0000 Subject: [TYPES/announce] ProWeb21: Deadline Extension (8th February) Message-ID: We have decided to extend the deadline of ProWeb21, held online alongside '21; the new deadline is 8th February 2021. Please find the updated CfP below. === ProWeb21: 5th International Workshop on Programming Technology for the Future Web https://2021.programming-conference.org/track/proweb-2021-papers Co-located with the conference March 22nd - 26th, Online Submission link: https://easychair.org/conferences/?conf=proweb21 ** DEADLINE EXTENSION: 8th February 2021 ** ================ Full-fledged web applications have become ubiquitous on desktop and mobile devices alike. Whereas ?responsive? web applications already offered a more desktop-like experience, there is an increasing demand for ?rich? web applications (RIAs) that offer collaborative and even off-line functionality: Google Docs being the prototypical example. Long gone are the days that web servers merely had to answer incoming HTTP requests with a block of static HTML. Today?s servers react to a continuous stream of events coming from JavaScript applications that have been pushed to clients. As a result, application logic and data are increasingly distributed and traditional dichotomies such as ?client vs. server? and ?offline vs. online? are fading. ** Call for Contributions ** The ProWeb21 workshop is a forum for researchers and practitioners to share and discuss new technology for programming these and future evolutions of the web. We welcome submissions introducing programming technology (i.e., frameworks, libraries, programming languages, program analyses, and development tools) and formalisms for implementing web applications and for maintaining their quality, as well as experience reports about their usage. Relevant topics include, but are not limited to: * Applications of AI to web software development: code models, code prediction, change impact analysis, automated testing * Web App Quality: static and dynamic program analyses, metrics, development tools, automated testing, contract systems, type systems, migration from legacy architectures, web service APIs, API conformance checking * Designing for and hosting novel languages on the web: compilation to JavaScript, WebAssembly * Multi-tier (or tierless) programming: new languages and runtimes, tier-splitting compilers, type systems * Principles and practice of Web UI programming: data binding, reactive programming, virtual DOM * Data sharing, replication, and consistency: cloud types, CRDTs, eventual consistency, offline storage, peer-to-peer communication * Security on the new web: security policies, policy enforcement, membranes, vulnerability detection, dynamic patching * Surveys and case studies using state-of-the-art web technology (e.g., WebAssembly, WebSockets, Web Storage, Service Workers, WebRTC, Angular.js, React and React Native, TypeScript, Proxies, PureScript, ClojureScript, Amber Smalltalk, Scala.js) * Ideas on and experience reports about: how to reconcile the need for quality with the need for agility on the web, how to master and combine the myriad of tier-specific technologies required to develop a web application * Position papers on what the future of the web will look like This year, we are accepting three types of submission: * **Full papers, position papers, and experience reports**: 8-page papers describing novel research, which, when accepted, will be included in the ACM Digital Library. * **Demo papers**: 4-page extended abstracts illustrating demonstrations of tools and prototypes. * **Presentation abstracts**: 2-page extended abstracts. Presentation abstracts will not be included in the ACM Digital Library but will be included in an informal pre-proceedings on the website. We very much welcome presentation abstracts about work already published elsewhere, or giving an overview of an existing system, and the format is designed not to preclude future publication. Submissions should be in ACM SIGPLAN two-column format (see https://www.sigplan.org/Resources/Author/). References are not counted in the page limits. If you have any questions or wonder whether your submission is in scope, please do not hesitate to contact the PC co-chairs. More information: https://2021.programming-conference.org/track/proweb-2021-papers ** Important dates (AoE) ** - Submission deadline: 8th February 2021 (Extended) - Author notification: 1st March 2021 - Camera-ready version: 1st May 2021 ** Organizers ** - Simon Fowler, University of Glasgow, Scotland, UK - Andrea Stocco, Universit? della Svizzera italiana (USI), Switzerland ** Program Committee ** - Andrea Gallidabino (USI Lugano, Switzerland) - Daniel Hillerstr?m (University of Edinburgh, UK) - Magnus Madsen (Aarhus University, Denmark) - Jens Nicolay (Vrije Universiteit Brussel, Belgium) - Gabriela Sampaio (Imperial College London, UK) -------------- next part -------------- An HTML attachment was scrubbed... URL: From ornela.dardha at gmail.com Mon Feb 1 12:50:09 2021 From: ornela.dardha at gmail.com (Ornela Dardha) Date: Mon, 1 Feb 2021 17:50:09 +0000 Subject: [TYPES/announce] COORDINATION'21: Last Call for Papers Message-ID: <7A57B293-8F28-49EB-AE2C-29664712DBBC@gmail.com> *********************************************************************************** 23rd International Conference on Coordination Models and Languages COORDINATION 2021 14-18th of June, 2021 at the University of Malta, Valletta, Malta https://www.discotec.org/2021/coordination COORDINATION 2021 is one of the three conferences of DisCoTec 2021 *********************************************************************************** HIGHLIGHTS Deadlines February 12, 2021 ? abstract submission (extended) February 19, 2021 ? paper submission (extended) Keynote Speakers: Gilles Fedak, iExec, FR Mira Mezini, Technical University of Darmstadt, DE Alexandra Silva, University College London, UK Submission link ?https://easychair.org/conferences/?conf=coordination2021 Types of contribution Following the success of previous years, we welcome a range of contributions other than regular full papers: survey papers, short papers and tool papers. Special topics We plan to have dedicated sessions in the program on the following three special topics (details below): Configurable Systems in the DevOps Era, Microservices, and Techniques to reason about interacting digital contracts. SCOPE Modern information systems rely increasingly on combining concurrent, distributed, mobile, adaptive, reconfigurable and heterogeneous components. New models, architectures, languages and verification techniques are necessary to cope with the complexity induced by the demands of today?s software development. Coordination languages have emerged as a successful approach, in that they provide abstractions that cleanly separate behaviour from communication, therefore increasing modularity, simplifying reasoning, and ultimately enhancing software development. Building on the success of the previous editions, this conference provides a well-established forum for the growing community of researchers interested in models, languages, architectures, and implementation techniques for coordination. MAIN TOPICS OF INTEREST Topics of interest encompass all areas of coordination, including (but not limited to) coordination related aspects of: - Theoretical models and foundations for coordination: component composition, concurrency, mobility, dynamic, spatial and probabilistic aspects of coordination, logic, emergent behaviour, types, semantics; - Specification, refinement, and analysis of architectures: patterns and styles, verification of functional and non-functional properties, including performance and security aspects; - Dynamic software architectures: distributed mobile code, configuration, reconfiguration, networked computing, parallel, high-performance and cloud computing; - Nature- and bio-inspired approaches to coordination; - Coordination of multiagent and collective systems: models, languages, infrastructures, self-adaptation, self-organisation, distributed solving, collective intelligence and emerging behaviour; - Coordination and modern distributed computing: web services, peer-to-peer networks, grid computing, context-awareness, ubiquitous computing, mobile computing; - Coordination platforms for infrastructures of emerging new application domains like IoT, fog- and edge-computing; - Programming methodologies, languages, middleware, tools, and environments for the development and verification of coordinated applications; - Tools, languages and methodologies for secure coordination; - Industrial relevance of coordination and software architectures: programming in the large, domain-specific software architectures and coordination models, case studies; - Interdisciplinary aspects of coordination; - Industry-led efforts in coordination and case studies. SPECIAL TOPICS COORDINATION 2021 is seeking contributions that enable the cross-fertilisation with other research communities in computer science or in other engineering or scientific disciplines. Depending on the quality of the contributions, we plan to have dedicated sessions in the program, possibly together with a panel discussion. 1. Configurable Systems in the DevOps Era Highly configurable software systems, such as software product lines, call for automatic mechanisms that allow to tame the complexity and variability. DevOps have pushed forward the importance of automating every step of the software development process, including the management of configurable systems. In this special topic, we welcome submissions addressing novel techniques and methodologies for the COORDINATION of automatic configuration tasks or for the COORDINATION of the various phases from development to deployment supporting the continuous release of software/products. Moreover, given the relevance of the topic to industry and aligned with the main topics of COORDINATION, we encourage submissions of efforts carried out in collaboration with industry, including case studies. Contacts: Maurice ter Beek (maurice.terbeek at isti.cnr.it) and Hugo Torres Vieira (hugo.torres.vieira at ubi.pt) 2. Microservices (in collaboration with the Microservices Community) Microservices are a novel architectural style, taking to an extreme the ideas of service-oriented computing. In microservices, applications are composed by loosely coupled entities, the microservices. Beyond that, single microservices should be small enough to be easily managed, modified, and if needed removed and rewritten from scratch. Microservices aim at obtaining high flexibility, reconfigurability and scalability, thanks also to the exploitation of containerization technologies such as Docker. Given that microservice-based applications are composed of many loosely-coupled microservices, techniques allowing one to coordinate their execution in order to obtain the desired behaviour are of paramount importance. Contacts: Ivan Lanese (ivan.lanese at unibo.it) and Larisa Safina (larisa.safina at inria.fr) 3. Techniques to reason about interacting digital contracts With the rise of blockchains and cryptocurrencies, digital contracts have become popular in the form of smart contracts, which encode a financial transaction between possibly distrusting parties using a distributed consensus protocol. Although smart contracts bear the potential to benefit society quite fundamentally (e.g., equalize access to financial infrastructure, increase fairness), the benefits are shadowed by the existence of severe security vulnerabilities in deployed smart contracts and smart contract languages. In the 2021 edition of COORDINATION, we are soliciting contributions on new programming language paradigms and patterns for expressing digital contract interactions, verification and analysis techniques for checking safety and liveness properties and guaranteeing correctness of digital contracts, as well as compositionality and scalability of digital contract reasoning techniques. Contacts: Stephanie Balzer (balzers at cs.cmu.edu) and Anastasia Mavridou (anastasia.mavridou at nasa.gov) TOOL PAPERS We welcome tool papers that describe experience reports, technological artefacts and innovative prototypes (including engines, APIs, etc.), for coordinating, modelling, analysing, simulating or testing systems, as well as educational tools in the scope of the research topics of COORDINATION. In addition, we welcome submissions promoting the integration of existing tools relevant to the community. Submissions to the tool track must include a tool paper and a link to a demo video that previews the potential tool presentation at the conference. Both the tool paper and the video will be decisive criteria in the selection process. Authors of accepted contributions will be able (and encouraged) to extend their tool paper to a (regular) full paper before appearance in the conference proceedings, which will be subject to a lightweight revision process. Interested authors can contact the tool track chairs (Giorgio Audrito giorgio.audrito at unito.it , Silvia Lizeth Tapia Tarifa sltarifa at ifi.uio.no ) for details. SUBMISSIONS Important Dates February 12, 2021 ? abstract submission February 19, 2021 ? paper submission April 2, 2021 ? notification April 23, 2021 ? camera ready PUBLICATION Authors are invited to submit papers electronically in PDF using a two-phase online submission process. Registration of the paper information and abstract must be completed according to the DisCoTec submission dates. Submissions are handled through the EasyChair conference management system, accessible from the conference web site: ?https://easychair.org/conferences/?conf=coordination2021 Contributions must be written in English and report on original, unpublished work not submitted for publication elsewhere (cf. IFIP?s Author Code of Conduct, see http://www.ifip.org/ under Publications/Links). The submissions must not exceed the total page number limit (see below) prepared using Springer?s LNCS style. Submissions not adhering to the above specified constraints may be rejected without review. Submission categories - Full papers (up to 15 pages + 2 pages references): describing thorough and complete research results and experience reports. - Short papers (up to 6 pages + 2 pages references): describing research in progress or opinion papers on the past of Coordination research, on the current state of the art, or on prospects for the years to come. - Survey papers (up to 25 pages + 2 pages references): describing important results and successful stories that originated in the context of COORDINATION. - Tool papers (up to 6 pages + 2 pages references): describing technological artefacts in the scope of the research topics of COORDINATION. The paper must contain a link to a publicly downloadable MPEG-4 demo video of at most 10 minutes length. ATTENTION: if you believe that your submission is related to one of the three special topics (Configurable Systems in the DevOps Era, Microservices, Techniques to reason about interacting digital contracts), then please indicate the name of the special topic as the first of the Author keywords in the online submission system. The authors of accepted papers (in any submission category) will be encouraged to make their artefacts publicly available using permanent repositories such as Zenodo etc. (for Tool papers, the tool should already be available at submission time for reviewing purposes, but not necessarily via a permanent archive with a DOI). The conference proceedings, formed by accepted submissions will be published by Springer in the LNCS Series. Special Issues Following the tradition of previous editions of COORDINATION, according to the quality and number of the submission, we will organise special issues of extended and selected Full/Short/Survey/Tool papers in reputable journals such as LMCS (Logical Methods in Computer Science) and SCP (Science of Computer Programming). Special issues for last year?s edition are under preparation and we will advertise them on the conference?s website as soon as they get published. COMMITTEES Program committee chairs Ferruccio Damiani (ferruccio.damiani at unito.it) (University of Turin, Italy) Ornela Dardha (ornela.dardha at glasgow.ac.uk) (University of Glasgow, UK) Tool track chairs Giorgio Audrito (University of Turin, Italy) Silvia Lizeth Tapia Tarifa (University of Oslo, Norway) Program committee Zena M. Ariola (University of Oregon, USA) Robert Atkey (University of Strathclyde, UK) Giorgio Audrito (University of Turin, Italy) Stephanie Balzer (CMU, USA) Maurice H. ter Beek (CNR-ISTI, Italy) Simon Bliudze (Inria Lille - Nord Europe, France) Laura Bocchi (University of Kent, UK) Roberto Casadei (Alma Mater Studiorum - Universit? di Bologna, Italy) Vashti Galpin (University of Edinburgh, UK) Fatemeh Ghassemi (University of Tehran, Iran) Elisa Gonzalez Boix (Vrije Universiteit Brussel, Belgium) Omar Inverso (Gran Sasso Science Institute, Italy) Jean-Marie Jacquet (University of Namur, Belgium) Eva K?hn (Vienna University of Technology, Austria) Ivan Lanese (University of Bologna, Italy) Alberto Lluch Lafuente (DTU, Denmark) Michele Loreti (University of Camerino, Italy) Mieke Massink (CNR-ISTI, Italy) Anastasia Mavridou (NASA Ames Research Center, USA) Hernan Melgratti (Universidad de Buenos Aires, Argentina) Violet Ka I Pun (Western Norway University of Applied Sciences, Norway) Larisa Safina (Inria - Lille Nord Europe, France) Gwen Sala?n (Universit? Grenoble Alpes, France) Meng Sun (Peking University, China) Vasco T. Vasconcelos (University of Lisbon, Portugal) Carolyn Talcott (SRI International, California, USA) Silvia Lizeth Tapia Tarifa (University of Oslo, Norway) Peter Thieman (Universit?t Freiburg, Germany) Hugo Torres Vieira (C4 - Universidade da Beira Interior, Portugal) Tarmo Uustalu (Reykjavik University, Iceland) Steering committee Gul Agha (University of Illinois at Urbana Champaign, USA) Farhad Arbab (CWI and Leiden University, The Netherlands) Simon Bliudze (Inria Lille - Nord Europe, France) Laura Bocchi (University of Kent, UK) Wolfgang De Meuter (Vrije Universiteit Brussels, Belgium) Rocco De Nicola, IMT (School for Advanced Studies Lucca, Italy) Giovanna di Marzo Serugendo (Universit? de Gen?ve, Switzerland) Tom Holvoet (KU Leuven, Belgium) Jean-Marie Jacquet (University of Namur, Belgium) Christine Julien (The University of Texas at Austin, USA) Eva K?hn (Vienna University of Technology, Austria) Alberto Lluch Lafuente (Technical University of Denmark, Denmark) Michele Loreti (University of Camerino, Italy) Mieke Massink (ISTI CNR, Italy) - Chair) Jos? Proen?a (CISTER, ISEP, Portugal) Rosario Pugliese (Universit? di Firenze, Italy) Hanne Riis Nielson (DTU, Denmark) Marjan Sirjani (M?lardalen University, Sweden) Carolyn Talcott (SRI International, California, USA) Emilio Tuosto (Gran Sasso Science Institute, Italy) Vasco T. Vasconcelos (University of Lisbon, Portugal) Mirko Viroli (Alma Mater Studiorum - Universit? di Bologna, Italy) Gianluigi Zavattaro (Alma Mater Studiorum - Universit? di Bologna, Italy) -------------- next part -------------- An HTML attachment was scrubbed... URL: From duncan.attard.01 at um.edu.mt Mon Feb 1 14:18:05 2021 From: duncan.attard.01 at um.edu.mt (Duncan Paul Attard) Date: Mon, 1 Feb 2021 20:18:05 +0100 Subject: [TYPES/announce] CFP DisCoTec 2021 [EXTENDED DEADLINE] Message-ID: <5D0CAF53-3A5E-48E5-95F2-526D5CE5B512@um.edu.mt> [Apologies for multiple postings] ************************************************************************ Joint Call for Papers 16th International Federated Conference on Distributed Computing Techniques DisCoTec 2021 Valletta, Malta, 14-18 June 2021 https://www.discotec.org/2021 ************************************************************************ DisCoTec 2021 is one of the major events sponsored by the International Federation for Information Processing (IFIP) and the European Association for Programming Languages and Systems (EAPLS). It gathers conferences and workshops that cover a broad spectrum of distributed computing subjects ? from theoretical foundations and formal description techniques, testing and verification methods, to language design and system implementation approaches. * Main Conferences * - COORDINATION (https://www.discotec.org/2021/coordination) 23rd International Conference on Coordination Models and Languages PC Chairs: Ferruccio Damiani (University of Turin, IT) and Ornela Dardha (University of Glasgow, UK) - DAIS (https://www.discotec.org/2021/dais) 21st International Conference on Distributed Applications and Interoperable Systems PC Chairs: Fab?ola Greve (Federal University of Bahia, BR) and Miguel Matos (University of Lisboa & INESC-ID, PT) - FORTE (https://www.discotec.org/2021/forte) 41st International Conference on Formal Techniques for Distributed Objects, Components and Systems PC Chairs: Kirstin Peters (Technical University of Darmstadt, DE) and Tim Willemse (Eindhoven University of Technology, NL) Important dates (for all main conferences): - February 12, 2021: Abstract submission deadline (EXTENDED) - February 19, 2021: Paper submission deadline (EXTENDED) - April 2, 2021: Notification of accepted papers - April 23, 2021: Camera-ready papers deadline - June 14-18, 2021: Conferences and workshops * Keynote Speakers * - Gilles Fedak (iExec, FR) - Mira Mezini (Technical University of Darmstadt, DE) - Alexandra Silva (University College London, UK) * Submission Categories * COORDINATION - Full papers (up to 15 pages + 2 pages references) - Short papers (up to 6 pages + 2 pages references) - Survey papers (up to 25 pages + 2 pages references) - Tool papers (up to 6 pages + 2 pages references + 10 minute demo video) DAIS - Full papers (up to 15 pages + 2 pages references) - Full practical experience reports (up to 15 pages + 2 pages references) - Work-in-progress (up to 6 pages + 2 pages references) FORTE - Full papers (up to 15 pages + 2 pages references) - Short papers (up to 6 pages + 2 pages references) - ?Journal First? papers (up to 4 pages, including references) * Proceedings * The proceedings of the DisCoTec 2021 main conferences will be published in Springer's LNCS-IFIP volumes. * Special issue * The individual conferences will organise special issues of extended and selected papers in a reputable journal such as Logical Methods in Computer Science and the Journal of Parallel and Distributed Computing. More information is available on the conference website. * Submission Instructions * Authors are invited to submit their contributions electronically in PDF using a two-phase online submission process. The registration of the paper information and abstract (max. 250 words) must be completed before January 29, 2021. Submission of the manuscript is due by no later than February 5, 2021. Submissions are handled through the EasyChair conference management system: - https://easychair.org/conferences/?conf=dais2021 - https://easychair.org/conferences/?conf=forte21 - https://easychair.org/conferences/?conf=coordination2021 Contributions must be written in English and report on original, unpublished work that has not been submitted for publication elsewhere (cf. IFIP's Author Code of Conduct, see http://www.ifip.org/ under Publications/Links). The submissions ? prepared using Springer?s LNCS style ? must not exceed the total page limit, including figures and references. Submissions not adhering to the above-specified constraints may be rejected without review. For each accepted paper, one of the authors must register to DisCoTec 2021, and attend the corresponding conference to present the paper. * Satellite Events * DisCoTec also features workshops, tutorials, and a tool track. Workshops, tutorials, and tools demonstrations should fall in the areas of the DisCoTec conferences. For more information refer to the website. * Organising Committee * - Adrian Francalanza (University of Malta, MT ? General Chair) - Caroline Caruana (University of Malta, MT ? Publicity Chair) - Jasmine Xuereb (University of Malta, MT ? Publicity Chair) - Duncan Paul Attard (University of Malta, MT ? Workshops Chair) - Christian Bartolo Burl? (Gran Sasso Science Institute, IT ? Workshops Chair) - Lucienne Bugeja (University of Malta, MT ? Logistics) * Steering Committee * - Gianluigi Zavattaro (University of Bologna, IT ? Chair) - Rocco De Nicola (IMT Lucca, IT) - Kurt Geihs (University of Kasel, DE) - Elie Najm (Telecom Paris Tech, FR) - Mieke Massink (CNR-ISTI, IT) - Lu?s Veiga (INESC-ID, Universidade de Lisboa, PT) - Ivan Lanese (University of Bologna/INRIA, IT) - Manuel N??ez (Universidad Complutense de Madrid, ES) - Alberto Lluch Lafuente (Technical University of Denmark, DK) - Adrian Francalanza (University of Malta, MT) To receive live, up-to-date information, follow us on Twitter @DisCoTecConf. From niki.vazou at imdea.org Tue Feb 2 04:24:13 2021 From: niki.vazou at imdea.org (niki.vazou) Date: Tue, 02 Feb 2021 10:24:13 +0100 Subject: [TYPES/announce] PhD position at IMDEA Software Institute Message-ID: Hey, ? Applications are invited for a PhD position at the IMDEA Software Institute, Madrid, Spain.?The selected candidate will work under my supervision?on the theory and practise of refinement types. Application deadline is March 15.?More?information are available here:?https://software.imdea.org/open_positions/2021-02-phd-refinements.html Best,? Niki Vazou From kutsia at risc.jku.at Tue Feb 2 06:19:58 2021 From: kutsia at risc.jku.at (Temur Kutsia) Date: Tue, 2 Feb 2021 12:19:58 +0100 Subject: [TYPES/announce] CfP: SCSS 2021 Message-ID: ========================= SCSS 2021 The 9th International Symposium on Symbolic Computation in Software Science -- In the era of Computational and Artificial Intelligence -- September 8--10, 2021, virtual Organized by RISC, Johannes Kepler University Linz, Austria https://www.risc.jku.at/conferences/scss2021/ ========================= Overview -------- Symbolic Computation is the science of computing with symbolic objects (terms, formulae, programs, representations of algebraic objects etc.). Powerful algorithms have been developed during the past decades for the major subareas of symbolic computation: computer algebra and computational logic. These algorithms and methods are successfully applied in various fields, including software science, which covers a broad range of topics about software construction and analysis. Meanwhile, artificial intelligence methods and machine learning algorithms are widely used nowadays in various domains and, in particular, combined with symbolic computation. Several approaches mix artificial intelligence and symbolic methods and tools deployed over large corpora to create what is known as cognitive systems. Cognitive computing focuses on building systems which interact with humans naturally by reasoning, aiming at learning at scale. The purpose of SCSS 2021 is to promote research on theoretical and practical aspects of symbolic computation in software science, combined with modern artificial?intelligence?techniques. Scope ------ SCSS 2021 solicits submissions on all aspects of symbolic computation and their applications in software science, in combination with artificial intelligence and cognitive computing techniques. The topics of the symposium include, but are not limited to the following: - automated reasoning, knowledge reasoning, common-sense reasoning and reasoning in science - algorithm (program) synthesis and/or verification, alignment and joint processing of formal, semi-formal, and informal libraries. - formal methods for the analysis of network and system security - termination analysis and complexity analysis of algorithms (programs) - extraction of specifications from algorithms (programs) - theorem proving methods and techniques, collaboration between automated and interactive theorem proving - proof carrying code - generation of inductive assertion for algorithm (programs) - algorithm (program) transformations - combinations of linguistic/learning-based and semantic/reasoning methods - formalization and computerization of knowledge (maths, medicine, economy, etc.) - methods for large-scale computer understanding of mathematics and science - artificial intelligence, machine learning and big-data methods in theorem proving and mathematics - formal verification of artificial intelligence and machine learning algorithms, explainable artificial intelligence, symbolic artificial intelligence - cognitive computing, cognitive vision, perception systems and artificial reasoners for robotics - component-based programming - computational origami - query languages (in particular for XML documents) - semantic web and cloud computing Important Dates --------------- May 18: title and single-paragraph abstract submission deadline. May 25: paper submission deadline. July 12: notification deadline. July 30: final paper submission deadline. September 8-10, 2021: the symposium dates (virtual). Invited Speakers ------ Tateaki Sasaki (University of Tsukuba, Japan) Martina Seidl (Johannes Kepler University Linz, Austria) More speakers will be announced. General Chairs ----- Adel Bouhoula (Arabian Gulf University, Bahrain) Tetsuo Ida (University of Tsukuba, Japan) Program Chair ----- Temur Kutsia (Johannes Kepler University, Austria) Program Committee --------- David Cerna (Czech Academy of Sciences, Czech Republic, and Johannes Kepler University Linz, Austria) Changbo Chen (Chinese Academy of Sciences, China) Rachid Echahed (CNRS, Grenoble, France) Seyed Hossein Haeri (UC Louvain, Belgium) Cezary Kaliszyk (University of Innsbruck, Austria) Yukiyoshi Kameyama (University of Tsukuba, Japan) Michael Kohlhase (University of Erlangen-Nuremberg, Germany) Laura Kovacs (Vienna University of Technology, Austria) Temur Kutsia (Johannes Kepler University Linz, Austria) (Chair) Zied Lachiri (ENIT, University of Tunis El Manar, Tunisia) Christopher Lynch (Clarkson University, USA) Mircea Marin ( West University of Timisoara, Romania) Yasuhiko Minamide (Tokyo Institute of Technology, Japan) Yoshihiro Mizoguchi (Kyushu University, Japan) Julien Narboux (Strasbourg University, France) Micha?l Rusinowitch (INRIA, France) Wolfgang Schreiner (Johannes Kepler University Linz, Austria) Sofiane Tahar (Concordia University, Canada) Dongming Wang (CNRS, Paris, France) To be extended. Submission ---------- Submission is via EasyChair: https://easychair.org/conferences/?conf=scss2021 Original submissions are invited in two categories: regular research papers and tool papers. We recommend to use the EPTCS Class format to prepare manuscripts. Regular research papers must not exceed 12 pages with up to 3 additional pages for technical appendices. Tool papers must not exceed 6 pages. They should include information about a URL from where the tool can be downloaded or accessed on-line. Publication ----------- The proceedings of SCSS 2021 will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS). A special issue of Annals of Mathematics and Artificial Intelligence (AMAI) will be organized after the symposium. Submitted full-length papers will be refereed according to the usual standards of the journal. From Hugo.Herbelin at inria.fr Tue Feb 2 06:27:06 2021 From: Hugo.Herbelin at inria.fr (Hugo Herbelin) Date: Tue, 2 Feb 2021 12:27:06 +0100 Subject: [TYPES/announce] =?iso-8859-1?q?Full_professor_and_associate_pro?= =?iso-8859-1?q?fessor_positions_available_at_IRIF_-_Universit=E9_de_Paris?= Message-ID: <20210202112706.dfvlh2yg5mr25nrj@yquem.inria.fr> Universit? de Paris is hiring a full professor in Computer Science in all research focuses of the IRIF lab (Institute for Research in Fundamental Computer Science) with a special attention on programming languages (design, analysis, certification, systems, logical/mathematical foundations). Two associate professor positions are also opened, one with a special attention given to programming languages and proofs. More details can be found here: https://www.irif.fr/postes/universite All these positions are tenured. Since teaching will be mostly in French, knowledge of the French language is mandatory. The deadline for application is 26 February 2021 From icfp.publicity at googlemail.com Tue Feb 2 10:58:02 2021 From: icfp.publicity at googlemail.com (Sam Tobin-Hochstadt) Date: Tue, 02 Feb 2021 10:58:02 -0500 Subject: [TYPES/announce] Call for Papers: PACMPL issue ICFP 2021 Message-ID: <6019768a626af_c46e221c2721@homer.mail> PACMPL Volume 5, Issue ICFP 2021 Call for Papers Accepted papers to be invited for presentation at The 26th ACM SIGPLAN International Conference on Functional Programming To Be Held Virtualy http://icfp21.sigplan.org/ ### Important dates Submissions due: 2 March 2021 (Tuesday) Anywhere on Earth https://icfp21.hotcrp.com Author response: 20 April (Tuesday) - 23 April (Friday) 17:00 UTC Notification: 7 May (Friday) Final copy due: 30 June (Wednesday) Conference: 22 August (Sunday) - 27 August (Friday) ### About PACMPL Proceedings of the ACM on Programming Languages (PACMPL ) is a Gold Open Access journal publishing research on all aspects of programming languages, from design to implementation and from mathematical formalisms to empirical studies. Each issue of the journal is devoted to a particular subject area within programming languages and will be announced through publicized Calls for Papers, like this one. ### Scope [PACMPL](https://pacmpl.acm.org/) issue ICFP 2021 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, and from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects, concurrency, or parallelism. Topics of interest include (but are not limited to): * Language Design: concurrency, parallelism, and distribution; modules; components and composition; metaprogramming; macros; pattern matching; type systems; type inference; dependent types; session types; gradual typing; refinement types; interoperability; domain-specific languages; imperative programming; object-oriented programming; logic programming; probabilistic programming; reactive programming; generic programming; bidirectional programming. * Implementation: abstract machines; virtual machines; interpretation; compilation; compile-time and run-time optimization; garbage collection and memory management; runtime systems; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components, or low-level machine resources. * Software-Development Techniques: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling; build systems; program synthesis. * Foundations: formal semantics; lambda calculus; program equivalence; rewriting; type theory; logic; category theory; monads; continuations; control; state; effects; names and binding; program verification. * Analysis and Transformation: control flow; data flow; abstract interpretation; partial evaluation; program calculation. * Applications: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; graphics and multimedia; GPU programming; scripting; system administration; security. * Education: teaching introductory programming; parallel programming; mathematical proof; algebra. Submissions will be evaluated according to their relevance, correctness, significance, originality, and clarity. Each submission should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience. PACMPL issue ICFP 2021 also welcomes submissions in two separate categories ? Functional Pearls and Experience Reports ? that must be marked as such when submitted and that need not report original research results. Detailed guidelines on both categories are given at the end of this call. Please contact the associate editor if you have questions or are concerned about the appropriateness of a topic. ### Preparation of submissions **Deadline**: The deadline for submissions is **Tuesday, March 2, 2021**, Anywhere on Earth (). This deadline will be strictly enforced. **Formatting**: Submissions must be in PDF format, printable in black and white on US Letter sized paper, and interpretable by common PDF tools. All submissions must adhere to the "ACM Small" template that is available (in both LaTeX and Word formats) from . There is a limit of **25 pages for a full paper or Functional Pearl** and **12 pages for an Experience Report**; in either case, the bibliography will not be counted against these limits. Submissions that exceed the page limits or, for other reasons, do not meet the requirements for formatting, will be summarily rejected. Supplementary material can and should be **separately** submitted (see below). See also PACMPL's Information and Guidelines for Authors at . **Submission**: Submissions will be accepted at Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. **Author Response Period**: Authors will have a 72-hour period, starting at 17:00 UTC on **Tuesday, April 20, 2021**, to read reviews and respond to them. **Supplementary Material**: Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. This supplementary material should **not** be submitted as part of the main document; instead, it should be uploaded as a **separate** PDF document or tarball. Supplementary material should be uploaded **at submission time**, not by providing a URL in the paper that points to an external repository. Authors are free to upload both anonymized and non-anonymized supplementary material. Anonymized supplementary material will be visible to reviewers immediately; non-anonymized supplementary material will be revealed to reviewers only after they have submitted their review of the paper and learned the identity of the author(s). **Authorship Policies**: All submissions are expected to comply with the ACM Policies for Authorship that are detailed at . **Republication Policies**: Each submission must adhere to SIGPLAN's republication policy, as explained on the web at . ### Review Process This section outlines the two-stage process with lightweight double-blind reviewing that will be used to select papers for PACMPL issue ICFP 2021. We anticipate that there will be a need to clarify and expand on this process, and we will maintain a list of frequently asked questions and answers on the PACMPL issue website to address common concerns. **PACMPL issue ICFP 2021 will employ a two-stage review process.** The first stage in the review process will assess submitted papers using the criteria stated above and will allow for feedback and input on initial reviews through the author response period mentioned previously. As a result of the review process, a set of papers will be conditionally accepted and all other papers will be rejected. Authors will be notified of these decisions on **May 7, 2021**. Authors of conditionally accepted papers will be provided with committee reviews along with a set of mandatory revisions. After four weeks (June 4, 2021), the authors will provide a second submission. The second and final reviewing phase assesses whether the mandatory revisions have been adequately addressed by the authors and thereby determines the final accept/reject status of the paper. The intent and expectation is that the mandatory revisions can be addressed within four weeks and hence that conditionally accepted papers will in general be accepted in the second phase. The second submission should clearly identify how the mandatory revisions were addressed. To that end, the second submission must be accompanied by a cover letter mapping each mandatory revision request to specific parts of the paper. The cover letter will facilitate a quick second review, allowing for confirmation of final acceptance within two weeks. Conversely, the absence of a cover letter will be grounds for the paper?s rejection. **PACMPL issue ICFP 2021 will employ a lightweight double-blind reviewing process.** To facilitate this, submitted papers 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 reviewers come to an initial judgement 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 the paper more difficult (e.g., important background references should not be omitted or anonymized). In addition, 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. ### Information for Authors of Accepted Papers * As a condition of acceptance, final versions of all papers must adhere to the new ACM Small format. The page limit for the final versions of papers will be increased by two pages to help authors respond to reviewer comments and mandatory revisions: **27 pages plus bibliography for a regular paper or Functional Pearl, 14 pages plus bibliography for an Experience Report**. * Authors of accepted submissions will be required to agree to one of the three ACM licensing options: open access on payment of a fee (**recommended**, and SIGPLAN can cover the cost as described next); copyright transfer to ACM; or retaining copyright but granting ACM exclusive publication rights. Further information about ACM author rights is available from . * PACMPL is a Gold Open Access journal, and authors are encouraged to publish their work under a CC-BY license. Gold Open Access guarantees permanent free online access to the definitive version in the ACM Digital Library, and the recommended CC-BY option also allows anyone to copy and distribute the work with attribution. Gold Open Access has been made possible by generous funding through ACM SIGPLAN, which will cover all open access costs in the event authors cannot. Authors who can cover the costs may do so by paying an Article Processing Charge (APC). PACMPL, SIGPLAN, and ACM Headquarters are committed to exploring routes to making Gold Open Access publication both affordable and sustainable. * ACM offers authors a range of copyright options, one of which is Creative Commons CC-BY publication; this is the option recommended by the PACMPL editorial board. A reasoned argument in favour of this option can be found in the article [Why CC-BY?](https://oaspa.org/why-cc-by/) published by OASPA, the Open Access Scholarly Publishers Association. * ACM Author-Izer is a unique service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge. Downloads through Author-Izer links are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of an ACM article should reduce user confusion over article versioning. After an article has been published and assigned to the appropriate ACM Author Profile pages, authors should visit to learn how to create links for free downloads from the ACM DL. * The official publication date is the date the papers are made available in the ACM Digital Library. This date may be up to *two weeks prior* to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work. * Authors of each accepted submission are invited to attend and be available for the presentation of that paper at the conference. The schedule for presentations will be determined and shared with authors after the full program has been selected. ### Artifact Evaluation Authors of papers that are conditionally accepted in the first phase of the review process will be encouraged (but not required) to submit supporting materials for Artifact Evaluation. These items will then be reviewed by an Artifact Evaluation Committee, separate from the paper Review Committee, whose task is to assess how the artifacts support the work described in the associated paper. Papers that go through the Artifact Evaluation process successfully will receive a seal of approval printed on the papers themselves. Authors of accepted papers will be encouraged to make the supporting materials publicly available upon publication of the papers, for example, by including them as "source materials" in the ACM Digital Library. An additional seal will mark papers whose artifacts are made available, as outlined in the ACM guidelines for artifact badging. Participation in Artifact Evaluation is voluntary and will not influence the final decision regarding paper acceptance. ### Special categories of papers In addition to research papers, PACMPL issue ICFP solicits two kinds of papers that do not require original research contributions: Functional Pearls, which are full papers, and Experience Reports, which are limited to half the length of a full paper. Authors submitting such papers should consider the following guidelines. #### Functional Pearls A Functional Pearl is an elegant essay about something related to functional programming. Examples include, but are not limited to: * a new and thought-provoking way of looking at an old idea * an instructive example of program calculation or proof * a nifty presentation of an old or new data structure * an interesting application of functional programming techniques * a novel use or exposition of functional programming in the classroom While pearls often demonstrate an idea through the development of a short program, there is no requirement or expectation that they do so. Thus, they encompass the notions of theoretical and educational pearls. Functional Pearls are valued as highly and judged as rigorously as ordinary papers, but using somewhat different criteria. In particular, a pearl is not required to report original research, but, it should be concise, instructive, and entertaining. A pearl is likely to be rejected if its readers get bored, if the material gets too complicated, if too much specialized knowledge is needed, or if the writing is inelegant. The key to writing a good pearl is polishing. A submission that is intended to be treated as a pearl must be marked as such on the submission web page, and should contain the words "Functional Pearl" somewhere in its title or subtitle. These steps will alert reviewers to use the appropriate evaluation criteria. Pearls will be combined with ordinary papers, however, for the purpose of computing the conference's acceptance rate. #### Experience Reports The purpose of an Experience Report is to help create a body of published, refereed, citable evidence that functional programming really works -- or to describe what obstacles prevent it from working. Possible topics for an Experience Report include, but are not limited to: * insights gained from real-world projects using functional programming * comparison of functional programming with conventional programming in the context of an industrial project or a university curriculum * project-management, business, or legal issues encountered when using functional programming in a real-world project * curricular issues encountered when using functional programming in education * real-world constraints that created special challenges for an implementation of a functional language or for functional programming in general An Experience Report is distinguished from a normal PACMPL issue ICFP paper by its title, by its length, and by the criteria used to evaluate it. * Both in the papers and in any citations, the title of each accepted Experience Report must end with the words "(Experience Report)" in parentheses. The acceptance rate for Experience Reports will be computed and reported separately from the rate for ordinary papers. * Experience Report submissions can be at most 12 pages long, excluding bibliography. * Each Experience Report accepted to the PACMPL issue will be presented at the conference, but depending on the number of Experience Reports and regular papers accepted, authors of Experience reports may be asked to give shorter talks. * Because the purpose of Experience Reports is to enable our community to accumulate a body of evidence about the efficacy of functional programming, an acceptable Experience Report need not add to the body of knowledge of the functional-programming community by presenting novel results or conclusions. It is sufficient if the Report states a clear thesis and provides supporting evidence. The thesis must be relevant to the PACMPL issue, but it need not be novel. The review committee will accept or reject Experience Reports based on whether they judge the evidence to be convincing. Anecdotal evidence will be acceptable provided it is well argued and the author explains what efforts were made to gather as much evidence as possible. Typically, more convincing evidence is obtained from papers which show how functional programming was used than from papers which only say that functional programming was used. The most convincing evidence often includes comparisons of situations before and after the introduction or discontinuation of functional programming. Evidence drawn from a single person's experience may be sufficient, but more weight will be given to evidence drawn from the experience of groups of people. An Experience Report should be short and to the point: it should make a claim about how well functional programming worked on a particular project and why, and produce evidence to substantiate this claim. If functional programming worked in this case in the same ways it has worked for others, the paper need only summarize the results; the main part of the paper should discuss how well it worked and in what context. Most readers will not want to know all the details of the project and its implementation, but the paper should characterize the project and its context well enough so that readers can judge to what degree this experience is relevant to their own projects. The paper should take care to highlight any unusual aspects of the project. Specifics about the project are more valuable than generalities about functional programming; for example, it is more valuable to say that the team delivered its software a month ahead of schedule than it is to say that functional programming made the team more productive. If the paper not only describes experience but also presents new technical results, or if the experience refutes cherished beliefs of the functional-programming community, it may be better to submit it as a full paper, which will be judged by the usual criteria of novelty, originality, and relevance. The associate editor will be happy to advise on any concerns about which category to submit to. ### ICFP Organizers General Chair: Sukyoung Ryu (KAIST, South Korea) Accessibility Co-Chairs: Lindsey Kuper (UC Santa Cruz, USA), Kathrin Stark (Princeton University, USA) Artifact Evaluation Co-Chairs: Gabriel Scherer (INRIA Saclay, France), Brent Yorgey (Hendrix College, USA) Industrial Relations Co-Chairs: Alan Jeffrey (Roblox, USA), Simon Marlow (Facebook, England) Programming Contest Co-Organisers: Alex Lang, Jasper Van der Jeugt (Fugue, Switzerland) Publicity and Web Chair: Sam Tobin-Hochstadt (Indiana University, USA) Student Research Competition Chair: Anders Miltner (University of Texas, USA) Student Volunteer Co-Chairs: Lily Bryant (University of British Columbia, Canada), Jaemin Hong (KAIST, South Korea), Hanneli Tavante (McGill University, Canada) Video Co-Chairs: Leif Andersen (Northeastern University, USA), Benjamin Chung (Northeastern University, USA) Workshops Co-Chairs: Leonidas Lampropoulos (University of Maryland, USA), Zoe Paraskevopoulou (Princeton University, USA) ### PACMPL Volume 5, Issue ICFP 2021 Associate Editor: Ronald Garcia, (University of British Columbia, Canada) Review Committee: Zena Ariola (University of Oregon, USA) Stephanie Balzer (Carnegie Mellon University, USA) Matteo Cimini (UMass Lowell, USA) Youyou Cong (Tokyo Institute of Technology, Japan) Harley Eades (University of Augusta, USA) Andrew Gordon (Microsoft Research & University of Edinburgh, United Kingdom) Benjamin Greenman (Brown University, USA) Arjun Guha (Northeastern University, USA) Jurriaan Hage (Utrecht, The Netherlands) Favonia (University of Minnesota, USA) Suresh Jagannathan (Purdue University, USA) Patricia Johann (Appalachian State University, USA) Ralf Jung (Max Planck Institute, Germany) Ekaterina Komendantskaya (Heriot-Watt, Scotland) Leonidas Lampropoulos (University of Maryland, USA) Kazutaka Matsuda (Tohoku University, Japan) Akimasa Morihata (Univeristy of Tokyo, Japan) Stefan Muller (Illinois Institute of Technology, USA) Max New (Wesleyan University, USA) Rishiyur Nikhil (Bluespec , USA) Cyrus Omar (University of Michigan, USA) Brigitte Pientka (McGill University, Canada) Norman Ramsey (Tufts University, USA) Christine Rizkallah (University of New South Wales, Australia) Taro Sekiyama (National Institute for Informatics, Japan) Eijiro Sumii (Tohoku University, Japan) Amin Timany (Aarhus University, Denmark) Mitchell Wand (Northeastern University, USA) Steve Zdancewic (University of Pennsylvania, USA) From simone.martini at unibo.it Tue Feb 2 11:46:15 2021 From: simone.martini at unibo.it (Simone Martini) Date: Tue, 2 Feb 2021 16:46:15 +0000 Subject: [TYPES/announce] History and Philosophy of Computing 2021, CfP Message-ID: HaPoC 2021: Call for Abstracts 6th International Conference on the History and Philosophy of Computing 27-29 October 2021 ETH Turing Centre, Zurich, Switzerland Website: https://hapoc2021.sciencesconf.org Email: hapoc2021 at sciencesconf.org While computing appears as a technological and scientific field in constant progression, our conception and knowledge of computers are also subject to change over time. In particular, digital machines of the 20th century were inspired by the biological individual, replacing with a solipsistic mental view the cultural and social aspects attached to the image of machines in the 19th century. However, the growing cultural import of computing practices has become ever more pressing in our days in all dimensions of social life. Not only have cultural phenomena increasingly become the object of computational analysis, but computational practices have also proved inseparable from the cultural environment in which they evolve. Therefore, it is urgent to critically address the entanglement of computing practices with the main cultural challenges our epoch is facing. The global and collective nature of such problems (e.g. climate change, global pandemics, systemic inequalities, resurgence of totalitarianism, to name a few) requires a comprehensive perspective on computing, where social and cultural aspects occupy a central position. For these reasons, thinking about machines asks today for an interdisciplinary approach, where art is as necessary as engineering, anthropological insights as important as psychological models, and the critical perspectives of history and philosophy as decisive as the axioms and theorems of theoretical computer science. For more than a decade, the ?History and Philosophy of Computing? Conference (HaPoC, www.hapoc.org) has contributed to building such an interdisciplinary community and environment. We aim to bring together historians, philosophers, computer scientists, social scientists, designers, manufacturers, practitioners, artists, logicians, mathematicians, each with their own experience and expertise, to take part in the collective construction of a comprehensive image of computing. Main Topics For HaPoC 2021, we welcome contributions from researchers from different disciplinary horizons who intend to participate in the debate on the impact of computers on culture, science, and society from the perspective of their area of expertise, and who are open to engage in interdisciplinary discussions across multiple fields. Topics include but are not limited to: - Historical and philosophical perspectives on computing knowledge, objects and practices - Social, cultural and pedagogical aspects of computing - Computing and the human sciences - Epistemological dimensions of computing - Impact of computing technologies - Computing and the arts The Program Committee is available at the conference website https://hapoc2021.sciencesconf.org/resource/page/id/4 How to submit We cordially invite researchers working in a field relevant to the main topics of the Conference to submit a short abstract of 180-200 words and an extended abstract of at most 1000 words (references included) through EasyChair at: https://easychair.org/conferences/?conf=hapoc2021 Accepted papers will be presented in 30-minute slots, including discussion. Abstracts must be written in English. Please note that the format of uploaded files must be in .pdf. Submissions without an extended abstract will not be considered. Important Dates Submission deadline: April 15, 2021 Notification of acceptance/rejection: June 15, 2021 Conference dates: October 27-29, 2021 Confirmed keynote speakers: Barbara Liskov (MIT Computer Science & Artificial Intelligence Lab) Juliette Kennedy (University of Helsinki) Thomas Haigh (University of Wisconsin-Milwaukee) Publication A selection of revised contributions to the Conference will be published in a Special Issue of Minds and Machines (Springer), under the title ?Computing Cultures?. The call is already available at: https://www.springer.com/journal/11023/updates/18800754 Format and Fee Due to the current pandemic situation, HaPoC-6 will take place in a hybrid format, with attendance and contributions both on-site and online. The registration fee for contributors (both online and on-site) will be announced soon. Following previous HaPoC editions, a usual low fee is expected. Online contributions are expected to be in real time, although pre-recorded talks will be accepted on request. Attendance (both online and on-site) will be free of charge. Travel Grants The Turing Centre Zurich and the HaPoC Council will propose a limited amount of travel grants to participants with accepted papers who are not beneficiaries of institutional support. More information will be soon made available on the conference webpage and through the HaPoC website (www.hapoc.org). Organizers Chairs: Juan Luis Gastaldi (ETH Zurich, Turing Centre Zurich) Luc Pellissier (Universit? de Paris-Est Cr?teil) Organized by: Turing Centre Zurich (ETH) www.turing.ethz.ch In collaboration with: Collegium Helveticum (ETH-UZH-ZHdK) www.collegium.ethz.ch Chair of History and Philosophy of Mathematical Sciences (ETH Zurich, D-GESS) https://hpm.ethz.ch Under the auspices of DHST/DLMPST Commission for the History and Philosophy of Computing (HaPoC) www.hapoc.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From anupamdotdas at gmail.com Tue Feb 2 15:06:43 2021 From: anupamdotdas at gmail.com (anupamdotdas at gmail.com) Date: Tue, 2 Feb 2021 20:06:43 -0000 Subject: [TYPES/announce] TABLEAUX 2021 - Call for Papers. 6-9 September, 2021. Birmingham, UK. Message-ID: <003d01d6f99e$ed6cd550$c8467ff0$@gmail.com> TABLEAUX 2021 The 30th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods Birmingham, UK, September 6-9, 2021 Website: https://tableaux2021.org/ Submission deadlines: 19 April (abstract), 26 April 2021 (paper) GENERAL INFORMATION The 30th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2021) will be hosted by the University of Birmingham, UK, 6-9 September 2021. TABLEAUX is the main international conference at which research on all aspects -- theoretical foundations, implementation techniques, systems development and applications -- of tableaux-based reasoning and related methods is presented. The first TABLEAUX conference was held in Lautenbach near Karlsruhe, Germany, in 1992. Since then it has been organised on an annual basis (sometimes as a part of IJCAR). TABLEAUX 2021 will be co-located with the 13th International Symposium on Frontiers of Combining Systems (FroCoS 2021). The conferences will provide a rich programme of workshops, tutorials, invited talks, paper presentations and system descriptions. SCOPE OF CONFERENCE Tableaux and other proof based methods offer convenient and flexible tools for automated reasoning for both classical and non-classical logics. Areas of application include verification of software and computer systems, deductive databases, knowledge representation and its required inference engines, teaching, and system diagnosis. Topics of interest include but are not limited to: * tableau methods for classical and non-classical logics (including first-order, higher-order, modal, temporal, description, hybrid, intuitionistic, linear, substructural, fuzzy, relevance and non-monotonic logics) and their proof-theoretic foundations; * sequent, natural deduction, labelled, nested and deep calculi for classical and non-classical logics, as tools for proof search and proof representation; * related methods (SMT, model elimination, model checking, connection methods, resolution, BDDs, translation approaches); * flexible, easily extendable, light-weight methods for theorem proving; novel types of calculi for theorem proving and verification in classical and non-classical logics; * systems, tools, implementations, empirical evaluations and applications (provers, proof assistants, logical frameworks, model checkers, etc.); * implementation techniques (data structures, efficient algorithms, performance measurement, extensibility, etc.); * extensions of tableau procedures with conflict-driven learning; * techniques for proof generation and compact (or humanly readable) proof representation; * theoretical and practical aspects of decision procedures; * applications of automated deduction to mathematics, software development, verification, deductive and temporal databases, knowledge representation, ontologies, fault diagnosis or teaching. We also welcome papers describing applications of tableau procedures to real-world examples. Such papers should be tailored to the TABLEAUX community and should focus on the role of reasoning and on logical aspects of the solution. SUBMISSION GUIDELINES Submissions are invited in the following two categories: (A) research papers reporting original theoretical research or applications, with length up to 15 pages excluding references; (B) system descriptions, with length up to 9 pages excluding references. There will also be a later call inviting position papers and brief reports on work-in-progress. Details will be kept up to date on the website. Submissions will be reviewed by the PC, possibly with the help of external reviewers, taking into account readability, relevance and originality. Any additional material (going beyond the page limit) can be included in a clearly marked appendix, which will be read at the discretion of the committee and must be removed for the camera-ready version. For category (A) submissions, the reported results must be original and not submitted for publication elsewhere. For category (B) submissions, a working implementation must be accessible via the internet. Authors are encouraged to publish the implementation under an open source license. The aim of a system description is to make the system available in such a way that people can use it, understand it, and build on it. Accepted papers in categories (A) and (B) will be published in the conference proceedings. Papers must be edited in LaTeX using the llncs style and must be submitted electronically as PDF files via the EasyChair system: https://easychair.org/conferences/?conf=tableaux21 For all accepted papers at least one author is required to register to the conference and present the paper. A title and a short abstract of about 100 words must be submitted before the paper submission deadline. Formatting instructions and the LNCS style files can be obtained at: http://www.springer.com/br/computer-science/lncs/conference-proceedings-guidelines IMPORTANT DATES Abstract submission: 19 April 2021 (AoE) Paper submission: 26 April 2021 (AoE) Notification: 14 June 2021 Conference: 6-9 September 2021 CONFERENCE FORMAT AND COVID-19 TABLEAUX 2021 and FroCoS 2021 are intended to be *hybrid* conferences welcoming both physical and virtual participation. The organisers are closely monitoring the pandemic situation and may choose to make the conference virtual-only if it seems unreasonable to host any sort of physical event. A final decision will be taken before the notification date 14 June (12 weeks before the conference) to leave ample time for potential travel plans to be made. PUBLICATION The conference proceedings will be published in the Springer series Lecture Notes in Artificial Intelligence (LNAI/LNCS). BEST PAPER AWARDS The program committee will select * the TABLEAUX 2021 Best Paper; and, * the TABLEAUX 2021 Best Paper by a Junior Researcher. Researchers will be considered "junior" if either they are students or their PhD degree date is less than two years from the first day of the meeting. The two awards will be presented at the conference. TRAVEL GRANTS FOR STUDENTS Some funding may be available to support students participating at TABLEAUX 2021. More details will be given on the conference website in due time. PROGRAM COMMITTEE Bahareh Afshari (University of Amsterdam, Netherlands, and University of Gothenburg, Sweden) Carlos Areces (Universidad Nacional de C?rdoba, Argentina) Arnon Avron (Tel-Aviv University, Israel) Nick Bezhanishvili (University of Amsterdam, Netherlands) Patrick Blackburn (University of Roskilde, Denmark) Serenella Cerrito (Universit? Paris-Saclay, Univ Evry, France) Kaustuv Chaudhuri (Inria, France) Liron Cohen (Ben-Gurion University, Israel) Anupam Das (University of Birmingham, UK) St?phane Demri (CNRS, France) Hans de Nivelle (Nazarbayev University, Kazakhstan) Valeria de Paiva (Topos Institute Berkeley, USA) Clare Dixon (University of Manchester, UK) Christian Ferm?ller (TU Wien, Austria) Didier Galmiche (Universit? de Lorraine, France) Silvio Ghilardi (Universit? degli Studi di Milano, Italy) Rajeev Gor? (Australian National University, Australia) Andrzej Indrzejczak (University of ??d?, Poland) Hidenori Kurokawa (Kanazawa University, Japan) Stepan Kuznetsov (Russian Academy of Sciences, Russia) Bj?rn Lellmann (SBA Research, Austria) St?phane Graham-Lengrand (SRI International, USA) George Metcalfe (University of Bern, Switzerland) Neil Murray (University At Albany, USA) Cl?udia Nalon (Universidade de Bras?lia, Brazil) Sara Negri (University of Genoa, Italy) Nicola Olivetti (Aix-Marseille University, France) Eugenio Orlandelli (University of Bologna, Italy) Jens Otten (University of Oslo, Norway) Alessandra Palmigiano (Vrije Universiteit Amsterdam, Netherlands) Dirk Pattinson (Australian National University, Australia) Frank Pfenning (Carnegie Mellon University, USA) Elaine Pimentel (Federal University of Rio Grande do Norte, Brazil) Andrei Popescu (University of Sheffield, UK) Gian Luca Pozzato (University of Turin, Italy) Giselle Reis (Carnegie Mellon University, Qatar) Reuben Rowe (Royal Holloway, UK) Jos? Esp?rito Santo (University of Minho, Portugal) Lutz Stra?burger (Inria, France) Josef Urban (Czech Technical University in Prague, Czech Republic) PC CHAIRS Anupam Das (University of Birmingham, UK) Sara Negri (University of Genoa, Italy) From hossein.haeri at gmail.com Wed Feb 3 05:17:51 2021 From: hossein.haeri at gmail.com (Seyed H. HAERI (Hossein)) Date: Wed, 3 Feb 2021 11:17:51 +0100 Subject: [TYPES/announce] Fwd: Informatics at University of Leicester In-Reply-To: References: Message-ID: ---------- Forwarded message --------- From: Simon Gay Date: Wed, 3 Feb 2021 at 10:21 Subject: Informatics at University of Leicester To: , Dear Colleagues, You might have heard that the University of Leicester is planning to shut down pure mathematics and make the academic staff redundant. That is only part of the story - the proposal is to merge mathematics and informatics, focus everything on AI, data science, computational modelling and "digitalisation", and make redundant 10 academic staff in informatics whose research does not align with those areas. The research being thrown out covers algorithm design and analysis, logic in computer science, foundations of software science, programming languages, concurrent systems, and testing and verification. Please consider signing this petition: https://www.ipetitions.com/petition/foco-is-not-redundant/ I apologise if you receive many similar emails, but I think I am getting in early :-) Best wishes, Simon -- -------------------------------------------------------------------------------------------------------------- Seyed H. HAERI (Hossein), Dr. Post-Doctoral Research Fellow Department of Computing Science and Engineering Catholic University of Louvain Louvain-la-Neuve, Belgium ACCU - Professionalism in programming - http://www.accu.org/ -------------------------------------------------------------------------------------------------------------- From m.backens at cs.bham.ac.uk Wed Feb 3 07:59:27 2021 From: m.backens at cs.bham.ac.uk (Miriam Backens) Date: Wed, 3 Feb 2021 12:59:27 +0000 Subject: [TYPES/announce] Second CFP: Quantum Physics and Logic (QPL 2021), submission deadline February 12 Message-ID: <8c1c724e-782b-65b1-0345-b166057e29ac@cs.bham.ac.uk> *18th International Conference on Quantum Physics and Logic (QPL 2021), June 7-11, 2021. Gda?sk, Poland and online* SECOND CALL FOR PAPERS QPL is an annual conference that brings together researchers working on mathematical foundations of quantum physics, quantum computing, and related areas, with a focus on structural perspectives and the use of logical tools, ordered algebraic and category-theoretic structures, formal languages, semantical methods, and other computer science techniques applied to the study of physical behaviour in general. Work that applies structures and methods inspired by quantum theory to other fields (including computer science) is also welcome. QPL 2021 will be held both virtually online and physically in Gdansk (COVID permitting). More information at https://qpl2021.eu/ INVITED SPEAKERS Matty Hoban Flaminia Giacomini Anna Jencova Hl?r Kristj?nsson Ariel Bendersky Martha Lewis IMPORTANT DATES Submission deadline: February 12, 2021 Author notification: March 31, 2021 Early registration: May 14, 2021 Proceedings paper ready: May 28, 2021 Conference: June 7-11, 2021 SUBMISSION GUIDELINES Recent work that is relevant to the conference is solicited in one (or more) of three tracks: * Proceedings submissions consist of a 5-12 page extended abstract. Only proceedings-track submissions are eligible to be published in Electronic Proceedings in Theoretical Computer Science (EPTCS) after the conference. * Non-proceedings submissions consist of a 3 page extended abstract and a link to a separate published paper, pre-print, or an attached draft. * Poster submissions consist of a 1-3 page abstract and may contain a link to a separate published paper or pre-print. Submission of partial results of work in progress is encouraged. Submissions should be prepared using LaTeX, and must be submitted in PDF format. Use of the EPTCS style is encouraged. Submission is done via EasyChair: https://www.easychair.org/conferences/?conf=qpl2021 BEST STUDENT PAPER There will be an award for the best student paper at the discretion of the programme committee. Papers eligible for the award are those where all the authors are students at the time of submission. PROGRAMME COMMITTEE Antonio Acin Barbara Amaral Pablo Arrighi Miriam Backens (co-chair) Jonathan Barrett Alessandro Bisio Anne Broadbent Ulysse Chabaud Bob Coecke Alejandro Diaz-Caro Ross Duncan Yuan Feng Alexandru Gheorghiu Stefano Gogioso Teiko Heinosaari Chris Heunen (co-chair) Matthew Hoban Kohei Kishida Aleks Kissinger Ravi Kunjwal Ciaran Lee Matt Leifer Martha Lewis Shane Mansfield Simon Martiel Hector Miller-Bakewell Mio Murao Glaucia Murta Ognyan Oreshkov Prakash Panangaden Simon Perdrix Lidia del Rio Julien Ross Mehrnoosh Sadrzadeh Ana Bel?n Sainz John Selby Rui Soares Barbosa Rob Spekkens Isar Stubbe Benoit Valiron Jamie Vicary John van de Wetering Alexander Wilce Mingsheng Ying Vladimir Zamdzhiev Margherita Zorzi -- Dr Miriam Backens (they/them) Lecturer School of Computer Science, University of Birmingham From dspivak at gmail.com Wed Feb 3 11:08:14 2021 From: dspivak at gmail.com (David Spivak) Date: Wed, 3 Feb 2021 11:08:14 -0500 Subject: [TYPES/announce] announcing: March workshop on polynomial functors Message-ID: WORKSHOP ON POLYNOMIAL FUNCTORS At the Topos Institute and online via Zoom 2021 March 15?19 (UTC) https://topos.site/p-func-2021-workshop/ Participants will learn background material and hear the latest progress on polynomial functors, monads, and comonads, their algebras and coalgebras, as well as on operads, parametric right adjoints, and cofunctors, with applications to combinatorics, database theory, dynamical systems, higher category theory, logic, and type theory. Talks will be recorded for posterity. (This may be the first in a series of such workshops.) Speakers ------------ Thorsten Altenkirch Steve Awodey Michael Batanin Bryce Clarke Marcelo Fiore Richard Garner David Gepner Helle Hvid Hansen Rune Haugseng Bart Jacobs Andr? Joyal Fredrik Nordvall Forsberg Kristina Sojakova David Spivak Ross Street Tarmo Uustalu Organizers ------------ Joachim Kock and David Spivak Participation ------------ Anyone interested in participating is welcome. If you would like to attend, please fill out the online form https://forms.gle/44bfnbE2Yfgqxz7H9 A zoom link will be sent out to registered participants a few days before the workshop. For other questions, please contact David Spivak or Joachim Kock . Program ------------ The talks will take place in the following 4-hour window: 20:00h?00:00 UTC (Sydney (+1) 07:00?11:00; Barcelona 21:00?01:00+; Boston 15:00?19:00; Berkeley 12:00?16:00, etc.) (END ANNOUNCEMENT) -------------- next part -------------- An HTML attachment was scrubbed... URL: From sam.staton at cs.ox.ac.uk Thu Feb 4 12:19:50 2021 From: sam.staton at cs.ox.ac.uk (Sam Staton) Date: Thu, 4 Feb 2021 17:19:50 +0000 Subject: [TYPES/announce] LICS 2021 Online and Call for Workshops Message-ID: <0B469770-010D-4C9F-87F5-4349B32D9A8E@cs.ox.ac.uk> It was recently decided that LICS 2021 will be held online. For this reason we?re making another call for workshop proposals: 36TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2021) 2nd Call for Workshop Proposals http://easyconferences.eu/lics2021/ * The thirty-sixth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'21) will be held online on June 29-July 2, 2021. The workshops will be held online on June 27-28, 2021. * Researchers and practitioners are invited to submit proposals for workshops on topics relating logic - broadly construed - to computer science or related fields. Typically, LICS workshops feature a number of invited speakers and a number of contributed presentations. LICS workshops do not usually produce formal proceedings. However, in the past there have been special issues of journals based in part on certain LICS workshops. * Proposals should include: - A short scientific summary and justification of the proposed topic. This should include a discussion of the particular benefits of the topic to the LICS community. - The proposed duration, which is typically one day (two-day workshops can be accommodated too). - Expected number of participants, providing data on previous years if the workshop has already been organised in the past. - Procedures for selecting participants and papers. - Potential invited speakers. - An agenda. - Plans for dissemination (for example, special issues of journals). Proposals should be sent to Fr?d?ric Blanqui: frederic.blanqui at inria.fr * IMPORTANT DATES: - Workshop proposal submission deadline: February 28, 2020 - Notification: March 3, 2020 - Program of the workshops ready: May 27, 2021 - Workshops: June 27-28, 2021 - LICS conference: June 29-July 2, 2021 * The workshops selection committee consists of the LICS Workshops Chair, the LICS General Chair, the LICS PC Chairs and the LICS Conference Chairs. From fm-announcements at lists.nasa.gov Fri Feb 5 18:20:48 2021 From: fm-announcements at lists.nasa.gov (Munoz, Cesar (LARC-D320) via fm-announcements) Date: Fri, 5 Feb 2021 23:20:48 +0000 Subject: [TYPES/announce] [fm-announcements] Formal Methods for Industrial Critical Systems 2021 CfP Message-ID: <27DB4C65-76BE-4CFC-BC8B-685D97852842@nasa.gov> **************************************************************** The 26th International Conference on Formal Methods for Industrial Critical Systems (FMICS 2021) https://qonfest2021.lacl.fr/fmics21.php **************************************************************** About ------------------------- The aim of the FMICS conference series (http://fmics.inria.fr/) is to provide a forum for researchers who are interested in the development and application of formal methods in industry. FMICS brings together scientists and engineers who are active in the area of formal methods and interested in exchanging their experiences in the industrial usage of these methods. The FMICS conference series also strives to promote research and development for the improvement of formal methods and tools for industrial applications. FMICS 2021 is part of the QONFEST umbrella conference comprising: - FMICS 2021: 26th International Conference on Formal Methods for Industrial Critical Systems - CONCUR 2021: 32nd International Conference on Concurrency Theory - FORMATS 2021: 19th International Conference on Formal Modeling and Analysis of Timed Systems - QEST 2021: 18th International Conference on Quantitative Evaluation of SysTems QONFEST takes place from August 23 to August 27, 2021. Topics ------------------------- Topics of interest include (but are not limited to): - Case studies and experience reports on industrial applications of formal methods, focusing on lessons learned or identification of new research directions. - Methods, techniques and tools to support automated analysis, certification, debugging, descriptions, learning, optimisation and transformation of complex, distributed, real-time, embedded, mobile and autonomous systems. - Verification and validation methods (model checking, theorem proving, SAT/SMT constraint solving, abstract interpretation, etc.) that address shortcomings of existing methods with respect to their industrial applicability (e.g., scalability and usability issues). - Impact of the adoption of formal methods on the development process and associated costs. Application of formal methods in standardisation and industrial forums. New this year! Special track papers on Formal Methods for Blockchain-based Smart Contracts ------------------------- We invite submissions in topics related to the formal specification, analysis, and verification of blockchain-based smart contracts. For this occasion, the Program Committee has been enlarged with experts from the blockchain domain. Formatting instructions and the review procedure are the same as the ones for regular papers. However, the authors will need to specifically indicate their interest in the special track during the submission. Papers accepted for the special track will be included in a special session at FMICS 2021 along with a panel on this topic, while they will be published in the conference proceedings together with papers accepted for the regular track. Submission and Publication ------------------------- We welcome contributions of different categories: - Regular papers that describe original research work and results. Length: 15 pages + 2 pages of references. - Short papers that describe work-in-progress, or positions on the future of formal methods. Length: 6 pages + 2 pages of references. - Tool papers that describe software artefacts. The paper must contain a link to a publicly available video of at most 10 minutes length. Length: 6 pages + 2 pages of references. - Journal-first papers that summarize a paper recently published in a journal and not yet presented in a conference. The main aim of this category is to allow authors present archived work in a public forum. The original journal paper should have been published between January 1st, 2020 and the date of submission. Length: 2 pages + 1 page of references. With the exception of the journal-first category, submitted papers must not have previously appeared in a journal or conference with published proceedings and must not be concurrently submitted to any other peer-reviewed workshop, symposium, conference or journal. Any partial overlap with any such published or concurrently submitted paper must be clearly indicated. Submissions should clearly motivate relevance to industrial application. Case-Deastudy papers should identify lessons learned, validate theoretical results (such as scalability of methods) or provide specific motivation for further research and development. Submissions should be formatted according to the LNCS style (Springer). All submissions will be reviewed by the Programme Committee members who will make a selection among the submissions based on the novelty, soundness and applicability of the presented ideas and results. Papers must be written in English and should be submitted as Portable Document Format (PDF) files using the EasyChair submission site: https://easychair.org/conferences/?conf=fmics2021 The conference proceedings will be published by Springer in the LNCS series. Contributions of the journal-first category will not be included in the proceedings. Authors should consult Springer?s authors guidelines and use their proceedings templates, either for LaTeX or for Word, for the preparation of their papers. Springer encourages authors to include their ORCIDs in their papers. In addition, the corresponding author of each paper, acting on behalf of all of the authors of that paper, must complete and sign a Consent-to-Publish form. The corresponding author signing the copyright form should match the corresponding author marked on the paper. Once the files have been sent to Springer, changes relating to the authorship of the papers cannot be made. At least one author of each accepted paper is expected to present the paper at the conference as a registered participant. Best paper award: A Springer-sponsored award will be presented to the authors of the submission selected by the Program Committee as the FMICS 2021 Best Paper. Special issue: The Program Committee of FMICS 2021 will invite a selection of accepted papers to submit extended versions to a special issue of the International Journal on Software Tools for Technology Transfer (STTT). Concerning the COVID-19 Pandemic: ------------------------- Due the pandemic situation, the organization committee of QONFEST 2021 decided that all conferences will take place online. Important Dates ------------------------- Abstract submission: May 7, 2021 Paper submission: May 14, 2021 (23:59:59 AoE) Author notification: June 28, 2021 Camera-ready version: July 5, 2021 Conference: August 23-27, 2021 NOTE: the actual conference dates will be announced on the webpage. Most likely, it will be 2-3 days within the QONFEST week (August 23-27, 2021) Keynote Speaker ------------------------- Joe Kiniry (Galois Inc. and Free & Fair, US) PC Chairs ------------------------- Alberto Lluch Lafuente (Technical University of Denmark, DK) Anastasia Mavridou (KBR/ NASA Ames Research Center, US) PC Members ------------------------- Erika Abraham (RWTH Aachen University, DE) Massimo Bartoletti (University of Cagliari, IT) Maurice ter Beek (ISTI-CNR, IT) Simon Bliudze (INRIA, FR) Yu-Fang Chen (Academia Sinica, TW) Silvia Crafa (University of Padova, IT) Hubert Garavel (INRIA, FR) Diego Garbervetsky (University of Buenos Aires/CONICET, AR) ?kos Hajdu (Budapest University of Technology and Economics, HU) Klaus Havelund (NASA JPL, US) Anne Haxthausen (Technical University of Denmark, DK) Fritz Henglein (University of Copenhagen/ Deon Digital , DK) Fuyuki Ishikawa (National Institute of Informatics, JP) Xiaoqing Jin (Apple Inc., US) Joe Kiniry (Galois Inc. and Free & Fair, US) Thierry Lecomte (ClearSy, FR) Tiziana Margaria (CSIS, Univ. of Limerick, and LERO, IE) Diego Marmsoler (University of Exeter, UK) Radu Mateescu (INRIA, FR) Dejan Nickovic (Austrian Institute of Technology, AT) Corina Pasareanu (CMU/ NASA Ames Research Center, US) Anna Philippou (University of Cyprus, CY) Jaco van de Pol (Aarhus University, DK) Clara Schneidewind (Vienna University of Technology, AT) Cristina Seceleanu (M?lardalen University, SE) Carolyn Talcott (SRI International, US) Virginie Wiels (ONERA / DTIM, FR) Steering Committee ------------------------- Maurice ter Beek (ISTI-CNR, IT) Alessandro Fantechi (University of Florence, IT) Hubert Garavel (INRIA, FR) Tiziana Margaria (CSIS, Univ. of Limerick, and LERO, IE) Radu Mateescu (INRIA, FR) Jaco van de Pol (Aarhus University, DK) -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 7429 bytes Desc: not available URL: -------------- next part -------------- --- To opt-out from this mailing list, send an email to fm-announcements-request at lists.nasa.gov with the word 'unsubscribe' as subject or in the body. You can also make the request by contacting fm-announcements-owner at lists.nasa.gov From ksk at riec.tohoku.ac.jp Sat Feb 6 22:05:07 2021 From: ksk at riec.tohoku.ac.jp (Keisuke Nakano) Date: Sun, 7 Feb 2021 12:05:07 +0900 Subject: [TYPES/announce] WPTE 2021 (FIRST Call For Papers) Message-ID: <1C1EEF09-C8E5-4B47-BD93-F4D20630A347@riec.tohoku.ac.jp> --------------------------------------------------------------------------- WPTE 2021: 8th International Workshop on Rewriting Techniques for Program Transformations and Evaluation Held online on July 18, 2021 --------------------------------------------------------------------------- Conference Web site: https://www.ipl.riec.tohoku.ac.jp/wpte2021/ Submission link: https://easychair.org/conferences/?conf=wpte2021 Submission deadline: May 10, 2021 --------------------------------------------------------------------------- The aim of WPTE is to bring together the researchers working on program transformations, evaluation, and operationally based programming language semantics, using rewriting methods, in order to share the techniques and recent developments and to exchange ideas to encourage further activation of research in this area. The 8th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2021) is affiliated with FSCD 2021, https://fscd2021.dc.uba.ar/ List of Topics --------------------------------------------------------------------------- * Correctness of program transformations, optimizations and translations. * Program transformations for proving termination, confluence, and other properties. * Correctness of evaluation strategies. * Operational semantics of programs, operationally-based program equivalences such as contextual equivalences and bisimulations. * Cost-models for arguing about the optimizing power of transformations and the costs of evaluation. * Program transformations for verification and theorem proving purposes. * Translation, simulation, equivalence of programs with different formalisms, and evaluation strategies. * Program transformations for applying rewriting techniques to programs in specific programming languages. * Program transformations for program inversions and program synthesis. * Program transformation and evaluation for Haskell and rewriting. Submission Guidelines --------------------------------------------------------------------------- For the paper submission deadline an extended abstract of at most 10 pages is required to be submitted. The extended abstract may present original work or also work in progress. Based on the submissions the program committee will select the presentations for the workshop. All selected contributions will be included in the informal proceedings distributed to the workshop participants. One author of each accepted extended abstract is expected to present it at the workshop. Submissions must be prepared in LaTeX using the EPTCS macro package. All submissions will be electronic via https://easychair.org/conferences/?conf=wpte2021. Formal Proceedings --------------------------------------------------------------------------- WPTE post-proceedings of selected papers will be published in a JLAMP special issue. For this, full papers must be submitted until the post-proceedings deadline. The authors of selected contributions will have the opportunity (but no obligation) to submit a full paper for the formal post-proceedings. These must represent original work and should not be submitted to another conference at the same time. The submission deadline for these post-proceedings will be after the workshop in September 2021. There will be a second round of reviewing for selecting papers to be published in the formal proceedings. Important Dates --------------------------------------------------------------------------- Submission of extended abstracts: May 10, 2021 (AoE) Notification of acceptance: May 31, 2021 Final version for proceedings deadline: June 13, 2021 Workshop: July 18, 2021 Submission to post-proceedings: September 2021 Program Committees --------------------------------------------------------------------------- Keisuke Nakano, Tohoku University, Japan (Chair) Adrian Riesco, Universidad Complutense de Madrid, Spain. (co-Chair) ?tefan Ciob?c?, Universitatea Alexandru Ioan Cuza din Ia?i, Romania Makoto Hamana, Gunma University, Japan Akimasa Morihata, the University of Tokyo, Japan Shin-Cheng Mu, Academia Sinica, Taiwan Koko Muroya, Kyoto University, Japan David Sabel, LMU, Germany Julia Sapi?a, Polytechnic University of Valencia, Spain Janis Voigtl?nder, University of Duisburg-Essen, Germany Contact --------------------------------------------------------------------------- All questions about submissions should be emailed to wpte2021 (at) easychair.org From j.a.perez at rug.nl Mon Feb 8 01:44:00 2021 From: j.a.perez at rug.nl (Jorge A. Perez) Date: Mon, 8 Feb 2021 07:44:00 +0100 Subject: [TYPES/announce] PhD scholarship on Concurrency and Logic (Updated) Message-ID: [Please share widely with potential candidates; apologies for any cross-postings.] PHD SCHOLARSHIP ON ?CONCURRENCY AND LOGIC? University of Groningen, The Netherlands Apply before March 19, 2021 (see below for details on application procedure) Supervisors: - Prof. Barteld Kooi (https://www.philos.rug.nl/~barteld/) - Prof. Jorge A. P?rez (https://www.jperez.nl) We seek excellent candidates for one four-year PhD scholarship on the topics of message-passing concurrency, modal logic, and type systems. The PhD scholarship concerns the interdisciplinary project "Knowledge is Power: Reliable Communicating Software by Epistemic Logics", supported by the Young Academy Groningen (https://www.rug.nl/research/young-academy/). Details on the PhD Scholarship program can be found here: https://www.rug.nl/education/phd-programmes/phd-scholarship-programme/ The starting point of the proposed research is "propositions as sessions", a remarkable principle that connects concurrency and logic in the style of the well-known Curry-Howard correspondence. In this project, you will enhance the expressiveness of analysis techniques for message-passing programs by incorporating forms of knowledge and belief in formal specifications of communicating programs. To this end, you will develop new extensions of "propositions as sessions" by exploiting elements from epistemic logics and modal logics. - Qualifications You have an MSc degree (or equivalent) in Computer Science, (Philosophical) Logic, Mathematics, or Artificial Intelligence, with proven experience in at least two of the following: - Modal logics and (their) proof theory - Concurrency theory and/or process calculi - Semantics of programming languages - Program verification and type systems - The Curry-Howard correspondence - Application Details on the application procedure are available here: https://www.rug.nl/phd-scholarships?details=00347-02S000840P (see "Project 3") You will be asked to provide the following documents: 1. A brief letter of motivation 2. A CV, including contact details of two academic referees 3. A research proposal of max. 1500 words 4. A certified transcript of records 5. Scan of diploma/transcripts You can submit your application until 18 March 11:59pm / before 19 March 2021 Dutch local time (CET). - Additional Information Prospective applicants are strongly encouraged to contact the supervisors for further details on the research project and also advice on how to prepare their applications: - Prof. Barteld Kooi (b.p.kooi[at]rug.nl) - Prof. Jorge A. P?rez (j.a.perez[at]rug.nl) -- Jorge A. P?rez Associate Professor, Fundamental Computing group Bernoulli Institute for Math, CS and AI University of Groningen, The Netherlands URL: http://www.jperez.nl From alcsc at dtu.dk Mon Feb 8 08:20:25 2021 From: alcsc at dtu.dk (Alceste Scalas) Date: Mon, 8 Feb 2021 14:20:25 +0100 Subject: [TYPES/announce] CfP: 14th Interaction and Concurrency Experience (ICE 2021) Message-ID: <7eee0a50-b1eb-6958-7f5e-dd017e3e4264@dtu.dk> ICE 2021 14th Interaction and Concurrency Experience June 18, 2021 University of Malta, Valletta and/or online Satellite workshop of DisCoTec 2021 https://www.discotec.org/2021/ice Submission link: https://openreview.net/group?id=DisCoTec.org/2021/Workshop/ICE Interaction and Concurrency Experience (ICE) is a series of international scientific meetings oriented to theoretical computer science researchers with special interest in models, verification, tools, and programming primitives for complex interactions. === HIGHLIGHTS === * Distinctive selection procedure * ICE welcomes full papers to be included in the proceedings * ICE also welcomes oral communications of already published or preliminary work * Publication in EPTCS (to be confirmed) * Special issue in the Journal of Logical and Algebraic Methods in Programming (Elsevier) (to be confirmed) * Invited speakers: TBA === IMPORTANT DATES === * 15 April 2021: abstract submission * 19 April 2021: paper submission * 18 May 2021: notification * 18 June 2021: ICE workshop * 12 July 2021: camera-ready for EPTCS post-proceedings === SCOPE === The general scope of the venue includes theoretical and applied aspects of interactions and the synchronization mechanisms used among components of concurrent/distributed systems, related to several areas of computer science in the broad spectrum ranging from formal specification and analysis to studies inspired by emerging computational models. We solicit contributions relevant to Interaction and Concurrency, including but not limited to: * Formal semantics * Process algebras and calculi * Models and languages * Protocols * Logics and types * Expressiveness * Model transformations * Tools, implementations, and experiments * Specification and verification * Coinductive techniques * Tools and techniques for automation * Synthesis techniques === SELECTION PROCEDURE === Since its first edition in 2008, the distinguishing feature of ICE has been an innovative paper selection mechanism based on an interactive, friendly, and constructive discussion amongst authors and PC members in an online forum. During the review phase, each submission is published in a dedicated discussion forum. The discussion forum can be accessed by the authors of the submission and by all PC members not in conflict with the submission (the forum preserves anonymity). The forum is used by reviewers to ask questions, clarifications, and modifications from the authors, allowing them better to explain and to improve all aspects of their submission. The evaluation of the submission will take into account not only the reviews, but also the outcome of the discussion. As witnessed by the past editions of ICE, this procedure considerably improves the accuracy of the reviews, the fairness of the selection, the quality of camera-ready papers, and the discussion during the workshop. ICE adopts a light double-blind reviewing process, detailed below. === SUBMISSION GUIDELINES === Submissions must be made electronically in PDF format via OpenReview: https://openreview.net/group?id=DisCoTec.org/2021/Workshop/ICE We invite two types of submissions: * Research papers, original contributions that will be published in the workshop post-proceedings. Research papers must not be simultaneously submitted to other conferences/workshops with refereed proceedings. Research papers should be 3-16 pages plus at most 2 pages of references. Short research papers are welcome; for example a 5 page short paper fits this category perfectly. The submitted PDF can use any LaTeX style (but the post-proceedings will use the EPTCS style). * Oral communications will be presented at the workshop, but will not appear in the post-proceedings. This type of contribution includes e.g. previously published contributions, preliminary work, and position papers. There is no strict page limit for this kind of submission but papers of 1-5 pages would be appreciated. For example, a one page summary of previously published work is welcome in this category. Authors of research papers must omit their names and institutions from the title page, they should refer to their other work in the third person and omit acknowledgements that could reveal their identity or affiliation. The purpose is to avoid any bias based on authors? identity characteristics, such as gender, seniority, or nationality, in the review process. Our goal is to facilitate an unbiased approach to reviewing by supporting reviewers? access to works that do not carry obvious references to the authors? identities. As mentioned above, this is a lightweight double-blind process. Anonymization should not be a heavy burden for authors, and should not make papers weaker or more difficult to review. Advertising the paper on alternate forums (e.g., on a personal web-page, pre-print archive, email, talks, discussions with colleagues) is permitted, and authors will not be penalized by for such advertisement. Papers in the ?Oral communications? category need not be anonymized. For any questions concerning the double blind process, feel free to consult the ICEcreamers. We are keen to enhance the balanced, inclusive and diverse nature of the ICE community, and would particularly encourage female colleagues and members of other underrepresented groups to submit their work. === PUBLICATIONS === Accepted research papers and communications must be presented at the workshop by one of the authors. Accepted research papers will be published after the workshop in Electronic Proceedings in Theoretical Computer Science (to be confirmed). We plan to invite authors of selected papers and brief announcements to submit their work in a special issue in the Journal of Logical and Algebraic Methods in Programming (Elsevier). Such contributions will be regularly peer-reviewed according to the standard journal policy, but they will be handled in a shorter time than regular submissions. A list of published and in preparation special issues of previous ICE editions is reported on the ICE website. === ICECREAMERS === Julien Lange (Royal Holloway, University of London, UK) - julien.lange at rhul.ac.uk Anastasia Mavridou (NASA Ames, USA) - anastasia.mavridou at nasa.gov Larisa Safina (Inria, FR) - larisa.safina at inria.fr Alceste Scalas (Technical University of Denmark, DK) - alcsc at dtu.dk === PROGRAM COMMITTEE (under construction) === * Massimo Bartoletti (University of Cagliari, IT) * Matteo Cimini (University of Massachusetts Lowell, USA) * Cinzia Di Giusto (Universit? C?te d?Azur, CNRS, I3S, FR) * Simon Fowler (University of Glasgow, UK) * Eva Graversen (University of Southern Denmark, DK) * Ludovic Henrio (ENS Lyon, FR) * Keigo Imai (Gifu University, JP) * Sung-Shik Jongmans (Open University of the Netherlands, NL) * Sophia Knight (University of Minnesota Duluth, US) * Wen Kokke (University of Edinburgh, UK) * Ivan Lanese (University of Bologna, IT) * Karoliina Lehtinen (CNRS - LIS, Aix-Marseille University, FR) * Alberto Lluch Lafuente (Technical University of Denmark, DK) * Diego Marmsoler (University of Exeter, UK) * Hern?n Melgratti (University of Buenos Aires, AR) * Maurizio Murgia (University of Trento, IT) * Kirstin Peters (TU Darmstadt, DE) * Johannes ?man Pohjola (Data61/CSIRO, AU) * Ivan Prokic (University of Novi Sad, RS) * Matteo Sammartino (Royal Holloway, University of London, UK) * Hugo Torres Vieira (C4 - University of Beira Interior, PT) * Laura Voinea (University of Kent, UK) * Uma Zalakian (University of Glasgow, UK) === STEERING COMMITTEE === * Massimo Bartoletti (University of Cagliari, IT) * Ludovic Henrio (ENS Lyon, FR) * Ivan Lanese (University of Bologna, IT) * Alberto Lluch Lafuente (Technical University of Denmark, DK) * Sophia Knight (University of Minnesota Duluth, USA) * Hugo Torres Vieira (C4 - University of Beira Interior, PT) === MORE INFORMATION === For additional information, please contact the ICEcreamers (see email addresses above). -- Alceste Scalas - https://people.compute.dtu.dk/alcsc Assistant Professor @ DTU Compute - Section for Formal Methods Technical University of Denmark Richard Petersens Plads, Building 324, Room 180 2800 Kgs. Lyngby From harley.eades at gmail.com Mon Feb 8 13:20:07 2021 From: harley.eades at gmail.com (Harley D. Eades III) Date: Mon, 8 Feb 2021 13:20:07 -0500 Subject: [TYPES/announce] Seminar talk on Relational Programming, Program Synthesis, Treating Rare Diseases, and More! Message-ID: Hi, everyone. On Friday, Feb. 12, 2021 between 1pm and 2pm EST (6pm - 7pm UTC), Dr. William Byrd will be giving a presentation as part of the CS Colloquium Series at Augusta University. Presentation details can be found here: https://the-au-forml-lab.github.io/colloquium_talks/Byrd.html William will as usual give a great talk on his work applying PL research to precision medicine. These talks are open to the general public via Zoom and Youtube. I'll be live streaming it on Youtube. If you are interested in attending the Zoom meeting please RSVP with me before the talk. Questions will be taken from those on Zoom and YouTube. If you care to watch via YouTube, please use the following link: https://youtu.be/8auEgwMvoOc Feel free to share this message with everyone you know. I hope all of you, your family and friends are doing well! Very best, Harley -------------- next part -------------- An HTML attachment was scrubbed... URL: From stourret at mpi-inf.mpg.de Mon Feb 8 15:28:54 2021 From: stourret at mpi-inf.mpg.de (Sophie Tourret) Date: Mon, 8 Feb 2021 21:28:54 +0100 Subject: [TYPES/announce] CADE-28: final call for papers In-Reply-To: References: <1c179272-7300-62f8-8fcb-3ccdeb1d1c23@mpi-inf.mpg.de> <47475eb3-94e1-b720-10a2-f887b6b364f9@mpi-inf.mpg.de> Message-ID: <8f064fdf-f283-fb9e-5bc5-b5ad6bc8ef57@mpi-inf.mpg.de> /!\ This is CADE-28's final call for papers. The abstract deadline is next week. /!\ The submission deadline is firm, there will be no extensions. /!\ The other dates (rebuttal, notification, final version) have changed. ------------------------------------------------------------------------------------------------- *CADE-28: Final Call for Papers* The 28th International Conference on Automated Deduction (CADE-28) Carnegie Mellon University, Pittsburgh, USA. 11-16th July 2021. http://www.cade-28.info In cooperation with ACM SIGLOG CADE-28 will be *virtual* due to the COVID-19 pandemic. CADE is the major international forum for presenting research on all aspects of automated deduction. High-quality submissions on the general topic of automated deduction, including logical foundations, theory and principles, applications in and beyond STEM, implementations, and the use/contribution of automated deduction in AI, are solicited. CADE-28 aims to present research that reflects the broad range of interesting and relevant topics in automated deduction. Important Dates Abstract deadline: *15 February* 2021 Submission deadline: *22 February* 2021 (AoE, no extensions) Rebuttal phase: 29-31 March 2021 Notification: 9 April 2021 Final version: 30 April 2021 Conference: 12-15 July 2021 Submissions can be made in two categories: Regular papers. Up to 15 pages in LNCS style. Proofs of theoretical results that do not fit in the page limit may be provided in an appendix. Reviewers may consider additional material in appendices, but submissions must be self- contained within the page limit. Short papers (including system descriptions, user experiences, domain models, etc.) Up to 10 pages in LNCS style. Submissions must be unpublished and not submitted for publication elsewhere. They will be judged on relevance, originality, significance, correctness, and readability. If software or data is relevant to a paper, a link that provides access to the software/data must be provided to enable reproduction of results. The review process will include a feedback/rebuttal period where authors will have the option to respond to reviewer comments. The PC chairs may solicit further reviews after the rebuttal period. The proceedings of the conference will be published in the Springer LNCS/LNAI series. Formatting instructions and the LNCS style files can be obtained at http://www.springer.de/comp/lncs/authors.html Papers must be submitted to the CADE-28 track via https://easychair.org/conferences/?conf=cade28 All questions about submissions should be emailed to Andr? Platzer (aplatzer at cs.cmu.edu) and Geoff Sutcliffe (geoff at cs.miami.edu). -------------- next part -------------- An HTML attachment was scrubbed... URL: From peterol at ifi.uio.no Tue Feb 9 04:25:20 2021 From: peterol at ifi.uio.no (=?utf-8?Q?Peter_Csaba_=C3=98lveczky?=) Date: Tue, 9 Feb 2021 10:25:20 +0100 Subject: [TYPES/announce] PhD position in formal methods at the University of Oslo, Norway Message-ID: 3 (or 4) year PhD research fellowship available in formal methods at the University of Oslo: Rewrite-based methods for real-time and cyber-physical systems. ** Application deadline February 28, 2021 ** Competitive salary ** See https://www.jobbnorge.no/en/available-jobs/job/200007/phd-research-fellowship-in-formal-methods-for-real-time-and-cyber-physical-systems for details and on how to apply --------------- This PhD project is lead by Professor Peter ?lveczky and is part of the broader Real-Time Maude project, which aims at developing formal modeling languages and analysis methods that can be successfully applied to complex modern cyber-physical systems. In particular, Real-Time Maude is a rewriting-logic-based modeling language and formal analysis tool for real-time systems that has been applied to a wide range of systems, and as a semantic framework and analysis backend to other modeling languages, such as fragments of Ptolemy II and AADL. The goal of this PhD project is to integrate symbolic analysis methods, such as narrowing analysis and SMT solving, into rewriting-based analysis techniques for real-time and hybrid/cyber-physical systems, and into tools such as Real-Time Maude and Synchronous AADL. ** Apply online https://www.jobbnorge.no/jobseeker/#/application/apply/200007 *before February 28, 2021* --------------- Contact Professor Peter ?lveczky (peterol AT ifi.uio.no) for more information about the position, and HR Adviser Torunn Standal Guttormsen (t.s.guttormsen AT mn.uio.no) for administrative questions. From andrei.h.popescu at gmail.com Tue Feb 9 12:22:55 2021 From: andrei.h.popescu at gmail.com (Andrei Popescu) Date: Tue, 9 Feb 2021 17:22:55 +0000 Subject: [TYPES/announce] 21st Midlands Graduate School in the Foundations of Computing Science: Call for Participation Message-ID: CALL FOR PARTICIPATION 21st Midlands Graduate School in the Foundations of Computing Science MGS 21 12-16 April 2021, virtually https://staffwww.dcs.shef.ac.uk/people/G.Struth/mgs21.html 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 Introductory courses: Category Theory Jacopo Emmenegger, Birmingham Type Theory Thorsten Altenkirch, Nottingham Proof Theory Anupam Das, Birmingham Advanced courses: Homotopy Type Theory Nicolai Kraus, Nottingham Inductive and Coinductive Reasoning with Isabelle/HOL Andrei Popescu, Sheffield Effects and Call-by-Push-Value Paul Levy, Birmingham Formal Modelling and Analysis of Concurrent Systems Mohammad Mousavi, Leicester In addition we are organising a session where participants can briefly present and discuss their own research. A call will be made in March. 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 is April 1. ORGANISATION Please direct all queries about MGS 21 to Georg Struth. The Sheffield organisers are Harsh Beohar (H.Beohar at sheffield.ac.uk) Andrei Popescu (A.Popescu at sheffield.ac.uk) Georg Struth (G.Struth at sheffield.ac.uk) From willem.heijltjes at gmail.com Wed Feb 10 10:16:53 2021 From: willem.heijltjes at gmail.com (Willem Heijltjes) Date: Wed, 10 Feb 2021 15:16:53 +0000 Subject: [TYPES/announce] PhD in Mathematical Foundations in Bath - deadline 21 Feb Message-ID: We are recruiting for 2 PhD positions Funding: Competition funded Deadline: Sunday 21 February 2021 Start: October 2021 (anticipated) Mathematical Foundations Group Department of Computer Science University of Bath ===== The Mathematical Foundations group ===== Our group explores some of the deepest topics in logic and their relation to the theory of computation. We establish bridges between proof theory, category theory, semantics and complexity, so that the methods of each discipline enrich the others. We design new theories and solve old problems. For example, we defined a new proof formalism, called 'open deduction', that allowed us to describe one of the most efficient known notions of computation for the lambda-calculus. That was made possible by introducing ideas from complexity theory and category theory into proof theory and its computational interpretations. Our research programme, in a nutshell, is to help develop the mathematics of computation. This matters at least for two reasons. The first is that computing, at present, is art, not engineering. Indeed, because of the lack of mathematics, software correctness is not guaranteed the same way a bridge is guaranteed to stand, for example. The second reason is that the theory of computation is rapidly becoming one of the most important intellectual achievements of civilisation. For example, it is now helping physics and biology create new models in their domain. Because of all that, our doctoral graduates have embarked on excellent academic careers in some of the most intellectually rewarding and innovative branches of research, and will continue to do so. Our webpage: https://www.bath.ac.uk/projects/mathematical-foundations-of-computation/ Please see at the end of this email for a list of projects and supervisors. ===== Contact ===== For questions about the project or the application process, please contact us, Alessio Guglielmi A.Guglielmi at bath.ac.uk Willem Heijltjes W.B.Heijltjes at bath.ac.uk or one of the supervisors of the projects at the end of this email. ===== How to apply ===== Applicants should hold, or expect to gain, a First Class or good Upper Second Class Honours degree in Mathematics or Computer Science, or the equivalent from an overseas university. A Master?s level qualification would be advantageous. Formal applications should be made via the University of Bath?s online application form for a PhD in Computer Science: http://samis.bath.ac.uk/urd/sits.urd/run/siw_ipp_lgn.login?process=siw_ipp_app&code1=RDUCM-FP01&code2=0015 You would apply to a specific project and supervisor from the list at the end of this email. More information on the general applications process is here: http://www.bath.ac.uk/guides/how-to-apply-for-doctoral-study/ Non-UK applicants will also be required to have met the English language entry requirements of the University of Bath: http://www.bath.ac.uk/corporate-information/postgraduate-english-language-requirements-for-international-students/ Anticipated start date: Monday 4 October 2021 ===== Funding ===== Candidates applying for this project may be considered for a 3.5-year studentship from the Engineering and Physical Sciences Council (EPSRC DTP). Funding covers tuition fees, a stipend (?15,285 per annum, 2020/21 rate) and research/training expenses (?1,000 per annum). EPSRC DTP studentships are open to both Home and International students; however, in line with guidance from UK Research and Innovation (UKRI), the number of awards available to International candidates will be limited to 30% of the total. We advise checking our funding webpages before applying: https://www.bath.ac.uk/corporate-information/funding-for-doctoral-research-in-science/ ===== Projects and Supervisors ===== VERIFICATION FOR REAL POLYNOMIAL ARITHMETIC Russell Bradford | R.J.Bradford at bath.ac.uk | http://people.bath.ac.uk/masrjb/ James Davenport | J.H.Davenport at bath.ac.uk | http://people.bath.ac.uk/masjhd/ Many problems in building verified software systems in the real world (e.g. air traffic control) involve the proof of statements about real polynomial arithmetic, often including inequalities. In principle we have known how to solve such systems for many years, but the theoretical, and too often the practical, complexity is excessive. There has been much work, at Bath, Coventry and elsewhere, in reducing the cost for important special cases, notably the cases when there are equations as well as inequalities. However, this leads to a large piece of software, resting on fairly complicated theorems. Recent research by Bath, Coventry and RWTH has produced a method (http://arxiv.org/abs/2004.04034) which converts such a problem into a sequence of simpler statements, which may be much easier to verify with a more conventional theorem prover. This has yet to be checked in practice, which is the goal of this project. As a PhD student, you would be working alongside the joint Bath-Coventry EPSRC-funded project, which would provide several colleagues and a large software base to start from. NEW FOUNDATIONS OF PROOF THEORY FROM A NOVEL NOTION OF SUBSTITUTION Alessio Guglielmi | A.Guglielmi at bath.ac.uk | http://alessio.guglielmi.name What is a proof? What is an algorithm? We understand much of WHAT can be proved and computed but we do not have yet a good theory of HOW this is done. For example, we cannot say when two given proofs or algorithms are the same, in the sense that they prove or compute something using the same method. It is a somewhat embarrassing problem to have, given that, in most branches of mathematics, we can compare objects. For instance, we can reduce two polynomials to some canonical form, like maximal factorisation, and use that for a comparison. The source of the problem is the languages in which proofs and algorithms are represented because they model their underlying mathematical structure. In traditional proof theory, the mathematical properties of those structures are too poor. To address the problem, for the past two decades we have been building a new proof theory, called 'deep inference', whose emphasis is in HOW proofs, and by extension algorithms, are composed. That requires new languages and new design principles. One current focus of research is developing a notion of substitution for proofs, which, among other properties, should enable a powerful form of factorisation. We propose PhD projects contributing to this effort. These are foundational problems for proof theory, meaning that talent for algebra and combinatorics is more important than knowledge of logic. A NEW APPROACH TO COMPUTATIONAL EFFECTS IN LAMBDA-CALCULUS Willem Heijltjes | W.B.Heijltjes at bath.ac.uk | http://willem.heijltj.es A key property of the lambda-calculus, as a model of computation, is confluence: it means that we can reason about the *outcome* of a computation separately from the *process*; in other words, we can separate the *denotational* from the *operational*. When computational effects are introduced, as would be essential for a real-world functional programming language, confluence is however lost, and the outcome of a computation becomes dependent on the chosen reduction strategy. In this project we are working towards a new way of incorporating effects into the lambda-calculus. Rather than adding new primitives, we decompose the existing constructs of the lambda-calculus, which can then be used to encode various imperative features such as sequencing, state update and retrieval, and input and output. The approach preserves confluence and gives a new way of typing computational effects, which opens up new denotational and operational perspectives. As a PhD student, you would contribute to the development and extension of this promising new paradigm. Your work would draw on ideas from type theory, proof theory including deep inference and categorical logic, and denotational semantics as well as lambda calculus. QUANTITATIVE GAME SEMANTICS Jim Laird | J.D.Laird at bath.ac.uk | http://www.cs.bath.ac.uk/~jl317/ Denotational semantics builds abstractions of computer programs and concurrent systems, which allows us to look past their syntax and represent them using mathematical structures from a range of fields such as algebra and topology. These come with powerful theorems and techniques which we can use to prove that programs and protocols are correct, secure and efficient. Moving beyond binary properties: ?Does this program terminate?? ?Might it deadlock?? to quantitative ones: ?What is its evaluation cost in time or space?? ?What is the probability of returning a value?? requires models which can capture program behaviour - on which these properties depend - in a way which is abstract, structured and precise. Game semantics provides such a representation by modelling computation as a two-player game between a program or agent and its environment. It is intuitively appealing and has profound connections with fields from category theory to automata theory. This project will use these connections to investigate the relationship between games and quantitative properties of programs, and use these foundations to build new models and discover new theories. INTERSECTION-TYPE SEMANTICS OF IMPERATIVE PROGRAMMING Guy McCusker | G.A.McCusker at bath.ac.uk | http://www.cs.bath.ac.uk/~gam23/ Imperative programming offers fast programs and fine control over execution, but is hard to verify, mainly due to the difficulty of giving a good semantics. In this project you would investigate a new approach based on intersection types, expressed in open deduction. Intersection types can be seen from a programming-language perspective as a type system, providing static information about program behaviour, and from a semantic perspective as a presentation of a relation-based mathematical model of programs and proofs. The novelty of this project is to use non-commutative types to model sequential computation. Expressing such types effectively is made possible by the open-deduction formalism, an approach to proof theory that can alternatively be viewed as a presentation of category-theory-based semantics. The project builds on our recent work exploring intersection types in this proof formalism. A background that includes lambda-calculus or category theory would help you make a good start on it. PROOF MINING: ALGORITHMS FROM PROOFS IN MATHEMATICS Tom Powell | trjp20 at bath.ac.uk | http://t-powell.github.io Many mathematical theorems are based on the statement that something exists. For example, Euclid's theorem on the infinitude of prime numbers says that for any number N there exists some prime number p greater than N. For such statements it is natural to ask: Can we produce an algorithm for computing the thing that we claim to exist? The proof of Euclid's theorem implicitly contains an algorithm* for finding the next prime number, and we call such proofs "constructive". Unfortunately, Turing's famous discovery that the Halting problem is undecidable highlights the fact that not all proofs are constructive, and that in general one cannot always produce algorithms for witnessing existential statements. After all, for any Turing machine M on input u there exists a boolean truth value which tells us whether or not it halts, but a general algorithm which on inputs M and u returns such a boolean is not possible by Turing's result. The question of whether or not we can produce an algorithm for a given existential theorem is complex, and requires a deep understanding of the nature of mathematical proofs as objects in their own right. The last 20-30 years has seen the growth of an exciting research area - colloquially known as "proof mining" - which addresses this question and explores the limits of what is algorithmically possible in mathematics. It turns out that by applying techniques from proof theory, it is often possible to obtain surprising algorithms from proofs that appear to be nonconstructive. In the process, one is typically required to tackle more general challenges, such as "how should mathematical objects be represented?" and "what is the fundamental structure of this proof?", and the end result is often an abstract framework which generalises and unifies classes of mathematical theorems. Proof mining has already achieved impressive results several areas of mathematics, including functional analysis, ergodic theory and commutative algebra. As a PhD student, you would explore developing this research program in a new direction. *Take the number N! + 1, which is not divisible by any number from 2 to N, and search for its smallest prime factor, which must therefore by greater than N. NOTE: This project is available through a separate funding stream - please see here for funding and eligibility details: https://www.findaphd.com/phds/project/proof-mining-algorithms-from-proofs-in-mathematics/?p128254 From carsten at dcs.bbk.ac.uk Thu Feb 11 04:06:28 2021 From: carsten at dcs.bbk.ac.uk (Carsten Fuhs) Date: Thu, 11 Feb 2021 09:06:28 +0000 Subject: [TYPES/announce] FSCD 2021: Extended deadline (Abstract: February 16/ Submission: February 22) Message-ID: (Apologies for multiple copies of this announcement. Please circulate.) ================================================================== Updated information on: Abstract and Submission dates ================================================================== CALL FOR PAPERS Sixth International Conference on Formal Structures for Computation and Deduction (FSCD 2021) July 17 - July 24, 2021, Buenos Aires, Argentina https://fscd2021.dc.uba.ar/ In-cooperation with ACM SIGLOG and SIGPLAN NOTE: Due to the Covid 19 pandemic situation, the 2021 edition of FSCD and its satellite workshops will be held online. IMPORTANT DATES --------------- All deadlines are midnight anywhere-on-earth (AoE); late submissions will not be considered. Abstract: February 16, 2021 *** extended Submission: February 22, 2021 *** extended Rebuttal: April 2-5, 2021 Notification: April 19, 2021 Final version: May 3, 2021 INVITED SPEAKERS ---------------- - Zena M. Ariola, University of Oregon https://ix.cs.uoregon.edu/~ariola/ - Nao Hirokawa, JAIST https://www.jaist.ac.jp/~hirokawa/ - Elaine Pimentel, Federal University of Rio Grande do Norte https://sites.google.com/site/elainepimentel/ - Sam Staton, University of Oxford https://www.cs.ox.ac.uk/people/samuel.staton/main.html AFFILIATED WORKSHOPS -------------------- - HoTT/UF: 6th Workshop on Homotopy Type Theory/Univalent Foundations - ITRS: 10th Workshop on Intersection Types and Related Systems - WPTE: 7th International Workshop on Rewriting Techniques for Program Transformations and Evaluation - UNIF: 35th International Workshop on Unification - LSFA: 16th Logical and Semantics Frameworks with Applications - IWC: 10th International Workshop on Confluence - IFIP WG 1.6: 24th meeting of the IFIP Working Group 1.6: Rewriting FSCD (http://fscd-conference.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 --------------------- The submission site is: https://easychair.org/conferences/?conf=fscd2021 Submissions can be made in two categories. Regular research papers are limited to 15 pages, excluding references and appendices. They 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. An archive of the code with instructions on how to install and run the tool must be submitted. In addition, a webpage where the system can be experimented with should be provided. Complete instructions on submitting a paper can be found on the conference web site: https://fscd2021.dc.uba.ar/ One author of an accepted paper is expected to present it at the conference 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 ----------------------- Naoki Kobayashi, The University of Tokyo fscd2021 at easychair.org PROGRAM COMMITTEE ----------------- M. Ayala-Rinc?n, Universidade de Bras?lia S. Berardi, University of Torino F. Blanqui, INRIA E. Bonelli, Stevens Institute of Technology ?. Contejean, CNRS, Universit? Paris-Saclay T. Coquand, University of Gothenburg T. Ehrhard, Universit? de Paris, CNRS S. Escobar, Univ. Polit?cnica de Val?ncia J. Esp?rito Santo, University of Minho C. Faggian, Universit? de Paris, CNRS A. Felty, University of Ottawa S. Figueira, Universidad de Buenos Aires M. Fiore, University of Cambridge M. Gaboardi, Boston University S. Ghilezan, University of Novi Sad I. Hasuo, National Institute of Informatics D. Kesner, Universit? de Paris R. Krebbers, Radboud University Nijmegen T. Kutsia, Johannes Kepler University Linz B. K?nig, University of Duisburg-Essen M. Lenisa, University of Udine N. Nishida, Nagoya University L. Ong, University of Oxford P. Parys, University of Warsaw J. Rehof, TU Dortmund University C. Rocha, Pontificia Univ. Javeriana Cali A. Silva, University College London N. Szasz, Universidad ORT Uruguay A. Tiu, Australian National University S. Winkler, University of Verona H. Yang, KAIST, South Korea CONFERENCE CHAIR ---------------- Alejandro D?az-Caro, Quilmes Univ. & ICC/CONICET WORKSHOP CHAIRS -------------- Mauricio Ayala-Rinc?n, Universidade de Bras?lia Carlos L?pez Pombo, Universidad de Buenos Aires STEERING COMMITTEE WORKSHOP CHAIR -------------------------------- Jamie Vicary, Oxford University PUBLICITY CHAIR --------------- Carsten Fuhs, Birkbeck, University of London FSCD STEERING COMMITTEE ----------------------- Z. Ariola, University of Oregon M. Ayala-Rinc?n, University of Brasilia C. Fuhs, Birkbeck, University of London H. Geuvers, Radboud University S. Ghilezan, University of Novi Sad S. Guerrini, University of Paris 13 D. Kesner (Chair), University of Paris Diderot H. Kirchner, Inria C. Kop, Radboud University D. Mazza, University of Paris 13 L. Ong, Oxford University J. Rehof, TU Dortmund J. Vicary, Oxford University From Graham.Hutton at nottingham.ac.uk Thu Feb 11 09:22:26 2021 From: Graham.Hutton at nottingham.ac.uk (Graham Hutton) Date: Thu, 11 Feb 2021 14:22:26 +0000 Subject: [TYPES/announce] 10 PhD studentships in Nottingham Message-ID: <3AC69D59-038A-4A0A-9E78-F61397983BD3@nottingham.ac.uk> Dear all, The School of Computer Science at the University of Nottingham is seeking applications for 10 fully-funded PhD studentships: https://tinyurl.com/ten-phds-2021 Applicants in the area of the Functional Programming Laboratory (https://tinyurl.com/fp-notts) are strongly encouraged! If you are interested in applying, please contact a potential supervisor as soon as possible (the application deadline is 15th March): Thorsten Altenkirch - constructive logic, proof assistants, homotopy type theory, category theory, lambda calculus. Graham Hutton - mathematics of program construction, category theory, program correctness and efficiency, Haskell. Nicolai Kraus - homotopy type theory, higher category theory, constructive mathematics, and related topics. Henrik Nilsson - functional reactive programming, domain- specific languages, generalised notions of computation. The studentships are open to applicants of any nationality. Best wishes, Graham +-----------------------------------------------------------+ 10 Fully-Funded PhD Studentships School of Computer Science University of Nottingham, UK tinyurl.com/ten-phds-2021 Applications are invited for a number of fully funded PhD studentships offered by the School of Computer Science at the University of Nottingham, starting on 1st October 2021. The topics for the studentships are open, but should relate to the interests of one of the School?s research groups: Computational Optimisation and Learning Lab; Computer Vision Lab; Cyber Security; Functional Programming; Intelligent Modelling and Analysis; Mixed Reality Lab and Uncertainty in Data and Decision Making. The studentships are for three and a half years and include a stipend of (minimum) ?15,609 per year and tuition fees. Applicants are normally expected to have a 2:1 Bachelor or Masters degree or international equivalent, in Computer Science or a related discipline, and must obtain the support of a potential supervisor in the School prior to submitting their application. Please contact potential supervisors at least two weeks prior to the closing date for applications. Informal enquiries may be addressed to Professor Tony Pridmore (tony.pridmore at nottingham.ac.uk). To apply, please submit the following items by email to Lindsay.Norman at nottingham.ac.uk: (1) A copy of your CV, including your actual or expected degree class(es), and results of all University examinations; (2) An example of your technical writing, such as a project report or dissertation; (3) Contact details for two academic referees - it is the applicant?s responsibility to ensure that references are requested and sent to Lindsay.Norman at nottingham.ac.uk; (4) A research proposal ? max 2 x sides A4; (5) A covering letter, which must include the name of the member of staff who has agreed to support your application (without this your application cannot be considered), and the University?s job reference number (SCI1979). Closing date for applications: Monday 15th March 2021. +-----------------------------------------------------------+ This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law. From perelli at diag.uniroma1.it Thu Feb 11 11:13:22 2021 From: perelli at diag.uniroma1.it (Giuseppe Perelli) Date: Thu, 11 Feb 2021 17:13:22 +0100 Subject: [TYPES/announce] LAMAS&SR Final CFP (Submission deadline extended) Message-ID: FINAL CALL FOR PAPERS (SUBMISSION DEADLINE EXTENDED) International Workshop on Logical Aspects of Multi-Agent Systems and Strategic Reasoning (LAMAS&SR) Satellite workshop of AAMAS 2021, Virtual, May 3-4, 2021 ?? ?https://lamassr.github.io/ Logics and strategic reasoning play a central role in multi-agent systems. Logics can be used, for instance, to express the agents' abilities, knowledge, and objectives. Strategic reasoning refers to algorithmic methods that allow for developing good behavior for the agents of the system. At the intersection, we find logics that can express existence of strategies or equilibria, and can be used to reason about them. The LAMAS&SR workshop merges two international workshops: LAMAS, which focuses on all kinds of logical aspects of multi-agent systems from the perspectives of artificial intelligence, computer science, and game theory, and SR, devoted to all aspects of strategic reasoning in formal methods and artificial intelligence. Over the years the communities and research themes of both workshops got closer and closer. LAMAS&SR unifies LAMAS and SR under the same flag, formally joining the two communities in order to expose each of them to a wider range of work relevant to their research. LAMAS&SR is thus interested in all topics related to logics and strategic reasoning in multi-agent systems, from theoretical foundations to algorithmic methods and implemented tools. The topics of the workshop include, but are not limited to: ?? ?Logical systems for specification, analysis, and reasoning about multi-agent systems; ?? ?Logic-based modeling of multi-agent systems; ?? ?Dynamical multi-agent systems; ?? ?Deductive systems and decision procedures for logics for multi-agent systems; ?? ?Development and implementation of methods for formal verification in multi-agent systems; ?? ?Logic-based tools for multi-agent systems; ?? ?Logics for reasoning about strategic abilities; ?? ?Logics for multi-agent mechanism design, verification, and synthesis; ?? ?Logical foundations of decision theory for multi-agent systems;Dear [*NAME*], ?? ?Strategic reasoning in formal verification; ?? ?Automata theory for strategy synthesis; ?? ?Applications and tools for cooperative and adversarial reasoning; ?? ?Robust planning and optimization in multi-agent systems; ?? ?Risk and uncertainty in multi-agent systems; ?? ?Quantitative aspects in strategic reasoning. LAMAS&SR 2021 will be held with AAMAS 2021 Online. SUBMISSIONS: Authors are invited to submit extended abstracts of 2 pages plus 1 page for references in the AAMAS format. Both published and unpublished works are welcome. Submissions are subject to a single-blind review process (submissions should not be anonymous). There will be no formal proceedings, but accepted extended abstracts will be made available on the workshop's website. We envisage that extensions of selected papers will be invited to a journal. Authors are invited to submit their manuscript via EasyChair. Submission webpage: https://easychair.org/my/conference?conf=lamassr21# IMPORTANT DATES: Paper submission: 14 Feb, 2021 (AoE) (EXTENDED!) Author Notification: 10 March, 2021 Camera Ready: 24 March, 2021 Workshop: May 3-4, 2021 ORGANIZERS: Bastien Maubert, University of Naples "Federico II" (bastien.maubert at gmail.com) Giuseppe Perelli, Sapienza University of Rome (perelli at diag.uniroma1.it) PROGRAMME COMMITTEE: Thomas Agotnes, University of Bergen, Norway Natasha Alechina, Utrecht University, Netherlands Suguman Bansal, University of Pennsylvania, USA Patricia Bouyer, CNRS & LSV, France Rayna Dimitrova, CISPA, Germany Nathana?l Fijalkow, CNRS & LaBRI, France Tim French, University of Western Australia, Australia Valentin Goranko, Stockholm University, Sweden Davide Grossi, University of Groningen, Netherlands Paul Harrenstein, Oxford University, UK Wojtek Jamroga, University of Luxembourg and Polish Academy of Sciences Sophia Knight, Duluth University, USA Orna Kupferman, Hebrew University, Israel Fangzhen Lin, Hong Kong University of Science and Technology, Hong Kong Vadim Malvone, Telecom Paris, France Sophie Pinchinat, Universit? de Rennes, France Ramanujam R, IMSc Chennai, India Sasha Rubin, The University of Sydney, Australia Abdallah Saffidine, University of New South Wales, Australia Eugenia Ternovska, Simon Fraser University, Canada From m.backens at cs.bham.ac.uk Thu Feb 11 13:02:46 2021 From: m.backens at cs.bham.ac.uk (Miriam Backens) Date: Thu, 11 Feb 2021 18:02:46 +0000 Subject: [TYPES/announce] Deadline extension: Quantum Physics and Logic (QPL 2021), new submission deadline 12 March Message-ID: *18th International Conference on Quantum Physics and Logic (QPL 2021), June 7-11, 2021. Online and Gda?sk, Poland* Given the ongoing COVID-19 situation, the main focus of QPL 2021 will now be the online component. The decision on the form that the on-site component of QPL 2021 will take, will be made a month prior to the conference. We understand that this may affect the travel options of the participants, especially visa applications, but unfortunately the impact on mobility that the pandemic has is beyond our control. As a result, the organisers and PC chairs have decided to extend the deadline for submissions by a month. CALL FOR PAPERS QPL is an annual conference that brings together researchers working on mathematical foundations of quantum physics, quantum computing, and related areas, with a focus on structural perspectives and the use of logical tools, ordered algebraic and category-theoretic structures, formal languages, semantical methods, and other computer science techniques applied to the study of physical behaviour in general. Work that applies structures and methods inspired by quantum theory to other fields (including computer science) is also welcome. QPL 2021 will be held both virtually online and physically in Gdansk (COVID permitting). More information at https://qpl2021.eu/ INVITED SPEAKERS Matty Hoban Flaminia Giacomini Anna Jencova Hl?r Kristj?nsson Ariel Bendersky Martha Lewis IMPORTANT DATES Submission deadline: March 12, 2021 Author notification: April 23, 2021 Early registration: May 14, 2021 Proceedings paper ready: May 28, 2021 Conference: June 7-11, 2021 SUBMISSION GUIDELINES Recent work that is relevant to the conference is solicited in one (or more) of three tracks: * Proceedings submissions consist of a 5-12 page extended abstract. Only proceedings-track submissions are eligible to be published in Electronic Proceedings in Theoretical Computer Science (EPTCS) after the conference. * Non-proceedings submissions consist of a 3 page extended abstract and a link to a separate published paper, pre-print, or an attached draft. * Poster submissions consist of a 1-3 page abstract and may contain a link to a separate published paper or pre-print. Submission of partial results of work in progress is encouraged. Submissions should be prepared using LaTeX, and must be submitted in PDF format. Use of the EPTCS style is encouraged. Submission is done via EasyChair: https://www.easychair.org/conferences/?conf=qpl2021 BEST STUDENT PAPER There will be an award for the best student paper at the discretion of the programme committee. Papers eligible for the award are those where all the authors are students at the time of submission. PROGRAMME COMMITTEE Antonio Acin Barbara Amaral Pablo Arrighi Miriam Backens (co-chair) Jonathan Barrett Alessandro Bisio Anne Broadbent Ulysse Chabaud Bob Coecke Alejandro Diaz-Caro Ross Duncan Yuan Feng Alexandru Gheorghiu Stefano Gogioso Teiko Heinosaari Chris Heunen (co-chair) Matthew Hoban Kohei Kishida Aleks Kissinger Ravi Kunjwal Ciaran Lee Matt Leifer Martha Lewis Shane Mansfield Simon Martiel Hector Miller-Bakewell Mio Murao Glaucia Murta Ognyan Oreshkov Prakash Panangaden Simon Perdrix Lidia del Rio Julien Ross Mehrnoosh Sadrzadeh Ana Bel?n Sainz John Selby Rui Soares Barbosa Rob Spekkens Isar Stubbe Benoit Valiron Jamie Vicary John van de Wetering Alexander Wilce Mingsheng Ying Vladimir Zamdzhiev Margherita Zorzi -- Dr Miriam Backens (they/them) Lecturer School of Computer Science, University of Birmingham From ehrhard at irif.fr Thu Feb 11 15:56:27 2021 From: ehrhard at irif.fr (Thomas Ehrhard) Date: Thu, 11 Feb 2021 21:56:27 +0100 Subject: [TYPES/announce] 12 month postdoc positions in Paris and Marseille Message-ID: <8214de97-825b-3aa6-a04c-05e70ddf15db@irif.fr> The ANR Research Project PPS (Probabilistic Programming Semantics, ANR-19-CE48-0014) described here: https://www.irif.fr/anrpps offers two 12 month postdoc positions for the next academic year: ??? * one at IRIF (CNRS and Universit? de Paris) https://www.irif.fr/ ??? * one at I2M (CNRS and Universit? d'Aix-Marseille) https://www.i2m.univ-amu.fr/ Our goal is to develop formal methods for probabilistic computing (semantics, type systems, logical frameworks for program verification, abstract machines ,etc.), building on the many connections between Proof Theory, Linear Algebra and the Theory of Programming Languages which arise within Linear Logic. Acquaintance with probabilistic programming languages, their mathematical semantics and/or their implementation, is welcome but not mandatory, although we expect the applicant to be excited to work on this topic. Interested persons should contact as soon as possible Thomas Ehrhard (ehrhard at irif.fr) and Michele Pagani (pagani at irif.fr) briefly outlining their academic background and research interest and indicating if they have a preference as to the location (I2M or IRIF). As a second step, a complete application consisting of - a cover letter - a detailed CV including a list of publications and a summary of research - contact information for two or three academic references is expected to be sent by email to Thomas Ehrhard and Michele Pagani. The review of applications will begin on March 1st and continue until the position is filled. The positions are expected to start on October 1st 2021 at the latest. From s.lasota at uw.edu.pl Sun Feb 14 13:45:06 2021 From: s.lasota at uw.edu.pl (=?UTF-8?Q?S=C5=82awomir_Lasota?=) Date: Sun, 14 Feb 2021 19:45:06 +0100 Subject: [TYPES/announce] Fundamenta Informaticae ---> OPEN ACCESS Message-ID: We are happy to announce that Fundamenta Informaticae, a journal with over four decades of tradition, has moved to the open-access episciences.org platform. The journal was established in 1977 by Helena Rasiowa, and has been publishing scientific works in theoretical foundations of Computer Science ever since. With the move to episciences.org, an established overlay journal platform, we are embracing open access as a necessity for modern academic publication venues. At the same time, we shall keep the production of printed issues distributed by the IOS publishing house. Please consider submitting your best work to us. We are also open for suggestions of special issues in the general field of Theoretical Computer Science. Best regards, Damian Niwi?ski (editor-in-chief) Bartek Klin (managing editor) S?awek Lasota (managing editor) -------------- next part -------------- An HTML attachment was scrubbed... URL: From samuel.mimram at lix.polytechnique.fr Mon Feb 15 03:55:22 2021 From: samuel.mimram at lix.polytechnique.fr (Samuel Mimram) Date: Mon, 15 Feb 2021 09:55:22 +0100 Subject: [TYPES/announce] International Workshop on Confluence (IWC 2021): call for papers Message-ID: <0ed91819-f2e6-4413-8d0a-c792bee1edce@lix.polytechnique.fr> --//----//----//----//----//----//----//----//----//----//----//----//----//-- First Call For Papers 10th International Workshop on Confluence http://www.lix.polytechnique.fr/iwc2021 July 23, 2021 Collocated with FSCD 2021, July 17-24, 2021 --//----//----//----//----//----//----//----//----//----//----//----//----//-- The 10th International Workshop on Confluence (IWC 2021) aims at promoting further research in confluence and related properties. Confluence provides a general notion of determinism and has always been conceived as one of the central properties of rewriting. Recently there is a renewed interest in confluence research, resulting in new techniques, tool support, certification as well as new applications. The workshop aims at promoting further research in confluence and related properties. Confluence relates to many topics of rewriting (completion, modularity, termination, commutation, etc.) and has been investigated in many formalisms of rewriting such as first-order rewriting, lambda-calculi, higher-order rewriting, constrained rewriting, conditional rewriting, etc. Recently there is a renewed interest in confluence research, resulting in new techniques, tool supports, certification as well as new applications. ## IMPORTANT INFORMATION Due to current travel restrictions in various countries, the meeting will be held **virtually** this year. ## TOPICS - confluence and related properties (unique normal forms, commutation, ground confluence) - completion - critical pair criteria - decidability issues - complexity issues - system descriptions - certification - applications of confluence The objective of this workshop is to bring together theoreticians and practitioners to promote new techniques and results, and to facilitate feedback on the implementation and application of such techniques and results in practice. IWC 2020 also aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. More information can be found on the webpage of the conference: http://www.lix.polytechnique.fr/iwc2021 ## SUBMISSIONS We solicit short papers or extended abstracts of at most five pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and may provide additional feedback. The accepted papers will be made available electronically before the workshop. The page limit for papers is 5 pages in EasyChair style. Short papers or extended abstracts must be submitted electronically through the EasyChair system at: https://easychair.org/conferences/?conf=iwc2021 EasyChair style: http://easychair.org/publications/for_authors ## IMPORTANT DATES - Title and Abstract: ? April 19, 2021 - Paper Submission: ? April 26, 2021 - Notification to authors: ? May 31, 2021 - Workshop date: ? July 23, 2021 ## INVITED SPEAKERS TBD ## PROGRAM COMMITTEE - Beniamino Accatolli (Inria & LIX, ?cole Polytechnique) - Sandra Alves (Universidade do Porto) - Cyrille Chenavier (Universit? de Limoges) - Alejandro D?az-Caro (Universidad Nacional de Quilmes & ICC/UBA-CONICET) - Samuel Mimram (LIX, ?cole Polytechnique), co-chair - Camilo Rocha (Pontificia Universidad Javeriana), co-chair - Femke van Raamsdonk (VU University Amsterdam) - Sarah Winkler (University of Bolzano) ## FSCD 2021 ORGANISING COMMITTEE - FSCD/IJCAR Conference Chair: Alejandro D?az-Caro, Universidad Nacional de Quilmes & ICC (UBA/CONICET) - FSCD/IJCAR Workshop Chairs: Mauricio Ayala-Rinc?n, Universidade de Bras?lia Carlos L?pez Pombo, Universidad de Buenos Aires & ICC (UBA/CONICET) ## CONTACT - Samuel Mimram: samuel.mimram(at)lix.polytechnique.fr - Camilo Rocha: camilo.rocha(at)javerianacali.edu.co From florin.manea at informatik.uni-goettingen.de Mon Feb 15 08:31:50 2021 From: florin.manea at informatik.uni-goettingen.de (Manea, Florin) Date: Mon, 15 Feb 2021 13:31:50 +0000 Subject: [TYPES/announce] CSL 2022 - call for papers Message-ID: <56749ca0c8324a2c9af4e683ab7c60a5@informatik.uni-goettingen.de> ===================================== First call for papers (CSL'22) ===================================== Computer Science Logic (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. CSL'22 will be held on February 14 - 19, 2022, in G?ttingen, Germany. 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: ---------------------- Submitted papers must be in English and must provide sufficient detail to allow the Programme Committee to assess the merits of the paper. Full proofs may appear in a clearly marked technical appendix which will be read at the reviewers' discretion. Authors are strongly encouraged to include a well written introduction which is directed at all members of the PC. The CSL 2022 conference proceedings will be published in Leibniz International Proceedings in Informatics (LIPIcs), see https://submission.dagstuhl.de/documentation/authors. 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. Important dates: ---------------- Abstract submission: July 5, 2021 (AoE), Paper submission: July 12, 2021 (AoE), Notification: September 30, 2021, Conference: February 14-19, 2022 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 Program Committee: ------------------ Thorsten Altenkirch (Nottingham, UK) Benedikt Bollig (Cachan, France) Agata Ciabattoni (Vienna, Austria) Liron Cohen (Ben-Gurion University, Israel) Anupam Das (Birmingham, UK) Claudia Faggian (Paris, France) Francesco Gavazzo (Bologna, Italy) Stefan G?ller (Kassel, Germany) Willem Heijltjes (Bath, UK) Sandra Kiefer (Aachen, Germany) Emanuel Kieronski (Wroclaw, Poland) Bartek Klin (Warsaw, Poland) Juha Kontinen (Helsinki, Finland) Anthony Lin (Kaiserslautern, Germany) Karoliina Lehtinen (Marseille, France) Florin Manea (G?ttingen, Germany, co-chair) Fredrik Nordvall Forsberg (Strathclyde, UK) Liat Peterfreund (Paris, France and Edinburgh, UK) Daniela Petrisan (Paris, France) Karin Quaas (Lepizig) Alex Simpson (Ljubljana, Slovenia, co-chair) Pawel Sobocinski (Tallin, Estonia) Anna Sokolova (Salzburg, Austria) Linda Brown Westrick (Connecticut, US) Organization Committee: ----------------------- Fundamentals of Computer Science Group (University of G?ttingen, Germany; Florin Manea, chair) Contact: -------- Please send all questions about submissions to the PC co-chairs: csl2022 at easychair.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From tyokoyama at acm.org Tue Feb 16 06:54:35 2021 From: tyokoyama at acm.org (Tetsuo Yokoyama) Date: Tue, 16 Feb 2021 20:54:35 +0900 Subject: [TYPES/announce] Reversible Computation 2021 3rd CfP (Extended deadlines) Message-ID: <0e24321a-d303-dca1-2433-e92e83376053@acm.org> ======================================================================= 3rd Call for Papers 13th Conference on Reversible Computation (RC 2021) July 7th-8th, 2021, Nagoya, Japan (the conference will be held online) Abstract Submission: Sun, February 28th, 2021 (EXTENDED) Submission Deadline: Sun, March 7th, 2021 (EXTENDED) http://www.reversible-computation.org ======================================================================= Reversible computation has a growing number of promising application areas such as low power design, coding/decoding, debugging, testing and verification, database recovery, discrete event simulation, reversible algorithms, reversible specification formalisms, reversible programming languages, process algebras, and the modeling of biochemical systems. Furthermore, reversible logic provides a basis for quantum computation with its applications, for example, in cryptography and in the development of highly efficient algorithms. First reversible circuits and quantum circuits have been implemented and are seen as promising alternatives to conventional CMOS technology. The conference will bring together researchers from computer science, mathematics, and physics to discuss new developments and directions for future research in Reversible Computation. This includes applications of reversibility in quantum computation. Research papers, tutorials, tool demonstrations, and work-in-progress reports are within the scope of the conference. Invited talks by leading international experts will complete the program. Contributions on all areas of Reversible Computation are welcome, including--but not limited to--the following topics: * Applications * Architectures * Algorithms * Bidirectional transformations * Circuit Design * Debugging * Fault Tolerance and Error Correction * Hardware * Information Theory * Physical Realizations * Programming Languages * Quantum Computation * Software * Synthesis * Theoretical Results * Testing * Verification ===== Important Dates ===== - Abstract Submission: Sun, February 28th, 2021 (EXTENDED) - Submission Deadline: Sun, March 7th, 2021 (EXTENDED) - Notification to Authors: Sat, April 10th, 2021 - Final Version: Sat, May 1st, 2021 - Conference: Wed-Thu, July 7th-8th, 2021 (the conference will be held online) ===== Invited speakers ===== - Atsushi Matsuo (IBM Research - Tokyo) - TBA ===== Paper submission ===== In order to submit a paper to Reversible Computation conference, please follow these guidelines: * You can submit full research papers (16 pages maximum), tutorials (16 pages maximum), as well as work-in-progress or tool demonstration papers (6 pages maximum). Please do not forget to clearly indicate the type of your submission by choosing the proper category on the submission page. * Additional material intended for reviewers but not for publication in the final version--for example, details of proofs--may be placed in a clearly marked appendix that is not included in the page limit. Reviewers are at liberty to ignore appendices and papers must be understandable without them. * The paper submission will be accepted as a PDF file using the LNCS style. Further information on the style is available at http://www.springer.com/gb/computer-science/lncs/conference-proceedings-guidelines * All accepted research papers will be published in Springer's Lecture Notes in Computer Science (LNCS). * Author(s) of accepted papers are expected to participate in the conference and to present their papers. We would appreciate if one person would not present more than two papers at the conference. If more than two papers are accepted by a group of authors, we kindly ask that the papers be presented by different co-authors, as far as possible. * PC chairs and general chairs are not permitted to submit papers to the conference. If you have further questions, please do not hesitate to ask us (info at reversible-computation.org). ===== Submission system ===== The papers will be submitted via EasyChair. In order to submit your paper, please use EasyChair: https://easychair.org/conferences/?conf=rc2021 ===== Organizers ===== * General Chair Shoji Yuen Nagoya University, Japan * Program co-chairs Shigeru Yamashita Ritsumeikan University, Japan Tetsuo Yokoyama Nanzan University, Japan ===== Program Committee ===== Gerhard Dueck (University of New Brunswic, Canada) Michael P. Frank (Sandia National Laboratories, US) Robert Gl?ck (University of Copenhagen, Denmark) Eva Graversen (Imperial College London, UK) James Hoey (University of Leicester, UK) Jarkko Kari (University of Turku, Finland) Jean Krivine (CNRS, France) Ivan Lanese (University of Bologna/INRIA, Italy) Martin Lukac (Nazarbayev University, Kazakhstan) Claudio Antares Mezzina (Universit? di Urbino, Italy) Claudio Moraga (TU Dortmund University, Germany) Keisuke Nakano (Tohoku University, Japan) Luca Paolini (Universita degli Studi di Torino, Italy) Krzysztof Podlaski (University of Lodz, Poland) Mariusz Rawski (Warsaw University of Technology, Poland) Markus Schordan (Lawrence Livermore National Laboratory, US) Mathias Soeken (Ecole Polytechnique F?d?rale de Lausanne, Switzerland) Milena Stankovic (University of Nis, Serbia) Himanshu Thapliyal (University of Kentucky, US) Michael Kirkedal Thomsen (University of Copenhagen, Denmark) Irek Ulidowski (University of Leicester, UK) Rodney Van Meter (Keio University, Japan) Robert Wille (Johannes Kepler University Linz, Austria) info at reversible-computation.org http://www.reversible-computation.org From nick.hu at cs.ox.ac.uk Tue Feb 16 08:09:11 2021 From: nick.hu at cs.ox.ac.uk (Nick Hu) Date: Tue, 16 Feb 2021 13:09:11 +0000 Subject: [TYPES/announce] CALL FOR PAPERS -- APPLIED CATEGORY THEORY 2021, CAMBRIDGE UK, JULY 12-16 -- HYBRID CONFERENCE Message-ID: CALL FOR PAPERS Fourth Annual International Conference on Applied Category Theory (ACT 2021) 12 - 16 July, 2021, Cambridge, United Kingdom (and online) https://www.cl.cam.ac.uk/events/act2021 * * * The Fourth International Conference on Applied Category Theory will take place at the Computer Laboratory of the University of Cambridge on 12-16 July, 2021, preceded by the Adjoint School 2021 on 5-9 July. This conference follows previous events at MIT, Oxford and Leiden. Applied category theory is a topic of interest for a growing community of researchers, interested in studying many different kinds of systems using category-theoretic tools. These systems are found across computer science, mathematics, and physics, as well as in social science, linguistics, cognition, and neuroscience. The background and experience of our members is as varied as the systems being studied. The goal of the Applied Category Theory conference series is to bring researchers together, disseminate the latest results, and facilitate further development of the field. We accept submissions of both original research papers, and work accepted/submitted/ published elsewhere. Accepted original research papers will be invited for publication in a proceedings volume. The keynote addresses will be drawn from the best accepted papers. The conference will include an industry showcase event. We hope to run the conference as a hybrid event, with physical attendees present in Cambridge, and other participants taking part online. However, due to the state of the pandemic, the possibility of in-person attendance is not yet confirmed. Please do not book your travel or hotel accommodation yet. ** IMPORTANT DATES (all in 2021) ** - Submission of contributed papers: Monday 10 May - Acceptance/rejection notification: Monday 7 June - Adjoint school: Monday 5 July to Friday 9 July - Main conference: Monday 12 July to Friday 16 July ** SUBMISSIONS ** The following two types of submissions are accepted: - Proceedings Track. Original contributions of high-quality work consisting of an extended abstract, up to 12 pages, that provides evidence of results of genuine interest, and with enough detail to allow the program committee to assess the merits of the work. Submission of work-in-progress is encouraged, but it must be more substantial than a research proposal. - Non-Proceedings Track. Descriptions of high-quality work submitted or published elsewhere will also be considered, provided the work is recent and relevant to the conference. The work may be of any length, but the program committee members may only look at the first 3 pages of the submission, so you should ensure that these pages contain sufficient evidence of the quality and rigour of your work. Papers in the two tracks will be reviewed against the same standards of quality. Since ACT is an interdisciplinary conference, we use two tracks to accommodate the publishing conventions of different disciplines. For example, those from a Computer Science background may prefer the Proceedings Track, while those from a Mathematics, Physics or other background may prefer the Non-Proceedings Track. However, authors from any background are free to choose the track that they prefer, and submissions may be moved from the Proceedings Track to the Non-Proceedings Track at any time at the request of the authors. Contributions must be submitted in PDF format. Submissions to the Proceedings Track must be prepared with LaTeX, using the EPTCS style files available at . The submission link will soon be available on the ACT2021 web page: ** PROGRAMME COMMITTEE ** Chair: Kohei Kishida, University of Illinois, Urbana-Champaign The full programme committee will be announced soon. ** LOCAL ORGANIZERS ** Lukas Heidemann, University of Oxford Nick Hu, University of Oxford Ioannis Markakis, University of Cambridge Alex Rice, University of Cambridge Calin Tataru, University of Cambridge Jamie Vicary, University of Cambridge ** STEERING COMMITTEE ** John Baez, University of California Riverside and Centre for Quantum Technologies Bob Coecke, Cambridge Quantum Computing David Spivak, Topos Institute From gabriel.scherer at gmail.com Wed Feb 17 00:52:44 2021 From: gabriel.scherer at gmail.com (Gabriel Scherer) Date: Wed, 17 Feb 2021 06:52:44 +0100 Subject: [TYPES/announce] ICFP'21 Artifact Evaluation Committee: call for nominations Message-ID: Dear all, We are looking for motivated people to be members of the ICFP 2021 Artifact Evaluation Committee (AEC); students, researchers and people from the industry or the free-software community are all welcome. The artifact evaluation process aims to improve the quality and reproducibility of research artifacts for ICFP papers. You can either nominate yourself or nominate someone else (students, colleagues, etc; we will of course check later that this person is willing to be a committee member) by filling the nomination form. Nomination form: https://framaforms.org/icfp21-aec-nomination-form-1613482593 More information is available on the AEC webpage: https://icfp21.sigplan.org/track/icfp-2021-artifact-evaluation#advice-for-reviewers The primary responsibility of committee members is to review the artifacts submitted corresponding to the already accepted papers in the main research track. In particular, run the associated tool, check whether the results in the main paper can be reproduced, and inspect the tool and the data. We expect evaluation of one artifact to take about a full day, and each committee member to receive 2 to 3 artifacts to review. All of the AEC work will be done remotely/online. The ICFP AEC committee will start work in late spring of 2021, with the review work happening between May 26th and June 22nd. (The full schedule is on the AEC webpage.) Here are some reasons why we think nominee may like it: 1. Reviewing artifacts helps our community improve the quality of its artifacts, such as research software and mechanized proofs. Participating to this effort feels valuable and useful. 2. Nominees may learn some nice tricks by studying how other researchers implement, evaluate and document their ideas. 3. There is some evidence that members of the artifact-evaluation committee like the job: each year, more than half of them volunteer to be part of the committee again for the next year. (The cons: unpaid work, currently less prestigious than reviewing papers, the evaluation process is less clearly-defined and well-understood than for papers.) Come join us in improving the quality of research in our field! Best, the Artifact Evaluation Chairs: Gabriel Scherer and Brent Yorgey. -------------- next part -------------- An HTML attachment was scrubbed... URL: From vmvasconcelos at fc.ul.pt Wed Feb 17 06:42:42 2021 From: vmvasconcelos at fc.ul.pt (Vasco Thudichum Vasconcelos) Date: Wed, 17 Feb 2021 11:42:42 +0000 Subject: [TYPES/announce] Two postdoc contracts at the University of Lisbon Message-ID: <1469DA64-FB2D-4FFD-8705-7E61C4908E3E@ciencias.ulisboa.pt> Why is this announcement relevant to the types community? The call is open on a series of CS areas, the most relevant for types being 'Reliable Software Systems', a research group interested in type systems (session types in particular), logic, programming languages and software verification. ?? University of Lisbon -- Two Postdoctoral Positions We are looking to fill two postdoc positions at the University of Lisbon in one or more of the following topics. * Reliable Software Systems * Accessibility and Ageing * Cyber?physical Systems * Data and Systems Intelligence * Health and Biomedical Informatics * Resilient Distributed and Networked Systems The positions are associated with LASIGE (https://lasige.ciencias.ulisboa.pt), a research unit at the Faculty of Sciences, University of Lisbon. LASIGE was evaluated as excellent in the last nationwide evaluation process. The successful applicants will work at the LASIGE research unit in collaboration with one or more LASIGE researchers. (Due to current pandemic situation, work during initial portion of the position is likely to happen remotely.) The position will start at a mutually agreeable date, ideally in the Spring 2021. Applicants should hold a PhD degree in Computer Science or related area. The position is funded by the Foundation for Science and Technology for an initial period of 32 months. Compensation, in the range of ?30.000 to ?41.500, will be commensurate with experience. Applications are open until March 31, 2021. Further information can be obtained from lasige at ciencias.ulisboa.pt or from any of the researchers at LASIGE (https://lasige.ciencias.ulisboa.pt/integrated-researchers, https://lasige.ciencias.ulisboa.pt/phd-collaborators). About the University of Lisbon and the LASIGE research lab The University of Lisbon (ULisboa) is the largest university in Portugal and a leading one within wider Europe. Comprising eighteen faculties, ULisboa offers 400 degree programmes at undergraduate and postgraduate level. Each year it accepts more than 5,000 international students ? around 10% of its total cohort ? who represent 100 different countries. ULisboa leads the main international rankings, is amongst the 200 best universities worldwide according to the 2019 Shanghai Ranking. LASIGE is a research unit at ULisboa evaluated as Excellent by the Portuguese Science Agency (FCT) in 2018, with a perfect score of 15 points. LASIGE closely mentors more than 100 young researchers (at masters, doctoral, and post-doctoral level), continually stimulating excellence in research. LASIGE members teach MSc and PhD level courses in Computer Science and Engineering (CSE) at ULisboa, regularly publish in top venues, and enjoy top-notch bibliometric indices. LASIGE runs a large number of international projects, boasts three spin-offs, and multiple technology transfers. The high-level research conducted at LASIGE, the scientific background and international projection of its group leaders, the academic and industrial network to which it belongs, and the experience in advanced training of its members makes LASIGE the perfect research unit to work as a postdoc. If this was not enough, the city of Lisbon offers history and culture, shopping, restaurants, nearby beaches and a vibrant nightlife. From christian.doczkal at inria.fr Wed Feb 17 11:49:17 2021 From: christian.doczkal at inria.fr (Christian Doczkal) Date: Wed, 17 Feb 2021 17:49:17 +0100 Subject: [TYPES/announce] [CFP] The Coq Workshop 2021 : Call for Talk Proposals Message-ID: <0834672c2246ba0e90f325d6a39f7638a1d3f0ec.camel@inria.fr> *********************************************************************** The Coq Workshop 2021: Call for Talk Proposals Colocated with the 12th conference on Interactive Theorem Proving (ITP 2021) online *********************************************************************** Find this call online at: https://coq-workshop.gitlab.io/2021/ We are pleased to invite you to submit talk proposals for the Coq Workshop 2021, which will be held online on July 2nd, 2021. The Coq Workshop is part of ITP 2021, which will also be held online (http://easyconferences.eu/itp2021/) The Coq Workshop 2021 is the 12th iteration of the Coq Workshop series (https://coq-workshop.gitlab.io/). The workshop brings together users, contributors, and developers of the Coq proof assistant (https://coq.inria.fr/). The Coq Workshop focuses on strengthening the Coq community (https://coq.inria.fr/community) and providing a forum for discussing practical issues, including the future of the Coq software and its associated ecosystem of libraries and tools. Thus, rather than serving as a venue for traditional research papers, the workshop is organized around informal presentation and discussions, supplemented with invited talks. Important dates: - May 3rd, 2021 (AoE): Deadline for submission of talk proposals - May 31st, 2021: Notification to authors - July 2nd, 2021: Workshop Submission Instructions: Authors should submit extended abstracts through EasyChair (https://easychair.org/conferences/?conf=coq2021). Relevant subject matter includes but is not limited to: - Theory and implementation of the Calculus of Inductive Constructions - Language or tactic features - Plugins and libraries for Coq - Techniques for formalization programming languages and mathematics - Applications and experience in education and industry - Tools and platforms built on Coq (including interfaces) - Formalization tricks and pearls Submission Format: Talk proposals should be no more than 2 pages in length including bibliographic references using the EasyChair style with the fullpage package. (https://easychair.org/publications/easychair.zip). All submissions must be in PDF format. Program Committee: - Evelyne Contejean (CNRS, LRI) - Christian Doczkal (INRIA) [chair] - Amy Felty (University of Ottawa) - Ga?tan Gilbert (INRIA) - Ralf Jung (MPI-SWS) - Marie Kerjean (CNRS, LIPN) - Jean-Marie Madiot (INRIA) [chair] - Kazuhiko Sakaguchi (University of Tsukuba) - Kathrin Stark (Princeton University) - Pierre-Yves Strub (?cole Polytechnique, LIX) Organisation contact (co-chairs): Christian Doczkal and Jean-Marie Madiot (coq2021 at easychair.org) From viktor at mpi-sws.org Thu Feb 18 04:59:02 2021 From: viktor at mpi-sws.org (Viktor Vafeiadis) Date: Thu, 18 Feb 2021 10:59:02 +0100 Subject: [TYPES/announce] Postdoc positions @ MPI-SWS Message-ID: <15AAA678-AF9D-43FB-826D-A712EB9BB8B4@mpi-sws.org> Applications are invited for postdoc positions at MPI-SWS under the supervision of Viktor Vafeiadis (https://people.mpi-sws.org/~viktor/). The positions are initially for two years with a possibility of an extension for another year, and are funded by the ERC consolidator grant PERSIST on the semantics and verification of non-volatile memory (NVM) programs. Postdoc candidates should have, or expect shortly to obtain, a PhD in computer science, and have expertise in one or more of the following topics: - NVM programming and/or semantics - weak memory models - ISA semantics - separation logic and/or other program logics - software model checking - Coq Interested applicants are encouraged to contact Viktor Vafeiadis and submit a formal application at https://apply.mpi-sws.org/ Application deadline: 7 March 2021 From marta.kwiatkowska at cs.ox.ac.uk Thu Feb 18 10:45:10 2021 From: marta.kwiatkowska at cs.ox.ac.uk (Marta Kwiatkowska) Date: Thu, 18 Feb 2021 15:45:10 +0000 Subject: [TYPES/announce] Researcher position on ERC project FUN2MODEL at Oxford In-Reply-To: <0971b245-48a7-acac-019f-2a465807c865@cs.ox.ac.uk> References: <0971b245-48a7-acac-019f-2a465807c865@cs.ox.ac.uk> Message-ID: <3e63de4f-b7ed-0576-2cf0-2e41d7671e44@cs.ox.ac.uk> [Please forward to anyone interested. Apologies for multiple mailing.] *Senior Research Associate**on FUN2MODEL, fixed term for 3 years, with the possibility of extension** **Grade 8: Salary ?41,526 ? ?49,553 p.a. (note: post may be under-filled at grade 7: ?32,817 - ?40,322 p.a.)* *http://www.cs.ox.ac.uk/news/1890-full.html * We are looking for a motivated Senior Research Associate to play a key role in the ERC funded FUN2MODEL project (www.fun2model.org), which aims to develop novel probabilistic verification and synthesis techniques to enable robust AI. You will be responsible for carrying out research with an emphasis on automated verification and synthesis, applied to machine learning. This may include neuro-symbolic approaches; program synthesis; symbolic methods; probabilistic verification; statistical relational AI; robustness and certification. Suitably qualified candidates will have an opportunity for software implementation, liaising with Dave Parker to coordinate PRISM codebase extensions. The exact scope of the research will depend on the skills and experience of the successful candidate. The closing date for applications is 12 noon on 12th March 2021. Interviews are expected to be held week commencing 29th March 2021. Enquiries to Professor Marta Kwiatkowska (marta.kwiatkowska at cs.ox.ac.uk) are welcome. For further details and to apply please visit: https://my.corehr.com/pls/uoxrecruit/erq_jobspec_version_4.display_form Our staff and students come from all over the world and we proudly promote a friendly and inclusive culture. Diversity is positively encouraged, through diversity groups and champions, for example http://www.cs.ox.ac.uk/aboutus/women-cs-oxford/index.html , as well as a number of family-friendly policies, such as the right to apply for flexible working and support for staff returning from periods of extended absence, for example maternity leave. -- Professor Marta Kwiatkowska FRS Associate Head of MPLS Division Fellow of Trinity College Department of Computer Science University of Oxford Wolfson Building, Parks Road Oxford, OX1 3QD Tel: +44 (0)1865 283509 Email:Marta.Kwiatkowska at cs.ox.ac.uk URL:http://www.cs.ox.ac.uk/people/marta.kwiatkowska/ PA and Project Officer: Anita Hancox Email:anita.hancox at cs.ox.ac.uk, Tel: +44 (0)1865 610754 -------------- next part -------------- An HTML attachment was scrubbed... URL: From nqd.lisa at gmail.com Fri Feb 19 05:02:27 2021 From: nqd.lisa at gmail.com (Lisa Nguyen Quang Do) Date: Fri, 19 Feb 2021 11:02:27 +0100 Subject: [TYPES/announce] Call for papers: 30th ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA'21) Message-ID: =============================================================== The 10th ACM SIGPLAN International Workshop on the State of the Art in Program Analysis (SOAP) Call for Papers June 2021 - Virtual https://pldi21.sigplan.org/home/SOAP-2021 Co-located with PLDI 2021 =============================================================== 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 should be four to six-page papers and should be formatted according to the two-column ACM proceedings format. Each reference must list all authors of the paper. The citations should be in numerical style, e.g., [52]. Templates for ACM format are available for Microsoft Word and LaTeX at [1]. 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 [2]. More Information ================ For additional information, please visit the website [3], follow @SOAP_Workshop on Twitter [4], or contact the chairs Lisa Nguyen Quang Do [5] and Caterina Urban [6]. [1] http://www.sigplan.org/Resources/Author [2] https://easychair.org/conferences/?conf=soap2021 [3] https://pldi21.sigplan.org/home/SOAP-2021#Call-for-Papers [4] https://twitter.com/SOAP_Workshop [5] nqd.lisa at gmail.com [6] caterina.urban at inria.fr -------------- next part -------------- An HTML attachment was scrubbed... URL: From bove at chalmers.se Fri Feb 19 11:44:44 2021 From: bove at chalmers.se (Ana Bove) Date: Fri, 19 Feb 2021 17:44:44 +0100 Subject: [TYPES/announce] 2-years postdoctoral position in HoTT Message-ID: The type theory group at Chalmers and Univ. of Gothenburg would like to announce a new postdoc position in homotopy type theory/univalent foundations. For details see https://web103.reachmee.com/ext/I005/1035/job?site=7&lang=UK&validator=9b89bead79bb7258ad55c8d75228e5b7&job_id=18963 The deadline for application is 2021-03-10. The call is primarily for people already working in homotopy type theory, but we are also open to considering applications from people working in nearby areas who would be interested in getting into the field. The position is for 2-years and includes up to 20% teaching duties. While our department is a joint department between Chalmers and Univ. of Gothenburg, you will get employed at the Univ. of Gothenburg with full employment benefits (health care, pension, etc). For further information please contact Thierry Coquand . -- -- Ana Bove, Docent email: bove(at)chalmers.se Phone: (46) (31) 772 10 20 http://www.cse.chalmers.se/~bove Department of Computer Science and Engineering Chalmers Univ. of Technology and Univ. of Gothenburg From walther.neuper at jku.at Fri Feb 19 12:36:34 2021 From: walther.neuper at jku.at (Walther Neuper) Date: Fri, 19 Feb 2021 18:36:34 +0100 Subject: [TYPES/announce] 2nd CfP ThEdu'21 In-Reply-To: References: Message-ID: ??? ??? 2nd Call for Extended Abstracts & Demonstrations ************************************************************************** ??????????????????????????????? ThEdu'21 ??????????? Theorem Proving Components for Educational Software ????????????????????????????? 11 July 2021 ?????????????? http://www.uc.pt/en/congressos/thedu/ThEdu21 ************************************************************************** ????????????????????????????? at CADE-28 ????????? The 28th International Conference on Automated Deduction ???????? Carnegie Mellon University, Pittsburgh, PA, United States ??????????????????????????? July 11-16, 2021 ???????????????????????? http://www.cade-28.info ************************************************************************** ??????????????????????? ThEdu'21 will be virtual ????????? (CADE28 will be virtual due to the COVID-19 pandemic) ************************************************************************** ThEdu'21 Scope: ? Computer Theorem Proving is becoming a paradigm as well as a ? technological base for a new generation of educational software in ? science, technology, engineering and mathematics. The workshop brings ? together experts in automated deduction with experts in education in ? order to further clarify the shape of the new software generation and ? to discuss existing systems. Invited Talk ? Gilles Dowek, ENS Paris-Saclay Important Dates ?* Extended Abstracts:? 25 April 2021 ?* Author Notification: 23 May 2021 ?* Workshop Day:??????? 11 July 2021 Topics of interest include: ?* methods of automated deduction applied to checking students' input; ?* methods of automated deduction applied to prove post-conditions ?? for particular problem solutions; ?* combinations of deduction and computation enabling systems to ?? propose next steps; ?* automated provers specific for dynamic geometry systems; ?* proof and proving in mathematics education. Submission ? We welcome submission of extended abstracts and demonstration ? proposals presenting original unpublished work which is not been ? submitted for publication elsewhere. ? ? All accepted extended abstracts and demonstrations will be presented ? at the workshop. The extended abstracts will be made available ? online. ? ? Extended abstracts and demonstration proposals should be submitted ? via easychair, https://easychair.org/conferences/?conf=thedu21 ? formatted according to ? http://www.easychair.org/publications/easychair.zip ? ? Extended abstracts and demonstration proposals should be approximately ? 5 pages in length and are to be submitted in PDF format. ? ? At least one author of each accepted extended abstract/demonstration ? proposal is expected to attend ThEdu'21 and presents his/her extended ? abstract/demonstration. Contingency Plans (COVID19) ? The 28th International Conference on Automated Deduction (CADE-28) ? will be virtual due to the COVID-19 pandemic. ? ThEdu'21 will be virtual, the exact details will be in the workshop ? Web-page as soon as possible. Program Committee (tentative) ? Francisco Botana, University of Vigo at Pontevedra, Spain ? David Cerna, Johannes Kepler University, Austria ? Joao Marcos, Universidade Federal do Rio Grande do Norte, Brazil (co-chair) ? Filip Maric, University of Belgrade, Serbia ? Adolfo Neto, Universidade Tecnol?gica Federal do Paran?, Brazil ? Walther Neuper, Graz University of Technology, Austria (co-chair) ? Pedro Quaresma, University of Coimbra, Portugal (co-chair) ? Philippe R. Richard, Universit? de Montr?al, Canada ? Vanda Santos, University of Aveiro, Portugal ? Wolfgang Schreiner, Johannes Kepler University, Austria ? J?rgen Villadsen, Technical University of Denmark, Denmark Proceedings ? The extended abstracts and system descriptions will be available in ? ThEdu'21 Web-page. After presentation at the conference, selected ? authors will be invited to submit a substantially revised version, ? extended to 14--20 pages, for publication by the Electronic ? Proceedings in Theoretical Computer Science (EPTCS). -------------- next part -------------- An HTML attachment was scrubbed... URL: From serge.autexier at dfki.de Sat Feb 20 11:12:10 2021 From: serge.autexier at dfki.de (Serge Autexier) Date: Sat, 20 Feb 2021 17:12:10 +0100 (CET) Subject: [TYPES/announce] 14th Conference on Intelligent Computer Mathematics (CICM 2021), Invited Speakers Update & Second call for papers, Conference Date: July 26-31, 2021 Message-ID: <20210220161210.35DB317C35F6@gigondas.localdomain> 2nd Call for Papers formal papers - informal papers - doctoral programme 14th Conference on Intelligent Computer Mathematics - CICM 2021 - July 26-31, 2020 Timisoara, Romania http://www.cicm-conference.org/2021 ---------------------------------------------------------------------- UPDATE: Invited Speakers * Alessandro Cimatti (Fondazione Bruno Kessler, Trento, IT) * Michael Kohlhase (FAU Erlangen-N?rnberg, Germany) * Laura Kovacs (TU Vienna, Austria) * Angus McIntyre (London/Edinburgh, UK) ---------------------------------------------------------------------- Digital and computational solutions are becoming the prevalent means for the generation, communication, processing, storage and curation of mathematical information. CICM brings together the many separate communities that have developed theoretical and practical solutions for mathematical applications such as computation, deduction, knowledge management, and user interfaces. It offers a venue for discussing problems and solutions in each of these areas and their integration. CICM 2021 Programme committee: see https://www.cicm-conference.org/2021/cicm.php?event=&menu=pc CICM 2021 invites submissions in all topics relating to intelligent computer mathematics, in particular but not limited to * theorem proving and computer algebra * mathematical knowledge management * digital mathematical libraries CICM appreciates the varying nature of the relevant research in this area and invites submissions of different forms: 1) Formal submissions will be reviewed rigorously and accepted papers will be published in a volume of Springer LNCS: * regular papers (up to 15 pages including references) present novel research results * project and survey papers (up to 15 pages + bibliography) summarize existing results * system and dataset descriptions (up to 5 pages including references) present digital artifacts * system entry (1 page according to the given LaTeX template) provides metadata and a quick overview of a new tool or a new release of an existent tool 2) Informal submissions will be reviewed with a positive bias and selected for presentation based on their relevance for the community. * informal papers may present work-in-progress, project announcements, position statements, etc. * posters and system demos will be presented in parallel in special sessions 3) The doctoral programme provides PhD students with a forum to present early results and receive constructive feedback and mentoring. *** Important Dates *** - Abstract deadline: March 15, 2021 - Full paper deadline: March 26, 2021 - Reviews sent to authors: May 4, 2021 - Rebuttals due: May 8, 2021 - Notification of acceptance: May 13, 2021 - Camera-ready copies due: May 29, 2021 - Conference: July 26-31, 2021 Informal submissions and doctoral programme - Submission deadline: May 15, 2021 - Notification of acceptance: June 1, 2021 All submissions should be made via easychair at https://easychair.org/conferences/?conf=cicm2021 As in previous years, we will publish the CICM 2021 proceedings with Springer LNCS. From harley.eades at gmail.com Tue Feb 23 13:45:23 2021 From: harley.eades at gmail.com (Harley D. Eades III) Date: Tue, 23 Feb 2021 13:45:23 -0500 Subject: [TYPES/announce] Seminar talk on skew X categories and structural proof theory Message-ID: Hi, everyone. On Friday, Feb. 26, 2021 between 1pm and 2pm EST (6pm - 7pm UTC), Dr. Tarmo Uustalu will be giving a presentation as part of the CS Colloquium Series at Augusta University. Presentation details can be found here: https://the-au-forml-lab.github.io/colloquium_talks/Uustalu.html Tarmo will be telling us about coherence for several kinds of skew monoidal categories. As many of you know these have a number of interesting applications to type theories/type systems. I, for one, am super excited about this talk! These talks are open to the general public via Zoom and Youtube. I'll be live streaming it on Youtube. If you are interested in attending the Zoom meeting please RSVP with me before the talk. Questions will be taken from those on Zoom and YouTube. If you care to watch via YouTube, please use the following link: https://youtu.be/HAyDVjybAFw Feel free to share this message with everyone you know. I hope all of you, your family and friends are doing well! Very best, Harley -------------- next part -------------- An HTML attachment was scrubbed... URL: From kedar.namjoshi at nokia-bell-labs.com Wed Feb 24 08:18:40 2021 From: kedar.namjoshi at nokia-bell-labs.com (Namjoshi, Kedar (Nokia - US/Murray Hill)) Date: Wed, 24 Feb 2021 13:18:40 +0000 Subject: [TYPES/announce] SAS 2021 Call for Papers In-Reply-To: References: Message-ID: [Apologies for multiple copies] SAS 2021 CALL FOR PAPERS https://conf.researchr.org/home/sas-2021 The 28th Static Analysis Symposium, SAS 2021, will be held in Chicago (US) from October 17-22, 2021 in conjunction with SPLASH 2021.? Static analysis is widely recognized as a fundamental tool for program verification, bug detection, compiler optimization, program understanding, and software maintenance. The series of Static Analysis Symposia has served as the primary venue for the presentation of theoretical, practical, and application advances in the area. IMPORTANT DATES All deadlines are AoE (Anywhere on Earth). * Paper submission: ?????????????????? ?April 25, 2021 ? ?? * Artifact submission:???????????????? April 29, 2021 * Author response period: ???????? June 11-17 * Author notification:??????????????????July 4 * Final version due: ???????????????????? August 4 (approximate) * Conference:??????????????????????????????? Oct 17-22, 2021 ? PAPER SUBMISSION All paper submissions will be judged on the basis of significance, relevance, correctness, originality, and clarity. Submission link: https://easychair.org/conferences/?conf=sas2021?? Regular papers (18 pages max., lightweight double-blind)? Short papers (10 pages max.) may focus on any of the following: * Experience with static analysis tools, Industrial Reports, and Case Studies (non-blind)? * Tool papers (lightweight double-blind) * Brief announcements of work in progress (lightweight double-blind) * Well-motivated discussion of new questions or new areas (lightweight double-blind) Radhia Cousot Award The program committee will select an accepted regular paper for the Radhia Cousot Young Researcher Best Paper Award in memory of Radhia Cousot and her fundamental contributions to static analysis, as well as being one of the main promoters and organizers of the SAS series of conferences. ARTIFACTS As in previous years, we encourage authors to submit a virtual machine image containing any artifacts and evaluations presented in the paper. Artifact submission is optional. Artifact evaluation will be concurrent with paper review.?? The full CFP at ?https://conf.researchr.org/home/sas-2021 has additional details. From siddharth.krishna at nyu.edu Wed Feb 24 13:05:55 2021 From: siddharth.krishna at nyu.edu (Siddharth Krishna) Date: Wed, 24 Feb 2021 18:05:55 +0000 Subject: [TYPES/announce] VerifyThis 2021: Call for Participation + Grants + Prizes In-Reply-To: References: Message-ID: ******************************************************************************** VerifyThis Verification Competition 2021 CALL FOR PARTICIPATION -- GRANTS -- PRIZES Competition to be held at ETAPS 2021 (Virtual) http://verifythis.ethz.ch ******************************************************************************** IMPORTANT DATES Registration deadline: March 13, 2021 Competition: March 26 and 27, 2021 ABOUT THE COMPETITION VerifyThis 2021 is a program verification competition taking place as part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2021) on 26 and 27 March 2021. It is the 9th event in the VerifyThis competition series. Information on previous events and participants can be found at: http://verifythis.ethz.ch The aims of the competition are: - to bring together those interested in formal verification, and to provide an engaging, hands-on, and fun opportunity for discussion, and - to evaluate the usability of logic-based program verification tools in a controlled experiment that could be easily repeated by others. The competition will offer a number of challenges presented in natural language and pseudo code. Participants have to formalize the requirements, implement a solution, and formally verify the implementation for adherence to the specification. There are no restrictions on the programming language and verification technology used. The correctness properties posed in problems will have the input-output behaviour of programs in focus. Solutions will be judged for correctness, completeness and elegance. PARTICIPATION Participation is open for anybody interested. Teams of up to two people are allowed. VerifyThis will be a virtual event with some synchronous sessions via video call, and a 24 hour window for teams to solve problems at their own convenience. More details and a full program will be announced on the website. We particularly encourage participation of: - people from under-represented communities - student teams (this includes PhD students) - non-developer teams using a tool someone else developed - several teams using the same tool GRANTS The competition has funds for a limited number of registration grants, sponsored by Amazon AWS. Grants will cover the registration costs for ETAPS. To apply for a grant, fill out the relevant section of the registration form and, if you are a student, have your supervisor send a brief letter of support to the following address: verifythis at googlegroups.com PRIZES Thanks to our sponsors, VerifyThis typically offer team prizes such as the best overall team, the most distinguished tool features and the best student team. As VerifyThis 2021 will be a virtual event, we plan to increase the number of team prizes and the prize money amount this year. VerifyThis 2021 prizes are sponsored by Amazon AWS. REGISTRATION Please register by filling out the following form: https://forms.gle/kZpGKMVkRrRyidiq8 Deadline: March 13, 2021 ORGANIZERS * Siddharth Krishna, Microsoft Research Cambridge, UK * Wytse Oortwijn, ESI (TNO), Netherlands STEERING COMMITTEE * Marieke Huisman, University of Twente, the Netherlands * Rosemary Monahan, Maynooth University, Ireland * Peter M?ller, ETH Zurich, Switzerland * Mattias Ulbrich, Karlsruhe Institute of Technology, Germany CONTACT Email: verifythis at googlegroups.com Web: http://verifythis.ethz.ch -------------- next part -------------- An HTML attachment was scrubbed... URL: From andrei.paskevich at lri.fr Wed Feb 24 15:28:39 2021 From: andrei.paskevich at lri.fr (Andrei Paskevich) Date: Wed, 24 Feb 2021 21:28:39 +0100 Subject: [TYPES/announce] F-IDE 2021 - Last Call for Papers - Extended Deadline Message-ID: An embedded and charset-unspecified text was scrubbed... Name: not available URL: From mauro.jacopo at gmail.com Thu Feb 25 05:14:50 2021 From: mauro.jacopo at gmail.com (Jacopo Mauro) Date: Thu, 25 Feb 2021 11:14:50 +0100 Subject: [TYPES/announce] Assistant and Associate Professorship Positions in Computer Science at the University of Southern Denmark Message-ID: The Department of Mathematics and Computer Science (IMADA) at the University of Southern Denmark (SDU), Odense, invites applications for assistant and associate professor positions in Computer Science. We are flexible with respect to the starting date, but expect this to be in 2021 or early 2022. Application deadline: 7 April 2021. We are interested in applicants from all fields in Computer Science who can either strengthen or complement the current Computer Science research conducted at IMADA. Fluency in English is required. Knowledge of Danish is not a prerequisite for application. Link for application, including the call with full details: https://www.sdu.dk/da/service/ledige_stillinger/1140998?sc_lang=en The application must include the following: ? An application letter stating for which position the candidate wishes to be evaluated ? A curriculum vitae ? A list of publications ? A copy of the PhD certificate ? A teaching portfolio ? A research plan ? A list of references (i.e., two or three references including their contact information). For more information, please contact Jacopo Mauro (mauro at imada.sdu.dk) -- Jacopo Mauro, Associate Professor Department of Mathematics and Computer Science (IMADA) University of Southern Denmark (SDU) -------------- next part -------------- An HTML attachment was scrubbed... URL: From unruh at ut.ee Thu Feb 25 07:41:42 2021 From: unruh at ut.ee (Dominique Unruh) Date: Thu, 25 Feb 2021 14:41:42 +0200 Subject: [TYPES/announce] Postdoc/phd positions in ERC project "Certified Quantum Security" (formal verification of quantum crypto) Message-ID: <458745f2-33bf-a7db-cdfd-0772795d546e@ut.ee> Dear all, I would like to announce open postdoc and (fully-funded) phd positions. We are searching for candidates who are enthusiastic about driving forward the field of formal verification of quantum cryptography, either from the theory side, tool side, or the quantum languages side. For more information, see here: https://crypto.cs.ut.ee/Main/PostdocInVerificationOfQuantumCryptography (postdoc) and https://crypto.cs.ut.ee/Main/PhdPositions (phd). Please forward this to anyone potentially interested, and do not hesitate to contact me. Best wishes, Dominique. From riccardo.treglia at unito.it Thu Feb 25 10:25:39 2021 From: riccardo.treglia at unito.it (Riccardo Treglia) Date: Thu, 25 Feb 2021 16:25:39 +0100 Subject: [TYPES/announce] ITRS 21 CfP Message-ID: ITRS 2021 Call for papersTenth Workshop on Intersection Types and Related Systems - ITRS 2021 17 July 2021, Online Affiliated with FSCD , 17-24 July 2021, Buenos Aires Web page: http://www.di.unito.it/~deligu/ITRS2021/ Aims and Scope Intersection types were introduced near the end of the 1970s to overcome the limitations of Curry's type assignment system and to provide a characterization of the strongly normalizing terms of the Lambda Calculus. The key idea is to introduce an intersection type constructor ? such that a term of type t ? s can be used at both type t and s within the same context. This provides a finite polymorphism where various, even unrelated, types of the term are listed explicitly, differently from the more widely used universally quantified types where the polymorphic type is the common schema that stands for its various type instances. As a consequence, more terms (all and only the normalizing terms) can be typed than with universal polymorphism. Although intersection types were initially intended for use in analyzing and/or synthesizing lambda models as well as in analyzing normalization properties, over the last twenty years the scope of the research on intersection types and related systems has broadened in many directions. Restricted (and more manageable) forms have been investigated, such as refinement types. Type systems based on intersection type theory have been extensively studied for practical purposes, such as program analysis and higher-order model checking. The dual notion of union types turned out to be quite useful for programming languages. Finally, the behavioural approach to types, which can give a static specification of computational properties, has become central in the most recent research on type theory. The ITRS 2021 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches. Possible topics for submitted papers include, but are not limited to: - Formal properties of systems with intersection types. - Results for related systems, such as union types, refinement types, or singleton types. - Applications to lambda calculus, pi-calculus and similar systems. - Applications for programming languages, program analysis, and program verification. - Applications for other areas, such as database query languages and program extraction from proofs. - Related approaches using behavioural/intensional types and/or denotational semantics to characterize computational properties. - Quantitative refinements of intersection types. ITRS workshops have been held every two years (with the exception of 2020, because of COVID-19 outbreak). Information about the previous events is available on the ITRS home page . Invited Speaker - Jeremy Siek (Indiana University Bloomington) Paper Submissions Papers must be original and not previously published, nor submitted elsewhere. Papers should be prepared in LaTeX using the EPTCS macro package and should be in the range of 3-16 pages, plus at most 2 pages of references. Submissions will be collected via EasyChair and reviewed by anonymous referees. Important Dates - Paper submission: 12 April 2021 - Author notification: 24 May 2021 - Final version: 18 June 2021 - Workshop: 17 July 2021 Program Committee - Antonio Bucciarelli, Universit? de Paris, France - Daniel De Carvalho, Innopolis University, Russia - Andrej Dudenhefner, Saarland University, Germany - Silvia Ghilezan, University of Novi Sad, Serbia - Giulio Guerrieri, University of Bath, UK - Ugo de' Liguoro, Universit? di Torino, Italy (chair) - Jeremy Siek, Indiana University Bloomington, USA (co-chair) Organizers: Ugo de' Liguoro, Universit? di Torino, Italy Riccardo Treglia, Universit? di Torino, Italy (riccardo.treglia at unito.it) Steering Committee - Mariangiola Dezani-Ciancaglini, Universit? di Torino, Italy - Jakob Rehof, TU University of Dortmund, Germany - Joe Wells, Heriot-Watt University, Scotland -------------- next part -------------- An HTML attachment was scrubbed... URL: From publicityifl at gmail.com Fri Feb 26 04:02:38 2021 From: publicityifl at gmail.com (Publicity IFL) Date: Fri, 26 Feb 2021 10:02:38 +0100 Subject: [TYPES/announce] Call for Papers Haskell Symposium 2021 Message-ID: Dear all, This is the call for papers for the upcoming Haskell Symposium. Please forward to anyone that you believe might be interested. Apologies for receiving multiple copies of this announcement. Best regards, Jurriaan Hage Chair ================================================================================ ACM SIGPLAN CALL FOR SUBMISSIONS Haskell Symposium 2021 ** virtual ** Thu 26 -- Fri 27 August, 2021 http://www.haskell.org/haskell-symposium/2021/ ================================================================================ The ACM SIGPLAN Haskell Symposium 2021 will be co-located with the 2021 International Conference on Functional Programming (ICFP). Due to COVID-19 it will take place **virtually** this year. Like last year, we will be using a lightweight double-blind reviewing process. See further information below. Different from last year is that we offer a new submission category: the tutorial. Details can be found below. The Haskell Symposium presents original research on Haskell, discusses practical experience and future development of the language, and promotes other forms of declarative programming. Topics of interest include: * Language design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, such as formal semantics of the present language or future extensions, type systems, effects, metatheory, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management, as well as foreign function and component interfaces; * Libraries, that demonstrate new ideas or techniques for functional programming in Haskell; * Tools, such as profilers, tracers, debuggers, preprocessors, and testing tools; * Applications, to scientific and symbolic computing, databases, multimedia, telecommunication, the web, and so forth; * Functional Pearls, being elegant and instructive programming examples; * Experience Reports, to document general practice and experience in education, industry, or other contexts; * Tutorials, to document how to use a particular language feature, programming technique, tool or library within the Haskell ecosystem; * System Demonstrations, based on running software rather than novel research results. Regular papers should explain their research contributions in both general and technical terms, identifying what has been accomplished, explaining why it is significant, and relating it to previous work, and to other languages where appropriate. Experience reports and functional pearls need not necessarily report original academic research results. For example, they may instead report reusable programming idioms, elegant ways to approach a problem, or practical experience that will be useful to other users, implementers, or researchers. The key criterion for such a paper is that it makes a contribution from which other Haskellers can benefit. It is not enough simply to describe a standard solution to a standard programming problem, or report on experience where you used Haskell in the standard way and achieved the result you were expecting. A new submission category for this year's Haskell Symposium is the tutorial. Like with the experience report and the functional pearl, the key criterion for such a paper is that it makes a contribution from which other Haskellers can benefit. What distinguishes a tutorial is that its focus is on explaining an aspect of the Haskell language and/or ecosystem in a way that is generally useful to a Haskell audience. Tutorials for many such topics can be found online; the distinction here is that by writing it up for formal review it will be vetted by experts and formally published. System demonstrations should summarize the system capabilities that would be demonstrated. The proposals will be judged on whether the ensuing session is likely to be important and interesting to the Haskell community at large, whether on grounds academic or industrial, theoretical or practical, technical, social or artistic. Please contact the program chair with any questions about the relevance of a proposal. If your contribution is not a research paper, please mark the title of your experience report, functional pearl, tutorial or system demonstration as such, by supplying a subtitle (Experience Report, Functional Pearl, Tutorial Paper, System Demonstration). Submission Details ================== Early and Regular Track ----------------------- The Haskell Symposium uses a two-track submission process so that some papers can gain early feedback. Strong papers submitted to the early track are accepted outright, and the others will be given their reviews and invited to resubmit to the regular track. Papers accepted via the early and regular tracks are considered of equal value and will not be distinguished in the proceedings. Although all papers may be submitted to the early track, authors of functional pearls and experience reports are particularly encouraged to use this mechanism. The success of these papers depends heavily on the way they are presented, and submitting early will give the program committee a chance to provide feedback and help draw out the key ideas. Formatting ---------- Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines. Authors should use the `acmart` format, with the `sigplan` sub-format for ACM proceedings. For details, see: http://www.sigplan.org/Resources/Author/#acmart-format It is recommended to use the `review` option when submitting a paper; this option enables line numbers for easy reference in reviews. Functional pearls, experience reports, tutorials and demo proposals should be labelled clearly as such. Lightweight Double-blind Reviewing ---------------------------------- Haskell Symposium 2021 will use a lightweight double-blind reviewing process. To facilitate this, submitted papers 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 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 the paper more difficult (e.g., important background references should not be omitted or anonymized). In addition, 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. A reviewer will learn the identity of the author(s) of a paper after a review is submitted. Page Limits ----------- The length of submissions should not exceed the following limits: Regular paper: 12 pages Functional pearl: 12 pages Tutorial: 12 pages Experience report: 6 pages Demo proposal: 2 pages There is no requirement that all pages are used. For example, a functional pearl may be much shorter than 12 pages. In all cases, the list of references is not counted against these page limits. Deadlines --------- Early track: Submission deadline: 19 March 2021 (Fri) Notification: 23 April 2021 (Fri) Regular track and demos: Submission deadline: 21 May 2021 (Fri) Notification: 23 June 2021 (Wed) Deadlines are valid anywhere on Earth. Submission ---------- Submissions must adhere to SIGPLAN's republication policy (http://sigplan.org/Resources/Policies/Republication/), and authors should be aware of ACM's policies on plagiarism (https://www.acm.org/publications/policies/plagiarism). Program Committee members are allowed to submit papers, but their papers will be held to a higher standard. The paper submission deadline and length limitations are firm. There will be no extensions, and papers violating the length limitations will be summarily rejected. Papers should be submitted through HotCRP at: https://haskell21.hotcrp.com/ Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. Supplementary material: Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. This supplementary material should not be submitted as part of the main document; instead, it should be uploaded as a separate PDF document or tarball. Supplementary material should be uploaded at submission time, not by providing a URL in the paper that points to an external repository. Authors can distinguish between anonymized and non-anonymized supplementary material. Anonymized supplementary material will be visible to reviewers immediately; non-anonymized supplementary material will be revealed to reviewers only after they have submitted their review of the paper and learned the identity of the author(s). Resubmitted Papers: authors who submit a revised version of a paper that has previously been rejected by another conference have the option to attach an annotated copy of the reviews of their previous submission(s), explaining how they have addressed these previous reviews in the present submission. If a reviewer identifies him/herself as a reviewer of this previous submission and wishes to see how his/her comments have been addressed, the conference chair will communicate to this reviewer the annotated copy of his/her previous review. Otherwise, no reviewer will read the annotated copies of the previous reviews. Proceedings =========== Accepted papers will be included in the ACM Digital Library. Their authors will be required to choose one of the following options: - Author retains copyright of the work and grants ACM a non-exclusive permission-to-publish license (and, optionally, licenses the work with a Creative Commons license); - Author retains copyright of the work and grants ACM an exclusive permission-to-publish license; - Author transfers copyright of the work to ACM. For more information, please see ACM Copyright Policy (http://www.acm.org/publications/policies/copyright-policy) and ACM Author Rights (http://authors.acm.org/main.html). Accepted proposals for system demonstrations will be posted on the symposium website but not formally published in the proceedings. Publication date: The official publication date of accepted papers is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work. Artifacts ========= Authors of accepted papers are encouraged to make auxiliary material (artifacts like source code, test data, etc.) available with their paper. They can opt to have these artifacts published alongside their paper in the ACM Digital Library (copyright of artifacts remains with the authors). If an accepted paper's artifacts are made permanently available for retrieval in a publicly accessible archival repository like the ACM Digital Library, that paper qualifies for an Artifacts Available badge (https://www.acm.org/publications/policies/artifact-review-badging#available ). Applications for such a badge can be made after paper acceptance and will be reviewed by the PC chair. Program Committee ================= Edwin Brady University of St Andrews Koen Claessen Chalmers University of Technology Dominique Devriese Vrije Universiteit Brussel Andy Gill University of Kansas Jurriaan Hage (chair) Universiteit Utrecht Zhenjiang Hu Peking University Ranjit Jhala University of California Patricia Johann Appalachian State University Yukiyoshi Kameyama University of Tsukuba George Karachalias Tweag Ralf Laemmel University of Koblenz-Landau Daan Leijen Microsoft Research Ben Lippmeier Ghost Locomotion Neil Mitchell Facebook Alberto Pardo Universidad de la Republica, Uruguay Matt Roberts Macquarie University Janis Voigtlaender University of Duisburg-Essen Nicolas Wu Imperial College London If you have questions, please contact the chair at: j.hage at uu.nl -------------- next part -------------- An HTML attachment was scrubbed... URL: From emilio.tuosto at gssi.it Fri Feb 26 06:51:00 2021 From: emilio.tuosto at gssi.it (Emilio Tuosto) Date: Fri, 26 Feb 2021 12:51:00 +0100 Subject: [TYPES/announce] Post-doc position (2 years) on monitoring and verification of smart systems (deadline 18/3/21) Message-ID: A post-doctoral position funded by the IT MATTERS project (http://itmatters.imtlucca.it/) on methods and tools for trustworthy smart systems is available at the Gran Sasso Science Institute (https://cs.gssi.it). Duration: 2 years Annual gross salary: ? 36.000,00 Details at: https://www.gssi.it/communication/announcements/item/12047-postdoctoral-research-fellowship-2021 Short description of the position The successful candidate will develop runtime-monitoring and software model-checking techniques for ?smart systems?, that is, autonomous systems taking context-dependent decisions. The research activities will involve developing frameworks that can deal with the distributed nature of smart systems and will build on existing work on specification-based monitoring and software model-checking of cyber-physical systems. The postdoctoral researcher will also devise techniques to use information derived from the runtime analysis to guide the software-model-checking effort and to refine the models of the runtime environment used in model checking. Contacts Luca Aceto (luca.aceto at gssi.it) Omar Inverso (omar.inverso at gssi.it) Emilio Tuosto (emilio.tuosto at gssi.it) -- *************************************************************** Emilio Tuosto Computer Science Gran Sasso Science Institute Viale F. Crispi, 7 67100 L'Aquila (Italy) Office: Palazzo Mariani P1-N Phone: +39 0862 428 0312 L'Aquila Italy homepage -> https://cs.gssi.it/emilio.tuosto/ *************************************************************** From philip.wadler at gmail.com Fri Feb 26 08:06:58 2021 From: philip.wadler at gmail.com (Philip Wadler) Date: Fri, 26 Feb 2021 13:06:58 +0000 Subject: [TYPES/announce] The Plutus team is hiring Message-ID: IOG, formerly known as IOHK, is hiring two new members for the Plutus team, currently led by Manuel Chakravarty and Michael Peyton-Jones. One of the posts is for a new leader, but don't worry, Manuel and Michael are both staying; the other post is someone to work on developer relations and communications. People working with the Plutus team include myself, Simon Thompson, and John Hughes. Plutus is a library for Haskell that provides smart contracts for Cardano. Ada, the coin of Cardano, is (as of last week) the fourth-largest cryptocurrency by market capitalisation, at USD$32 billion. Details below. Let me know if you have any questions. Go well, -- P Software Engineering Lead - Plutus We are searching for a Software Engineer to lead our Plutus team. The Plutus team is building the core of Cardano?s smart contract functionality on the bedrock of functional programming languages. We are an interdisciplinary team who do original R&D and turn it into production systems. In the past few years, the Plutus team has: - Published five peer-reviewed papers with top academic researchers - Designed and implemented three programming languages - Formalized the semantics of two of those languages using Agda - Helped to improve the ability of Agda to generate usable Haskell output - Created novel compilation techniques for data types - Written a GHC proposal, which is now being taken into implementation work - Implemented a compiler for a subset of Haskell as a GHC plug-in - Used statistical modeling to infer evaluation cost models - Participated in the design and implementation of the Cardano ledger extensions to support smart contracts. Such a heady and complex mixture of research, development, and design work needs a competent leader to keep it all working well. If that sounds like fun to you, drop us a line! https://apply.workable.com/io-global/j/DC4A9703F1/ Developer Relations Specialist - Plutus The Cardano ecosystem is expanding and software developer interest is increasing rapidly, so we are looking for a Developer Relations Specialist for the Plutus smart contract programming platform. You will help build, nurture and manage new relationships within established blockchain and smart contract development communities, especially Ethereum. This role will put you at the forefront of an exciting developer ecosystem at a crucial time in its development, winning and onboarding partners, feeding any requirements and proposals back into the business, and helping rapidly expand a healthy, productive Cardano developer base. To enjoy this role you will be someone who is passionate about blockchain technologies and the real problems they can address. You will have a proactive, problem-solving attitude, and enjoy working with customers and representing IOG at conferences, meetups, podcasts, etc. https://apply.workable.com/io-global/j/965433F163/ .\ Philip Wadler, Professor of Theoretical Computer Science ./\ School of Informatics, University of Edinburgh / \ http://homepages.inf.ed.ac.uk/wadler/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From eacsl.ls1 at cs.tu-dortmund.de Fri Feb 26 10:16:01 2021 From: eacsl.ls1 at cs.tu-dortmund.de (EACSL Mail-Account) Date: Fri, 26 Feb 2021 16:16:01 +0100 Subject: [TYPES/announce] ACKERMANN AWARD 2021: CALL FOR NOMINATIONS Message-ID: ACKERMANN AWARD 2021 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE CALL FOR NOMINATIONS Nominations are now invited for the 2021 Ackermann Award. PhD dissertations in topics specified by the CSL and LICS conferences, which were formally accepted as PhD theses at a university or equivalent institution between 1 January 2019 and 31 December 2020 are eligible for nomination for the award. The deadline for submission is 1 July 2021. Submission details follow below. Nominations can be submitted from 1 March 2021 and should be sent to the chair of the Jury, Thomas Schwentick, by e-mail: thomas.schwentick at tu-dortmund.de *** 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 the thesis in the FoLLI subseries of Springer LNCS, and * financial support to attend the conference. The jury is entitled to give the award to more (or less) than one dissertation in a year. *** The Jury The jury consists of: * 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. *** How to submit The candidate or his/her supervisor should submit 1. the thesis (ps or pdf file); 2. a detailed description (not longer than 20 pages) of the thesis in ENGLISH (ps or pdf file); 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; 3. a supporting letter by the PhD advisor and two supporting letters by other senior researchers (in English); supporting letters can also be sent directly to Thomas Schwentick (thomas.schwentick at tu-dortmund.de); 4. a short CV of the candidate; 5. a copy of the document asserting that the thesis was accepted as a PhD thesis at a recognized University (or equivalent institution) and that the candidate has received his/her PhD within the specified period. The submission should be sent by e-mail as attachments to the chairman of the jury, Thomas Schwentick: thomas.schwentick at tu-dortmund.de With the following subject line and text: * Subject: Ackermann Award 20 Submission * Text: Name of candidate, list of attachments Submission can be sent via several e-mail messages. If this is the case, please indicate it in the text. From matt.amy at dal.ca Fri Feb 26 13:35:42 2021 From: matt.amy at dal.ca (Matt Amy) Date: Fri, 26 Feb 2021 14:35:42 -0400 Subject: [TYPES/announce] PLanQC 2021 -- Call for Submissions Message-ID: <240fe783-1f9f-04ba-3dac-ee67555ec947@dal.ca> --------------------------------------------------------------------------------------------------------------------------------------------------------- ** *PLanQC 2021: Programming Languages for Quantum Computing* * Call for Submissions We invite members of the programming languages (PL) and quantum computing (QC) communities to submit talk proposals for the Second International Workshop on Programming Languages for Quantum Computing (PLanQC 2021), co-located with PLDI virtually this June. PLanQC aims to bring together researchers from the fields of programming languages and quantum information, exposing the programming languages community to the unique challenges of programming quantum computers. It will promote the development of tools to assist in the process of programming quantum computers, as they exist today and as they are likely to exist in the near to distant future. Submissions to PLanQC should take the form of 2-5 page abstracts (single-column, 11pt acmsmall style, not including references), with links to larger preprints when appropriate. Work in progress is welcome. We hope to make PLanQC maximally accessible to the programming languages community. Thus, abstracts should cover cutting edge ideas and results, but not be opaque to new, potential entrants to QC coming from PL. Abstracts will be reviewed for quality and relevance to the workshop, and accepted authors will be invited to give talks or poster presentations. We will not be publishing formal proceedings, but the extended abstracts, along with links (where available) to full papers will be posted to the workshop?s website. Invited speakers: ????????? ? ? ? Michael Hicks, University of Maryland ????????? ? ? ? John van de Wetering, Radboud University Workshop topics include (but are not limited to): ????????? ? ? ? High-level quantum programming languages ????????? ? ? ? Verification tools for quantum programs ????????? ? ? ? Novel quantum programming abstractions ????????? ? ? ? Quantum circuit and program optimizations ????????? ? ? ? Hardware-aware circuit compilation and routing ????????? ? ? ? Error handling, mitigation, and correction ????????? ? ? ? Instruction sets for quantum hardware ????????? ? ? ? Other techniques from traditional programming languages (e.g., types, compilation/optimization, foreign function interfaces) applied to the domain of quantum computation. Important dates (anywhere on earth): ------------------------------------------------------------------------- Abstract submission deadlineFri 2 Apr 2021 NotificationWed 5 May 2021 WorkshopJun 21 OR 22 2021 ------------------------------------------------------------------------- Website:https://pldi21.sigplan.org/home/planqc-2021 Submission:https://planqc2021.hotcrp.com/ Program Committee: Matt Amy (chair)Dalhousie University Ross DuncanCambridge Quantum Computing Chris GranadeMicrosoft Research Yipeng HuangRutgers University Ali Javadi-AbhariIBM Giulia MeuliEPFL Jennifer PaykinGalois Inc Robert RandUniversity of Chicago Mathys RenellaLeiden University Peter SelingerDalhousie University Dominique UnruhUniversity of Tartu Xiaodi WuUniversity of Maryland Nengkun YuUniversity of Technology Sydney Vladimir ZamdzhievINRIA Will ZengGoldman Sachs Margherita ZorziUniversity of Verona Organizing Committee: Matt AmyDalhousie University Ross DuncanCambridge Quantum Computing Robert RandUniversity of Chicago * -------------- next part -------------- An HTML attachment was scrubbed... URL: From dom.orchard at gmail.com Sat Feb 27 11:15:57 2021 From: dom.orchard at gmail.com (Dominic Orchard) Date: Sat, 27 Feb 2021 16:15:57 +0000 Subject: [TYPES/announce] Lecturer (Assistant Professor) Position in Programming Languages at the University of Kent Message-ID: We are seeking to appoint yet another new lecturer in Computing in our Programming Languages and Systems research group based at our Canterbury campus, University of Kent. Job description / Additional Information / Please apply at https://jobs.kent.ac.uk/vacancy.aspx?ref=CEMS-034-21 Closing date for applications: 14 March 2021 (Lecturer = Teaching+Research contract, equivalent of Assistant Professor) The Programming Languages and Systems (PLAS) research group spans the breadth and depth of practical and theoretical aspects of programming languages and system building related to languages. Our work goes across paradigms (imperative, object-oriented, functional, logic) and is complemented by our systems research in concurrency, relaxed memory, verified compilation, verification, language prototypes, garbage collection, and tools. All our work is linked by a shared vision of the power and impact of programming languages on the rest of Computer Science. The PLAS group at Kent has a long history of contributions to the field and continues to be a hotbed of programming language research in the South East of England: https://www.cs.kent.ac.uk/research/groups/plas/index.html The School of Computing [1] is a welcoming, supportive, and diverse environment whose commitment to gender equality has been recognised with a Bronze Athena SWAN [2] award. We are keen to enhance the balanced, inclusive and diverse nature of the community within our School and would particularly encourage female candidates to apply for these posts. We are committed to delivering high quality research and education. The School?s four broad research areas are Programming Languages and Systems; Computer Security; Computational Intelligence; and Data Science. Full details can be found at: https://www.cs.kent.ac.uk/research. The University of Kent has campuses in Canterbury and Medway, and specialist postgraduate centres in Athens, Brussels, Paris and Rome. Overlooking the city centre, and with 125 nationalities represented, the Canterbury campus has a very cosmopolitan feel. Canterbury is a small city that retains parts of its medieval walls (with Roman foundations). Famous for its heritage (Canterbury Cathedral; Chaucer?s Tales; etc), Canterbury is a vibrant community and UNESCO World Heritage site whose culture and leisure facilities are enhanced by hosting three universities. The city and surrounding region combines an attractive and affordable environment, excellent schools, many beaches nearby, and fast transport links to London and mainland Europe. Links: [1] https://cs.kent.ac.uk/ [2] http://www.ecu.ac.uk/equality-charters/athena-swan/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From alexander.nadel at intel.com Sun Feb 28 01:58:26 2021 From: alexander.nadel at intel.com (Nadel, Alexander) Date: Sun, 28 Feb 2021 06:58:26 +0000 Subject: [TYPES/announce] SMT 2021 Workshop: Second Call for Papers In-Reply-To: References: Message-ID: *** SMT 2021: 19th International Workshop on Satisfiability Modulo Theories *** Los Angeles, CA, United States, July 18-19, 2021 Conference website: http://smt-workshop.cs.uiowa.edu/2021/ Submission link: https://easychair.org/conferences/?conf=smt2021 Submission deadline: April 30, 2021 *** Overview *** SMT 2021 will be co-located with CAV 2021 in Los Angeles. The aim of the workshop is to bring together researchers and users of SMT tools and techniques. Relevant topics include but are not limited to: ? Decision procedures and theories of interest ? Combinations of decision procedures ? Novel implementation techniques ? Benchmarks and evaluation methodologies ? Applications and case studies ? Theoretical results Papers on pragmatic aspects of implementing and using SMT tools, as well as novel applications of SMT, are especially encouraged. *** Important Dates *** ? Paper submission: April 30, 2021 ? Notification: May 28, 2021 ? Workshop: July 18-19, 2021 *** Submission Guidelines *** We invite researchers to submit extended abstracts, original papers, and presentation only-papers. We intend to publish open-access proceedings for SMT 2021 as a volume of the EPiC Series EasyChair Proceedings. Extended abstracts and original papers must not have been published or submitted elsewhere and will be included in the proceedings. ? Extended abstracts: given the informal style of the workshop, we strongly encourage the submission of preliminary reports of work in progress. They may range in length from very short (a couple of pages) to the full 10 pages and they will be judged based on the expected level of interest for the SMT community. ? Original papers: contain original research and sufficient detail to assess the merits and relevance of the submission. For papers reporting experimental results, authors are strongly encouraged to make their data available. ? Presentation-only papers: describe work recently published or submitted and will not be included in the proceedings. We see this as a way to provide additional access to important developments that SMT Workshop attendees may be unaware of. Papers in all three categories will be peer-reviewed. Papers should not exceed 10 pages and should be in standard-conforming PDF. Technical details may be included in an appendix to be read at the reviewers' discretion. Final versions should be prepared in LaTeX using the easychair.cls class file. (The 10 page limit does not include references.) To submit, please go to the EasyChair page https://easychair.org/conferences/?conf=smt2021 and follow the instructions there. *** Organizers and Program Committee *** See http://smt-workshop.cs.uiowa.edu/2021/committees.shtml. Invited Speakers ? Karem Sakallah, University of Michigan ? Guy Katz, University of Jerusalem --------------------------------------------------------------------- Intel Israel (74) Limited This e-mail and any attachments may contain confidential material for the sole use of the intended recipient(s). Any review or distribution by others is strictly prohibited. If you are not the intended recipient, please contact the sender and delete all copies. From Simon.Gay at glasgow.ac.uk Mon Mar 1 05:51:32 2021 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Mon, 1 Mar 2021 10:51:32 +0000 Subject: [TYPES/announce] Post-doc position in Programming Language Foundations at University of Glasgow Message-ID: University of Glasgow College of Science and Engineering School of Computing Science Research Associate Ref: 051207 Grade 7: ?35,845 - ?40,322 per annum We have a position for a Research Associate to support the research of the Head of School, Professor Simon Gay, by collaboration on topics of mutual interest in the broad area of programming language foundations. The successful candidate will also be expected to contribute to the formulation and submission of research funding proposals, in order to further develop the activity of the Programming Languages research theme within the School of Computing Science. The position is full time with funding up to 31st July 2024 in the first instance. You should have a PhD in some aspect of programming language foundations, or have equivalent research experience. You should have a track record of publication and communication of research results. Topics of interest include (but are not limited to): type systems, session types, mechanised metatheory, effect systems, semantic typing, formal semantics, design and implementation of experimental programming languages or tools. We seek applicants at an international level of excellence. The School of Computing Science at the University of Glasgow has an international research reputation, and Glasgow, Scotland's largest city, offers an outstanding range of cultural resources and a high quality of life. Programming language research in the School of Computing Science spans the FATA (Formal Analysis, Theory and Algorithms) and GLASS (Glasgow Systems Section) research sections and involves five academic staff with a current portfolio of five funded research projects. We have our own seminar series (PLUG) as well as contributing to FATA and GLASS seminars and the Scottish Programming Languages Seminar. *Coronavirus / COVID-19* Considering the current travel restrictions, interviews will be held remotely. We will also be flexible about the starting date and working practices. *Further information* For informal enquiries or further information, please contact Professor Simon Gay Simon.Gay at glasgow.ac.uk. *Application details* Online advert at jobs.ac.uk: https://www.jobs.ac.uk/job/CEK204/research-associate Glasgow University online application system: https://my.corehr.com/pls/uogrecruit/erq_jobspec_version_4.jobspec?p_id=051207 Closing date: 25th March 2021 It is the University of Glasgow?s mission to foster an inclusive climate, which ensures equality in our working, learning, research and teaching environment. We strongly endorse the principles of Athena SWAN, including a supportive and flexible working environment, with commitment from all levels of the organisation in promoting gender equality. The University of Glasgow, charity number SC004401. From tristanj at bc.edu Mon Mar 1 06:34:17 2021 From: tristanj at bc.edu (Jean-Baptiste Tristan) Date: Mon, 1 Mar 2021 06:34:17 -0500 Subject: [TYPES/announce] Call for Submissions: International Conference on Probabilistic Programming (PROBPROG 2021) Message-ID: Call for Submissions: International Conference on Probabilistic Programming (PROBPROG 2021) Conference Dates: Wed Oct 20 - Fri Oct 22, 2021 Deadline: Thu May 6, 2021 11:59 PM AOE Submissions: https://cmt3.research.microsoft.com/PROBPROG2021/ Instructions: https://probprog.cc/submissions/ The International Conference on Probabilistic Programming (PROBPROG 2021) will take place Oct 20 - 22, 2021, in a fully online format. The conference invites two kinds of submissions: 1. Extended Abstracts Authors may submit work in the form of an extended abstract of 2-6 pages for consideration for a poster presentation, talk, or full-length proceedings submission. Extended abstracts are intended as a mechanism for discussing work that may be preliminary, and for this reason are non-archival. Titles for accepted poster presentations and talks will be listed on the conference website. Our aim is to enable researchers to get feedback from the PROBPROG community that helps mature the research, strengthen the probabilistic programming content, and improve the chances of acceptance in top venues aligned with other fields. 2. Syndicated Submissions Authors may submit work that has been accepted for publication at another venue within the last 12 months for consideration as a poster presentation or talk. These submissions may be full-length and are also non-archival, but will be listed on the conference website. Program Chairs - Guy Van den Broeck (UCLA) - Lawrence Murray (Uber) General Chairs - Jean-Baptiste Tristan (Boston College) - Jan-Willem van de Meent (Northeastern University) Program Information - Wed 20 October: Industry day and Tutorials - Thu 21 October: Main conference - Fri 22 October: Main conference Probabilistic programming is an emergent field based on the idea that probabilistic models can be efficiently represented as executable code. This idea has enabled researchers to formalize, automate, and scale up many aspects of modeling and inference; to make modeling and inference accessible to a broader audience of developers and domain experts; and to develop new programmable AI systems that integrate modeling and inference approaches from multiple domains. PROBPROG is the first international conference dedicated to probabilistic programming. PROBPROG includes presentations on basic research, applied research, open source, and the practice of probabilistic programming. PROBPROG attendees come from academia, industry, non-profits, and government. The conference aims to achieve three goals: 1. Create a venue where researchers from multiple fields ? e.g. programming languages, statistics, machine learning, and artificial intelligence ? can meet, interact, and exchange ideas. 2. Grow a diverse and inclusive probabilistic programming community, by actively seeking participation from under-represented groups, and providing networking opportunities, mentorship, and feedback to all members. 3. Support the development of the practice of probabilistic programming, including open-source systems and real-world applications, and provide a bridge between the practice of probabilistic programming and basic research. PROBPROG welcomes abstract submissions for contributed research presentations, demonstrations, open-source systems, participants in open discussions, and consideration for invited publication in an online journal. Submissions should indicate alignment with one or more of the following themes: 1. Artificial and Natural Intelligence Probabilistic programs and probabilistic programming technology for formulating and solving the core problems of intelligence, including research relevant for engineering artificial intelligence and for reverse-engineering natural intelligence. A central theme in this track is new AI architectures based on probabilistic programming that integrate statistical, symbolic, neural, Bayesian, and simulation-based approaches to knowledge representation and learning. Another central theme is proposals for learning probabilistic programs from data, and modeling high-level forms of human learning using probabilistic program synthesis. This track also includes research at the intersection of probabilistic programming and intelligence augmentation, collective intelligence, machine learning, and the development and analysis of intelligent infrastructure. 2. Statistics and Data Analysis Probabilistic programs and probabilistic programming technology for formulating and solving problems in statistics and data analysis. Topics include latent variable models, parameter estimation, automated data modeling, Bayesian inference, calibration, model checking, model criticism, visualization, and testing of statistical models and inference algorithms. This track also includes statistical applications and deployments of probabilistic programming for data analysis. 3. Languages, Tools, and Systems The design, implementation, and formal semantics of probabilistic programming languages and systems, including domain-specific and general-purpose languages, interpreters, compilers, probabilistic meta-programming techniques, probabilistic meta-programming languages, and runtime systems. This track also includes research on dynamic and static analysis of probabilistic programs, and empirical and theoretical study of the usability, performance, and accuracy of probabilistic programming languages and systems. 4. The Practice of Probabilistic Programming This track is centered on four themes: (i) probabilistic programs and systems based on probabilistic programming that solve problems in industry, government, philanthropic work, applied research, and teaching, as well as potential use cases for probabilistic programs or probabilistic programming technology in these areas; (ii) challenges that arise when using probabilistic programming in practice, including inspection, debugging, testing, and performance engineering; (iii) human-centric design of probabilistic programs and probabilistic programming technology; and (iv) probabilistic programming tools, probabilistic program analyses, probabilistic programming styles/workflows, probabilistic programming practices/guidelines/experience reports, and probabilistic programming environments with the potential to address issues faced by practitioners. -------------- next part -------------- An HTML attachment was scrubbed... URL: From wim.vanhoof at unamur.be Mon Mar 1 09:47:36 2021 From: wim.vanhoof at unamur.be (Wim Vanhoof) Date: Mon, 1 Mar 2021 15:47:36 +0100 Subject: [TYPES/announce] LOPSTR 2021 Call for Papers Message-ID: <0ECD1C34-7B41-41D5-A895-0D205B92B3E4@unamur.be> ============================================================ 31st International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2021 http://saks.iasi.cnr.it/lopstr21/ Tallinn, Estonia, September 7-9, 2021 (co-located with PPDP 2021) ============================================================ The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. The 31st International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2021) will be held at the Teachers' House in Tallinn, Estonia. Previous symposia were held in Bologna (as a virtual meeting), Porto, Frankfurt am Main, Namur, Edinburgh, Siena, Canterbury, Madrid, Leuven, Odense, Hagenberg, Coimbra, Valencia, Kongens Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester. LOPSTR 2021 will be co-located with PPDP 2021 (International Symposium on Principles and Practice of Declarative Programming). Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large, including, but not limited to: - synthesis - transformation - specialization - composition - optimization - inversion - specification - analysis and verification - testing and certification - program and model manipulation - machine learning for program development - verification and testing of machine learning systems - transformational techniques in SE - applications and tools Both full papers and extended abstracts describing foundations and applications in these areas are welcome. Survey papers that present some aspects of the above topics from a new perspective and papers that describe experience with industrial applications are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chairs in case of questions). * Important Dates * Abstract submission (optional): May 1, 2021 (AoE) Paper/Extended abstract submission: May 15, 2021 Notification: July 1, 2021 Camera-ready (for electronic pre-proceedings): August 20, 2021 Symposium: September 7-9, 2021 Revised paper submission: November 1, 2021 (AoE) Notification: December 1, 2021 Final version (for post-proceedings): January 16, 2022 * Submission Guidelines * Authors should submit an electronic copy of the paper (written in English) in PDF, formatted in LNCS style. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email; abstract; and three to four keywords which will be used to assist the PC in selecting appropriate reviewers for the paper. Page numbers (and, if possible, line numbers) should appear on the manuscript to help the reviewers in writing their report. Full papers cannot exceed 15 pages excluding references. Extended abstracts cannot exceed 8 pages excluding references. Additional pages may be used for appendices not intended for publication. Reviewers are not required to read the appendices, and thus papers should be intelligible without them. Papers should be submitted via EasyChair: https://easychair.org/conferences/?conf=lopstr2021 * Proceedings * All papers (extended abstracts and full papers) accepted for presentation at the symposium will be made available through electronic pre-proceedings. As is usual for LOPSTR, formal proceedings will be published only after the symposium. Full papers can be directly accepted for publication in the formal proceedings, or accepted only for presentation at the symposium. After the symposium, all authors of extended abstracts and full papers accepted only for presentation will be invited to revise and/or extend their submissions. Then, after another round of reviewing, these revised papers may also be published in the formal proceedings. * Program Chairs * Emanuele De Angelis, IASI-CNR, Italy Wim Vanhoof, University of Namur, Belgium * Local organisation * Niccol? Veltri, Tallinn University of Technology, Estonia * Contact * For more information, please contact the Program Committee Chairs: emanuele.deangelis at iasi.cnr.it , wim.vanhoof at unamur.be -------------- next part -------------- An HTML attachment was scrubbed... URL: From a.guha at northeastern.edu Mon Mar 1 11:59:19 2021 From: a.guha at northeastern.edu (Guha, Arjun) Date: Mon, 1 Mar 2021 16:59:19 +0000 Subject: [TYPES/announce] PLDI 2021 Student Research Competition (SRC) Message-ID: Deadline: March 22 2021 Venue: Online More Information: https://pldi21.sigplan.org/track/pldi-2021-SRC The ACM Student Research Competition (SRC), sponsored by Microsoft Research, offers a unique forum for undergraduate and graduate students to present their original research on programming language design, implementation, theory, applications, and performance at PLDI 2021. The goal is to give students a place to discuss their research with experts in their field and to help them sharpen their research and communication skills. Eligibility criteria -------------------- Participants must have current student status, either graduate or undergraduate, at the time of the submission deadline. Participants in the SRC must also be current ACM (student) members. Prizes ------ Winners of the three top places in each category receive prizes of $500 for the first place winner, $300 for the second place winner and $200 for the third place winner, respectively. The top three undergraduate and graduate winners receive an award medal and a one-year complimentary ACM student membership with a subscription to ACM's Digital Library. ACM SRC Grand Finals -------------------- First place winners in each category will be invited to participate in the ACM SRC Grand Finals, an online round of competition between first-place SRC winners from different ACM conferences held in 2021. Grand Finals will be judged by an ACM-appointed panel of judges. Winners of the three top Grand Finals places in each category will receive additional prizes of $500 for the first place winner, $300 for the second place winner and $200 for the third place winner, respectively. They will be also invited to the annual ACM Award Banquet along with prestigious ACM award winners, including the winner of the Turing Award. From ruy at cin.ufpe.br Mon Mar 1 14:50:29 2021 From: ruy at cin.ufpe.br (Ruy Jose Guerra Barretto de Queiroz) Date: Mon, 1 Mar 2021 16:50:29 -0300 Subject: [TYPES/announce] 27th WoLLIC 2021 - Call for Papers In-Reply-To: References: Message-ID: [Please circulate. Apologies for multiple copies.] CALL FOR PAPERS WoLLIC 2021 27th Workshop on Logic, Language, Information and Computation October 5 to 8, 2021 ORGANISATION Universidade de S?o Paulo, Brazil University College London, UK 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 online from October 5 to 8, 2021. 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 (https://easychair.org/conferences/?conf=wollic2021 ). PROCEEDINGS The proceedings of WoLLIC 2021, 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 2021 issue of a scientific journal (to be confirmed). INVITED SPEAKERS Catarina Dutilh Novaes (VU Amsterdam) Santiago Figueira (Universidad de Buenos Aires, Argentina) Andreas Herzig (IRIT, France) Cl?udia Nalon (UnB - Brazil) Giselle Reis (CMU - Qatar) IMPORTANT DATES May 15, 2021: Full paper deadline June 23, 2021: Author notification June 30, 2021: Final version deadline (firm) PROGRAMME COMMITTEE Carlos Areces (Cordoba, Argentina) Arthur Amorim Azevedo (CMU, USA) Nina Gierasimczuk (Technical University of Denmark, Denmark) 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 (University of Groningen, The Netherlands) Jurriaan Rot (Radboud University, The Netherlands) 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 Renata Wassermann (Univ S?o Paulo) (Co-Chair) Alexandra Silva (Univ College London) (Co-Chair) Anjolina G. de Oliveira (Univ Federal de Pernambuco, Brasil) Ruy de Queiroz (Univ Federal de Pernambuco, Brasil) (co-chair) SCIENTIFIC SPONSORSHIP Interest Group in Pure and Applied Logics (IGPL) The Association for Logic, Language and Information (FoLLI) Association for Symbolic Logic (ASL) European Association for Theoretical Computer Science (EATCS) 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/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From m.sadrzadeh at ucl.ac.uk Tue Mar 2 04:50:00 2021 From: m.sadrzadeh at ucl.ac.uk (Sadrzadeh, Mehrnoosh) Date: Tue, 2 Mar 2021 09:50:00 +0000 Subject: [TYPES/announce] Second Call for Nominations: Beth Outstanding Dissertation Prize 2021 Message-ID: Second Call for Nominations: E. W. Beth Outstanding Dissertation Prize 2021 Since 2002, the Association for Logic, Language, and Information (FoLLI) has been awarding the annual E.W. Beth Dissertation Prize to outstanding Ph.D. dissertations in Logic, Language, and Information (http://www.folli.info/?page_id=74), with financial support of the E.W. Beth Foundation (https://www.knaw.nl/en/awards/funds/evert-willem-beth-stichting/evert-willem-beth-foundation). Nominations are now invited for the best dissertation in these areas resulting in a Ph.D. degree awarded in 2020. The deadline for nominations is the 15th of April 2021. Qualifications: - A Ph.D. dissertation on a topic concerning Logic, Language, or Information is eligible for the Beth Dissertation Prize 2021, if the degree was awarded between January 1st and December 31st, 2020. - There are no restrictions on the nationality, ethnicity, age, gender or employment status of the author of the nominated dissertation, nor on the university, academic department or scientific institution formally conferring the Ph.D. degree, nor on the language in which the dissertation has originally been written. - In accordance with the aim of the Beth Foundation to continue and extend the work of the Dutch logician Evert Willem Beth, nominations are invited of excellent dissertations on topics in the broad remit of ESSLLI, including current topics in philosophical and mathematical logic, computer science logic, philosophy of science, philosophy of language, history of logic, history of the philosophy of science and scientific philosophy in general, as well as the current theoretical and foundational developments in information and computation, language, and cognition. Dissertations with results more broadly impacting various research areas in their interdisciplinary investigations are especially solicited. - If a nominated dissertation has originally been written in a language other than English, its dossier should still contain the required 10 page English abstract, see below. If the committee decides that a nominated dissertation in a language other than English requires translation to English for proper evaluation, the committee can transfer its nomination to the competition in 2022. The English translation must in such cases be submitted before the deadline of the call for nominations in 2022. The committee may recommend the Beth Foundation to consider supporting such nominated dissertations for English translation, upon request by the author of the dissertation. The prize consists of: - a certificate - a donation of 3000 euros, provided by the E.W. Beth Foundation, divided among the winners, should there be more than one winner - an invitation to submit the dissertation, possibly after revision, for publication in FoLLI Publications on Logic, Language and Information (Springer). Only digital submissions are accepted, without exception. Hard copy submissions are not allowed. The following documents are to be submitted in the nomination dossier: - The original dissertation in pdf format (ps/doc/rtf etc. not acceptable). - A ten-page English abstract of the dissertation, presenting the main results of each chapter. - A letter of nomination from the dissertation supervisor, which concisely describes the scope and significance of the dissertation, stating when the degree was officially awarded and the members of the Ph.D. committee. Nominations should contain the address, phone and email details of the nominator. - Two additional letters of support, including at least one from a referee not affiliated with the academic institution that awarded the Ph.D. degree, nor otherwise related to the nominee (e.g. former teachers, supervisors, co-authors, publishers or relatives) or the dissertation. - Self-nominations are not possible. All pdf documents must be submitted electronically, as one zip file, via EasyChair by following the link https://easychair.org/conferences/?conf=bodp2021. In case of any problems or questions please contact the chair of the committee Mehrnoosh Sadrzadeh (m.sadrzadeh at ucl.ac.uk). The prize will be awarded by the chair of the FoLLI board at a ceremony during the 32nd ESSLLI summer school, which will be based in Utrecht, but held online August 2-13, 2021. Beth dissertation prize committee 2021: Samson Abramsky (University of Oxford) Maria Aloni (University of Amsterdam) Cleo Condoravdi(Stanford University) Robin Cooper (University of Gothenburg) Guy Emerson (University of Cambridge) Katrin Erk (University of Texas at Austin) Sujata Ghosh (ISI, Chennai) Davide Grossi (Universities of Groningen and Amsterdam) Christoph Haase (University of Oxford) Louise McNally (Universitat Pompeu Fabra Barcelona) Reinhard Muskens (University of Amsterdam) Mehrnoosh Sadrzadeh (University College London, chair) Mark Steedman (University of Edinburgh) Matthew Stone (Rutgers University) Jouko Vaananen (University of Helsinki and University of Amsterdam) FoLLI is committed to diversity and inclusion and we welcome dissertations from all under-represented groups -------------- next part -------------- An HTML attachment was scrubbed... URL: From harley.eades at gmail.com Tue Mar 2 11:34:18 2021 From: harley.eades at gmail.com (Harley D. Eades III) Date: Tue, 2 Mar 2021 11:34:18 -0500 Subject: [TYPES/announce] Seminar talk on Coupled Relational Symbolic Execution Message-ID: Hi, everyone. On Friday, March 5, 2021 between 2pm and 3pm EST (7pm - 8pm UTC), Dr. Marco Gaboardi will be giving a presentation as part of the CS Colloquium Series at Augusta University. Presentation details can be found here: https://the-au-forml-lab.github.io/colloquium_talks/Gaboardi.html This will be an exciting talk on Marco's work on extending symbolic execution with the combination of relational reasoning and probabilistic coupling. These talks are open to the general public via Zoom and Youtube. I'll be live streaming it on Youtube. If you are interested in attending the Zoom meeting please RSVP with me before the talk. Questions will be taken from those on Zoom and YouTube. If you care to watch via YouTube, please use the following link: https://youtu.be/0f-srpBeXAI Feel free to share this message with everyone you know. I hope all of you, your family and friends are doing well! Very best, Harley -------------- next part -------------- An HTML attachment was scrubbed... URL: From esparza at in.tum.de Thu Mar 4 09:08:26 2021 From: esparza at in.tum.de (Javier Esparza) Date: Thu, 04 Mar 2021 15:08:26 +0100 Subject: [TYPES/announce] 2021 Alonzo Church Award In-Reply-To: <6ae6423621304c888cb54fd9cef1f18b@in.tum.de> References: <6ae6423621304c888cb54fd9cef1f18b@in.tum.de> Message-ID: <7e4923f577dc28e5916d435ccf264d8e@in.tum.de> ***************************************************************** ***************************************************************** DEADLINE EXTENDED TO APRIL 1 ***************************************************************** ***************************************************************** CALL FOR NOMINATIONS The 2021 Alonzo Church Award for Outstanding Contributions to Logic and Computation INTRODUCTION An annual award, called the Alonzo Church Award for Outstanding Contributions to Logic and Computation, was established in 2015 by the ACM Special Interest Group for Logic and Computation (SIGLOG), the European Association for Theoretical Computer Science (EATCS), the European Association for Computer Science Logic (EACSL), and the Kurt G?del Society (KGS). The award is for an outstanding contribution represented by a paper or by a small group of papers published within the past 25 years. This time span allows the lasting impact and depth of the contribution to have been established. The award can be given to an individual, or to a group of individuals who have collaborated on the research. For the rules governing this award, see https://siglog.org/alonzo-church-award/, https://www.eatcs.org/index.php/church-award/, and https://eacsl.org/. The 2020 Alonzo Church Award was given jointly to Ronald Fagin, Phokion G. Kolaitis, Ren?e J. Miller, Lucian Popa, and Wang Chiew Tan for their ground-breaking work on laying the logical foundations for data exchange. Lists containing this and all previous winners can be found through the links above. ELIGIBILITY AND NOMINATIONS The contribution must have appeared in a paper or papers published within the past 25 years. Thus, for the 2021 award, the cut-off date is January 1, 1996. When a paper has appeared in a conference and then in a journal, the date of the journal publication will determine the cut-off date. In addition, the contribution must not yet have received recognition via a major award, such as the Turing Award, the Kanellakis Award, or the G?del Prize. (The nominee(s) may have received such awards for other contributions.) While the contribution can consist of conference or journal papers, journal papers will be given a preference. Nominations for the 2021 award are now being solicited. The nominating letter must summarize the contribution and make the case that it is fundamental and outstanding. The nominating letter can have multiple co-signers. Self-nominations are excluded. Nominations must include: a proposed citation (up to 25 words); a succinct (100-250 words) description of the contribution; and a detailed statement (not exceeding four pages) to justify the nomination. Nominations may also be accompanied by supporting letters and other evidence of worthiness. Nominations should be submitted to javier.esparza at in.tum.de by APRIL 1, 2021. PRESENTATION OF THE AWARD The 2021 award will be presented at the ACM SIGLOG/IEEE Symposium on Logic in Computer Science, LICS 2021, which is scheduled to take place in Rome in June/July 2021. The award will be accompanied by an invited lecture by the award winner, or by one of the award winners. The awardee(s) will receive a certificate and a cash prize of USD 2,000. If there are multiple awardees, this amount will be shared. AWARD COMMITTEE The 2021 Alonzo Church Award Committee consists of the following five members: Mariangiola Dezani, Thomas Eiter, Javier Esparza (chair), Radha Jagadeesan, and Igor Walukiewicz. -- Prof. Javier Esparza Faculty of Computer Science Technical University of Munich Boltzmannstr. 3, 85748 Garching From davide.sangiorgi at gmail.com Thu Mar 4 10:28:12 2021 From: davide.sangiorgi at gmail.com (Davide Sangiorgi) Date: Thu, 4 Mar 2021 16:28:12 +0100 Subject: [TYPES/announce] 3 Post-doc positions on semantics of PLs Message-ID: 3 POST-DOC POSITIONS on the semantics of programming languages We have 3 post-doc positions at the Department of Computer Science of the University of Bologna. The research theme is coinductive proof techniques and abstract interpretation, with application to concurrent and/or functional languages. Types are expected to play a significant role. The position should start sometimes in 2021, the exact date is negotiable. Each position covers 1 year, with possibilities of extension for another year. The funding comes from a national project whose other sites are Verona (R. Giacobazzi), Padova (F. Ranzato), and Pisa (F. Bonchi). The work will be carried out in close connection with the ERC project DIAPASoN (led by Ugo Dal Lago, U. Bologna), which also focuses on semantics of programming languages, using tools and techniques based on logical relations, bisimulation, game semantics, and linear logic. If you are interested, or you know someone interested, or for more details, do not hesitate to contact me (deadline: 8 April 2021) Thanks, Davide Sangiorgi http://www.cs.unibo.it/~sangio/ davide.sangiorgi at gmail.com From a.guha at northeastern.edu Fri Mar 5 09:21:45 2021 From: a.guha at northeastern.edu (Guha, Arjun) Date: Fri, 5 Mar 2021 14:21:45 +0000 Subject: [TYPES/announce] PLDI 2021 Co-located events Message-ID: PLDI 2021 Co-located events =========================== PLDI 2021 is going to have some very exciting co-located events this year. Do consider submitting your work and/or attending some of them! ================================================= We've got three terrific co-hosted conferences... ================================================= * HOPL IV (the 4th History of Programming Languages conference) which produces accurate historical records and descriptions of programming language design, development, and philosophy. (https://hopl4.sigplan.org/) * ISMM (the ACM SIGPLAN International Symposium on Memory Management) is a premier forum for research on a wide range of topics related to memory management. (Deadline 11 Mar; https://conf.researchr.org/home/ismm-2021) * LCTES (Languages, Compilers, and Tools for Embedded Systems) provides a link between the programming languages and embedded systems engineering communities. Researchers and developers in these areas are addressing many similar problems but with different backgrounds and approaches. (Deadline 8 Mar; https://pldi21.sigplan.org/home/LCTES-2021) =========================================== ... as well as six excellent workshops... =========================================== * SOAP (State Of the Art in Program analysis) is a forum for researchers and practitioners to discuss the latest ideas, developments and approaches to techniques, frameworks, and applications for program analysis and related areas. (Deadline 22 Mar; https://pldi21.sigplan.org/home/SOAP-2021) * The ARRAY workshop invites all to the exchange of ideas between communities involved in the design, implementation, optimization and use of array-oriented languages and libraries for various applications. (Deadline 2 Apr; https://pldi21.sigplan.org/home/ARRAY-2021) * The Infer Practitioners Workshop gathers together developers and researchers working with the Infer static analysis platform. We welcome contributed technical talks around a range of Infer-related topics. (Deadline 5 May; https://pldi21.sigplan.org/home/infer2021) * The Annual Symposium on Machine Programming (MAPS) workshop seeks papers on a diverse range of topics related to programming languages and machine learning. It aims to bring together the programming languages and machine learning communities to encourage collaboration in areas of mutual benefit. (Deadline 2 Apr; https://pldi21.sigplan.org/home/maps-2021) * The PLMW at PLDI (Programming Languages Mentoring Workshop) brings together world leaders in programming languages research and teaching from academia and industry to provide technical sessions on cutting-edge PL research and mentoring sessions on how to prepare for a research career. (https://pldi21.sigplan.org/home/PLMW-PLDI-2021) * The Workshop on Programming Languages for Quantum Computing (PLanQC) brings together researchers from the fields of programming languages and quantum information, exposing the programming languages community to the unique challenges of programming quantum computers. (Deadline 2 Apr; https://pldi21.sigplan.org/home/planqc-2021) Enjoy! The PLDI 2021 Organizers From m.backens at cs.bham.ac.uk Fri Mar 5 11:55:39 2021 From: m.backens at cs.bham.ac.uk (Miriam Backens) Date: Fri, 5 Mar 2021 16:55:39 +0000 Subject: [TYPES/announce] Final CFP: Quantum Physics and Logic (QPL 2021), submission deadline March 12 Message-ID: *18th International Conference on Quantum Physics and Logic (QPL 2021), June 7-11, 2021. Online and Gda?sk, Poland* FINAL CALL FOR PAPERS QPL is an annual conference that brings together researchers working on mathematical foundations of quantum physics, quantum computing, and related areas, with a focus on structural perspectives and the use of logical tools, ordered algebraic and category-theoretic structures, formal languages, semantical methods, and other computer science techniques applied to the study of physical behaviour in general. Work that applies structures and methods inspired by quantum theory to other fields (including computer science) is also welcome. QPL 2021 will be held both virtually online and physically in Gdansk (COVID permitting). More information at https://qpl2021.eu/ INVITED SPEAKERS Matty Hoban Flaminia Giacomini Anna Jencova Hl?r Kristj?nsson Ariel Bendersky Martha Lewis IMPORTANT DATES Submission deadline: March 12, 2021 Author notification: April 23, 2021 Early registration: May 14, 2021 Proceedings paper ready: May 28, 2021 Conference: June 7-11, 2021 SUBMISSION GUIDELINES Recent work that is relevant to the conference is solicited in one (or more) of three tracks: * Proceedings submissions consist of a 5-12 page extended abstract. Only proceedings-track submissions are eligible to be published in Electronic Proceedings in Theoretical Computer Science (EPTCS) after the conference. * Non-proceedings submissions consist of a 3 page extended abstract and a link to a separate published paper, pre-print, or an attached draft. * Poster submissions consist of a 1-3 page abstract and may contain a link to a separate published paper or pre-print. Submission of partial results of work in progress is encouraged. Submissions should be prepared using LaTeX, and must be submitted in PDF format. Use of the EPTCS style is encouraged. Submission is done via EasyChair: https://www.easychair.org/conferences/?conf=qpl2021 BEST STUDENT PAPER There will be an award for the best student paper at the discretion of the programme committee. Papers eligible for the award are those where all the authors are students at the time of submission. PROGRAMME COMMITTEE Antonio Acin Barbara Amaral Pablo Arrighi Miriam Backens (co-chair) Jonathan Barrett Alessandro Bisio Anne Broadbent Ulysse Chabaud Bob Coecke Alejandro Diaz-Caro Ross Duncan Yuan Feng Alexandru Gheorghiu Stefano Gogioso Teiko Heinosaari Chris Heunen (co-chair) Matthew Hoban Kohei Kishida Aleks Kissinger Ravi Kunjwal Ciaran Lee Matt Leifer Martha Lewis Shane Mansfield Simon Martiel Hector Miller-Bakewell Mio Murao Glaucia Murta Ognyan Oreshkov Prakash Panangaden Simon Perdrix Lidia del Rio Julien Ross Mehrnoosh Sadrzadeh Ana Bel?n Sainz John Selby Rui Soares Barbosa Rob Spekkens Isar Stubbe Benoit Valiron Jamie Vicary John van de Wetering Alexander Wilce Mingsheng Ying Vladimir Zamdzhiev Margherita Zorzi -- Dr Miriam Backens (they/them) Lecturer School of Computer Science, University of Birmingham From p.gardner at imperial.ac.uk Sun Mar 7 08:08:28 2021 From: p.gardner at imperial.ac.uk (Gardner, Philippa A) Date: Sun, 7 Mar 2021 13:08:28 +0000 Subject: [TYPES/announce] PhD position in the analysis of concurrent or distributed programs, Imperial Message-ID: <54199D28-5E75-46F5-A2A9-4A53713B69A0@ic.ac.uk> Hello all, [Apologies for multiple postings.] I am looking for a PhD student who is interested in the analysis of concurrent or distributed programs, start date in October 2021. A summary of possible research projects is given below and details about my research group can be found here. The deadline to apply for a PhD position in the Department is **19th March 2021**. A successful UK student will probably be funded through the standard Departmental competition for funds. A successful EU/overseas student will probably be funded by a combination of Departmental funding and my funding. In particular, I have additional funding which means that the EU/overseas students are able to go into the same competition for funding as the UK students. Given these uncertain times, we will assess the situation about whether it is necessary to start the position remotely nearer the time. The good news is that accommodation rents are currently low due to covid, with people in my group recently getting some excellent accommodation, and so it is actually quite a good time to come to London. Please do not hesitate to contact me directly if interested, cc?ing my administrator Teresa Carbajo Garcia, cc'd. Best wishes, Philippa --------------------------------------------------------------------------------------- Professor Philippa Gardner FREng Department of Computing Imperial College 180 Queen?s Gate London SW7 2AZ Your working day may not be the same as mine. Please do not feel obliged to reply to this email outside your normal working hours. ??????????????????????????????????????????? POSSIBLE PROJECTS Gillian: Concurrency Gillian [1,1a] is a multi-language platform for compositional symbolic analysis. It currently supports three flavours of analysis: whole-program symbolic testing; full verification based on separation logic; and automatic compositional testing based on bi-abduction. It is underpinned by a core symbolic execution engine, parametric on the memory model of the target language, with strong mathematical foundations that unify symbolic testing and verification. Gillian has been instantiated to C and JavaScript, obtaining results on real-world code that demonstrate the viability of our unified, parametric approach. We have an ambitious project to design and implement Concurrent Gillian. It involves: changing the core of Gillian to handle concurrency; developing a Gillian instantiation for a small concurrent While language to explore different types of concurrency reasoning; developing a Gillian instantiation for concurrent Rust which will build on the current development of a Gillian instantiation for sequential Rust; and exploring symbolic testing and verification for real-world Rust programs. Concurrency We have worked for many years on the compositional reasoning about concurrent programs, introducing fundamental techniques which underpin modern concurrent separation logics [2,2a]: logical abstraction; logical atomicity; and logical environment liveness properties. We have applied our reasoning to verify some of the most advanced concurrent algorithms in the literature. There are several suitable PhD projects associated with this work: for example, continuing the work on the foundational theory; applying the work to real-world libraries; developing prototype analysis tools; or using the Coq-focused Iris project, whose foundations use some of our theory. Distribution We have recently begun to work on weak consistency models for distribution, developing an interleaving operational semantics for client-observational behaviour of atomic transactions [5]. Possible PhD projects include: creating a program logic for distributed atomic transactions (our original motivation for the work) inspired by our previous work on program logics for concurrency; or further developing the operational semantics with the aim to provide prototype tools for proving robustness results and discovering litmus tests. References [1] Gillian, Part 1: A Multi-language Platform for Symbolic Execution, Jose Fragoso Santos, Petar Maksimovic, Sacha-Elie Ayoun and Philippa Gardner, PLDI'2020. Part 2 on verification and bi-abduction is being written now. We have given a talk on Gillian at the conference Rebase, associated with ECOOP/OOPSLA, in November 2020, and at Facebook's Testing and Verification Symposium (FaceTAV), in December 2020. [1a] Gillian Verification for JavaScript and C, Petar Maksimovic, Sacha-Elie Ayoun, Jose Fragoso Santos and Philippa Gardner, submitted, draft available upon request. [2] A Perspective on Specifying and Verifying Concurrent Modules, Thomas Dinsdale-Young, Pedro da Rocha Pinto and Philippa Gardner, Journal of Logical and Algebraic Methods in Programming, 2018. [2a] TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs, Emanuele D?Osualdo, Azadeh Farzan, Philippa Gardner and Julian Sutherland, submitted for journal publication 2020, draft available upon request. [3] Data Consistency in Transactional Storage Systems: a Centralised Approach, Shale Xiong, Andrea Cerone, Azalea Raad and Philippa Gardner, ECOOP'20. -------------- next part -------------- An HTML attachment was scrubbed... URL: From p.gardner at imperial.ac.uk Sun Mar 7 08:09:50 2021 From: p.gardner at imperial.ac.uk (Gardner, Philippa A) Date: Sun, 7 Mar 2021 13:09:50 +0000 Subject: [TYPES/announce] Post-doctoral research position on `Gillian; Concurrency', Imperial Message-ID: <8F662EC0-9584-4E54-AD5B-0B34F6D6D09C@ic.ac.uk> Hello all, [Apologies for multiple postings.] I have an opening for a post-doctoral research position at Imperial on `Gillian: Concurrency', funded by a national fellowship: details of the project are given below; details about my research group can be found here. [I have flexible funding and so also include brief descriptions of my more theoretical work on reasoning about concurrent and distributed programs in case it is of interest.] The position is for three years. The start date is flexible in these uncertain times, but two good times are September 2021 and January 2022. It is possible to start the positions remotely, although we are able to meet at Imperial when necessary so it might make sense to be in London. In fact, accommodation rents are currently low (due to covid) so it is actually quite a good time to come to London. If you are interested, please do not hesitate to contact me, cc?ing my administrator Teresa Carbajo Garcia, t.carbajo-garcia at imperial.ac.uk. Philippa --------------------------------------------------------------------------------------- Professor Philippa Gardner FREng Department of Computing Imperial College 180 Queen?s Gate London SW7 2AZ Your working day may not be the same as mine. Please do not feel obliged to reply to this email outside your normal working hours. --------------------------------------------------------------------------------------- THE PROJECT Gillian: Concurrency Philippa Gardner Imperial College London Gillian [1,1a] is a multi-language platform for compositional symbolic analysis. It currently supports three flavours of analysis: whole-program symbolic testing; full verification based on separation logic; and automatic compositional testing based on bi-abduction. It is underpinned by a core symbolic execution engine, parametric on the memory model of the target language, with strong mathematical foundations that unifies symbolic testing and verification. Gillian has been instantiated to C and JavaScript, obtaining results on real-world code that demonstrate the viability of our unified, parametric approach. The ambitious aim is to design and implement Concurrent Gillian. It involves: changing the core of Gillian to handle concurrency; developing a Gillian instantiation for a small concurrent While language to explore different types of concurrency reasoning; developing a Gillian instantiation for concurrent Rust which will build on the current development of a Gillian instantiation for sequential Rust; and exploring symbolic testing and verification for real-world Rust programs. We are also about to begin projects on `Gillian: Program Correctness and Incorrectness', funding by Facebook, and `The Coq-certification of Gillian'. The spirit of the group is to get the best fit between people and research, so there is much flexibility with working on these other projects as well. OTHER PROJECTS ON CONCURRENCY AND DISTRIBUTION Concurrency We have worked for many years on the compositional reasoning about concurrent programs, introducing fundamental techniques which underpin modern concurrent separation logics [2,2a]: logical abstraction; logical atomicity; and logical environment liveness properties. We have applied our reasoning to verify some of the most advanced concurrent algorithms in the literature. There are several suitable PhD projects associated with this work: for example, continuing the work on the foundational theory; applying the work to real-world libraries; developing prototype analysis tools; or using the Coq-focused Iris project, whose foundations use some of our theory. Distribution We have recently begun to work on weak consistency models for distribution, developing an interleaving operational semantics for client-observational behaviour of atomic transactions [5]. Possible PhD projects include: creating a program logic for distributed atomic transactions (our original motivation for the work) inspired by our previous work on program logics for concurrency; or further developing the operational semantics with the aim to provide prototype tools for proving robustness results and discovering litmus tests. References [1] Gillian, Part 1: A Multi-language Platform for Symbolic Execution, Jose Fragoso Santos, Petar Maksimovic, Sacha-Elie Ayoun and Philippa Gardner, PLDI'2020. Part 2 on verification and bi-abduction is being written now. We have given a talk on Gillian at the conference Rebase, associated with ECOOP/OOPSLA, in November 2020, and at Facebook's Testing and Verification Symposium (FaceTAV), in December 2020. [1a] Gillian Verification for JavaScript and C, Petar Maksimovic, Sacha-Elie Ayoun, Jose Fragoso Santos and Philippa Gardner, submitted, draft available upon request. [2] A Perspective on Specifying and Verifying Concurrent Modules, Thomas Dinsdale-Young, Pedro da Rocha Pinto and Philippa Gardner, Journal of Logical and Algebraic Methods in Programming, 2018. [2a] TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs, Emanuele D?Osualdo, Azadeh Farzan, Philippa Gardner and Julian Sutherland, submitted for journal publication 2020, draft available upon request. [3] Data Consistency in Transactional Storage Systems: a Centralised Approach, Shale Xiong, Andrea Cerone, Azalea Raad and Philippa Gardner, ECOOP'20. -------------- next part -------------- An HTML attachment was scrubbed... URL: From giles.reger at manchester.ac.uk Thu Mar 4 11:50:40 2021 From: giles.reger at manchester.ac.uk (Giles Reger) Date: Thu, 4 Mar 2021 16:50:40 +0000 Subject: [TYPES/announce] ATVA 2021 - Second Call for Papers Message-ID: <8D76F218-75AA-4A29-A9FD-77F89CD62D11@manchester.ac.uk> -------------------------------------------- CALL FOR PAPERS - ATVA 2021 -------------------------------------------- The 19th International Symposium on Automated Technology for Verification and Analysis (ATVA 2021), 18 - 22 Oct 2021, Gold Coast, Australia. If the pandemic means that travelling is still an issue in October, we might change the plan and host the conference online. https://formal-analysis.com/atva/2021/ ATVA 2021 is the 19th in a series of symposia aimed at bringing together academics, industrial researchers and practitioners in the area of theoretical and practical aspects of automated analysis, synthesis, and verification of hardware, software, and machine learning (ML) systems. ATVA is a CORE Rank A conference. ------------------------------ Important Dates ------------------------------ Full paper submissions due: 9 April (AOE) 2021 Notification: 4 June 2021 Camera-ready due: 4 July 2021 Conference: 18 - 22 Oct 2021 ------------------------------ Scope ------------------------------ ATVA solicits high-quality submissions in the following suggestive list of topics: - Formalisms for modelling hardware, software and embedded systems - Testing, analysis, verification and security of machine learning systems - Specification and verification of finite-state, infinite-state and parameterised system - Program analysis and software verification - Analysis and verification of hardware circuits, system-on-chip and embedded systems - Analysis of real-time, hybrid, priced, weighted and probabilistic systems - Deductive, algorithmic, compositional, and abstraction/refinement techniques for analysis and verification - Analytical techniques for safety, security, and dependability - Testing and runtime analysis based on verification technology - Analysis and verification of parallel and concurrent systems - Verification in industrial practice - Synthesis for hardware and software systems - Applications and case studies - Automated tool support - Analysis and verification of Machine Learning and AI systems ------------------------------ Submission and Publication ------------------------------ ATVA welcomes submissions in the following two categories: 1) Regular research papers (16 pages, including references) 2) Tool papers (6 pages, including references) Submissions must be in Springer's LNCS format. Additional material may be placed in an appendix, to be read at the discretion of the reviewers and to be omitted in the final version. Formatting style files and further guidelines for formatting can be found at the Springer website. Tool papers must include information about a URL from where the tool can be downloaded or accessed online for evaluation. The URL must also contain a set of examples and a user manual that describes the usage of the tool through examples. In case the tool needs to be downloaded and installed, the URL must contain instructions for installation of the tool on Linux/Windows/macOS. Accepted papers in both categories will be published in Springer's Lecture Notes in Computer Science series. At least one author of each accepted paper is expected to register and present the paper at the conference. Authors should consult Springer's authors' guidelines (ftp://ftp.springernature.com/cs-proceeding/svproc/guidelines/Springer_Guidelines_for_Authors_of_Proceedings_CS.pdf) and use their proceedings templates, either for LaTeX or for Word, for the preparation of their papers. Springer encourages authors to include their ORCIDs in their papers. In addition, the corresponding author of each paper, acting on behalf of all of the authors of that paper, must complete and sign a Consent-to-Publish form. The corresponding author signing the copyright form should match the corresponding author marked on the paper. Once the files have been sent to Springer, changes relating to the authorship of the papers cannot be made. Papers must be submitted through EasyChair. https://easychair.org/conferences/?conf=atva2021 ------------------------------ Organising Committee ------------------------------ General Chair Jing Sun, University of Auckland, New Zealand Program Co-Chairs Vijay Ganesh, University of Waterloo, Canada Zhe Hou, Griffith University, Australia Publicity Co-chairs Giles Reger, The University of Manchester, UK Meng Sun, Peking University, China Workshop Co-chairs Guy Katz, Hebrew University of Jerusalem, Israel Rayna Dimitrova, CISPA Helmholtz Center for Information Security, Germany -------------- next part -------------- An HTML attachment was scrubbed... URL: From ayala at unb.br Wed Mar 10 14:02:48 2021 From: ayala at unb.br (Mauricio Ayala-Rincon) Date: Wed, 10 Mar 2021 16:02:48 -0300 Subject: [TYPES/announce] Second CFPs LSFA 2021 affiliated to FSCD 2021 Message-ID: <1b66cd95-2059-2751-7383-c5e4f4451241@unb.br> ??????????????????//?????????????????? ??????? 16th Logical and Semantic Frameworks with Applications - LSFA 2021 ??????????????????????????? 23-24 July 2021 ?????????????????????? https://mat.unb.br/lsfa2021 ????????????? Affiliated to FSCD 2021, Buenos Aires, Argentina (Online) ???????????????????????????? Second Call For Papers ??????????????????//?????????????????? Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for the formal specification of systems and computational languages, supporting tool development and reasoning. The LSFA series' objective is to put together theoreticians and practitioners to promote new techniques and results, from the theoretical side, and feedback on the implementation and use of such techniques and results, from the practical side. See lsfa.cic.unb.br for more information. LSFA topics of interest include, but are not limited to: * Automated deduction * Applications of logical and semantic frameworks * Computational and logical properties of semantic frameworks * Formal semantics of languages and systems * Implementation of logical and semantic frameworks * Lambda and combinatory calculi * Logical aspects of computational complexity * Logical frameworks * Process calculi * Proof theory * Semantic frameworks * Specification languages and meta-languages * Type theory Submissions Contributions should be written in English and submitted in full paper (with a maximum of 16 pages) or short papers (with a maximum of 6 pages). They must be unpublished and not submitted simultaneously for publication elsewhere. The papers should be prepared in LaTeX using the EPTCS style. The submission should be in the form of a PDF file uploaded to Easychair: https://easychair.org/conferences/?conf=lsfa2021 The pre-proceedings, containing the reviewed extended abstracts, will be handed out at event registration. After the meeting, the authors will be invited to submit full versions of their works for the post-proceedings publication. At least one of the authors should register for the conference. Presentations should be in English. According to the submissions' quality, the chairs will promote the further publication of journal revised versions of the papers. Previous LSFA Special Issues have been published in journals such as The Logical J. of the IGPL, Theoretical Computer Science and Mathematical Structures in Computer Sciences (see the LSFA page http://lsfa.cic.unb.br). Important dates * Abstract: Monday 26th April * Submission: Sunday 2nd May * Notification: Friday 4th June * Preliminary proceedings version due: Monday 14th June * Submission for final proceedings: Sunday 17th October * Final version: Sunday 19th December Invited Speakers ? Alejandro D?az-Caro (ICC-UBA/CONICET, UNQ) ? Alexandra Silva (University College London) ? Giulio Guerrieri (University of Bath) Program Committee ? Mar?a Alpuente (Universitat Polit?cnica de Val?ncia) ? Sandra Alves (Universidade de Porto, Portugal) ? Takahito Aoto (Niigata University) ? Mauricio Ayala-Rinc?n (Universidade de Bras?lia) - Co-Chair ? Eduardo Bonelli (Stevens University) - Co-Chair ? Evelyne Contejean (LRI, CNRS, Univ Paris-Sud, Orsay) ? Valeria de Paiva (Samsung Research America and University of Birmingham) ? Marcelo Finger (Universidade de S?o Paulo) ? Yannick Forster (Saarland University) ? Lourdes del Carmen Gonz?lez Huesca (UNAM) ? Edward Hermann Haeusler (PUC-Rio, Brazil) ? Cynthia Kop (Radboud University) ? Temur Kutsia (RISC, Johannes Kepler University Linz) ? Hernan Melgratti (Universidad de Buenos Aires) ? Alexandre Miquel (Universidad de La Rep?blica) ? Barbara Morawska (Ahmedabad University) ? Mariano Moscato (National Institute of Aerospace) ? Cesar Mu?oz (NASA LaRC) ? Daniele Nantes-Sobrinho (U. de Bras?lia) ? Carlos Olarte (U. Federal do Rio Grande do Norte) ? Federico Olmedo (Universidad de Chile) ? Alberto Pardo (Universidad de la Rep?blica) ? Jorge A. P?rez (University of Groningen) ? Camilo Rocha (Pontificia Universidad Javeriana - Cali) ? Aleksy Schubert (University of Warsaw) ? Ren? Thiemann (University of Innsbruck) ? Renata Wassermann (Universidade de S?o Paulo) Organisers ?? Daniele Nantes (UnB, Brasil) ?? Cristian F. Sottile (UBA, Argentina) ??????????????????//?????????????????? -------------- next part -------------- A non-text attachment was scrubbed... Name: ayala.vcf Type: text/x-vcard Size: 4 bytes Desc: not available URL: From juan.fumero at manchester.ac.uk Tue Mar 9 03:35:59 2021 From: juan.fumero at manchester.ac.uk (Juan Fumero) Date: Tue, 9 Mar 2021 08:35:59 +0000 Subject: [TYPES/announce] Call For Contributions - SPLASH 2021: ACM SIGPLAN Conference on Systems, Programming, Languages, and Applications: Software for Humanity Message-ID: ======================================================================== Combined Call For Papers ACM Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH'21) October 17-22, 2021, Chicago, USA https://2021.splashcon.org/ Follow us on Twitter @splashcon ======================================================================== OUTLINE OF THE COMBINED CALL FOR CONTRIBUTIONS: * OOPSLA * Onward! Papers * Onward! Essays * Call For Workshops * Call For Posters * Student Research Competition (SRC) * Co-located events: * APLAS * Dynamic Languages Symposium (DLS) * GPCE * SAS * SLE ======================================================================== The ACM SIGPLAN conference on Systems, Programming, Languages and Applications: Software for Humanity (SPLASH) embraces all aspects of software construction and delivery to make it the premier conference at the intersection of programming, languages, and software engineering. SPLASH is now accepting submissions. We invite high-quality submissions describing original and unpublished work. ** OOPSLA Research Papers ** Papers that address any aspect of software development are welcome, including requirements, modelling, prototyping, design, implementation, generation, analysis, verification, testing, evaluation, maintenance, reuse, replacement, and retirement of software systems. Papers may address these topics in a variety of ways, including new tools (such as languages, program analyses, and runtime systems), new techniques (such as methodologies, design processes, code organization approaches, and management techniques), and new evaluations (such as formalisms and proofs, corpora analyses, user studies, and surveys). Submissions Due: 16 April 2021 https://2021.splashcon.org/track/splash-2021-oopsla ** Onward! Research Papers ** Onward! is a premier multidisciplinary conference focused on everything to do with programming and software: including processes, methods, languages, communities, and applications. Onward! is more radical, more visionary, and more open than other conferences to ideas that are well-argued but not yet proven. We welcome different ways of thinking about, approaching, and reporting on programming language and software engineering research. Submissions Due: 8 May 2021 https://2021.splashcon.org/track/splash-2021-Onward-papers ** Onward! Essays ** Onward! Essays conference is looking for clear and compelling pieces of writing about topics important to the software community construed broadly. An essay can be an exploration of a topic, its impact, or the circumstances of its creation; it can present a personal view of what is, explore a terrain, or lead the reader in an act of discovery; it can be a philosophical digression or a deep analysis. It can describe a personal journey, perhaps that by which the author reached an understanding of such a topic. The subject area should be interpreted broadly and can include the relationship of software to human endeavours, or its philosophical, sociological, psychological, historical, or anthropological underpinnings. Submissions Due: 22 May 2021 https://2021.splashcon.org/track/splash-2021-Onward-Essays ** Workshops ** The SPLASH Workshops track will host a variety of high-quality workshops, allowing their participants to meet and discuss research questions with peers, to mature new and exciting ideas, and to build up communities and start new collaborations. SPLASH workshops complement the main tracks of the conference and provide meetings in a smaller and more specialized setting. Workshops cultivate new ideas and concepts for the future, optionally recorded in formal proceedings. Early Phase Submissions Due: 19 March 2021 https://2021.splashcon.org/track/splash-2021-Workshops ** SPLASH Posters ** The SPLASH Posters track provides an excellent forum for authors to present their recent or ongoing projects in an interactive setting, and receive feedback from the community. We invite submissions covering any aspect of programming, systems, languages and applications. The goal of the poster session is to encourage and facilitate small groups of individuals interested in a technical area to gather and interact. It is held early in the conference, to promote continued discussion among interested parties. Submissions due: 15 August 2021 https://2021.splashcon.org/track/splash-2021-Posters ** Student Research Competition ** The ACM Student Research Competition (SRC), sponsored by Microsoft Research, offers a unique opportunity for undergraduate and graduate students to present their research to a panel of judges and conference attendees at SPLASH. The SRC provides visibility and exposes up-and-coming researchers to computer science research and the research community. This competition also gives students an opportunity to discuss their research with experts in their field, get feedback, and sharpen their communication and networking skills. To participate in the competition, a student must submit a 2-page description of his or her original research project. The submitted project descriptions are peer-reviewed. Each student whose description is selected by a panel of reviewers is invited to attend the SRC competition at SPLASH and present their work. Winners of the SPLASH competition are invited to participate in the ACM Student Research Competition Grand Finals. Submit your work and take part in the ACM Student Research Competition at SPLASH 2021! Submissions Due: 16 July 2021 https://2021.splashcon.org/track/splash-2021-SRC ** SPLASH-E ** SPLASH-E is a forum for educators to make connections between programming languages research and the ways we educate computer science students. We invite work that could improve or inform computer science educators, especially work that connects with introductory computer science courses, programming languages, compilers, software engineering, and other SPLASH-related topics. Educational tools, experience reports, and new curricula are all welcome. Submissions Due: 16 July 2021 ======================================================================== *** Co-Located Events *** ======================================================================== ** Asian Symposium on Programming Languages and Systems (APLAS) ** The 19th Asian Symposium on Programming Languages and Systems (APLAS). APLAS aims to stimulate programming language research by providing a forum for the presentation of the latest results and the exchange of ideas in programming languages and systems. APLAS is based in Asia but is an international forum that serves the worldwide programming languages community. APLAS 2021 will be held online and co-located with SPLASH 2021. Submissions Due: 16 June 2021 https://conf.researchr.org/home/aplas-2021 ** Dynamic Languages Symposium (DLS) ** DLS is the premier forum for researchers and practitioners to share knowledge and research on dynamic languages, their implementation, and applications. The influence of dynamic languages ? from Lisp to Smalltalk to Python to JavaScript ? on real-world practice and research, continues to grow. We invite high-quality papers reporting original research, innovative contributions, or experience related to dynamic languages, their implementation, and applications. Submissions Due: 2 June 2021 https://conf.researchr.org/home/dls-2021 ** 20th International Conference on Generative Programming: Concepts & Experiences (GPCE) ** GPCE is a venue for researchers and practitioners interested in techniques that use program generation, domain-specific languages, and component deployment to increase programmer productivity, improve software quality, and shorten the time-to-market of software products. In addition to exploring cutting-edge techniques of generative software, our goal is to foster further cross-fertilization between software engineering and the programming languages research communities. Submissions Due: 5th July 2021 https://conf.researchr.org/home/gpce-2021 ** The 28th Static Analysis Symposium (SAS 2021) ** Static analysis is widely recognized as a fundamental tool for program verification, bug detection, compiler optimization, program understanding, and software maintenance. The series of Static Analysis Symposia has served as the primary venue for the presentation of theoretical, practical, and application advances in the area. Submissions Due: 25th April 2021 https://conf.researchr.org/home/sas-2021 ** 13th International ACM SIGPLAN Conference on Software Language Engineering (SLE) ** SLE is the discipline of engineering languages and the tools required for the creation of software. It abstracts from the differences between programming languages, modelling languages, and other software languages, and emphasizes the engineering facet of the creation of such languages, that is, the establishment of the scientific methods and practices that enable the best results. SLE overlaps with traditional conferences on the design and implementation of programming languages, model-driven engineering, and compiler construction, and emphasizes the fusion of their communities. Submissions Due: 21 June 2021 https://conf.researchr.org/home/sle-2021 ======================================================================== SPLASH Information: ======================================================================== SPLASH Early Registration Deadline: 17th September 2021 Website: https://2021.splashcon.org/ ======================================================================== Organizing Committee SPLASH 2021: ======================================================================== SPLASH General Chair: Hridesh Rajan (Iowa State University) OOPSLA Review Committee Chair: Sophia Drossopoulou (Imperial College London) GPCE General Chair: Eli Tilevich (Virginia Tech) GPCE Co-Chair: Coen De Roover (Vrije Universiteit Brussel) GPCE Co-Chair: Erwan Bousse (University of Nantes) SLE General Chair: Eelco Visser (Delft University of Technology) SLE Program Co-Chair: Dimitris Kolovos (University of York) SLE Program Co-Chair: Emma S?derberg (Lund University) SLE Artifact Evaluation Co-Chair: Elias Castegren (KTH) SLE Artifact Evaluation Co-Chair: Andreas Wortmann (RWTH Aachen University) DLS Chair: Arjun Guha (Northeastern University) Onward! Papers Chair: Wolfgang De Meuter (Vrije Universiteit Brussel) Onward! Essays Chair: Elisa Baniassad (University of British Columbia) SPLASH-E Co-Chair: Charlie Curtsinger (Grinnell College) SPLASH-E Co-Chair: Tien N. Nguyen (University of Texas at Dallas) Artifact Evaluation Co-Chair: Colin Gordon (Drexel University) Artifact Evaluation Co-Chair: Ana Milanova (Rensselaer Polytechnic Institute) Artifact Evaluation Co-Chair: Anders M?ller (Aarhus University) Workshops Co-Chair: Mehdi Bagherzadeh (Oakland University) Workshops Co-Chair: Raffi Khatchadourian (City University of New York Hunter College) Student Research Competition Co-Chair: Julia Rubin (University of British Columbia) Publicity Chair: Juan Fumero (University of Manchester) Web Chair: Rangeet Pan (Iowa State University) Student Volunteer Co-Chair: Breno Dantas Cruz (Virginia Tech) Student Volunteer Co-Chair: Samantha Syeda Khairunnesa (Iowa State University) Sponsorship Co-Chair: Ganesha Upadhyaya (Harmony.one) Poster Co-Chair: Christos Dimoulas (PLT @ Northwestern University) Poster Co-Chair: Murali Krishna Ramanathan (Uber Technologies Inc.) Publications Chair: Saba Alimadadi (Simon Fraser University) Accessibility Chair: Sumon Biswas (Iowa State University, USA) ======================================================================== -------------- next part -------------- An HTML attachment was scrubbed... URL: From dom.orchard at gmail.com Tue Mar 9 04:15:36 2021 From: dom.orchard at gmail.com (Dominic Orchard) Date: Tue, 9 Mar 2021 09:15:36 +0000 Subject: [TYPES/announce] Call for papers - Workshop on Type-Driven Development (TyDe 2021) at ICFP 2021 Message-ID: Workshop on Type-Driven Development 2021 (TyDe) co-located with ICFP 2021 ----------------------------------------- https://icfp21.sigplan.org/home/TyDe-2021 ----------------------------------------- May 19: Paper submission deadline May 26: Extended abstract submission deadline # Goals of the Workshop The Workshop on Type-Driven Development (TyDe) aims to show how static type information may be used effectively in the development of computer programs. Co-located with ICFP, this workshop brings together leading researchers and practitioners who are using or exploring types as a means of program development. We welcome all contributions, both theoretical and practical, on a range of topics including: * dependently typed programming; * generic programming; * design and implementation of programming languages, exploiting types in novel ways; * exploiting typed data, data dependent data, or type providers; * static and dynamic analyses of typed programs; * tools, IDEs, or testing tools exploiting type information; * pearls, being elegant, instructive examples of types used in the derivation, calculation, or * construction of programs. # Submission Details Submissions should fall into one of two categories: * regular research papers (12 pages); * extended abstracts (3 pages). The bibliography will not be counted against the page limits for either category. Regular research papers are expected to present novel and interesting research results, and will be included in the formal proceedings. Extended abstracts should report work in progress that the authors would like to present at the workshop. Extended abstracts will be distributed to workshop attendees but will not be published in the formal proceedings. More details can be found on https://icfp21.sigplan.org/home/TyDe-2021 # Important Dates * May 19: Paper submission deadline * May 26: Extended abstract submission deadline * June 16: Author notification * July 1: Camera-ready deadline * August 22: Workshop (tentative) # Program Committee Chairs: * Hsiang-Shang ?Josh? Ko, Institute of Information Science, Academia Sinica, Taiwan (co-chair) * Dominic Orchard, University of Kent, UK (co-chair) Programme Committee: * Kenichi Asai, Ochanomizu University, Japan * Jean-Philippe Bernardy, University of Gothenburg, Sweden * Liang-Ting Chen, Institute of Information Science, Academia Sinica, Taiwan * Ornela Dardha, University of Glasgow, UK * Martin Escardo, University of Birmingham, UK * Patricia Johann, Appalachian State University, USA * Neel Krishnaswami, University of Cambridge, UK * Ana Milanova, Rensselaer Polytechnic Institute, USA * Keiko Nakata, SAP Innovation Center Network, Potsdam, Germany * KC Sivaramakrishnan, IIT Madras, India * Stephanie Weirich, University of Pennsylvania, USA * James Wood, University of Strathclyde, UK * Beta Ziliani, FAMAF, UNC and CONICET, Argentina # Proceedings and Copyright We will have formal proceedings, published by the ACM. Accepted papers will be included in the ACM Digital Library. Authors must grant ACM publication rights upon acceptance, but may retain copyright if they wish. Authors are encouraged to publish auxiliary material with their paper (source code, test data, and so forth). The proceedings will be freely available for download from the ACM Digital Library from one week before the start of the conference until two weeks after the conference. -------------- next part -------------- An HTML attachment was scrubbed... URL: From mail at robbertkrebbers.nl Tue Mar 9 06:07:12 2021 From: mail at robbertkrebbers.nl (Robbert Krebbers) Date: Tue, 9 Mar 2021 12:07:12 +0100 Subject: [TYPES/announce] PhD or postdoc position on program verification and Iris at Radboud University Nijmegen Message-ID: Dear all, I have an opening for a 4 year PhD position at Radboud University. In case of an exceptionally strong candidate, the PhD position can be turned into a postdoc position for 1.5 to 2 years. The project involves the development of automatic methods for program verification based on concurrent separation logic and type systems. You will apply the developed methods to verify security and correctness properties of a realistic hypervisor written in C, as part of an ongoing collaborative project with Google, MPI-SWS, Cambridge, SNU, and Aarhus. The foundations of this project will be developed on top of the Iris framework for concurrent separation logic in the Coq proof assistant. Iris has been developed over the last 5 years in collaboration with MPI-SWS and Aarhus, and has been used by (and received many contributions from) a large network of other institutes (including Boston College, Inria, CNRS, KU Leuven, ITU, UIC, CMU, MIT, and BedRock Systems). See https://iris-project.org/ for the many projects and papers that involve Iris. **Requirements**: You have a strong background in programming language theory and formal verification. You like to work on deep foundational research, and apply your research to verification of real-life software. You are required to have a master's degree (or equivalent) in computer science or mathematics (or you expect to obtain such a degree soon). Prior knowledge of Coq is preferred. **Application**: I will be considering applications until the position is filled (applications before April 1 are preferred). To apply for the position, please send a resume, grade transcript, motivation letter and research statement to me at robbert at cs.ru.nl. If you have questions, do not hesitate to contact me. **Employment conditions**: Radboud University offers an attractive salary (the gross salary of a PhD student starts at 2.395 EUR per month, and increases to 3.061 EUR per month in the last year, based on a 38-hour working week) and excellent employment conditions (including 8% holiday allowance, 8% end-of-year bonus, assistance with family-related support such as child care). See https://www.ru.nl/phd/ for more information. The starting date is flexible, but I would prefer it if you could start as soon as possible. Best regards, Robbert Krebbers Assistant Professor in Computer Science Radboud University Nijmegen, The Netherlands robbert at cs.ru.nl https://robbertkrebbers.nl From giselle.mnr at gmail.com Wed Mar 10 02:44:15 2021 From: giselle.mnr at gmail.com (Giselle Reis) Date: Wed, 10 Mar 2021 10:44:15 +0300 Subject: [TYPES/announce] PxTP 2021: call for papers Message-ID: Call for Papers, PxTP 2021 The Seventh International Workshop on Proof eXchange for Theorem Proving (PxTP) https://pxtp.gitlab.io/2021 21 July 2021, online associated with the CADE-28 conference ## Background The PxTP workshop brings together researchers working on various aspects of communication, integration, and cooperation between reasoning systems and formalisms. The progress in computer-aided reasoning, both automatic and interactive, during the past decades, has made it possible to build deduction tools that are increasingly more applicable to a wider range of problems and are able to tackle larger problems progressively faster. In recent years, cooperation of such tools in larger verification environments has demonstrated the potential to reduce the amount of manual intervention. Examples include the Sledgehammer tool providing an interface between Isabelle and (untrusted) automated provers, and collaboration of the HOL Light and Isabelle systems in the formal proof of the Kepler conjecture. Cooperation between reasoning systems relies on availability of theoretical formalisms and practical tools for exchanging problems, proofs, and models. The PxTP workshop strives to encourage such cooperation by inviting contributions on suitable integration, translation, and communication methods, standards, protocols, and programming interfaces. The workshop welcomes developers of automated and interactive theorem proving tools, developers of combined systems, developers and users of translation tools and interfaces, and producers of standards and protocols. We are interested both in success stories and descriptions of current bottlenecks and proposals for improvement. ## Topics Topics of interest for this workshop include all aspects of cooperation between reasoning tools, whether automatic or interactive. More specifically, some suggested topics are: * applications that integrate reasoning tools (ideally with certification of the result); * interoperability of reasoning systems; * translations between logics, proof systems, models; * distribution of proof obligations among heterogeneous reasoning tools; * algorithms and tools for checking and importing (replaying, reconstructing) proofs; * proposed formats for expressing problems and solutions for different classes of logic solvers (SAT, SMT, QBF, first-order logic, higher-order logic, typed logic, rewriting, etc.); * meta-languages, logical frameworks, communication methods, standards, protocols, and APIs related to problems, proofs, and models; * comparison, refactoring, transformation, migration, compression and optimization of proofs; * data structures and algorithms for improved proof production in solvers (e.g., efficient proof representations); * (universal) libraries, corpora and benchmarks of proofs and theories; * alignment of diverse logics, concepts and theories across systems and libraries; * engineering aspects of proofs (e.g., granularity, flexiformality, persistence over time); * proof certificates; * proof checking; * mining of (mathematical) information from proofs (e.g., quantifier instantiations, unsat cores, interpolants, ...); * reverse engineering and understanding of formal proofs; * universality of proofs (i.e. interoperability of proofs between different proof calculi); * origins and kinds of proofs (e.g., (in)formal, automatically generated, interactive, ...) * Hilbert's 24th Problem (i.e. what makes a proof better than another?); * social aspects (e.g., community-wide initiatives related to proofs, cooperation between communities, the future of (formal) proofs); * applications relying on importing proofs from automatic theorem provers, such as certified static analysis, proof-carrying code, or certified compilation; * application-oriented proof theory; * practical experiences, case studies, feasibility studies. ## Submissions Researchers interested in participating are invited to submit either an extended abstract (up to 8 pages) or a regular paper (up to 15 pages). Submissions will be refereed by the program committee, which will select a balanced program of high-quality contributions. Short submissions that could stimulate fruitful discussion at the workshop are particularly welcome. We expect that one author of every accepted paper will present their work at the workshop. Submitted papers should describe previously unpublished work, and must be prepared using the LaTeX EPTCS class (http://style.eptcs.org). Papers will be submitted via EasyChair, at the PxTP'2021 workshop page (https://easychair.org/conferences/?conf=pxtp-7). Accepted regular papers will appear in an EPTCS volume. ## Important Dates * Abstract submission: April 21, 2021 * Paper submission: April 28, 2021 * Notification: May 26, 2021 * Camera ready versions due: June 16, 2021 * Workshop: July 11, 2021 (online) ## Invited Speakers TBA ## Program Committee * Haniel Barbosa (Universidade Federal de Minas Gerais (UFMG), Belo Horizonte, Brazil) * Denis Cousineau (Mitsubishi, France) * Stefania Dumbrava (ENSIIE, France) * Katalin Fazekas (TU Wien, Austria) * Mathias Fleury (Johannes Kepler University Linz, Austria), co-chair * Predrag Jani?i? (University of Belgrade, Serbia) * Chantal Keller (Universit? Paris-Saclay, France), co-chair * Aina Niemetz (Stanford University, USA) * Jens Otten (University of Oslo, Norway) * Giselle Reis (CMU-Qatar, Qatar) * Geoff Sutcliffe (University of Miami, USA) * Fran?ois Thir? (Nomadic Labs, France) * Sophie Tourret (Max-Planck-Institut f?r Informatik, Germany) * Josef Urban (Czech Institute of Informatics, Czech Republic) ## Previous PxTP Editions * PxTP 2019 (http://pxtp.gforge.inria.fr/2019), affiliated to CADE-27 * PxTP 2017 (https://pxtp.github.io/2017), affiliated to Tableaux 2017, FroCoS 2017 and ITP 2017 * PxTP 2015 (http://pxtp15.lri.fr), affiliated to CADE-25 * PxTP 2013 (http://www.cs.ru.nl/pxtp13), affiliated to CADE-24 * PxTP 2012 (http://pxtp2012.inria.fr), affiliated to IJCAR 2012 * PxTP 2011 (http://pxtp2011.loria.fr), affiliated to CADE-23 From gorel.hedin at cs.lth.se Wed Mar 10 05:29:23 2021 From: gorel.hedin at cs.lth.se (=?utf-8?Q?G=C3=B6rel_Hedin?=) Date: Wed, 10 Mar 2021 11:29:23 +0100 Subject: [TYPES/announce] PhD position in Programming Language Tooling - Lund University, Sweden Message-ID: <72075899-93C2-4F9B-8996-AB520FF5214E@cs.lth.se> We are offering one fully funded PhD position to a qualified candidate with an interest in programming languages (both textual and visual), program analysis, meta programming, and cloud solutions. The goal of the project is to develop general methods for constructing cloud tooling for textual and visual languages. The research will be based on reference attribute grammars, which is a high-level declarative formalism for specifying type analysis and other static analyses of languages, and for generating compilers and other tooling. For more information, see https://cs.lth.se/open-positions/phd-student-in-cloud-based-language-tooling/ *** The deadline for applications is March 30, 2021. *** Prof. G?rel Hedin Department of Computer Science Lund University Sweden From caterina.urban at ens.fr Thu Mar 11 06:54:29 2021 From: caterina.urban at ens.fr (Caterina Urban) Date: Thu, 11 Mar 2021 12:54:29 +0100 Subject: [TYPES/announce] Ralf Jung wins the ETAPS Doctoral Dissertation Award 2021 Message-ID: The European Joint Conferences on Theory and Practice of Software Association is pleased to announce the outcome of the ETAPS Doctoral Dissertation Award 2021. The purpose of the award is to promote and recognize outstanding dissertations in the research areas covered by the four main ETAPS conferences (ESOP, FASE, FoSSaCS, and TACAS). The award is given to the PhD student who has made the most original and influential contribution to the research areas in the scope of the ETAPS conferences, and has graduated in 2020 at a European academic institution. The winner of the second edition of the ETAPS Doctoral Dissertation award is Dr. Ralf Jung (Saarland University) for his dissertation on Understanding and Evolving the Rust Programming Language supervised by Prof. Derek Dreyer. The winner was selected by a committee of international experts. More information is available at: https://www.etaps.org/about/doctoral-dissertation-award/ Candidate dissertations were evaluated with respect to originality, relevance, and impact to the field, as well as the quality of writing. The committee found that Dr. Ralf Jung's dissertation is very well-written and makes several highly original contributions in the area of programming language semantics and verification. The committee was also particularly impressed by the dissertation for its technical depth, the quality and quantity of the associated published work, as well as its relevance and impact both in academia and industry. We offer Dr. Ralf Jung our congratulations and best wishes for his scientific career! The award ceremony will take place online on April 1st, 13h30 - 14h00 CEST, during the ETAPS conference. On that occasion, Ralf will give a presentation of his dissertation. All interested are invited to join! From fisman at seas.upenn.edu Mon Mar 8 03:34:44 2021 From: fisman at seas.upenn.edu (Dana Fisman) Date: Mon, 8 Mar 2021 10:34:44 +0200 Subject: [TYPES/announce] RV 2021 call for papers - RV 2021 the 21st international conference on runtime verification Message-ID: CFP for RV'21 (21ST INTERNATIONAL CONFERENCE ON RUNTIME VERIFICATION) *Important Dates* - Abstract submission: May 13, 2021 - Paper submission: May 20, 2021 - Author notification: July 12, 2021 - Camera-ready version: Aug 2, 2021 - Conference date: Oct 11-14, 2021 (Location: Los Angeles or online, depending on COVID19 situation) Website: https://www.cs.bgu.ac.il/~rv21/ Scope Runtime verification is concerned with the monitoring and analysis of the runtime behaviour of software and hardware systems. Runtime verification techniques are crucial for system correctness, reliability, and robustness; they provide an additional level of rigor and effectiveness compared to conventional testing and are generally more practical than exhaustive formal verification. Runtime verification can be used prior to deployment, for testing, verification, and debugging purposes, and after deployment for ensuring reliability, safety, and security and for providing fault containment and recovery as well as online system repair. Topics of interest to the conference include, but are not limited to: - specification languages for monitoring - monitor construction techniques - program instrumentation - logging, recording, and replay - combination of static and dynamic analysis - specification mining and machine learning over runtime traces - monitoring techniques for concurrent and distributed systems - runtime checking of privacy and security policies - metrics and statistical information gathering - program/system execution visualization - fault localization, containment, recovery and repair - dynamic type checking and assurance cases - runtime verification for autonomy and runtime assurance Application areas of runtime verification include cyber-physical systems, safety/mission critical systems, enterprise and systems software, cloud systems, autonomous and reactive control systems, health management and diagnosis systems, and system security and privacy, among others. Submissions All papers and tutorials will appear in the conference proceedings in an LNCS volume. Submitted papers and tutorials must use the LNCS/Springer style detailed here: http://www.springer.de/comp/lncs/authors.html Papers must be original work and not be submitted for publication elsewhere. Papers must be written in English and submitted electronically (in PDF format) using the EasyChair submission page here: https://easychair.org/conferences/?conf=rv21 The page limitations mentioned below include all text and figures, but exclude references. Additional details omitted due to space limitations may be included in a clearly marked appendix, that will be reviewed at the discretion of reviewers, but not included in the proceedings. At least one author of each accepted paper and tutorial must register and attend RV 2021 to present. PapersThere are four categories of papers which can be submitted: regular, short, tool demo, and benchmark papers. Papers in each category will be reviewed by at least 3 members of the Program Committee. - *Regular Papers* (up to 16 pages, not including references) should present original unpublished results. We welcome theoretical papers, system papers, papers describing domain-specific variants of RV, and case studies on runtime verification. - *Short Papers* (up to 8 pages, not including references) may present novel but not necessarily thoroughly worked out ideas, for example emerging runtime verification techniques and applications, or techniques and applications that establish relationships between runtime verification and other domains. - *Tool Demonstration Papers* (up to 8 pages, not including references) should present a new tool, a new tool component, or novel extensions to existing tools supporting runtime verification. The paper must include information on tool availability, maturity, selected experimental results and it should provide a link to a website containing the theoretical background and user guide. Furthermore, we strongly encourage authors to make their tools and benchmarks available with their submission. - *Benchmark papers* (up to 8 pages, not including references) should describe a benchmark, suite of benchmarks, or benchmark generator useful for evaluating RV tools. Papers should include information as to what the benchmark consists of and its purpose (what is the domain), how to obtain and use the benchmark, an argument for the usefulness of the benchmark to the broader RV community and may include any existing results produced using the benchmark. We are interested in both benchmarks pertaining to real-world scenarios and those containing synthetic data designed to achieve interesting properties. Broader definitions of benchmark e.g. for generating specifications from data or diagnosing faults are within scope. We encourage benchmarks that are tool agnostic, especially if they have been used to evaluate multiple tools. We also welcome benchmarks that contain verdict labels and with rigorous arguments for correctness of these verdicts, and benchmarks that are demonstrably challenging with respect to the state-of-the-art tools. Benchmark papers must be accompanied by an easily accessible and usable benchmark submission. Papers will be evaluated by a separate benchmark evaluation panel who will assess the benchmarks relevance, clarity, and utility as communicated by the submitted paper. The Program Committee of RV 2021 will give a Springer-sponsored *Best Paper Award* to one eligible regular paper. *Special Journal Issue!* The Program Committee of RV 2021 will invite a selection of accepted papers to submit extended versions to a special issue of the International Journal on Software Tools for Technology Transfer (STTT). *Tutorial track* Tutorials are two-to-three-hour presentations on a selected topic. Additionally, tutorial presenters will be offered to publish a paper of up to 20 pages in the LNCS conference proceedings. A proposal for a tutorial must contain the subject of the tutorial, a proposed timeline, a note on previous similar tutorials (if applicable) and the differences to this incarnation, and biographies of the presenters. The proposal must not exceed 2 pages. *Program committee * Lu Feng, University of Virginia (co-Chair) Dana Fisman, Ben Gurion University (co-Chair) Houssam Abbas, Oregon State University Wolfgang Ahrendt, Chalmers University of Technology Domenico Bianculli, SnT Centre - University of Luxembourg Borzoo Bonakdarpour, Michigan State University Radu Calinescu, University of York Chih-Hong Cheng, DENSO AUTOMOTIVE Deutschland GmbH Jyotirmoy Deshmukh, University of Southern California Georgios Fainekos, Arizona State University Yli?s Falcone, University of Grenoble Alpes, CNRS Chuchu Fan, MIT Thomas Ferr?re, Imagination Technologies Bernd Finkbeiner, CISPA Helmholtz Center for Information Security Adrian Francalanza, University of Malta Sylvain Hall?, Universit? du Qu?bec ? Chicoutimi Klaus Havelund, Jet Propulsion Laboratory Bettina K?nighofer, Technical University of Graz Morteza Lahijanian, University of Colorado, Boulder Axel Legay, UCLouvain Martin Leucker, University of Luebeck Chung-Wei Lin, National Taiwan University David Lo, Singapore Management University Leonardo Mariani, University of Milano Bicocca Nicolas Markey, IRISA, CNRS & INRIA & University of Rennes Laura Nenzi, University of Trieste Dejan Nickovic, Austrian Institute of Technology Gordon Pace, University of Malta Nicola Paoletti, University of London Dave Parker, University of Birmingham Doron Peled, Bar Ilan University Violet Ka Pun, Western Norway University of Applied Sciences Giles Reger, The University of Manchester Cesar Sanchez, IMDEA Software Institute Gerardo Schneider, Chalmers University of Gothenburg Julien Signoles, CEA LIST Oleg Sokolsky, University of Pennsylvania Stefano Tonetta, FBK-irst Hazem Torfah, University of California, Berkeley Dmitriy Traytel, University of Copenhagen -------------- next part -------------- An HTML attachment was scrubbed... URL: From ornela.dardha at gmail.com Fri Mar 12 06:29:16 2021 From: ornela.dardha at gmail.com (Ornela Dardha) Date: Fri, 12 Mar 2021 11:29:16 +0000 Subject: [TYPES/announce] EXPRESS/SOS 2021: First Call for Papers Message-ID: <94504FDD-3864-4A38-AE16-ADD20B3D571C@gmail.com> =========================================== FIRST CALL FOR PAPERS Combined 28th International Workshop on Expressiveness in Concurrency and 18th Workshop on Structural Operational Semantics (EXPRESS/SOS 2021) http://icetcs.ru.is/express-sos2021/ Paris (France) August 23, 2021, Affiliated with CONCUR 2021 Submission deadline (full and short papers): Monday, June 21, 2021 =========================================== == INVITED SPEAKERS Amal Ahmed (Northeastern University, USA) Jan Friso Groote (Eindhoven University of Technology, The Netherlands) Dave Parker (University of Birmingham, UK) == SCOPE AND TOPICS The EXPRESS/SOS workshop series aims at bringing together researchers interested in the formal semantics of systems and programming concepts, and in the expressiveness of computational models. Topics of interest for EXPRESS/SOS 2021 include, but are not limited to: - expressiveness and rigorous comparisons between models of computation (process algebras, event structures, Petri nets, rewrite systems) - expressiveness and rigorous comparisons between programming languages and models (distributed, component-based, object-oriented, service-oriented); - logics for concurrency (modal logics, probabilistic and stochastic logics, temporal logics and resource logics); - analysis techniques for concurrent systems; - theory of structural operational semantics (meta-theory, category-theoretic approaches, congruence results); - comparisons between structural operational semantics and other formal semantic approaches; - applications and case studies of structural operational semantics; - software tools that automate, or are based on, structural operational semantics. We especially welcome contributions bridging the gap between the above topics and neighbouring areas, such as, for instance: - computer security - multi-agent systems - programming languages - formal verification - reversible computation - knowledge representation == SUBMISSION GUIDELINES: We invite two types of submissions: * Full papers (up to 15 pages, excluding references). * Short papers (up to 5 pages, excluding references, not included in the workshop proceedings) All submissions should adhere to the EPTCS format (http://www.eptcs.org). Simultaneous submission to journals, conferences or other workshops is only allowed for short papers; full papers must be unpublished. Submission is performed through EasyChair: https://easychair.org/conferences/?conf=expresssos2021 The final versions of accepted full papers will be published in EPTCS. It is understood that for each accepted submission one of the co-authors will register to the workshop and give the talk. We are monitoring the COVID-19 pandemic to decide if the workshop will take place physically in Paris, online or hybrid. Whatever the decision, we will guarantee the possibility of an online participation. == SPECIAL ISSUE There is a long tradition of special issues of reputed international journals devoted to the very best papers presented in prior editions of the workshop. For instance, a special issue of Information and Computation with selected papers from EXPRESS/SOS 2019 and EXPRESS/SOS 2020 is currently in progress. We will consider organising a special issue for EXPRESS/SOS 2021. == IMPORTANT DATES - Paper submission: June 21, 2021 - Notification date: July 26, 2021 - Camera ready version: August 9, 2021 - Workshop: August 23, 2020 == WORKSHOP CO-CHAIRS: Valentina Castiglioni (Reykjavik University, IS) Ornela Dardha (University of Glasgow, UK) == PROGRAM COMMITTEE: Ahmed Bouajjani (IRIF and University of Paris Diderot, France) Valentina Castiglioni (Reykjavik University, Iceland), co-chair Ornela Dardha (University of Glasgow, UK), co-chair Yuxin Deng (East China Normal University, China) David de Frutos-Escrig (Complutense Univeristy of Madird, Spain) Silvia Ghilezan (University of Novi Sad, Serbia) Paola Giannini (University of Piemonte Orientale, Italy) Karoliina Lehtinen (University of Liverpool, UK) Hernan Melgratti (University of Buenos Aires, Argentina) Valeria de Paiva (Samsung Research America, USA, and University of Birmingham, UK) Tatjana Petrov (University of Konstanz, Germany) Sabina Rossi (University Ca' Foscari Venice, Italy) Jurriaan Rot (Radboud University, The Netherlands) == CONTACT Prospective authors are encouraged to contact the co-chairs in case of questions at express-sos21 at easychair.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From kbh at umn.edu Fri Mar 12 20:14:59 2021 From: kbh at umn.edu (Favonia) Date: Fri, 12 Mar 2021 19:14:59 -0600 Subject: [TYPES/announce] Research Programmer in HoTT and Cubical Type Theory Message-ID: We are hiring a research programmer at University of Minnesota to work with us on building next-generation proof assistant technology (broadly defined) based on homotopy type theory and cubical type theory. The ideal candidate would have some knowledge and interest in homotopy and cubical type theory, combined with concrete experience implementing type theoretic proof assistants using modern algorithms, such as bidirectional type checking and normalization-by-evaluation. You will be exposed to the latest research in the field and can get involved in theoretical development of the research ideas. We welcome applicants who do not have a Ph.D. degree---a BA/BS degree is sufficient. The research project is funded by the AFOSR through their MURI program, and your official affiliation would be the University of Minnesota with Favonia being your supervisor. However, you will frequently meet and collaborate with other researchers from Carnegie Mellon University, Wesleyan University, University of San Diego, and other institutions. Especially during the COVID-19 pandemic, most activities will be online, though you will have to be physically in the US. (We may be able to sponsor visas. Contact Favonia for details.) We are interviewing candidates on a rolling basis until a match is found. Candidates applying by the end of March (2021/3/31) would be given priority. Here is the official link for application: https://hr.myu.umn.edu/jobs/ext/339220 Please also drop an email to Favonia so that we can confirm that your application correctly enters the system. If you are a current employee of the University of Minnesota, please use https://hr.myu.umn.edu/jobs/int/339220 instead. # Some further information - What is the annual salary? About $60,000 USD. - When is the expected start date? As soon as you are ready. - How long does this position last? The position will last as long as the project can support it and benefit from it. However, the expectation is that you will be in this position around 1-3 years (negotiable) and may choose to leave early (for example, to start a Ph.D.). Your official contract will be one-year but renewable. - I see that there?s a ?work experience? requirement. What counts as ?work experience?? This requirement exists to satisfy an administrative requirement of the job code at the University of Minnesota. We will recognize a wide range of activities as ?work experience?, such as contributions on GitHub during weekends. **Please document related activities in your CV.** If you are not sure if something counts as work experience, please ask Favonia . - I have more questions! Please send an email to Favonia . Best, Favonia they/them/theirs -------------- next part -------------- An HTML attachment was scrubbed... URL: From andrei.h.popescu at gmail.com Fri Mar 12 20:32:56 2021 From: andrei.h.popescu at gmail.com (Andrei Popescu) Date: Sat, 13 Mar 2021 01:32:56 +0000 Subject: [TYPES/announce] Lecturer in Verification position at University of Sheffield: deadline 29 March 2021 Message-ID: Greetings, The Department of Computer Science at University of Sheffield has an open position of Lecturer in Verification. Details can be found here: https://www.jobs.ac.uk/job/CEF438/lecturer-in-verification Applicants doing research with and on proof assistants are most welcome. Female applicants are particularly encouraged. Best wishes, Andrei From peterol at ifi.uio.no Sat Mar 13 09:37:08 2021 From: peterol at ifi.uio.no (=?utf-8?Q?Peter_Csaba_=C3=98lveczky?=) Date: Sat, 13 Mar 2021 15:37:08 +0100 Subject: [TYPES/announce] CfP: ICTAC'21 (18th International Colloquium on Theoretical Aspects of Computing) Message-ID: --------------------------------------------------------------------- Call for Papers ICTAC 2021 18th International Colloquium on Theoretical Aspects of Computing Nur-Sultan, Kazakhstan, September 6-10, 2021 https://ictac2021.github.io/ --------------------------------------------------------------------- ** ICTAC'21 will most likely be a fully hybrid event due to covid-19 ** ** Springer LNCS proceedings and Theoretical Computer Science special issue ** Important dates: Submission deadline: May 7, 2021 Notification of acceptance: June 18, 2021 Overview and Scope: The ICTAC conference series aims at bringing together researchers and practitioners from academia, industry and government to present research and exchange ideas and experience addressing challenges in both theoretical aspects of computing and the exploitation of theory through methods and tools for system development. ICTAC also aims to promote research cooperation between developing and industrial countries. The conference concerns all aspect of theoretical computer science, including, but not limited to: * languages and automata * semantics of programming languages * logic in computer science * lambda calculus, type theory and category theory * domain-specific languages * theories of concurrency and mobility * theories of distributed computing * models of objects and components * coordination models * timed, hybrid, embedded and cyber-physical systems * security and privacy * static analysis * probabilistic and statistical verification * software verification * software testing * runtime verification * program generation and transformation * model checking and theorem proving * applications and case studies Call for Papers: We solicit submissions, related to the topics of ICTAC, in the following categories: * original research contributions (16 pages max, excluding references); * applications and experiences (16 pages max, excluding references); * short papers, with original work in progress or with proposals of new ideas and emerging challenges (6 pages max, excluding references); and * tool papers (6 pages max, excluding references). All submissions must be original, unpublished, and not submitted concurrently for publication elsewhere. Paper submission is done via EasyChair at https://easychair.org/conferences/?conf=ictac2021. Papers must be formatted according to the guidelines for Springer LNCS papers (see http://www.springer.com/lncs), without modifications of margins and other space-saving measures. Publication: All accepted papers will appear in the proceedings of the conference that will be published as a volume in Springer's Lecture Notes in Computer Science (LNCS) series. The authors of a subset of accepted papers will be invited to submit extended versions of their papers to a special issue of the journal Theoretical Computer Science. Program Chairs: Antonio Cerone, Nazarbayev University, Kazakhstan Peter ?lveczky, University of Oslo, Norway Program Committee: Erika Abraham, RWTH Aachen University, Germany Bernhard K. Aichernig, TU Graz, Austria Musab A. Alturki, Runtime Verification Inc., USA, and King Fahd University of Petroleum and Minerals, Saudi Arabia Etienne Andre, Universite de Lorraine, France Ebru Aydin Gol, Middle East Technical University, Turkey Kyungmin Bae, POSTECH, Korea Maurice ter Beek, ISTI-CNR, Italy Dirk Beyer, LMU Munich, Germany Simon Bliudze, INRIA Lille, France Roberto Bruni, University of Pisa, Italy Antonio Cerone, Nazarbayev University, Kazakhstan Manuel Clavel, Vietnamese-German University, Vietnam Adrian Francalanza, University of Malta, Malta Rob van Glabbeek, Data61, CSIRO, Australia Sergey Goncharov, Friedrich-Alexander University Erlangen-N?rnberg, Germany Jan Friso Groote, Eindhoven University of Technology, The Netherlands Stefan Gruner, University of Pretoria, South Africa Osman Hasan, National University of Sciences and Technology, Pakistan Klaus Havelund, Jet Propulsion Laboratory, USA Kim Larsen, Aalborg University, Denmark Axel Legay, Universite catholique de Louvain, Belgium Martin Leucker, University of Lubeck, Germany Manuel Mazzara, Innopolis University, Russia Catherine Meadows, Naval Research Laboratory, USA Larissa Meinicke, The University of Queensland, Australia Hans de Nivelle, Nazarbayev University, Kazakhstan Kazuhiro Ogata, JAIST, Japan Peter ?lveczky, University of Oslo, Norway Catuscia Palamidessi, Inria, France Elaine Pimentel, Federal University of Rio Grande do Norte, Brazil Jose Proenca, Polytechnic Institute of Porto, Portugal Riadh Robbana, INSAT, Carthage University, Tunisia Gwen Salaun, University Grenoble Alpes, France Davide Sangiorgi, University of Bologna, Italy, and INRIA, France Lutz Schr?der, Friedrich-Alexander University Erlangen-N?rnberg, Germany Volker Stolz, Western Norway University of Applied Sciences, Norway Georg Struth, The University of Sheffield, UK From elaine.pimentel at gmail.com Mon Mar 15 15:08:25 2021 From: elaine.pimentel at gmail.com (Elaine Pimentel) Date: Mon, 15 Mar 2021 16:08:25 -0300 Subject: [TYPES/announce] LFMTP 2021 - 2nd call for papers Message-ID: ============================================================= Call for papers Logical Frameworks and Meta-Languages: Theory and Practice LFMTP 2021 Pittsburgh, USA, 16 July 2021 Affiliated with CADE-28 http://lfmtp.org/workshops/2021/ ============================================================= Abstract submission deadline: 19 April 2021 Paper submission deadline: 26 April 2021 Logical frameworks and meta-languages form a common substrate for representing, implementing and reasoning about a wide variety of deductive systems of interest in logic and computer science. Their design, implementation and their use in reasoning tasks, ranging from the correctness of software to the properties of formal systems, have been the focus of considerable research over the last two decades. This workshop will bring together designers, implementors and practitioners to discuss various aspects impinging on the structure and utility of logical frameworks, including the treatment of variable binding, inductive and co-inductive reasoning techniques and the expressiveness and lucidity of the reasoning process. LFMTP 2021 will provide researchers a forum to present state-of-the-art techniques and discuss progress in areas such as the following: * Encoding and reasoning about the meta-theory of programming languages, logical systems and related formally specified systems. * Theoretical and practical issues concerning the treatment of variable binding, especially the representation of, and reasoning about, datatypes defined from binding signatures. * Logical treatments of inductive and co-inductive definitions and associated reasoning techniques, including inductive types of higher dimension in homotopy type theory * Graphical languages for building proofs, applications in geometry, equational reasoning and category theory. * New theory contributions: canonical and substructural frameworks, contextual frameworks, proof-theoretic foundations supporting binders, functional programming over logical frameworks, homotopy and cubical type theory. * Applications of logical frameworks: proof-carrying architectures, proof exchange and transformation, program refactoring, etc. * Techniques for programming with binders in functional programming languages such as Haskell, OCaml or Agda, and logic programming languages such as lambda Prolog or Alpha-Prolog. Important Dates Abstract submission deadline: Monday April 19 Submission deadline: Monday April 26 Notification to authors: Monday May 31 Final version due: Monday June 14 Workshop date: Friday July 16 Submission In addition to regular papers, we welcome/encourage the submission of "work in progress" reports, in a broad sense. Those do not need to report fully polished research results, but should be of interest for the community at large. Submitted papers should be in PDF, formatted using the EPTCS style guidelines. The length is restricted to 15 pages for regular papers and 8 pages for "Work in Progress" papers. Submission is via EasyChair: https://easychair.org/conferences/?conf=lfmtp2021 Proceedings A selection of the presented papers will be published online in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Invited Speakers * Giselle Reis (CMU-Qatar) * Matthieu Sozeau (Inria) Program Committee * David Baelde (LSV, ENS Paris-Saclay & Inria Paris) * Roberto Blanco (MPI-SP) * Alberto Ciaffaglione (University of Udine) * Claudio Sacerdoti Coen (University of Bologna) * Marina Lenisa (Universit? degli Studi di Udine) * Dennis M?ller (Friedrich-Alexander-University) * Michael Norrish (CSIRO) * Elaine Pimentel (Universidade Federal do Rio Grande do Norte) co-chair * Ulrich Sch?pp (fortiss GmbH) * Kathrin Stark (Princeton University) * Aaron Stump (The University of Iowa) * Nora Szasz (Universidad ORT Uruguay) * Enrico Tassi (Inria) co-chair * Alwen Tiu (The Australian National University) * Tjark Weber (Uppsala University) -- Enrico & Elaine. -------------- next part -------------- An HTML attachment was scrubbed... URL: From serge.autexier at dfki.de Tue Mar 16 15:23:17 2021 From: serge.autexier at dfki.de (Serge Autexier) Date: Tue, 16 Mar 2021 20:23:17 +0100 (CET) Subject: [TYPES/announce] 14th Conference on Intelligent Computer Mathematics (CICM 2021) Final call for papers, Conference Date: July 26-31, 2021 Message-ID: <20210316192317.F0D971A2145F@gigondas.localdomain> Call for Papers formal papers - informal papers - doctoral programme 14th Conference on Intelligent Computer Mathematics - CICM 2021 - July 26-31, 2021 Timisoara, Romania http://www.cicm-conference.org/2021 ---------------------------------------------------------------------- Digital and computational solutions are becoming the prevalent means for the generation, communication, processing, storage and curation of mathematical information. CICM brings together the many separate communities that have developed theoretical and practical solutions for mathematical applications such as computation, deduction, knowledge management, and user interfaces. It offers a venue for discussing problems and solutions in each of these areas and their integration. CICM 2021 Invited Speakers: Alessandro Cimatti (Fondazione Bruno Kessler, Trento, IT) Michael Kohlhase (FAU Erlangen-N?rnberg, Germany) Laura Kovacs (TU Vienna, Austria) Angus McIntyre (London/Edinburgh, UK) CICM 2021 Programme committee: see https://www.cicm-conference.org/2021/cicm.php?event=&menu=pc CICM 2021 invites submissions in all topics relating to intelligent computer mathematics, in particular but not limited to * theorem proving and computer algebra * mathematical knowledge management * digital mathematical libraries CICM appreciates the varying nature of the relevant research in this area and invites submissions of different forms: 1) Formal submissions will be reviewed rigorously and accepted papers will be published in a volume of Springer LNCS: * regular papers (up to 15 pages including references) present novel research results * project and survey papers (up to 15 pages + bibliography) summarize existing results * system and dataset descriptions (up to 5 pages including references) present digital artifacts * system entry (1 page according to the given LaTeX template) provides metadata and a quick overview of a new tool or a new release of an existent tool 2) Informal submissions will be reviewed with a positive bias and selected for presentation based on their relevance for the community. * informal papers may present work-in-progress, project announcements, position statements, etc. * posters and system demos will be presented in parallel in special sessions 3) The doctoral programme provides PhD students with a forum to present early results and receive constructive feedback and mentoring. *** Important Dates *** - Abstract deadline: As soon as possible before the fullpaper submission deadline. - Full paper deadline: March 26 - Reviews sent to authors: May 4 - Rebuttals due: May 8 - Notification of acceptance: May 13 - Camera-ready copies due: May 29 - Conference: July 26-31 Informal submissions and doctoral programme - Submission deadline: May 15 - Notification of acceptance: June 1 All submissions should be made via easychair at https://easychair.org/conferences/?conf=cicm2021 As in previous years, we will publish the CICM 2021 proceedings with Springer LNCS. For the LNCS style files, see: https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines From andrei.h.popescu at gmail.com Wed Mar 17 07:15:39 2021 From: andrei.h.popescu at gmail.com (Andrei Popescu) Date: Wed, 17 Mar 2021 11:15:39 +0000 Subject: [TYPES/announce] 21st Midlands Graduate School in the Foundations of Computing Science: Final Call for Participation Message-ID: FINAL CALL FOR PARTICIPATION 21st Midlands Graduate School in the Foundations of Computing Science MGS 21 12-16 April 2021, virtually https://staffwww.dcs.shef.ac.uk/people/G.Struth/mgs21.html 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 Introductory courses: Category Theory Jacopo Emmenegger, Birmingham Type Theory Thorsten Altenkirch, Nottingham Proof Theory Anupam Das, Birmingham Advanced courses: Homotopy Type Theory Nicolai Kraus, Nottingham Inductive and Coinductive Reasoning with Isabelle/HOL Andrei Popescu, Sheffield Effects and Call-by-Push-Value Paul Levy, Birmingham Formal Modelling and Analysis of Concurrent Systems Mohammad Mousavi, Leicester In addition we are organising a session where participants can briefly present and discuss their own research. A call will be made in March. 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 is April 1. ORGANISATION Please direct all queries about MGS 21 to Georg Struth. The Sheffield organisers are Harsh Beohar (H.Beohar at sheffield.ac.uk) Andrei Popescu (A.Popescu at sheffield.ac.uk) Georg Struth (G.Struth at sheffield.ac.uk) From samuel.mimram at lix.polytechnique.fr Wed Mar 17 08:02:19 2021 From: samuel.mimram at lix.polytechnique.fr (Samuel Mimram) Date: Wed, 17 Mar 2021 13:02:19 +0100 Subject: [TYPES/announce] International Workshop on Confluence (IWC 2021): second call for papers Message-ID: --//----//----//----//----//----//----//----//----//----//----//----//----//-- Second Call For Papers 10th International Workshop on Confluence http://www.lix.polytechnique.fr/iwc2021 July 23, 2021 Collocated with FSCD 2021, July 17-24, 2021 --//----//----//----//----//----//----//----//----//----//----//----//----//-- The 10th International Workshop on Confluence (IWC 2021) aims at promoting further research in confluence and related properties. Confluence provides a general notion of determinism and has always been conceived as one of the central properties of rewriting. Recently there is a renewed interest in confluence research, resulting in new techniques, tool support, certification as well as new applications. The workshop aims at promoting further research in confluence and related properties. Confluence relates to many topics of rewriting (completion, modularity, termination, commutation, etc.) and has been investigated in many formalisms of rewriting such as first-order rewriting, lambda-calculi, higher-order rewriting, constrained rewriting, conditional rewriting, etc. Recently there is a renewed interest in confluence research, resulting in new techniques, tool supports, certification as well as new applications. ## IMPORTANT INFORMATION Due to current travel restrictions in various countries, the meeting will be held **virtually** this year. ## TOPICS - confluence and related properties (unique normal forms, commutation, ground confluence) - completion - critical pair criteria - decidability issues - complexity issues - system descriptions - certification - applications of confluence The objective of this workshop is to bring together theoreticians and practitioners to promote new techniques and results, and to facilitate feedback on the implementation and application of such techniques and results in practice. IWC 2020 also aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. More information can be found on the webpage of the conference: http://www.lix.polytechnique.fr/iwc2021 ## SUBMISSIONS We solicit short papers or extended abstracts of at most five pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and may provide additional feedback. The accepted papers will be made available electronically before the workshop. The page limit for papers is 5 pages in EasyChair style. Short papers or extended abstracts must be submitted electronically through the EasyChair system at: https://easychair.org/conferences/?conf=iwc2021 EasyChair style: http://easychair.org/publications/for_authors ## IMPORTANT DATES - Title and Abstract: ? April 19, 2021 - Paper Submission: ? April 26, 2021 - Notification to authors: ? May 31, 2021 - Workshop date: ? July 23, 2021 ## INVITED SPEAKERS TBD ## PROGRAM COMMITTEE - Beniamino Accatolli (Inria & LIX, ?cole Polytechnique) - Sandra Alves (Universidade do Porto) - Cyrille Chenavier (Universit? de Limoges) - Francisco Dur?n (University of M?laga) - Alejandro D?az-Caro (Universidad Nacional de Quilmes & ICC/UBA-CONICET) - Samuel Mimram (LIX, ?cole Polytechnique), co-chair - Camilo Rocha (Pontificia Universidad Javeriana), co-chair - Femke van Raamsdonk (VU University Amsterdam) - Sarah Winkler (University of Bolzano) ## FSCD 2021 ORGANISING COMMITTEE - FSCD Conference Chair: Alejandro D?az-Caro, Universidad Nacional de Quilmes & ICC (UBA/CONICET) - FSCD Workshop Chairs: Mauricio Ayala-Rinc?n, Universidade de Bras?lia Carlos L?pez Pombo, Universidad de Buenos Aires & ICC (UBA/CONICET) ## CONTACT - Samuel Mimram: samuel.mimram(at)lix.polytechnique.fr - Camilo Rocha: camilo.rocha(at)javerianacali.edu.co From jay.mccarthy at gmail.com Wed Mar 17 09:39:45 2021 From: jay.mccarthy at gmail.com (Jay McCarthy) Date: Wed, 17 Mar 2021 09:39:45 -0400 Subject: [TYPES/announce] Two assistant professor faculty positions (tenure track) at UMass Lowell Message-ID: The University of Massachusetts Lowell Department of Computer Science invites applications for two tenure-track faculty positions at the assistant professor rank, to start in September 2021. We are looking to hire outstanding candidates in all areas of computer science. We will review candidates as they apply. Please visit https://careers.pageuppeople.com/822/lowell/en-us/job/507538/assistant-professor-computer-science-multiple-positions to apply and view more details. Note for Types folks: We are very interested in hiring excellent candidates in PL. Matteo Cimini and I would love company. If you're interested in Cybersecurity, as well, then we have quite a few people in that research to collaborate with. I am very happy to answer any informal queries, Jay McCarthy -- Jay McCarthy Associate Professor @ CS @ UMass Lowell http://jeapostrophe.github.io Vincit qui se vincit. From davide.bresolin at unipd.it Wed Mar 17 11:57:49 2021 From: davide.bresolin at unipd.it (Davide Bresolin) Date: Wed, 17 Mar 2021 16:57:49 +0100 Subject: [TYPES/announce] CFP: GandALF2021 - 12th International Symposium on Games, Automata, Logics, and Formal Verification In-Reply-To: <36285930-73e0-4123-8e76-66e32844bd34@Spark> References: <36285930-73e0-4123-8e76-66e32844bd34@Spark> Message-ID: <4ea56819-d70b-4eac-bd25-42ee8dd30bfd@Spark> ***************************************************************************** CALL FOR PAPERS - GandALF 2021 ***************************************************************************** The 12th International Symposium on Games, Automata, Logics, and Formal Verification will be held in Padua (Italy) on September 20-22, 2021. This year, GANDALF will be organised together with the 3rd Workshop on Artificial Intelligence and fOrmal VERification, Logic, Automata, and sYnthesis (OVERLAY 2021, https://overlay.uniud.it/). The OVERLAY workshop focuses on the relationships between Artificial Intelligence and Formal Methods, and discusses on the opportunities and challenges at the border of the two areas. Both events will be hosted by the University of Padua, and will share some invited speakers. We encourage participation in both events. GANDALF 2021 is planned to be a hybrid conference. We aim at organizing an in-presence event, but there will be possibilities for virtual participation for delegates affected by travel restrictions. https://gandalf2021.math.unipd.it/ ***************************************************************************** The aim of GandALF 2021 is to bring together researchers from academia and industry which are actively working in the fields of Games, Automata, Logics, and Formal Verification. The idea is to cover an ample spectrum of themes, ranging from theory to applications, and stimulate cross-fertilization. Papers focused on formal methods are especially welcome. Authors are invited to submit original research or tool papers on all relevant topics in these areas. Papers discussing new ideas that are at an early stage of development are also welcome. The topics covered by the conference include, but are not limited to, the following: Automata Theory Automated Deduction Computational aspects of Game Theory Concurrency and Distributed computation Decision Procedures Deductive, Compositional, and Abstraction Techniques for Verification Finite Model Theory First-order and Higher-order Logics Formal Languages Formal Methods for Systems Biology, Hybrid, Embedded, and Mobile Systems Games and Automata for Verification Game Semantics Logical aspects of Computational Complexity Logics of Programs Modal and Temporal Logics Model Checking Models of Reactive and Real-Time Systems Probabilistic Models (Markov Decision processes) Program Analysis and Software Verification Reinforcement Learning Run-time Verification and Testing Specification and Verification of Finite and Infinite-state Systems Synthesis IMPORTANT DATES (all dates are AoE) ***************************************************************************** Abstract submission: June 23, 2021 Paper submission: June 30, 2021 Notification: July 30, 2021 Camera-ready: August 30, 2021 Conference: September 20-22, 2021 PUBLICATIONS ***************************************************************************** The proceedings will be published by Electronic Proceedings in Theoretical Computer Science. Authors of the best papers will be invited to submit a revised version of their work to a special issue of an established international journal. The previous editions of GandALF already led to special issues of the International Journal of Foundations of Computer Science (GandALF 2010), Theoretical Computer Science (GandALF 2011 and 2012), Information and Computation (GandALF 2013, 2014, 2016, 2017, 2019 and 2020), and Acta Informatica (GandALF 2015). SUBMISSIONS ***************************************************************************** Submitted papers should not exceed 14 pages (excluding references and clearly marked appendices) using EPTCS format, be unpublished and contain original research. Please use the LaTeX style provided at http://style.eptcs.org to format the paper. For papers reporting experimental results, authors are encouraged to make their data available with their submission. Submissions must be in PDF format and will be handled via the EasyChair Conference system at the following address: https://www.easychair.org/conferences/?conf=gandalf2021 PROGRAM CHAIRS ***************************************************************************** Davide Bresolin, University of Padua (Italy) Pierre Ganty, IMDEA Software Institute, Madrid (Spain) PROGRAM COMMITTEE ***************************************************************************** Mohamed Faouzi Atig, Uppsala University (Sweden) Christel Baier, TU Dresden (Germany) Saddek Bensalem, VERIMAG (France) Nathalie Bertrand, INRIA (France) Pedro Cabalar, University of Corunna (Spain) Thomas Colcombet, CNRS (France) Wojciech Czerwi?ski, University of Warsaw (Poland) Orna Kupferman, Hebrew University (Israel) S?awomir Lasota, University of Warsaw (Poland) Konstantinos Mamouras, Rice University (USA) Roland Meyer, TU Braunschweig (Germany) Marco Montali, Free University of Bozen-Bolzano (Italy) Paritosh Pandya, TIFR (India) Doron Peled, Bar Ilan University (Israel) Guillermo Perez, University of Antwerp (Belgium) R. Ramanujam, Institute of Mathematical Sciences (India) Francesco Ranzato, University of Padua (Italy) Pierre-Alain Reynier, Aix-Marseille Universit? (France) Mark Reynolds, The University of Western Australia (Australia) Ashutosh Trivedi, University of Colorado Boulder (USA) STEERING COMMITTEE ***************************************************************************** Luca Aceto, Reykjavik University (Iceland) Javier Esparza, University of Munich (Germany) Salvatore La Torre, University of Salerno (Italy) Angelo Montanari, University of Udine (Italy) Mimmo Parente, University of Salerno (Italy) Jean-Fran?ois Raskin, Universit? libre de Bruxelles (Belgium) Martin Zimmermann, University of Liverpool (UK) -------------- next part -------------- An HTML attachment was scrubbed... URL: From einarj at ifi.uio.no Wed Mar 17 04:48:01 2021 From: einarj at ifi.uio.no (Einar Broch Johnsen) Date: Wed, 17 Mar 2021 08:48:01 +0000 Subject: [TYPES/announce] PhD Position at U. Oslo: Formal Methods for Probabilistic Programs Message-ID: PhD position available at the University of Oslo Topic: Formal methods for probabilistic programs Application deadline 15 May 2021 We have a PhD position available on formal methods for probabilistic programs at Uni. Oslo with an all-star team of international collaborators including Andrzej Wasowski, Alexandra Silva and Ina Schaefer. This is an exciting position for candidates interested in combining logic, statistics and programming in their PhD research, and who have enjoyed topics such as foundations of programming languages, probability theory and statistics, executable models and operational semantics, formal methods and concurrency theory. More information: https://www.jobbnorge.no/en/available-jobs/job/202841/phd-research-fellowship-in-formal-methods-for-probabilistic-programs ??? Einar Broch Johnsen, University of Oslo, Norway einarj at ifi.uio.no From albargah at gmail.com Tue Mar 16 13:00:05 2021 From: albargah at gmail.com (Aws Albarghouthi) Date: Tue, 16 Mar 2021 12:00:05 -0500 Subject: [TYPES/announce] CFP: MAPS 21: 5th Annual Symposium on Machine Programming Message-ID: The 5th Annual Symposium on Machine Programming (previously Machine Learning and Programming Languages) # Call for Papers Due to recent algorithmic and computational advances, machine learning has seen a surge of interest in both research and practice. From natural language processing to self-driving cars, machine learning is creating new possibilities that are changing the way we live and interact with computers. However, the impact of these advances on programming languages remains mostly untapped. Yet, incredible research opportunities exist when combining machine learning and programming languages in novel ways. This symposium seeks to bring together programming language and machine learning communities to encourage collaboration and exploration in the areas of mutual benefit. The symposium will include a combination of rigorous peer-reviewed papers and invited events. The symposium will seek papers on a diverse range of topics related to programming languages and machine learning including (and not limited to): Application of machine learning to compilation and run-time scheduling Collaborative human / computer programming (i.e., conversational programming) Deterministic and stochastic program synthesis Infrastructure and techniques for mining and analyzing large code bases Interoperability between machine learning frameworks and existing code bases Probabilistic and differentiable programming Programming language and compiler support for machine learning applications Programming language support and implementation of machine learning frameworks Neurosymbolic and intentional programming # Website https://pldi21.sigplan.org/home/maps-2021#the-5th-annual-symposium-on-machine-programming # Evaluation Criteria As in previous years, reviewers will evaluate each contribution for its significance, originality, and clarity to the topics listed above. Submissions should clearly state how their novelty and how they improve upon existing work. Evaluation will be double-blind and papers must be properly anonymized. This means that author names and affiliations must be omitted from the submission. Additionally, if the submission refers to prior work done by the authors, that reference should be made in third person. These are firm submission requirements. If you have questions about making your paper double blind, please contact the Program Chair. Broader Impact. Due to the growing concerns regarding potential positive and negative impacts of any research work, this year, the authors of MAPS submissions are asked to include a section on the potential broader impact of their work. This section should highlight an evaluation of potential misuses and negative impacts of the presented technology on its users and those indirectly affected, such as their friends and families, communities, society, and the planet. Authors should ponder and discuss the negative outcomes of their research 1) using its current form, 2) if enhanced in the future with new capabilities. They should also discuss potential ways to mitigate those harms (policy, law, alternative design choice, etc.). The broader impact section will be outside the page limit of the original paper. This section should be at least one paragraph but should not exceed 1 page. Although this section is a must-have, this year, the decision to accept the paper will not be influenced by the discussed negative impacts. However, it might influence the acceptance decision in future MAPS. # Paper Submissions Submissions must be in English. Papers should be in PDF and format and no more than 8 pages in standard two-column SIGPLAN conference format including figures and tables but excluding references and appendices. Submissions must be made through the online submission site (TBD). All accepted papers will appear in the published proceedings and available on the ACM Digital Library. Authors will have the option of having their final paper accessible from the workshop website as well. Authors must be familiar with and abide by SIGPLAN?s republication policy, which forbids simultaneous submission to multiple venues and requires disclosing prior publication of closely related work. General Chair: Roopsha Samanta (Purdue University) Program Chair: Isil Dillig (University of Texas at Austin) Publicity Chair: Aws Albarghouthi (University of Wisconsin Madison) Ethics Chair: Jesmin Jahan Tithi (Intel Labs, ACM-FCA, ACM COPE) # Program Committee: Farhana Aleen (Nvidia) Dana Drachsler Cohen (Technion) Niranjan Hasabnis (Intel Labs) Rania Khalaf (IBM TJ Watson) Vinod Grover (Nvidia) Kuldeep Meel (National University of Singapore) Erik Meijer (Facebook) Sasa Misailovic (University of Illinois at Urbana?Champaign) Augustus Odena (Google) Alex Polozov (Microsoft Research) Alex Ratner (University of Washington) Calvin Smith (UT Austin) # Steering Committee: Raj Barik (Uber) Alvin Cheung (UC Berkeley) Stefano Ermon (Stanford University) Justin Gottschlich (Chair, Intel Labs and UPenn) Costin Iancu (Lawrence Berkeley National Lab) Kunle Olukotun (Stanford University) Tatiana Shpeisman (Google Brain) Armando Solar-Lezama (MIT) Mayur Naik (University of Pennsylvania) -- Aws From ruzica.piskac at yale.edu Wed Mar 17 13:15:22 2021 From: ruzica.piskac at yale.edu (Ruzica Piskac) Date: Wed, 17 Mar 2021 13:15:22 -0400 Subject: [TYPES/announce] Call for Papers - FMCAD 2021 Message-ID: <039b0e92-1e36-2317-2dcb-915607d4e7a1@yale.edu> ***************************************************************************** CALL FOR PAPERS - FMCAD 2021 ***************************************************************************** International Conference on Formal Methods in Computer-Aided Design (FMCAD) Yale University, 2021 https://fmcad.org/FMCAD21/ IMPORTANT DATES Abstract Submission: May 7, 2021 Paper Submission: May 14, 2021 Author Response: June 23-25, 2021 Author Notification: July 2, 2021 Camera-Ready Version: August 16, 2021 Early registration: September 15, 2021 All deadlines are 11:59 pm AoE (Anywhere on Earth) FMCAD Tutorial Day: Oct. 19, 2021 Regular Program: Oct. 20-22, 2021 Part of the FMCAD 2021 program FMCAD Student Forum Co-located with FMCAD VSTTE 2021 CONFERENCE SCOPE AND PUBLICATION FMCAD 2021 is the twenty-first in a series of conferences on the theory and applications of formal methods in hardware and system verification. FMCAD provides a leading forum to researchers in academia and industry for presenting and discussing groundbreaking methods, technologies, theoretical results, and tools for reasoning formally about computing systems. FMCAD covers formal aspects of computer-aided system design including verification, specification, synthesis, and testing. FMCAD employs a rigorous peer-review process. Accepted papers are published by TU Wien Academic Press under a Creative Commons license (the authors retain the copyright) and distributed through the IEEE XPlore digital library. There are no publication fees. At least one of the authors is required to register for the conference and present the accepted paper. A small number of outstanding FMCAD submissions will be considered for inclusion in a Special Issue of the journal on Formal Methods in System Design (FMSD). TOPICS OF INTEREST FMCAD welcomes submission of papers reporting original research on advances in all aspects of formal methods and their applications to computer- aided design. Topics of interest include (but are not limited to): * Model checking, theorem proving, equivalence checking, abstraction and reduction, compositional methods, decision procedures at the bit- and word-level, probabilistic methods, combinations of deductive methods and decision procedures. * Synthesis and compilation for computer system descriptions, modeling, specification, and implementation languages, formal semantics of languages and their subsets, model-based design, design derivation and transformation, correct-by-construction methods. * Application of formal and semi-formal methods to functional and non-functional specification and validation of hardware and software, including timing and power modeling, verification of computing systems on all levels of abstraction, system-level design and verification for embedded systems, cyber-physical systems, automotive systems and other safety-critical systems, hardware-software co-design and verification, and transaction-level verification. * Experience with the application of formal and semi-formal methods to industrial-scale designs; tools that represent formal verification enablement, new features, or a substantial improvement in the automation of formal methods. * Application of formal methods to verifying safety, connectivity and security properties of networks, distributed systems, smart contracts, block chains, and IoT devices. SUBMISSIONS Submissions must be made electronically in PDF format via EasyChair: https://easychair.org/my/conference/?conf=fmcad21 Two categories of papers are invited: Regular papers, and Tool & Case Study papers. Regular papers are expected to offer novel foundational ideas, theoretical results, or algorithmic improvements to existing methods, along with experimental impact validation where applicable. Tool & Case Study papers are expected to report on the design, implementation or use of verification (or related) technology in a practically relevant context (which need not be industrial), and its impact on design processes. Both Regular and Tool & Case study papers must use the IEEE Transactions format on letter-size paper with a 10-point font size. Papers in both categories can be either 8 pages (long) or 4 pages (short) in length not including references. Short papers that describe emerging results, practical experiences, or original ideas that can be described succinctly are encouraged. Authors will be required to select an appropriate paper category at abstract submission time. Submissions may contain an optional appendix, which will not appear in the final version of the paper. The reviewers should be able to assess the quality and the relevance of the results in the paper without reading the appendix. Submissions in both categories must contain original research that has not been previously published, nor is concurrently submitted for publication. Any partial overlap with published or concurrently submitted papers must be clearly indicated. If experimental results are reported, authors are strongly encouraged to provide the reviewers access to their data at submission time, so that results can be independently verified. The review process is single blind. Authors of accepted contributions will be required to sign the FMCAD copyright transfer form found here: https://fmcad.or.at/pdf/copyright.pdf . STUDENT FORUM Continuing the tradition of the previous years, FMCAD 2021 is hosting a Student Forum that provides a platform for graduate students at any career stage to introduce their research to the wider Formal Methods community, and solicit feedback. Submissions for the event must be short reports describing research ideas or ongoing work that the student is currently pursuing, and must be within the scope of FMCAD. Work, part of which has been previously published, will be considered; the novel aspect to be addressed in future work must be clearly described in such cases. All submissions will be reviewed by a select group of FMCAD program committee members. FMCAD 2021 COMMITTEES *PROGRAM CHAIRS*: Ruzica Piskac Yale University Michael Whalen Amazon, Inc and the University of Minnesota *PC*: Erika Abraham RWTH Aachen University Jade Alglave University College London Pranav Ashar Real Intent Per Bjesse Synopsys Inc. Roderick Bloem Graz University of Technology Ivana Cerna Masaryk University Supratik Chakraborty IIT Bombay Sylvain Conchon Universite Paris-Sud Leonardo de Moura Microsoft Rayna Dimitrova CISPA Helmholtz Center for Information Security Grigory Fedyukovich Florida State University Arie Gurfinkel University of Waterloo Liana Hadarean Amazon Web Services, Inc. Ziyad Hanna Cadence Design Systems Fei He Tsinghua University Marijn Heule Carnegie Mellon University Warren Hunt The University of Texas at Austin Alexander Ivrii IBM Dejan Jovanovi? SRI International Alan Jovi? FER Zagreb Laura Kovacs??? ??? Vienna University of Technology Ton Chanh Le Stevens Institute of Technology Rebekah Leslie-Hurd Intel Kuldeep Meel National University of Singapore Elizabeth Polgreen University of California, Berkeley Andrew Reynolds University of Iowa Cristoph Scholl University of Freiburg Natasha Sharygina Universit? della Svizzera italiana (USI Lugano, Switzerland) Anna Slobodova Centaur Technology Christoph Sticksel The Mathworks Murali Talupur Amazon Web Services, Inc. Jean-Baptiste Tristram Boston College Yakir Vizel Technion Thomas Wahl Northeastern University Georg Weissenbacher Vienna University of Technology Thomas Wies New York University Valentin W?stholz ConsenSys Lenore Zuck University of Illinois in Chicago *STUDENT FORUM CHAIR*: Mark Santolucito Barnard College *PUBLICATION CHAIR*: Georg Weissenbacher TU Wien *SPONSORSHIP CHAIR*: Daniel Schoepe Amazon Web Services, Inc. *FMCAD STEERING COMMITTEE*: Clark Barrett Stanford University, CA, USA Armin Biere Johannes Kepler University in Linz, Austria Georg Weissenbacher TU Vienna, Austria Anna Slobodova Centaur Technology, TX, USA -------------- next part -------------- An HTML attachment was scrubbed... URL: From genaim at gmail.com Sun Mar 21 04:40:42 2021 From: genaim at gmail.com (Samir Genaim) Date: Sun, 21 Mar 2021 09:40:42 +0100 Subject: [TYPES/announce] WST 2021 - Call for Papers Message-ID: ====================================================================== WST 2021 - Call for Papers 17th International Workshop on Termination http://costa.fdi.ucm.es/wst2021 July 16, 2021, Pittsburgh, PA, United States Co-located with CADE-28 *** The Workshop will be Virtual *** ====================================================================== The Workshop on Termination (WST) traditionally brings together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop also provides a ground for cross-fertilization of ideas from the different communities interested in termination (e.g., working on computational mechanisms, programming languages, software engineering, constraint solving, etc.). The friendly atmosphere enables fruitful exchanges leading to joint research and subsequent publications. IMPORTANT DATES: * submission deadline: April 25, 2021 * notification: May 30, 2021 * final version due: June 13, 2021 * workshop: July 16, 2021 INVITED SPEAKERS: TBA TOPICS: The 17th International Workshop on Termination welcomes contributions on all aspects of termination. In particular, papers investigating applications of termination (for example in complexity analysis, program analysis and transformation, theorem proving, program correctness, modeling computational systems, etc.) are very welcome. Topics of interest include (but are not limited to): * abstraction methods in termination analysis * certification of termination and complexity proofs * challenging termination problems * comparison and classification of termination methods * complexity analysis in any domain * implementation of termination methods * non-termination analysis and loop detection * normalization and infinitary normalization * operational termination of logic-based systems * ordinal notation and subrecursive hierarchies * SAT, SMT, and constraint solving for (non-)termination analysis * scalability and modularity of termination methods * termination analysis in any domain (lambda calculus, declarative programming, rewriting, transition systems, etc.) * well-founded relations and well-quasi-orders SUBMISSION GUIDELINES: Submissions are short papers/extended abstracts which should not exceed 5 pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and provides additional feedback for each submission. The accepted papers will be made available electronically before the workshop. Papers should be submitted electronically via the submission page: https://easychair.org/conferences/?conf=wst2021 Please, use LaTeX and the LIPIcs style file http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz to prepare your submission. PROGRAM COMMITTEE: * Martin Avanzini - INRIA Sophia, Antipolis * Carsten Fuhs - Birkbeck, U. of London * Samir Genaim (chair) - U. Complutense de Madrid * J?rgen Giesl - RWTH Aachen * Matthias Heizmann - U. of Freiburg * Cynthia Kop - Radboud U. Nijmegen * Salvador Lucas - U. Polit?cnica de Val?ncia * ?tienne Payet - U. de La R?union * Albert Rubio - U. Complutense de Madrid * Ren? Thiemann - U. of Innsbruck -------------- next part -------------- An HTML attachment was scrubbed... URL: From tobycmurray at googlemail.com Mon Mar 22 02:34:03 2021 From: tobycmurray at googlemail.com (Toby Murray) Date: Mon, 22 Mar 2021 17:34:03 +1100 Subject: [TYPES/announce] Call for Papers: HotSpot 2021 Message-ID: ================================================================ HotSpot 2021: 7th Workshop on Hot topics in the Principles of Security and Trust Co-located with EuroS&P 2021, 7--11th September 2021 in Vienna, Austria http://hotspot.compute.dtu.dk Organized by the Theory of Security working group IFIP WG 1.7. ================================================================ Aim and scope ============= The principles of security and trust remain an area of intense and creative work. This work is focused primarily on defining security and trust goals, developing methods to verify that systems meet those goals, and to synthesize systems that meet those goals by construction. The areas of interest for HotSpot cut across many application areas, including hardware-software connections, vulnerability discovery and program verification, distributed and cloud systems, big data, machine learning for (and against) security and privacy, and single-purpose systems such as voting, electronic currency and smart contracts. The areas of interest are unified however by a focus on rigorous models and reasoning, clear semantics, and a balance between proof and empirical methods. Format ====== The one-day workshop will be divided into a sequence of four main sessions. Some sessions will be devoted to a set of talks on related topics, both with invited talks and submitted papers. We expect the session topics to be drawn from the following list: Privacy and information flow Properties of voting protocols Machine-learning for (and against) security Hardware basis of security Vulnerability discovery and program verification Distributed ledger technologies Cyber-physical systems Submissions on all formally-grounded topics related to security, privacy and trust are welcome. They can either be (a) an informal submission, consisting of an abstract or a paper that may appear formally elsewhere. (b) a full submission, to be included in an IEEE Xplore volume accompanying the main IEEE EuroS&P 2021 proceedings. See submission instructions on our website: http://hotspot.compute.dtu.dk PC == Catherine Meadows Catuscia Palamidessi Jan Juerjens Jean-Jacques Quisquater Joshua Guttman Lucca Hirschi Mark D. Ryan Peter Y. A. Ryan Pierpaolo Degano Sebastian M?dersheim (co-chair) Steve Schneider Toby Murray (chair) Important Dates =============== Workshop papers submission: May 02, 2021 Workshop notification date: June 01, 2021 Workshop final papers: July 02, 2021 Workshop date: September 06, 2021 Submission instructions ======================= See http://hotspot.compute.dtu.dk From p.l.lumsdaine at gmail.com Mon Mar 22 08:31:47 2021 From: p.l.lumsdaine at gmail.com (Peter LeFanu Lumsdaine) Date: Mon, 22 Mar 2021 12:31:47 +0000 Subject: [TYPES/announce] 2-year researcher position in HoTT, Stockholm University; deadline 9 April Message-ID: Dear all, I?m pleased to announce that we?re hiring for a researcher position in Homotopy Type Theory at Stockholm University. It?s a 2 year position, provisionally starting this August, in the logic group of the Mathematics Department, supported by the Wallenberg Foundation project grant ?Type Theory for Mathematics and Computer Science? (PI Thierry Coquand). The application deadline is 9 April. We welcome all applicants interested in working on homotopy type theory and related topics ? either with previous background in HoTT, or with background in related fields but interested in moving into HoTT. Full details and application at https://www.su.se/english/about-the-university/work-at-su/available-jobs?rmpage=job&rmjob=14506&rmlang=UK Departmental webpage: https://www.math.su.se Please get in touch with me if you have any questions about the position! Best, ?Peter. -------------- next part -------------- An HTML attachment was scrubbed... URL: From h.basold at liacs.leidenuniv.nl Mon Mar 22 09:47:40 2021 From: h.basold at liacs.leidenuniv.nl (Henning Basold) Date: Mon, 22 Mar 2021 14:47:40 +0100 Subject: [TYPES/announce] TYPES 2021: Call for Contributions Message-ID: <159dbeb4-a8c1-b3cd-e17f-9fc9a54dcfa2@liacs.leidenuniv.nl> Call for Contributions TYPES 2021 26th International Conference on Types for Proofs and Programs 14 - 19 June 2021 Virtual and possibly Leiden, The Netherlands https://types21.liacs.nl/ Background -------------- The TYPES meetings are a forum to present new and on-going work in all aspects of type theory and its applications, especially in formalised and computer assisted reasoning and computer programming. The TYPES areas of interest include, but are not limited to: * Foundations of type theory and constructive mathematics; * Applications of type theory (e.g., linguistics or concurrency); * Dependently typed programming; * Industrial uses of type theory technology; * Meta-theoretic studies of type systems; * Proof assistants and proof technology; * Automation in computer-assisted reasoning; * Links between type theory and functional programming; * Formalising mathematics using type theory; * Homotopy type theory and univalent mathematics. We encourage talks proposing new ways of applying type theory. In the spirit of workshops, talks may be based on newly published papers, work submitted for publication, but also work in progress. Contributed Talks -------------------- TYPES solicits contributed talks to stimulate discussions. The contributed talks are selected on the base of extended abstracts/short papers of 2 pages (excluding bibliography) formatted with the LaTeX EasyChair3.5 (https://easychair.org/publications/for_authors) style. An abstract can be based on existing, submitted or novel work, and is not in conflict with any other forms of publication. Submissions are handled via EasyChair: https://easychair.org/conferences/?conf=types2021 Upon submission, authors have to select the category of their contribution: presentation-only talks and talks with the intent to contribute to the post-proceedings. Presentation-only talks will consist of a 5 minutes recorded video that is shown during the conference in combination with 5 minutes live discussion. The purpose of recording the talk beforehand is to avoid technical issues. Talks with the intent for post-proceedings submission get a slot for a 10 minutes live talk plus 5 minutes discussion during the conference. The idea is that in this case, an interactive discussion with more in-depth feedback will help to submit to the post-proceedings. Note that the selection at this stage only expresses an intent to submit to the post-proceedings, and that you are neither obliged to submit your work nor are you excluded from the submission to the post-proceedings should you not submit an intent at this stage. The idea is only to help you with more feedback during the conference. Please be fair in selecting this category because the time in a virtual conference is very limited and should be given to those authors who really need it. Important dates ------------------ * Submission of abstract 16 April 2021 AoE * Author notification 14 May 2021 * Camera-ready version of abstract 4 June 2021 AoE * Conference 14 - 18 June 2021 Camera-ready versions of the accepted contributions will be published in an informal book of abstracts for distribution during the conference. Venue ---------- This year?s TYPES will be held virtually (online), possibly in combination with a physical meeting in Leiden in the Netherlands if the political situation permits that. That the conference is held virtually constraints the time of talks, and complicates exchange and collaboration. TYPES 2021 will therefore not only consist of presentations, but also a setup of working groups that get together throughout the week. Every day will be split into a session of talks and tutorials, and a collaboration session during which the working groups will get together. The hope is that we can retain at least some of the exchange and chatter that is the heart of the TYPES conference series. Attendance and Fees ----------------------- Despite the difficulty that a virtual event brings, it also offers a chance. We will make TYPES as inclusive as possible, which means that attending virtually is free of charge, if you are not in the position to pay fees. For everyone else, the fees will be low and only to cover the costs of setting up the infrastructure and organisation. Should it be possible that we can have a hybrid virtual-physical meeting, then there will also be some costs for recording and streaming that will have to be shared between local and virtual attendees. However, we will keep these low in general and free for those who cannot afford to pay fees. About Types --------------- The TYPES meetings from 1990 to 2008 were annual workshops of a sequence of five EU funded networking projects. From 2009 to 2015, TYPES has been run as an independent conference series. From 2016, TYPES is partially supported by COST Action EUTypes CA15123. Previous TYPES meetings were held in Antibes (1990), Edinburgh (1991), B?stad (1992), Nijmegen (1993), B?stad (1994), Torino (1995), Aussois (1996), Kloster Irsee (1998), L?keberg (1999), Durham (2000), Berg en Dal near Nijmegen (2002), Torino (2003), Jouy-en-Josas near Paris (2004), Nottingham (2006), Cividale del Friuli (2007), Torino (2008), Aussois (2009), Warsaw (2010), Bergen (2011), Toulouse (2013), Paris (2014), Tallinn (2015), Novi Sad (2016), Budapest (2017), Braga (2018), Oslo (2019) and Turin (2020). Post-proceedings ------------------- Similarly to TYPES 2011 and TYPES 2013-2020, a post-proceedings volume will be published in the Leibniz International Proceedings in Informatics (LIPIcs) series. Submission to that volume will be open to everyone. Tentative dates for post-proceedings: * Non-binding intent (abstract) 29 October 2021 * Paper submission 26 November 2021 * Author notification 25 March 2022 The formal call with binding dates for the post-proceedings will be issued after the conference. Contact ----------- Email: types21 at liacs.leidenuniv.nl Web form: https://types21.liacs.nl/contact/ Programme Committee --------------------- Henning Basold (LIACS -- Leiden University) (chair) Stefano Berardi (Universit? di Torino) Marc Bezem (University of Bergen) Fr?d?ric Blanqui (INRIA -- ENS Paris-Saclay) Sandrine Blazy (INRIA -- University of Rennes) Ana Bove (Chalmers / U. of Gothenburg) Paolo Caprotti (TU Darmstadt) Jesper Cockx (TU Delft) Jos? Esp?rito Santo (University of Minho) Herman Geuvers (Radboud University Nijmegen) Silvia Ghilezan (University of Novi Sad) Nicolai Kraus (U. of Nottingham) Sergue? Lenglet (Univ. de Lorraine) Assia Mahboubi (INRIA -- Nantes and VU Amsterdam) Ralph Matthes (IRIT -- CNRS and University of Toulouse) Keiko Nakata (Kyoto University) Fredrik Nordvall Forsberg (University of Strathclyde) Jorge A. P?rez (University of Groningen) Gabriel Scherer (INRIA Saclay) Aleksy Schubert (University of Warsaw) Niccol? Veltri (Tallin UT) Stephanie Weirich (U. of Pennsylvania) Organiser ------------ Henning Basold (LIACS -- Leiden University) -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_signature Type: application/pgp-signature Size: 665 bytes Desc: OpenPGP digital signature URL: From mjp.pereira at fct.unl.pt Mon Mar 22 14:45:05 2021 From: mjp.pereira at fct.unl.pt (Mario Pereira) Date: Mon, 22 Mar 2021 18:45:05 +0000 Subject: [TYPES/announce] SBLP 2021 - First Call for Papers Message-ID: [ Please distribute, apologies for multiple postings. ] ================================================================= Call for Papers - XXV Brazilian Symposium on Programming Languages (SBLP 2021) Online, September 27 - October 1, 2021 Conference website: http://cbsoft2021.joinville.udesc.br/sblp.php Submission link: https://easychair.org/conferences/?conf=sblp2021 SBLP 2021 is the 25th edition of the Brazilian Symposium on Programming Languages. It is promoted by the Brazilian Computer Society (SBC) and constitutes a forum for researchers, students and professionals to present and discuss ideas and innovations in the design, definition, analysis, implementation and practical use of programming languages. SBLP's first edition was in 1996. Since 2010, it has been part of CBSoft, the Brazilian Conference on Software: Theory and Practice. The symposium is planned to take place from September 27 to October 1, 2021, fully online. Submission Guidelines ___________________________________________ Papers can be written in Portuguese or English. Submissions in English are encouraged because only accepted papers written in English will appear in the proceedings indexed in the ACM Digital Library. The acceptance of a paper implies that at least one of its authors will register for the symposium to present it. Papers must be original and not simultaneously submitted to another journal or conference. SBLP 2021 will use a lightweight double-blind review process. The manuscripts should be submitted for review anonymously (i.e., without listing the author?s names on the paper) and references to own work should be made in the third person. Papers must be submitted electronically (in PDF format) via the Easychair System: https://easychair.org/conferences/?conf=sblp2021 The following paper categories are welcome (page limits include figures, references and appendices): Full papers: up to 8 pages long in ACM 2-column conference format, available at http://www.acm.org/publications/proceedings-template Full papers can be further specialized, at submission time, as Student papers (i.e., as papers describing research conducted mainly by a student at any level). Student papers will be subject to the exact same reviewing process and criteria, but may be entitled for an award (see below). Short papers: up to 3 pages in the same format. Short papers can discuss new ideas which are at an early stage of development or can report partial results of on-going dissertations or theses. Awards: Two best paper awards will be attributed, distinguishing full paper submissions of the best: ? student paper; ? non-student paper. List of Topics (related but not limited to the following) ___________________________________________ ? Programming paradigms and styles, scripting and domain-specific languages and support for real-time, service-oriented, multi-threaded, parallel, distributed, and quantum programming ? Program generation and transformation ? Formal semantics and theoretical foundations: denotational, operational, algebraic and categorical ? Program analysis and verification, type systems, static analysis, and abstract interpretation ? Programming language design and implementation, programming, language environments, compilation and interpretation techniques ? Programming languages for the blockchain technology: design and implementation of Smart Contract languages, implementation of consensus protocols, language-based security and cryptographic primitives Publication ___________________________________________ SBLP proceedings will be published in ACM's digital library. A selection of the best papers appearing in the 2019 and 2020 editions of SBLP have been invited to be extended and considered for publication in a special issue of the Journal of Computer languages (COLA), by Elsevier. We will approach COLA for a similar special issue regarding the 2021 edition of SBLP. Important dates ___________________________________________ Abstract submission: 9 May, 2021 Paper submission: 16 May, 2021 Author notification: 09 July, 2021 Camera ready deadline: 23 July, 2021 Program Committee ___________________________________________ * Program Committee Chair: - Jo?o Paulo Fernandes, Universidade do Porto, Portugal * Publicity Chair: - M?rio Pereira, NOVA LINCS & Universidade Nova de Lisboa, Portugal * Program Committee: - Adrien Guatto, Universit? de Paris, CNRS, IRIF, France - Alberto Pardo, Universidad de la Rep?blica, Uruguay - Alcides Fonseca, Universidade de Lisboa, Portugal - Alejandro D?az-Caro, Universidad Nacional de Quilmes & ICC (CONICET / UBA), Argentina - Alex Kavvos, University of Bristol, UK - Anderson Faustino da Silva, Universidade Estadual de Maring?, Brazil - Andrei Rimsa, Centro Federal de Educa??o Tecnol?gica de Minas Gerais, Brazil - Arthur Azevedo de Amorim, Boston University, Brazil - Bruno Oliveira, University of Hong Kong, Hong Kong - Caterina Urban, INRIA & ?cole Normale Sup?rieure | Universit? PSL, France - Cl?udio Louren?o, Huawei Research, UK - Cristiano Vasconcellos, Universidade do Estado de Santa Catarina, Brazil - Dalvan Griebler, Pontif?cia Universidade Cat?lica do Rio Grande do Sul (PUCRS) / Sociedade Educacional Tr?s de Maio (Setrem), Brazil - Emmanuel Chailloux, Sorbonne Universit?, France - Eric Van Wyk, University of Minnesota, USA - Fernando Castor, Universidade Federal do Pernambuco, Brazil - Fernando Pereira, Universidade Federal de Minas Gerais, Brazil - Francisco Junior, Universidade Federal do Cear?, Brazil - Francisco Sant'anna, Universidade do Estado do Rio de Janeiro, Brazil - Jean-Christophe Filli?tre, CNRS/Universit? Paris-Saclay, France - L?on Gondelman, University of Aarhus, Denmark - Lourdes Gonz?lez Huesca, Universidad Nacional Aut?noma de M?xico, Mexico - Luiz Fernandes, Pontif?cia Universidade Cat?lica do Rio Grande do Sul, Brazil - Marcos Viera, Universidad de la Rep?blica, Uruguay - M?rio Pereira, NOVA LINCS & Universidade Nova de Lisboa, Portugal - Mauro Jaskelioff, Universidad Nacional de Rosario, Argentina - Noemi Rodriguez, Pontif?cia Universidade Cat?lica do Rio de Janeiro, Brazil - Paul Leger, Universidad Cat?lica del Norte, Chile - Roberto Bigonha, Universidade Federal de Minas Gerais, Brazil - Roberto Ierusalimschy, Pontif?cia Universidade Cat?lica do Rio de Janeiro, Brazil - Rodrigo Ribeiro, Universidade Federal de Ouro Preto, Brazil - Rui Pereira, HASLab/INESC Tec, Portugal - Samuel Feitosa, Instituto Federal de Santa Catarina, Brazil - S?rgio Medeiros, Universidade Federal do Rio Grande do Norte, Brazil - Sim?o Melo de Sousa, NOVA-LINCS & Universidade da Beira Interior, Portugal - Stefania Dumbrava, ?cole Nationale Sup?rieure d'Informatique pour l'industrie et l'Entreprise, France - St?phane Lengrand, Stanford Research Institute, USA Contact ___________________________________________ All questions about submissions should be emailed to Jo?o Paulo Fernandes (jpaulo at fe.up.pt) -------------- next part -------------- An HTML attachment was scrubbed... URL: From bruno.bernardo at tutanota.com Mon Mar 22 16:49:56 2021 From: bruno.bernardo at tutanota.com (Bruno Bernardo) Date: Mon, 22 Mar 2021 21:49:56 +0100 (CET) Subject: [TYPES/announce] FMBC 2021 - Call for Papers Message-ID: [ Please distribute, apologies for multiple postings. ] ======================================================================== 3rd International Workshop on Formal Methods for Blockchains (FMBC) - First Call https://fmbc.gitlab.io/2021 July 18 or 19 (TBA), 2021 Co-located with the 33nd International Conference on Computer-Aided Verification (CAV 2021) http://i-cav.org/2021/ ------------------------------------------------------------- IMPORTANT DATES -------------------------------- Abstract submission: April 22, 2021 Full paper submission: April 29, 2021 Notification: June 10, 2021 Camera-ready: July 8, 2021 Workshop: July 18 or 19 (TBA), 2021 Deadlines are Anywhere on Earth: https://en.wikipedia.org/wiki/Anywhere_on_Earth -------------------------------- -------------------------------- TOPICS OF INTEREST -------------------------------- Blockchains are decentralized transactional ledgers that rely on cryptographic hash functions for guaranteeing the integrity of the stored data. Participants on the network reach agreement on what valid transactions are through consensus algorithms. Blockchains may also provide support for Smart Contracts. Smart Contracts are scripts of an ad-hoc programming language that are stored in the Blockchain and that run on the network. They can interact with the ledger?s data and update its state. These scripts can express the logic of possibly complex contracts between users of the Blockchain. Thus, Smart Contracts can facilitate the economic activity of Blockchain participants. With the emergence and increasing popularity of cryptocurrencies such as Bitcoin and Ethereum, it is now of utmost importance to have strong guarantees of the behavior of Blockchain software. These guarantees can be brought by using Formal Methods. Indeed, Blockchain software encompasses many topics of computer science where using Formal Methods techniques and tools are relevant: consensus algorithms to ensure the liveness and the security of the data on the chain, programming languages specifically designed to write Smart Contracts, cryptographic protocols, such as zero-knowledge proofs, used to ensure privacy, etc. This workshop is a forum to identify theoretical and practical approaches of formal methods for Blockchain technology. Topics include, but are not limited to: * Formal models of Blockchain applications or concepts * Formal methods for consensus protocols * Formal methods for Blockchain-specific cryptographic primitives or protocols * Design and implementation of Smart Contract languages * Verification of Smart Contracts -------------------------------- -------------------------------- SUBMISSION -------------------------------- Submit original manuscripts (not published or considered elsewhere) with a page limit of 12 pages for full papers and 6 pages for short papers (excluding bibliography and short appendix of up to 5 additional pages). Alternatively you may also submit an extended abstract of up to 3 pages (including bibliography) summarizing your ongoing work in the area of formal methods and blockchain. Authors of selected extended-abstracts are invited to give a short lightning talk. Submission link: https://easychair.org/conferences/?conf=fmbc2021 Authors are encouraged to use LaTeX and prepare their submissions according to the instructions and styling guides for OASIcs provided by Dagstuhl. Instructions for authors: https://submission.dagstuhl.de/documentation/authors#oasics At least one author of an accepted paper is expected to present the paper at the workshop as a registered participant. -------------------------------- -------------------------------- PROCEEDINGS -------------------------------- All submissions will be peer-reviewed by at least three members of the program committee for quality and relevance. Accepted regular papers (full and short papers) will be included in the workshop proceedings, published as a volume of the OpenAccess Series in Informatics (OASIcs) by Dagstuhl. -------------------------------- -------------------------------- INVITED SPEAKER -------------------------------- To be confirmed -------------------------------- -------------------------------- PROGRAM COMMITTEE -------------------------------- PC CO-CHAIRS * Bruno Bernardo (Nomadic Labs, France) (bruno at nomadic-labs.com) * Diego Marmsoler (University of Exeter, UK) (D.Marmsoler at exeter.ac.uk) PC MEMBERS To be confirmed From pdownen at cs.uoregon.edu Mon Mar 22 20:02:44 2021 From: pdownen at cs.uoregon.edu (Paul Downen) Date: Mon, 22 Mar 2021 17:02:44 -0700 Subject: [TYPES/announce] OPLSS 2021 - Oregon Programming Languages Summer School Message-ID: We are pleased to announce the program of the 19th annual Oregon Programming Languages Summer School (OPLSS) to be held *online* from June 14th to June 26th, 2021. The theme for this year is "Foundations of Programming and Security." The registration deadline is April 30th, 2021. Full information on registration can be found here: https://www.cs.uoregon.edu/Activities/summerschool This year, OPLSS will be a little different. The registration rates have been updated to reflect the fact that OPLSS will be fully virtual. In consideration of the current circumstances, there are now three categories for registration: * Students & Postdocs: Free * Professors & Industrial Professionals: $250 * Others: For those for which the professional registration fee would pose an economic burden, please contact us for more details. Some examples include: people on temporary hiatus due to the pandemic; unemployed or retired professionals. To help the online lectures and discussion sessions run smoothly, we request volunteers to contribute to one of these roles: * Scribe: Prepare written notes for certain lectures. * Lecture assistant: Gather & relay questions to the speaker. Please contact us during registration to indicate your interest in one of these roles. The speakers and topics include: Stephanie Balzer ? Carnegie Melon University Session-Typed Concurrent Programming Ugo Dal Lago ? University of Bologna >From Program Equivalences to Program Metrics Robert Harper ? Carnegie Melon University Principles of Programming Languages Justin Hsu ? University of Wisconsin?Madison Reasoning about Probabilistic Programs Patricia Johann ? Appalachian State University Semantics of Advanced Data Types Alejandro Russo ? Chalmers University Information-flow Control Libraries Alexandra Silva ? University College London Kleene Algebras and Applications Nikhil Swamy ? Microsoft Research Proof-oriented Programming in F* Tarmo Uustalu ? Reykjavik University Monads and Interaction More information about these topics can be found at: https://www.cs.uoregon.edu/research/summerschool/summer21/topics.php We hope you can join us for this excellent program! Zena Ariola, Marco Gaboardi, and Paul Downen [image: OPLSS_Logo.png] -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: OPLSS_Logo.png Type: image/png Size: 29413 bytes Desc: not available URL: From peter.mueller at inf.ethz.ch Tue Mar 23 03:22:11 2021 From: peter.mueller at inf.ethz.ch (Mueller Peter) Date: Tue, 23 Mar 2021 07:22:11 +0000 Subject: [TYPES/announce] Call for participation: 1st Rust Verification Workshop Message-ID: <605624d8df9444bb82c1afc66a03b5a3@inf.ethz.ch> 1st Rust Verification Workshop Online, co-located with ETAPS 2021 April 07, 09, and 12, 2021, 16:00 - 18:10 GMT https://sites.google.com/view/rustverify2021 Rust is a new programming language for writing performant code with strong type and memory safety guarantees. It is now considered a serious alternative to C and C++ for systems programming, because it provides high-level abstractions but without the cost of garbage collection. Given the growing popularity of Rust, and given that bugs in systems programs can be costly, there is growing interest in the program verification community for building program verifiers for Rust. In this workshop, we aim to bring together language designers, application developers and formal verification tool builders, to exchange ideas and build collaborations around developing verified Rust programs. The goal of this workshop is to bring researchers from a variety of different backgrounds and perspectives together to exchange new and exciting ideas concerning the verification of Rust programs and exploring avenues for collaboration. The program will contains a combination of invited talks and contributed talks. A detailed schedule is available here: https://sites.google.com/view/rustverify2021. Registration Please register via ETAPS at https://etaps.org/2021/registration. You will receive access information once you have registered. Organizers: * Rajeev Joshi, Amazon Web Services * Nicholas Matsakis, Amazon Web Services * Peter M?ller, ETH Zurich -------------- next part -------------- An HTML attachment was scrubbed... URL: From casperbp at gmail.com Tue Mar 23 05:41:23 2021 From: casperbp at gmail.com (Casper Bach Poulsen) Date: Tue, 23 Mar 2021 10:41:23 +0100 Subject: [TYPES/announce] PhD Position in Programming Languages at TU Delft Message-ID: Dear all, I have an opening for a 4 year PhD position in the Programming Languages Group at Delft University of Technology. The PhD position is about defining and implementing typed programming languages in a modular way. The ideal candidate will have experience with one or more of the following topics: - functional programming - monads and/or algebraic effects and handlers - programming language engineering (interpreters/compilers/type checkers/...) The full ad (link below) contains suggestions for topics that can be explored as part of the PhD. But the topic is not limited to the suggestions in the ad. Get in touch if you are interested in doing research on defining and implementing typed programming languages, modularly. https://www.academictransfer.com/en/298133/phd-position-dynamic-semantics-specification/ The deadline for application is 2 June 2021, and the ideal start date is around September. Best regards, Casper Bach Poulsen Assistant Professor, Delft University of Technology http://casperbp.net -------------- next part -------------- An HTML attachment was scrubbed... URL: From d.pym at ucl.ac.uk Tue Mar 23 06:44:12 2021 From: d.pym at ucl.ac.uk (Pym, David) Date: Tue, 23 Mar 2021 10:44:12 +0000 Subject: [TYPES/announce] Faculty position at UCL, London Message-ID: Open position at UCL: Lecturer or Associate Professor, Programming Principles, Logic, and Verification (PPLV). The Department of Computer Science at University College London (UCL, https://www.ucl.ac.uk) invites applications for a faculty position (Lecturer or Associate Professor) in the area of Programming Principles, Logic, and Verification (PPLV, http://pplv.cs.ucl.ac.uk/welcome/). The PPLV group (see http://pplv.cs.ucl.ac.uk/welcome/) conducts world-leading research broadly in logic, semantics, and program and systems verification and their supporting mathematical and conceptual fields. The group contributes to the delivery of undergraduate and graduate programs and supports a lively and diverse community of PhD students and post-doctoral researchers. The group has very substantial research funding from a variety of sources and has excellent connections with the world-class tech community that is located close-by in London and elsewhere. For this position, we particularly welcome applications from candidates with interests in the theory or practice of program and systems verification. UCL is an elite institution that attracts students and staff of the highest quality. London is one of the world?s greatest cities and offers excellent quality of life. We seek world-class talent; candidates must have an outstanding research track record. UCL?s faculty are expected to carry world-class research, publish in top-tier venues, obtain research funding, deliver high-quality undergraduate and post-graduate teaching, supervise doctoral students, engage with the community, and contribute to the management of their department and the College. Candidates will be expected to carry out research, teaching, and administrative duties within the Department, especially in the areas of Programming Principles, Logic, and Verification. Enquiries: David Pym (Head of PPLV, d.pym at ucl.ac.uk, http://www.cs.ucl.ac.uk/staff/D.Pym/) or Steve Hailes (Head of Computer Science, s.hailes at ucl.ac.uk) Closing date: 7 May 2021 UCL: www.ucl.ac.uk UCL CS: https://www.ucl.ac.uk/computer-science/ PPLV: http://pplv.cs.ucl.ac.uk/welcome/ UCL HR page, including how to apply: https://atsv7.wcn.co.uk/search_engine/jobs.cgi?amNvZGU9MTg3NTE5MSZ2dF90ZW1wbGF0ZT05NjYmb3duZXI9NTA0MTE3OCZvd25lcnR5cGU9ZmFpciZicmFuZF9pZD0wJnZhY194dHJhNTA0MTE3OC41MF81MDQxMTc4PTkyNzg2JnZhY3R5cGU9MTI3MSZwb3N0aW5nX2NvZGU9MjI0&jcode=1875191&vt_template=966&owner=5041178&ownertype=fair&brand_id=0&vac_xtra5041178.50_5041178=92786&vactype=1271&posting_code=224 From d.pym at ucl.ac.uk Tue Mar 23 10:27:42 2021 From: d.pym at ucl.ac.uk (Pym, David) Date: Tue, 23 Mar 2021 14:27:42 +0000 Subject: [TYPES/announce] Research position at UCL, London Message-ID: Research position at UCL, London: Research Fellow in Programming Principles, Logic, and Verification: Systems Security Modelling The PPLV group conducts world-leading research in logical and algebraic methods and their applications to program and systems modelling and verification. The Interface Reasoning for Interacting Systems (IRIS) project, led by Professor David Pym, uses logical and algebraic methods to understand the compositional structure of systems and their communications, seeking to develop analyses at all scales, from code through distributed systems to organizational structure, generically and uniformly. Applicants must hold, or be about to receive, a PhD in rigorous computer science, or a closely related area. The post holder will demonstrate the following criteria: - actively contribute to both the theory and implementation of interfaces and composition in a distributed systems modelling context, construction of models - possess a solid grounding and understanding of process algebras and modal logics coupled with a strong programming background, including experience with or the ability to learn the Julia language - demonstrable experience or ability to work with industrial partners (from HP labs and BT) and academic partners from UCL and other institutions as part of the project is essential. In addition the knowledge of or interest in learning about computer security, networks, and information systems management will be essential to succeeding in this post. This post will contribute to the EPSRC-funded IRIS project: Interface Reasoning for Interacting Systems. Part of the IRIS project is concerned with looking at organizational policy decisions and how they affect the performance of the organization in different dimensions, such as efficiency and security. Modelling tools can be used to help decision makers understand the behaviour of a system and how it will behave given different policy decisions. Organizations are complex systems, with technical, structural, human, and policy components that interact in complex ways. To deal with this complexity, compositional approaches are needed, where parts of the system can be modelled independently and combined together according to rigorously specified interfaces. The purpose of this job is to develop and apply the methodology and tools required to construct models that capture the structure, dynamics, and policy of organizations. This will involve working with companies, including BT and HP Labs, to create models to help them make decisions about their real-world challenges. Enquiries: David Pym (d.pym at ucl.ac.uk, http://www.cs.ucl.ac.uk/staff/D.Pym/) or Tristan Caulfield (t.caulfield at ucl.ac.uk, https://www.tristancaulfield.com) Closing date: 18 April 2021 UCL: www.ucl.ac.uk UCL CS: https://www.ucl.ac.uk/computer-science/ PPLV: http://pplv.cs.ucl.ac.uk/welcome/ Information Security: http://sec.cs.ucl.ac.uk/home/ UCL HR page, including how to apply: https://atsv7.wcn.co.uk/search_engine/jobs.cgi?SID=amNvZGU9MTg3NTUwOCZ2dF90ZW1wbGF0ZT05NjUmb3duZXI9NTA0MTE3OCZvd25lcnR5cGU9ZmFpciZicmFuZF9pZD0wJmpvYl9yZWZfY29kZT0xODc1NTA4JnBvc3RpbmdfY29kZT0yMjQ= From ifl21.publicity at gmail.com Wed Mar 24 11:59:09 2021 From: ifl21.publicity at gmail.com (Pieter Koopman) Date: Wed, 24 Mar 2021 08:59:09 -0700 Subject: [TYPES/announce] IFL2021 First call for papers Message-ID: ================================================================================ IFL 2021 33rd Symposium on Implementation and Application of Functional Languages venue: online 1 - 3 September 2021 https://ifl21.cs.ru.nl ================================================================================ Scope The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2021 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. Industrial track and topics of interest This year's edition of IFL explicitly solicits original work concerning *applications* of functional programming in industry and academia. These contributions will be reviewed by experts with an industrial background. Topics of interest to IFL include, but are not limited to: * language concepts * type systems, type checking, type inferencing * compilation techniques * staged compilation * run-time function specialisation * run-time code generation * partial evaluation * (abstract) interpretation * meta-programming * generic programming * automatic program generation * array processing * concurrent/parallel programming * concurrent/parallel program execution * embedded systems * web applications * (embedded) domain-specific languages * security * novel memory management techniques * run-time profiling performance measurements * debugging and tracing * testing and proofing * virtual/abstract machine architectures * validation, verification of functional programs * tools and programming techniques * applications of functional programming in the industry, including ** functional programming techniques for large applications ** successes of the application functional programming ** challenges for functional programming encountered ** any topic related to the application of functional programming that is interesting for the IFL community Post-symposium peer-review Following IFL tradition, IFL 2021 will use a post-symposium review process to produce the formal proceedings. Before the symposium authors submit draft papers. These draft papers will be screened by the program chairs to make sure that they are within the scope of IFL. The draft papers will be made available to all participants at the symposium. Each draft paper is presented by one of the authors at the symposium. After the symposium every presenter is invited to submit a full paper, incorporating feedback from discussions at the symposium. Work submitted to IFL may not be simultaneously submitted to other venues; submissions must adhere to ACM SIGPLAN's republication policy. The program committee will evaluate these submissions according to their correctness, novelty, originality, relevance, significance, and clarity, and will thereby determine whether the paper is accepted or rejected for the formal proceedings. We plan to publish these proceedings in the International Conference Proceedings Series of the ACM Digital Library, as in previous years. Moreover, the proceedings will also be made publicly available as open access. Important dates Submission deadline of draft papers: 17 August 2021 Notification of acceptance for presentation: 19 August 2021 Registration deadline: 30 August 2021 IFL Symposium: 1-3 September 2021 Submission of papers for proceedings: 6 December 2021 Notification of acceptance: 3 February 2022 Camera-ready version: 15 March 2022 ### Submission details All contributions must be written in English. Papers must use the ACM two columns conference format, which can be found at: http://www.acm.org/publications/proceedings-template Peter Landin Prize The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honoured article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. Organisation IFL 2021 Chairs: Pieter Koopman and Peter Achten, Radboud University, The Netherlands IFL Publicity chair: Pieter Koopman, Radboud University, The Netherlands PC (under construction): Peter Achten (co-chair) - Radboud University, Netherlands Thomas van Binsbergen - University of Amsterdam, Netherlands Edwin Brady - University of St. Andrews, Scotland Laura Castro - University of A Coru?a, Spain Youyou Cong - Tokyo Institute of Technology, Japan Olaf Chitil - University of Kent, England Andy Gill - University of Kansas, USA Clemens Grelck - University of Amsterdam, Netherlands John Hughes - Chalmers University, Sweden Pieter Koopman (co-chair) - Radboud University, Netherlands Cynthia Kop - Radboud University, Netherlands Jay McCarthey - University of Massachussetts Lowell, USA Neil Mitchell - Facebook, England Jan De Muijnck-Hughes - Glasgow University, Scotland Keiko Nakata - SAP Innovation Center Potsdam, Germany Jurri?n Stutterheim - Standard Chartered, Singapore Simon Thompson - University of Kent, England Melinda T?th - E?tvos Lor?nd University, Hungary Phil Trinder - Glasgow University, Scotland Meng Wang - University of Bristol, England Vikt?ria Zs?k - E?tvos Lor?nd University, Hungary Virtual symposium Because of the Covid-19 pandemic, this year IFL 2021 will be an online event, consisting of paper presentations, discussions and virtual social gatherings. Registered participants can take part from anywhere in the world. Acknowledgments This call-for-papers is an adaptation and evolution of content from previous instances of IFL. We are grateful to prior organisers for their work, which is reused here. [image: beacon] -------------- next part -------------- An HTML attachment was scrubbed... URL: From james.cheney at gmail.com Wed Mar 24 12:29:16 2021 From: james.cheney at gmail.com (James Cheney) Date: Wed, 24 Mar 2021 16:29:16 +0000 Subject: [TYPES/announce] CfP: International Symposium on Database Programming Languages (DBPL 2021) @ VLDB 2021 Message-ID: ****************************************************************************** 2nd CALL FOR PAPERS The 18th International Symposium on Database Programming Languages (DBPL 2021) In conjunction with VLDB 2021 August 16th, 2021, Copenhagen, Denmark Submission: May 2nd 2021 Web: https://sites.google.com/view/dbpl2021 ****************************************************************************** ** Important Message on Covid-19 ** We are monitoring the evolution of the covid-19 pandemic. Currently we plan to operate the workshop for 1/2 a day as a physical workshop and 1/2 a day as an online virtual event. ** Aims of the Workshop ** For over 30 years, DBPL has established itself as the principal venue for publishing and discussing new ideas and problems at the intersection of data management and programming languages. Many key contributions relevant to the formal foundations, design, implementation, and evaluation of query languages (e.g., for object-oriented, nested, or semi-structured data) were first announced at DBPL. As an established destination for such new ideas, DBPL aims to solicit submissions from researchers in databases, programming languages or any other community interested in the design, implementation or foundations of languages and systems for data-centric computation. Our main goal is to provide an interdisciplinary venue where current trends, and open problems as well as insights about research methodology for potential solutions can be shared and discussed between the two communities. ** Topics of Interest ** Suggested, but not exclusive, topics of interest for submissions include: - Language-Integrated Query Mechanisms - Emerging and Nontraditional Data Models - Compiling Query Languages to Modern Hardware - Data-Centric Programming Abstractions, Comprehensions, Monads - Data Integration, Exchange, and Interoperability - Data Synchronization and Bidirectional Transformations - Declarative Data Centers (e.g., distributed query processing, serverless computing platforms, social computing platforms, etc) - Language-Based Security in Data Management - Managing Uncertain and Imprecise Information - Metaprogramming and Heterogeneous Staged Computation - Programming Language Support for Data-Centric Programming (e.g., databases, web programming, machine learning, etc) - Query Compilation and In-memory Databases - Query Language Design and Implementation - Query Transformation and Optimization - Schema Mapping and Metadata Management - Semantics and Verification of Database Systems - Stream Data Processing and Query Languages - Type and Effect Systems for Data-Centric Programming ** Workshop Chairs ** - Amir Shaikhha, University of Edinburgh - Norman May, SAP SE ** Program Comittee ** - Evelyne Contejean (Universit?? Paris-Sud) - Fritz Henglein (University of Copenhagen) - Jan Hidders (Birkbeck, University of London) - Vojin Jovanovic (Oracle) - Oleg Kiselyov (Tohoku University) - Thomas Neumann (TU Munich) - Nate Nystrom (RelationalAI) - Lionel Parreaux (Hong Kong University of Science and Technology) - Manuel Rigger (ETH Zurich) - Maximilian Schleich (University of Washington) - Kai Zeng (Alibaba) ** Important Dates ** - Paper submission: May 2nd 2021 PT - Notification of acceptance: June 7th 2021 PT - Workshop: August 16th 2021 PT ** Submission ** Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Submissions should be no more than 10 pages long using the ACM Standard proceedings template. Short papers of at most 4 pages using the ACM Standard proceedings template describing work in progress, demos, research challenges or visions are also welcome. Accepted short papers may be included or excluded from the formal proceedings, whichever the author(s) prefer. Each submission should begin with a succinct statement of the problem and a summary of the main results. Authors may provide more details to substantiate the main claims of the paper by including a clearly marked appendix at the end of the submission, which is not included in the page limit and is read at the discretion of the committee. Review is single-blind, so authors do not need to anonymize their submissions. PC submissions are allowed, except for the co-chairs. At least one author of each accepted paper must attend the symposium to present their work. Accepted papers will be included within the informal online proceedings at the website. Additionally, all accepted papers will be published online in the ACM digital library. Therefore, the papers must include the standard ACM copyright notice on the first page. For further information on the conference, venue, further CfPs, formatting instructions, submission guidelines, please refer to the DBPL 2021 website: https://sites.google.com/view/dbpl2021/. We very much look forward to your submissions, Amir Shaikhha and Norman May -------------- next part -------------- An HTML attachment was scrubbed... URL: From anupamdotdas at gmail.com Wed Mar 24 16:10:52 2021 From: anupamdotdas at gmail.com (anupamdotdas at gmail.com) Date: Wed, 24 Mar 2021 20:10:52 -0000 Subject: [TYPES/announce] TABLEAUX 2021 - 2nd Call for Papers. 6-9 September, 2021. Birmingham, UK. Message-ID: <00b601d720e9$caccd7d0$60668770$@gmail.com> TABLEAUX 2021 The 30th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods Birmingham, UK, September 6-9, 2021 Website: https://tableaux2021.org/ Submission deadlines: 19 April (abstract), 26 April 2021 (paper) GENERAL INFORMATION The 30th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2021) will be hosted by the University of Birmingham, UK, 6-9 September 2021. TABLEAUX is the main international conference at which research on all aspects -- theoretical foundations, implementation techniques, systems development and applications -- of tableaux-based reasoning and related methods is presented. The first TABLEAUX conference was held in Lautenbach near Karlsruhe, Germany, in 1992. Since then it has been organised on an annual basis (sometimes as a part of IJCAR). TABLEAUX 2021 will be co-located with the 13th International Symposium on Frontiers of Combining Systems (FroCoS 2021). The conferences will provide a rich programme of workshops, tutorials, invited talks, paper presentations and system descriptions. SCOPE OF CONFERENCE Tableaux and other proof based methods offer convenient and flexible tools for automated reasoning for both classical and non-classical logics. Areas of application include verification of software and computer systems, deductive databases, knowledge representation and its required inference engines, teaching, and system diagnosis. Topics of interest include but are not limited to: * tableau methods for classical and non-classical logics (including first-order, higher-order, modal, temporal, description, hybrid, intuitionistic, linear, substructural, fuzzy, relevance and non-monotonic logics) and their proof-theoretic foundations; * sequent, natural deduction, labelled, nested and deep calculi for classical and non-classical logics, as tools for proof search and proof representation; * related methods (SMT, model elimination, model checking, connection methods, resolution, BDDs, translation approaches); * flexible, easily extendable, light-weight methods for theorem proving; novel types of calculi for theorem proving and verification in classical and non-classical logics; * systems, tools, implementations, empirical evaluations and applications (provers, proof assistants, logical frameworks, model checkers, etc.); * implementation techniques (data structures, efficient algorithms, performance measurement, extensibility, etc.); * extensions of tableau procedures with conflict-driven learning; * techniques for proof generation and compact (or humanly readable) proof representation; * theoretical and practical aspects of decision procedures; * applications of automated deduction to mathematics, software development, verification, deductive and temporal databases, knowledge representation, ontologies, fault diagnosis or teaching. We also welcome papers describing applications of tableau procedures to real-world examples. Such papers should be tailored to the TABLEAUX community and should focus on the role of reasoning and on logical aspects of the solution. SUBMISSION GUIDELINES Submissions are invited in the following two categories: (A) research papers reporting original theoretical research or applications, with length up to 15 pages excluding references; (B) system descriptions, with length up to 9 pages excluding references. There will also be a later call inviting position papers and brief reports on work-in-progress. Details will be kept up to date on the website. Submissions will be reviewed by the PC, possibly with the help of external reviewers, taking into account readability, relevance and originality. Any additional material (going beyond the page limit) can be included in a clearly marked appendix, which will be read at the discretion of the committee and must be removed for the camera-ready version. For category (A) submissions, the reported results must be original and not submitted for publication elsewhere. For category (B) submissions, a working implementation must be accessible via the internet. Authors are encouraged to publish the implementation under an open source license. The aim of a system description is to make the system available in such a way that people can use it, understand it, and build on it. Accepted papers in categories (A) and (B) will be published in the conference proceedings. Papers must be edited in LaTeX using the llncs style and must be submitted electronically as PDF files via the EasyChair system: https://easychair.org/conferences/?conf=tableaux21 For all accepted papers at least one author is required to register to the conference and present the paper. A title and a short abstract of about 100 words must be submitted before the paper submission deadline. Formatting instructions and the LNCS style files can be obtained at: http://www.springer.com/br/computer-science/lncs/conference-proceedings-guidelines IMPORTANT DATES Abstract submission: 19 April 2021 (AoE) Paper submission: 26 April 2021 (AoE) Notification: 14 June 2021 Conference: 6-9 September 2021 CONFERENCE FORMAT AND COVID-19 TABLEAUX 2021 and FroCoS 2021 are intended to be *hybrid* conferences welcoming both physical and virtual participation. The organisers are closely monitoring the pandemic situation and may choose to make the conference virtual-only if it seems unreasonable to host any sort of physical event. A final decision will be taken before the notification date 14 June (12 weeks before the conference) to leave ample time for potential travel plans to be made. PUBLICATION The conference proceedings will be published in the Springer series Lecture Notes in Artificial Intelligence (LNAI/LNCS). BEST PAPER AWARDS The program committee will select * the TABLEAUX 2021 Best Paper; and, * the TABLEAUX 2021 Best Paper by a Junior Researcher. Researchers will be considered "junior" if either they are students or their PhD degree date is less than two years from the first day of the meeting. The two awards will be presented at the conference. TRAVEL GRANTS FOR STUDENTS Some funding may be available to support students participating at TABLEAUX 2021. More details will be given on the conference website in due time. PROGRAM COMMITTEE Bahareh Afshari (University of Amsterdam, Netherlands, and University of Gothenburg, Sweden) Carlos Areces (Universidad Nacional de C?rdoba, Argentina) Arnon Avron (Tel-Aviv University, Israel) Nick Bezhanishvili (University of Amsterdam, Netherlands) Patrick Blackburn (University of Roskilde, Denmark) Serenella Cerrito (Universit? Paris-Saclay, Univ Evry, France) Kaustuv Chaudhuri (Inria, France) Liron Cohen (Ben-Gurion University, Israel) Anupam Das (University of Birmingham, UK) St?phane Demri (CNRS, France) Hans de Nivelle (Nazarbayev University, Kazakhstan) Valeria de Paiva (Topos Institute Berkeley, USA) Clare Dixon (University of Manchester, UK) Christian Ferm?ller (TU Wien, Austria) Didier Galmiche (Universit? de Lorraine, France) Silvio Ghilardi (Universit? degli Studi di Milano, Italy) Rajeev Gor? (Australian National University, Australia) Andrzej Indrzejczak (University of ??d?, Poland) Hidenori Kurokawa (Kanazawa University, Japan) Stepan Kuznetsov (Russian Academy of Sciences, Russia) Bj?rn Lellmann (SBA Research, Austria) St?phane Graham-Lengrand (SRI International, USA) George Metcalfe (University of Bern, Switzerland) Neil Murray (University At Albany, USA) Cl?udia Nalon (Universidade de Bras?lia, Brazil) Sara Negri (University of Genoa, Italy) Nicola Olivetti (Aix-Marseille University, France) Eugenio Orlandelli (University of Bologna, Italy) Jens Otten (University of Oslo, Norway) Alessandra Palmigiano (Vrije Universiteit Amsterdam, Netherlands) Dirk Pattinson (Australian National University, Australia) Frank Pfenning (Carnegie Mellon University, USA) Elaine Pimentel (Federal University of Rio Grande do Norte, Brazil) Andrei Popescu (University of Sheffield, UK) Gian Luca Pozzato (University of Turin, Italy) Giselle Reis (Carnegie Mellon University, Qatar) Reuben Rowe (Royal Holloway, UK) Jos? Esp?rito Santo (University of Minho, Portugal) Lutz Stra?burger (Inria, France) Josef Urban (Czech Technical University in Prague, Czech Republic) PC CHAIRS Anupam Das (University of Birmingham, UK) Sara Negri (University of Genoa, Italy) -------------- next part -------------- An HTML attachment was scrubbed... URL: From riccardo.treglia at unito.it Thu Mar 25 05:15:47 2021 From: riccardo.treglia at unito.it (Riccardo Treglia) Date: Thu, 25 Mar 2021 10:15:47 +0100 Subject: [TYPES/announce] ITRS 21 CfP Message-ID: ITRS 2021 Call for papersTenth Workshop on Intersection Types and Related Systems - ITRS 2021 17 July 2021, Online Affiliated with FSCD , 17-24 July 2021, Buenos Aires Web page: http://www.di.unito.it/~deligu/ITRS2021/ Aims and Scope Intersection types were introduced near the end of the 1970s to overcome the limitations of Curry's type assignment system and to provide a characterization of the strongly normalizing terms of the Lambda Calculus. The key idea is to introduce an intersection type constructor ? such that a term of type t ? s can be used at both type t and s within the same context. This provides a finite polymorphism where various, even unrelated, types of the term are listed explicitly, differently from the more widely used universally quantified types where the polymorphic type is the common schema that stands for its various type instances. As a consequence, more terms (all and only the normalizing terms) can be typed than with universal polymorphism. Although intersection types were initially intended for use in analyzing and/or synthesizing lambda models as well as in analyzing normalization properties, over the last twenty years the scope of the research on intersection types and related systems has broadened in many directions. Restricted (and more manageable) forms have been investigated, such as refinement types. Type systems based on intersection type theory have been extensively studied for practical purposes, such as program analysis and higher-order model checking. The dual notion of union types turned out to be quite useful for programming languages. Finally, the behavioural approach to types, which can give a static specification of computational properties, has become central in the most recent research on type theory. The ITRS 2021 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches. Possible topics for submitted papers include, but are not limited to: - Formal properties of systems with intersection types. - Results for related systems, such as union types, refinement types, or singleton types. - Applications to lambda calculus, pi-calculus and similar systems. - Applications for programming languages, program analysis, and program verification. - Applications for other areas, such as database query languages and program extraction from proofs. - Related approaches using behavioural/intensional types and/or denotational semantics to characterize computational properties. - Quantitative refinements of intersection types. ITRS workshops have been held every two years (with the exception of 2020, because of COVID-19 outbreak). Information about the previous events is available on the ITRS home page . Invited Speaker - Jeremy Siek (Indiana University Bloomington) Paper Submissions Papers must be original and not previously published, nor submitted elsewhere. Papers should be prepared in LaTeX using the EPTCS macro package and should be in the range of 3-16 pages, plus at most 2 pages of references. Submissions will be collected via EasyChair and reviewed by anonymous referees. Important Dates - Paper submission: 12 April 2021 - Author notification: 24 May 2021 - Final version: 18 June 2021 - Workshop: 17 July 2021 Program Committee - Antonio Bucciarelli, Universit? de Paris, France - Daniel De Carvalho, Innopolis University, Russia - Andrej Dudenhefner, Saarland University, Germany - Silvia Ghilezan, University of Novi Sad, Serbia - Giulio Guerrieri, University of Bath, UK - Ugo de' Liguoro, Universit? di Torino, Italy (chair) - Jeremy Siek, Indiana University Bloomington, USA (co-chair) Organizers Ugo de' Liguoro, Universit? di Torino, Italy Riccardo Treglia, Universit? di Torino, Italy (riccardo.treglia at unito.it) Steering Committee - Mariangiola Dezani-Ciancaglini, Universit? di Torino, Italy - Jakob Rehof, TU University of Dortmund, Germany - Joe Wells, Heriot-Watt University, Scotland -------------- next part -------------- An HTML attachment was scrubbed... URL: From dom.orchard at gmail.com Thu Mar 25 09:05:40 2021 From: dom.orchard at gmail.com (Dominic Orchard) Date: Thu, 25 Mar 2021 13:05:40 +0000 Subject: [TYPES/announce] Reader (Associate Professor) Position in Programming Languages at the University of Kent Message-ID: We are seeking to appoint a Reader in Computing in our Programming Languages and Systems research group based at our Canterbury campus, University of Kent. Job description / Additional Information / Please apply at https://jobs.kent.ac.uk/vacancy.aspx?ref=CEMS-046-21 (In the UK, the standard academic career titles, and their progression, are Lecturer, Senior Lecturer, Reader, Professor. There is no tenure system here but Reader is roughly equivalent to a senior Associate Professor position). Closing date for applications: 30 April 2021 The Programming Languages and Systems (PLAS) research group spans the breadth and depth of practical and theoretical aspects of programming languages and system building related to languages. Our work goes across paradigms (imperative, object-oriented, functional, logic) and is complemented by our systems research in concurrency, relaxed memory, verified compilation, verification, language prototypes, garbage collection, and tools. All our work is linked by a shared vision of the power and impact of programming languages on the rest of Computer Science. The PLAS group at Kent has a long history of contributions to the field and continues to be a hotbed of programming language research in the South East of England: https://research.kent.ac.uk/programming-languages-systems/ The School of Computing [1] is a welcoming, supportive, and diverse environment whose commitment to gender equality has been recognised with a Bronze Athena SWAN [2] award. We are keen to enhance the balanced, inclusive and diverse nature of the community within our School and would particularly encourage female candidates to apply for these posts. We are committed to delivering high quality research and education. The School?s five broad research areas are Programming Languages and Systems; Computer Security; Computational Intelligence; and Data Science. Full details can be found at: https://www.kent.ac.uk/computing/research. The School of Computing is based in Canterbury, and the University of Kent has specialist postgraduate centres in Brussels and Paris. Overlooking the city centre, and with 125 nationalities represented, the Canterbury campus has a very cosmopolitan feel. Canterbury is a small city that retains parts of its medieval walls (with Roman foundations). Famous for its heritage (Canterbury Cathedral; Chaucer?s Tales; etc), Canterbury is a vibrant community and UNESCO World Heritage site whose culture and leisure facilities are enhanced by hosting three universities. The city and surrounding region combines an attractive and affordable environment, excellent schools, and fast transport links to London and mainland Europe. Links: [1] https://cs.kent.ac.uk/ [2] http://www.ecu.ac.uk/equality-charters/athena-swan/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From harley.eades at gmail.com Thu Mar 25 11:45:49 2021 From: harley.eades at gmail.com (Harley D. Eades III) Date: Thu, 25 Mar 2021 11:45:49 -0400 Subject: [TYPES/announce] Seminar talk on Extending Homotopy Type Theory with Linear Type Formers Message-ID: Hi, everyone. On Friday, March 26, 2021 between 9am and 10am EST (2pm - 3pm UTC), Mitchell Riley will be giving a presentation as part of the CS Colloquium Series at Augusta University. Presentation details can be found here: https://the-au-forml-lab.github.io/colloquium_talks/Riley.html This will be an exciting talk on Mitchell's work as part of his PhD under the direction of Dan Licata on homotopy type theory and linearity. These talks are open to the general public via Zoom and Youtube. I'll be live streaming it on Youtube. If you are interested in attending the Zoom meeting please RSVP with me before the talk. Questions will be taken from those on Zoom and YouTube. If you care to watch via YouTube, please use the following link: https://youtu.be/0f-srpBeXAI Feel free to share this message with everyone you know. I hope all of you, your family and friends are doing well! Very best, Harley -------------- next part -------------- An HTML attachment was scrubbed... URL: From claudio.sacerdoticoen at unibo.it Thu Mar 25 16:14:53 2021 From: claudio.sacerdoticoen at unibo.it (Claudio Sacerdoti Coen) Date: Thu, 25 Mar 2021 20:14:53 +0000 Subject: [TYPES/announce] CFP ICTCS 2021 - 22th Italian Conference on Theoretical Computer Science Message-ID: ICTCS 2021 - 22th Italian Conference on Theoretical Computer Science 13-15 September 2021, Bologna, Italy THE CONFERENCE WILL BE HELD ON-LINE DUE TO CORONAVIRUS RESTRICTIONS http://helm.cs.unibo.it/ictcs2021/index.html CALL FOR PAPERS ================ SCOPE AND TOPICS ================ The Italian Conference on Theoretical Computer Science (ICTCS) is the conference of the Italian Chapter of the European Association for Theoretical Computer Science. The purpose of ICTCS is to foster the cross-fertilization of ideas stemming from different areas of theoretical computer science. In particular, ICTCS provides an ideal environment where junior researchers and PhD students can meet senior researchers. Contributions in any area of theoretical computer science are warmly invited from researchers of all nationalities. The topics of interest include, but are not limited to, the following: agents, algorithms, argumentation, automata theory, complexity theory, computational logic, computational social choice, concurrency theory, cryptography, discrete mathematics, distributed computing, dynamical systems, formal methods, game theory, graph theory, knowledge representation, languages, model checking, process algebras, quantum computing, rewriting systems, security and trust, semantics, specification and verification, systems biology, theorem proving, type theory. ================ PAPER SUBMISSION ================ Two types of contributions, written in English and formatted accordingto Springer LNCS style, are solicited. Regular papers: up to 12 pages PLUS bibliography, presenting original results not appeared or submitted elsewhere. To ease the reviewing process, the authors of regula papers may add an appendix, although reviewers are not required to consider it in their evaluation. Communications: up to 5 pages PLUS bibliography, suitable for extended abstracts of papers already appeared/submitted or to be submitted elsewhere, as well as papers reporting ongoing research on which the authors wish to get feedback and overviews of PhD theses or research projects. Authors are invited to submit their manuscripts in PDF format via EasyChair: https://easychair.org/conferences/?conf=ictcs2021 All accepted original contributions (regular papers and communications) will be published on CEUR-WS.org. For each accepted contribution, at least one of the authors is required to attend the conference and present the paper. ============================ TCS Special Issue ============================ Following the tradition, the authors of the very best papers presented at the conference will be invited to submit an extended version of their work in a special issue of Theoretical Computer Science journal. Invitations will be sent out after the workshop. The target is to publish the special issue by the end of the year 2022. =============== IMPORTANT DATES =============== Abstract submission: 17 May 2021 Paper submission: 24 May 2021 Notification: 30 June 2021 Revised version for pre-proceedings: 19 July 2021 Conference: 13-15 September 2021 Final version for CEUR-WS proceedings: 31 October 2021 (tentative) ================== INVITED SPEAKERS ================== Luca Padovani (Universit? di Torino) Nadia Pisanti (Universit? di Pisa) ==================== PROGRAM COMMITTEE ==================== Program Committee: Claudio Sacerdoti Coen (co-chair) (University of Bologna, Italy) Ivano Salvo (co-chair) (University of Roma ?Sapienza?, Italy) Franco Barbanera (University of Catania, Italy) Davide Bil? (University of Sassari, Italy) Stefano Bistarelli (University of Perugia, Italy) Davide Bresolin (University of Padua, Italy) Mattia D?Emidio (University of L?Aquila; Gran Sasso Science Institute, Italy) Miriam Di Ianni (University of Rome "Tor Vergata", Italy) Diodato Ferraioli (University of Salerno, Italy) Roberta Gori (University of Pisa, Italy) Ruggero Lanotte (University of Insubria, Italy) Andrea Marino (University of Florence, Italy) Isabella Mastroeni (University of Verona, Italy) Marino Miculan (DMIF, University of Udine, Italy) Fabio Mogavero (University of Naples Federico II, Italy) Manuela Montangero (University of Modena e Reggio Emilia, Italy) Luca Roversi (University of Torino, Italy) Marinella Sciortino (University of Palermo, Italy) Francesca Scozzari (University of Chieti-Pescara, Italy) Elena Zucca (DIBRIS ? University of Genova, Italy) Roberto Zunino (University of Trento, Italy) -- Prof. Claudio Sacerdoti Coen Department of Computer Science and Engineering University of Bologna From ornela.dardha at gmail.com Fri Mar 26 07:51:20 2021 From: ornela.dardha at gmail.com (Ornela Dardha) Date: Fri, 26 Mar 2021 11:51:20 +0000 Subject: [TYPES/announce] VEST'21 Workshop: First Call for Talks Message-ID: <27C1808A-59E8-4E9C-9DE3-DC399E03F75B@gmail.com> ********************************************************************* VEST 2021: 2nd Workshop on Verification of Session Types Online on July 12, 2021, co-located with ICALP 2021 https://sites.google.com/view/vest21/home Submission: Monday, 3rd May 2021 Call for Talks ********************************************************************* * Presentation The goal of this workshop is to bring together researchers and build and strengthen a community working on verification of session types using various theorem provers such as Agda, Coq, Isabelle or any other. Session types are abstract representations of the sequences of operations that computational entities (such as channels or objects) must perform. Stateful entities offer services in a non-uniform way (one cannot pop from an empty stack); traditional type systems cannot guarantee that operations are only invoked when the entity is in the right state. Large-scale software systems rely on message-passing protocols: their correctness largely depends on sound protocol implementations. Session types can help in the specification of correct-by-construction systems, and in verifying that programs respect their intended protocols. Recent years have seen a steady stream of research on behavioural types: their foundations and their transfer to several programming languages. This has led to highly-cited papers in conferences such as POPL and journals such as TOPLAS. Research projects on behavioural types have advanced the theory and applications of behavioural types. Although the foundations of session types are now well established, and new works build on approaches that have become standard, there is still a lack of reusable libraries, namely machine-verified ones. As on one hand the basis of most works is common, and on the other hand the complexity of the formal systems is considerable and may lead to errors in the proofs of the soundness results, machine verifying the type systems proposed is vital. Libraries, or at least clear formalisations of common approaches, is crucial to avoid not only to repeat work but also to increase the confidence in the knowledge base. Moreover, as many of these systems have a goal to do static analysis to ensure some safety or liveness property, machine verification of these approaches leads to certified software for program analysis. The goal of the VEST workshop is to gather the researchers working on mechanisations of behavioural types using various theorem provers, such as Agda, Coq, Isabelle or any other. The workshop will be a platform to present both the now well-established efforts and the ongoing works the community has put on verification. The workshop will also be a forum to discuss strengths and weaknesses of existing approaches, potential obstacles and to foster collaboration. * Types of Contributions We request two types of research contributions. Type 1: Short presentations (1 page) of work published elsewhere; Type 2: Presentations (2-5 pages) of ongoing original work. Submissions of Type 1 will consist of 1 page papers presenting the work, the publication venue and the significance of the results; the PC will select the submissions with a ranking system. Submissions of Type 2 will consist of 2 - 5 page papers submitted to a light reviewing process. There will be no proceedings of VEST'21, but rather the aim is to strengthen and further expand our community. * Important Dates AoE (UTC-12h) Submission: Monday, 3rd May 2021 Notification: Monday, 14th June 2021 Final Version: Monday, 5th July 2021 Workshop: Monday, 12th July 2021 * Submission Link: https://easychair.org/conferences/?conf= vest21 * Invited Speakers: - Jesper Bengtson (IT University of Copenhagen, Denmark) - Andreia Mordido (University of Lisbon, Portugal) *Tutorial, jointly delivered by: - David Castro-Perez (University of Kent, UK) - Francisco Ferreira-Ruiz (Imperial College, UK) - Lorenzo Gheri (Imperial College, UK) * Program Committee: - Robert Atkey, University of Strathclyde, UK - Laura Bocchi, University of Kent, UK - Ornela Dardha, University of Glasgow, UK (Co-chair) - Cinzia Di Giusto, Universit? C?te d'Azur, CNRS, I3S, France - Wen Kokke, The University of Edinburgh, UK - Robbert Krebbers, Radboud University Nijmegen, Netherlands - Luca Padovani , Universit? di Torino, Italy - Kirstin Peters, TU Darmstadt, Germany - Ant?nio Ravara, NOVA University of Lisbon, Portugal (Co-chair) - Ivan Scagnetto, University of Udine, Italy - Peter Thiemann, Universit?t Freiburg, Germany -------------- next part -------------- An HTML attachment was scrubbed... URL: From marthaflinderslewis at gmail.com Fri Mar 26 10:26:36 2021 From: marthaflinderslewis at gmail.com (Martha Lewis) Date: Fri, 26 Mar 2021 14:26:36 +0000 Subject: [TYPES/announce] SemSpace 2021 Final CfP and Deadline extension Message-ID: <097AC972-2F20-4DCB-9EBA-79E9EDD92989@gmail.com> [Apologies for cross-posting] Final CfP and extension Workshop on Semantic Spaces at the Intersection of NLP, Physics, and Cognitive Science (SemSpace2021) This year we are excited to be (virtually) co-located with IWCS: https://iwcs2021.github.io/ 14-18 June, 2021 https://sites.google.com/view/semspace2021/home IMPORTANT DATES: Paper submission: 26 March 2021 6 April 2021 Notification to contributors: 16 Apr 2021 23rd April 2021 Camera Ready: 7 May 2021 SUBMISSION INSTRUCTIONS Authors may submit non-anonymized extended abstracts (3 pages) or papers (8 pages) SemSpace21 papers should be formatted following the common two-column structure as used by ACL. Please use the IWCS specific style-files or the Overleaf template , taken from ACL 2021. Submission link: https://www.softconf.com/iwcs2021/SemSpace2021/user/ AIMS AND SCOPE Vector embeddings of word meanings have become a mainstream tool in large scale natural language processing tools. The use of vectors to represent meanings in semantic spaces or feature spaces is also employed in cognitive science. Unrelated to natural language and cognitive science, vectors and vector spaces have been extensively used as models of physical theories and especially the theory of quantum mechanics. Crucial similarities between the vector representations of quantum mechanics and those of natural language are exhibited via bicompact linear logic and compact closed categorical structures in natural language. Exploiting the common ground provided by vector spaces, the proposed workshop will bring together researchers working at the intersection of NLP, cognitive science, and physics, offering to them an appropriate forum for presenting their uniquely motivated work and ideas. The interplay between these three disciplines will foster theoretically motivated approaches to understanding how meanings of words interact with each other in sentences and discourse via grammatical types, how they are determined by input from the world, and how word and sentence meanings interact logically. Topics of interest include (but are not restricted to): Reasoning in semantic spaces Compositionality in semantic spaces and conceptual spaces Conceptual spaces in linguistics and natural language processing Applications of quantum logic in natural language processing and cognitive science Modelling functional words such as prepositions and relative pronouns in compositional distributional models of meaning Diagrammatic reasoning for natural language processing and cognitive science Modelling so-called ?non-compositional? phenomena such as metaphor SUBMISSIONS: We welcome two types of submission: - Archival papers of up to 8 pages should report on complete, original and unpublished research. Accepted papers will be published in the workshop proceedings and appear in the ACL anthology. - Extended abstracts (up to 3 pages) may report on work in progress or work that was recently published/accepted at a different venue. Extended abstracts will not be included in the workshop proceedings. Both accepted papers and extended abstracts are expected to be presented at the workshop. Authors must submit non-anonymized extended abstracts or papers by April 6th. Both extended abstracts and papers must be formatted according to the IWCS guidelines, and must be submitted via softconf (link: ?https://www.softconf.com/iwcs2021/SemSpace2021/user/ ). The extended abstracts should not contain an abstract section and may consist of up to 3 pages of content, plus unlimited references. Archival papers may consist of up to 8 pages of content, plus unlimited references. Camera-ready versions of papers will be given one additional page of content so that reviewers? comments can be taken into account. INVITED SPEAKERS Ellie Pavlick, Brown University Haim Dubossarsky, University of Cambridge PROGRAMME COMMITTEE Tai-Danae Bradley, X, the Moonshot Factory Bob Coecke, Cambridge Quantum Computing Gemma De Las Cuevas, Institute for Theoretical Physics, University of Innsbruck Stefano Gogioso, University of Oxford Peter G?rdenfors, Lund University Peter Hines, University of York Antonio Lieto, University of Turin Dan Marsden, University of Oxford Michael Moortgat, Utrecht University Richard Moot, CNRS(LIRMM) & University of Montpellier Dusko Pavlovic, University of Hawaii Emmanuel Pothos, City University of London Matthew Purver, Queen Mary University of London Pawel Sobocinski, Tallinn University of Technology Corina Stroessner, Ruhr University Bochum Dominic Widdows, Serendipity Now! Gijs Wijnholds, Utrecht University ORGANIZATION COMMITTEE Martha Lewis, University of Bristol Mehrnoosh Sadrzadeh, UCL Lachlan McPheat, UCL -------------- next part -------------- An HTML attachment was scrubbed... URL: From harley.eades at gmail.com Sat Mar 27 13:55:42 2021 From: harley.eades at gmail.com (Harley D. Eades III) Date: Sat, 27 Mar 2021 13:55:42 -0400 Subject: [TYPES/announce] Seminar talk on Coinductive Equivalences for Higher-order Coeffectful Languages Message-ID: Hi, everyone. On Friday, April 2, 2021 between 1pm and 2pm EST (6pm - 7pm UTC), Dr.Francesco Gavazzo will be giving a presentation as part of the CS Colloquium Series at Augusta University. Presentation details can be found here: https://the-au-forml-lab.github.io/colloquium_talks/Gavazzo.html This will be an exciting talk on Francesco's work on program equivalence w.r.t coeffect type systems like graded and quantified type systems. I know I'm pumped about this talk. These talks are open to the general public via Zoom and Youtube. I'll be live streaming it on Youtube. If you are interested in attending the Zoom meeting please RSVP with me before the talk. Questions will be taken from those on Zoom and YouTube. If you care to watch via YouTube, please use the following link: https://youtu.be/-tgA2zShDcQ Feel free to share this message with everyone you know. I hope all of you, your family and friends are doing well! Very best, Harley -------------- next part -------------- An HTML attachment was scrubbed... URL: From Ian.Stark at ed.ac.uk Sun Mar 28 13:51:07 2021 From: Ian.Stark at ed.ac.uk (Ian Stark) Date: Sun, 28 Mar 2021 18:51:07 +0100 (GMT Summer Time) Subject: [TYPES/announce] Morello: Edinburgh research posts on capability-based security technologies Message-ID: Morello: Digital Security by Design Technology Platform Prototype Laboratory for Foundations of Computer Science School of Informatics The University of Edinburgh https://www.jobs.ac.uk/job/CEO974/research-associate *** Applications close 2 April 2021 at 1600 UTC *** We are recruiting two postdoctoral researchers to join the Innovate UK project "Digital Security by Design: Technology Platform Prototype". This is a research collaboration between Arm and the Universities of Cambridge and Edinburgh to develop the Morello platform, applying a novel capability-based architecture to a mainstream high-performance processor and software stack. Further information below: for full details and how to apply please follow the link above. If you would like to discuss informally then please contact Ian.Stark at ed.ac.uk, the project lead for Edinburgh. The University of Edinburgh only take formal references after appointment: if you have individual letters of support then please submit these as part of your initial application. Follow these links for more about the wider project. Morello Platform: https://www.morello-project.org CHERI Architecture: http://www.cheri-cpu.org Sail Language: https://www.cl.cam.ac.uk/~pes20/sail/ Detailed developer information from Arm https://developer.arm.com/architectures/cpu-architecture/a-profile/morello Video presentation of CHERI security architecture and Morello platform https://vimeo.com/486754830 The only essential requirement for these positions is that a PhD or equivalent research experience in computer science, informatics, mathematics, or a related discipline. This includes being close to PhD completion and submission. We are particularly interested to hear from candidates with any of the following. There is no requirement to demonstrate all of these together: this project crosses domains and the precise tasks followed will depend on each researcher's individual skills, experience, and interests. - Experience with machine-assisted reasoning tools and automated provers: such as Coq, Isabelle, HOL4; or SAT/SMT solvers - Experience with functional programming in OCaml - Knowledge of instruction-set architectures; specifically Arm A64, but RISC-V also relevant - Knowledge of programming-language semantics and type systems - Knowledge of program logics, program analysis, and specification -- Ian Stark Laboratory for Foundations of Computer Science http://homepages.ed.ac.uk/stark School of Informatics, University of Edinburgh ------------------------------------------------------------------------------ The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From michele.loreti at unicam.it Sun Mar 28 15:35:21 2021 From: michele.loreti at unicam.it (Michele Loreti) Date: Sun, 28 Mar 2021 21:35:21 +0200 Subject: [TYPES/announce] CALCO 2021: First Call for Papers Message-ID: <96bfa384-17c9-4506-bf40-d327176d7818@Spark> [Apologies if you receive multiple copies of this message] ========================================================= ?CALL FOR PAPERS: CALCO 2021 ?9th International Conference on ?Algebra and Coalgebra in Computer Science ?31 Aug - 03 Sep 2021 ?Salzburg, Austria (if possible) ?Co-located with MFPS XXXV https://www.coalg.org/calco-mfps2021/ ========================================================== Paper submission: 3 June 2021 Author notification: 29 July 2021 Final version due: 12 August 2021 ========================================================== Scope ======================== Algebraic and coalgebraic methods and tools are a mainstay of computer science. From data types to development techniques and specification formalisms, both theoreticians and practitioners have benefited from the large body of research proposed and implemented since the pioneering works of the 1960s. CALCO aims to bring together researchers with interests in both foundational and applicative uses of algebra and coalgebra in computer science, traditional as well as emerging ones CALCO is a high-level, bi-annual conference formed by joining the forces and reputations of CMCS (the International Workshop on Coalgebraic Methods in Computer Science) and WADT (the Workshop on Algebraic Development Techniques). Previous CALCO editions took place in Swansea (Wales, 2005), Bergen (Norway, 2007), Udine (Italy, 2009), Winchester (UK, 2011), Warsaw (Poland, 2013), Nijmegen (the Netherlands, 2015), Ljubljana (Slovenia,2017), and London (UK, 2019). The 9th edition will be held in Salzburg, Austria, colocated with MFPS XXXVII. Submission Categories ======================== CALCO invites papers relating to all aspects of algebraic and coalgebraic theory and applications, and distinguishes between four categories of submissions. 1. Regular papers that report ?* results on theoretical foundations ?* novel methods and techniques for software development ?* experiences with the technology transfer to industry. 2. (Co)Algebraic Pearls papers that ?* present possibly known material in a novel and enlightening way. 3. Early ideas abstracts that lead to ?* presentations of work in progress ?* proposals for original venues of research. 4. Tool presentation papers that ?* report on the features and uses of algebraic/coalgebra-based tools. Topics of Interests ======================== All topics relating to algebraic and coalgebraic theory and applications are of interest for CALCO, and among them * Models and logics ?- Automata and languages ?- Graph transformations and term rewriting ?- Modal logics ?- Proof systems ?- Relational systems * Algebraic and coalgebraic semantics ?- Abstract data types ?- Re-engineering techniques (program transformation) ?- Semantics of conceptual modelling methods and techniques ?- Semantics of programming languages * Methodologies in software and systems engineering ?- Development processes ?- Method integration ?- Usage guidelines * Specialised models and calculi ?- Hybrid, probabilistic, and timed systems ?- Concurrent, distributed, mobile, cyber-physical, ?and context-aware computational paradigms ?- Systems theory and computational models (chemical, biological, etc.) * System specification and verification ?- Formal testing and quality assurance ?- Generative programming and model-driven development ?- Integration of formal specification techniques ?- Model-driven development ?- Specification languages, methods, and environments * Tools supporting algebraic and coalgebraic methods for ?- Advances in automated verification ?- Model checking ?- Theorem proving ?- Testing * String diagrams and network theory ?- Theory of PROPs and operads ?- Rewriting problems and higher-dimensional approaches ?- Automated reasoning with string diagrams ?- Applications of string diagrams * Quantum computing ?- Categorical semantics for quantum computing ?- Quantum calculi and programming languages ?- Foundational structures for quantum computing ?- Applications of quantum algebra Submissions Guidelines ======================== All submissions will be handled via EasyChair: https://easychair.org/conferences/?conf=calco2021 The format for all submissions is specified by LIPIcs. Please use the latest version of the style: http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ It is recommended that submissions adhere to that format and length. Submissions that are clearly too long may be rejected immediately. Regular papers ======================== Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Regular papers should be maximum 15 pages long, excluding references. Proofs omitted due to space limitations may be included in a clearly marked appendix. Each submission will be evaluated by at least three reviewers. Proceedings will be published in the Dagstuhl LIPIcs Leibniz International Proceedings in Informatics series. A special issue of the open access journal Logical Methods in Computer Science (http://www.lmcs-online.org), containing extended versions of selected papers, is planned. (Co)algebraic pearls ======================== This is a new submission category in 2021. Explaining a known idea in a new way may make as strong a contribution as inventing a new idea. We encourage the submission of pearls: elegant essays that illustrate an idea in a beautiful or didactically clever way, perhaps by developing an application. Pearls are typically short and concise and so should not be longer than regular papers in the format specified by LIPIcs. Authors who feel they need a bit more space should consult with the PC co-chairs. The accepted papers will be included in the final proceedings of the conference. Each submission will be evaluated by at least two reviewers. Early ideas abstracts ======================== Submissions should not exceed 2 pages in the format specified by LIPIcs. The volume of selected abstracts will be made available on arXiv and on the CALCO pages. Authors will retain copyright, and are also encouraged to disseminate the results by subsequent publication elsewhere. Each submission will be evaluated by at least two reviewers. Tool papers ======================== Submissions should not exceed 5 pages in the format specified by LIPIcs. The accepted tool papers will be included in the final proceedings of the conference. The tools should be made available on the web at the time of submission for download and evaluation. Each submission will be evaluated by at least three reviewers, and one or more of the reviewers will be asked to download and use the tool. Best Paper and Best Presentation Awards ======================== This edition of CALCO will feature two awards: a Best Paper Award whose recipients will be selected by the PC before the conference and a Best Presentation Award, elected by the participants. Programme Committee ======================== * Zena M. Ariola (University of Oregon) * Paolo Baldan (University of Padova) * Rui Soares Barbosa (International Iberian Nanotechnology Laboratory) * Luis Caires (NOVA University Lisbon) * Francisco Dur?n (University of M?laga) * Brendan Fong (Massachusetts Institute of Technology) * Fabrizio Romano Genovese (University of Pisa) * Jules Hedges (University of Strathclyde, Glasgow) * Thomas Hildebrandt (IT University of Copenhagen) * Peter Jipsen (Chapman University) * Wolfram Kahl (McMaster University) * Marie Kerjean (CNRS -- Laboratoire d'Informatique de Paris Nord) * Jean Krivine (CNRS -- Universit? de Paris) * Michele Loreti (University of Camerino) * Sonia Marin (University College London) * Manuel A. Martins (University of Aveiro) * Annabelle McIver (Macquarie University) * Hernan Melgratti (University of Buenos Aires) * Koko Muroya (RIMS, Kyoto University) * Elaine Pimentel (UFRN) * Elvinia Riccobene (University of Milan) * Alex Simpson (University of Ljubljana) * David I. Spivak (Massachusetts Institute of Technology) * Christine Tasson (LIP6 - Sorbonne Universit?) * Tarmo Uustalu (Reykjavik University/Tallinn U. of Technology) * Maaike Zwart (University of Oxford) * Rob van Glabbeek (Data61 - CSIRO) Chairs ======================== * Fabio Gadducci (University of Pisa) * Alexandra Silva (University College London) Organisers ======================== * Ana Sokolova (local) (University of Salzburg) Publicity Chair ======================== ?* Henning Basold (LIACS -- Leiden University) -------------- next part -------------- An HTML attachment was scrubbed... URL: From shankar at csl.sri.com Sun Mar 28 21:50:14 2021 From: shankar at csl.sri.com (Natarajan Shankar) Date: Sun, 28 Mar 2021 18:50:14 -0700 Subject: [TYPES/announce] Tenth (Virtual) Summer School on Formal Techniques, May 22-28, 2021 In-Reply-To: <9eb14ee9-e10b-ccf6-b2b1-9b290df216c4@csl.sri.com> References: <5A9832E8.3020003@csl.sri.com> <0e5c7eb9-65d3-96fe-6ca9-4259841bf175@csl.sri.com> <9eb14ee9-e10b-ccf6-b2b1-9b290df216c4@csl.sri.com> Message-ID: Tenth Summer School on Formal Techniques , May 22 - May 28, 2020 (http://fm.csl.sri.com/SSFT21) ? [Due to the pandemic, the Tenth Summer School on Formal Techniques that was ?? postponed from 2020 will be virtual this year.] Techniques based on formal logic, such as model checking, satisfiability, static analysis, and automated theorem proving, are finding a broad range of applications in modeling, analysis, verification, and synthesis. This school, the tenth in the series, will focus on the principles and practice of formal techniques, with a strong emphasis on the hands-on use and development of this technology. It primarily targets graduate students and young researchers who are interested in studying and using formal techniques in their research. A prior background in formal methods is helpful but not required. Participants at the school can expect to have a seriously fun time experimenting with the tools and techniques presented in the lectures during laboratory sessions. ============================================================= The lecturers at? the school include: * Thomas Reps (University of Wisconsin) ? Algebraic Program Analysis: Automating Abstract Interpretation * Natasha Sharygina (University of Lugano, Switzerland) ? SMT-streamlined Software Model Checking * Warren A. Hunt, Jr. and J Strother Moore (University of Texas) ? Proving Properties of Algorithms, Hardware, and Software with ACL2 * Jose Meseguer (University of Illinois at Urbana-Champaign) ? Executable Formal Specification and Verification in Maude The main lectures in the summer school start on Monday May 24 and ?will be preceded by a background course on logic on Saturday May 22 and ?Sunday May 23: * Natarajan Shankar (SRI CSL) and Stephane Graham-Lengrand (Ecole Polytechnique) ? Speaking Logic ============================================================= The summer school also include several distinguished invited talks. Information about previous Summer Schools on Formal Techniques can be found at http://fm.csl.sri.com/SSFT11 http://fm.csl.sri.com/SSFT12 http://fm.csl.sri.com/SSFT13 http://fm.csl.sri.com/SSFT14 http://fm.csl.sri.com/SSFT15 http://fm.csl.sri.com/SSFT16 http://fm.csl.sri.com/SSFT17 http://fm.csl.sri.com/SSFT18 http://fm.csl.sri.com/SSFT19 Jay Bosamiya of CMU has blogged about the 2018 Summer School at https://www.jaybosamiya.com/blog/2018/05/31/ssft/ ======================================================================= Registration is at the URL: http://fm.csl.sri.com/SSFT21 ? Those who already registered for the 2020 event need not re-register, and you will be contacted to check if you would like your registration to be processed. Although the summer school is virtual and there is no registration fee, attendance is restricted to registered participants. Attendees who complete the summer school will receive a certificate by mail. Applications should be submitted together with names of two references (preferably advisors, professors, or senior colleagues). ? Applicants are urged to submit their applications before April 30, 2021, since there are only a limited number of spaces available. We strongly encourage the participation of women and under-represented minorities in the summer school. From alcsc at dtu.dk Mon Mar 29 02:18:24 2021 From: alcsc at dtu.dk (Alceste Scalas) Date: Mon, 29 Mar 2021 08:18:24 +0200 Subject: [TYPES/announce] 2nd CfP: 14th Interaction and Concurrency Experience (ICE 2021) Message-ID: <4e120b05-907f-5183-b731-5f6dbcd590c8@dtu.dk> ICE 2021 14th Interaction and Concurrency Experience June 18, 2021 University of Malta, Valletta and/or online Satellite workshop of DisCoTec 2021 https://www.discotec.org/2021/ice Submission link: https://openreview.net/group?id=DisCoTec.org/2021/Workshop/ICE Interaction and Concurrency Experience (ICE) is a series of international scientific meetings oriented to theoretical computer science researchers with special interest in models, verification, tools, and programming primitives for complex interactions. === HIGHLIGHTS === * Distinctive selection procedure * ICE welcomes full papers to be included in the proceedings * ICE also welcomes oral communications of already published or preliminary work * Publication in EPTCS * Special issue in the Journal of Logical and Algebraic Methods in Programming (Elsevier) (to be confirmed) * Invited speakers: TBA === IMPORTANT DATES === * 15 April 2021: abstract submission * 19 April 2021: paper submission * 18 May 2021: notification * 18 June 2021: ICE workshop * 12 July 2021: camera-ready for EPTCS post-proceedings === SCOPE === The general scope of the venue includes theoretical and applied aspects of interactions and the synchronization mechanisms used among components of concurrent/distributed systems, related to several areas of computer science in the broad spectrum ranging from formal specification and analysis to studies inspired by emerging computational models. We solicit contributions relevant to Interaction and Concurrency, including but not limited to: * Formal semantics * Process algebras and calculi * Models and languages * Protocols * Logics and types * Expressiveness * Model transformations * Tools, implementations, and experiments * Specification and verification * Coinductive techniques * Tools and techniques for automation * Synthesis techniques === SELECTION PROCEDURE === Since its first edition in 2008, the distinguishing feature of ICE has been an innovative paper selection mechanism based on an interactive, friendly, and constructive discussion amongst authors and PC members in an online forum. During the review phase, each submission is published in a dedicated discussion forum. The discussion forum can be accessed by the authors of the submission and by all PC members not in conflict with the submission (the forum preserves anonymity). The forum is used by reviewers to ask questions, clarifications, and modifications from the authors, allowing them better to explain and to improve all aspects of their submission. The evaluation of the submission will take into account not only the reviews, but also the outcome of the discussion. As witnessed by the past editions of ICE, this procedure considerably improves the accuracy of the reviews, the fairness of the selection, the quality of camera-ready papers, and the discussion during the workshop. ICE adopts a light double-blind reviewing process, detailed below. === SUBMISSION GUIDELINES === Submissions must be made electronically in PDF format via OpenReview: https://openreview.net/group?id=DisCoTec.org/2021/Workshop/ICE We invite two types of submissions: * Research papers, original contributions that will be published in the workshop post-proceedings. Research papers must not be simultaneously submitted to other conferences/workshops with refereed proceedings. Research papers should be 3-16 pages plus at most 2 pages of references. Short research papers are welcome; for example a 5 page short paper fits this category perfectly. The submitted PDF can use any LaTeX style (but the post-proceedings will use the EPTCS style). * Oral communications will be presented at the workshop, but will not appear in the post-proceedings. This type of contribution includes e.g. previously published contributions, preliminary work, and position papers. There is no strict page limit for this kind of submission but papers of 1-5 pages would be appreciated. For example, a one page summary of previously published work is welcome in this category. Authors of research papers must omit their names and institutions from the title page, they should refer to their other work in the third person and omit acknowledgements that could reveal their identity or affiliation. The purpose is to avoid any bias based on authors? identity characteristics, such as gender, seniority, or nationality, in the review process. Our goal is to facilitate an unbiased approach to reviewing by supporting reviewers? access to works that do not carry obvious references to the authors? identities. As mentioned above, this is a lightweight double-blind process. Anonymization should not be a heavy burden for authors, and should not make papers weaker or more difficult to review. Advertising the paper on alternate forums (e.g., on a personal web-page, pre-print archive, email, talks, discussions with colleagues) is permitted, and authors will not be penalized by for such advertisement. Papers in the ?Oral communications? category need not be anonymized. For any questions concerning the double blind process, feel free to consult the ICEcreamers. We are keen to enhance the balanced, inclusive and diverse nature of the ICE community, and would particularly encourage female colleagues and members of other underrepresented groups to submit their work. === PUBLICATIONS === Accepted research papers and communications must be presented at the workshop by one of the authors. Accepted research papers will be published after the workshop in Electronic Proceedings in Theoretical Computer Science (to be confirmed). We plan to invite authors of selected papers and brief announcements to submit their work in a special issue in the Journal of Logical and Algebraic Methods in Programming (Elsevier). Such contributions will be regularly peer-reviewed according to the standard journal policy, but they will be handled in a shorter time than regular submissions. A list of published and in preparation special issues of previous ICE editions is reported on the ICE website. === ICECREAMERS === Julien Lange (Royal Holloway, University of London, UK) - julien.lange at rhul.ac.uk Anastasia Mavridou (NASA Ames, USA) - anastasia.mavridou at nasa.gov Larisa Safina (Inria, FR) - larisa.safina at inria.fr Alceste Scalas (Technical University of Denmark, DK) - alcsc at dtu.dk === PROGRAM COMMITTEE === * Massimo Bartoletti (University of Cagliari, IT) * Chiara Bodei (Universit? di Pisa, IT) * Matteo Cimini (University of Massachusetts Lowell, USA) * Cinzia Di Giusto (Universit? C?te d?Azur, CNRS, I3S, FR) * Simon Fowler (University of Glasgow, UK) * Eva Graversen (University of Southern Denmark, DK) * Ludovic Henrio (ENS Lyon, FR) * Keigo Imai (Gifu University, JP) * Sung-Shik Jongmans (Open University of the Netherlands, NL) * Sophia Knight (University of Minnesota Duluth, US) * Wen Kokke (University of Edinburgh, UK) * Ivan Lanese (University of Bologna, IT) * Karoliina Lehtinen (CNRS - LIS, Aix-Marseille University, FR) * Alberto Lluch Lafuente (Technical University of Denmark, DK) * Diego Marmsoler (University of Exeter, UK) * Hern?n Melgratti (University of Buenos Aires, AR) * Maurizio Murgia (University of Trento, IT) * Kirstin Peters (TU Darmstadt, DE) * Johannes ?man Pohjola (Data61/CSIRO, AU) * Ivan Prokic (University of Novi Sad, RS) * Matteo Sammartino (Royal Holloway, University of London, UK) * Hugo Torres Vieira (C4 - University of Beira Interior, PT) * Laura Voinea (University of Kent, UK) * Uma Zalakian (University of Glasgow, UK) === STEERING COMMITTEE === * Massimo Bartoletti (University of Cagliari, IT) * Ludovic Henrio (ENS Lyon, FR) * Ivan Lanese (University of Bologna, IT) * Alberto Lluch Lafuente (Technical University of Denmark, DK) * Sophia Knight (University of Minnesota Duluth, USA) * Hugo Torres Vieira (C4 - University of Beira Interior, PT) === MORE INFORMATION === For additional information, please contact the ICEcreamers (see email addresses above). -- Alceste Scalas - https://people.compute.dtu.dk/alcsc Assistant Professor @ DTU Compute - Section for Formal Methods Technical University of Denmark Richard Petersens Plads, Building 324, Room 180 2800 Kgs. Lyngby From sam.staton at cs.ox.ac.uk Mon Mar 29 10:48:22 2021 From: sam.staton at cs.ox.ac.uk (Sam Staton) Date: Mon, 29 Mar 2021 14:48:22 +0000 Subject: [TYPES/announce] Call for Nominations: EiC of ACM TOCL journal Message-ID: <906CC0E8-12DF-4962-95EB-B2AA169C645B@cs.ox.ac.uk> Call for Nominations Editor-In-Chief ACM Transactions on Computational Logic The term of the current Editor-in-Chief (EiC) of the ACM Transactions on Computational Logic (TOCL http://tocl.acm.org/) is coming to an end, and the ACM Publications Board has set up a nominating committee to assist the Board in selecting the next EiC. Nominations, including self-nominations, are invited for a three-year term as TOCL EiC, beginning on July 1, 2021. The EiC appointment may be renewed at most one time. This is an entirely voluntary position, but ACM will provide appropriate administrative support. Appointed by the ACM Publications Board, Editors-in-Chief (EiCs) of ACM journals are delegated full responsibility for the editorial management of the journal consistent with the journal's charter and general ACM policies. The Board relies on EiCs to ensure that the content of the journal is of high quality and that the editorial review process is both timely and fair. He/she has the final say on acceptance of papers, size of the Editorial Board, and appointment of Associate Editors. A complete list of responsibilities is found in the ACM Volunteer Editors Position Descriptions (http://www.acm.org/publications/policies/position_descriptions). Additional information can be found in the following documents: - Roles and Responsibilities in ACM Publishing https://www.acm.org/publications/policies/roles-and-responsibilities - ACM's Evaluation Criteria for Editors-in-Chief http://www.acm.org/publications/policies/evaluation/ Nominations should include a vita along with a brief statement of why the nominee should be considered. Self-nominations are encouraged and should include a statement of the candidate's vision for the future development of TOCL. The deadline for submitting nominations is May 7, 2021, although nominations will continue to be accepted until the position is filled. Please send all nominations to the search committee chair, Dale Miller (dale.miller at inria.fr). The search committee members are: - Dale Miller (Inria & LIX/IPP, France), Chair - Christel Baier (TU Dresden, Germany) - Prakash Panangaden (McGill University, Canada) - Andrew Pitts (University of Cambridge, UK) - Simona Ronchi Della Rocca (University of Turin, Italy) - Adelinde Uhrmacher (University of Rostock, Germany) ACM Pubs Board Liaison From kutsia at risc.jku.at Mon Mar 29 09:47:57 2021 From: kutsia at risc.jku.at (Temur Kutsia) Date: Mon, 29 Mar 2021 15:47:57 +0200 Subject: [TYPES/announce] 2nd CfP: SCSS 2021 Message-ID: ========================= SCSS 2021 The 9th International Symposium on Symbolic Computation in Software Science -- In the era of Computational and Artificial Intelligence -- September 8--10, 2021, virtual Organized by RISC, Johannes Kepler University Linz, Austria https://www.risc.jku.at/conferences/scss2021/ ========================= Overview -------- Symbolic Computation is the science of computing with symbolic objects (terms, formulae, programs, representations of algebraic objects, etc.). Powerful algorithms have been developed during the past decades for the major subareas of symbolic computation: computer algebra and computational logic. These algorithms and methods are successfully applied in various fields, including software science, which covers a broad range of topics about software construction and analysis. Meanwhile, artificial intelligence methods and machine learning algorithms are widely used nowadays in various domains and, in particular, combined with symbolic computation. Several approaches mix artificial intelligence and symbolic methods and tools deployed over large corpora to create what is known as cognitive systems. Cognitive computing focuses on building systems that interact with humans naturally by reasoning, aiming at learning at scale. The purpose of SCSS 2021 is to promote research on theoretical and practical aspects of symbolic computation in software science, combined with modern artificial?intelligence?techniques. Scope ------ SCSS 2021 solicits submissions on all aspects of symbolic computation and their applications in software science, in combination with artificial intelligence and cognitive computing techniques. The topics of the symposium include, but are not limited to the following: - automated reasoning, knowledge reasoning, common-sense reasoning and reasoning in science - algorithm (program) synthesis and/or verification, alignment and joint processing of formal, semi-formal, and informal libraries. - formal methods for the analysis of network and system security - termination analysis and complexity analysis of algorithms (programs) - extraction of specifications from algorithms (programs) - theorem proving methods and techniques, collaboration between automated and interactive theorem proving - proof carrying code - generation of inductive assertion for algorithm (programs) - algorithm (program) transformations - combinations of linguistic/learning-based and semantic/reasoning methods - formalization and computerization of knowledge (maths, medicine, economy, etc.) - methods for large-scale computer understanding of mathematics and science - artificial intelligence, machine learning and big-data methods in theorem proving and mathematics - formal verification of artificial intelligence and machine learning algorithms, explainable artificial intelligence, symbolic artificial intelligence - cognitive computing, cognitive vision, perception systems and artificial reasoners for robotics - component-based programming - computational origami - query languages (in particular for XML documents) - semantic web and cloud computing Important Dates --------------- May 18: title and single-paragraph abstract submission deadline. May 25: paper submission deadline. July 12: notification deadline. July 30: final paper submission deadline. September 8-10, 2021: the symposium dates (virtual). Keynote speaker --------------- Bruno Buchberger (RISC, Johannes Kepler University Linz, Austria) Invited Speakers ------ Tateaki Sasaki (University of Tsukuba, Japan) Martina Seidl (Johannes Kepler University Linz, Austria) Stephen M. Watt (University of Waterloo, Canada) General Chairs ----- Adel Bouhoula (Arabian Gulf University, Bahrain) Tetsuo Ida (University of Tsukuba, Japan) Program Chair ----- Temur Kutsia (Johannes Kepler University, Austria) Program Committee --------- David Cerna (Czech Academy of Sciences, Czech Republic, and Johannes Kepler University Linz, Austria) Changbo Chen (Chinese Academy of Sciences, China) Rachid Echahed (CNRS, Grenoble, France) Seyed Hossein Haeri (UC Louvain, Belgium) Mohamed-B?cha Ka?niche (Sup'Com, Carthage University, Tunisia) Cezary Kaliszyk (University of Innsbruck, Austria) Yukiyoshi Kameyama (University of Tsukuba, Japan) Michael Kohlhase (University of Erlangen-Nuremberg, Germany) Laura Kovacs (Vienna University of Technology, Austria) Temur Kutsia (Johannes Kepler University Linz, Austria) (Chair) Zied Lachiri (ENIT, University of Tunis El Manar, Tunisia) Christopher Lynch (Clarkson University, USA) Mircea Marin (West University of Timisoara, Romania) Yasuhiko Minamide (Tokyo Institute of Technology, Japan) Yoshihiro Mizoguchi (Kyushu University, Japan) Julien Narboux (Strasbourg University, France) Micha?l Rusinowitch (INRIA, France) Wolfgang Schreiner (Johannes Kepler University Linz, Austria) Sofiane Tahar (Concordia University, Canada) Dongming Wang (CNRS, Paris, France) Submission ---------- Submission is via EasyChair: https://easychair.org/conferences/?conf=scss2021 Original submissions are invited in two categories: regular research papers and tool papers. We recommend using the EPTCS Class format to prepare manuscripts. Regular research papers must not exceed 12 pages with up to 3 additional pages for technical appendices. Tool papers must not exceed 6 pages. They should include information about a URL from where the tool can be downloaded or accessed on-line. Publication ----------- The proceedings of SCSS 2021 will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS). A special issue of Annals of Mathematics and Artificial Intelligence (AMAI) will be organized after the symposium. Submitted full-length papers will be refereed according to the usual standards of the journal. From serge.autexier at dfki.de Mon Mar 29 14:47:51 2021 From: serge.autexier at dfki.de (Serge Autexier) Date: Mon, 29 Mar 2021 20:47:51 +0200 (CEST) Subject: [TYPES/announce] Deadline Extension: April 5th, 20201, 14th Conference on Intelligent Computer Mathematics (CICM 2021) Message-ID: <20210329184751.833FF1BC743C@gigondas.localdomain> (Deadline Extension: April 5, 2021) Call for Papers formal papers - informal papers - doctoral programme 14th Conference on Intelligent Computer Mathematics - CICM 2021 - July 26-31, 2020 Timisoara, Romania http://www.cicm-conference.org/2021 ---------------------------------------------------------------------- Invited Speakers * Alessandro Cimatti (Fondazione Bruno Kessler, Trento, IT) * Michael Kohlhase (FAU Erlangen-N?rnberg, Germany) * Laura Kovacs (TU Vienna, Austria) * Angus McIntyre (London/Edinburgh, UK) ---------------------------------------------------------------------- Digital and computational solutions are becoming the prevalent means for the generation, communication, processing, storage and curation of mathematical information. CICM brings together the many separate communities that have developed theoretical and practical solutions for mathematical applications such as computation, deduction, knowledge management, and user interfaces. It offers a venue for discussing problems and solutions in each of these areas and their integration. CICM 2021 Programme committee: see https://www.cicm-conference.org/2021/cicm.php?event=&menu=pc CICM 2021 invites submissions in all topics relating to intelligent computer mathematics, in particular but not limited to * theorem proving and computer algebra * mathematical knowledge management * digital mathematical libraries CICM appreciates the varying nature of the relevant research in this area and invites submissions of different forms: 1) Formal submissions will be reviewed rigorously and accepted papers will be published in a volume of Springer LNCS: * regular papers (up to 15 pages including references) present novel research results * project and survey papers (up to 15 pages + bibliography) summarize existing results * system and dataset descriptions (up to 5 pages including references) present digital artifacts * system entry (1 page according to the given LaTeX template) provides metadata and a quick overview of a new tool or a new release of an existent tool 2) Informal submissions will be reviewed with a positive bias and selected for presentation based on their relevance for the community. * informal papers may present work-in-progress, project announcements, position statements, etc. * posters and system demos will be presented in parallel in special sessions 3) The doctoral programme provides PhD students with a forum to present early results and receive constructive feedback and mentoring. *** Important Dates *** - Abstract deadline: As soon as possible before the fullpaper submission deadline. - Full paper deadline: April 5, 2021 (extended deadline) - Reviews sent to authors: May 9, 2021 (extended deadline) - Rebuttals due: May 13, 2021 (extended deadline) - Notification of acceptance: May 18, 2021 (extended deadline) - Camera-ready copies due: May 31, 2021 (extended deadline) - Conference: July 26-31, 2021 Informal submissions and doctoral programme - Submission deadline: May 15, 2021 - Notification of acceptance: June 1, 2021 All submissions should be made via easychair at https://easychair.org/conferences/?conf=cicm2021 As in previous years, we will publish the CICM 2021 proceedings with Springer LNCS. From matt.amy at dal.ca Mon Mar 29 18:59:17 2021 From: matt.amy at dal.ca (Matt Amy) Date: Mon, 29 Mar 2021 19:59:17 -0300 Subject: [TYPES/announce] Deadline extension: PLanQC 2021 Message-ID: ---------------------------------------------------------------------------------------------------------- ** *PLanQC 2021: Programming Languages for Quantum Computing* * Call for Submissions We invite members of the programming languages (PL) and quantum computing (QC) communities to submit talk proposals for the Second International Workshop on Programming Languages for Quantum Computing (PLanQC 2021), co-located with PLDI virtually this June. PLanQC aims to bring together researchers from the fields of programming languages and quantum information, exposing the programming languages community to the unique challenges of programming quantum computers. It will promote the development of tools to assist in the process of programming quantum computers, as they exist today and as they are likely to exist in the near to distant future. Submissions to PLanQC should take the form of 2-5 page abstracts (single-column, 11pt acmsmall style, not including references), with links to larger preprints when appropriate. Work in progress is welcome. We hope to make PLanQC maximally accessible to the programming languages community. Thus, abstracts should cover cutting edge ideas and results, but not be opaque to new, potential entrants to QC coming from PL. Abstracts will be reviewed for quality and relevance to the workshop, and accepted authors will be invited to give talks or poster presentations. We will not be publishing formal proceedings, but the extended abstracts, along with links (where available) to full papers will be posted to the workshop?s website. Invited speakers: ????????? ? ? ? Michael Hicks, University of Maryland ????????? ? ? ? John van de Wetering, Radboud University Workshop topics include (but are not limited to): ????????? ? ? ? High-level quantum programming languages ????????? ? ? ? Verification tools for quantum programs ????????? ? ? ? Novel quantum programming abstractions ????????? ? ? ? Quantum circuit and program optimizations ????????? ? ? ? Hardware-aware circuit compilation and routing ????????? ? ? ? Error handling, mitigation, and correction ????????? ? ? ? Instruction sets for quantum hardware ????????? ? ? ? Other techniques from traditional programming languages (e.g., types, compilation/optimization, foreign function interfaces) applied to the domain of quantum computation. Important dates (anywhere on earth): ------------------------------------------------------------------------- Abstract submission deadlineFri 9 Apr 2021 (UPDATED) NotificationWed 5 May 2021 WorkshopTue 22 Jun 2021 (UPDATED) ------------------------------------------------------------------------- Website:https://pldi21.sigplan.org/home/planqc-2021 Submission:https://planqc2021.hotcrp.com/ Program Committee: Matt Amy (chair)Dalhousie University Ross DuncanCambridge Quantum Computing Chris GranadeMicrosoft Research Yipeng HuangRutgers University Ali Javadi-AbhariIBM Giulia MeuliEPFL Jennifer PaykinGalois Inc Robert RandUniversity of Chicago Mathys RennelaINRIA Peter SelingerDalhousie University Dominique UnruhUniversity of Tartu Xiaodi WuUniversity of Maryland Nengkun YuUniversity of Technology Sydney Vladimir ZamdzhievINRIA Will ZengGoldman Sachs Margherita ZorziUniversity of Verona Organizing Committee: Matt AmyDalhousie University Ross DuncanCambridge Quantum Computing Robert RandUniversity of Chicago* -------------- next part -------------- An HTML attachment was scrubbed... URL: From m.sadrzadeh at ucl.ac.uk Tue Mar 30 06:56:27 2021 From: m.sadrzadeh at ucl.ac.uk (Sadrzadeh, Mehrnoosh) Date: Tue, 30 Mar 2021 10:56:27 +0000 Subject: [TYPES/announce] Final Call for Nominations: Beth Outstanding Dissertation Prize 2021 In-Reply-To: References: Message-ID: Final Call for Nominations: E. W. Beth Outstanding Dissertation Prize 2021 Since 2002, the Association for Logic, Language, and Information (FoLLI) has been awarding the annual E.W. Beth Dissertation Prize to outstanding Ph.D. dissertations in Logic, Language, and Information (http://www.folli.info/?page_id=74), with financial support of the E.W. Beth Foundation (https://www.knaw.nl/en/awards/funds/evert-willem-beth-stichting/evert-willem-beth-foundation). Nominations are now invited for the best dissertation in these areas resulting in a Ph.D. degree awarded in 2020. The deadline for nominations is the 15th of April 2021. Qualifications: - A Ph.D. dissertation on a topic concerning Logic, Language, or Information is eligible for the Beth Dissertation Prize 2021, if the degree was awarded between January 1st and December 31st, 2020. - There are no restrictions on the nationality, ethnicity, age, gender or employment status of the author of the nominated dissertation, nor on the university, academic department or scientific institution formally conferring the Ph.D. degree, nor on the language in which the dissertation has originally been written. - In accordance with the aim of the Beth Foundation to continue and extend the work of the Dutch logician Evert Willem Beth, nominations are invited of excellent dissertations on topics in the broad remit of ESSLLI, including current topics in philosophical and mathematical logic, computer science logic, philosophy of science, philosophy of language, history of logic, history of the philosophy of science and scientific philosophy in general, as well as the current theoretical and foundational developments in information and computation, language, and cognition. Dissertations with results more broadly impacting various research areas in their interdisciplinary investigations are especially solicited. - If a nominated dissertation has originally been written in a language other than English, its dossier should still contain the required 10 page English abstract, see below. If the committee decides that a nominated dissertation in a language other than English requires translation to English for proper evaluation, the committee can transfer its nomination to the competition in 2022. The English translation must in such cases be submitted before the deadline of the call for nominations in 2022. The committee may recommend the Beth Foundation to consider supporting such nominated dissertations for English translation, upon request by the author of the dissertation. The prize consists of: - a certificate - a donation of 3000 euros, provided by the E.W. Beth Foundation, divided among the winners, should there be more than one winner - an invitation to submit the dissertation, possibly after revision, for publication in FoLLI Publications on Logic, Language and Information (Springer). Only digital submissions are accepted, without exception. Hard copy submissions are not allowed. The following documents are to be submitted in the nomination dossier: - The original dissertation in pdf format (ps/doc/rtf etc. not acceptable). - A ten-page English abstract of the dissertation, presenting the main results of each chapter. - A letter of nomination from the dissertation supervisor, which concisely describes the scope and significance of the dissertation, stating when the degree was officially awarded and the members of the Ph.D. committee. Nominations should contain the address, phone and email details of the nominator. - Two additional letters of support, including at least one from a referee not affiliated with the academic institution that awarded the Ph.D. degree, nor otherwise related to the nominee (e.g. former teachers, supervisors, co-authors, publishers or relatives) or the dissertation. - Self-nominations are not possible. All pdf documents must be submitted electronically, as one zip file, via EasyChair by following the link https://easychair.org/conferences/?conf=bodp2021. In case of any problems or questions please contact the chair of the committee Mehrnoosh Sadrzadeh (m.sadrzadeh at ucl.ac.uk). The prize will be awarded by the chair of the FoLLI board at a ceremony during the 32nd ESSLLI summer school, which will be based in Utrecht, but held online August 2-13, 2021. Beth dissertation prize committee 2021: Samson Abramsky (University of Oxford) Maria Aloni (University of Amsterdam) Cleo Condoravdi(Stanford University) Robin Cooper (University of Gothenburg) Guy Emerson (University of Cambridge) Katrin Erk (University of Texas at Austin) Sujata Ghosh (ISI, Chennai) Davide Grossi (Universities of Groningen and Amsterdam) Christoph Haase (University of Oxford) Louise McNally (Universitat Pompeu Fabra Barcelona) Reinhard Muskens (University of Amsterdam) Mehrnoosh Sadrzadeh (University College London, chair) Mark Steedman (University of Edinburgh) Matthew Stone (Rutgers University) Jouko Vaananen (University of Helsinki and University of Amsterdam) FoLLI is committed to diversity and inclusion and we welcome dissertations from all under-represented groups -------------- next part -------------- An HTML attachment was scrubbed... URL: From davide.ancona at unige.it Thu Apr 1 08:38:54 2021 From: davide.ancona at unige.it (Davide Ancona) Date: Thu, 1 Apr 2021 14:38:54 +0200 Subject: [TYPES/announce] VORTEX 2021: Call for Papers Message-ID: VORTEX 2021, online Workshop at ECOOP/ISSTA 2021, Monday 12 July International Workshop on Verification and mOnitoring at Runtime EXecution (https://conf.researchr.org/track/ecoop-issta-2021/ecoop-issta-2021-vortex) ================================================================================ VORTEX brings together researchers working on all aspects of Runtime Monitoring (RM) with emphasis on integration with formal verification and testing. RM is concerned with the runtime analysis of software and hardware system executions in order to infer properties relating to system behaviour. Example applications include telemetry, log aggregation, threshold alerting, performance monitoring and adherence to correctness properties (more commonly referred to as Runtime Verification). RM has gained popularity as a solution to ensure software reliability, bridging the gap between formal verification and testing: on the one hand, the notion of event trace abstracts over system executions, thus favoring system agnosticism to better support reuse and interoperability; on the other hand, monitoring a system offers more opportunities for addressing error recovery, self-adaptation, and issues that go beyond software reliability. The goal of VORTEX is to bring together researchers contributing on all aspects of RM covering and possibly integrating both theoretical and practical aspects, with particular focus on hybrid approaches inspired by formal methods, program analysis, testing. Covid-19 -------- ECOOP 2021, ISSTA 2021, and all the affiliated events will take place virtually. Call for Papers --------------- Submissions are expected to be in English and to belong to one of the following two categories: * regular paper, page limit 8 in acmart style: unpublished self-contained work * extended abstract, page limit 4 in acmart style: original contribution, not yet fully developed Topics of interest include, but are not limited to, the following ones: * monitor construction and synthesis techniques * program adaptation * monitoring oriented programming * runtime enforcement, fault detection, recovery and repair * combination of static and dynamic analyses * specification formalisms for RM * specification mining * monitoring concurrent/distributed systems * RM for safety and security * RM for the Internet of Things * industrial applications * integrating RM, formal verification, and testing * tool development * instrumentation techniques for RM * surveys on different RM tools, formal frameworks or methodologies * presentations of RM tools Papers must be submitted electronically via EasyChair; the submission deadline is April 30 AoE. Authors should use the official ACM Master article template, which can be obtained from the ACM Proceedings Template pages. Latex users should use the sigconf option, as well as review to produce line numbers for easy reference by the reviewers, as indicated by the following command: \documentclass[sigconf,review]{acmart} Important Dates --------------- * Submission deadline: Fri 30 Apr 2021 * Author notification: Mon 17 May 2021 * Camera ready submission: Fri 4 Jun 2021 * Virtual workshop: Mon 12 Jul 2021 Proceedings ----------- Accepted regular papers and extended abstracts will be included in the proceedings published in the ACM Digital Library. Workshop Organizers ------------------- * Wolfgang Ahrendt, Chalmers University of Technology, Sweden * Davide Ancona, Universit? di Genova, Italy * Adrian Francalanza, University of Malta, Malta From anupamdotdas at gmail.com Thu Apr 1 10:48:07 2021 From: anupamdotdas at gmail.com (anupamdotdas at gmail.com) Date: Thu, 1 Apr 2021 15:48:07 +0100 Subject: [TYPES/announce] Call for Tutorials and Workshops: FroCoS 2021 & TABLEAUX 2021. 6-10 September, 2021. Birmingham, UK. Message-ID: <005701d72706$0763ff80$162bfe80$@gmail.com> FroCoS 2021 13th International Symposium on Frontiers of Combining Systems TABLEAUX 2021 30th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods Birmingham, UK, September 6-10, 2021 Websites: https://frocos2021.github.io, https://www.tableaux2021.org Contact: frocos2021 at easychair.org , tableaux21 at easychair.org Proposal submission deadline: 19 April 2021 FroCoS and TABLEAUX are two of the main conferences on the theory and application of logical systems. Their 2021 editions will be hosted by the University of Birmingham, UK, from 6 to 10 September 2021. In keeping with the tradition of the two events, we invite proposals for colocated workshops and tutorials on all topics related to logical reasoning: from theoretical aspects, to applications, to tools for interactive or automated reasoning. Workshops and tutorials can target the logical systems community in general, or alternatively focus on a particular system, recent theoretical development or application. TABLEAUX 2021 and FroCoS 2021 are intended to be hybrid conferences welcoming both physical and virtual participation. The organisers are closely monitoring the pandemic situation and may choose to make the conference virtual-only if it seems unreasonable to host any sort of physical event. A final decision will be taken before 14 June (12 weeks before the conference) to leave ample time for potential travel plans to be made. If in-person participation is possible, colocated events should take place on 6 and 8 September 2021. Workshop/tutorial-only attendees will enjoy a significantly reduced registration fee. Detailed matters such as the paper submission and review process, or the publication of proceedings, are up to the organisers of individual events. All accepted workshops and tutorials will be expected to have their program ready by *10 August 2021*. Proposals are invited to be submitted by email to frocos2021 at easychair.org and tableaux21 at easychair.org , no later than *19 April 2021*. Selected events will be notified by *26 April 2021*. The workshop/tutorial selection committee consists of the FroCoS and TABLEAUX program chairs. TUTORIALS We expect tutorials to be delivered in hybrid mode, combining the use of pre-recorded lecture material and (online or face-to-face) synchronous sessions. Proposals for tutorials should contain at least the following pieces of information: * name and contact details of the main organiser(s) * (if applicable) names of additional organisers * title of the tutorial * estimated number of attendees * short description of topic (up to one page) WORKSHOPS Proposals for workshops should contain at least the following pieces of information: * name and contact details of the main organiser(s) * (if applicable) names of additional organisers * title and organisational style of event (public workshop, project workshop, etc.) * preferred workshop mode (hybrid, situation permitting, or fully online) * estimated number of attendees * short description of topic (up to one page) * (if applicable) pointers to previous editions of the workshop, or to similar events -------------- next part -------------- An HTML attachment was scrubbed... URL: From mahsa at irif.fr Fri Apr 2 04:56:49 2021 From: mahsa at irif.fr (Mahsa) Date: Fri, 2 Apr 2021 10:56:49 +0200 Subject: [TYPES/announce] FORMATS 2021: 2nd CFP Message-ID: <36AB0F8C-D2FB-4905-8D9F-0C203BF86FD0@irif.fr> (Apologies for cross-posting) ================================================================ 2nd Call for Papers FORMATS 2021 (Virtual) 19th International Conference on Formal Modeling and Analysis of Timed Systems August 23rd-27th Universit? Paris-Est Cr?teil, France co-located with CONCUR, FMICS and QEST as part of QONFEST 2021 Webpage : https://qonfest2021.lacl.fr/formats21.php COVID-19 update: The conference will be online-only, hosted by the Laboratoire d'Algorithmique, Complexit? et Logique, Universit? Paris-Est Cr?teil. ================================================================ FORMATS is an annual conference aimed at promoting the study of fundamental and practical aspects of timed systems, and bringing together researchers from different disciplines that share interests in modelling, design, and analysis of timed computational systems. The conference aims to attract researchers interested in real-time issues in hardware design, performance analysis, real-time software, scheduling, semantics and verification of real-timed, hybrid and probabilistic systems. We particularly encourage submissions concerning applications of real-time systems and on relevant topics in interdisciplinary areas, such as robot motion planning. Typical topics include (but are not limited to): (1) Foundations and Semantics Theoretical foundations of timed systems and languages; comparison between different models (timed automata, timed Petri nets, hybrid automata, timed process algebra, max-plus algebra, probabilistic models). (2) Methods and Tools Techniques, algorithms, data structures, and software tools for analyzing timed systems and resolving temporal constraints (scheduling, worst-case execution time analysis, optimization, model checking, testing, constraint solving, etc.). (3) Applications Adaptation and specialization of timing technology in application domains such as real-time software, hardware circuits, and problems of scheduling in manufacturing and telecommunication. Special Sessions: Control Synthesis and Motion Planning for Cyber-physical and Control Systems There will be a special session on control synthesis and motion planning for cyber-physical and control systems in FORMATS this year. Real-world systems often include physical components, which impose constraints on the time and space evolution of the system, e.g., robots, smart cities, and medical devices. In this session, we are interested in all approaches, including both model-based and data-driven, to analysis and control design for such systems with logical and temporal specifications. We welcome submissions on this topic and in relevant areas. Paper Submission: FORMATS 2021 solicits high-quality papers reporting research results and/or experience reports related to the topics mentioned above. Submitted papers must contain original, unpublished contributions, not submitted for publication elsewhere. The papers should be submitted electronically in PDF, following the Springer LNCS style guidelines. Regular papers should not exceed 15 pages in length (excluding references, that are therefore not limited), and short papers (for instance describing case studies, or implementations) are limited to 5 pages. Each paper will undergo a thorough review process. If necessary, the paper may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. Papers will be submitted electronically via the EasyChair online submission system: https://easychair.org/conferences/?conf=formats2021 The proceedings of FORMATS 2021 will be published by Springer in the Lecture Notes in Computer Science series. The best paper of the conference will be awarded the Oded Maler Award in Timed Systems. Important Note Concerning the COVID-19 Pandemic: As per common decision of the organizers and chairs of the QONFEST conferences, FORMATS will be organized as a virtual conference. We would do our best to maintain the usual quality of the program, and moreover to have a scheduling that accommodate attendance from different time zones. Important dates: Abstract submission: April 23, 2021 (extended) Paper submission: April 27, 2021 (extended) Notification of acceptance: June 21, 2021 Final version due: July 02, 2021 Conference: August 23rd-27th, 2021 Invited Speakers: Jana Tumova, KTH Royal Institute of Technology, Stockholm, Sweden Daniele Magazzeni , King's College, London, & JP Morgan AI Research, UK Program Chairs Catalin Dima (France) Mahsa Shirmohammadi (France) QONFEST 2021 General Chair Beno?t Barbot (France) Steering Committee Rajeev Alur (USA) Eugene Asarin (France) Martin Fr?nzle (chair, Germany) Thomas A. Henzinger (Austria) Joost-Pieter Katoen (Germany) Kim G. Larsen (Denmark) Oded Maler (founding chair, France) (1957-2018) Pavithra Prabhakar (USA) Mari?lle Stoelinga (The Netherlands) Wang Yi (Sweden) Special-Session Chair Morteza Lahijanian (USA) Program Committee Parosh Aziz Abdulla (Sweden) Damien Busatto (Belgium) Thomas Chatain (France) Lorenzo Clemente (Poland) Liliana Cucu-Grosjean (France) Hugo Gimbert (France) Arnd Hartmanns (The Netherlands) Hsi-Ming Ho (UK) Sophia Knight (USA) Moez Krichen (Saudi Arabia) Engel Lefaucheux (Germany) Martina Maggio (Saarland University, Germany) Angelo Montanari (Italy) Igor Potapov (UK) Mickael Randour (Belgium) Mikhail Raskin (Germany) Cristian Riveros (Chile) Matteo Rossi (Italy) Kristin Yvonne Rozier (USA) Krishna S (India) Sadegh Soudjani (UK) Naijun Zhan (China) For any questions, feel free to contact the co-chairs Catalin Dima (dima at u-pec.fr ) and Mahsa Shirmohammadi (mahsa at irif.fr ) -------------- next part -------------- An HTML attachment was scrubbed... URL: From songfu1983 at shanghaitech.edu.cn Fri Apr 2 10:19:51 2021 From: songfu1983 at shanghaitech.edu.cn (songfu1983 at shanghaitech.edu.cn) Date: Fri, 2 Apr 2021 22:19:51 +0800 Subject: [TYPES/announce] CFP SETTA 2021 -Symposiumon Dependable Software Engineering: Theories, Tools and Applications Message-ID: <2021040222194610377634@shanghaitech.edu.cn> (apologies for cross-posting) ======================================== SETTA 2021: Symposium on Dependable Software Engineering: Theories, Tools and Applications Institute of Software, Chinese Academy of Sciences, Beijing, China, November 25-27, 2021 Submission deadline: July 23rd, 2021 Conference website: https://lcs.ios.ac.cn/setta2021/ Colocated with FM'2021 ======================================== ************************ ABOUT SETTA 2021 ************************ The Symposium on Dependable Software Engineering: Theories, Tools and Applications (SETTA) 2021 will be held in Beijing, China on November 25-27, 2021, co-located with FM'2021 and ChinaSoft 2021. Formal methods emerged as an important area in computer science and software engineering about half a century ago. An international community is formed researching, developing and teaching formal theories, techniques and tools for software modeling, specification, design and verification. However, the impact of formal methods on the quality improvement of software systems in practice is lagging behind. This is for instance reflected by the challenges in applying formal techniques and tools to engineering large-scale systems such as Cyber-Physical Systems (CPS), Internet-of-Things (IoT), Enterprise Systems, Cloud-Based Systems, and so forth. The purpose of the SETTA symposium is to bring international researchers together to exchange research results and ideas on bridging the gap between formal methods and software engineering. The interaction with the Chinese computer science and software engineering community is a central focus point. The aim is to show research interests and results from different groups so as to initiate interest-driven research collaboration. The SETTA symposium is aiming at academic excellence and its objective is to become a flagship conference on formal software engineering in China. To achieve these goals and contribute to the sustainability of the formal methods research, it is important for the symposium to attract young researchers into the community. Thus, this symposium encourages in particular the participation of young researchers and students. This year, SETTA welcomes submissions to the following two tracks: Journal First Papers and Research Papers. All submissions must be in the PDF format. Papers should be written in English. Submitted papers must be unpublished and not submitted for publication elsewhere. Accepted papers for both tracks must be presented at the conference. Latest News: A special issue for the Elsevier Journal of Systems Architecture (JSA) has been confirmed. Authors of selected papers from SETTA2021 will be invited to submit an extended version of their SETTA2021 paper to this special issue. ************************ LIST OF TOPICS ************************ Topics of interest include, but are not limited to: - Requirements specification and analysis - Formalisms for modeling, design and implementation - Model checking, theorem proving, and decision procedures - Scalable approaches to formal system analysis - Formal approaches to simulation, run-time verification, and testing - Integration of formal methods into software engineering practice - Contract-based engineering of components, systems, and systems of systems - Formal and engineering aspects of software evolution and maintenance - Parallel and multicore programming - Embedded, real-time, hybrid, probabilistic, and cyber-physical systems - Mixed-critical applications and systems - Formal aspects of service-oriented and cloud computing - Safety, reliability, robustness, and fault-tolerance - Dependability of smart software and systems - Empirical analysis techniques and integration with formal methods - Applications and industrial experience reports - Software tools to assist the construction or analysis of software systems ************************ RESEARCH PAPERS TRACK ************************ Research papers will be published in the SETTA 2021 proceedings as a volume in Springer's LNCS series. Papers should be submitted electronically through the EasyChair submission web page . ------------------------ Important Dates ------------------------ Abstract & Paper Submission: July 23, 2021 (AoE) Notification to authors: September 3, 2021 (AoE) Camera-ready versions: September 20, 2021 (AoE) Conference date: November 25-27, 2021 ------------------------ Submission Guidelines ------------------------ Authors are invited to submit papers on original research, industrial applications, or position papers proposing challenges in fundamental research and technology. The latter two types of submissions are expected to contribute to the development of formal methods and applications thereof in software engineering. This is done by either substantiating the advantages of integrating formal methods into the development cycle or through delineating the need for research by demonstrating weaknesses of existing technologies, especially when addressing new application domains. Submissions can take the form of either regular or short papers. Regular papers should not exceed 16 pages (excluding references) in LNCS format. Short papers can discuss ongoing research at an early stage, including PhD projects. Short papers should not exceed 6 pages (excluding references) in LNCS format. ************************ JOURNAL FIRST PAPERS TRACK ************************ The journal first papers track of SETTA 2021 is implemented in partnership with the Journal of Computer Science and Technology (JCST). Accepted papers to this track will be presented and discussed at the conference SETTA 2021. Papers should be submitted electronically through the journal's submission web page . ------------------------ Important Dates ------------------------ Paper Submission: May 31, 2021 (AoE) Tentative acceptance decision: July 16, 2021 (AoE) Acceptance decision: August 30, 2021 (AoE) Conference date: November 25-27, 2020 ------------------------ Submission Guidelines ------------------------ To submit to this track, authors have to make a journal submission to the Journal of Computer Science and Technology, and select the type of submission to be for the SETTA 2021 special issue. It is recommended that submitted papers follow the submission guidelines of JCST and do not exceed 15 pages including references. ************************ COMMITTEES ************************ General Chair: - Chen Zhao, Institute of Software, Chinese Academy of Sciences Program Chair: - Shengchao Qin, Teesside University - Jim Woodcock, University of York - Wenhui Zhang, Institute of Software, Chinese Academy of Sciences Local Organisation Chair: - Zhilin Wu, Institute of Software, Chinese Academy of Sciences Publicity Chair: - Fu Song, ShanghaiTech University Program Committee Members: - TBA ************************ VENUE ************************ The conference will be held in Beijing, China. ************************ CONTACT ************************ All questions about submissions should be emailed to setta2021 at easy*chair.org (remove *). -------------- next part -------------- An HTML attachment was scrubbed... URL: From gsilvia at uns.ac.rs Fri Apr 2 16:45:12 2021 From: gsilvia at uns.ac.rs (Silvia Ghilezan) Date: Fri, 2 Apr 2021 22:45:12 +0200 Subject: [TYPES/announce] PPDP 2021 Call for Papers Message-ID: <73D16F5B-564F-4FFF-A8F1-EB9AC0182647@uns.ac.rs> ====================== PPDP 2021 Call for Papers ====================== 23rd International Symposium on Principles and Practice of Declarative Programming 6?8 September 2021, Tallinn, Estonia http://imft.ftn.uns.ac.rs/PPDP2021 Collocated with LOPSTR 2021 =================================== Important Dates --------------------- - 08.05.2021 title and abstract submission - 15.05.2021 paper submission - 29.06.2021 rebuttal period (48 hours) - 09.07.2021 notification - 23.07.2021 final paper - 06.09.2021 conference starts About PPDP ---------- The PPDP 2021 symposium brings together researchers from the declarative programming communities, including those working in the functional, logic, answer-set, and constraint handling programming paradigms. The goal is to stimulate research in the use of logical formalisms and methods for analyzing, performing, specifying, and reasoning about computations, including mechanisms for concurrency, security, static analysis, and verification. Scope ----- Submissions are invited on all topics related to declarative programming, from principles to practice, from foundations to applications. Topics of interest include, but are not limited to - Language Design: domain-specific languages; interoperability; concurrency, parallelism and distribution; modules; functional languages; reactive languages; languages with objects; languages for quantum computing; languages inspired by biological and chemical computation; metaprogramming. - Declarative languages in artificial intelligence: logic programming; database languages; knowledge representation languages; probabilistic languages; differentiable languages. - Implementations: abstract machines; interpreters; compilation; compile-time and run-time optimization; memory management. - Foundations: types; logical frameworks; monads and effects; semantics. - Analysis and Transformation: partial evaluation; abstract interpretation; control flow; data flow; information flow; termination analysis; resource analysis; type inference and type checking; verification; validation; debugging; testing. - Tools and Applications: programming and proof environments; verification tools; case studies in proof assistants or interactive theorem provers; certification; novel applications of declarative programming inside and outside of CS; declarative programming pearls; practical experience reports and industrial application; education. The PC chair will be happy to advise on the appropriateness of a topic. Submission web page --------------------- https://easychair.org/conferences/?conf=ppdp2021 Submission Categories --------------------- Submissions can be made in three categories: - Research Papers, - System Descriptions, - Experience Reports. Submissions of Research Papers must present original research which is unpublished and not submitted elsewhere. They must not exceed 12 pages ACM style 2-column (including figures, but excluding bibliography). Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Research papers will be judged on originality, significance, correctness, clarity, and readability. Submission of System Descriptions must describe a working system whose description has not been published or submitted elsewhere. They must not exceed 10 pages and should contain a link to a working system. System Descriptions must be marked as such at the time of submission and will be judged on originality, significance, usefulness, clarity, and readability. Submissions of Experience Reports are meant to help create a body of published, refereed, citable evidence where declarative programming such as functional, logic, answer-set, constraint programming, etc., is used in practice. They must not exceed 5 pages **including references**. Experience Reports must be marked as such at the time of submission and need not report original research results. They will be judged on significance, usefulness, clarity, and readability. Supplementary material may be provided via a link to an extended version of the submission (recommended), or in a clearly marked appendix beyond the above-mentioned page limits. Reviewers are not required to study extended versions or any material beyond the respective page limit. Formating Guidelines ---------------------------- We plan to use the same publication arrangements as PPDP has had in previous years. For each paper category, you must use the most recent version of the "Current ACM Master Template" which is available at . The most recent version at the time of writing is 1.75. You must use the LaTeX sigconf proceedings template as the conference organizers are unable to process final submissions in other formats. In case of problems with the templates, contact ACM's TeX support team at Aptara . Authors should note ACM's statement on author's rights (http://authors.acm.org/) which apply to final papers. Submitted papers should meet the requirements of ACM's plagiarism policy (http://www.acm.org/publications/policies/plagiarism_policy). Requirements for Publication ---------------------------- At least one author of each accepted submission will be expected to attend and present the work at the conference. The PC chair may retract a paper that is not presented. The PC chair may also retract a paper if complaints about the paper's correctness are raised which cannot be resolved by the final paper deadline. ------------------------- -------------------- --------------------- Program committee co-chair: Nick Benton, Facebook Program committee co-chair: Silvia Ghilezan, University of Novi Sad & Mathematical Institute SASA Organising committee chair: Niccol? Veltri, Tallinn University of Technology Steering committee chair: James Cheney, Edinburgh University ------------------------- -------------------- --------------------- All questions about submissions should be emailed to the program chair Silvia Ghilezan . All questions about local information should be emailed to the local organiser Niccol? Veltri . From anas at cs.uni-salzburg.at Sat Apr 3 07:28:37 2021 From: anas at cs.uni-salzburg.at (Ana Sokolova) Date: Sat, 3 Apr 2021 13:28:37 +0200 Subject: [TYPES/announce] MFPS 2021 -- Call for Papers Message-ID: ========================================================= CALL FOR PAPERS: MFPS XXXVII https://www.coalg.org/calco-mfps-2021/mfps 37th Conference on Mathematical Foundations of Programming Semantics August 30 - September 2, 2021 Online or hybrid, from Salzburg Co-located with CALCO 2021 ========================================================== Paper submission: June 7, 2021 Author notification: August 2, 2021 Final version due: August 16, 2021 ========================================================== We are delighted to announce the 37th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2021). MFPS 2021 will be hosted by the University of Salzburg, Austria, and will take place on August 30???September 2, 2021. Due to the pandemic situation, the conference will take place online. Should the situation improve and allow some international travel, we will do our best to organize a small component of the meeting in Salzburg for those participants who wish to attend the meeting in person. MFPS conferences are dedicated to the areas of mathematics, logic, and computer science that are related to models of computation in general, and to semantics of programming languages in particular. This is a forum where researchers in mathematics and computer science can meet and exchange ideas. The participation of researchers in neighbouring areas is strongly encouraged. Topics include, but are not limited to, the following: bio-computation; concurrent qualitative and quantitative distributed systems; constructive mathematics; domain theory and categorical models; formal languages; formal methods; game semantics; lambda calculus; logic; probabilistic systems; process calculi; programming-language theory; quantum computation; security; topological models; type systems; type theory. We also welcome contributions that address applications of semantics to novel areas such as complex systems, markets, and networks, for example. MFPS 2021 is co-located with the 9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021). ------------------------------------------------- INVITED SPEAKERS: MFPS is known for an exciting group of invited speakers and organisers of special sessions. Stay tuned for more information! The list of invited speakers and special sessions for MFPS 2021 will be announced soon. ------------------------------------------------- PROGRAMME COMMITTEE: Sandra Alves, University of Porto, Portugal Henning Basold, University of Leiden, Netherlands Andrej Bauer, University of Ljubljana, Slovenia Stephen Brookes, Carnegie Mellon University, USA Corina Cirstea, University of Southampton, UK Fabio Gadducci, University of Pisa, Italy Ichiro Hasuo, NII, Japan Helle Hvid Hansen, University of Groningen, Netherlands Justin Hsu, University of Wisconsin-Madison, USA Patricia Johann, Appalachian State University, USA Achim Jung, University of Birmingham, UK Sandra Kiefer, RWTH Aachen University, Germany / University of Warsaw, Poland Barbara K?nig, University of Duisburg-Essen, Germany Catherine Meadows, NRL, USA Michael Mislove, Tulane University, USA Koko Muroya, RIMS, Kyoto University, Japan Joel Ouaknine, Max Planck Institute for Software Systems, Germany Prakash Panangaden, McGill University Montreal, Canada Daniela Petrisan, IRIF, Paris 7, France Tatjana Petrov, University of Konstanz, Germany Jurriaan Rot, Radboud University Nijmegen, Netherlands Mehrnoosh Sadrzadeh, UCL, UK Lutz Schr?der, Friedrich-Alexander-Universit?t Erlangen-N?rnberg, Germany Ana Sokolova, University of Salzburg, Austria (PC chair) Valeria Vignudelli, CNRS/ENS Lyon, France ------------------------------------------------- MFPS ORGANIZERS: Andrej Bauer, University of Ljubljana, Slovenia Stephen Brookes, Carnegie Mellon University, USA Achim Jung, University of Birmingham, UK Catherine Meadows, NRL, USA Michael Mislove, Tulane University, USA Joel Ouaknine, Max Planck Institute for Software Systems, Germany Prakash Panangaden, McGill University Montreal, Canada ------------------------------------------------- SUBMISSIONS Submissions should be prepared using the ENTCS Macros, and should be up to 12 pages long excluding bibliography and appendices. Submissions via https://easychair.org/conferences/?conf=mfps37 ------------------------------------------------- PROCEEDINGS A preliminary version will be distributed at the meeting. Final proceedings will be published in ENTCS after the meeting. ENTCS is open access. ------------------------------------------------- CONTACT For any further information about MFPS 2021, please contact Ana Sokolova ( anas at cs.uni-salzburg.at). -------------- next part -------------- An HTML attachment was scrubbed... URL: From davidl at binghamton.edu Sun Apr 4 16:49:54 2021 From: davidl at binghamton.edu (Yu David Liu) Date: Sun, 4 Apr 2021 16:49:54 -0400 Subject: [TYPES/announce] COP'21 Message-ID: Call for Papers The 13th International Workshop on Context-Oriented Programming and Advanced Modularity (COP'21) Co-located with ECOOP/ISSTA'21, online, July 2021 https://2021.ecoop.org/track/ecoop-issta-2021-cop COP invites submissions of high-quality papers reporting original research, or describing innovative contributions to, or experience with context-oriented programming, and broadly, programming ideas on modularity. Topics of interest to the workshop include, but are not limited to: - Context-Oriented Programming (COP) and Contextual modeling in modern computer systems (mobile systems, IoTs, cloud/edge computing, autonomous systems, etc.); - Programming language abstractions for COP (e.g., dynamic scoping, roles, traits, prototype-based extensions); - Implementation issues for COP (e.g., optimization, VM support, JIT compilation); - COP applications in computer systems (e.g., mobile systems, IoTs, cloud/edge computing, security); - COP applications in autonomous systems (e.g., unmanned aerial vehicles, autonomous vehicles); - Configuration languages (e.g., feature description interpreters, transformational approaches); - Programming language abstractions for composition and modularization (e.g., modules, aspects, features, layers, plugins, libraries, components); - Theoretical foundations and reasoning support for COP and modular systems (e.g., semantics, type systems, mechanized proofs); - Software lifecycle support for modularization (e.g., requirements; architecture; synthesis; metrics; software product lines; economics; testing; patterns); - Tool support for modular software development (e.g., platform; refactoring; static and dynamic analysis; evolution; reverse engineering; mining); - Modular applications (e.g., data-intensive applications, micro-services, serverless computing); Important Dates Mon 19 Apr 2021, Submission Deadline Mon 17 May 2021, Notifications -- Yu David Liu Department of Computer Science SUNY Binghamton -------------- next part -------------- An HTML attachment was scrubbed... URL: From p.l.lumsdaine at gmail.com Mon Apr 5 06:31:32 2021 From: p.l.lumsdaine at gmail.com (Peter LeFanu Lumsdaine) Date: Mon, 5 Apr 2021 11:31:32 +0100 Subject: [TYPES/announce] Reminder: 2-year position in HoTT at Stockholm, deadline this Friday Message-ID: Dear all, A quick reminder of the researcher position in HoTT that I advertised a couple of weeks ago, with deadline this Friday (9 April). One point a couple of people asked about: Yes, this is effectively a postdoc ? it?s formally called a ?researcher? position here for administrative reasons. We are interested in applicants at any post-PhD stage (or expecting to complete their PhD before the position starts). Application link: https://www.su.se/english/about-the-university/work-at-su/available-jobs?rmpage=job&rmjob=14506&rmlang=UK Once again, let me know if you have any questions! Best wishes, ?Peter. On Mon, Mar 22, 2021 at 12:31 PM Peter LeFanu Lumsdaine < p.l.lumsdaine at gmail.com> wrote: > > Dear all, > > I?m pleased to announce that we?re hiring for a researcher position in Homotopy Type Theory at Stockholm University. It?s a 2 year position, provisionally starting this August, in the logic group of the Mathematics Department, supported by the Wallenberg Foundation project grant ?Type Theory for Mathematics and Computer Science? (PI Thierry Coquand). The application deadline is 9 April. > > We welcome all applicants interested in working on homotopy type theory and related topics ? either with previous background in HoTT, or with background in related fields but interested in moving into HoTT. > > Full details and application at > https://www.su.se/english/about-the-university/work-at-su/available-jobs?rmpage=job&rmjob=14506&rmlang=UK > Departmental webpage: https://www.math.su.se > > Please get in touch with me if you have any questions about the position! > > Best, > ?Peter. -------------- next part -------------- An HTML attachment was scrubbed... URL: From elaine.pimentel at gmail.com Mon Apr 5 15:37:56 2021 From: elaine.pimentel at gmail.com (Elaine Pimentel) Date: Mon, 5 Apr 2021 16:37:56 -0300 Subject: [TYPES/announce] TLLA 2021 - 1st cfp Message-ID: ================================================================ Call for Papers TLLA 2021 5th International Workshop on Trends in Linear Logic and Applications Rome, 27-28 June 2021 Affiliated with ACM/IEEE LICS https://lipn.univ-paris13.fr/TLLA/2021/ ================================================================ Linear Logic is not only a proof theoretical tool to analyze or control the use of resources in logic and computation. It is also a corpus of tools, approaches, and methodologies (proof nets, exponential decomposition, geometry of interaction, coherent spaces, relational models, etc.) that, even if developed for studying Linear Logic syntax and semantics, have been applied in several other fields (analysis of lambda-calculus computations, game semantics, computational complexity, program verification, etc.). The TLLA international workshop aims at bringing together researchers working on Linear Logic or applying it or its tools. The main goal is to present and discuss trends in the research on Linear Logic and its applications by means of tutorials, invited talks, open discussions, and contributed talks. The purpose is to gather researchers interested in the connections between Linear Logic and various topics such as * theory of programming languages * implicit computational complexity * parallelism and concurrency * games and languages * proof theory * philosophy * categories and algebra * possible connections with combinatorics * linguistics * functional analysis and operator algebras ---------------------------------------------------------------------- ** Submission Guidelines ---------------------------------------------------------------------- Contributions are not restricted to talks presenting an original results, but open to tutorials, open discussions, and position papers. For this reason, we strongly encourage contributions presenting work in progress, open questions, and research projects. Contributions presenting the application of linear logic results, techniques, or tools to other fields, or vice versa, are most welcome. To propose a contributed talk submit a short abstract whose length is between 2 and 5 pages on https://easychair.org/conferences/?conf=tlla2021 ---------------------------------------------------------------------- ** Important dates ---------------------------------------------------------------------- * Submission deadline: 2 May 2021 * Notification to authors: 14 May 2021 * Final versions due: 24 May 2021 * Workshop date: 27-28 June 2021 ---------------------------------------------------------------------- ** Publication ---------------------------------------------------------------------- The abstracts of the contributed and invited talks will be published on the site of the conference. Possible other formats will be discussed at the workshop. ---------------------------------------------------------------------- ** Tutorials ---------------------------------------------------------------------- TBA ---------------------------------------------------------------------- ** Invited Speakers ---------------------------------------------------------------------- TBA ---------------------------------------------------------------------- ** Program Committee ---------------------------------------------------------------------- * Claudia Faggian, CNRS - University Paris Diderot, France * Giulio Guerrieri, University of Bath, UK * Naohiko Hoshino, Tojo University, Japan * Sonia Marin, University College London, UK * Elaine Pimentel, Federal University of Rio Grande do Norte, Brazil (co-chair) * Paolo Pistone, Universit? di Bologna, Italy * Myriam Quatrini, Universit? de la M?diterran?e * Christian Retor?, Universit? de Montpellier, France (co-chair) * Thomas Seiller, University of Paris 13, France * Lutz Strassburger, Inria Saclay, France ---------------------------------------------------------------------- ** Organization Committee ---------------------------------------------------------------------- * Thomas Ehrhard, CNRS - University Paris Diderot, France * Stefano Guerrini, University of Paris 13, France * Lorenzo Tortora de Falco, University Roma Tre, Italy ---------------------------------------------------------------------- ** Contact ---------------------------------------------------------------------- All questions about submissions should be emailed to the PC chairs at elaine.pimentel at gmail.com -- Christian Retor? & Elaine Pimentel -------------- next part -------------- An HTML attachment was scrubbed... URL: From claudio.sacerdoticoen at unibo.it Tue Apr 6 12:29:46 2021 From: claudio.sacerdoticoen at unibo.it (Claudio Sacerdoti Coen) Date: Tue, 6 Apr 2021 16:29:46 +0000 Subject: [TYPES/announce] 3 Post-doc positions on semantics of PLs References: Message-ID: 3? POST-DOC POSITIONS on the semantics of programming languages We have 3 post-doc positions at the Department of Computer Science of the University of Bologna.? The research theme is coinductive proof techniques and abstract interpretation, with application to concurrent and/or functional languages. Types are expected to play a significant role.? The positions should start sometimes in 2021, the exact date is negotiable.? Each position covers 1 year, with possibilities of extension for another year. The funding? comes from a national project whose other sites are Verona (R. Giacobazzi), Padova (F. Ranzato), and Pisa (F. Bonchi). The work will be carried out in close connection with the ERC project DIAPASoN (led by Ugo? Dal Lago, U. Bologna), which also focuses on semantics of programming languages, using tools and techniques based on logical relations, bisimulation, game semantics, and linear logic. Instructions for applying may be found here: https://bandi.unibo.it/ricerca/assegni-ricerca?id_bando=53293 (then, follow the link "Call for applications", in English, or "Bando", in Italian; you may ignore the "attachments" in the page) In case of problems, or for more information, do not hesitate to contact me or Davide Sangiorgi (deadline: 12 April 2021) Thanks, C.S.C. -- Prof. Claudio Sacerdoti Coen Department of Computer Science and Engineering University of Bologna From lmoss at indiana.edu Tue Apr 6 21:29:15 2021 From: lmoss at indiana.edu (Moss, Larry) Date: Wed, 7 Apr 2021 01:29:15 +0000 Subject: [TYPES/announce] ESSLLI 2022 Call for Course and Workshop Proposals Message-ID: [Apologies for cross-posting] CALL FOR COURSE AND WORKSHOP PROPOSALS 33rd European Summer School in Logic, Language and Information - ESSLLI 2022 8-19 August, 2022, Galway, Ireland https://2022.esslli.eu/ IMPORTANT DATES: 15 June 2021: Course Title submission deadline (mandatory) 22 June 2021: Final submission 14 September 2021: Notification Under the auspices of the Association for Logic, Language, and Information (FoLLI), the European Summer School in Logic, Language, and Information (ESSLLI) runs every year. Except for 2021, where the school will be virtual, it runs in a different European country each year. It takes place over two weeks in the summer, hosts approximately 50 different courses at both introductory and advanced levels, and attracts around 400 participants from all over the world. Since 1989, ESSLLI has been providing outstanding interdisciplinary educational opportunities in the fields of Computer Science, Cognitive Science, Linguistics, Logic, Philosophy, and beyond. It comes from a community which recognizes that advances in our common areas require the contributions of multiple interrelated disciplines. The main focus of ESSLLI is the interface between linguistics, logic and computation, with special emphasis in human linguistic and cognitive ability. Courses, both introductory and advanced, cover a wide variety of topics within the combined areas of interest: Logic and Computation, Computation and Language, and Language and Logic. Workshops are also organized, providing opportunities for in-depth discussion of issues at the forefront of research, as well as a series of invited evening lectures. TOPICS AND FORMAT Proposals for courses and workshops at ESSLLI 2022 are invited in all areas of Logic, Linguistics and Computer Sciences. Cross-disciplinary and innovative topics are particularly encouraged. Each course and workshop will consist of five 90 minute sessions, offered daily (Monday-Friday) in a single week. Proposals for two-week courses should be structured and submitted as two independent one-week courses, e.g. as an introductory course followed by an advanced one. In such cases, the ESSLLI program committee reserves the right to accept just one of the two proposals. All instructional and organizational work at ESSLLI is performed completely on a voluntary basis, so as to keep participation fees to a minimum. However, organizers and instructors have their registration fees waived, and are reimbursed for travel and accommodation expenses up to a level to be determined and communicated with the proposal notification. ESSLLI can only guarantee reimbursement for at most one course/workshop organizer, and can not guarantee full reimbursement of travel costs for lecturers or organizers from outside of Europe. The ESSLLI organizers would appreciate any help in controlling the School's expenses by seeking partial or complete coverage of travel and accommodation expenses from other sources. CATEGORIES Each proposal should fall under one of the following categories. * FOUNDATIONAL COURSES * Such courses are designed to present the basics of a research area, to people with no prior knowledge in that area. They should be of elementary level, without prerequisites in the course's topic, though possibly assuming a level of general scientific maturity in the relevant discipline. They should enable researchers from related disciplines to develop a level of comfort with the fundamental concepts and techniques of the course's topic, thereby contributing to the interdisciplinary nature of our research community. * INTRODUCTORY COURSES * Introductory courses are central to ESSLLI's mission. They are intended to introduce a research field to students, young researchers, and other non-specialists, and to foster a sound understanding of its basic methods and techniques. Such courses should enable researchers from related disciplines to develop some comfort and competence in the topic considered. Introductory courses in a cross-disciplinary area may presuppose general knowledge of the related disciplines. * ADVANCED COURSES * Advanced courses are targeted primarily to graduate students who wish to acquire a level of comfort and understanding in the current research of a field. * WORKSHOPS * Workshops focus on specialized topics, usually of current interest. Workshop organizers are responsible for soliciting papers and selecting the workshop program. They are also responsible for publishing proceedings if they decide to have proceedings. PROPOSAL GUIDELINES Course and workshop proposals should closely follow these guidelines to ensure full consideration. Course and Workshop proposals can be submitted by no more than two lecturers/organizers and they are presented by no more than these two lecturers/organizers. All instructors and organizers must possess a PhD or equivalent degree by the submission deadline. Course proposals should mention explicitly the intended course category. Proposals for introductory courses should indicate the intended level, for example as it relates to standard textbooks and monographs in the area. Proposals for advanced courses should specify the prerequisites in detail. Proposals of Courses given at ESSLLI the previous year will have a lower priority of being accepted in the current year. Proposals must be submitted in PDF format via: https://easychair.org/conferences/?conf=esslli2022 and include all of the following: a. Personal information for each proposer: Name, affiliation, contact address, email, homepage (optional) b. General proposal information: Title, category c. Contents information: Abstract of up to 150 words Motivation and description (up to two pages) Tentative outline Expected level and prerequisites Appropriate references (e.g. textbooks, monographs, proceedings, surveys) d. Information on the proposer and course: Will your course appeal to students outside of the main discipline of the course? Include information on your experience in the intensive one-week interdisciplinary setting Include evidence that the course proposer is an excellent lecturer e. Information from workshop organizers: Include information on relevant preceding meetings and events, if applicable Include information about potential external funding for participants SUBMISSION INFORMATION By June 15: You are asked to submit in EasyChair at least the name(s) of the instructor(s), the ESSLLI area+course level and a short abstract. By June 22: Your submission must be completed by uploading a PDF with the actual proposal as detailed above. SUBMISSION PORTAL Please submit your proposals to https://easychair.org/conferences/?conf=esslli2022 CHILDCARE: If there is enough interest, ESSLLI will provide information on private child care services available during the summer school. EACSL SPONSORSHIP The EACSL will support one Logic and Computation course or workshop addressing topics of interest to Computer Science Logic (CSL) conferences. The selected course or workshop will be designated an EACSL course/workshop in the programme. If you wish to be considered for this, please indicate so in your proposal. ORGANIZING COMMITTEE John P. McCrae (NUI Galway) Mihael Arcan (NUI Galway) Paul Buitelaar (NUI Galway) PROGRAM COMMITTEE Chair: Larry Moss (Indiana University) Local Co-chair: Matthias Nickles (NUI Galway) Area Chairs: Language and Computation (LaCo): Walter Daelemans (University of Antwerp) Alessandro Lenci (University of Pisa) Lonneke van der Plas (University of Malta) Language and Logic (LaLo): Maria Aloni (University of Amsterdam) Hans Kamp (University of Stuttgart) Kristen Syrett (Rutgers University) Logic and Computation (LoCo): Samson Abramsky (University of Oxford) Franz Baader (TU Dresden) Christoph Benzm??ller (FU Berlin) ESSLLI STEERING COMMITTEE Darja Fiser (University of Ljubljana) (chair) Phokion Kolaitis (University of California, Santa Cruz) (vice-chair) Petya Osenova (Bulgarian Academy of Sciences and Sofia University) (secretary) Jakub Szymanik (University of Amsterdam) Roman Kuznets (TU Wien) -------------- next part -------------- An HTML attachment was scrubbed... URL: From riccardo.treglia at unito.it Fri Apr 9 05:31:28 2021 From: riccardo.treglia at unito.it (Riccardo Treglia) Date: Fri, 9 Apr 2021 11:31:28 +0200 Subject: [TYPES/announce] ITRS 21 CfP (Extended Deadline) Message-ID: ITRS 2021 Call for papersTenth Workshop on Intersection Types and Related Systems - ITRS 2021 17 July 2021, Online Affiliated with FSCD , 17-24 July 2021, Buenos Aires Web page: http://www.di.unito.it/~deligu/ITRS2021/ Aims and Scope Intersection types were introduced near the end of the 1970s to overcome the limitations of Curry's type assignment system and to provide a characterization of the strongly normalizing terms of the Lambda Calculus. The key idea is to introduce an intersection type constructor ? such that a term of type t ? s can be used at both type t and s within the same context. This provides a finite polymorphism where various, even unrelated, types of the term are listed explicitly, differently from the more widely used universally quantified types where the polymorphic type is the common schema that stands for its various type instances. As a consequence, more terms (all and only the normalizing terms) can be typed than with universal polymorphism. Although intersection types were initially intended for use in analyzing and/or synthesizing lambda models as well as in analyzing normalization properties, over the last twenty years the scope of the research on intersection types and related systems has broadened in many directions. Restricted (and more manageable) forms have been investigated, such as refinement types. Type systems based on intersection type theory have been extensively studied for practical purposes, such as program analysis and higher-order model checking. The dual notion of union types turned out to be quite useful for programming languages. Finally, the behavioural approach to types, which can give a static specification of computational properties, has become central in the most recent research on type theory. The ITRS 2021 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches. Possible topics for submitted papers include, but are not limited to: - Formal properties of systems with intersection types. - Results for related systems, such as union types, refinement types, or singleton types. - Applications to lambda calculus, pi-calculus and similar systems. - Applications for programming languages, program analysis, and program verification. - Applications for other areas, such as database query languages and program extraction from proofs. - Related approaches using behavioural/intensional types and/or denotational semantics to characterize computational properties. - Quantitative refinements of intersection types. ITRS workshops have been held every two years (with the exception of 2020, because of COVID-19 outbreak). Information about the previous events is available on the ITRS home page . Invited Speaker - Jeremy Siek (Indiana University Bloomington) Paper Submissions Papers must be original and not previously published, nor submitted elsewhere. Papers should be prepared in LaTeX using the EPTCS macro package and should be in the range of 3-16 pages, plus at most 2 pages of references. Submissions will be collected via EasyChair and reviewed by anonymous referees. Important Dates - Paper submission: 12 April *26 April 2021 (extended)* - Author notification: 24 May 2021 - Final version: 18 June 2021 - Workshop: 17 July 2021 Program Committee - Antonio Bucciarelli, Universit? de Paris, France - Daniel De Carvalho, Innopolis University, Russia - Andrej Dudenhefner, Saarland University, Germany - Silvia Ghilezan, University of Novi Sad, Serbia - Giulio Guerrieri, University of Bath, UK - Ugo de' Liguoro, Universit? di Torino, Italy (chair) - Jeremy Siek, Indiana University Bloomington, USA (co-chair) Organizers: Ugo de' Liguoro, Universit? di Torino, Italy Riccardo Treglia, Universit? di Torino, Italy (riccardo.treglia at unito.it) Steering Committee - Mariangiola Dezani-Ciancaglini, Universit? di Torino, Italy - Jakob Rehof, TU University of Dortmund, Germany - Joe Wells, Heriot-Watt University, Scotland -------------- next part -------------- An HTML attachment was scrubbed... URL: From ohad.kammar at ed.ac.uk Fri Apr 9 06:45:12 2021 From: ohad.kammar at ed.ac.uk (Ohad Kammar) Date: Fri, 9 Apr 2021 11:45:12 +0100 Subject: [TYPES/announce] HOPE'21@ICFP-CfP: ACM SIGPLAN Workshop on Higher-Order Programming with Effects Message-ID: HOPE'21: ACM SIGPLAN Workshop on Higher-Order Programming with Effects August 22nd, 2021 (Sun), ONLINE (immediately before the main ICFP) Call-for presentations https://icfp21.sigplan.org/home/hope-2021 HOPE is an established informal workshop bringing together researchers interested in the design, semantics, implementation, and verification of higher-order effectful programs. Talks about work in progress are particularly encouraged. It has been held since 2012 in affiliation with ICFP. We solicit proposals for contributed talks, in plain text or PDF format. The motivation, the problem to solve, accomplished and anticipated results should be clear from two first pages of the submission. By default contributed talks are about 30 minutes long; proposals for shorter or longer talks will also be considered. Speakers may also submit supplementary material (e.g. a full paper, talk slides), which PC members are free (but not expected) to read. If you have any questions about the relevance of a particular topic, please contact the PC chairs, Oleg Kiselyov (oleg at okmij.org) and Ohad Kammar (ohad.kammar at ed.ac.uk). * Deadline for talk proposals: **May 6th, 2021** (Thursday) * Notification of acceptance: **June 14th, 2021** (Monday) * Workshop: **August 22nd, 2021** (Sunday) Program Committee Anton Bachin USA Eli Bingham Broad Institute, USA Liron Cohen Ben Gurion Univeristy, Israel Ohad Kammar (co-chair) University of Edinburgh, Scotland, UK Jeehoon Kang KAIST, South Korea Oleg Kiselyov (co-chair) Tohoku University, Japan Andreas Rossberg DFinity Foundation, Germany Kathrin Stark Princeton University, New Jersey, USA Simon Thompson University of Kent / IOHK, England, UK The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. Is e buidheann carthannais a th? ann an Oilthigh Dh?n ?ideann, cl?raichte an Alba, ?ireamh cl?raidh SC005336. -------------- next part -------------- An HTML attachment was scrubbed... URL: From jes at math.uminho.pt Tue Apr 6 10:42:04 2021 From: jes at math.uminho.pt (=?UTF-8?Q?Jos=c3=a9_Carlos_Esp=c3=adrito_Santo?=) Date: Tue, 6 Apr 2021 15:42:04 +0100 Subject: [TYPES/announce] Pos doc position at University of Minho Message-ID: A call is open for one post doctorate position at the Centre of Mathematics, University of Minho, Portugal. The Centre has a research group interested in proof theory, type theory and lambda-calculus. The candidate must hold a doctorate degree completed in the three years preceding the application. The call is open until?the 16th of April 2021. The formal announcement is available at https://cmat.uminho.pt/sites/default/files/2021-03/CMAT_UM_Edital_BolsaBIPD_Mar2021_eng_final_2.pdf For further inquiries, please contact: Jos? Esp?rito Santo jes AT math.uminho.pt -------------- next part -------------- An HTML attachment was scrubbed... URL: From simona.k at uns.ac.rs Fri Apr 9 07:22:10 2021 From: simona.k at uns.ac.rs (Simona Kasterovic) Date: Fri, 9 Apr 2021 13:22:10 +0200 Subject: [TYPES/announce] LAP 2021 - Logic and Applications: CFP Message-ID: ========================================================= LAP 2021 CONFERENCE ANNOUNCEMENT LOGIC AND APPLICATIONS - LAP 2021 September 20-24, 2021, Dubrovnik, Croatia http://imft.ftn.uns.ac.rs/math/cms/LAP2021 The conference brings together researchers from various fields of logic with applications in computer science. Topics of interest include, but are not restricted to: - Formal systems of classical and non-classical logic; - Category theory; - Proof theory; - Set theory; - Type theory; - Lambda calculus; - Process algebras and calculi; - Behavioural types; - Systems of reasoning in the presence of incomplete, imprecise and/or contradictory information; - Computational complexity; - Interactive theorem provers; - Security and Privacy. Student sessions will be organized. ------------------------------------------------- LAP is a series of conferences held at IUC - Inter University Center Dubrovnik, Croatia. The first conference Proof Systems was held on June 28, 2012, co-located with the conference LICS 2012, followed by LAP 2013, September 16-20, 2013 (http://imft.ftn.uns.ac.rs/math/cms/LAP2013) LAP 2014, September 22-26, 2014 (http://imft.ftn.uns.ac.rs/math/cms/LAP2014) LAP 2015, September 21-25, 2015 (http://imft.ftn.uns.ac.rs/math/cms/LAP2015) LAP 2016, September 19-23, 2016 (http://imft.ftn.uns.ac.rs/math/cms/LAP2016) LAP 2017, September 18-22, 2017 (http://imft.ftn.uns.ac.rs/math/cms/LAP2017) LAP 2018, September 24-28, 2018 (http://imft.ftn.uns.ac.rs/math/cms/LAP2018) LAP 2019, September 23-27, 2019 (http://imft.ftn.uns.ac.rs/math/cms/LAP2019) LAP 2020, September 21-25, 2020 (http://imft.ftn.uns.ac.rs/math/cms/LAP2020) ------------------------------------------------- IMPORTANT DATES Abstract Submission: June 15, 2021 Author Notification: July 1, 2021 Final version: July 8, 2021 ------------------------------------------------- SUBMISSION Authors should submit an abstract in LaTeX format, not exceeding three pages, to vlp at mi.sanu.ac.rs (with the subject "LAP 2021"). ------------------------------------------------- LOCATION: IUC - Inter University Center Dubrovnik http://www.iuc.hr/ ------------------------------------------------- COURSE DIRECTORS - Zvonimir ?iki?, University of Zagreb - Andre Scedrov, University of Pennsylvania - Silvia Ghilezan, University of Novi Sad - Zoran Ognjanovi?, Mathematical Institute SANU, Belgrade - Thomas Studer, University of Bern ================================================================== -------------- next part -------------- An HTML attachment was scrubbed... URL: From jonathan.protzenko at gmail.com Fri Apr 9 15:46:38 2021 From: jonathan.protzenko at gmail.com (Jonathan Protzenko) Date: Fri, 9 Apr 2021 12:46:38 -0700 Subject: [TYPES/announce] ML Family Workshop 2021: first call for short abstracts and presentations Message-ID: (tl;dr) The ML family workshop is back, and will be held virtually along with ICFP 2021. The workshop does not have proceedings, making it the perfect venue to run some ideas with the community or present some work in progress within a friendly environment. The PC has a broad expertise and submissions are 3 pages long: when in doubt, just submit! (long version) We are happy to announce that the ML Family Workshop is back for its 2021 edition, which we will be held online on Thursday August 26th, in conjunction with ICFP 2021. The ML family workshop warmly welcomes submission touching on the programming languages traditionally seen as part of the "ML family" (Standard ML, OCaml, F#, CakeML, SML#, Manticore, MetaOCaml, etc.). The scope of the workshop includes all aspects of the design, semantics, theory, application, implementation, and teaching of the members of the ML family. We also encourage presentations from related languages (such as Haskell, Scala, Rust, Nemerle, Links, Koka, F*, Eff, ATS, etc), to exchange experience of further developing ML ideas. ## Submission details Submissions must be at most three pages long; see the full call for papers for details. Submission site: https://ml21.hotcrp.com/ ## Important dates Thu, May 27th 2021 (AoE): submission deadline Thu, Jun 17th 2021 (AoE): author notification Thu, Aug 26th: workshop (time slots TBD) ## Program committee Danel Ahman (University of Ljubljana) Robert Atkey (University of Strathclyde) Fr?d?ric Bour (Tarides) Ezgi ?i?ek (Facebook London) Youyou Cong (Tokyo Institute of Technology) Richard A. Eisenberg (Tweag I/O) Martin Elsman (University of Copenhagen, Denmark) Ohad Kammar (University of Edinburgh) Naoki Kobayashi (University of Tokyo, Japan) Beno?t Montagu (Inria) Jonathan Protzenko (Microsoft Research) (Chair) Kristina Sojakova (INRIA Paris) Don Syme (Microsoft) Mat?as Toro (University of Chile) Katsuhiro Ueno (Tohoku University) From bruno.bernardo at tutanota.com Sat Apr 10 06:50:06 2021 From: bruno.bernardo at tutanota.com (Bruno Bernardo) Date: Sat, 10 Apr 2021 12:50:06 +0200 (CEST) Subject: [TYPES/announce] FMBC 2021 - 2nd Call for Papers Message-ID: [ Please distribute, apologies for multiple postings. ] ======================================================================== 3rd International Workshop on Formal Methods for Blockchains (FMBC) - Second Call https://fmbc.gitlab.io/2021 July 18 or 19 (TBA), 2021 Co-located with the 33nd International Conference on Computer-Aided Verification (CAV 2021) http://i-cav.org/2021/ ------------------------------------------------------------- IMPORTANT DATES -------------------------------- Abstract submission: April 22, 2021 Full paper submission: April 29, 2021 Notification: June 10, 2021 Camera-ready: July 8, 2021 Workshop: July 18 or 19 (TBA), 2021 Deadlines are Anywhere on Earth: https://en.wikipedia.org/wiki/Anywhere_on_Earth -------------------------------- -------------------------------- TOPICS OF INTEREST -------------------------------- Blockchains are decentralized transactional ledgers that rely on cryptographic hash functions for guaranteeing the integrity of the stored data. Participants on the network reach agreement on what valid transactions are through consensus algorithms. Blockchains may also provide support for Smart Contracts. Smart Contracts are scripts of an ad-hoc programming language that are stored in the Blockchain and that run on the network. They can interact with the ledger?s data and update its state. These scripts can express the logic of possibly complex contracts between users of the Blockchain. Thus, Smart Contracts can facilitate the economic activity of Blockchain participants. With the emergence and increasing popularity of cryptocurrencies such as Bitcoin and Ethereum, it is now of utmost importance to have strong guarantees of the behavior of Blockchain software. These guarantees can be brought by using Formal Methods. Indeed, Blockchain software encompasses many topics of computer science where using Formal Methods techniques and tools are relevant: consensus algorithms to ensure the liveness and the security of the data on the chain, programming languages specifically designed to write Smart Contracts, cryptographic protocols, such as zero-knowledge proofs, used to ensure privacy, etc. This workshop is a forum to identify theoretical and practical approaches of formal methods for Blockchain technology. Topics include, but are not limited to: * Formal models of Blockchain applications or concepts * Formal methods for consensus protocols * Formal methods for Blockchain-specific cryptographic primitives or protocols * Design and implementation of Smart Contract languages * Verification of Smart Contracts -------------------------------- -------------------------------- SUBMISSION -------------------------------- Submit original manuscripts (not published or considered elsewhere) with a page limit of 12 pages for full papers and 6 pages for short papers (excluding bibliography and short appendix of up to 5 additional pages). Alternatively you may also submit an extended abstract of up to 3 pages (including bibliography) summarizing your ongoing work in the area of formal methods and blockchain. Authors of selected extended-abstracts are invited to give a short lightning talk. Submission link: https://easychair.org/conferences/?conf=fmbc2021 Authors are encouraged to use LaTeX and prepare their submissions according to the instructions and styling guides for OASIcs provided by Dagstuhl. Instructions for authors: https://submission.dagstuhl.de/documentation/authors#oasics At least one author of an accepted paper is expected to present the paper at the workshop as a registered participant. -------------------------------- -------------------------------- PROCEEDINGS -------------------------------- All submissions will be peer-reviewed by at least three members of the program committee for quality and relevance. Accepted regular papers (full and short papers) will be included in the workshop proceedings, published as a volume of the OpenAccess Series in Informatics (OASIcs) by Dagstuhl. -------------------------------- -------------------------------- INVITED SPEAKER -------------------------------- David Dill, Lead Researcher, Blockchain, Novi/Facebook, USA https://research.fb.com/people/dill-david/ -------------------------------- -------------------------------- PROGRAM COMMITTEE -------------------------------- PC CO-CHAIRS * Bruno Bernardo (Nomadic Labs, France) (bruno at nomadic-labs.com) * Diego Marmsoler (University of Exeter, UK) (D.Marmsoler at exeter.ac.uk) PC MEMBERS * Wolfgang Ahrendt (Chalmers University of Technology, Sweden) * Lacramioara Astefanoei (Nomadic Labs, France) * Massimo Bartoletti (University of Cagliari, Italy) * Joachim Breitner (Dfinity Foundation, Germany) * Achim Brucker (University of Exeter, UK) * Zaynah Dargaye (Nomadic Labs, France) * J?r?mie Decouchant (TU Delft, Netherlands) * Dana Drachsler Cohen (Technion, Israel) * Ansgar Fehnker (University of Twente, Netherlands) * Maurice Herlihy (Brown University, USA) * Lars Hupel (INNOQ, Germany) * Florian Kammueller (Middlesex University London, UK) * Igor Konnov (Informal Systems, Austria) * Andreas Lochbihler (Digital Asset, Switzerland) * Sim?o Melo de Sousa (Universidade da Beira Interior, Portugal) * Karl Palmskog (KTH, Sweden) * Maria Potop-Butucaru (Sorbonne Universit?, France) * Andreas Rossberg (Dfinity Foundation, Germany) * C?sar Sanchez (Imdea, Spain) * Clara Schneidewind (TU Wien, Austria) * Ilya Sergey (Yale-NUS College/NUS, Singapore) * Mark Staples (CSIRO Data61, Australia) * Meng Sun (Peking University, China) * Simon Thompson (University of Kent, UK) * Josef Widder (Informal Systems, Austria) From ugo.dallago at unibo.it Sun Apr 11 06:00:05 2021 From: ugo.dallago at unibo.it (Ugo Dal Lago) Date: Sun, 11 Apr 2021 12:00:05 +0200 Subject: [TYPES/announce] Two Postdoc Positions within the DIAPASoN Project Message-ID: <3F228A33-33B6-403E-A9DB-F521EC988D0F@unibo.it> [Apologize for multiple postings.] ================================================================ Call for Expression of Interest for Two Postdoc positions in Programming Language Semantics ================================================================ We are looking for postdocs in the context of the ERC Consolidator Grant ?Differential Program Semantics?. Traditionally, program semantics is centered around the notion of program identity, that is to say of program equivalence: a program is identified with its meaning, and programs are considered as equal only if their meanings are the same. DIAPASoN's goal is rather to study differences between programs as a constitutive and informative concept. This is accomplished by generalizing four major frameworks of program semantics, namely logical relations, coinduction, game semantics, and linear logic. The ideal candidate would have experience in: ? Program Semantics ? Mathematical Logic ? Program Verification and in particular in the sub-areas of program semantics cited above. Expertise in all those sub-areas is rare, so candidates who are strong in just some of them are encouraged to apply. Please contact Ugo Dal Lago if you have more questions about the project, the required background, Italy, or the positions themselves. The first round of applications will be accepted until April 23rd 2021. Positions are for 2 years, and could start at any moment between August/September 2021 and February 2022. More information about the DIAPASoN project can be found here: http://diapason.unibo.it To apply, please send the following documents to ugo.dallago at unibo.it: ? Your CV; ? A brief research statement; ? The names and email addresses of at least two scientists able and willing to provide a reference for you. From elaine.pimentel at gmail.com Sun Apr 11 09:13:32 2021 From: elaine.pimentel at gmail.com (Elaine Pimentel) Date: Sun, 11 Apr 2021 10:13:32 -0300 Subject: [TYPES/announce] LFMTP 2021 - 3rd cfp Message-ID: ============================================================= Call for papers Logical Frameworks and Meta-Languages: Theory and Practice LFMTP 2021 Pittsburgh, USA, 16 July 2021 Affiliated with CADE-28 http://lfmtp.org/workshops/2021/ ============================================================= Abstract submission deadline: 19 April 2021 Paper submission deadline: 26 April 2021 Logical frameworks and meta-languages form a common substrate for representing, implementing and reasoning about a wide variety of deductive systems of interest in logic and computer science. Their design, implementation and their use in reasoning tasks, ranging from the correctness of software to the properties of formal systems, have been the focus of considerable research over the last two decades. This workshop will bring together designers, implementors and practitioners to discuss various aspects impinging on the structure and utility of logical frameworks, including the treatment of variable binding, inductive and co-inductive reasoning techniques and the expressiveness and lucidity of the reasoning process. LFMTP 2021 will provide researchers a forum to present state-of-the-art techniques and discuss progress in areas such as the following: * Encoding and reasoning about the meta-theory of programming languages, logical systems and related formally specified systems. * Theoretical and practical issues concerning the treatment of variable binding, especially the representation of, and reasoning about, datatypes defined from binding signatures. * Logical treatments of inductive and co-inductive definitions and associated reasoning techniques, including inductive types of higher dimension in homotopy type theory * Graphical languages for building proofs, applications in geometry, equational reasoning and category theory. * New theory contributions: canonical and substructural frameworks, contextual frameworks, proof-theoretic foundations supporting binders, functional programming over logical frameworks, homotopy and cubical type theory. * Applications of logical frameworks: proof-carrying architectures, proof exchange and transformation, program refactoring, etc. * Techniques for programming with binders in functional programming languages such as Haskell, OCaml or Agda, and logic programming languages such as lambda Prolog or Alpha-Prolog. Important Dates Abstract submission deadline: Monday April 19 Submission deadline: Monday April 26 Notification to authors: Monday May 31 Final version due: Monday June 14 Workshop date: Friday July 16 Submission In addition to regular papers, we welcome/encourage the submission of "work in progress" reports, in a broad sense. Those do not need to report fully polished research results, but should be of interest for the community at large. Submitted papers should be in PDF, formatted using the EPTCS style guidelines. The length is restricted to 15 pages for regular papers and 8 pages for "Work in Progress" papers. Submission is via EasyChair: https://easychair.org/conferences/?conf=lfmtp2021 Proceedings A selection of the presented papers will be published online in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Invited Speakers * Giselle Reis (CMU-Qatar) * Matthieu Sozeau (Inria) Program Committee * David Baelde (LSV, ENS Paris-Saclay & Inria Paris) * Roberto Blanco (MPI-SP) * Alberto Ciaffaglione (University of Udine) * Claudio Sacerdoti Coen (University of Bologna) * Marina Lenisa (Universit? degli Studi di Udine) * Dennis M?ller (Friedrich-Alexander-University) * Michael Norrish (CSIRO) * Elaine Pimentel (Universidade Federal do Rio Grande do Norte) co-chair * Ulrich Sch?pp (fortiss GmbH) * Kathrin Stark (Princeton University) * Aaron Stump (The University of Iowa) * Nora Szasz (Universidad ORT Uruguay) * Enrico Tassi (Inria) co-chair * Alwen Tiu (The Australian National University) * Tjark Weber (Uppsala University) -------------- next part -------------- An HTML attachment was scrubbed... URL: From eliasca at kth.se Sun Apr 11 15:07:32 2021 From: eliasca at kth.se (Elias Castegren) Date: Sun, 11 Apr 2021 19:07:32 +0000 Subject: [TYPES/announce] IWACO 2021 - Call for Papers Message-ID: 10th IWACO International Workshop on Aliasing, Capabilities and Ownership (IWACO) July 12, in connection with ECOOP/ISSTA. Due to Covid-19, IWACO will be fully virtual. All participation will be online. ## Important Dates Paper submission: 26 April, 2021 Notification: 17 May, 2021 Camera-ready deadline: 4 June, 2021 Workshop: 12 July, 2021 (All deadlines are Anywhere on Earth) ## Aim and Scope Stable object identity and shared mutable state are two powerful principles in programming. The ability to create multiple aliases to mutable data allows a direct modelling of sharing that occurs naturally in a domain, and lies at the heart of efficient programming patterns where aliases provide shortcuts to key places in a data structure. However, aliasing is also the cause of low-level bugs which are notoriously hard to debug, where a change through one alias may cause unforeseen changes visible through another alias. These problems are exacerbated in a concurrent setting, where aliasing is at the root of data races with multiple threads mutating shared memory simultaneously. Coping with pointers, aliasing and the proliferation of shared mutable state is a problem that crosscuts the software development stack, from compilers and runtimes to bug-finding tools and end-user software. They complicate modular reasoning and program analysis, efficient code generation, efficient use of memory, and obfuscate program logic. Several techniques have been introduced to describe and reason about stateful programs, and to restrict, analyze, and prevent aliases. These include various forms of ownership types, capabilities, separation logic, linear logic, uniqueness, sharing control, escape analysis, argument independence, read-only references, linear references, effect systems, and access control mechanisms. These tools have found their way into type systems, compilers and interpreters, runtime systems and bug-finding tools. IWACO?21 will focus on these techniques, on how they can be used to reason about stateful (sequential or concurrent) programs, and how they have been applied to programming languages. In particular, we will consider papers on: - models, type systems and other formal systems, programming language mechanisms, analysis and design techniques, patterns and notations for expressing ownership, aliasing, capabilities, uniqueness, and related topics; - empirical studies of programs or experience reports from programming systems designed with these techniques in mind; - programming logics that deal with aliasing and/or shared state, or use ownership, capabilities or resourcing; - applications of capabilities, ownership and other similar type systems in low-level systems such as programming languages runtimes, virtual machines, or compilers; and - optimization techniques, analysis algorithms, libraries, applications, and novel approaches exploiting ownership, aliasing, capabilities, uniqueness, and related topics. ## Submissions Contributions may be submitted in two formats: - Short papers (up to 2 pages, excluding references and clearly marked appendices) describing new ideas and open questions for discussion. - Full papers (up to 8 pages, excluding references and clearly marked appendices) describing (preliminary) research results. All authors should use the official ?ACM Master article template?, which can be obtained from the ACM Proceedings Template pages (https://www.acm.org/publications/proceedings-template). Latex users should use the ?sigconf? option as well as ?review? (to produce line numbers for easy reference by the reviewers). To that end, the following latex code can be placed at the start of the latex document: \documentclass[sigconf,review]{acmart} Papers must be submitted via HotCRP: https://iwaco21.hotcrp.com Full papers will be included in the workshop proceedings, which will be archived in the ACM digital library. ## Organizing Committee Elias Castegren (KTH Royal Institute of Technology, Sweden) Ralf Jung (MPI-SWS, Germany) ## Workshop Program committee Elisa Gonzalez Boix (Vrije Universiteit Brussel, Belgium) Philipp Haller (KTH Royal Institute of Technology, Sweden) Alex Potanin (Victoria University of Wellington, New Zealand) Aaron Weiss (Northeastern University, United States) -------------- next part -------------- An HTML attachment was scrubbed... URL: From shankar at csl.sri.com Mon Apr 12 03:14:03 2021 From: shankar at csl.sri.com (Natarajan Shankar) Date: Mon, 12 Apr 2021 00:14:03 -0700 Subject: [TYPES/announce] Isaac Newton Institute Virtual Workshop on "Verified software: From Theory to Practice", 10th May 2021 to 14th May 2021 (Register by April 17) Message-ID: <476fea8a-b28a-73c8-1267-b9e711efab32@csl.sri.com> ???????????????????????????????????????????????????????? Isaac Newton Institute Virtual Workshop ?????????????????????????????????????????????????????? Verified Software: From theory to Practice ??????????????????????????????????????????????????????????? 10th May 2021 to 14th May 2021 ????????????????????????????????????????????????????????????? Registration Deadline: April 17, 2021 ???????????????????????????????????????????????????????? URL: https://www.newton.ac.uk/event/vsow03 WORKSHOP THEME Formal methods for the specification and verification of software-intensive systems bridge the gap between theory and applications.? Verification techniques have to be tuned to application areas such as concurrency, cyber-physical systems, distributed systems, machine learning, computer security, networks, and programming languages.?? The INI Virtual Workshop is a precursor event to the program on Verified Software.? It will involve an intensive exchange of ideas between researchers facing the challenges of cutting-edge applications and theoreticians armed with the conceptual tools to potentially address these challenges. SPEAKERS: Amal Ahmed (Northeastern), Jade Alglave (ARM/UCL), Rajeev Alur (Penn), Karthikeyan Bhargavan (INRIA), Ahmed Bouajjani (Paris 7), Adam Chlipala (MIT), Veronique Cortier (LORIA Nancy), Javier Esparza (TU Munich), Aarti Gupta (Princeton), Thomas Henzinger (IST Austria), Maurice Herlihy (Brown), Sir Tony Hoare, Justin Hsu (Wisconsin), Zachary Kincaid (Princeton), Marta Kwiatkowska (Oxford), P. Madhusudhan (UIUC), Rupak Majumdar (Max Planck Institute), Annabelle McIver (Macquarie), Anca Muscholl (Bourdeaux), Pavithra Prabhakar (Kansas), Jean-Francois Raskin (Universit? Libre de Bruxelles), Ilya Sergey (Yale-NUS), Sanjit Seshia (UC Berkeley), Alexandra Silva (UCL), Victor Vafeiadis (MPI-SWS), Martin Vechev (ETH Zurich), Hongseok Yang (KAIST). From giselle.mnr at gmail.com Mon Apr 12 12:16:39 2021 From: giselle.mnr at gmail.com (Giselle Reis) Date: Mon, 12 Apr 2021 19:16:39 +0300 Subject: [TYPES/announce] 7th International Workshop on Proof eXchange for Theorem Proving (PxTP) - Second CFP Message-ID: Call for Papers, PxTP 2021 The Seventh International Workshop on Proof eXchange for Theorem Proving (PxTP) https://pxtp.gitlab.io/2021 21 July 2021, online associated with the CADE-28 conference ## Background The PxTP workshop brings together researchers working on various aspects of communication, integration, and cooperation between reasoning systems and formalisms. The progress in computer-aided reasoning, both automatic and interactive, during the past decades, has made it possible to build deduction tools that are increasingly more applicable to a wider range of problems and are able to tackle larger problems progressively faster. In recent years, cooperation of such tools in larger verification environments has demonstrated the potential to reduce the amount of manual intervention. Examples include the Sledgehammer tool providing an interface between Isabelle and (untrusted) automated provers, and collaboration of the HOL Light and Isabelle systems in the formal proof of the Kepler conjecture. Cooperation between reasoning systems relies on availability of theoretical formalisms and practical tools for exchanging problems, proofs, and models. The PxTP workshop strives to encourage such cooperation by inviting contributions on suitable integration, translation, and communication methods, standards, protocols, and programming interfaces. The workshop welcomes developers of automated and interactive theorem proving tools, developers of combined systems, developers and users of translation tools and interfaces, and producers of standards and protocols. We are interested both in success stories and descriptions of current bottlenecks and proposals for improvement. ## Topics Topics of interest for this workshop include all aspects of cooperation between reasoning tools, whether automatic or interactive. More specifically, some suggested topics are: * applications that integrate reasoning tools (ideally with certification of the result); * interoperability of reasoning systems; * translations between logics, proof systems, models; * distribution of proof obligations among heterogeneous reasoning tools; * algorithms and tools for checking and importing (replaying, reconstructing) proofs; * proposed formats for expressing problems and solutions for different classes of logic solvers (SAT, SMT, QBF, first-order logic, higher-order logic, typed logic, rewriting, etc.); * meta-languages, logical frameworks, communication methods, standards, protocols, and APIs related to problems, proofs, and models; * comparison, refactoring, transformation, migration, compression and optimization of proofs; * data structures and algorithms for improved proof production in solvers (e.g., efficient proof representations); * (universal) libraries, corpora and benchmarks of proofs and theories; * alignment of diverse logics, concepts and theories across systems and libraries; * engineering aspects of proofs (e.g., granularity, flexiformality, persistence over time); * proof certificates; * proof checking; * mining of (mathematical) information from proofs (e.g., quantifier instantiations, unsat cores, interpolants, ...); * reverse engineering and understanding of formal proofs; * universality of proofs (i.e. interoperability of proofs between different proof calculi); * origins and kinds of proofs (e.g., (in)formal, automatically generated, interactive, ...) * Hilbert's 24th Problem (i.e. what makes a proof better than another?); * social aspects (e.g., community-wide initiatives related to proofs, cooperation between communities, the future of (formal) proofs); * applications relying on importing proofs from automatic theorem provers, such as certified static analysis, proof-carrying code, or certified compilation; * application-oriented proof theory; * practical experiences, case studies, feasibility studies. ## Submissions Researchers interested in participating are invited to submit either an extended abstract (up to 8 pages) or a regular paper (up to 15 pages). Submissions will be refereed by the program committee, which will select a balanced program of high-quality contributions. Short submissions that could stimulate fruitful discussion at the workshop are particularly welcome. We expect that one author of every accepted paper will present their work at the workshop. Submitted papers should describe previously unpublished work, and must be prepared using the LaTeX EPTCS class (http://style.eptcs.org). Papers will be submitted via EasyChair, at the PxTP'2021 workshop page (https://easychair.org/conferences/?conf=pxtp-7). Accepted regular papers will appear in an EPTCS volume. ## Important Dates * Abstract submission: April 21, 2021 * Paper submission: April 28, 2021 * Notification: May 26, 2021 * Camera ready versions due: June 16, 2021 * Workshop: July 11, 2021 (online) ## Invited Speakers TBA ## Program Committee * Haniel Barbosa (Universidade Federal de Minas Gerais (UFMG), Belo Horizonte, Brazil) * Denis Cousineau (Mitsubishi, France) * Stefania Dumbrava (ENSIIE, France) * Katalin Fazekas (TU Wien, Austria) * Mathias Fleury (Johannes Kepler University Linz, Austria), co-chair * Predrag Jani?i? (University of Belgrade, Serbia) * Chantal Keller (Universit? Paris-Saclay, France), co-chair * Aina Niemetz (Stanford University, USA) * Jens Otten (University of Oslo, Norway) * Giselle Reis (CMU-Qatar, Qatar) * Geoff Sutcliffe (University of Miami, USA) * Fran?ois Thir? (Nomadic Labs, France) * Sophie Tourret (Max-Planck-Institut f?r Informatik, Germany) * Josef Urban (Czech Institute of Informatics, Czech Republic) ## Previous PxTP Editions * PxTP 2019 (http://pxtp.gforge.inria.fr/2019), affiliated to CADE-27 * PxTP 2017 (https://pxtp.github.io/2017), affiliated to Tableaux 2017, FroCoS 2017 and ITP 2017 * PxTP 2015 (http://pxtp15.lri.fr), affiliated to CADE-25 * PxTP 2013 (http://www.cs.ru.nl/pxtp13), affiliated to CADE-24 * PxTP 2012 (http://pxtp2012.inria.fr), affiliated to IJCAR 2012 * PxTP 2011 (http://pxtp2011.loria.fr), affiliated to CADE-23 From einarj at ifi.uio.no Mon Apr 12 03:30:48 2021 From: einarj at ifi.uio.no (Einar Broch Johnsen) Date: Mon, 12 Apr 2021 07:30:48 +0000 Subject: [TYPES/announce] Two PhD positions in Formal Methods for Underwater Robots available (RWTH Aachen, Uni Oslo) Message-ID: Two PhD positions in formal methods for underwater robots are available in the REMARO MSCA network. We are looking for excellent candidates with a background in formal methods, programming, logic and mathematics, who are curious how their knowledge can contribute to improve the quality of autonomous robots. As a PhD fellow in REMARO, you will work together with other PhD fellows in a scientific network with leading researchers from both academia and industry, with research stays and interaction across the network. The announced positions are ideal for students with an analytical mindset who enjoyed topics such as logic, concurrency theory, formal methods, executable models and model checking and software verification during their studies. REMARO (https://remaro.eu) is an interdisciplinary training network for PhD students which combines expertise in submarine AI, software reliability and formal methods, and marine safety certification to educate 15 PhD fellows in topics in the area of reliable autonomy for underwater applications. REMARO is funded by the EU as a Marie Sklodowska-Curie Actions (MSCA) training network for PhD fellows 01/12/2020 ? 30/11/2024. *** Position at RWTH Aachen: System-level verification of an autonomous underwater robot *** Underwater pipeline inspection robots possess complex behavior involving e.g. AI-based learning, uncertainties in the environment, and the combination of the continuous evolution of physical quantities with the discrete nature of digital controllers. For their safety assessment, algorithms and tools for the analysis of these aspects in isolation are available, but their combination is scientifically as well as technically yet an interesting open problem. The goal of this project is to assess certain aspects of certain components and use these results to derive conclusions about the robot as a whole at system level, to be able to analyze complex behavior like autonomous navigation including obstacle detection and avoidance. * Prerequisites: Master degree or equivalent in computer science or informatics; fun with theoretical computer science and math; programming skills. A good command of spoken and written English is required. * The applicant must not have lived in Germany more than 12 months in the last 3 years. * Hiring institution: RWTH Aachen University * PhD Enrollment: PhD position at the Department of Computer Science at RWTH Aachen University. The project involves collaboration with DFKI in Bremen, Ocean Scan in Porto, and ISEP in Porto. * Duration of the project: 36 months * Main Academic Supervisor: prof. Erika Abraham, contact: abraham at informatik.rwth-aachen.de * Co-supervisors: prof. Ana Maria Madureira (ISEP, Porto), Luis Madureira (OMST, Porto) *** Position at University of Oslo: Continuous quality assurance for cognitive control *** This PhD project aims to analyze the interaction between a control system and a dynamically evolving knowledge base for autonomous underwater robots. A knowledge-based component can be seen as a digital twin (a virtual model of the robot and its environment, based on perception) for representing and reasoning about the changing environment under water. The digital twin is used by controllers to plan, control, and adapt underwater missions. This project will develop new analysis techniques and tools to study how classes of changes in the knowledge base affect the robustness of the controllers. These new analysis techniques will be based on logic, formal methods (process calculi, automata theory, operational semantics, etc.) and concurrency theory. These techniques are particularly useful when studying the interactions of complex systems and analysing worst-case behavior. The focus of the PhD project will be on techniques to analyze how imprecisions and gaps of knowledge in the digital-twin may affect the behaviour of cognitive controllers. * Prerequisites: Master degree or equivalent in computer science or informatics with background in the following fields: concurrency theory, algorithms and distributed systems, logic, executable/formal models, formal methods. A good command of spoken and written English is required and needs to be documented (see https://www.mn.uio.no/english/research/phd/regulations/proficiency-requirements.html). * The applicant must not have lived in Norway more than 12 months in the last 3 years. * Hiring institution: University of Oslo * PhD Enrollment: PhD position at the Department of Informatics at University of Oslo. The project involves collaboration with DNV in Oslo, University of Bremen and ROSEN in Bremen * Duration of the project: 36 months * Main Academic Supervisor: prof. Einar Broch Johnsen (UiO, Norway), contact: einarj at ifi.uio.no * Co-supervisors: prof. Michael Beetz (UB, Germany), dr. Erik Stensrud (DNV, Norway) *** How to Apply *** We look forward to your application, containing a motivation letter (1-2 pages), your curriculum vitae and certificates of your studies, including course transcripts and grades. In your application, please state if you are interested in one or both positions. * Please send your application, including all documents, via email to Erika Abraham . * Application deadline: 15.05.2021 * Targeted starting time: between August 1 and September 30, 2021 From tobias.wrigstad at it.uu.se Tue Apr 13 03:58:36 2021 From: tobias.wrigstad at it.uu.se (Tobias Wrigstad) Date: Tue, 13 Apr 2021 07:58:36 +0000 Subject: [TYPES/announce] One PhD position in design and implementation of managed programming languages Message-ID: One PhD position in design and implementation of managed programming languages. We are looking for excellent candidates with a background in programming, programming languages, type systems, formal semantics, compilers, runtimes and computer architecture. Candidates will be working with experts in programming languages, computer architecture, and with close ties to companies developing and maintaining programming language implementations. More information and instructions for how to apply here: https://uu.se/en/about-uu/join-us/details/?positionId=392483 * Application deadline: 22.04.2021 * Targeted starting time: before September 1st, 2021 ------------------------------------------------------------ Tobias Wrigstad, Professor Distinguished University Teacher Head of Education Department of Information Technology Uppsala University, Sweden Email: tobias.wrigstad at it.uu.se Web: http://wrigstad.com N?r du har kontakt med oss p? Uppsala universitet med e-post s? inneb?r det att vi behandlar dina personuppgifter. F?r att l?sa mer om hur vi g?r det kan du l?sa h?r: http://www.uu.se/om-uu/dataskydd-personuppgifter/ E-mailing Uppsala University means that we will process your personal data. For more information on how this is performed, please read here: http://www.uu.se/en/about-uu/data-protection-policy From chong at seas.harvard.edu Tue Apr 13 22:19:41 2021 From: chong at seas.harvard.edu (Stephen Chong) Date: Tue, 13 Apr 2021 22:19:41 -0400 Subject: [TYPES/announce] PLMW@PLDI 2021: Call for Applications Message-ID: CALL FOR APPLICATIONS ACM SIGPLAN Programming Languages Mentoring Workshop Co-located with PLDI 2021 June 21-22, 2021 https://pldi21.sigplan.org/home/PLMW-PLDI-2021 The *Programming Language Mentoring Workshop* (PLMW) is designed to broaden the exposure of *late-stage undergraduate students* and *early-stage graduate students* to research and career opportunities in programming languages. The workshop includes mentoring sessions that cover effective habits for navigating the research landscape, technical sessions that cover core subfields within programming languages, and social sessions that create opportunities for students to interact with researchers in the field. PLMW @ PLDI 2021 will be held June 21-22, immediately before the Programming Languages Design and Implementation (PLDI) conference. More details about the workshop are available at https://pldi21.sigplan.org/home/PLMW-PLDI-2021. PLMW @ PLDI 2021 will be a virtual event. Some parts of the workshop, including mentoring socials and panels, will be available only to participants who have applied and been accepted to PLMW. Submit your application using this form (https://forms.gle/on8P4mPGtkvfRSPB8). *Please complete the application by May 15 for full consideration*. Applications received after May 15 will be considered as space permits. Applications from members of underrepresented groups in computing are especially welcome. Please note that if you apply and are accepted to attend PLMW, your registration fee for PLMW and PLDI is covered by a scholarship; we will send you instructions for how to register for PLDI free of cost. If you submit your application by May 15, we will notify you about your acceptance before PLDI?s early registration deadline. Best, PLMW @ PLDI 2021 Organizing Committee Stephen Chong, Harvard University Hila Peleg, UC San Diego Nadia Polikarpova, UC San Diego Tamara Rezk, Inria, France -------------- next part -------------- An HTML attachment was scrubbed... URL: From alexander.nadel at intel.com Wed Apr 14 01:33:56 2021 From: alexander.nadel at intel.com (Nadel, Alexander) Date: Wed, 14 Apr 2021 05:33:56 +0000 Subject: [TYPES/announce] SMT 2021 Workshop: Final Call for Papers In-Reply-To: References: Message-ID: SMT 2021: 19th International Workshop on Satisfiability Modulo Theories Los Angeles, CA, United States, July 18-19, 2021 Conference website: http://smt-workshop.cs.uiowa.edu/2021/ Submission link: https://easychair.org/conferences/?conf=smt2021 Submission deadline: April 30, 2021 Overview SMT 2021 will be co-located with CAV 2021 in Los Angeles. The aim of the workshop is to bring together researchers and users of SMT tools and techniques. Relevant topics include but are not limited to: * Decision procedures and theories of interest * Combinations of decision procedures * Novel implementation techniques * Benchmarks and evaluation methodologies * Applications and case studies * Theoretical results Papers on pragmatic aspects of implementing and using SMT tools, as well as novel applications of SMT, are especially encouraged. Important Dates * Paper submission: April 30, 2021 * Notification: May 28, 2021 * Workshop: July 18-19, 2021 Submission Guidelines We invite researchers to submit extended abstracts, original papers, and presentation only-papers. We intend to publish open-access proceedings for SMT 2021 as a volume of the EPiC Series EasyChair Proceedings. Extended abstracts and original papers must not have been published or submitted elsewhere and will be included in the proceedings. * Extended abstracts: given the informal style of the workshop, we strongly encourage the submission of preliminary reports of work in progress. They may range in length from very short (a couple of pages) to the full 10 pages and they will be judged based on the expected level of interest for the SMT community. * Original papers: contain original research and sufficient detail to assess the merits and relevance of the submission. For papers reporting experimental results, authors are strongly encouraged to make their data available. * Presentation-only papers: describe work recently published or submitted and will not be included in the proceedings. We see this as a way to provide additional access to important developments that SMT Workshop attendees may be unaware of. Papers in all three categories will be peer-reviewed. Original papers and extended abstracts should not exceed 10 pages and should be in standard-conforming PDF. Technical details may be included in an appendix to be read at the reviewers' discretion. Final versions should be prepared in LaTeX using the easychair.cls class file. (The 10 page limit does not include references.) Presentation-only papers may be submitted as originally published, if published elsewhere, and should not exceed 10 pages otherwise. To submit, please go to the EasyChair page and follow the instructions there. Organizers and Program Committee See SMT 2021 Organizers and Program Committee. Invited Speakers * Karem Sakallah, University of Michigan * Guy Katz, University of Jerusalem --------------------------------------------------------------------- Intel Israel (74) Limited This e-mail and any attachments may contain confidential material for the sole use of the intended recipient(s). Any review or distribution by others is strictly prohibited. If you are not the intended recipient, please contact the sender and delete all copies. -------------- next part -------------- An HTML attachment was scrubbed... URL: From ayala at unb.br Wed Apr 14 14:48:45 2021 From: ayala at unb.br (Mauricio Ayala-Rincon) Date: Wed, 14 Apr 2021 15:48:45 -0300 Subject: [TYPES/announce] Last LSFA 2021 CPFs - Affiliated to FSCD 2021 Message-ID: <6a6beec2-4303-849a-36c9-8946e37c0821@unb.br> ??????????????????//?????????????????? ??????? 16th Logical and Semantic Frameworks with Applications - LSFA 2021 ??????????????????????????? 23-24 July 2021 ?????????????????????? https://mat.unb.br/lsfa2021 ????????????? Affiliated to FSCD 2021, Buenos Aires, Argentina (Online) ???????????????????????????? Last Call For Papers ??????????????????//?????????????????? Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for the formal specification of systems and computational languages, supporting tool development and reasoning. The LSFA series' objective is to put together theoreticians and practitioners to promote new techniques and results, from the theoretical side, and feedback on the implementation and use of such techniques and results, from the practical side. See lsfa.cic.unb.br for more information. LSFA topics of interest include, but are not limited to: * Automated deduction * Applications of logical and semantic frameworks * Computational and logical properties of semantic frameworks * Formal semantics of languages and systems * Implementation of logical and semantic frameworks * Lambda and combinatory calculi * Logical aspects of computational complexity * Logical frameworks * Process calculi * Proof theory * Semantic frameworks * Specification languages and meta-languages * Type theory Submissions Contributions should be written in English and submitted in full paper (with a maximum of 16 pages) or short papers (with a maximum of 6 pages). They must be unpublished and not submitted simultaneously for publication elsewhere. The papers should be prepared in LaTeX using the EPTCS style. The submission should be in the form of a PDF file uploaded to Easychair: https://easychair.org/conferences/?conf=lsfa2021 The pre-proceedings, containing the reviewed extended abstracts, will be handed out at event registration. After the meeting, the authors will be invited to submit full versions of their works for the post-proceedings publication. At least one of the authors should register for the conference. Presentations should be in English. According to the submissions' quality, the chairs will promote the further publication of journal revised versions of the papers. Previous LSFA Special Issues have been published in journals such as The Logical J. of the IGPL, Theoretical Computer Science and Mathematical Structures in Computer Sciences (see the LSFA page http://lsfa.cic.unb.br). Important dates * Abstract: Monday 26th April * Submission: Sunday 2nd May * Notification: Friday 4th June * Preliminary proceedings version due: Monday 14th June * Submission for final proceedings: Sunday 17th October * Final version: Sunday 19th December Invited Speakers ? Alejandro D?az-Caro (ICC-UBA/CONICET, UNQ) ? Alexandra Silva (University College London) ? Giulio Guerrieri (University of Bath) Program Committee ? Mar?a Alpuente (Universitat Polit?cnica de Val?ncia) ? Sandra Alves (Universidade de Porto, Portugal) ? Takahito Aoto (Niigata University) ? Mauricio Ayala-Rinc?n (Universidade de Bras?lia) - Co-Chair ? Eduardo Bonelli (Stevens University) - Co-Chair ? Evelyne Contejean (LRI, CNRS, Univ Paris-Sud, Orsay) ? Valeria de Paiva (Samsung Research America and University of Birmingham) ? Marcelo Finger (Universidade de S?o Paulo) ? Yannick Forster (Saarland University) ? Lourdes del Carmen Gonz?lez Huesca (UNAM) ? Edward Hermann Haeusler (PUC-Rio, Brazil) ? Cynthia Kop (Radboud University) ? Temur Kutsia (RISC, Johannes Kepler University Linz) ? Hernan Melgratti (Universidad de Buenos Aires) ? Alexandre Miquel (Universidad de La Rep?blica) ? Barbara Morawska (Ahmedabad University) ? Mariano Moscato (National Institute of Aerospace) ? Cesar Mu?oz (NASA LaRC) ? Daniele Nantes-Sobrinho (U. de Bras?lia) ? Carlos Olarte (U. Federal do Rio Grande do Norte) ? Federico Olmedo (Universidad de Chile) ? Alberto Pardo (Universidad de la Rep?blica) ? Jorge A. P?rez (University of Groningen) ? Camilo Rocha (Pontificia Universidad Javeriana - Cali) ? Aleksy Schubert (University of Warsaw) ? Ren? Thiemann (University of Innsbruck) ? Renata Wassermann (Universidade de S?o Paulo) Organisers ?? Daniele Nantes (UnB, Brasil) ?? Cristian F. Sottile (UBA, Argentina) ??????????????????//?????????????????? -------------- next part -------------- A non-text attachment was scrubbed... Name: ayala.vcf Type: text/x-vcard Size: 4 bytes Desc: not available URL: From juan.fumero at manchester.ac.uk Thu Apr 15 03:10:25 2021 From: juan.fumero at manchester.ac.uk (Juan Fumero) Date: Thu, 15 Apr 2021 07:10:25 +0000 Subject: [TYPES/announce] Call For Contributions (Second Call) - SPLASH 2021: ACM SIGPLAN Conference on Systems, Programming, Languages, and Applications: Software for Humanity Message-ID: ======================================================================== Combined Call For Papers ACM Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH'21) October 17-22, 2021, Chicago, USA https://2021.splashcon.org/ Follow us on Twitter @splashcon ======================================================================== OUTLINE OF THE COMBINED CALL FOR CONTRIBUTIONS: - OOPSLA - Onward! Papers -Onward! Essays -Workshops: - AGERE - BCNC - CONFLANG - DSM - HATRA - LIVE - REBLS - VMIL -Call For Posters -Student Research Competition (SRC) -Co-located events: - APLAS - Dynamic Languages Symposium (DLS) - GPCE - SAS - SLE ======================================================================== The ACM SIGPLAN conference on Systems, Programming, Languages and Applications: Software for Humanity (SPLASH) embraces all aspects of software construction and delivery to make it the premier conference at the intersection of programming, languages, and software engineering. SPLASH is now accepting submissions. We invite high-quality submissions describing original and unpublished work. ** OOPSLA Research Papers ** Papers that address any aspect of software development are welcome, including requirements, modelling, prototyping, design, implementation, generation, analysis, verification, testing, evaluation, maintenance, reuse, replacement, and retirement of software systems. Papers may address these topics in a variety of ways, including new tools (such as languages, program analyses, and runtime systems), new techniques (such as methodologies, design processes, code organization approaches, and management techniques), and new evaluations (such as formalisms and proofs, corpora analyses, user studies, and surveys). Submissions Due: 16 April 2021 https://2021.splashcon.org/track/splash-2021-oopsla ** Onward! Research Papers ** Onward! is a premier multidisciplinary conference focused on everything to do with programming and software: including processes, methods, languages, communities, and applications. Onward! is more radical, more visionary, and more open than other conferences to ideas that are well-argued but not yet proven. We welcome different ways of thinking about, approaching, and reporting on programming language and software engineering research. Submissions Due: 8 May 2021 https://2021.splashcon.org/track/splash-2021-Onward-papers ** Onward! Essays ** Onward! Essays conference is looking for clear and compelling pieces of writing about topics important to the software community construed broadly. An essay can be an exploration of a topic, its impact, or the circumstances of its creation; it can present a personal view of what is, explore a terrain, or lead the reader in an act of discovery; it can be a philosophical digression or a deep analysis. It can describe a personal journey, perhaps that by which the author reached an understanding of such a topic. The subject area should be interpreted broadly and can include the relationship of software to human endeavours, or its philosophical, sociological, psychological, historical, or anthropological underpinnings. Submissions Due: 22 May 2021 https://2021.splashcon.org/track/splash-2021-Onward-Essays ** Workshops ** **** AGERE 2021 **** The AGERE! workshop is aimed at focusing on programming systems, languages and applications based on actors, active/concurrent objects, agents and?more generally?on high-level programming paradigms which promote decentralized control in solving problems and developing software. The workshop is intended to cover both the theory and the practice of design and programming, bringing together researchers working on models, languages and technologies, and practitioners developing real-world systems and applications. Submissions due: 6 August 2021 https://2021.splashcon.org/home/agere-2021 **** BCNC 2021 **** The first international workshop on ?Beyond Code: No Code,? (BCNC 2021) targets one of the most engaging topics currently spanning the software engineering community.The No Code movement is making its way through all industries, saving time, empowering workers, and creating new possibilities. No Code is changing the software industry by accelerating development and opening up opportunities for less tech-savvy individuals to create life-changing products. BCNC 2021 brings together the best in the field to share their knowledge and expertise and raise that standard of what could be achieved. Industrial experts as well academics join to present the frontier and show us a glimpse of the future. Submissions due: 6 August 2021 https://2021.splashcon.org/home/bcnc-2021 **** CONFLANG 2021 **** CONFLANG is a new workshop on the design, the usage and the tooling of configuration programming languages. CONFLANG aims at uniting language designers, industry practitioners and passionate hobbyists to share knowledge in any form. Topics of interest include, but are not limited to: - Infrastructure and configuration code maintenance and evolution - Specification learning and mining for configurations - Infrastructure and Configuration testing and verification - Infrastructure as Code and configuration repair - New languages for configuration - The application of language security and type theory to program configuration Submissions due: 6 August 2021 https://2021.splashcon.org/home/conflang-2021 **** DSM?21 **** Domain-Specific Modeling (DSM) languages provide a viable and time-tested solution for continuing to raise the level of abstraction, and thus productivity, beyond coding, making systems and software development faster and easier. In DSM, the models are constructed using concepts that represent things in the application domain, not concepts of a given programming language. The modeling language follows the domain abstractions and semantics, allowing developers to perceive them-selves as working directly with domain concepts. Together with frameworks and platforms, DSM can automate a large portion of software production. The goals of the workshop are to share experiences and demonstrate the DSM solutions that have been developed by both researchers and practitioners, identify research questions and continuing to build the community. Submissions due: 6 August 2021 https://2021.splashcon.org/home/dsm-2021 **** HATRA 2021 **** Programming language designers seek to provide strong tools to help developers reason about their programs. For example, the formal methods community seeks to enable developers to prove correctness properties of their code, and type system designers seek to exclude classes of undesirable behavior from programs. The security community creates tools to help developers achieve their security goals. In order to make these approaches as effective as possible for developers, recent work has integrated approaches from human-computer interaction research into programming language design. This workshop brings together programming languages, software engineering, security, and human-computer interaction researchers to investigate methods for making languages that provide stronger safety properties more effective for programmers and software engineers. Submissions due: 6 August 2021 https://2021.splashcon.org/home/hatra-2021 **** LIVE 2021 **** Programming is cognitively demanding, and too difficult. LIVE is a workshop exploring new user interfaces that improve the immediacy, usability, and learnability of programming. Whereas PL research traditionally focuses on programs, LIVE focuses more on the activity of programming. The LIVE 2021 workshop invites submissions of ideas for improving the immediacy, usability, and learnability of programming. Live programming gives the programmer immediate feedback on the behavior of a program as it is edited, replacing the edit-compile-debug cycle with a fluid programming experience. The best-known example of live programming is the spreadsheet, but there are many others. Submissions due: 6 August 2021 https://2021.splashcon.org/home/live-2021 **** REBLS 2021 **** Reactive programming and event-based programming are two closely related programming styles that are becoming ever more important with the advent of advanced HPC technology and the ever increasing requirement for our applications to run on the web or on collaborating mobile devices. A number of publications on middleware and language design ? so-called reactive and event-based languages and systems (REBLS) ? have already seen the light, but the field still raises several questions. For example, the interaction with mainstream language concepts is poorly understood, implementation technology is in its infancy and modularity mechanisms are almost totally lacking. This workshop will gather researchers in reactive and event-based languages and systems. The goal of the workshop is to exchange new technical research results and to define better the field by coming up with taxonomies and overviews of the existing work. Submissions due: 6 August 2021 https://2021.splashcon.org/home/rebls-2021 **** VMIL 2021 **** The concept of Virtual Machines is pervasive in the design and implementation of programming systems. Virtual Machines and the languages they implement are crucial in the specification, implementation and/or user-facing deployment of most programming technologies. The VMIL workshop is a forum for researchers and cutting-edge practitioners in language virtual machines, the intermediate languages they use, and related issues. Submissions due: 6 August 2021 https://2021.splashcon.org/home/vmil-2021 ** SPLASH Posters ** The SPLASH Posters track provides an excellent forum for authors to present their recent or ongoing projects in an interactive setting, and receive feedback from the community. We invite submissions covering any aspect of programming, systems, languages and applications. The goal of the poster session is to encourage and facilitate small groups of individuals interested in a technical area to gather and interact. It is held early in the conference, to promote continued discussion among interested parties. Submissions due: 15 August 2021 https://2021.splashcon.org/track/splash-2021-Posters ** Student Research Competition ** The ACM Student Research Competition (SRC), sponsored by Microsoft Research, offers a unique opportunity for undergraduate and graduate students to present their research to a panel of judges and conference attendees at SPLASH. The SRC provides visibility and exposes up-and-coming researchers to computer science research and the research community. This competition also gives students an opportunity to discuss their research with experts in their field, get feedback, and sharpen their communication and networking skills. To participate in the competition, a student must submit a 2-page description of his or her original research project. The submitted project descriptions are peer-reviewed. Each student whose description is selected by a panel of reviewers is invited to attend the SRC competition at SPLASH and present their work. Winners of the SPLASH competition are invited to participate in the ACM Student Research Competition Grand Finals. Submit your work and take part in the ACM Student Research Competition at SPLASH 2021! Submissions Due: 16 July 2021 https://2021.splashcon.org/track/splash-2021-SRC ** SPLASH-E ** SPLASH-E is a forum for educators to make connections between programming languages research and the ways we educate computer science students. We invite work that could improve or inform computer science educators, especially work that connects with introductory computer science courses, programming languages, compilers, software engineering, and other SPLASH-related topics. Educational tools, experience reports, and new curricula are all welcome. Submissions Due: 16 July 2021 ======================================================================== *** Co-Located Events *** ======================================================================== ** Asian Symposium on Programming Languages and Systems (APLAS) ** The 19th Asian Symposium on Programming Languages and Systems (APLAS). APLAS aims to stimulate programming language research by providing a forum for the presentation of the latest results and the exchange of ideas in programming languages and systems. APLAS is based in Asia but is an international forum that serves the worldwide programming languages community. APLAS 2021 will be held online and co-located with SPLASH 2021. Submissions Due: 16 June 2021 https://conf.researchr.org/home/aplas-2021 ** Dynamic Languages Symposium (DLS) ** DLS is the premier forum for researchers and practitioners to share knowledge and research on dynamic languages, their implementation, and applications. The influence of dynamic languages ? from Lisp to Smalltalk to Python to JavaScript ? on real-world practice and research, continues to grow. We invite high-quality papers reporting original research, innovative contributions, or experience related to dynamic languages, their implementation, and applications. Submissions Due: 2 June 2021 https://conf.researchr.org/home/dls-2021 ** 20th International Conference on Generative Programming: Concepts & Experiences (GPCE) ** GPCE is a venue for researchers and practitioners interested in techniques that use program generation, domain-specific languages, and component deployment to increase programmer productivity, improve software quality, and shorten the time-to-market of software products. In addition to exploring cutting-edge techniques of generative software, our goal is to foster further cross-fertilization between software engineering and the programming languages research communities. Submissions Due: 5th July 2021 https://conf.researchr.org/home/gpce-2021 ** The 28th Static Analysis Symposium (SAS 2021) ** Static analysis is widely recognized as a fundamental tool for program verification, bug detection, compiler optimization, program understanding, and software maintenance. The series of Static Analysis Symposia has served as the primary venue for the presentation of theoretical, practical, and application advances in the area. Submissions Due: 25th April 2021 https://conf.researchr.org/home/sas-2021 ** 13th International ACM SIGPLAN Conference on Software Language Engineering (SLE) ** SLE is the discipline of engineering languages and the tools required for the creation of software. It abstracts from the differences between programming languages, modelling languages, and other software languages, and emphasizes the engineering facet of the creation of such languages, that is, the establishment of the scientific methods and practices that enable the best results. SLE overlaps with traditional conferences on the design and implementation of programming languages, model-driven engineering, and compiler construction, and emphasizes the fusion of their communities. Submissions Due: 21 June 2021 https://conf.researchr.org/home/sle-2021 ======================================================================== SPLASH Information: ======================================================================== SPLASH Early Registration Deadline: 17th September 2021 Website: https://2021.splashcon.org/ ======================================================================== Organizing Committee SPLASH 2021: ======================================================================== SPLASH General Chair: Hridesh Rajan (Iowa State University) OOPSLA Review Committee Chair: Sophia Drossopoulou (Imperial College London) GPCE General Chair: Eli Tilevich (Virginia Tech) GPCE Co-Chair: Coen De Roover (Vrije Universiteit Brussel) GPCE Co-Chair: Erwan Bousse (University of Nantes) SLE General Chair: Eelco Visser (Delft University of Technology) SLE Program Co-Chair: Dimitris Kolovos (University of York) SLE Program Co-Chair: Emma S?derberg (Lund University) SLE Artifact Evaluation Co-Chair: Elias Castegren (KTH) SLE Artifact Evaluation Co-Chair: Andreas Wortmann (RWTH Aachen University) DLS Chair: Arjun Guha (Northeastern University) Onward! Papers Chair: Wolfgang De Meuter (Vrije Universiteit Brussel) Onward! Essays Chair: Elisa Baniassad (University of British Columbia) SPLASH-E Co-Chair: Charlie Curtsinger (Grinnell College) SPLASH-E Co-Chair: Tien N. Nguyen (University of Texas at Dallas) Artifact Evaluation Co-Chair: Colin Gordon (Drexel University) Artifact Evaluation Co-Chair: Ana Milanova (Rensselaer Polytechnic Institute) Artifact Evaluation Co-Chair: Anders M?ller (Aarhus University) Workshops Co-Chair: Mehdi Bagherzadeh (Oakland University) Workshops Co-Chair: Raffi Khatchadourian (CUNY Hunter College) Student Research Competition Co-Chair: Julia Rubin (University of British Columbia) Publicity Chair: Juan Fumero (University of Manchester) Web Chair: Rangeet Pan (Iowa State University) Student Volunteer Co-Chair: Breno Dantas Cruz (Virginia Tech) Student Volunteer Co-Chair: Samantha Syeda Khairunnesa (Iowa State University) Sponsorship Co-Chair: Ganesha Upadhyaya (Harmony.one) Poster Co-Chair: Christos Dimoulas (PLT @ Northwestern University) Poster Co-Chair: Murali Krishna Ramanathan (Uber Technologies Inc.) Publications Chair: Saba Alimadadi (Simon Fraser University) Accessibility Chair: Sumon Biswas (Iowa State University, USA) ======================================================================== -------------- next part -------------- An HTML attachment was scrubbed... URL: From alcsc at dtu.dk Thu Apr 15 10:06:07 2021 From: alcsc at dtu.dk (Alceste Scalas) Date: Thu, 15 Apr 2021 16:06:07 +0200 Subject: [TYPES/announce] Final CfP: 14th Interaction and Concurrency Experience (ICE 2021) Message-ID: ICE 2021 14th Interaction and Concurrency Experience June 18, 2021 - online Satellite workshop of DisCoTec 2021 https://www.discotec.org/2021/ice Submission link: https://openreview.net/group?id=DisCoTec.org/2021/Workshop/ICE Interaction and Concurrency Experience (ICE) is a series of international scientific meetings oriented to theoretical computer science researchers with special interest in models, verification, tools, and programming primitives for complex interactions. === HIGHLIGHTS === * Distinctive selection procedure * ICE welcomes full papers to be included in the proceedings * ICE also welcomes oral communications of already published or preliminary work * Publication in EPTCS * Special issue in the Journal of Logical and Algebraic Methods in Programming (Elsevier) (to be confirmed) * Invited speakers: - Helene Coullon (IMT Atlantique) - More TBA === IMPORTANT DATES === * 1 May 2021: abstract submission (EXTENDED!) * 5 May 2021: paper submission (EXTENDED!) * 4 June 2021: notification * 18 June 2021: ICE workshop * 12 July 2021: camera-ready for EPTCS post-proceedings === SCOPE === The general scope of the venue includes theoretical and applied aspects of interactions and the synchronization mechanisms used among components of concurrent/distributed systems, related to several areas of computer science in the broad spectrum ranging from formal specification and analysis to studies inspired by emerging computational models. We solicit contributions relevant to Interaction and Concurrency, including but not limited to: * Formal semantics * Process algebras and calculi * Models and languages * Protocols * Logics and types * Expressiveness * Model transformations * Tools, implementations, and experiments * Specification and verification * Coinductive techniques * Tools and techniques for automation * Synthesis techniques === SELECTION PROCEDURE === Since its first edition in 2008, the distinguishing feature of ICE has been an innovative paper selection mechanism based on an interactive, friendly, and constructive discussion amongst authors and PC members in an online forum. During the review phase, each submission is published in a dedicated discussion forum. The discussion forum can be accessed by the authors of the submission and by all PC members not in conflict with the submission (the forum preserves anonymity). The forum is used by reviewers to ask questions, clarifications, and modifications from the authors, allowing them better to explain and to improve all aspects of their submission. The evaluation of the submission will take into account not only the reviews, but also the outcome of the discussion. As witnessed by the past editions of ICE, this procedure considerably improves the accuracy of the reviews, the fairness of the selection, the quality of camera-ready papers, and the discussion during the workshop. ICE adopts a light double-blind reviewing process, detailed below. === SUBMISSION GUIDELINES === Submissions must be made electronically in PDF format via OpenReview: https://openreview.net/group?id=DisCoTec.org/2021/Workshop/ICE We invite two types of submissions: * Research papers, original contributions that will be published in the workshop post-proceedings. Research papers must not be simultaneously submitted to other conferences/workshops with refereed proceedings. Research papers should be 3-16 pages plus at most 2 pages of references. Short research papers are welcome; for example a 5 page short paper fits this category perfectly. The submitted PDF can use any LaTeX style (but the post-proceedings will use the EPTCS style). * Oral communications will be presented at the workshop, but will not appear in the post-proceedings. This type of contribution includes e.g. previously published contributions, preliminary work, and position papers. There is no strict page limit for this kind of submission but papers of 1-5 pages would be appreciated. For example, a one page summary of previously published work is welcome in this category. Authors of research papers must omit their names and institutions from the title page, they should refer to their other work in the third person and omit acknowledgements that could reveal their identity or affiliation. The purpose is to avoid any bias based on authors? identity characteristics, such as gender, seniority, or nationality, in the review process. Our goal is to facilitate an unbiased approach to reviewing by supporting reviewers? access to works that do not carry obvious references to the authors? identities. As mentioned above, this is a lightweight double-blind process. Anonymization should not be a heavy burden for authors, and should not make papers weaker or more difficult to review. Advertising the paper on alternate forums (e.g., on a personal web-page, pre-print archive, email, talks, discussions with colleagues) is permitted, and authors will not be penalized by for such advertisement. Papers in the ?Oral communications? category need not be anonymized. For any questions concerning the double blind process, feel free to consult the ICEcreamers. We are keen to enhance the balanced, inclusive and diverse nature of the ICE community, and would particularly encourage female colleagues and members of other underrepresented groups to submit their work. === PUBLICATIONS === Accepted research papers and communications must be presented at the workshop by one of the authors. Accepted research papers will be published after the workshop in Electronic Proceedings in Theoretical Computer Science. We plan to invite authors of selected papers and brief announcements to submit their work in a special issue in the Journal of Logical and Algebraic Methods in Programming (Elsevier). Such contributions will be regularly peer-reviewed according to the standard journal policy, but they will be handled in a shorter time than regular submissions. A list of published and in preparation special issues of previous ICE editions is reported on the ICE website. === ICECREAMERS === Julien Lange (Royal Holloway, University of London, UK) - julien.lange at rhul.ac.uk Anastasia Mavridou (NASA Ames, USA) - anastasia.mavridou at nasa.gov Larisa Safina (Inria, FR) - larisa.safina at inria.fr Alceste Scalas (Technical University of Denmark, DK) - alcsc at dtu.dk === PROGRAM COMMITTEE === * Massimo Bartoletti (University of Cagliari, IT) * Chiara Bodei (Universit? di Pisa, IT) * Matteo Cimini (University of Massachusetts Lowell, USA) * Cinzia Di Giusto (Universit? C?te d?Azur, CNRS, I3S, FR) * Simon Fowler (University of Glasgow, UK) * Eva Graversen (University of Southern Denmark, DK) * Ludovic Henrio (ENS Lyon, FR) * Keigo Imai (Gifu University, JP) * Sung-Shik Jongmans (Open University of the Netherlands, NL) * Sophia Knight (University of Minnesota Duluth, US) * Wen Kokke (University of Edinburgh, UK) * Ivan Lanese (University of Bologna, IT) * Karoliina Lehtinen (CNRS - LIS, Aix-Marseille University, FR) * Alberto Lluch Lafuente (Technical University of Denmark, DK) * Diego Marmsoler (University of Exeter, UK) * Hern?n Melgratti (University of Buenos Aires, AR) * Maurizio Murgia (University of Trento, IT) * Kirstin Peters (TU Darmstadt, DE) * Johannes ?man Pohjola (Data61/CSIRO, AU) * Ivan Prokic (University of Novi Sad, RS) * Matteo Sammartino (Royal Holloway, University of London, UK) * Hugo Torres Vieira (C4 - University of Beira Interior, PT) * Laura Voinea (University of Kent, UK) * Uma Zalakian (University of Glasgow, UK) === STEERING COMMITTEE === * Massimo Bartoletti (University of Cagliari, IT) * Ludovic Henrio (ENS Lyon, FR) * Ivan Lanese (University of Bologna, IT) * Alberto Lluch Lafuente (Technical University of Denmark, DK) * Sophia Knight (University of Minnesota Duluth, USA) * Hugo Torres Vieira (C4 - University of Beira Interior, PT) === MORE INFORMATION === For additional information, please contact the ICEcreamers (see email addresses above). -- Alceste Scalas - https://people.compute.dtu.dk/alcsc Assistant Professor @ DTU Compute - Section for Formal Methods Technical University of Denmark Richard Petersens Plads, Building 324, Room 180 2800 Kgs. Lyngby From j.a.perez at rug.nl Thu Apr 15 11:13:00 2021 From: j.a.perez at rug.nl (Jorge A. Perez) Date: Thu, 15 Apr 2021 17:13:00 +0200 Subject: [TYPES/announce] Two tenure-track positions - University of Groningen, The Netherlands. Message-ID: [Apologies if you receive multiple postings of this email.] Dear colleagues, We have two vacancies for tenure-track assistant professors at the Bernoulli Institute of the University of Groningen, The Netherlands. - One position concerns "Programming Languages and Systems", see here for details; - The other position concerns "Data Science and Systems", see here for details. Deadline: May 16, 2021. Both positions are broadly defined: we seek excellent applicants who aim at a tenure-track position with a special focus on education. Don't hesitate to contact me in case of questions about the working environment and our research institute. Best regards, Jorge -- Jorge A. P?rez Associate Professor, Fundamental Computing group Bernoulli Institute for Math, CS and AI University of Groningen, The Netherlands URL: http://www.jperez.nl -------------- next part -------------- An HTML attachment was scrubbed... URL: From p.l.lumsdaine at gmail.com Fri Apr 16 06:23:45 2021 From: p.l.lumsdaine at gmail.com (Peter LeFanu Lumsdaine) Date: Fri, 16 Apr 2021 11:23:45 +0100 Subject: [TYPES/announce] =?utf-8?q?PhD_opening_in_HoTT_at_Stockholm_?= =?utf-8?q?=E2=80=94_note_close_deadline?= Message-ID: Dear all, I?m happy to announce that we?re recruiting for PhD students in HoTT (besides other topics) at Stockholm University, starting September 2021. Note that the deadline for applications is next Friday, 23 April ? sorry I missed advertising it here sooner. Full details and application are through https://www.su.se/english/about-the-university/work-at-su/available-jobs/phd-student-positions-1.507588?rmpage=job&rmjob=14472&rmlang=UK Please let me know if you have any questions about the position! And (for advisors) please pass this on to any interested masters-level students. Answers to a few common questions: - PhD positions in Sweden are fully funded, with a livable salary. - The position includes up to 20% teaching. - Swedish speaking isn?t required, either formally or practically (though learning it during the PhD is encouraged) ? all higher-level teaching is done in English, and most administrative business (including all necessities) can be. Best wishes, ?Peter. -------------- next part -------------- An HTML attachment was scrubbed... URL: From nick.hu at cs.ox.ac.uk Fri Apr 16 07:41:36 2021 From: nick.hu at cs.ox.ac.uk (Nick Hu) Date: Fri, 16 Apr 2021 12:41:36 +0100 Subject: [TYPES/announce] SECOND CALL FOR PAPERS -- APPLIED CATEGORY THEORY 2021, CAMBRIDGE UK, JULY 12-16 -- HYBRID CONFERENCE Message-ID: SECOND CALL FOR PAPERS Fourth Annual International Conference on Applied Category Theory (ACT 2021) 12 - 16 July, 2021, Cambridge, United Kingdom (and online) https://www.cl.cam.ac.uk/events/act2021 * * * <<< UPDATE: Our plans to run ACT 2021 as one of the first physical conferences post-lockdown are progressing well. Consider joining us in person in Cambridge! We also have financial support available for students and junior researchers. >>> The Fourth International Conference on Applied Category Theory will take place at the Computer Laboratory of the University of Cambridge on 12-16 July, 2021, preceded by the Adjoint School 2021 on 5-9 July. This conference follows previous events at MIT, Oxford and Leiden. Applied category theory is a topic of interest for a growing community of researchers, interested in studying many different kinds of systems using category-theoretic tools. These systems are found across computer science, mathematics, and physics, as well as in social science, linguistics, cognition, and neuroscience. The background and experience of our members is as varied as the systems being studied. The goal of the Applied Category Theory conference series is to bring researchers together, disseminate the latest results, and facilitate further development of the field. We accept submissions of both original research papers, and work accepted/submitted/ published elsewhere. Accepted original research papers will be invited for publication in a proceedings volume. The keynote addresses will be drawn from the best accepted papers. The conference will include an industry showcase event. We hope to run the conference as a hybrid event, with physical attendees present in Cambridge, and other participants taking part online. However, due to the state of the pandemic, the possibility of in-person attendance is not yet confirmed. Please do not book your travel or hotel accommodation yet. ** FINANCIAL SUPPORT ** We are able to offer financial support to PhD students and junior researchers. Full guidance is on the webpage. ** IMPORTANT DATES (all in 2021) ** - Submission Deadline: Monday 10 May - Author Notification: Monday 7 June - Financial Support Application Deadline: Monday 7 June - Financial Support Notification: Tuesday 8 June - Priority Physical Registration Opens: Wednesday 9 June - Ordinary Physical Registration Opens: Monday 13 June - Reserved Accommodation Booking Deadline: Monday 13 June - Adjoint School: Monday 5 to Friday 9 July - Main Conference: Monday 12 to Friday 16 July ** SUBMISSIONS ** The following two types of submissions are accepted: - Proceedings Track. Original contributions of high-quality work consisting of an extended abstract, up to 12 pages, that provides evidence of results of genuine interest, and with enough detail to allow the program committee to assess the merits of the work. Submission of work-in-progress is encouraged, but it must be more substantial than a research proposal. - Non-Proceedings Track. Descriptions of high-quality work submitted or published elsewhere will also be considered, provided the work is recent and relevant to the conference. The work may be of any length, but the program committee members may only look at the first 3 pages of the submission, so you should ensure that these pages contain sufficient evidence of the quality and rigour of your work. Papers in the two tracks will be reviewed against the same standards of quality. Since ACT is an interdisciplinary conference, we use two tracks to accommodate the publishing conventions of different disciplines. For example, those from a Computer Science background may prefer the Proceedings Track, while those from a Mathematics, Physics or other background may prefer the Non-Proceedings Track. However, authors from any background are free to choose the track that they prefer, and submissions may be moved from the Proceedings Track to the Non-Proceedings Track at any time at the request of the authors. Contributions must be submitted in PDF format. Submissions to the Proceedings Track must be prepared with LaTeX, using the EPTCS style files available at . The submission link will soon be available on the ACT2021 web page: ** PROGRAMME COMMITTEE ** Chair: - Kohei Kishida, University of Illinois, Urbana-Champaign Members: - Richard Blute, University of Ottawa - Spencer Breiner, NIST - Daniel Cicala, University of New Haven - Robin Cockett, University of Calgary - Bob Coecke, Cambridge Quantum Computing - Geoffrey Cruttwell, Mount Allison University - Valeria de Paiva, Samsung Research America and University of Birmingham - Brendan Fong, Massachusetts Institute of Technology - Jonas Frey, Carnegie Mellon University - Tobias Fritz, Perimeter Institute for Theoretical Physics - Fabrizio Romano Genovese, Statebox - Helle Hvid Hansen, University of Groningen - Jules Hedges, University of Strathclyde - Chris Heunen, University of Edinburgh - Alex Hoffnung, Bridgewater - Martti Karvonen, University of Ottawa - Kohei Kishida, University of Illinois, Urbana-Champaign (chair) - Martha Lewis, University of Bristol - Bert Lindenhovius, Johannes Kepler University Linz - Ben MacAdam, University of Calgary - Dan Marsden, University of Oxford - Jade Master, University of California, Riverside - Joe Moeller, NIST - Koko Muroya, Kyoto University - Simona Paoli, University of Leicester - Daniela Petrisan, Universit? de Paris, IRIF - Mehrnoosh Sadrzadeh, University College London - Peter Selinger, Dalhousie University - Michael Shulman, University of San Diego - David Spivak, MIT and Topos Institute - Joshua Tan, University of Oxford - Dmitry Vagner - Jamie Vicary, University of Cambridge - John van de Wetering, Radboud University Nijmegen - Vladimir Zamdzhiev, Inria, LORIA, Universit? de Lorraine - Maaike Zwart From p.oliva at qmul.ac.uk Fri Apr 16 10:41:46 2021 From: p.oliva at qmul.ac.uk (Paulo Oliva) Date: Fri, 16 Apr 2021 14:41:46 +0000 Subject: [TYPES/announce] Faculty position in Theoretical CS @ QMUL, London Message-ID: <2110C4F7-4883-441A-95E8-3936ABA0F654@qmul.ac.uk> School of Electronic Engineering & Computer Science Queen Mary University of London - Mile End Campus Salary: ?42,433 - ?53,833 per annum, inclusive of London Allowance (Grade 6) Location: Mile End Closing date: 25-Apr-2021 The School of Electronic Engineering and Computer Science at Queen Mary University of London is looking to appoint a Lecturer in Computing Science to join our Theoretical Computer Science Research Group (http://theory.eecs.qmul.ac.uk/) in the School of Electronic Engineering and Computer Science (EECS) at Queen Mary University of London. For more information and to apply visit: https://webapps2.is.qmul.ac.uk/jobs/job.action?jobID=5451 Informal enquiries should be addressed to Professor Steve Uhlig at eecs-head at qmul.ac.uk -- Dr Paulo Oliva Reader in Mathematical Logic School of Electronic Engineering and Computer Science Queen Mary University of London, London E1 4FZ +44 (0) 207 882 5255 http://www.eecs.qmul.ac.uk/~pbo -------------- next part -------------- An HTML attachment was scrubbed... URL: From h.basold at liacs.leidenuniv.nl Fri Apr 16 11:49:11 2021 From: h.basold at liacs.leidenuniv.nl (Henning Basold) Date: Fri, 16 Apr 2021 17:49:11 +0200 Subject: [TYPES/announce] TYPES 2021: types for proofs & programs, Virtual, 14-19 Jun 2021 Message-ID: <9b5ed88f-872b-66cc-d036-b0c40a22f23e@liacs.leidenuniv.nl> Call for Contributions TYPES 2021 26th International Conference on Types for Proofs and Programs 14 - 19 June 2021 Virtual and possibly Leiden, The Netherlands https://types21.liacs.nl/ Note that the deadline for submission has been extended to 23 April. As the goal is to use TYPES as a forum for collaboration, you may also consider to submit an abstract based on your contribution that was planned to be presented during TYPES 2020, if you find that appropriate. Background -------------- The TYPES meetings are a forum to present new and on-going work in all aspects of type theory and its applications, especially in formalised and computer assisted reasoning and computer programming. The TYPES areas of interest include, but are not limited to: * Foundations of type theory and constructive mathematics; * Applications of type theory (e.g., linguistics or concurrency); * Dependently typed programming; * Industrial uses of type theory technology; * Meta-theoretic studies of type systems; * Proof assistants and proof technology; * Automation in computer-assisted reasoning; * Links between type theory and functional programming; * Formalising mathematics using type theory; * Homotopy type theory and univalent mathematics. We encourage talks proposing new ways of applying type theory. In the spirit of workshops, talks may be based on newly published papers, work submitted for publication, but also work in progress. Venue ---------- This year?s TYPES will be held virtually (online), possibly in combination with a physical meeting in Leiden in the Netherlands if the political situation permits that. That the conference is held virtually constrains the time of talks, and complicates exchange and collaboration. TYPES 2021 will therefore not only consist of presentations, but also a setup of working groups that get together throughout the week. Every day will be split into a session of talks and tutorials, and a collaboration session during which the working groups will get together. The hope is that we can retain at least some of the exchange and chatter that is the heart of the TYPES conference series. Invited Talks and Tutorials ----------------------------- Stephanie Balzer (Carnegie Mellon University) Ulrik Buchholtz (Technical University Darmstadt) Sara Negri (University of Genova) Pierre-Marie P?drot (INRIA -- Inria Rennes-Bretagne-Atlantique) Contributed Talks -------------------- TYPES solicits contributed talks to stimulate discussions. The contributed talks are selected on the base of extended abstracts/short papers of 2 pages (excluding bibliography) formatted with the LaTeX EasyChair3.5 (https://easychair.org/publications/for_authors) style. An abstract can be based on existing, submitted or novel work, and is not in conflict with any other forms of publication. Submissions are handled via EasyChair: https://easychair.org/conferences/?conf=types2021 Upon submission, authors have to select the category of their contribution: presentation-only talks and talks with the intent to contribute to the post-proceedings. Presentation-only talks will consist of a 5 minutes recorded video that is shown during the conference in combination with 5 minutes live discussion. The purpose of recording the talk beforehand is to avoid technical issues. Talks with the intent for post-proceedings submission get a slot for a 10 minutes live talk plus 5 minutes discussion during the conference. The idea is that in this case, an interactive discussion with more in-depth feedback will help to submit to the post-proceedings. Note that the selection at this stage only expresses an intent to submit to the post-proceedings, and that you are neither obliged to submit your work nor are you excluded from the submission to the post-proceedings should you not submit an intent at this stage. The idea is only to help you with more feedback during the conference. Please be fair in selecting this category because the time in a virtual conference is very limited and should be given to those authors who really need it. Important dates ------------------ * Submission of abstract 23 April 2021 AoE * Author notification 14 May 2021 * Camera-ready version of abstract 4 June 2021 AoE * Conference 14 - 18 June 2021 Camera-ready versions of the accepted contributions will be published in an informal book of abstracts for distribution during the conference. Attendance and Fees ----------------------- Despite the difficulty that a virtual event brings, it also offers a chance. We will make TYPES as inclusive as possible, which means that attending virtually is free of charge, if you are not in the position to pay fees. For everyone else, the fees will be low and only to cover the costs of setting up the infrastructure and organisation. Should it be possible that we can have a hybrid virtual-physical meeting, then there will also be some costs for recording and streaming that will have to be shared between local and virtual attendees. However, we will keep these low in general and free for those who cannot afford to pay fees. About Types --------------- The TYPES meetings from 1990 to 2008 were annual workshops of a sequence of five EU funded networking projects. From 2009 to 2015, TYPES has been run as an independent conference series. From 2016, TYPES is partially supported by COST Action EUTypes CA15123. Previous TYPES meetings were held in Antibes (1990), Edinburgh (1991), B?stad (1992), Nijmegen (1993), B?stad (1994), Torino (1995), Aussois (1996), Kloster Irsee (1998), L?keberg (1999), Durham (2000), Berg en Dal near Nijmegen (2002), Torino (2003), Jouy-en-Josas near Paris (2004), Nottingham (2006), Cividale del Friuli (2007), Torino (2008), Aussois (2009), Warsaw (2010), Bergen (2011), Toulouse (2013), Paris (2014), Tallinn (2015), Novi Sad (2016), Budapest (2017), Braga (2018), Oslo (2019) and Turin (2020). Post-proceedings ------------------- Similarly to TYPES 2011 and TYPES 2013-2020, a post-proceedings volume will be published in the Leibniz International Proceedings in Informatics (LIPIcs) series. Submission to that volume will be open to everyone. Tentative dates for post-proceedings: * Non-binding intent (abstract) 29 October 2021 * Paper submission 26 November 2021 * Author notification 25 March 2022 The formal call with binding dates for the post-proceedings will be issued after the conference. Contact ----------- Email: types21 at liacs.leidenuniv.nl Web form: https://types21.liacs.nl/contact/ Programme Committee --------------------- Henning Basold (LIACS -- Leiden University) (chair) Stefano Berardi (Universit? di Torino) Marc Bezem (University of Bergen) Fr?d?ric Blanqui (INRIA -- ENS Paris-Saclay) Sandrine Blazy (INRIA -- University of Rennes) Ana Bove (Chalmers / U. of Gothenburg) Paolo Capriotti (TU Darmstadt) Jesper Cockx (TU Delft) Jos? Esp?rito Santo (University of Minho) Herman Geuvers (Radboud University Nijmegen) Silvia Ghilezan (University of Novi Sad) Nicolai Kraus (U. of Nottingham) Sergue? Lenglet (Univ. de Lorraine) Assia Mahboubi (INRIA -- Nantes and VU Amsterdam) Ralph Matthes (IRIT -- CNRS and University of Toulouse) Keiko Nakata (Kyoto University) Fredrik Nordvall Forsberg (University of Strathclyde) Jorge A. P?rez (University of Groningen) Gabriel Scherer (INRIA Saclay) Aleksy Schubert (University of Warsaw) Niccol? Veltri (Tallin UT) Stephanie Weirich (U. of Pennsylvania) Organiser ------------ Henning Basold (LIACS -- Leiden University) -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_signature Type: application/pgp-signature Size: 665 bytes Desc: OpenPGP digital signature URL: From serge.autexier at dfki.de Mon Apr 19 03:22:59 2021 From: serge.autexier at dfki.de (Serge Autexier) Date: Mon, 19 Apr 2021 09:22:59 +0200 (CEST) Subject: [TYPES/announce] 2021 Conference on Intelligent Computer Mathematics - Doctoral Programme - Call for Abstracts Message-ID: <20210419072259.3C9701DBEC3A@gigondas.localdomain> Call for Abstracts - Doctoral Programme 14th Conference on Intelligent Computer Mathematics - CICM 2021 - July 26-31, 2020 http://www.cicm-conference.org/2021 CICM is an excellent opportunity for graduate students to meet established researchers from the areas of computer algebra, automated deduction, and mathematical publishing. The Doctoral Programme provides a dedicated forum for PhD students to present and discuss their ideas, ongoing or planned research, and results in an open atmosphere. It will consist of presentations by the PhD students to get constructive feedback, advice, and suggestions from the research advisory board, researchers, and other PhD students. Each PhD student will be assigned to an experienced researcher from the research advisory board who will act as a mentor and who will provide detailed feedback and advice on their intended and ongoing research. Application Students at any stage of their PhD can apply and should submit the following documents: * A two-page abstract of your thesis describing your research questions, research plans, completed and remaining research, evaluation plans and publication plans; * A two-page CV that includes background information (name, university, supervisor), education (degree sought, year/status of degree, previous degrees), employments, relevant research experience (publications, presentations, attended conferences or workshops, etc.) All submissions should be made via https://easychair.org/my/conference?conf=cicm2021 until 15 May 2021. The doctoral program will be held online. More details here: https://cicm-conference.org/2021/cicm.php?event=&menu=general From anupamdotdas at gmail.com Mon Apr 19 05:52:47 2021 From: anupamdotdas at gmail.com (anupamdotdas at gmail.com) Date: Mon, 19 Apr 2021 10:52:47 +0100 Subject: [TYPES/announce] =?utf-8?q?TABLEAUX_2021_=E2=80=93_Final_Call_fo?= =?utf-8?q?r_Papers=2E_**Extended_deadlines**=2E_6-9_September=2C_2?= =?utf-8?q?021=2E_Birmingham=2C_UK=2E?= Message-ID: <006601d73501$c12955b0$437c0110$@gmail.com> TABLEAUX 2021 The 30th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods Birmingham, UK, September 6-9, 2021 Website: https://tableaux2021.org/ ***EXTENDED DEADLINES***: 26 April (abstract), 30 April 2021 (paper) GENERAL INFORMATION The 30th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2021) will be hosted by the University of Birmingham, UK, 6-9 September 2021. TABLEAUX is the main international conference at which research on all aspects -- theoretical foundations, implementation techniques, systems development and applications -- of tableaux-based reasoning and related methods is presented. The first TABLEAUX conference was held in Lautenbach near Karlsruhe, Germany, in 1992. Since then it has been organised on an annual basis (sometimes as a part of IJCAR). TABLEAUX 2021 will be co-located with the 13th International Symposium on Frontiers of Combining Systems (FroCoS 2021). The conferences will provide a rich programme of workshops, tutorials, invited talks, paper presentations and system descriptions. SCOPE OF CONFERENCE Tableaux and other proof based methods offer convenient and flexible tools for automated reasoning for both classical and non-classical logics. Areas of application include verification of software and computer systems, deductive databases, knowledge representation and its required inference engines, teaching, and system diagnosis. Topics of interest include but are not limited to: * tableau methods for classical and non-classical logics (including first-order, higher-order, modal, temporal, description, hybrid, intuitionistic, linear, substructural, fuzzy, relevance and non-monotonic logics) and their proof-theoretic foundations; * sequent, natural deduction, labelled, nested and deep calculi for classical and non-classical logics, as tools for proof search and proof representation; * related methods (SMT, model elimination, model checking, connection methods, resolution, BDDs, translation approaches); * flexible, easily extendable, light-weight methods for theorem proving; novel types of calculi for theorem proving and verification in classical and non-classical logics; * systems, tools, implementations, empirical evaluations and applications (provers, proof assistants, logical frameworks, model checkers, etc.); * implementation techniques (data structures, efficient algorithms, performance measurement, extensibility, etc.); * extensions of tableau procedures with conflict-driven learning; * techniques for proof generation and compact (or humanly readable) proof representation; * theoretical and practical aspects of decision procedures; * applications of automated deduction to mathematics, software development, verification, deductive and temporal databases, knowledge representation, ontologies, fault diagnosis or teaching. We also welcome papers describing applications of tableau procedures to real-world examples. Such papers should be tailored to the TABLEAUX community and should focus on the role of reasoning and on logical aspects of the solution. INVITED SPEAKERS TABLEAUX 2021 is pleased to confirm the following the invited speakers: Orna Kupferman (Hebrew University, Israel) Revantha Ramanayake (University of Groningen, The Netherlands) Greg Restall (University of Melbourne, Australia / University of St Andrews, UK) Renate Schmidt (joint with FroCoS) (University of Manchester, UK) SUBMISSION GUIDELINES Submissions are invited in the following two categories: (A) research papers reporting original theoretical research or applications, with length up to 15 pages excluding references; (B) system descriptions, with length up to 9 pages excluding references. There will also be a later call inviting position papers and brief reports on work-in-progress. Details will be kept up to date on the website. Submissions will be reviewed by the PC, possibly with the help of external reviewers, taking into account readability, relevance and originality. Any additional material (going beyond the page limit) can be included in a clearly marked appendix, which will be read at the discretion of the committee and must be removed for the camera-ready version. For category (A) submissions, the reported results must be original and not submitted for publication elsewhere. For category (B) submissions, a working implementation must be accessible via the internet. Authors are encouraged to publish the implementation under an open source license. The aim of a system description is to make the system available in such a way that people can use it, understand it, and build on it. Accepted papers in categories (A) and (B) will be published in the conference proceedings. Papers must be edited in LaTeX using the llncs style and must be submitted electronically as PDF files via the EasyChair system: https://easychair.org/conferences/?conf=tableaux21 For all accepted papers at least one author is required to register to the conference and present the paper. A title and a short abstract of about 100 words must be submitted before the paper submission deadline. Formatting instructions and the LNCS style files can be obtained at: http://www.springer.com/br/computer-science/lncs/conference-proceedings-guidelines IMPORTANT DATES **Extended abstract submission:** 26 April 2021 (AoE) **Extended paper submission:** 30 April 2021 (AoE) Notification: 14 June 2021 Conference: 6-9 September 2021 CONFERENCE FORMAT AND COVID-19 TABLEAUX 2021 and FroCoS 2021 are intended to be *hybrid* conferences welcoming both physical and virtual participation. The organisers are closely monitoring the pandemic situation and may choose to make the conference virtual-only if it seems unreasonable to host any sort of physical event. A final decision will be taken before the notification date 14 June (12 weeks before the conference) to leave ample time for potential travel plans to be made. PUBLICATION The conference proceedings will be published in the Springer series Lecture Notes in Artificial Intelligence (LNAI/LNCS). BEST PAPER AWARDS The program committee will select * the TABLEAUX 2021 Best Paper; and, * the TABLEAUX 2021 Best Paper by a Junior Researcher. Researchers will be considered "junior" if either they are students or their PhD degree date is less than two years from the first day of the meeting. The two awards will be presented at the conference. TRAVEL GRANTS FOR STUDENTS Some funding may be available to support students participating at TABLEAUX 2021. More details will be given on the conference website in due time. PROGRAM COMMITTEE Bahareh Afshari (University of Amsterdam, Netherlands, and University of Gothenburg, Sweden) Carlos Areces (Universidad Nacional de C?rdoba, Argentina) Arnon Avron (Tel-Aviv University, Israel) Nick Bezhanishvili (University of Amsterdam, Netherlands) Patrick Blackburn (University of Roskilde, Denmark) Serenella Cerrito (Universit? Paris-Saclay, Univ Evry, France) Kaustuv Chaudhuri (Inria, France) Liron Cohen (Ben-Gurion University, Israel) Anupam Das (University of Birmingham, UK) St?phane Demri (CNRS, France) Hans de Nivelle (Nazarbayev University, Kazakhstan) Valeria de Paiva (Topos Institute Berkeley, USA) Clare Dixon (University of Manchester, UK) Christian Ferm?ller (TU Wien, Austria) Didier Galmiche (Universit? de Lorraine, France) Silvio Ghilardi (Universit? degli Studi di Milano, Italy) Rajeev Gor? (Australian National University, Australia) Andrzej Indrzejczak (University of ??d?, Poland) Hidenori Kurokawa (Kanazawa University, Japan) Stepan Kuznetsov (Russian Academy of Sciences, Russia) Bj?rn Lellmann (SBA Research, Austria) St?phane Graham-Lengrand (SRI International, USA) George Metcalfe (University of Bern, Switzerland) Neil Murray (University At Albany, USA) Cl?udia Nalon (Universidade de Bras?lia, Brazil) Sara Negri (University of Genoa, Italy) Nicola Olivetti (Aix-Marseille University, France) Eugenio Orlandelli (University of Bologna, Italy) Jens Otten (University of Oslo, Norway) Alessandra Palmigiano (Vrije Universiteit Amsterdam, Netherlands) Dirk Pattinson (Australian National University, Australia) Frank Pfenning (Carnegie Mellon University, USA) Elaine Pimentel (Federal University of Rio Grande do Norte, Brazil) Andrei Popescu (University of Sheffield, UK) Gian Luca Pozzato (University of Turin, Italy) Giselle Reis (Carnegie Mellon University, Qatar) Reuben Rowe (Royal Holloway, UK) Jos? Esp?rito Santo (University of Minho, Portugal) Lutz Stra?burger (Inria, France) Josef Urban (Czech Technical University in Prague, Czech Republic) PC CHAIRS Anupam Das (University of Birmingham, UK) Sara Negri (University of Genoa, Italy) -------------- next part -------------- An HTML attachment was scrubbed... URL: From elaine.pimentel at gmail.com Mon Apr 19 06:45:40 2021 From: elaine.pimentel at gmail.com (Elaine Pimentel) Date: Mon, 19 Apr 2021 07:45:40 -0300 Subject: [TYPES/announce] LFMTP 2021 (extended deadline) Message-ID: ============================================================ Call for papers Logical Frameworks and Meta-Languages: Theory and Practice LFMTP 2021 Pittsburgh, USA, 16 July 2021 Affiliated with CADE-28 http://lfmtp.org/workshops/2021/ ============================================================ Abstract submission deadline: 26 April 2021 (extended) Paper submission deadline: 03 May 2021 (extended) Logical frameworks and meta-languages form a common substrate for representing, implementing and reasoning about a wide variety of deductive systems of interest in logic and computer science. Their design, implementation and their use in reasoning tasks, ranging from the correctness of software to the properties of formal systems, have been the focus of considerable research over the last two decades. This workshop will bring together designers, implementors and practitioners to discuss various aspects impinging on the structure and utility of logical frameworks, including the treatment of variable binding, inductive and co-inductive reasoning techniques and the expressiveness and lucidity of the reasoning process. LFMTP 2021 will provide researchers a forum to present state-of-the-art techniques and discuss progress in areas such as the following: * Encoding and reasoning about the meta-theory of programming languages, logical systems and related formally specified systems. * Theoretical and practical issues concerning the treatment of variable binding, especially the representation of, and reasoning about, datatypes defined from binding signatures. * Logical treatments of inductive and co-inductive definitions and associated reasoning techniques, including inductive types of higher dimension in homotopy type theory * Graphical languages for building proofs, applications in geometry, equational reasoning and category theory. * New theory contributions: canonical and substructural frameworks, contextual frameworks, proof-theoretic foundations supporting binders, functional programming over logical frameworks, homotopy and cubical type theory. * Applications of logical frameworks: proof-carrying architectures, proof exchange and transformation, program refactoring, etc. * Techniques for programming with binders in functional programming languages such as Haskell, OCaml or Agda, and logic programming languages such as lambda Prolog or Alpha-Prolog. Important Dates Abstract submission deadline: Monday April 26 (extended) Submission deadline: Monday May 03 (extended) Notification to authors: Monday May 31 Final version due: Monday June 14 Workshop date: Friday July 16 Submission In addition to regular papers, we welcome/encourage the submission of "work in progress" reports, in a broad sense. Those do not need to report fully polished research results, but should be of interest for the community at large. Submitted papers should be in PDF, formatted using the EPTCS style guidelines. The length is restricted to 15 pages for regular papers and 8 pages for "Work in Progress" papers. Submission is via EasyChair: https://easychair.org/conferences/?conf=lfmtp2021 Proceedings A selection of the presented papers will be published online in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Invited Speakers * Giselle Reis (CMU-Qatar) * Matthieu Sozeau (Inria) Program Committee * David Baelde (LSV, ENS Paris-Saclay & Inria Paris) * Roberto Blanco (MPI-SP) * Alberto Ciaffaglione (University of Udine) * Claudio Sacerdoti Coen (University of Bologna) * Marina Lenisa (Universit? degli Studi di Udine) * Dennis M?ller (Friedrich-Alexander-University) * Michael Norrish (CSIRO) * Elaine Pimentel (Universidade Federal do Rio Grande do Norte) co-chair * Ulrich Sch?pp (fortiss GmbH) * Kathrin Stark (Princeton University) * Aaron Stump (The University of Iowa) * Nora Szasz (Universidad ORT Uruguay) * Enrico Tassi (Inria) co-chair * Alwen Tiu (The Australian National University) * Tjark Weber (Uppsala University) -------------- next part -------------- An HTML attachment was scrubbed... URL: From sandra at dcc.fc.up.pt Mon Apr 19 08:55:14 2021 From: sandra at dcc.fc.up.pt (Sandra Alves) Date: Mon, 19 Apr 2021 13:55:14 +0100 Subject: [TYPES/announce] Women in Logic 2021 - Call for Participation Message-ID: <648CB319-80E1-4B49-9D8D-93D9312BBDDB@dcc.fc.up.pt> -------------------------------------------------------------------------------------------- Call for Contributions WiL 2021: 5th Women in Logic Workshop June 27, 2021 part of LICS 2021 https://sites.google.com/g.uporto.pt/wil2021 -------------------------------------------------------------------------------------------- Women in Logic 2021 is a satellite event of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS?21) to be held virtually on June 29-July 2, 2021. The Women in Logic workshop (WiL) provides an opportunity to increase awareness of the valuable contributions made by women in the area of logic in computer science. Its main purpose is to promote the excellent research done by women, with the ultimate goal of increasing their visibility and representation in the community. Our aim is to: - provide a platform for female researchers to share their work and achievements; - increase the feelings of community and belonging, especially among junior faculty, post-docs and students through positive interactions with peers and more established faculty; - establish new connections and collaborations; - foster a welcoming culture of mutual support and growth within the logic research community. We believe these aspects will benefit women working in logic and computer science, particularly early-career researchers. Previous versions of Women in Logic (Reykjav?k, Iceland 2017, Oxford, UK 2018, Vancouver, Canada 2019, and Paris, France 2020) were very successful in showcasing women's work and as catalysts for a recognition of the need for change in the community. Topics of interest include but are not limited to: 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. INVITED SPEAKERS Simona Ronchi Della Rocca Rineke Verbrugge IMPORTANT DATES Abstract submission deadline: April 30, 2021 Notification: May 28, 2021 Workshop: June 27, 2021 SUBMISSIONS Abstracts should be written in English (1-2 pages), and prepared using the Easychair style (https://easychair.org/publications/for_authors ). The abstracts should be uploaded to the WiL 2021 Easychair page as a PDF file (https://easychair.org/conferences/?conf=wil2021 ) before the submission deadline on April 30, 2021, anywhere on Earth. ORGANIZING AND PROGRAM COMMITTEE * Sandra Alves (Co-chair, University of Porto) * Agata Ciabattoni (TU Wien) * Amy Felty (University of Ottawa) * Maribel Fern?ndez (King's College London) * Helle Hansen (University of Groningen) * Delia Kesner (Universit? de Paris) * Sandra Kiefer (Co-chair, RWTH Aachen University) * Koko Muroya (RIMS Kyoto University) * Daniele Nantes (University of Bras?lia) * Ayb?ke ?zg?n (ILLC - University of Amsterdam) * Valeria de Paiva (Topos Institute) * Ana Sokolova (Co-chair, University of Salzburg) _______________________________________________ women-in-logic mailing list -- women-in-logic at lists.rwth-aachen.de To unsubscribe send an email to women-in-logic-leave at lists.rwth-aachen.de -------------- next part -------------- An HTML attachment was scrubbed... URL: From ruy at cin.ufpe.br Sun Apr 18 11:50:39 2021 From: ruy at cin.ufpe.br (Ruy Jose Guerra Barretto de Queiroz) Date: Sun, 18 Apr 2021 12:50:39 -0300 Subject: [TYPES/announce] 27th WoLLIC 2021 - 2nd Call for Papers In-Reply-To: References: Message-ID: [Please circulate. Apologies for multiple copies.] CALL FOR PAPERS WoLLIC 2021 27th Workshop on Logic, Language, Information and Computation October 5 to 8, 2021 ORGANISATION Universidade de S?o Paulo, Brazil University College London, UK 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 online from October 5 to 8, 2021. 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 (https://easychair.org/conferences/?conf=wollic2021 ). PROCEEDINGS The proceedings of WoLLIC 2021, 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 2021 issue of a scientific journal (to be confirmed). INVITED SPEAKERS Catarina Dutilh Novaes (VU Amsterdam) Santiago Figueira (Universidad de Buenos Aires, Argentina) Andreas Herzig (IRIT, France) Cl?udia Nalon (UnB - Brazil) Giselle Reis (CMU - Qatar) IMPORTANT DATES May 15, 2021: Full paper deadline June 23, 2021: Author notification June 30, 2021: Final version deadline (firm) PROGRAMME COMMITTEE Carlos Areces (Cordoba, Argentina) Arthur Amorim Azevedo (CMU, USA) Nina Gierasimczuk (Technical University of Denmark, Denmark) 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 (University of Groningen, The Netherlands) Jurriaan Rot (Radboud University, The Netherlands) 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 Renata Wassermann (Univ S?o Paulo) (Co-Chair) Alexandra Silva (Univ College London) (Co-Chair) Anjolina G. de Oliveira (Univ Federal de Pernambuco, Brasil) Ruy de Queiroz (Univ Federal de Pernambuco, Brasil) (co-chair) SCIENTIFIC SPONSORSHIP Interest Group in Pure and Applied Logics (IGPL) The Association for Logic, Language and Information (FoLLI) Association for Symbolic Logic (ASL) European Association for Theoretical Computer Science (EATCS) 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/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From wim.vanhoof at unamur.be Mon Apr 19 14:38:36 2021 From: wim.vanhoof at unamur.be (Wim Vanhoof) Date: Mon, 19 Apr 2021 20:38:36 +0200 Subject: [TYPES/announce] LOPSTR 2021 2nd Call for Papers Message-ID: <53E0582F-D5F7-4ECA-B596-FA27424E84F5@unamur.be> =========================================================================== 31st International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2021 http://saks.iasi.cnr.it/lopstr21/ Tallinn, Estonia, September 7-9, 2021 (co-located with PPDP 2021) =========================================================================== The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. The 31st International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2021) will be held at the Teachers' House in Tallinn, Estonia. Previous symposia were held in Bologna (as a virtual meeting), Porto, Frankfurt am Main, Namur, Edinburgh, Siena, Canterbury, Madrid, Leuven, Odense, Hagenberg, Coimbra, Valencia, Kongens Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester. LOPSTR 2021 will be co-located with PPDP 2021 (International Symposium on Principles and Practice of Declarative Programming). Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large, including, but not limited to: - synthesis - transformation - specialization - composition - optimization - inversion - specification - analysis and verification - testing and certification - program and model manipulation - machine learning for program development - verification and testing of machine learning systems - transformational techniques in SE - applications and tools Both full papers and extended abstracts describing foundations and applications in these areas are welcome. Survey papers that present some aspects of the above topics from a new perspective and papers that describe experience with industrial applications are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chairs in case of questions). * Important Dates * Abstract submission (optional): May 1, 2021 (AoE) Paper/Extended abstract submission: May 15, 2021 Notification: July 1, 2021 Camera-ready (for electronic pre-proceedings): August 20, 2021 Symposium: September 7-9, 2021 Revised paper submission: November 1, 2021 (AoE) Notification: December 1, 2021 Final version (for post-proceedings): January 16, 2022 * Submission Guidelines * Authors should submit an electronic copy of the paper (written in English) in PDF, formatted in LNCS style. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email; abstract; and three to four keywords which will be used to assist the PC in selecting appropriate reviewers for the paper. Page numbers (and, if possible, line numbers) should appear on the manuscript to help the reviewers in writing their report. Full papers cannot exceed 15 pages excluding references. Extended abstracts cannot exceed 8 pages excluding references. Additional pages may be used for appendices not intended for publication. Reviewers are not required to read the appendices, and thus papers should be intelligible without them. Papers should be submitted via EasyChair: https://easychair.org/conferences/?conf=lopstr2021 * Proceedings * The formal post-conference proceedings will be published by Springer in the Lecture Notes in Computer Science series as in previous years. Full papers can be directly accepted for publication in the formal proceedings, or accepted only for presentation at the symposium and inclusion in informal proceedings. After the symposium, all authors of extended abstracts and full papers accepted only for presentation will be invited to revise and/or extend their submissions. Then, after another round of reviewing, these revised papers may also be published in the formal proceedings. Authors should consult Springer?s authors? guidelines and use their proceedings templates for the preparation of their papers. Springer encourages authors to include their ORCIDs in their papers. * Best paper awards * Thanks to Springer's sponsorship, two awards (including a 500 EUR prize each) will be given at LOPSTR 2021. The program committee will select the winning papers based on relevance, originality and technical quality but may also take authorship into account (e.g. a student paper). * Invited Speaker * TBA * Program Committee * Roberto Amadini, University of Bologna, Italy Sabine Broda, University of Porto, Portugal Maximiliano Cristi?, CIFASIS-UNR, Argentina W?odzimierz Drabent, IPI PAN, Poland & Link?ping University, Sweden Catherine Dubois, ENSIIE-Samovar, France Gregory Duck, National University of Singapore, Singapore Fabio Fioravanti, University of Chieti-Pescara, Italy Jeremy Gibbons, University of Oxford, UK Gopal Gupta, University of Texas at Dallas, USA Geoff Hamilton, Dublin City University, Ireland Michael Hanus, Kiel University, Germany Bishoksan Kafle, IMDEA Software Institute, Spain Maja Kirkeby, Roskilde University, Denmark Temur Kutsia, RISC J. Kepler University of Linz, Austria Michael Leuschel, University of D?sseldorf, Germany Pedro L?pez-Garc?a, IMDEA Software Institute & CSIC, Spain Jacopo Mauro, University of Southern Denmark, Denmark Fred Mesnard, Universit? de la R?union, France Alberto Momigliano, University of Milano, Italy Jorge A. Navas, SRI International, USA Naoki Nishida, Nagoya University, Japan Alicia Villanueva, Universitat Polit?cnica de Val?ncia, Spain * Program Chairs * Emanuele De Angelis, IASI-CNR, Italy Wim Vanhoof, University of Namur, Belgium * Local organisation * Niccol? Veltri, Tallinn University of Technology, Estonia * Contact * For more information, please contact the Program Committee Chairs: emanuele.deangelis at iasi.cnr.it, wim.vanhoof at unamur.be -------------- next part -------------- An HTML attachment was scrubbed... URL: From s.lasota at uw.edu.pl Mon Apr 19 15:47:40 2021 From: s.lasota at uw.edu.pl (=?UTF-8?Q?S=C5=82awomir_Lasota?=) Date: Mon, 19 Apr 2021 21:47:40 +0200 Subject: [TYPES/announce] Highlights of Logic, Games, and Automata 2021: 1st Call for Presentations Message-ID: ******************************************************** HIGHLIGHTS 2021: 9th annual conference on Highlights of LOGIC, GAMES, and AUTOMATA 15-17 September 2021, Aachen (but most probably online) http://highlights-conference.org We invite submissions for contributed talks (around 10 minutes). IMPORTANT DATES: + Submission deadline: 4 JUNE, 7pm GMT + Notification: 18 JUNE, 7pm GMT Submission instructions and more detailed information about the conference to be found at http://highlights-conference.org ******************************************************** HIGHLIGHTS 2021 is the 9th conference on Highlights of Logic, Games, and Automata that aims to integrate the diverse research community working in the areas of Logic, Finite Model Theory, Automata Theory, Games 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. There will be a tutorial day (14 September) and three days for the conference (15-17 September). This year's edition will be most probably held online, with no registration fees. TUTORIAL (September 14) + Christoph Haase + Micha? Pilipczuk KEYNOTES + Rajeev Alur + Balder ten Cate + Karoliina Lehtinen + Nutan Limaye + Joel Ouaknine -------------- next part -------------- An HTML attachment was scrubbed... URL: From kedar.namjoshi at nokia-bell-labs.com Mon Apr 19 17:03:27 2021 From: kedar.namjoshi at nokia-bell-labs.com (Namjoshi, Kedar (Nokia - US/Murray Hill)) Date: Mon, 19 Apr 2021 21:03:27 +0000 Subject: [TYPES/announce] SAS 2021 CFP Extended Deadline Message-ID: SAS 2021 CALL FOR PAPERS ################## Extended Deadline ################## Paper submission: April 30, 2021 Artifact submission: May 6, 2021 Full CFP: https://conf.researchr.org/home/sas-2021 ################## Extended Deadline ################## The 28th Static Analysis Symposium, SAS 2021, will be held in Chicago (US) from October 17-22, 2021 in conjunction with SPLASH 2021. Static analysis is widely recognized as a fundamental tool for program verification, bug detection, compiler optimization, program understanding, and software maintenance. The series of Static Analysis Symposia has served as the primary venue for the presentation of theoretical, practical, and application advances in the area. PAPER SUBMISSION All paper submissions will be judged on the basis of significance, relevance, correctness, originality, and clarity. Submission link: https://easychair.org/conferences/?conf=sas2021 Regular papers (18 pages max., lightweight double-blind) Short papers (10 pages max.) may focus on any of the following: * Experience with static analysis tools, Industrial Reports, and Case Studies (non-blind) * Tool papers (lightweight double-blind) * Brief announcements of work in progress (lightweight double-blind) * Well-motivated discussion of new questions or new areas (lightweight double-blind) Radhia Cousot Award The program committee will select an accepted regular paper for the Radhia Cousot Young Researcher Best Paper Award in memory of Radhia Cousot and her fundamental contributions to static analysis, as well as being one of the main promoters and organizers of the SAS series of conferences. ARTIFACTS As in previous years, we encourage authors to submit a virtual machine image containing any artifacts and evaluations presented in the paper. Artifact submission is optional. Artifact evaluation will be concurrent with paper review. -------------- next part -------------- An HTML attachment was scrubbed... URL: From riccardo.treglia at unito.it Tue Apr 20 04:00:31 2021 From: riccardo.treglia at unito.it (Riccardo Treglia) Date: Tue, 20 Apr 2021 10:00:31 +0200 Subject: [TYPES/announce] ITRS 21 - Final CfP Message-ID: ITRS 2021 Call for papersTenth Workshop on Intersection Types and Related Systems - ITRS 2021 17 July 2021, Online Affiliated with FSCD , 17-24 July 2021, Buenos Aires Web page: http://www.di.unito.it/~deligu/ITRS2021/ Aims and Scope Intersection types were introduced near the end of the 1970s to overcome the limitations of Curry's type assignment system and to provide a characterization of the strongly normalizing terms of the Lambda Calculus. The key idea is to introduce an intersection type constructor ? such that a term of type t ? s can be used at both type t and s within the same context. This provides a finite polymorphism where various, even unrelated, types of the term are listed explicitly, differently from the more widely used universally quantified types where the polymorphic type is the common schema that stands for its various type instances. As a consequence, more terms (all and only the normalizing terms) can be typed than with universal polymorphism. Although intersection types were initially intended for use in analyzing and/or synthesizing lambda models as well as in analyzing normalization properties, over the last twenty years the scope of the research on intersection types and related systems has broadened in many directions. Restricted (and more manageable) forms have been investigated, such as refinement types. Type systems based on intersection type theory have been extensively studied for practical purposes, such as program analysis and higher-order model checking. The dual notion of union types turned out to be quite useful for programming languages. Finally, the behavioural approach to types, which can give a static specification of computational properties, has become central in the most recent research on type theory. The ITRS 2021 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches. Possible topics for submitted papers include, but are not limited to: - Formal properties of systems with intersection types. - Results for related systems, such as union types, refinement types, or singleton types. - Applications to lambda calculus, pi-calculus and similar systems. - Applications for programming languages, program analysis, and program verification. - Applications for other areas, such as database query languages and program extraction from proofs. - Related approaches using behavioural/intensional types and/or denotational semantics to characterize computational properties. - Quantitative refinements of intersection types. ITRS workshops have been held every two years (with the exception of 2020, because of COVID-19 outbreak). Information about the previous events is available on the ITRS home page . Invited Speaker - Jeremy Siek (Indiana University Bloomington) Paper Submissions Papers must be original and not previously published, nor submitted elsewhere. Papers should be prepared in LaTeX using the EPTCS macro package and should be in the range of 3-16 pages, plus at most 2 pages of references. Submissions will be collected via EasyChair and reviewed by anonymous referees. Important Dates - Paper submission: 12 April *26 April 2021 (extended)* - Author notification: 24 May 2021 - Final version: 18 June 2021 - Workshop: 17 July 2021 Program Committee - Antonio Bucciarelli, Universit? de Paris, France - Daniel De Carvalho, Innopolis University, Russia - Andrej Dudenhefner, Saarland University, Germany - Silvia Ghilezan, University of Novi Sad, Serbia - Giulio Guerrieri, University of Bath, UK - Ugo de' Liguoro, Universit? di Torino, Italy (chair) - Jeremy Siek, Indiana University Bloomington, USA (co-chair) Organizers: Ugo de' Liguoro, Universit? di Torino, Italy Riccardo Treglia, Universit? di Torino, Italy (riccardo.treglia at unito.it) Steering Committee - Mariangiola Dezani-Ciancaglini, Universit? di Torino, Italy - Jakob Rehof, TU University of Dortmund, Germany - Joe Wells, Heriot-Watt University, Scotland -------------- next part -------------- An HTML attachment was scrubbed... URL: From ornela.dardha at gmail.com Tue Apr 20 09:03:22 2021 From: ornela.dardha at gmail.com (Ornela Dardha) Date: Tue, 20 Apr 2021 14:03:22 +0100 Subject: [TYPES/announce] VEST'21 Workshop: Second Call for Talks (Deadline Approaching) Message-ID: ********************************************************************* VEST 2021: 2nd Workshop on Verification of Session Types Online on July 12, 2021, co-located with ICALP 2021 https://sites.google.com/view/vest21/home Submission: Monday, 3rd May 2021 Call for Talks ********************************************************************* * Presentation The goal of this workshop is to bring together researchers and build and strengthen a community working on verification of session types using various theorem provers such as Agda, Coq, Isabelle or any other. Session types are abstract representations of the sequences of operations that computational entities (such as channels or objects) must perform. Stateful entities offer services in a non-uniform way (one cannot pop from an empty stack); traditional type systems cannot guarantee that operations are only invoked when the entity is in the right state. Large-scale software systems rely on message-passing protocols: their correctness largely depends on sound protocol implementations. Session types can help in the specification of correct-by-construction systems, and in verifying that programs respect their intended protocols. Recent years have seen a steady stream of research on behavioural types: their foundations and their transfer to several programming languages. This has led to highly-cited papers in conferences such as POPL and journals such as TOPLAS. Research projects on behavioural types have advanced the theory and applications of behavioural types. Although the foundations of session types are now well established, and new works build on approaches that have become standard, there is still a lack of reusable libraries, namely machine-verified ones. As on one hand the basis of most works is common, and on the other hand the complexity of the formal systems is considerable and may lead to errors in the proofs of the soundness results, machine verifying the type systems proposed is vital. Libraries, or at least clear formalisations of common approaches, is crucial to avoid not only to repeat work but also to increase the confidence in the knowledge base. Moreover, as many of these systems have a goal to do static analysis to ensure some safety or liveness property, machine verification of these approaches leads to certified software for program analysis. The goal of the VEST workshop is to gather the researchers working on mechanisations of behavioural types using various theorem provers, such as Agda, Coq, Isabelle or any other. The workshop will be a platform to present both the now well-established efforts and the ongoing works the community has put on verification. The workshop will also be a forum to discuss strengths and weaknesses of existing approaches, potential obstacles and to foster collaboration. * Types of Contributions We request two types of research contributions. Type 1: Short presentations (1 page) of work published elsewhere; Type 2: Presentations (2-5 pages) of ongoing original work. Submissions of Type 1 will consist of 1 page papers presenting the work, the publication venue and the significance of the results; the PC will select the submissions with a ranking system. Submissions of Type 2 will consist of 2 - 5 page papers submitted to a light reviewing process. There will be no proceedings of VEST'21, but rather the aim is to strengthen and further expand our community. * Important Dates AoE (UTC-12h) Submission: Monday, 3rd May 2021 Notification: Monday, 14th June 2021 Final Version: Monday, 5th July 2021 Workshop: Monday, 12th July 2021 * Submission Link: https://easychair.org/conferences/?conf= vest21 * Invited Speakers: - Jesper Bengtson (IT University of Copenhagen, Denmark) - Andreia Mordido (University of Lisbon, Portugal) *Tutorial, jointly delivered by: - David Castro-Perez (University of Kent, UK) - Francisco Ferreira-Ruiz (Imperial College, UK) - Lorenzo Gheri (Imperial College, UK) * Program Committee: - Robert Atkey, University of Strathclyde, UK - Laura Bocchi, University of Kent, UK - Ornela Dardha, University of Glasgow, UK (Co-chair) - Cinzia Di Giusto, Universit? C?te d'Azur, CNRS, I3S, France - Wen Kokke, The University of Edinburgh, UK - Robbert Krebbers, Radboud University Nijmegen, Netherlands - Luca Padovani , Universit? di Torino, Italy - Kirstin Peters, TU Darmstadt, Germany - Ant?nio Ravara, NOVA University of Lisbon, Portugal (Co-chair) - Ivan Scagnetto, University of Udine, Italy - Peter Thiemann, Universit?t Freiburg, Germany -------------- next part -------------- An HTML attachment was scrubbed... URL: From sey19 at uclive.ac.nz Wed Apr 21 07:25:01 2021 From: sey19 at uclive.ac.nz (Simon Yusuf-Enoch) Date: Wed, 21 Apr 2021 11:25:01 +0000 Subject: [TYPES/announce] CFP: PRDC 2021 -The 26th Pacific Rim International Symposium on Dependable Computing Message-ID: -- [Apologies if you receive multiple copies of this email.] -- ********************************************************************** CALL FOR PAPERS - PRDC 2021 The 26th Pacific Rim International Symposium on Dependable Computing Virtual Conference 1 - 4 December, 2021 Face-to-face in Perth, Australia Paper Submission Deadline: 18 July 2021 http://prdc.dependability.org/PRDC2021/ ********************************************************************** PRDC 2021 is the twenty-sixth event in the series of symposia started in 1989 that are devoted to dependable and fault-tolerant computing. PRDC is recognized as the main event in the Pacific area that covers many dimensions of dependability and fault tolerance, encompassing fundamental theoretical approaches, practical experimental projects, and commercial components and systems. As applications of computing systems have permeated into all aspects of daily life, the dependabil- ity of computing systems has become increasingly critical. This sympo- sium provides a forum for countries around the Pacific Rim and other areas of the world to exchange ideas for improving the dependability of computing systems. Topics of interest include (but are not limited to): -Software and hardware reliability, testing, verification, and validation -Dependability measurement, modeling, evaluation, and tools -Self-healing, self-protecting, and fault-tolerant systems -Software aging and rejuvenation -Safety-critical and mixed-criticality systems and software -Architecture and system design for dependability -Fault-tolerant algorithms and protocols -Dependability and security in web and mobile applications -Cloud computing resiliency, security and privacy -(Industrial) Internet of things dependability, security and privacy -Dependability issues in computer networks and communications -Dependability issues in high performance computing -Dependability issues in real-time systems -Dependability issues in storage and databases systems -Dependability issues in cyber-physical systems and Industry 4.0 -Dependability issues in socio-technical systems -Dependability and security in AI and machine learning systems -Blockchain and smart contracts ---------------------------------------------------------------------- Submission and Publication Information Manuscripts should be submitted in the following two categories: Regular Papers and Practical Experience Reports. Regular Papers should describe original research (not submitted or published elsewhere) and be not more than 10 pages using IEEE Computer Society conference format. Practical Experience Reports (max 6 pages using IEEE format guidelines) should describe an experience or a case study, such as the design and deployment of a system or actual failure and recovery field data. All submissions must be made electronically (in PDF format) on the submission website: https://www.easychair.org/conferences/?conf=prdc2021 Please note that all submissions will undergo a double-blind review. Please ensure that you have removed any references that could lead to identifying the authors of the paper. Failure to do so may result in rejection of the paper regardless of the paper contributions. Papers will be reviewed internationally and selected based on their original- ity, significance, relevance, and clarity of presentation. All accepted papers will be published by IEEE Computer Society Press (EI Indexed). One outstanding paper will be selected to receive the Best Paper Award, and one outstanding paper first authored by a stude- nt will receive the Best Student Paper Award. ---------------------------------------------------------------------- Important Dates Paper Submission Deadline : 18 July 2021 Notification of Acceptance : 22 August 2021 ---------------------------------------------------------------------- Organizing Committee General Chair: Jin B. Hong, University of Western Australia, Australia Program Co-Chair: Jin-Hee Cho, Virginia Tech, USA Marcello Cinque, Federico II University of Naples, Italy Local Arrangement Co-Chair: Naveed Akhtar, University of Western Australia, Australia Zeyi Wen, University of Western Australia, Australia Publicity Co-Chair: Gregory Blanc, Telecom SudParis, France Simon Yusuf-Enoch, University of Queensland, Australia Finance Chair: Susan Marie, University of Westner Australia, Australia Steering Committee Yennun Huang, Academia Sinica (Chair) Leon Alkalai, California Institute of Technology Takashi Nanya, University of Tokyo Nobuyasu Kanekawa, Hitachi Research Lab Jin Song Dong, National University of Singapore Karthik Pattabiraman, University of British Columbia Gernot Heiser, University of New South Wales Sy-Yen Kuo, National Taiwan University Michael Lyu, Chinese University of Hong Kong Zhi Jin, Peking University DongSeong Kim, University of Queensland ---------------------------------------------------------------------- Sponsors IEEE Computer Society University of Western Australia Business Events Perth Tourism Western Australia -------------- next part -------------- An HTML attachment was scrubbed... URL: From dan at ghica.net Thu Apr 22 12:27:53 2021 From: dan at ghica.net (Dan Ghica) Date: Thu, 22 Apr 2021 17:27:53 +0100 Subject: [TYPES/announce] Job advert: RUST researcher Message-ID: The Programming Languages Lab, Huawei Research Centre, Edinburgh, UK is currently advertising a full-time Programming Languages Researcher/Senior Researcher position. We are looking especially for someone with RUST experience at the level of theory, compilation, or verification. PHD (recent or imminent) and a research track record are essential. Huawei is a founding member of the recently formed RUST foundation. For further information please email me or visit this site: https://blogs.ed.ac.uk/he-lab/2021/04/22/hiring-programming-languages-researcher-senior-researcher/ Best wishes, Dan -- Prof. Dan R. Ghica Huawei Programming Languages Lab Edinburgh, Director University of Birmingham School of Computer Science -------------- next part -------------- An HTML attachment was scrubbed... URL: From harley.eades at gmail.com Thu Apr 22 12:57:05 2021 From: harley.eades at gmail.com (Harley D. Eades III) Date: Thu, 22 Apr 2021 12:57:05 -0400 Subject: [TYPES/announce] Seminar Talk on Higher-Order Crypto Message-ID: Hi, everyone. On Friday, April 23, 2021 between 1pm and 2pm EDT (6pm - 7pm UTC), Ugo Dal Lago will be giving a presentation as part of the CS Colloquium Series at Augusta University. Presentation details can be found here: https://the-au-forml-lab.github.io/colloquium_talks/DalLago.html Ugo will be discussing their recent work on Higher-Order Cryptography. It is going to be super interesting. These talks are open to the general public via Zoom and Youtube. I'll be live streaming it on Youtube. If you are interested in attending the Zoom meeting please RSVP with me before the talk. Questions will be taken from those on Zoom and YouTube. If you care to watch via YouTube, please use the following link: https://youtu.be/FyFT3ZariSA Feel free to share this message with everyone you know. I hope all of you, your family and friends are doing well! Very best, Harley -------------- next part -------------- An HTML attachment was scrubbed... URL: From loris at cs.wisc.edu Thu Apr 22 13:02:08 2021 From: loris at cs.wisc.edu (Loris D'Antoni) Date: Thu, 22 Apr 2021 12:02:08 -0500 Subject: [TYPES/announce] POPL22 (Philadelphia, USA) - Call for Submissions Message-ID: POPL 2022 Call for Participation (https://popl22.sigplan.org/) Please forward the following assignment to the relevant mailing lists and groups. Important Dates: Thu 8 Jul 2021: Submission deadline Sat 4 Sep 2021: Start of rebuttal period Wed 8 Sep 2021: End of rebuttal period Wed 29 Sep 2021: Notification Sun 16 - Fri 21 Jan 2022: Conference Location: Westin Hotel, Philadelphia, USA General chair: Rajeev Alur PC chair: Hongseok Yang PC members: https://popl22.sigplan.org/committee/POPL-2022-popl-research-papers-program-committee # Scope The annual Symposium on Principles of Programming Languages is a forum for the discussion of all aspects of programming languages and programming systems. Both theoretical and experimental papers are welcome, on topics ranging from formal frameworks to experience reports. We seek submissions that make principled, enduring contributions to the theory, design, understanding, implementation or application of programming languages. The symposium is sponsored by ACM SIGPLAN, in cooperation with ACM SIGACT and ACM SIGLOG. # Evaluation criteria The Program Committee will evaluate the technical contribution of each submission as well as its accessibility to both experts and the general POPL audience. All papers will be judged on significance, originality, relevance, correctness, and clarity. Each paper should explain its contributions in both general and technical terms, identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. Authors should strive to make their papers understandable to a broad audience. Advice on writing technical papers can be found on the SIGPLAN author information page. # Evaluation process Authors will have a multi-day period to respond to reviews, as indicated in the Important Dates table. Responses are optional. They must not be overly long and should not try to introduce new technical results. Reviewers will write a short reaction to these author responses. Following the precedent set by POPL 2018, the program committee will discuss papers entirely electronically rather than at a physical programming committee meeting. This will avoid the time, cost and environmental impact of transporting an increasingly large committee to one point on the globe. Unlike in recent years, there will be no formal External Review Committee, though experts outside the committee will be consulted when their expertise is needed. Reviews will be accompanied by a short summary of the reasons behind the committee?s decision. It is the goal of the program committee to make it clear to the authors why each paper was or was not accepted. # Artifact Evaluation Authors of accepted papers will be invited to formally submit supporting materials to the Artifact Evaluation process. Artifact Evaluation is run by a separate committee whose task is to assess how the artifacts support the work described in the papers. This submission is voluntary and will not influence the final decision regarding the papers. Papers that go through the Artifact Evaluation process successfully will receive a seal of approval printed on the papers themselves. Authors of accepted papers are encouraged to make these materials publicly available upon publication of the proceedings, by including them as ?source materials? in the ACM Digital Library. # PACMPL and Copyright All papers accepted to POPL 2020 will be published as part of the new ACM journal Proceedings of the ACM on Programming Languages (PACMPL). To conform with ACM requirements for journal publication, all POPL papers will be conditionally accepted; authors will be required to submit a short description of the changes made to the final version of the paper, including how the changes address any requirements imposed by the program committee. That the changes are sufficient will be confirmed by the original reviewers prior to acceptance to POPL. Authors of conditionally accepted papers must submit a satisfactory revision to the program committee by the requested deadline or risk rejection. # Publication and Presentation Papers may not be presented at the conference if they have not been published by ACM under one of the allowed copyright options. All papers will be archived by the ACM Digital Library. Authors will have the option of including supplementary material with their paper. The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work. Authors of accepted papers are required to give a short talk (roughly 25 minutes long) at the conference, according to the conference schedule. # Distinguished Paper Awards At most 10% of the accepted papers of POPL 2022 will be designated as Distinguished Papers. This award highlights papers that the POPL program committee thinks should be read by a broad audience due to their relevance, originality, significance and clarity. The selection of the distinguished papers will be made based on the final version of the paper and through a second review process. -------------- next part -------------- An HTML attachment was scrubbed... URL: From giselle.mnr at gmail.com Fri Apr 23 06:27:13 2021 From: giselle.mnr at gmail.com (Giselle Reis) Date: Fri, 23 Apr 2021 13:27:13 +0300 Subject: [TYPES/announce] 7th International Workshop on Proof eXchange for Theorem Proving (PxTP) - DEADLINE EXTENSION: May 5 Message-ID: Call for Papers, PxTP 2021 The Seventh International Workshop on Proof eXchange for Theorem Proving (PxTP) https://pxtp.gitlab.io/2021 21 July 2021, online associated with the CADE-28 conference ## Background The PxTP workshop brings together researchers working on various aspects of communication, integration, and cooperation between reasoning systems and formalisms. The progress in computer-aided reasoning, both automatic and interactive, during the past decades, has made it possible to build deduction tools that are increasingly more applicable to a wider range of problems and are able to tackle larger problems progressively faster. In recent years, cooperation of such tools in larger verification environments has demonstrated the potential to reduce the amount of manual intervention. Examples include the Sledgehammer tool providing an interface between Isabelle and (untrusted) automated provers, and collaboration of the HOL Light and Isabelle systems in the formal proof of the Kepler conjecture. Cooperation between reasoning systems relies on availability of theoretical formalisms and practical tools for exchanging problems, proofs, and models. The PxTP workshop strives to encourage such cooperation by inviting contributions on suitable integration, translation, and communication methods, standards, protocols, and programming interfaces. The workshop welcomes developers of automated and interactive theorem proving tools, developers of combined systems, developers and users of translation tools and interfaces, and producers of standards and protocols. We are interested both in success stories and descriptions of current bottlenecks and proposals for improvement. ## Topics Topics of interest for this workshop include all aspects of cooperation between reasoning tools, whether automatic or interactive. More specifically, some suggested topics are: * applications that integrate reasoning tools (ideally with certification of the result); * interoperability of reasoning systems; * translations between logics, proof systems, models; * distribution of proof obligations among heterogeneous reasoning tools; * algorithms and tools for checking and importing (replaying, reconstructing) proofs; * proposed formats for expressing problems and solutions for different classes of logic solvers (SAT, SMT, QBF, first-order logic, higher-order logic, typed logic, rewriting, etc.); * meta-languages, logical frameworks, communication methods, standards, protocols, and APIs related to problems, proofs, and models; * comparison, refactoring, transformation, migration, compression and optimization of proofs; * data structures and algorithms for improved proof production in solvers (e.g., efficient proof representations); * (universal) libraries, corpora and benchmarks of proofs and theories; * alignment of diverse logics, concepts and theories across systems and libraries; * engineering aspects of proofs (e.g., granularity, flexiformality, persistence over time); * proof certificates; * proof checking; * mining of (mathematical) information from proofs (e.g., quantifier instantiations, unsat cores, interpolants, ...); * reverse engineering and understanding of formal proofs; * universality of proofs (i.e. interoperability of proofs between different proof calculi); * origins and kinds of proofs (e.g., (in)formal, automatically generated, interactive, ...) * Hilbert's 24th Problem (i.e. what makes a proof better than another?); * social aspects (e.g., community-wide initiatives related to proofs, cooperation between communities, the future of (formal) proofs); * applications relying on importing proofs from automatic theorem provers, such as certified static analysis, proof-carrying code, or certified compilation; * application-oriented proof theory; * practical experiences, case studies, feasibility studies. ## Submissions Researchers interested in participating are invited to submit either an extended abstract (up to 8 pages) or a regular paper (up to 15 pages). Submissions will be refereed by the program committee, which will select a balanced program of high-quality contributions. Short submissions that could stimulate fruitful discussion at the workshop are particularly welcome. We expect that one author of every accepted paper will present their work at the workshop. Submitted papers should describe previously unpublished work, and must be prepared using the LaTeX EPTCS class (http://style.eptcs.org). Papers will be submitted via EasyChair, at the PxTP'2021 workshop page (https://easychair.org/conferences/?conf=pxtp-7). Accepted regular papers will appear in an EPTCS volume. ## Important Dates * Abstract submission: *April 28*, 2021 * Paper submission: *May 5*, 2021 * Notification: May 26, 2021 * Camera ready versions due: June 16, 2021 * Workshop: July 11, 2021 (online) ## Invited Speakers TBA ## Program Committee * Haniel Barbosa (Universidade Federal de Minas Gerais (UFMG), Belo Horizonte, Brazil) * Denis Cousineau (Mitsubishi, France) * Stefania Dumbrava (ENSIIE, France) * Katalin Fazekas (TU Wien, Austria) * Mathias Fleury (Johannes Kepler University Linz, Austria), co-chair * Predrag Jani?i? (University of Belgrade, Serbia) * Chantal Keller (LRI, Universit? Paris-Saclay, France), co-chair * Aina Niemetz (Stanford University, USA) * Jens Otten (University of Oslo, Norway) * Giselle Reis (CMU-Qatar, Qatar) * Geoff Sutcliffe (University of Miami, USA) * Fran?ois Thir? (Nomadic Labs, France) * Sophie Tourret (Max-Planck-Institut f?r Informatik, Germany) * Josef Urban (Czech Institute of Informatics, Czech Republic) ## Previous PxTP Editions * PxTP 2019 (http://pxtp.gforge.inria.fr/2019), affiliated to CADE-27 * PxTP 2017 (https://pxtp.github.io/2017), affiliated to Tableaux 2017, FroCoS 2017 and ITP 2017 * PxTP 2015 (http://pxtp15.lri.fr), affiliated to CADE-25 * PxTP 2013 (http://www.cs.ru.nl/pxtp13), affiliated to CADE-24 * PxTP 2012 (http://pxtp2012.inria.fr), affiliated to IJCAR 2012 * PxTP 2011 (http://pxtp2011.loria.fr), affiliated to CADE-23 From genaim at gmail.com Sun Apr 25 09:19:41 2021 From: genaim at gmail.com (Samir Genaim) Date: Sun, 25 Apr 2021 15:19:41 +0200 Subject: [TYPES/announce] WST 2021: deadline extension (9 May, 2021) Message-ID: ====================================================================== WST 2021 - Call for Papers 17th International Workshop on Termination http://costa.fdi.ucm.es/wst2021 July 16, 2021, Pittsburgh, PA, United States Co-located with CADE-28 **** The workshop will be virtual **** ====================================================================== *[The submission deadline was extended to May 9, 2021].* The Workshop on Termination (WST) traditionally brings together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop also provides a ground for cross-fertilization of ideas from the different communities interested in termination (e.g., working on computational mechanisms, programming languages, software engineering, constraint solving, etc.). The friendly atmosphere enables fruitful exchanges leading to joint research and subsequent publications. IMPORTANT DATES: * * submission deadline: May 9, 2021* (extended) * notification: June 6, 2021 * final version due: June 20, 2021 * workshop: July 16, 2021 INVITED SPEAKERS: TBA TOPICS: The 17th International Workshop on Termination welcomes contributions on all aspects of termination. In particular, papers investigating applications of termination (for example in complexity analysis, program analysis and transformation, theorem proving, program correctness, modeling computational systems, etc.) are very welcome. Topics of interest include (but are not limited to): * abstraction methods in termination analysis * certification of termination and complexity proofs * challenging termination problems * comparison and classification of termination methods * complexity analysis in any domain * implementation of termination methods * non-termination analysis and loop detection * normalization and infinitary normalization * operational termination of logic-based systems * ordinal notation and subrecursive hierarchies * SAT, SMT, and constraint solving for (non-)termination analysis * scalability and modularity of termination methods * termination analysis in any domain (lambda calculus, declarative programming, rewriting, transition systems, etc.) * well-founded relations and well-quasi-orders SUBMISSION GUIDELINES: Submissions are short papers/extended abstracts which should not exceed 5 pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and provides additional feedback for each submission. The accepted papers will be made available electronically before the workshop. Papers should be submitted electronically via the submission page: https://easychair.org/conferences/?conf=wst2021 Please, use LaTeX and the LIPIcs style file http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz to prepare your submission. PROGRAM COMMITTEE: * Martin Avanzini - INRIA Sophia, Antipolis * Carsten Fuhs - Birkbeck, U. of London * Samir Genaim (chair) - U. Complutense de Madrid * J?rgen Giesl - RWTH Aachen * Matthias Heizmann - U. of Freiburg * Cynthia Kop - Radboud U. Nijmegen * Salvador Lucas - U. Polit?cnica de Val?ncia * ?tienne Payet - U. de La R?union * Albert Rubio - U. Complutense de Madrid * Ren? Thiemann - U. of Innsbruck -------------- next part -------------- An HTML attachment was scrubbed... URL: From ksk at riec.tohoku.ac.jp Sun Apr 25 22:25:18 2021 From: ksk at riec.tohoku.ac.jp (Keisuke Nakano) Date: Mon, 26 Apr 2021 11:25:18 +0900 Subject: [TYPES/announce] WPTE 2021 (FINAL Call For Papers) Message-ID: <81C78620-838F-4D94-978D-200838AB4D2A@riec.tohoku.ac.jp> --------------------------------------------------------------------------- WPTE 2021: 8th International Workshop on Rewriting Techniques for Program Transformations and Evaluation Held online on July 18, 2021 --------------------------------------------------------------------------- Conference Web site: https://www.ipl.riec.tohoku.ac.jp/wpte2021/ Submission link: https://easychair.org/conferences/?conf=wpte2021 Submission deadline: May 10, 2021 --------------------------------------------------------------------------- The aim of WPTE is to bring together the researchers working on program transformations, evaluation, and operationally based programming language semantics, using rewriting methods, in order to share the techniques and recent developments and to exchange ideas to encourage further activation of research in this area. The 8th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2021) is affiliated with FSCD 2021, https://fscd2021.dc.uba.ar/ List of Topics --------------------------------------------------------------------------- * Correctness of program transformations, optimizations and translations. * Program transformations for proving termination, confluence, and other properties. * Correctness of evaluation strategies. * Operational semantics of programs, operationally-based program equivalences such as contextual equivalences and bisimulations. * Cost-models for arguing about the optimizing power of transformations and the costs of evaluation. * Program transformations for verification and theorem proving purposes. * Translation, simulation, equivalence of programs with different formalisms, and evaluation strategies. * Program transformations for applying rewriting techniques to programs in specific programming languages. * Program transformations for program inversions and program synthesis. * Program transformation and evaluation for Haskell and rewriting. Submission Guidelines --------------------------------------------------------------------------- For the paper submission deadline an extended abstract of at most 10 pages is required to be submitted. The extended abstract may present original work or also work in progress. Based on the submissions the program committee will select the presentations for the workshop. All selected contributions will be included in the informal proceedings distributed to the workshop participants. One author of each accepted extended abstract is expected to present it at the workshop. Submissions must be prepared in LaTeX using the EPTCS macro package. All submissions will be electronic via https://easychair.org/conferences/?conf=wpte2021. Formal Proceedings --------------------------------------------------------------------------- WPTE post-proceedings of selected papers will be published in a JLAMP special issue. For this, full papers must be submitted until the post-proceedings deadline. The authors of selected contributions will have the opportunity (but no obligation) to submit a full paper for the formal post-proceedings. These must represent original work and should not be submitted to another conference at the same time. The submission deadline for these post-proceedings will be after the workshop in September 2021. There will be a second round of reviewing for selecting papers to be published in the formal proceedings. Important Dates --------------------------------------------------------------------------- Submission of extended abstracts: May 10, 2021 (AoE) Notification of acceptance: May 31, 2021 Final version for proceedings deadline: June 13, 2021 Workshop: July 18, 2021 Submission to post-proceedings: September 2021 Program Committees --------------------------------------------------------------------------- Keisuke Nakano, Tohoku University, Japan (Chair) Adrian Riesco, Universidad Complutense de Madrid, Spain. (co-Chair) ?tefan Ciob?c?, Universitatea Alexandru Ioan Cuza din Ia?i, Romania Makoto Hamana, Gunma University, Japan Akimasa Morihata, the University of Tokyo, Japan Shin-Cheng Mu, Academia Sinica, Taiwan Koko Muroya, Kyoto University, Japan David Sabel, LMU, Germany Julia Sapi?a, Polytechnic University of Valencia, Spain Janis Voigtl?nder, University of Duisburg-Essen, Germany Contact --------------------------------------------------------------------------- All questions about submissions should be emailed to wpte2021 (at) easychair.org From elaine.pimentel at gmail.com Mon Apr 26 06:47:45 2021 From: elaine.pimentel at gmail.com (Elaine Pimentel) Date: Mon, 26 Apr 2021 07:47:45 -0300 Subject: [TYPES/announce] TLLA 2021 - 2nd cfp Message-ID: ============================================================== Call for Papers TLLA 2021 5th International Workshop on Trends in Linear Logic and Applications Rome, 27-28 June 2021 Affiliated with ACM/IEEE LICS https://lipn.univ-paris13.fr/TLLA/2021/ ============================================================== Linear Logic is not only a proof theoretical tool to analyze or control the use of resources in logic and computation. It is also a corpus of tools, approaches, and methodologies (proof nets, exponential decomposition, geometry of interaction, coherent spaces, relational models, etc.) that, even if developed for studying Linear Logic syntax and semantics, have been applied in several other fields (analysis of lambda-calculus computations, game semantics, computational complexity, program verification, etc.). The TLLA international workshop aims at bringing together researchers working on Linear Logic or applying it or its tools. The main goal is to present and discuss trends in the research on Linear Logic and its applications by means of tutorials, invited talks, open discussions, and contributed talks. The purpose is to gather researchers interested in the connections between Linear Logic and various topics such as * theory of programming languages * implicit computational complexity * parallelism and concurrency * games and languages * proof theory * philosophy * categories and algebra * possible connections with combinatorics * linguistics * functional analysis and operator algebras ---------------------------------------------------------------------- ** Submission Guidelines ---------------------------------------------------------------------- Contributions are not restricted to talks presenting an original results, but open to tutorials, open discussions, and position papers. For this reason, we strongly encourage contributions presenting work in progress, open questions, and research projects. Contributions presenting the application of linear logic results, techniques, or tools to other fields, or vice versa, are most welcome. To propose a contributed talk submit a short abstract whose length is between 2 and 5 pages on https://easychair.org/conferences/?conf=tlla2021 ---------------------------------------------------------------------- ** Important dates ---------------------------------------------------------------------- * Submission deadline: 2 May 2021 * Notification to authors: 14 May 2021 * Final versions due: 24 May 2021 * Workshop date: 27-28 June 2021 ---------------------------------------------------------------------- ** Publication ---------------------------------------------------------------------- The abstracts of the contributed and invited talks will be published on the site of the conference. Possible other formats will be discussed at the workshop. ---------------------------------------------------------------------- ** Tutorials ---------------------------------------------------------------------- TBA ---------------------------------------------------------------------- ** Invited Speakers ---------------------------------------------------------------------- TBA ---------------------------------------------------------------------- ** Program Committee ---------------------------------------------------------------------- * Claudia Faggian, CNRS - University Paris Diderot, France * Giulio Guerrieri, University of Bath, UK * Naohiko Hoshino, Sojo University, Japan * Sonia Marin, University College London, UK * Elaine Pimentel, Federal University of Rio Grande do Norte, Brazil (co-chair) * Paolo Pistone, Universit? di Bologna, Italy * Myriam Quatrini, Universit? de la M?diterran?e * Christian Retor?, Universit? de Montpellier, France (co-chair) * Thomas Seiller, CNRS - University Sorbonne Paris Nord, France * Lutz Strassburger, Inria Saclay, France ---------------------------------------------------------------------- ** Organization Committee ---------------------------------------------------------------------- * Thomas Ehrhard, CNRS - University Paris Diderot, France * Stefano Guerrini, CNRS - University Sorbonne Paris Nord, France * Lorenzo Tortora de Falco, University Roma Tre, Italy ---------------------------------------------------------------------- ** Contact ---------------------------------------------------------------------- All questions about submissions should be emailed to the PC chairs at elaine.pimentel at gmail.com -------------- next part -------------- An HTML attachment was scrubbed... URL: From daniel.marsden at cs.ox.ac.uk Mon Apr 26 09:22:13 2021 From: daniel.marsden at cs.ox.ac.uk (Daniel Marsden) Date: Mon, 26 Apr 2021 13:22:13 +0000 Subject: [TYPES/announce] Call for Contributions: Structure meets Power Workshop 2021 Message-ID: **************************************** * STRUCTURE MEETS POWER * * (a LICS workshop) * * * * Call for Contributions * **************************************** Workshop dates: 27-28 June 2021 (online) https://www.cst.cam.ac.uk/conference/structure-meets-power-2021 Scope ----- There is a remarkable divide in the field of logic in Computer Science, between two distinct strands: one focusing on semantics and compositionality (?Structure?), the other on expressiveness and complexity (?Power?). These two fundamental aspects of our field are studied using almost disjoint technical languages and methods, by almost disjoint research communities. We believe that bridging this divide is a major issue in Computer Science, and may hold the key to fundamental advances in the field. The aim this workshop is to attract investigators at the boundary of the two strands, and those on either side of the divide interested on establishing new connections. This workshop is a part of LICS 2021 workshops series. The even will be held entirely online. Important dates --------------- Abstract submission: 20 May 2021 Author notification: 5 June 2021 Registration: 20 June 2021 Invited speakers ---------------- * Mikolaj Bojanczyk (University of Warsaw) * Laura Mancinska (University of Copenhagen) * Daniela Petrisan (Universite Paris Diderot) Submissions ----------- Those wishing to speak at the workshop are invited to submit an Extended Abstract of up to three pages (including references) describing the content of the contributed presentation. Submissions should only have a single author -- the speaker. The co-authors are required to be clearly indicated in the abstract and later also in the slides. For submissions please use the EasyChair conference system: https://easychair.org/conferences/?conf=smp2021 We encourage talks of all levels of progress, including novel contributions, already published results, work in progress, as well as survey-type contributions. However, original contributions might be considered for a subsequent special issue, consisting of journal versions of selected extended abstracts. Depending on the number of submissions, contributed talks will be 20-30 minutes long. Registration ------------ Registration is free of charge and is mandatory in order to access the workshop. Closer to the date you will receive a password and link to access the online meeting rooms. Those who register early will receive notifications about upcoming deadlines. The registration form can be found here: https://www.cst.cam.ac.uk/conference/structure-meets-power-2021/registration Organising and Programme Committee: ----------------------------------- * Samson Abramsky * Anuj Dawar * Tomas Jakl * Dan Marsden From bruno.bernardo at tutanota.com Tue Apr 27 03:21:39 2021 From: bruno.bernardo at tutanota.com (Bruno Bernardo) Date: Tue, 27 Apr 2021 09:21:39 +0200 (CEST) Subject: [TYPES/announce] FMBC 2021 - 3rd Call for Papers (Deadline extensions) Message-ID: [ Please distribute, apologies for multiple postings. ] ======================================================================== 3rd International Workshop on Formal Methods for Blockchains (FMBC) - Third Call https://fmbc.gitlab.io/2021 July 18 or 19 (TBA), 2021, *online* Co-located with the 33nd International Conference on Computer-Aided Verification (CAV 2021) http://i-cav.org/2021/ ------------------------------------------------------------- IMPORTANT DATES -------------------------------- Abstract submission: May 6, 2021 (extended) Paper submission: May 13, 2021 (extended) Notification: June 24, 2021 (extended) Camera-ready: July 8, 2021 Workshop: July 18 or 19 (TBA), 2021 Deadlines are Anywhere on Earth: https://en.wikipedia.org/wiki/Anywhere_on_Earth -------------------------------- -------------------------------- TOPICS OF INTEREST -------------------------------- Blockchains are decentralized transactional ledgers that rely on cryptographic hash functions for guaranteeing the integrity of the stored data. Participants on the network reach agreement on what valid transactions are through consensus algorithms. Blockchains may also provide support for Smart Contracts. Smart Contracts are scripts of an ad-hoc programming language that are stored in the Blockchain and that run on the network. They can interact with the ledger?s data and update its state. These scripts can express the logic of possibly complex contracts between users of the Blockchain. Thus, Smart Contracts can facilitate the economic activity of Blockchain participants. With the emergence and increasing popularity of cryptocurrencies such as Bitcoin and Ethereum, it is now of utmost importance to have strong guarantees of the behavior of Blockchain software. These guarantees can be brought by using Formal Methods. Indeed, Blockchain software encompasses many topics of computer science where using Formal Methods techniques and tools are relevant: consensus algorithms to ensure the liveness and the security of the data on the chain, programming languages specifically designed to write Smart Contracts, cryptographic protocols, such as zero-knowledge proofs, used to ensure privacy, etc. This workshop is a forum to identify theoretical and practical approaches of formal methods for Blockchain technology. Topics include, but are not limited to: * Formal models of Blockchain applications or concepts * Formal methods for consensus protocols * Formal methods for Blockchain-specific cryptographic primitives or protocols * Design and implementation of Smart Contract languages * Verification of Smart Contracts -------------------------------- -------------------------------- SUBMISSION -------------------------------- Submit original manuscripts (not published or considered elsewhere) with a page limit of 12 pages for full papers and 6 pages for short papers (excluding bibliography and short appendix of up to 5 additional pages). Alternatively you may also submit an extended abstract of up to 3 pages (including bibliography) summarizing your ongoing work in the area of formal methods and blockchain. Authors of selected extended-abstracts are invited to give a short lightning talk. Submission link: https://easychair.org/conferences/?conf=fmbc2021 Authors are encouraged to use LaTeX and prepare their submissions according to the instructions and styling guides for OASIcs provided by Dagstuhl. Instructions for authors: https://submission.dagstuhl.de/documentation/authors#oasics At least one author of an accepted paper is expected to present the paper at the workshop as a registered participant. -------------------------------- -------------------------------- PROCEEDINGS -------------------------------- All submissions will be peer-reviewed by at least three members of the program committee for quality and relevance. Accepted regular papers (full and short papers) will be included in the workshop proceedings, published as a volume of the OpenAccess Series in Informatics (OASIcs) by Dagstuhl. -------------------------------- -------------------------------- INVITED SPEAKER -------------------------------- David Dill, Lead Researcher, Blockchain, Novi/Facebook, USA https://research.fb.com/people/dill-david/ -------------------------------- -------------------------------- PROGRAM COMMITTEE -------------------------------- PC CO-CHAIRS * Bruno Bernardo (Nomadic Labs, France) (bruno at nomadic-labs.com) * Diego Marmsoler (University of Exeter, UK) (D.Marmsoler at exeter.ac.uk) PC MEMBERS * Wolfgang Ahrendt (Chalmers University of Technology, Sweden) * Lacramioara Astefanoei (Nomadic Labs, France) * Massimo Bartoletti (University of Cagliari, Italy) * Joachim Breitner (Dfinity Foundation, Germany) * Achim Brucker (University of Exeter, UK) * Zaynah Dargaye (Nomadic Labs, France) * J?r?mie Decouchant (TU Delft, Netherlands) * Dana Drachsler Cohen (Technion, Israel) * Ansgar Fehnker (University of Twente, Netherlands) * Maurice Herlihy (Brown University, USA) * Lars Hupel (INNOQ, Germany) * Florian Kammueller (Middlesex University London, UK) * Igor Konnov (Informal Systems, Austria) * Andreas Lochbihler (Digital Asset, Switzerland) * Sim?o Melo de Sousa (Universidade da Beira Interior, Portugal) * Karl Palmskog (KTH, Sweden) * Maria Potop-Butucaru (Sorbonne Universit?, France) * Andreas Rossberg (Dfinity Foundation, Germany) * Albert Rubio (Complutense University of Madrid, Spain) * C?sar Sanchez (Imdea, Spain) * Clara Schneidewind (TU Wien, Austria) * Ilya Sergey (Yale-NUS College/NUS, Singapore) * Mark Staples (CSIRO Data61, Australia) * Meng Sun (Peking University, China) * Simon Thompson (University of Kent, UK) * Josef Widder (Informal Systems, Austria) From ayala at unb.br Tue Apr 27 11:42:19 2021 From: ayala at unb.br (Mauricio Ayala-Rincon) Date: Tue, 27 Apr 2021 12:42:19 -0300 Subject: [TYPES/announce] LSFA 2021 - extended deadline - Affiliated to FSCD 2021 Message-ID: <9ce9017c-613e-9d71-025e-d73ec759258d@unb.br> [Extended deadline] ??????????????????//?????????????????? ??????? 16th Logical and Semantic Frameworks with Applications - LSFA 2021 ??????????????????????????? 23-24 July 2021 ?????????????????????? https://mat.unb.br/lsfa2021 ????????????? Affiliated to FSCD 2021, Buenos Aires, Argentina (Online) ???????????????????????????? Third Call For Papers [Extended deadline] ??????????????????//?????????????????? Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for the formal specification of systems and computational languages, supporting tool development and reasoning. The LSFA series' objective is to put together theoreticians and practitioners to promote new techniques and results, from the theoretical side, and feedback on the implementation and use of such techniques and results, from the practical side. See lsfa.cic.unb.br for more information. LSFA topics of interest include, but are not limited to: * Automated deduction * Applications of logical and semantic frameworks * Computational and logical properties of semantic frameworks * Formal semantics of languages and systems * Implementation of logical and semantic frameworks * Lambda and combinatory calculi * Logical aspects of computational complexity * Logical frameworks * Process calculi * Proof theory * Semantic frameworks * Specification languages and meta-languages * Type theory Submissions Contributions should be written in English and submitted in full paper (with a maximum of 16 pages) or short papers (with a maximum of 6 pages). They must be unpublished and not submitted simultaneously for publication elsewhere. The papers should be prepared in LaTeX using the EPTCS style. The submission should be in the form of a PDF file uploaded to Easychair: https://easychair.org/conferences/?conf=lsfa2021 The pre-proceedings, containing the reviewed extended abstracts, will be handed out at event registration. After the meeting, the authors will be invited to submit full versions of their works for the post-proceedings publication. At least one of the authors should register for the conference. Presentations should be in English. According to the submissions' quality, the chairs will promote the further publication of journal revised versions of the papers. Previous LSFA Special Issues have been published in journals such as The Logical J. of the IGPL, Theoretical Computer Science and Mathematical Structures in Computer Sciences (see the LSFA page http://lsfa.cic.unb.br). Important dates * Abstract: [Extended deadline] Sunday 2nd May * Submission: [Extended deadline] Sunday 9nd May * Notification: Friday 4th June * Preliminary proceedings version due: Monday 14th June * Submission for final proceedings: Sunday 17th October * Final version: Sunday 19th December Invited Speakers ? Alejandro D?az-Caro (ICC-UBA/CONICET, UNQ) ? Alexandra Silva (University College London) ? Giulio Guerrieri (University of Bath) Program Committee ? Mar?a Alpuente (Universitat Polit?cnica de Val?ncia) ? Sandra Alves (Universidade de Porto, Portugal) ? Takahito Aoto (Niigata University) ? Mauricio Ayala-Rinc?n (Universidade de Bras?lia) - Co-Chair ? Eduardo Bonelli (Stevens University) - Co-Chair ? Evelyne Contejean (LRI, CNRS, Univ Paris-Sud, Orsay) ? Valeria de Paiva (Samsung Research America and University of Birmingham) ? Marcelo Finger (Universidade de S?o Paulo) ? Yannick Forster (Saarland University) ? Lourdes del Carmen Gonz?lez Huesca (UNAM) ? Edward Hermann Haeusler (PUC-Rio, Brazil) ? Cynthia Kop (Radboud University) ? Temur Kutsia (RISC, Johannes Kepler University Linz) ? Hernan Melgratti (Universidad de Buenos Aires) ? Alexandre Miquel (Universidad de La Rep?blica) ? Barbara Morawska (Ahmedabad University) ? Mariano Moscato (National Institute of Aerospace) ? Cesar Mu?oz (NASA LaRC) ? Daniele Nantes-Sobrinho (U. de Bras?lia) ? Carlos Olarte (U. Federal do Rio Grande do Norte) ? Federico Olmedo (Universidad de Chile) ? Alberto Pardo (Universidad de la Rep?blica) ? Jorge A. P?rez (University of Groningen) ? Camilo Rocha (Pontificia Universidad Javeriana - Cali) ? Aleksy Schubert (University of Warsaw) ? Ren? Thiemann (University of Innsbruck) ? Renata Wassermann (Universidade de S?o Paulo) Organisers ?? Daniele Nantes (UnB, Brasil) ?? Cristian F. Sottile (UBA, Argentina) ??????????????????//?????????????????? -------------- next part -------------- A non-text attachment was scrubbed... Name: ayala.vcf Type: text/x-vcard Size: 4 bytes Desc: not available URL: From harley.eades at gmail.com Tue Apr 27 16:43:27 2021 From: harley.eades at gmail.com (Harley D. Eades III) Date: Tue, 27 Apr 2021 16:43:27 -0400 Subject: [TYPES/announce] A seminar talk on Logical Relations As Types Message-ID: Hi, everyone. On Friday, April 30, 2021 between 1pm and 2pm EDT (5pm - 6pm UTC), Jon Sterling will be giving a presentation as part of the CS Colloquium Series at Augusta University. Presentation details can be found here: https://the-au-forml-lab.github.io/colloquium_talks/Sterling.html Jon will be discussing his recent work on a new "synthetic way to understand and interact with logical relations." I'm super excited to learn more about this. These talks are open to the general public via Zoom and Youtube. I'll be live streaming it on Youtube. If you are interested in attending the Zoom meeting please RSVP with me before the talk. Questions will be taken from those on Zoom and YouTube. If you care to watch via YouTube, please use the following link: https://youtu.be/AEthjg2k718 Feel free to share this message with everyone you know. I hope all of you, your family and friends are doing well! Very best, Harley -------------- next part -------------- An HTML attachment was scrubbed... URL: From harley.eades at gmail.com Wed Apr 28 10:58:48 2021 From: harley.eades at gmail.com (Harley D. Eades III) Date: Wed, 28 Apr 2021 10:58:48 -0400 Subject: [TYPES/announce] PhD Student Opportunity in the Granule Project Message-ID: Dear Colleagues, Harley Eades of the Granule Project and Augusta University's ForML Lab is actively seeking applications for a PhD student starting Fall 2021. The successful applicant will be funded--including tuition, salary, and (international) conference travel--for the first three years of their appointment through a new NSF funded project: "Semantically and Practically Generalizing Graded Modal Types" A short overview of the main goals of this project is as follows: "We propose to investigate the theory and practice of graded modal types with the goal of combining and generalizing type-based software verification and data-usage tracking, thereby extending the verification abilities of type systems. To carry out this research we plan to: 1. investigate a new foundational theory for graded modal types based on the underlying theory of constructive modal logics that will support several new kinds of data-usage tracking making them more applicable to real-world problems. 2. design and implement Tenli; a general purpose functional programming language with graded modal types that supports general type-based software verification; 3. design new pedagogical materials for teaching resourceful software verification at both the undergraduate and graduate levels using Tenli, and other tools." The successful applicant will be advised by Harley Eades, but also collaborate with Dominic Orchard and his students in the Granule Project. In addition, they will have the opportunity to help mentor summer undergraduate research assistants through new collaborations with: - Clark Atlanta: A historically black university, and - Wesleyan College: An all women's school in Georgia. This is also an exciting time to join the ever growing Augusta University who has made Computer Science one of the main pillars of their university. We have successfully recruited ten new faculty (at all ranks) per year for the last three years. Fall 2021 marks the inaugural year of our PhD program (shorturl.at/gDTU9) and the successful applicant will be among the first PhD students in Computer Science at our university. Even though this is the inaugural year of our PhD program Harley Eades has mentored and collaborated with several PhD students over the course of the last six years. As part of a different NSF funded project Harley Eades recruited and collaborated with three PhD students from other universities through stipends. In addition, he actively collaborates with and has helped mentor PhD students working with Dominic Orchard. Finally, Harley Eades is an active SIGPLAN Mentor (https://www.sigplan.org/LongTermMentoring/) of one PhD student. Interested students should meet the following properties: - Be interested in the overall project as stated above. - Have or are about to complete a Bachelor of Science in Computer Science or a related field (Computer Engineering, Information Systems, Software Engineering, Mathematics, etc.). - Have a minimum cumulative GPA of 3.0 or better on a 4.0 scale. - Both national and International applicants are welcome. If you are interested in applying for this opportunity please begin by contacting Harley Eades (harley.eades at gmail.com) with the following information: - A brief introduction of yourself and if you've done any research already. - CV/Resume More information: - Harley Eades: https://metatheorem.org/ - Granule Project: https://granule-project.github.io/ - ForML Lab: https://the-au-forml-lab.github.io/index.html - AU PhD Program: https://www.augusta.edu/ccs/phd-ccs.php Thanks, Harley Eades -------------- next part -------------- An HTML attachment was scrubbed... URL: From fm-announcements at lists.nasa.gov Mon Apr 26 12:39:31 2021 From: fm-announcements at lists.nasa.gov (Munoz, Cesar (LARC-D320) via fm-announcements) Date: Mon, 26 Apr 2021 16:39:31 +0000 Subject: [TYPES/announce] [fm-announcements] Call for (Virtual) Participation - NFM 2021 Message-ID: *********************************************************************** ???????????? ?????????CALL FOR (VIRTUAL) PARTICIPATION??????? ???????? 13th NASA Formal Methods Symposium (NFM 2021) ?????????????????????????????????May 24-28, 2021 ?????????????? https://shemesh.larc.nasa.gov/nfm2021 ?????????? NFM 2021 is a virtual event organized by ?????????? ??????the Formal Methods Team at ???????NASA Langley Research Center, Hampton, VA, USA ???????????????????? ** Free Registration ** *********************************************************************** Virtual Symposium ----------------- Due to concerns about COVID-19, NFM 2021 is going virtual. We invite the formal methods and aligned communities to use this opportunity of a virtual symposium to participate and engage in a very exciting set of paper presentations and keynote talks. Theme of the Symposium ---------------------- The widespread use and increasing complexity of mission-critical and safety-critical systems at NASA and in the aerospace industry require advanced techniques that address these systems' specification, design, verification, validation, and certification requirements. The NASA Formal Methods Symposium (NFM) is a forum to foster collaboration between theoreticians and practitioners from NASA, academia, and industry. NFM's goals are to identify challenges and to provide solutions for achieving assurance for such critical systems. New developments and emerging applications like autonomous software for Unmanned Aerial Systems (UAS), UAS Traffic Management (UTM), advanced separation assurance algorithms for aircraft, and the need for system-wide fault detection, diagnosis, and prognostics provide new challenges for system specification, development, and verification approaches. Similar challenges need to be addressed during development and deployment of on-board software for both spacecraft and ground systems. The focus of the symposium will be on formal techniques and other approaches for software assurance, including their theory, current capabilities and limitations, as well as their potential application to aerospace, robotics, and other NASA-relevant safety-critical systems during all stages of the software life-cycle. The NASA Formal Methods Symposium is an annual event organized by the NASA Formal Methods (NFM) Steering Committee, comprised of researchers spanning several NASA centers. NFM 2021 is being organized by the NASA Langley Research Center in Hampton, VA. More information about past NFM Symposiums can be found here: https://shemesh.larc.nasa.gov/NFM. Registration ------------ There is no registration fee charged to participants.? All interested individuals are welcome to attend; however, all attendees must register here: https://shemesh.larc.nasa.gov/nfm2021/#loc-registration. Keynote Speakers ---------------- * Erika Abraham (RWTH Aachen University, Germany) * Cristina Cifuentes (Oracle Labs, Australia) * Matthew B. Dwyer (University of Virginia, USA) * Azadeh Farzan (University of Toronto, Canada) * Rob Manning (NASA Jet Propulsion Laboratory, USA) NFM2021 Program & F-IDE 2021 Workshop -------------------------- The complete program is available here: https://shemesh.larc.nasa.gov/nfm2021/program.html. This year the 6th Workshop on Formal Integrated Development Environment (F-IDE 2021) will be virtually hosted with NFM 2021. More information can be found at https://cister-labs.pt/f-ide2021. Organizers ---------- * Cesar Munoz (General co-chair) * Ivan Perez (General co-chair) * Aaron Dutle (PC co-chair) * Mariano Moscato (PC co-chair) * Laura Titolo (PC co-chair) -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 7429 bytes Desc: not available URL: -------------- next part -------------- --- To opt-out from this mailing list, send an email to fm-announcements-request at lists.nasa.gov with the word 'unsubscribe' as subject or in the body. You can also make the request by contacting fm-announcements-owner at lists.nasa.gov From gsilvia at uns.ac.rs Wed Apr 28 12:57:41 2021 From: gsilvia at uns.ac.rs (Silvia Ghilezan) Date: Wed, 28 Apr 2021 18:57:41 +0200 Subject: [TYPES/announce] PPDP 2021 Second Call for Papers Message-ID: =========================== PPDP 2021 Second Call for Papers =========================== 23rd International Symposium on Principles and Practice of Declarative Programming 6?8 September 2021, Tallinn, Estonia http://imft.ftn.uns.ac.rs/PPDP2021 Collocated with LOPSTR 2021 http://cs.ioc.ee/ppdp-lopstr21/ =================================== Important Dates --------------------- - 08.05.2021 title and abstract submission - 15.05.2021 paper submission - 29.06.2021 rebuttal period (48 hours) - 09.07.2021 notification - 23.07.2021 final paper - 06.09.2021 conference starts About PPDP ---------- The PPDP 2021 symposium brings together researchers from the declarative programming communities, including those working in the functional, logic, answer-set, and constraint handling programming paradigms. The goal is to stimulate research in the use of logical formalisms and methods for analyzing, performing, specifying, and reasoning about computations, including mechanisms for concurrency, security, static analysis, and verification. Scope ----- Submissions are invited on all topics related to declarative programming, from principles to practice, from foundations to applications. Topics of interest include, but are not limited to - Language Design: domain-specific languages; interoperability; concurrency, parallelism and distribution; modules; functional languages; reactive languages; languages with objects; languages for quantum computing; languages inspired by biological and chemical computation; metaprogramming. - Declarative languages in artificial intelligence: logic programming; database languages; knowledge representation languages; probabilistic languages; differentiable languages. - Implementations: abstract machines; interpreters; compilation; compile-time and run-time optimization; memory management. - Foundations: types; logical frameworks; monads and effects; semantics. - Analysis and Transformation: partial evaluation; abstract interpretation; control flow; data flow; information flow; termination analysis; resource analysis; type inference and type checking; verification; validation; debugging; testing. - Tools and Applications: programming and proof environments; verification tools; case studies in proof assistants or interactive theorem provers; certification; novel applications of declarative programming inside and outside of CS; declarative programming pearls; practical experience reports and industrial application; education. The PC chair will be happy to advise on the appropriateness of a topic. Submission web page --------------------- https://easychair.org/conferences/?conf=ppdp2021 Submission Categories --------------------- Submissions can be made in three categories: - Research Papers, - System Descriptions, - Experience Reports. Submissions of Research Papers must present original research which is unpublished and not submitted elsewhere. They must not exceed 12 pages ACM style 2-column (including figures, but excluding bibliography). Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Research papers will be judged on originality, significance, correctness, clarity, and readability. Submission of System Descriptions must describe a working system whose description has not been published or submitted elsewhere. They must not exceed 10 pages and should contain a link to a working system. System Descriptions must be marked as such at the time of submission and will be judged on originality, significance, usefulness, clarity, and readability. Submissions of Experience Reports are meant to help create a body of published, refereed, citable evidence where declarative programming such as functional, logic, answer-set, constraint programming, etc., is used in practice. They must not exceed 5 pages **including references**. Experience Reports must be marked as such at the time of submission and need not report original research results. They will be judged on significance, usefulness, clarity, and readability. Supplementary material may be provided via a link to an extended version of the submission (recommended), or in a clearly marked appendix beyond the above-mentioned page limits. Reviewers are not required to study extended versions or any material beyond the respective page limit. Formating Guidelines ---------------------------- We plan to use the same publication arrangements as PPDP has had in previous years. For each paper category, you must use the most recent version of the "Current ACM Master Template" which is available at . The most recent version at the time of writing is 1.75. You must use the LaTeX sigconf proceedings template as the conference organizers are unable to process final submissions in other formats. In case of problems with the templates, contact ACM's TeX support team at Aptara . Authors should note ACM's statement on author's rights (http://authors.acm.org/) which apply to final papers. Submitted papers should meet the requirements of ACM's plagiarism policy (http://www.acm.org/publications/policies/plagiarism_policy). Requirements for Publication ---------------------------- At least one author of each accepted submission will be expected to attend and present the work at the conference. The PC chair may retract a paper that is not presented. The PC chair may also retract a paper if complaints about the paper's correctness are raised which cannot be resolved by the final paper deadline. Program Committee ----------------------------- Zena Ariola, University of Oregon, USA Nick Benton, Facebook, UK Ma?gorzata Biernacka, University of Wroclaw, Poland James Cheney, The University of Edinburgh, UK Stefania Dumbrava, ENSIIE Paris-Evry, France Silvia Ghilezan, University of Novi Sad & Mathematical Institute SASA, Serbia Hugo Herbelin, INRIA, France Cosimo Laneve, University of Bologna, Italy Pierre Lescanne, ENS de Lyon, France Ugo de?Liguoro, University of Torino, Italy Francesca A. Lisi, University of Bari, Italy Yanhong Annie Liu, Stony Brook University, USA Elaine Pimentel, Federal University of Rio Grande do Norte, Brazil Yukiyoshi Kameyama, University of Tsukuba, Japan Petar Maksimovi?, Imperial College, London, UK Yutaka Nagashima, Yale-NUS College, Singapore & University of Innsbruck, Austria Aleksandar Nanevski, IMDEA Software Institute, Spain Vivek Nigam, fortiss GmbH, Germany & Federal University of Para?ba, Brazil Jorge A. P?rez, University of Groningen, The Netherlands Sanjiva Prasad, Indian Institute of Technology Delhi, India Alexis Saurin, CNRS, Universit? de Paris & INRIA , France Tom Schrijvers , KU Leuven, The Netherlands Paul Tarau, University of North Texas, USA Tarmo Uustalu, Reykjavik University, Island & Tallinn University of Technology, Estonia ------------------------- -------------------- --------------------- Program committee co-chair: Nick Benton, Facebook, UK Program committee co-chair: Silvia Ghilezan, University of Novi Sad & Mathematical Institute SASA, Serbia Organising committee chair: Niccol? Veltri, Tallinn University of Technology, Estonia Steering committee chair: James Cheney, Edinburgh University, UK ------------------------- -------------------- --------------------- All questions about submissions should be emailed to the program chair Silvia Ghilezan . All questions about local information should be emailed to the local organiser Niccol? Veltri . From loris at cs.wisc.edu Thu Apr 29 10:15:13 2021 From: loris at cs.wisc.edu (Loris D'Antoni) Date: Thu, 29 Apr 2021 09:15:13 -0500 Subject: [TYPES/announce] POPL 2022 Call for Papers [REVISED, apologies for multiple emails] Message-ID: Please help us forward the following call for papers to the relevant mailing lists and groups. POPL 2022 Call for Papers (https://popl22.sigplan.org/) PACMPL Issue POPL 2022 seeks contributions on all aspects of programming languages and programming systems, both theoretical and practical. Authors of papers published in PACMPL Issue POPL 2022 will be invited to present their work in the POPL conference in January 2022, which is sponsored by ACM SIGPLAN, in cooperation with ACM SIGACT and ACM SIGLOG. # Important Dates Thu 08 Jul 2021: Submission deadline Sat 04 Sep 2021: Start of rebuttal period Wed 08 Sep 2021: End of rebuttal period Wed 29 Sep 2021: Notification Mon 08 Nov 2021: Camera Ready Deadline Sun 16 - Fri 21 Jan 2022: Conference Location: Westin Hotel, Philadelphia, USA General chair: Rajeev Alur PC chair: Hongseok Yang Review Committee members: https://popl22.sigplan.org/committee/POPL-2022-popl-research-papers-program-committee # Scope Principles of Programming Languages is a forum for the discussion of all aspects of programming languages and programming systems. Both theoretical and experimental papers are welcome, on topics ranging from formal frameworks to experience reports. We seek submissions that make principled, enduring contributions to the theory, design, understanding, implementation or application of programming languages. # Evaluation Criteria The Review Committee will evaluate the technical contribution of each submission as well as its accessibility to both experts and the general POPL audience. All papers will be judged on significance, originality, relevance, correctness, and clarity. Each paper must explain its scientific contribution in both general and technical terms, identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. Advice on writing technical papers can be found on the SIGPLAN author information page. # Evaluation Process Authors will have a multi-day period to respond to reviews, as indicated in the Important Dates table. Responses are optional. A response must be concise, addressing specific points raised in review; in particular, it must not introduce new technical results. Reviewers will write a short reaction to these author responses. The Review Committee will discuss papers entirely electronically rather than at a physical meeting. This will avoid the time, cost, and environmental impact of transporting an increasingly large committee to one point on the globe. There is no formal External Review Committee, though experts outside the committee will be consulted. Reviews will be accompanied by a short summary of the reasons behind the committee's decision with the goal of clarifying the reasons behind the decision. For additional information about the reviewing process, see: - Principles of POPL: a presentation of the underlying organizational and reviewing policies for POPL http://popl.mpi-sws.org/PrinciplesofPOPL.pdf - Frequently asked questions about the reviewing and submission process, especially double-blind reviewing. https://popl19.sigplan.org/track/POPL-2019-Research-Papers#Submission-and-Reviewing-FAQ To conform with ACM requirements for journal publication, all POPL papers will be conditionally accepted; authors will be required to submit a short description of the changes made to the final version of the paper, including how the changes address any requirements imposed by the Review Committee. That the changes are sufficient will be confirmed by the original reviewers prior to acceptance to POPL. Authors of conditionally accepted papers must submit a satisfactory revision to the Review Committee by the requested deadline or risk rejection. # Submission Guidelines The following two points are easy to overlook: - Conflicts: Each author of a submission has to log into the submission system and properly declare all potential conflicts of interest in the author profile form. A conflict caught late in the reviewing process leads to a voided review which may be infeasible to replace. - Anonymity: POPL 2022 will employ a lightweight double-blind reviewing process. Make sure that your submitted paper is fully anonymized. Prior to the paper submission deadline, the authors will upload their full anonymized paper. Each paper should have no more than 25 pages of text, excluding bibliography, using the new ACM Proceedings format. # Artifact Evaluation Authors of accepted papers will be invited to formally submit supporting materials to the Artifact Evaluation process. Artifact Evaluation is run by a separate committee whose task is to assess how the artifacts support the work described in the papers. This submission is voluntary and will not influence the final decision regarding the papers. Papers that go through the Artifact Evaluation process successfully will receive a seal of approval printed on the papers themselves. Authors of accepted papers are encouraged to make these materials publicly available upon publication of the proceedings, by including them as "source materials" in the ACM Digital Library. # Copyright, Publication, and Presentation As a Gold Open Access journal, PACMPL is committed to making peer-reviewed scientific research free of restrictions on both access and (re-)use. Authors are strongly encouraged to support libre open access by licensing their work with the Creative Commons Attribution 4.0 International (CC BY) license, which grants readers liberal (re-)use rights. Authors of accepted papers will be required to choose one of the following publication rights: - Author licenses the work with a Creative Commons license, retains copyright, and (implicitly) grants ACM non-exclusive permission to publish (suggested choice). - Author retains copyright of the work and grants ACM a non-exclusive permission to publish license. - Author retains copyright of the work and grants ACM an exclusive permission to publish license. - Author transfers copyright of the work to ACM. These choices follow from ACM Copyright Policy and ACM Author Rights, corresponding to ACM's "author pays" option. While PACMPL may ask authors who have funding for open-access fees to voluntarily cover the article processing charge (currently, US$400), payment is not required for publication. PACMPL and SIGPLAN continue to explore the best models for funding open access, focusing on approaches that are sustainable in the long-term while reducing short-term risk. All papers will be archived by the ACM Digital Library. Authors will have the option of including supplementary material with their paper. The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work. Authors of accepted papers are required to give a short talk (roughly 25 minutes long) at the conference, according to the conference schedule. # Distinguished Paper Awards At most 10% of the accepted papers of POPL 2022 will be designated as Distinguished Papers. This award highlights papers that the POPL Review Committee thinks should be read by a broad audience due to their relevance, originality, significance and clarity. The selection of the distinguished papers will be made based on the final version of the paper and through a second review process. -------------- next part -------------- An HTML attachment was scrubbed... URL: From alexander.nadel at intel.com Fri Apr 30 16:30:49 2021 From: alexander.nadel at intel.com (Nadel, Alexander) Date: Fri, 30 Apr 2021 20:30:49 +0000 Subject: [TYPES/announce] SMT 2021 Workshop: Deadline Extension to May 7 In-Reply-To: References: Message-ID: SMT 2021: 19th International Workshop on Satisfiability Modulo Theories ONLINE July 18-19, 2021 Conference website: http://smt-workshop.cs.uiowa.edu/2021/ Submission link: https://easychair.org/conferences/?conf=smt2021 Submission deadline: May 7, 2021 Overview SMT 2021 is affiliated with CAV 2021. Both events will be virtual. The aim of the workshop is to bring together researchers and users of SMT tools and techniques. Relevant topics include but are not limited to: * Decision procedures and theories of interest * Combinations of decision procedures * Novel implementation techniques * Benchmarks and evaluation methodologies * Applications and case studies * Theoretical results Papers on pragmatic aspects of implementing and using SMT tools, as well as novel applications of SMT, are especially encouraged. Important Dates * Paper submission: ?A?p?r?i?l? ?3?0? May 7, 2021 AoE (Anywhere on Earth) * Notification: June 4, 2021 * Workshop: July 18-19, 2021 Submission Guidelines We invite researchers to submit extended abstracts, original papers, and presentation only-papers. We intend to publish open-access proceedings for SMT 2021 as a volume of the EPiC Series EasyChair Proceedings. Extended abstracts and original papers must not have been published or submitted elsewhere and will be included in the proceedings. * Extended abstracts: given the informal style of the workshop, we strongly encourage the submission of preliminary reports of work in progress. They may range in length from very short (a couple of pages) to the full 10 pages and they will be judged based on the expected level of interest for the SMT community. * Original papers: contain original research and sufficient detail to assess the merits and relevance of the submission. For papers reporting experimental results, authors are strongly encouraged to make their data available. * Presentation-only papers: describe work recently published or submitted and will not be included in the proceedings. We see this as a way to provide additional access to important developments that SMT Workshop attendees may be unaware of. Papers in all three categories will be peer-reviewed. Original papers and extended abstracts should not exceed 10 pages and should be in standard-conforming PDF. Technical details may be included in an appendix to be read at the reviewers' discretion. Final versions should be prepared in LaTeX using the easychair.cls class file. (The 10 page limit does not include references.) Presentation-only papers may be submitted as originally published, if published elsewhere, and should not exceed 10 pages otherwise. To submit, please go to the EasyChair page and follow the instructions there. Organizers and Program Committee See SMT 2021 Organizers and Program Committee. Invited Speakers * Karem Sakallah, University of Michigan * Guy Katz, University of Jerusalem --------------------------------------------------------------------- Intel Israel (74) Limited This e-mail and any attachments may contain confidential material for the sole use of the intended recipient(s). Any review or distribution by others is strictly prohibited. If you are not the intended recipient, please contact the sender and delete all copies. -------------- next part -------------- An HTML attachment was scrubbed... URL: From hakjoo.oh at gmail.com Sun May 2 21:11:07 2021 From: hakjoo.oh at gmail.com (Hakjoo Oh) Date: Mon, 3 May 2021 10:11:07 +0900 Subject: [TYPES/announce] Call for Papers: 19th Asian Symposium on Programming Languages and Systems (APLAS 2021) Message-ID: CALL FOR PAPERS 19th Asian Symposium on Programming Languages and Systems (APLAS 2021) Oct 17-Oct 22, 2021, Chicago, Illinois (co-located with SPLASH 2021) https://conf.researchr.org/home/aplas-2021 The 19th Asian Symposium on Programming Languages and Systems (APLAS 2021) aims to stimulate programming language research by providing a forum for the presentation of the latest results and the exchange of ideas in programming languages and systems. APLAS is based in Asia but is an international forum that serves the worldwide programming languages community. APLAS 2021 will be co-located with SPLASH 2021. Due to the COVID-19 situation, all authors will be given the chance to present remotely regardless of whether the conference is held as a physical, virtual, or hybrid physical/virtual meeting. Papers are solicited on topics such as: - Semantics, logics, foundational theory - Design of languages, type systems, and foundational calculi - Domain-specific languages - Compilers, interpreters, abstract machines - Program derivation, synthesis, and transformation - Program analysis, verification, model-checking - Logic, constraint, probabilistic, and quantum programming - Software security - Concurrency and parallelism - Tools and environments for programming and implementation - Applications of SAT/SMT to programming and implementation Topics are not limited to those discussed in previous symposiums. Papers identifying future directions of programming and those addressing the rapid changes of the underlying computing platforms are especially welcome. Demonstration of tools in the scope of APLAS are welcome to the Tool paper category. Authors concerned about the appropriateness of a topic are welcome to consult with program chair prior to submission. IMPORTANT DATES Submission deadline: June 16, 2021 (anywhere on Earth) Author response: July 28 - 30, 2021 Author notification: August 11, 2021 Final version: September 1, 2021 Conference: October 17 - October 22, 2021 CALL FOR REGULAR RESEARCH PAPERS We solicit submissions in the form of regular research papers describing original scientific research results, including system development and case studies. Regular research papers should not exceed 18 pages in the Springer LNCS format, including bibliography and figures. This category encompasses both theoretical and implementation (also known as system descriptions) papers. In either case, submissions should clearly identify what has been accomplished and why it is significant. Submissions will be judged on the basis of significance, relevance, correctness, originality, and clarity. System descriptions papers should contain a link to a working system and will be judged on originality, usefulness, and design. In case of lack of space, proofs, experimental results, or any information supporting the technical results of the paper could be provided as an appendix or a link to a web page, but reviewers are not obliged to read them. CALL FOR TOOL PAPERS We solicit submissions in the form of tool papers describing a demonstration of a tool or a system that support theory, program construction, reasoning, or program execution in the scope of APLAS. The main purpose of a tool paper is to display a completed, robust and well-documented tool-highlighting the overall functionality of the tool, the interfaces of the tool, interesting examples and applications of the tool, an assessment of the tool?s strengths and weaknesses, and a summary of documentation/support available with the tool. Authors of tool demonstration proposals are expected to present a live demonstration of the tool at the conference. It is highly desirable that the tools are available on the web. System and Tool papers should not exceed 8 pages in the Springer LNCS format, including bibliography and figures. They may include an additional appendix of up to 6 extra pages giving the outline, screenshots, examples, etc. to indicate the content of the proposed live demo. PROGRAM COMMITTEE Andreas Abel, Gothenburg University, Sweden Kyungmin Bae, POSTECH, South Korea Edwin Brady, University of St. Andrews, UK Yu-Fang Chen, Academia Sinica, Taiwan Andreea Costea, NUS, Singapore Rayna Dimitrova, CISPA Helmholtz Center for Information Security, Germany Yu Feng, UC Santa Barbara, US Giulio Guerrieri, University of Bath, UK Kihong Heo, KAIST, South Korea Yue Li, Nanjing University, China Sam Lindley, Heriot-Watt University / University of Edinburgh, UK Sergio Mover, Ecole Polytechnique, France Uday P. Khedker, IIT Bombay, India Alex Potanin, Victoria University of Wellington, New Zealand Xiaokang Qiu, Purdue University, US Jiasi Shen, MIT, US Xujie Si, McGill University, Canada Gagandeep Singh, VMWare Research / UIUC, US Youngju Song, Seoul National University, South Korea Kohei Suenaga, Kyoto University, Japan Yulei Sui, University of Technology Sydney, Australia Tachio Terauchi, Waseda University, Japan Xinyu Wang, University of Michigan, US Qirun Zhang, Georgia Institute of Technology, US Xin Zhang, Peking University, China SUBMISSION INFORMATION Papers should be submitted electronically via the submission web page using HotCRP (https://aplas2021.hotcrp.com). The acceptable format is PDF. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers must be written in English. The proceedings will be published as a volume in Springer?s LNCS series. Accepted papers must be presented at the conference. REVIEW PROCESS APLAS 2021 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 judgement 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. AUTHOR RESPONSE PERIOD During the author response period, authors will be able to read reviews and respond to them as appropriate. RESEARCH INTEGRITY The Program Committee reserves the right, up until the time of publication, to reverse a decision of paper acceptance. Reversal is possible if fatal flaws are discovered in the paper, or research integrity is found to have been seriously breached. From dimitrova at cispa.de Sun May 2 11:38:08 2021 From: dimitrova at cispa.de (Dimitrova, Rayna) Date: Sun, 2 May 2021 15:38:08 +0000 Subject: [TYPES/announce] NSV 2021 Workshop: Extended Deadline May 7 Message-ID: 14th International Workshop on Numerical Software Verification, 18-19 July 2021 A workshop affiliated with CAV 2021 - Online Web Page: https://nsv2021.github.io Submission link: https://easychair.org/conferences/?conf=nsv21 DEADLINE EXTENSION: 7 May (See below.) Description of the Workshop =========================== Numerical computations are ubiquitous in digital systems: supervision, prediction, simulation and signal processing rely heavily on numerical calculus to achieve desired goals. Design and verification of numerical algorithms has a unique set of challenges, which set it apart from rest of software verification. The implementation of numerical techniques on modern hardware adds another layer of approximation because of the use of finite representations of infinite precision numbers that usually lack basic arithmetic properties such as commutativity and associativity. Finally, the development and analysis of cyber-physical systems (CPS) which involve the interacting continuous and discrete components pose a further challenge. It is hence imperative to develop logical and mathematical techniques for the reasoning about programmability and reliability. The NSV workshop is dedicated to the development of such techniques. This year, the NSV workshop is hosting a *special session on numerical computations in machine learning*. This includes, but is not limited to, performance vs accuracy trade-offs, reliability, robustness, co-design of hardware and software for numerical computations in machine learning frameworks. Topics ====== The scope of the workshop includes, but is not restricted to, the following topics: Quality of finite precision numerics - Representations of real numbers such as dfloat, finite precision, logarithmic number systems, etc Validation and verification of machine learning algorithms - Performance-accuracy trade-offs in floating point representations in machine learning - Robustness, reliability, and hardware software co-design for numerical computations in machine learning Validation and verification in scientific computing and simulations - Specifications of correctness of numerical algorithms - Numerical optimization methods Hybrid systems and control software verification - Quantitative and qualitative analysis of hybrid systems - Optimal control and synthesis of dynamical systems - Applications in space, avionics, automotive, systems biology, etc Important Dates =============== Submissions deadline (extended): May 7, 2021 23:59 (AoE) Notification: May 25, 2021 Final version: June 2, 2021 Workshop: July 18-19, 2021 Submission information ====================== We solicit regular and short papers. Paper submission must be performed via EasyChair. Regular papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are under submission. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should clearly identify what has been accomplished and why it is significant. Regular paper submissions should not exceed 15 pages in LNCS style, plus possibly bibliography and appendices. However, program committee members are not required to read the appendices, thus papers must be intelligible without them. Short papers are also welcome: they should present tools, benchmarks, case-studies or be extended abstracts of ongoing research. Short papers should not exceed 6 pages, excluding extra material as above. All accepted papers will be published as Lecture Notes in Computer Science (LNCS) with Springer Verlag. http://www.springer.com/lncs Invited Speakers ================ Stanley Bak, Stony Brook University Eva Darulova, Max Planck Institute for Software Systems Sanjit Seshia, University of California, Berkeley PC Chairs ====== Rayna Dimitrova, CISPA Helmholtz Center for Information Security, Germany Chuchu Fan, Massachusetts Institute of Technology, USA Program Committee ================= Houssam Abbas, Oregon State University Jyotirmoy Deshmukh, University of Southern California Bruno Dutertre, SRI International Sicun Gao, University of California San Diego Mirco Giacobbe, University of Oxford Taylor T Johnson, Vanderbilt University Soonho Kong, Toyota Research Institute Laura Nenzi, University of Trieste Nicola Paoletti, Royal Holloway, University of London Yasser Shoukry, University of California, Irvine Miriam Garc?a Soto, IST Austria Sadegh Soudjani, Newcastle University Hoang-Dung Tran, Vanderbilt University Tichakorn (Nok) Wongpiromsarn, Iowa State University Paolo Zuliani, Newcastle University Steering Committee ================== Sergiy Bogomolov (Newcastle University, UK) Radu Grosu (TU Vienna, Austria) Matthieu Martel (Universit? de Perpignan, France) Pavithra Prabhakar (Kansas State University, USA) Sriram Sankaranarayanan (UC Boulder, USA) -------------- next part -------------- An HTML attachment was scrubbed... URL: From davide.ancona at unige.it Mon May 3 13:10:58 2021 From: davide.ancona at unige.it (Davide Ancona) Date: Mon, 3 May 2021 19:10:58 +0200 Subject: [TYPES/announce] VORTEX 2021: Extended Deadline May 7 Message-ID: <6d091c9b-b9cb-df74-07db-556b8f648ff0@unige.it> VORTEX 2021, online Workshop at ECOOP/ISSTA 2021, Monday 12 July International Workshop on Verification and mOnitoring at Runtime EXecution (https://conf.researchr.org/track/ecoop-issta-2021/ecoop-issta-2021-vortex) ================================================================================ VORTEX brings together researchers working on all aspects of Runtime Monitoring (RM) with emphasis on integration with formal verification and testing. RM is concerned with the runtime analysis of software and hardware system executions in order to infer properties relating to system behaviour. Example applications include telemetry, log aggregation, threshold alerting, performance monitoring and adherence to correctness properties (more commonly referred to as Runtime Verification). RM has gained popularity as a solution to ensure software reliability, bridging the gap between formal verification and testing: on the one hand, the notion of event trace abstracts over system executions, thus favoring system agnosticism to better support reuse and interoperability; on the other hand, monitoring a system offers more opportunities for addressing error recovery, self-adaptation, and issues that go beyond software reliability. The goal of VORTEX is to bring together researchers contributing on all aspects of RM covering and possibly integrating both theoretical and practical aspects, with particular focus on hybrid approaches inspired by formal methods, program analysis, testing. Covid-19 -------- ECOOP 2021, ISSTA 2021, and all the affiliated events will take place virtually. Call for Papers --------------- Submissions are expected to be in English and to belong to one of the following two categories: * regular paper, page limit 8 in acmart style: unpublished self-contained work * extended abstract, page limit 4 in acmart style: original contribution, not yet fully developed Topics of interest include, but are not limited to, the following ones: * monitor construction and synthesis techniques * program adaptation * monitoring oriented programming * runtime enforcement, fault detection, recovery and repair * combination of static and dynamic analyses * specification formalisms for RM * specification mining * monitoring concurrent/distributed systems * RM for safety and security * RM for the Internet of Things * industrial applications * integrating RM, formal verification, and testing * tool development * instrumentation techniques for RM * surveys on different RM tools, formal frameworks or methodologies * presentations of RM tools Papers must be submitted electronically via EasyChair; the extended submission deadline is May 7 AoE. Authors should use the official ACM Master article template, which can be obtained from the ACM Proceedings Template pages. Latex users should use the sigconf option, as well as review to produce line numbers for easy reference by the reviewers, as indicated by the following command: \documentclass[sigconf,review]{acmart} Important Dates --------------- * Extended submission deadline: Fri 7 May 2021 * Author notification: Mon 17 May 2021 * Camera ready submission: Fri 4 Jun 2021 * Virtual workshop: Mon 12 Jul 2021 Proceedings ----------- Accepted regular papers and extended abstracts will be included in the proceedings published in the ACM Digital Library. Workshop Organizers ------------------- * Wolfgang Ahrendt, Chalmers University of Technology, Sweden * Davide Ancona, Universit? di Genova, Italy * Adrian Francalanza, University of Malta, Malta From jean-marie.madiot at inria.fr Mon May 3 14:17:48 2021 From: jean-marie.madiot at inria.fr (Jean-Marie Madiot) Date: Mon, 3 May 2021 20:17:48 +0200 Subject: [TYPES/announce] [CFP] The Coq Workshop 2021: Deadline Extension Message-ID: <85619e18-6d76-4a43-440d-3eee4f964588@inria.fr> Dear all, the deadline for submissions of talk proposals for the Coq Workshop 2021 has been extended to Friday, May 7th, "Anywhere on Earth". New dates: - May 7th, 2021 (AoE): deadline for submissions of talk proposals - May 31st, 2021: notification to authors - July 2nd, 2021: workshop (online) Submissions are in the form of 2-page talk proposals. More info at https://coq-workshop.gitlab.io/2021/ Sincerely, Christian Doczkal and Jean-Marie Madiot (coq2021 at easychair.org) From elaine.pimentel at gmail.com Mon May 3 15:02:46 2021 From: elaine.pimentel at gmail.com (Elaine Pimentel) Date: Mon, 3 May 2021 16:02:46 -0300 Subject: [TYPES/announce] TLLA 2021 -- extended deadline! Message-ID: ============================================================== Call for Papers TLLA 2021 5th International Workshop on Trends in Linear Logic and Applications Extended deadline: May 13, 2021 Rome, 27-28 June 2021 Affiliated with ACM/IEEE LICS https://lipn.univ-paris13.fr/TLLA/2021/ ============================================================== Linear Logic is not only a proof theoretical tool to analyze or control the use of resources in logic and computation. It is also a corpus of tools, approaches, and methodologies (proof nets, exponential decomposition, geometry of interaction, coherent spaces, relational models, etc.) that, even if developed for studying Linear Logic syntax and semantics, have been applied in several other fields (analysis of lambda-calculus computations, game semantics, computational complexity, program verification, etc.). The TLLA international workshop aims at bringing together researchers working on Linear Logic or applying it or its tools. The main goal is to present and discuss trends in the research on Linear Logic and its applications by means of tutorials, invited talks, open discussions, and contributed talks. The purpose is to gather researchers interested in the connections between Linear Logic and various topics such as * theory of programming languages * implicit computational complexity * parallelism and concurrency * games and languages * proof theory * philosophy * categories and algebra * possible connections with combinatorics * linguistics * functional analysis and operator algebras ---------------------------------------------------------------------- ** Submission Guidelines ---------------------------------------------------------------------- Contributions are not restricted to talks presenting an original results, but open to tutorials, open discussions, and position papers. For this reason, we strongly encourage contributions presenting work in progress, open questions, and research projects. Contributions presenting the application of linear logic results, techniques, or tools to other fields, or vice versa, are most welcome. To propose a contributed talk submit a short abstract whose length is between 2 and 5 pages on https://easychair.org/conferences/?conf=tlla2021 ---------------------------------------------------------------------- ** Important dates ---------------------------------------------------------------------- * Submission deadline: 13 May 2021 **extended** * Notification to authors: 20 May 2021 * Final versions due: 31 May 2021 * Workshop date: 27-28 June 2021 ---------------------------------------------------------------------- ** Publication ---------------------------------------------------------------------- The abstracts of the contributed and invited talks will be published on the site of the conference. Possible other formats will be discussed at the workshop. ---------------------------------------------------------------------- ** Tutorials ---------------------------------------------------------------------- * Proof nets, Lionel Vaux - Universit? d?Aix-Marseille * Combinatorial proofs and Deep Inference, Matteo Acclavio - Universit? du Luxembourg ---------------------------------------------------------------------- ** Invited Speakers ---------------------------------------------------------------------- * Marie Kerjean, CNRS - Universit? Sorbonne Paris Nord, France * Willem Heijltjes, University of Bath, UK * Beniamino Accattoli, Inria, France ---------------------------------------------------------------------- ** Program Committee ---------------------------------------------------------------------- * Claudia Faggian, CNRS - Universit? Paris Diderot, France * Giulio Guerrieri, University of Bath, UK * Naohiko Hoshino, Sojo University, Japan * Sonia Marin, University College London, UK * Elaine Pimentel, Federal University of Rio Grande do Norte, Brazil (co-chair) * Paolo Pistone, Universit? di Bologna, Italy * Myriam Quatrini, Universit? de la M?diterran?e * Christian Retor?, Universit? de Montpellier, France (co-chair) * Thomas Seiller, CNRS - Universit? Sorbonne Paris Nord, France * Lutz Strassburger, Inria Saclay, France ---------------------------------------------------------------------- ** Organization Committee ---------------------------------------------------------------------- * Thomas Ehrhard, CNRS - University Paris Diderot, France * Stefano Guerrini, CNRS - University Sorbonne Paris Nord, France * Lorenzo Tortora de Falco, University Roma Tre, Italy ---------------------------------------------------------------------- ** Contact ---------------------------------------------------------------------- All questions about submissions should be emailed to the PC chairs at elaine.pimentel at gmail.com -------------- next part -------------- An HTML attachment was scrubbed... URL: From Graham.Hutton at nottingham.ac.uk Tue May 4 05:31:25 2021 From: Graham.Hutton at nottingham.ac.uk (Graham Hutton) Date: Tue, 4 May 2021 09:31:25 +0000 Subject: [TYPES/announce] Journal of Functional Programming - Call for PhD Abstracts Message-ID: <260B8465-C20E-4028-8315-05B6A5A44A3E@nottingham.ac.uk> Dear all, If you or one of your students recently completed a PhD in the area of functional programming, please submit the dissertation abstract for publication in JFP: simple process, no refereeing, open access, ~200 published to date, deadline 31st May 2021. Please share! Best wishes, Graham Hutton ============================================================ CALL FOR PHD ABSTRACTS Journal of Functional Programming Deadline: 31st May 2021 http://tinyurl.com/jfp-phd-abstracts ============================================================ PREAMBLE: Many students complete PhDs in functional programming each year. As a service to the community, twice per year the Journal of Functional Programming publishes the abstracts from PhD dissertations completed during the previous year. The abstracts are made freely available on the JFP website, i.e. not behind any paywall. They do not require any transfer of copyright, merely a license from the author. A dissertation is eligible for inclusion if parts of it have or could have appeared in JFP, that is, if it is in the general area of functional programming. The abstracts are not reviewed. Please submit dissertation abstracts according to the instructions below. We welcome submissions from both the PhD student and PhD advisor/supervisor although we encourage them to coordinate. ============================================================ SUBMISSION: Please submit the following information to Graham Hutton by 31st May 2021: o Dissertation title: (including any subtitle) o Student: (full name) o Awarding institution: (full name and country) o Date of PhD award: (month and year; depending on the institution, this may be the date of the viva, corrections being approved, graduation ceremony, or otherwise) o Advisor/supervisor: (full names) o Dissertation URL: (please provide a permanently accessible link to the dissertation if you have one, such as to an institutional repository or other public archive; links to personal web pages should be considered a last resort) o Dissertation abstract: (plain text, maximum 350 words; you may use \emph{...} for emphasis, but we prefer no other markup or formatting; if your original abstract exceeds the word limit, please submit an abridged version within the limit) Please do not submit a copy of the dissertation itself, as this is not required. JFP reserves the right to decline to publish abstracts that are not deemed appropriate. ============================================================ PHD ABSTRACT EDITOR: Graham Hutton School of Computer Science University of Nottingham Nottingham NG8 1BB United Kingdom ============================================================ This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law. From harley.eades at gmail.com Tue May 4 17:24:17 2021 From: harley.eades at gmail.com (Harley D. Eades III) Date: Tue, 4 May 2021 17:24:17 -0400 Subject: [TYPES/announce] A seminar talk on Excel Meeting LAMBDA Message-ID: Hi, everyone. On Friday, May 7, 2021 between 9am and 10am EDT (1pm - 2pm UTC), Andy Gordon will be giving a presentation as part of the CS Colloquium Series at Augusta University. Presentation details can be found here: https://the-au-forml-lab.github.io/colloquium_talks/Gordon.html Andy will be giving us a sneak peak at the latest addition of LAMBDA to Excel! It's going to be super interesting! These talks are open to the general public via Zoom and Youtube. I'll be live streaming it on Youtube. If you are interested in attending the Zoom meeting please RSVP with me before the talk. Questions will be taken from those on Zoom and YouTube. If you care to watch via YouTube, please use the following link: https://youtu.be/7tFq-9Zvk3M Feel free to share this message with everyone you know. I hope all of you, your family and friends are doing well! Very best, Harley -------------- next part -------------- An HTML attachment was scrubbed... URL: From ornela.dardha at gmail.com Tue May 4 05:24:37 2021 From: ornela.dardha at gmail.com (Ornela Dardha) Date: Tue, 4 May 2021 10:24:37 +0100 Subject: [TYPES/announce] VEST 2021 Last Call for Talks (deadline in 3 weeks) Message-ID: ********************************************************************* VEST 2021: 2nd Workshop on Verification of Session Types Online on July 12, 2021, co-located with ICALP 2021 https://sites.google.com/view/vest21/home Submission: Monday, 24th May 2021 Submission Link: https://easychair.org/conferences/?conf=vest21 Call for Talks ********************************************************************* * Presentation The goal of this workshop is to bring together researchers and build and strengthen a community working on verification of session types using various theorem provers such as Agda, Coq, Isabelle or any other. Session types are abstract representations of the sequences of operations that computational entities (such as channels or objects) must perform. Stateful entities offer services in a non-uniform way (one cannot pop from an empty stack); traditional type systems cannot guarantee that operations are only invoked when the entity is in the right state. Large-scale software systems rely on message-passing protocols: their correctness largely depends on sound protocol implementations. Session types can help in the specification of correct-by-construction systems, and in verifying that programs respect their intended protocols. Recent years have seen a steady stream of research on behavioural types: their foundations and their transfer to several programming languages. This has led to highly-cited papers in conferences such as POPL and journals such as TOPLAS. Research projects on behavioural types have advanced the theory and applications of behavioural types. Although the foundations of session types are now well established, and new works build on approaches that have become standard, there is still a lack of reusable libraries, namely machine-verified ones. As on one hand the basis of most works is common, and on the other hand the complexity of the formal systems is considerable and may lead to errors in the proofs of the soundness results, machine verifying the type systems proposed is vital. Libraries, or at least clear formalisations of common approaches, is crucial to avoid not only to repeat work but also to increase the confidence in the knowledge base. Moreover, as many of these systems have a goal to do static analysis to ensure some safety or liveness property, machine verification of these approaches leads to certified software for program analysis. The goal of the VEST workshop is to gather the researchers working on mechanisations of behavioural types using various theorem provers, such as Agda, Coq, Isabelle or any other. The workshop will be a platform to present both the now well-established efforts and the ongoing works the community has put on verification. The workshop will also be a forum to discuss strengths and weaknesses of existing approaches, potential obstacles and to foster collaboration. * Types of Contributions We request two types of research contributions. Type 1: Short presentations (1 page) of work published elsewhere; Type 2: Presentations (2-5 pages) of ongoing original work. Submissions of Type 1 will consist of 1 page papers presenting the work, the publication venue and the significance of the results; the PC will select the submissions with a ranking system. Submissions of Type 2 will consist of 2 - 5 page papers submitted to a light reviewing process. There will be no proceedings of VEST'21, but rather the aim is to strengthen and further expand our community. * Important Dates AoE (UTC-12h) Submission: Monday, 24 May 2021 Notification: Monday, 21st June 2021 Final Version: Monday, 5th July 2021 Workshop: Monday, 12th July 2021 * Submission Link: https://easychair.org/conferences/?conf=vest21 * Invited Speakers: - Jesper Bengtson (IT University of Copenhagen, Denmark) - Andreia Mordido (University of Lisbon, Portugal) *Tutorial, jointly delivered by: - David Castro-Perez (University of Kent, UK) - Francisco Ferreira-Ruiz (Imperial College, UK) - Lorenzo Gheri (Imperial College, UK) * Program Committee: - Robert Atkey, University of Strathclyde, UK - Laura Bocchi, University of Kent, UK - Ornela Dardha, University of Glasgow, UK (Co-chair) - Cinzia Di Giusto, Universit? C?te d'Azur, CNRS, I3S, France - Wen Kokke, The University of Edinburgh, UK - Robbert Krebbers, Radboud University Nijmegen, Netherlands - Luca Padovani , Universit? di Torino, Italy - Kirstin Peters, TU Darmstadt, Germany - Ant?nio Ravara, NOVA University of Lisbon, Portugal (Co-chair) - Ivan Scagnetto, University of Udine, Italy - Peter Thiemann, Universit?t Freiburg, Germany -------------- next part -------------- An HTML attachment was scrubbed... URL: From peterol at ifi.uio.no Tue May 4 08:32:13 2021 From: peterol at ifi.uio.no (=?utf-8?Q?Peter_Csaba_=C3=98lveczky?=) Date: Tue, 4 May 2021 14:32:13 +0200 Subject: [TYPES/announce] Deadline extension: ICTAC 2021 Message-ID: <16167E1A-8B54-46D5-81BD-C59B56B27B42@ifi.uio.no> --------------------------------------------------------------------- Call for Papers ICTAC 2021 18th International Colloquium on Theoretical Aspects of Computing Nur-Sultan, Kazakhstan, September 6-10, 2021 https://ictac2021.github.io/ --------------------------------------------------------------------- ** Hybrid or fully virtual event ** ** Springer LNCS proceedings and Theoretical Computer Science special issue ** Important dates: Submission deadline: May 7, 2021, ** extended to May 14, 2021 (AoE) ** Notification of acceptance: June 18, 2021 Overview and Scope: The ICTAC conference series aims at bringing together researchers and practitioners from academia, industry and government to present research and exchange ideas and experience addressing challenges in both theoretical aspects of computing and the exploitation of theory through methods and tools for system development. ICTAC also aims to promote research cooperation between developing and industrial countries. The conference concerns all aspect of theoretical computer science, including, but not limited to: * languages and automata * semantics of programming languages * logic in computer science * lambda calculus, type theory and category theory * domain-specific languages * theories of concurrency and mobility * theories of distributed computing * models of objects and components * coordination models * timed, hybrid, embedded and cyber-physical systems * security and privacy * static analysis * probabilistic and statistical verification * software verification * software testing * runtime verification * program generation and transformation * model checking and theorem proving * applications and case studies Call for Papers: We solicit submissions, related to the topics of ICTAC, in the following categories: * original research contributions (16 pages max, excluding references); * applications and experiences (16 pages max, excluding references); * short papers, with original work in progress or with proposals of new ideas and emerging challenges (6 pages max, excluding references); and * tool papers (6 pages max, excluding references). All submissions must be original, unpublished, and not submitted concurrently for publication elsewhere. Paper submission is done via EasyChair at https://easychair.org/conferences/?conf=ictac2021. Papers must be formatted according to the guidelines for Springer LNCS papers (see http://www.springer.com/lncs), without modifications of margins and other space-saving measures. Publication: All accepted papers will appear in the proceedings of the conference that will be published as a volume in Springer's Lecture Notes in Computer Science (LNCS) series. The authors of a subset of accepted papers will be invited to submit extended versions of their papers to a special issue of the journal Theoretical Computer Science. Invited Speakers: Wil van der Aalst, RWTH Aachen University, Germany Alan Dix, Swansea University, UK Kim Larsen, Aalborg University, Denmark Grigore Rosu, University of Illinois at Urbana-Champaign, USA Program Chairs: Antonio Cerone, Nazarbayev University, Kazakhstan Peter ?lveczky, University of Oslo, Norway Program Committee: Erika Abraham, RWTH Aachen University, Germany Bernhard K. Aichernig, TU Graz, Austria Musab A. Alturki, Runtime Verification Inc., USA, and King Fahd University of Petroleum and Minerals, Saudi Arabia Etienne Andre, Universite de Lorraine, France Ebru Aydin Gol, Middle East Technical University, Turkey Kyungmin Bae, POSTECH, Korea Maurice ter Beek, ISTI-CNR, Italy Dirk Beyer, LMU Munich, Germany Simon Bliudze, INRIA Lille, France Roberto Bruni, University of Pisa, Italy Antonio Cerone, Nazarbayev University, Kazakhstan Manuel Clavel, Vietnamese-German University, Vietnam Adrian Francalanza, University of Malta, Malta Rob van Glabbeek, Data61, CSIRO, Australia Sergey Goncharov, Friedrich-Alexander University Erlangen-N?rnberg, Germany Jan Friso Groote, Eindhoven University of Technology, The Netherlands Stefan Gruner, University of Pretoria, South Africa Osman Hasan, National University of Sciences and Technology, Pakistan Klaus Havelund, Jet Propulsion Laboratory, USA Kim Larsen, Aalborg University, Denmark Axel Legay, Universite catholique de Louvain, Belgium Martin Leucker, University of Lubeck, Germany Manuel Mazzara, Innopolis University, Russia Catherine Meadows, Naval Research Laboratory, USA Larissa Meinicke, The University of Queensland, Australia Hans de Nivelle, Nazarbayev University, Kazakhstan Kazuhiro Ogata, JAIST, Japan Peter ?lveczky, University of Oslo, Norway Catuscia Palamidessi, Inria, France Elaine Pimentel, Federal University of Rio Grande do Norte, Brazil Jose Proenca, Polytechnic Institute of Porto, Portugal Riadh Robbana, INSAT, Carthage University, Tunisia Gwen Salaun, University Grenoble Alpes, France Davide Sangiorgi, University of Bologna, Italy, and INRIA, France Lutz Schr?der, Friedrich-Alexander University Erlangen-N?rnberg, Germany Volker Stolz, Western Norway University of Applied Sciences, Norway Georg Struth, The University of Sheffield, UK From ohad.kammar at ed.ac.uk Sat May 8 05:33:41 2021 From: ohad.kammar at ed.ac.uk (Ohad Kammar) Date: Sat, 8 May 2021 10:33:41 +0100 Subject: [TYPES/announce] [EXTENDED deadline] HOPE'21@ICFP-CfP: ACM SIGPLAN Workshop on Higher-Order Programming with Effects In-Reply-To: References: Message-ID: Call-for presentations https://icfp21.sigplan.org/home/hope-2021 Submissions are lightweight (2 pages excluding references and appendices). HOPE'21: ACM SIGPLAN Workshop on Higher-Order Programming with Effects August 22nd, 2021 (Sun), ONLINE (immediately before the main ICFP) HOPE is an established informal workshop bringing together researchers interested in the design, semantics, implementation, and verification of higher-order effectful programs. Talks about work in progress are particularly encouraged. It has been held since 2012 in affiliation with ICFP. We solicit proposals for contributed talks, in plain text or PDF format. The motivation, the problem to solve, accomplished and anticipated results should be clear from two first pages of the submission. By default contributed talks are about 30 minutes long; proposals for shorter or longer talks will also be considered. Speakers may also submit supplementary material (e.g. a full paper, talk slides), which PC members are free (but not expected) to read. If you have any questions about the relevance of a particular topic, please contact the PC chairs, Oleg Kiselyov (oleg at okmij.org) and Ohad Kammar (ohad.kammar at ed.ac.uk). * Deadline for talk proposals: **May 13th, 2021** (Thursday) * Notification of acceptance: **June 14th, 2021** (Monday) * Workshop: **August 22nd, 2021** (Sunday) Program Committee Anton Bachin USA Eli Bingham Broad Institute, USA Liron Cohen Ben Gurion Univeristy, Israel Ohad Kammar (co-chair) University of Edinburgh, Scotland, UK Jeehoon Kang KAIST, South Korea Oleg Kiselyov (co-chair) Tohoku University, Japan Andreas Rossberg DFinity Foundation, Germany Kathrin Stark Princeton University, New Jersey, USA Simon Thompson University of Kent / IOHK, England, UK The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. Is e buidheann carthannais a th? ann an Oilthigh Dh?n ?ideann, cl?raichte an Alba, ?ireamh cl?raidh SC005336. -------------- next part -------------- An HTML attachment was scrubbed... URL: From jasmine.xuereb.15 at um.edu.mt Thu May 6 16:29:08 2021 From: jasmine.xuereb.15 at um.edu.mt (Jasmine Xuereb) Date: Thu, 6 May 2021 22:29:08 +0200 Subject: [TYPES/announce] Call for Participation DisCoTec 2021 Message-ID: <6B0548CA-1BEB-493F-A134-1D6518DAB23C@um.edu.mt> [Apologies for multiple postings] ************************************************************************ Joint Call for Participation 16th International Federated Conference on Distributed Computing Techniques DisCoTec 2021 Valletta, Malta, 14-18 June 2021 https://www.discotec.org/2021 ************************************************************************ DisCoTec 2021 is one of the major events sponsored by the International Federation for Information Processing (IFIP) and the European Association for Programming Languages and Systems (EAPLS). It gathers conferences and workshops that cover a broad spectrum of distributed computing subjects ? from theoretical foundations and formal description techniques, testing and verification methods, to language design and system implementation approaches. As mentioned in our previous emails, DisCoTec 2021 will be held online again this year as a Zoom Webinar. Presentations will be recorded and broadcasted, followed by live Q&A sessions after each talk. * Registration * The conference registration can be found at https://www.discotec.org/2021/#registration. Please read the full information before registering. The registration form can be reached by following the link at the bottom of the page. When registering, be sure to give your full details. The email address you provide will be used for future correspondence. At least one presenter for each paper is required to pay the nominal registration fee; co-authors are exempt, but *still need* to register to attend the conference free of charge. Deadline for registration: 07 June 2021 midnight CET. * Keynote Speakers * - Gilles Fedak (iExec, FR) - Mira Mezini (Technical University of Darmstadt, DE) - Alexandra Silva (University College London, UK) (See https://www.discotec.org/2021/invited for a detailed overview of the titles and abstracts.) * Main Conferences (June 15 - June 17) * - COORDINATION (https://www.discotec.org/2021/coordination) 23rd International Conference on Coordination Models and Languages PC Chairs: Ferruccio Damiani (University of Turin, IT) and Ornela Dardha (University of Glasgow, UK) - DAIS (https://www.discotec.org/2021/dais) 21st International Conference on Distributed Applications and Interoperable Systems PC Chairs: Fab?ola Greve (Federal University of Bahia, BR) and Miguel Matos (University of Lisboa & INESC-ID, PT) - FORTE (https://www.discotec.org/2021/forte) 41st International Conference on Formal Techniques for Distributed Objects, Components and Systems PC Chairs: Kirstin Peters (Technical University of Darmstadt, DE) and Tim Willemse (Eindhoven University of Technology, NL) * Satellite Events (June 14 and June 18) * - DisCoTec Tools (https://www.discotec.org/2021/tutorials) Tutorial Sessions - ICE 2021 (https://www.discotec.org/2021/ice) 14th Workshop on Interaction and Concurrency Experience - FOCODILE 2021 (https://www.discotec.org/2021/focodile) 2nd International Workshop on the Foundations of Consensus and Distributed Ledgers - REMV 2021 (https://www.discotec.org/2021/remv) 1st International Workshop on Robotics, Electronics and Machine Vision To receive live, up-to-date information, follow us on Twitter @DisCoTecConf. From elena.zucca at unige.it Fri May 7 09:25:27 2021 From: elena.zucca at unige.it (Elena Zucca) Date: Fri, 7 May 2021 15:25:27 +0200 Subject: [TYPES/announce] Dahl-Nygaard Prizes 2021: nominations due Message-ID: ============================================================================ Dahl-Nygaard Prizes 2021: nominations due ============================================================================ In 2004, AITO established an annual prize in the name of Ole-Johan Dahl and Kristen Nygaard to honour their pioneering work on object-orientation. Now is the time to nominate deserving candidates for the Dahl-Nygaard prizes 2021. The deadline for nomination is May 24th and the nomination process requires only that you fill out this simple form: https://forms.gle/5uRF4wa9xAuyW8C58 The statutes for the prizes can be found at http://www.aito.org/Dahl-Nygaard/statutes.html though please note that due to COVID-19 the dates for 2021 are different this year. If you have any questions, please contact the Chair: Elena Zucca > =================================== Elena Zucca DIBRIS, Univ. di Genova via Dodecaneso 35, 16146 Genova, ITALY email: elena.zucca at unige.it phone: +39-010-353 6730 =================================== -------------- next part -------------- An HTML attachment was scrubbed... URL: From msantolu at barnard.edu Fri May 7 14:30:06 2021 From: msantolu at barnard.edu (Mark Santolucito) Date: Fri, 7 May 2021 14:30:06 -0400 Subject: [TYPES/announce] Call for Presentations: CONFLANG Message-ID: Call for Presentations: CONFLANG is a new workshop on the design, the usage and the tooling of configuration languages. CONFLANG aims at uniting language designers, industry practitioners and passionate hobbyists to share knowledge in any form. Topics of interest include, but are not limited to: - Infrastructure and configuration code maintenance and evolution - Specification learning and mining for configurations - Infrastructure and Configuration testing and verification - Infrastructure as Code and configuration repair - New languages for configuration - The application of language security and type theory to program configuration The committee welcomes proposals for presentations: - Traditional talks on any theoretical or practical aspect of the usage, the tooling and the design of configuration languages - Experience and case study talks on the real world usage and deployment of configuration languages - Explorative talks and/or demos on experimenting with configuration languages and related tools Submission Deadline Fri 6 Aug 2021 https://2021.splashcon.org/home/conflang-2021#submission-guidelines Please submit an abstract (up to 600 words, excluding title, author names, and bibliography) of your proposed talk using the submission link provided below. - Format: 600 words maximum abstract (estimated between 1 and 1,5 pages) as a PDF, excluding title, author names, and bibliography. Any additional material will be considered at the discretion of the PC. - URL : https://conflang21.hotcrp.com/ https://2021.splashcon.org/home/conflang-2021#venue While in-person presentations make sharing and interacting easier, please note that remote presentations are also considered due to the current health context. -------------- next part -------------- An HTML attachment was scrubbed... URL: From Jesper at sikanda.be Sat May 8 06:44:58 2021 From: Jesper at sikanda.be (Jesper Cockx) Date: Sat, 8 May 2021 12:44:58 +0200 Subject: [TYPES/announce] Agda Implementors' Meeting XXXIV: Call for talks and participation Message-ID: The thirty-fourth Agda Implementors' Meeting will take place online from Monday 2021-06-07 to Saturday 2021-06-12. The meeting will be organized in a similar way to AIM XXXIII, but the program is spread over a single week instead of two. See the wiki for details: https://wiki.portal.chalmers.se/agda/Main/AIMXXXIV You can register by editing the wiki page and adding your name. Alternatively, you can register by sending me an email with your name, affiliation, and time zone. Please also send me an email if you would like to give a talk, preferably before 2021-05-31. Best regards, Jesper Cockx -------------- next part -------------- An HTML attachment was scrubbed... URL: From benedikt.ahrens at gmail.com Wed May 5 04:10:43 2021 From: benedikt.ahrens at gmail.com (Benedikt Ahrens) Date: Wed, 5 May 2021 10:10:43 +0200 Subject: [TYPES/announce] 2nd Call for Contributions: (Virtual) Workshop on Homotopy Type Theory and Univalent Foundations (HoTT/UF'21) on July 17-18, 2021 Message-ID: <5c96ef31-5028-f3d1-8dab-30249ac3be65@gmail.com> This is the Second Call for Contributions for the (Virtual) Workshop on Homotopy Type Theory and Univalent Foundations July 17-18, 2021, The Internet @ Buenos Aires, Argentina https://hott-uf.github.io/2021/ Co-located with FSCD 2021 https://fscd2021.dc.uba.ar/ Abstract submission deadline: May 25, 2021 Homotopy Type Theory is a young area of logic, combining ideas from several established fields: the use of dependent type theory as a foundation for mathematics, inspired by ideas and tools from abstract homotopy theory. Univalent Foundations are foundations of mathematics based on the homotopical interpretation of type theory. The goal of this workshop is to bring together researchers interested in all aspects of Homotopy Type Theory and Univalent Foundations: from the study of syntax and semantics of type theory to practical formalization in proof assistants based on univalent type theory. # Invited talks * Evan Cavallo (Carnegie Mellon University) * Peter LeFanu Lumsdaine (Stockholm University) * Anja Petkovic (University of Ljubljana) * Matthew Weaver (Princeton University) # Submissions * Abstract submission deadline: May 25, 2021 * Author notification: mid-June 2021 Submissions should consist of a title and an abstract, in pdf format, of no more than 2 pages, submitted via http://easychair.org/conferences/?conf=hottuf2021 Considering the broad background of the expected audience, we encourage authors to include information of pedagogical value in their abstract, such as motivation and context of their work. # Program committee * Benedikt Ahrens (University of Birmingham) * Carlo Angiuli (Carnegie Mellon University) * Paolo Capriotti (Technische Universit?t Darmstadt) * Floris van Doorn (University of Pittsburgh) * Favonia (University of Minnesota) * Eric Finster (University of Cambridge) * Chris Kapulkin (University of Western Ontario) * Paige Randall North (University of Pennsylvania) * Emily Riehl (Johns Hopkins University) * Christian Sattler (Chalmers University of Technology) * Andrew Swan (Carnegie Mellon University) # Organizers * Benedikt Ahrens (University of Birmingham) * Chris Kapulkin (University of Western Ontario) From nipkow at in.tum.de Mon May 10 05:56:35 2021 From: nipkow at in.tum.de (Tobias Nipkow) Date: Mon, 10 May 2021 11:56:35 +0200 Subject: [TYPES/announce] New book: Functional Algorithms, Verified! Message-ID: <2195c7ce-cf0d-1077-bad5-1dd1165dd7e9@in.tum.de> Functional Algorithms, Verified! http://functional-algorithms-verified.org/ This book is an introduction to data structures and algorithms for functional languages, with a focus on proofs. It covers both functional correctness and running time analysis. It does so in a unified manner with inductive proofs about functional programs and their running time functions. All proofs have been machine-checked by the proof assistant Isabelle. Enjoy! Tobias -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 5579 bytes Desc: S/MIME Cryptographic Signature URL: From bruno.bernardo at tutanota.com Mon May 10 07:26:21 2021 From: bruno.bernardo at tutanota.com (Bruno Bernardo) Date: Mon, 10 May 2021 13:26:21 +0200 (CEST) Subject: [TYPES/announce] FMBC 2021 - Final Call for Papers (Deadline extension) Message-ID: [ Please distribute, apologies for multiple postings. ] ======================================================================== 3rd International Workshop on Formal Methods for Blockchains (FMBC) - Final Call https://fmbc.gitlab.io/2021 July 18 or 19 (TBA), 2021, *online* Co-located with the 33nd International Conference on Computer-Aided Verification (CAV 2021) http://i-cav.org/2021/ ------------------------------------------------------------- IMPORTANT DATES -------------------------------- Abstract submission: May 16, 2021 (extended) Paper submission: May 23, 2021 (extended) Notification: June 30, 2021 (extended) Camera-ready: July 14, 2021 (extended) Workshop: July 18 or 19 (TBA), 2021 Deadlines are Anywhere on Earth: https://en.wikipedia.org/wiki/Anywhere_on_Earth -------------------------------- -------------------------------- TOPICS OF INTEREST -------------------------------- Blockchains are decentralized transactional ledgers that rely on cryptographic hash functions for guaranteeing the integrity of the stored data. Participants on the network reach agreement on what valid transactions are through consensus algorithms. Blockchains may also provide support for Smart Contracts. Smart Contracts are scripts of an ad-hoc programming language that are stored in the Blockchain and that run on the network. They can interact with the ledger?s data and update its state. These scripts can express the logic of possibly complex contracts between users of the Blockchain. Thus, Smart Contracts can facilitate the economic activity of Blockchain participants. With the emergence and increasing popularity of cryptocurrencies such as Bitcoin and Ethereum, it is now of utmost importance to have strong guarantees of the behavior of Blockchain software. These guarantees can be brought by using Formal Methods. Indeed, Blockchain software encompasses many topics of computer science where using Formal Methods techniques and tools are relevant: consensus algorithms to ensure the liveness and the security of the data on the chain, programming languages specifically designed to write Smart Contracts, cryptographic protocols, such as zero-knowledge proofs, used to ensure privacy, etc. This workshop is a forum to identify theoretical and practical approaches of formal methods for Blockchain technology. Topics include, but are not limited to: * Formal models of Blockchain applications or concepts * Formal methods for consensus protocols * Formal methods for Blockchain-specific cryptographic primitives or protocols * Design and implementation of Smart Contract languages * Verification of Smart Contracts -------------------------------- -------------------------------- SUBMISSION -------------------------------- Submit original manuscripts (not published or considered elsewhere) with a page limit of 12 pages for full papers and 6 pages for short papers (excluding bibliography and short appendix of up to 5 additional pages). Alternatively you may also submit an extended abstract of up to 3 pages (including bibliography) summarizing your ongoing work in the area of formal methods and blockchain. Authors of selected extended-abstracts are invited to give a short lightning talk. Submission link: https://easychair.org/conferences/?conf=fmbc2021 Authors are encouraged to use LaTeX and prepare their submissions according to the instructions and styling guides for OASIcs provided by Dagstuhl. Instructions for authors: https://submission.dagstuhl.de/documentation/authors#oasics At least one author of an accepted paper is expected to present the paper at the workshop as a registered participant. -------------------------------- -------------------------------- PROCEEDINGS -------------------------------- All submissions will be peer-reviewed by at least three members of the program committee for quality and relevance. Accepted regular papers (full and short papers) will be included in the workshop proceedings, published as a volume of the OpenAccess Series in Informatics (OASIcs) by Dagstuhl. -------------------------------- -------------------------------- INVITED SPEAKER -------------------------------- David Dill, Lead Researcher, Blockchain, Novi/Facebook, USA https://research.fb.com/people/dill-david/ -------------------------------- -------------------------------- PROGRAM COMMITTEE -------------------------------- PC CO-CHAIRS * Bruno Bernardo (Nomadic Labs, France) (bruno at nomadic-labs.com) * Diego Marmsoler (University of Exeter, UK) (D.Marmsoler at exeter.ac.uk) PC MEMBERS * Wolfgang Ahrendt (Chalmers University of Technology, Sweden) * Lacramioara Astefanoei (Nomadic Labs, France) * Massimo Bartoletti (University of Cagliari, Italy) * Joachim Breitner (Dfinity Foundation, Germany) * Achim Brucker (University of Exeter, UK) * Zaynah Dargaye (Nomadic Labs, France) * J?r?mie Decouchant (TU Delft, Netherlands) * Dana Drachsler Cohen (Technion, Israel) * Ansgar Fehnker (University of Twente, Netherlands) * Maurice Herlihy (Brown University, USA) * Lars Hupel (INNOQ, Germany) * Florian Kammueller (Middlesex University London, UK) * Igor Konnov (Informal Systems, Austria) * Andreas Lochbihler (Digital Asset, Switzerland) * Sim?o Melo de Sousa (Universidade da Beira Interior, Portugal) * Karl Palmskog (KTH, Sweden) * Maria Potop-Butucaru (Sorbonne Universit?, France) * Andreas Rossberg (Dfinity Foundation, Germany) * Albert Rubio (Complutense University of Madrid, Spain) * C?sar Sanchez (Imdea, Spain) * Clara Schneidewind (TU Wien, Austria) * Ilya Sergey (Yale-NUS College/NUS, Singapore) * Mark Staples (CSIRO Data61, Australia) * Meng Sun (Peking University, China) * Simon Thompson (University of Kent, UK) * Josef Widder (Informal Systems, Austria) From b.dongol at surrey.ac.uk Thu May 6 06:47:07 2021 From: b.dongol at surrey.ac.uk (Brijesh Dongol) Date: Thu, 6 May 2021 11:47:07 +0100 Subject: [TYPES/announce] Postdoctoral Position in Verified Security Message-ID: Applications are invited for a 3-year postdoctoral position on *Verifiably Correct Swarm Attestation* ( https://gow.epsrc.ukri.org/NGBOViewGrant.aspx?GrantRef=EP/V038915/1) funded by the EPSRC. We are interested in the design, implementation and formal verification of attestation protocols operating over distributed systems of devices. We aim to take into account hardware and network characteristics with proofs that are supported by mechanisation using associated theorem proving and/or model checking tools. The project brings together multidisciplinary themes covering the National Cyber Security Centre (NCSC) Research Institutes, and is in collaboration with industry partners Thales and Arm as well as research labs at SRI (USA) and NTU (Singapore). Applicants must have, or be expected to shortly obtain, a PhD in Computer Science or a cognate discipline, with expertise in security, formal verification, distributed systems, programming languages, or computer architecture. Application deadline: 31st May, 2021 Further information and application submission via https://jobs.surrey.ac.uk/Vacancy.aspx?id=8905 For informal enquiries and further information please contact me on b.dongol at surrey.ac.uk. Best wishes, Brijesh -------------- next part -------------- An HTML attachment was scrubbed... URL: From songfu1983 at shanghaitech.edu.cn Fri May 7 08:14:44 2021 From: songfu1983 at shanghaitech.edu.cn (songfu1983 at shanghaitech.edu.cn) Date: Fri, 7 May 2021 20:14:44 +0800 Subject: [TYPES/announce] SETTA 2021: 2nd CFP updated with a special issue for STTT Message-ID: <202105072014439781598@shanghaitech.edu.cn> (apologies for cross-posting) ======================================== SETTA 2021: Symposium on Dependable Software Engineering: Theories, Tools and Applications Institute of Software, Chinese Academy of Sciences, Beijing, China, November 25-27, 2021 Submission deadline: July 23rd, 2021 Conference website: https://lcs.ios.ac.cn/setta2021/ Colocated with FM'2021 ======================================== ************************ ABOUT SETTA 2021 ************************ The Symposium on Dependable Software Engineering: Theories, Tools and Applications (SETTA) 2021 will be held in Beijing, China on November 25-27, 2021, co-located with FM'2021. Formal methods emerged as an important area in computer science and software engineering about half a century ago. An international community is formed researching, developing and teaching formal theories, techniques and tools for software modeling, specification, design and verification. However, the impact of formal methods on the quality improvement of software systems in practice is lagging behind. This is for instance reflected by the challenges in applying formal techniques and tools to engineering large-scale systems such as Cyber-Physical Systems (CPS), Internet-of-Things (IoT), Enterprise Systems, Cloud-Based Systems, and so forth. The purpose of the SETTA symposium is to bring international researchers together to exchange research results and ideas on bridging the gap between formal methods and software engineering. The interaction with the Chinese computer science and software engineering community is a central focus point. The aim is to show research interests and results from different groups so as to initiate interest-driven research collaboration. The SETTA symposium is aiming at academic excellence and its objective is to become a flagship conference on formal software engineering in China. To achieve these goals and contribute to the sustainability of the formal methods research, it is important for the symposium to attract young researchers into the community. Thus, this symposium encourages in particular the participation of young researchers and students. This year, SETTA welcomes submissions to the following two tracks: Journal First Papers and Research Papers. All submissions must be in the PDF format. Papers should be written in English. Submitted papers must be unpublished and not submitted for publication elsewhere. Accepted papers for both tracks must be presented at the conference. Latest News: Special issues for the Elsevier Journal of Systems Architecture (JSA) and the International Journal on Software Tools for Technology Transfer (STTT) have been confirmed. Authors of selected papers from SETTA2021 will be invited to submit an extended version of their SETTA2021 paper to one of these special issues. ************************ LIST OF TOPICS ************************ Topics of interest include, but are not limited to: - Requirements specification and analysis - Formalisms for modeling, design and implementation - Model checking, theorem proving, and decision procedures - Scalable approaches to formal system analysis - Formal approaches to simulation, run-time verification, and testing - Integration of formal methods into software engineering practice - Contract-based engineering of components, systems, and systems of systems - Formal and engineering aspects of software evolution and maintenance - Parallel and multicore programming - Embedded, real-time, hybrid, probabilistic, and cyber-physical systems - Mixed-critical applications and systems - Formal aspects of service-oriented and cloud computing - Safety, reliability, robustness, and fault-tolerance - Dependability of smart software and systems - Empirical analysis techniques and integration with formal methods - Applications and industrial experience reports - Software tools to assist the construction or analysis of software systems ************************ RESEARCH PAPERS TRACK ************************ Research papers will be published in the SETTA 2021 proceedings as a volume in Springer's LNCS series. Papers should be submitted electronically through the EasyChair submission web page . ------------------------ Important Dates ------------------------ Abstract & Paper Submission: July 23, 2021 (AoE) Notification to authors: September 3, 2021 (AoE) Camera-ready versions: September 20, 2021 (AoE) Conference date: November 25-27, 2021 ------------------------ Submission Guidelines ------------------------ Authors are invited to submit papers on original research, industrial applications, or position papers proposing challenges in fundamental research and technology. The latter two types of submissions are expected to contribute to the development of formal methods and applications thereof in software engineering. This is done by either substantiating the advantages of integrating formal methods into the development cycle or through delineating the need for research by demonstrating weaknesses of existing technologies, especially when addressing new application domains. Submissions can take the form of either regular or short papers. Regular papers should not exceed 16 pages (excluding references) in LNCS format. Short papers can discuss ongoing research at an early stage, including PhD projects. Short papers should not exceed 6 pages (excluding references) in LNCS format. ************************ JOURNAL FIRST PAPERS TRACK ************************ The journal first papers track of SETTA 2021 is implemented in partnership with the Journal of Computer Science and Technology (JCST). Accepted papers to this track will be presented and discussed at the conference SETTA 2021. Papers should be submitted electronically through the journal's submission web page . ------------------------ Important Dates ------------------------ Paper Submission: May 31, 2021 (AoE) Tentative acceptance decision: July 16, 2021 (AoE) Acceptance decision: August 30, 2021 (AoE) Conference date: November 25-27, 2020 ------------------------ Submission Guidelines ------------------------ To submit to this track, authors have to make a journal submission to the Journal of Computer Science and Technology, and select the type of submission to be for the SETTA 2021 special issue. It is recommended that submitted papers follow the submission guidelines of JCST and do not exceed 15 pages including references. ************************ COMMITTEES ************************ General Chair: - Chen Zhao, Institute of Software, Chinese Academy of Sciences Program Chair: - Shengchao Qin, Teesside University - Jim Woodcock, University of York - Wenhui Zhang, Institute of Software, Chinese Academy of Sciences Local Organisation Chair: - Zhilin Wu, Institute of Software, Chinese Academy of Sciences Publicity Chair: - Fu Song, ShanghaiTech University Program Committee Members: - Yamine Ait-Ameur (IRIT/INPT-ENSEEIHT) - Richard Banach (The University of Manchester) - Lei Bu (Nanjing University) - Milan Ceska (Brno University of Technology) - Sudipta Chattopadhyay (Singapore University of Technology and Design) - Liqian Chen (National University of Defense Technology) - Yu-Fang Chen (Academia Sinica) - Alessandro Cimatti (Fondazione Bruno Kessler) - Florin Craciun (Babes-Bolyai University) - Yuxin Deng (East China Normal University) - Wei Dong (National University of Defense Technology) - Hongfei Fu (Shanghai Jiao Tong University) - Jan Friso Groote (Eindhoven University of Technology) - Nan Guan (The Hong Kong Polytechnic University) - Dimitar Guelev (Bulgarian Academy of Sciences) - Thai Son Hoang (University of Southampton) - Chao Huang (University of Liverpool, Northwestern University) - Yu Jiang (Tsinghua University) - Sebastian Junges (University of California, Berkeley) - Guoqiang Li (Shanghai Jiao Tong University) - Yi Li (Nanyang Technological University) - Zhiming Liu (Southwest University) - Yang Liu (Nanyang Technological University) - Tiziana Margaria (Lero) - Dominique Mery (Universite de Lorraine, LORIA) - Stefan Mitsch (Carnegie Mellon University) - Jun Pang (University of Luxembourg) - Dave Parker (University of Birmingham) - Yu Pei (HK Polytechnic University) - Shengchao Qin (Teesside University) - Mickael Randour (F.R.S.-FNRS & Universite de Mons) - Stefan Schupp (TU Wien) - Zhiping Shi (Beijing Eng. Research Center of High Reliable Embbeded Systems) - Fu Song (ShanghaiTech University) - Jeremy Sproston (University of Turin) - Ting Su (East China Normal University) - Jun Sun (Singapore Management University) - Meng Sun (Peking University) - Andrea Turrini (Institute of Software, CAS) - Tarmo Uustalu (Reykjavik University) - Jaco van de Pol (Aarhus University) - Jim Woodcock (University of York) - Xiaofei Xie (Kyushu University) - Zhiwu Xu (Shenzhen University) - Bai Xue (Institute of Software, CAS) - Chenyi Zhang (Jinan University) - Wenhui Zhang (Institute of Software, CAS) ************************ VENUE ************************ The conference will be held in Beijing, China. ************************ CONTACT ************************ All questions about submissions should be emailed to setta2021 at easy*chair.org (remove *). -------------- next part -------------- An HTML attachment was scrubbed... URL: From nick.hu at cs.ox.ac.uk Sat May 8 15:34:14 2021 From: nick.hu at cs.ox.ac.uk (Nick Hu) Date: Sat, 8 May 2021 20:34:14 +0100 Subject: [TYPES/announce] ** DEADLINE EXTENSION ** FINAL CALL FOR PAPERS -- APPLIED CATEGORY THEORY 2021, CAMBRIDGE UK, JULY 12-16 -- HYBRID CONFERENCE Message-ID: FINAL CALL FOR PAPERS Fourth Annual International Conference on Applied Category Theory (ACT 2021) 12 - 16 July, 2021, Cambridge, United Kingdom (and online) https://www.cl.cam.ac.uk/events/act2021 * * * <<< DEADLINE EXTENSION: Due to popular demand, the submission deadline has been extended to Wednesday 12 May. >>> <<< UPDATE: Our plans to run ACT 2021 as one of the first physical conferences post-lockdown are progressing well. Consider joining us in person in Cambridge! We also have financial support available for students and junior researchers. >>> The Fourth International Conference on Applied Category Theory will take place at the Computer Laboratory of the University of Cambridge on 12-16 July, 2021, preceded by the Adjoint School 2021 on 5-9 July. This conference follows previous events at MIT, Oxford and Leiden. Applied category theory is a topic of interest for a growing community of researchers, interested in studying many different kinds of systems using category-theoretic tools. These systems are found across computer science, mathematics, and physics, as well as in social science, linguistics, cognition, and neuroscience. The background and experience of our members is as varied as the systems being studied. The goal of the Applied Category Theory conference series is to bring researchers together, disseminate the latest results, and facilitate further development of the field. We accept submissions of both original research papers, and work accepted/submitted/ published elsewhere. Accepted original research papers will be invited for publication in a proceedings volume. The keynote addresses will be drawn from the best accepted papers. The conference will include an industry showcase event. We hope to run the conference as a hybrid event, with physical attendees present in Cambridge, and other participants taking part online. However, due to the state of the pandemic, the possibility of in-person attendance is not yet confirmed. Please do not book your travel or hotel accommodation yet. ** FINANCIAL SUPPORT ** We are able to offer financial support to PhD students and junior researchers. Full guidance is on the webpage. ** IMPORTANT DATES (all in 2021) ** - Submission Deadline: Wednesday 12 May (previously Monday 10 May) - Author Notification: Monday 7 June - Financial Support Application Deadline: Monday 7 June - Financial Support Notification: Tuesday 8 June - Priority Physical Registration Opens: Wednesday 9 June - Ordinary Physical Registration Opens: Monday 13 June - Reserved Accommodation Booking Deadline: Monday 13 June - Adjoint School: Monday 5 to Friday 9 July - Main Conference: Monday 12 to Friday 16 July ** SUBMISSIONS ** The following two types of submissions are accepted: - Proceedings Track. Original contributions of high-quality work consisting of an extended summary, up to 12 pages excluding bibliography, that provides evidence of results of genuine interest, and with enough detail to allow the program committee to assess the merits of the work. Full proofs of mathematical statements are not necessarily required. Accepted submissions in this track will be invited for publication in a proceedings volume. Additional appendices beyond the page limit are permitted but may not be read by reviewers, and will not be included in the proceedings. - Non-Proceedings Track. Submissions presenting high-quality work submitted or published elsewhere, or for which publication in the proceedings is not desired by the authors, may be submitted to this track, provided the work is recent and relevant to the conference. The work may be of any length, but the program committee members may only look at the first 3 pages of the submission, so you should ensure that these pages contain sufficient evidence of the quality and rigour of your work. Papers in the two tracks will be reviewed against the same standards of quality. Since ACT is an interdisciplinary conference, we use two tracks to accommodate the publishing conventions of different disciplines. For example, those from a Computer Science background may prefer the Proceedings Track, while those from a Mathematics, Physics or other background may prefer the Non-Proceedings Track. However, authors from any background are free to choose the track that they prefer, and submissions may be moved from the Proceedings Track to the Non-Proceedings Track at any time at the request of the authors. Contributions must be submitted in PDF format. Submissions to the Proceedings Track must be prepared with LaTeX, using the EPTCS style files available at . The submission link will soon be available on the ACT2021 web page: ** PROGRAMME COMMITTEE ** Chair: - Kohei Kishida, University of Illinois, Urbana-Champaign Members: - Richard Blute, University of Ottawa - Spencer Breiner, NIST - Daniel Cicala, University of New Haven - Robin Cockett, University of Calgary - Bob Coecke, Cambridge Quantum Computing - Geoffrey Cruttwell, Mount Allison University - Valeria de Paiva, Samsung Research America and University of Birmingham - Brendan Fong, Massachusetts Institute of Technology - Jonas Frey, Carnegie Mellon University - Tobias Fritz, Perimeter Institute for Theoretical Physics - Fabrizio Romano Genovese, Statebox - Helle Hvid Hansen, University of Groningen - Jules Hedges, University of Strathclyde - Chris Heunen, University of Edinburgh - Alex Hoffnung, Bridgewater - Martti Karvonen, University of Ottawa - Kohei Kishida, University of Illinois, Urbana-Champaign (chair) - Martha Lewis, University of Bristol - Bert Lindenhovius, Johannes Kepler University Linz - Ben MacAdam, University of Calgary - Dan Marsden, University of Oxford - Jade Master, University of California, Riverside - Joe Moeller, NIST - Koko Muroya, Kyoto University - Simona Paoli, University of Leicester - Daniela Petrisan, Universit? de Paris, IRIF - Mehrnoosh Sadrzadeh, University College London - Peter Selinger, Dalhousie University - Michael Shulman, University of San Diego - David Spivak, MIT and Topos Institute - Joshua Tan, University of Oxford - Dmitry Vagner - Jamie Vicary, University of Cambridge - John van de Wetering, Radboud University Nijmegen - Vladimir Zamdzhiev, Inria, LORIA, Universit? de Lorraine - Maaike Zwart -------------- next part -------------- An HTML attachment was scrubbed... URL: From christian.retore at lirmm.fr Sun May 9 16:01:27 2021 From: christian.retore at lirmm.fr (=?utf-8?Q?Christian_Retor=C3=A9?=) Date: Sun, 9 May 2021 22:01:27 +0200 Subject: [TYPES/announce] Trends in linear logic and applications. Abstract: dealing may 13 Message-ID: ? ? ============================================================== Call for Papers TLLA 2021 5th International Workshop on Trends in Linear Logic and Applications Extended deadline: May 13, 2021 Rome, 27-28 June 2021 Affiliated with ACM/IEEE LICS https://lipn.univ-paris13.fr/TLLA/2021/ ============================================================== Linear Logic is not only a proof theoretical tool to analyze or control the use of resources in logic and computation. It is also a corpus of tools, approaches, and methodologies (proof nets, exponential decomposition, geometry of interaction, coherent spaces, relational models, etc.) that, even if developed for studying Linear Logic syntax and semantics, have been applied in several other fields (analysis of lambda-calculus computations, game semantics, computational complexity, program verification, etc.). The TLLA international workshop aims at bringing together researchers working on Linear Logic or applying it or its tools. The main goal is to present and discuss trends in the research on Linear Logic and its applications by means of tutorials, invited talks, open discussions, and contributed talks. The purpose is to gather researchers interested in the connections between Linear Logic and various topics such as * theory of programming languages * implicit computational complexity * parallelism and concurrency * games and languages * proof theory * philosophy * categories and algebra * possible connections with combinatorics * linguistics * functional analysis and operator algebras ---------------------------------------------------------------------- ** Submission Guidelines ---------------------------------------------------------------------- Contributions are not restricted to talks presenting an original results, but open to tutorials, open discussions, and position papers. For this reason, we strongly encourage contributions presenting work in progress, open questions, and research projects. Contributions presenting the application of linear logic results, techniques, or tools to other fields, or vice versa, are most welcome. To propose a contributed talk submit a short abstract whose length is between 2 and 5 pages on https://easychair.org/conferences/?conf=tlla2021 ---------------------------------------------------------------------- ** Important dates ---------------------------------------------------------------------- * Submission deadline: 13 May 2021 (extended) * Notification to authors: 20 May 2021 (extended) * Final versions due: 31 May 2021 (extended) * Workshop date: 27-28 June 2021 ---------------------------------------------------------------------- ** Publication ---------------------------------------------------------------------- The abstracts of the contributed and invited talks will be published on the site of the conference. Possible other formats will be discussed at the workshop. ---------------------------------------------------------------------- ** Tutorials ---------------------------------------------------------------------- * Proof nets, Lionel Vaux - Universit? d?Aix-Marseille * Combinatorial proofs and Deep Inference, Matteo Acclavio - Universit? du Luxembourg ---------------------------------------------------------------------- ** Invited Speakers ---------------------------------------------------------------------- * Marie Kerjean, CNRS - Universit? Sorbonne Paris Nord, France * Willem Heijltjes, University of Bath, UK * Beniamino Accattoli, Inria, France ---------------------------------------------------------------------- ** Evening Lecture ---------------------------------------------------------------------- * Vito Michele Abrusci (Universit? di Roma tre) ---------------------------------------------------------------------- ** Program Committee ---------------------------------------------------------------------- * Claudia Faggian, CNRS - Universit? Paris Diderot, France * Giulio Guerrieri, University of Bath, UK * Naohiko Hoshino, Sojo University, Japan * Sonia Marin, University College London, UK * Elaine Pimentel, Federal University of Rio Grande do Norte, Brazil (co-chair) * Paolo Pistone, Universit? di Bologna, Italy * Myriam Quatrini, Universit? de la M?diterran?e * Christian Retor?, Universit? de Montpellier, France (co-chair) * Thomas Seiller, CNRS - Universit? Sorbonne Paris Nord, France * Lutz Strassburger, Inria Saclay, France ---------------------------------------------------------------------- ** Organization Committee ---------------------------------------------------------------------- * Thomas Ehrhard, CNRS - University Paris Diderot, France * Stefano Guerrini, CNRS - University Sorbonne Paris Nord, France * Lorenzo Tortora de Falco, University Roma Tre, Italy ---------------------------------------------------------------------- ** Proceedings ---------------------------------------------------------------------- Abstracts will be published as an online volume with an official bibliographic reference. . Later on there will be a volume of selected papers (book or journal special issue). . ---------------------------------------------------------------------- ** Contact ---------------------------------------------------------------------- All questions about submissions should be emailed to the PC chairs at elaine.pimentel at gmail.com or christian.retore at umontpellier.fr -- Christian Retor? http://www.lirmm.fr/~retore (via iPhone) -------------- next part -------------- An HTML attachment was scrubbed... URL: From gsilvia at uns.ac.rs Mon May 10 06:20:25 2021 From: gsilvia at uns.ac.rs (Silvia Ghilezan) Date: Mon, 10 May 2021 12:20:25 +0200 Subject: [TYPES/announce] PPDP 2021 deadline extension Message-ID: =========================== PPDP 2021 Deadline extension =========================== 23rd International Symposium on Principles and Practice of Declarative Programming 6?8 September 2021, Tallinn, Estonia http://imft.ftn.uns.ac.rs/PPDP2021 Collocated with LOPSTR 2021 http://cs.ioc.ee/ppdp-lopstr21/ =================================== *** PPDP 2021 will be held as a hybrid meeting, both in-person and virtual*** Important Dates --------------------- - ***18.05.2021 title and abstract submission (extended) - ***25.05.2021 paper submission (extended) - 29.06.2021 rebuttal period (48 hours) - 09.07.2021 notification - 23.07.2021 final paper - 06.09.2021 conference starts About PPDP ---------- The PPDP 2021 symposium brings together researchers from the declarative programming communities, including those working in the functional, logic, answer-set, and constraint handling programming paradigms. The goal is to stimulate research in the use of logical formalisms and methods for analyzing, performing, specifying, and reasoning about computations, including mechanisms for concurrency, security, static analysis, and verification. Scope ----- Submissions are invited on all topics related to declarative programming, from principles to practice, from foundations to applications. Topics of interest include, but are not limited to - Language Design: domain-specific languages; interoperability; concurrency, parallelism and distribution; modules; functional languages; reactive languages; languages with objects; languages for quantum computing; languages inspired by biological and chemical computation; metaprogramming. - Declarative languages in artificial intelligence: logic programming; database languages; knowledge representation languages; probabilistic languages; differentiable languages. - Implementations: abstract machines; interpreters; compilation; compile-time and run-time optimization; memory management. - Foundations: types; logical frameworks; monads and effects; semantics. - Analysis and Transformation: partial evaluation; abstract interpretation; control flow; data flow; information flow; termination analysis; resource analysis; type inference and type checking; verification; validation; debugging; testing. - Tools and Applications: programming and proof environments; verification tools; case studies in proof assistants or interactive theorem provers; certification; novel applications of declarative programming inside and outside of CS; declarative programming pearls; practical experience reports and industrial application; education. The PC chair will be happy to advise on the appropriateness of a topic. Submission web page --------------------- https://easychair.org/conferences/?conf=ppdp2021 Submission Categories --------------------- Submissions can be made in three categories: - Research Papers, - System Descriptions, - Experience Reports. Submissions of Research Papers must present original research which is unpublished and not submitted elsewhere. They must not exceed 12 pages ACM style 2-column (including figures, but excluding bibliography). Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Research papers will be judged on originality, significance, correctness, clarity, and readability. Submission of System Descriptions must describe a working system whose description has not been published or submitted elsewhere. They must not exceed 10 pages and should contain a link to a working system. System Descriptions must be marked as such at the time of submission and will be judged on originality, significance, usefulness, clarity, and readability. Submissions of Experience Reports are meant to help create a body of published, refereed, citable evidence where declarative programming such as functional, logic, answer-set, constraint programming, etc., is used in practice. They must not exceed 5 pages **including references**. Experience Reports must be marked as such at the time of submission and need not report original research results. They will be judged on significance, usefulness, clarity, and readability. Supplementary material may be provided via a link to an extended version of the submission (recommended), or in a clearly marked appendix beyond the above-mentioned page limits. Reviewers are not required to study extended versions or any material beyond the respective page limit. Formating Guidelines ---------------------------- We plan to use the same publication arrangements as PPDP has had in previous years. For each paper category, you must use the most recent version of the "Current ACM Master Template" which is available at >. The most recent version at the time of writing is 1.75. You must use the LaTeX sigconf proceedings template as the conference organizers are unable to process final submissions in other formats. In case of problems with the templates, contact ACM's TeX support team at Aptara >. Authors should note ACM's statement on author's rights (http://authors.acm.org/ ) which apply to final papers. Submitted papers should meet the requirements of ACM's plagiarism policy (http://www.acm.org/publications/policies/plagiarism_policy ). Requirements for Publication ---------------------------- At least one author of each accepted submission will be expected to attend and present the work at the conference. The PC chair may retract a paper that is not presented. The PC chair may also retract a paper if complaints about the paper's correctness are raised which cannot be resolved by the final paper deadline. Program Committee ----------------------------- Zena Ariola, University of Oregon, USA Nick Benton, Facebook, UK Ma?gorzata Biernacka, University of Wroclaw, Poland James Cheney, The University of Edinburgh, UK Stefania Dumbrava, ENSIIE Paris-Evry, France Silvia Ghilezan, University of Novi Sad & Mathematical Institute SASA, Serbia Hugo Herbelin, INRIA, France Cosimo Laneve, University of Bologna, Italy Pierre Lescanne, ENS de Lyon, France Ugo de?Liguoro, University of Torino, Italy Francesca A. Lisi, University of Bari, Italy Yanhong Annie Liu, Stony Brook University, USA Elaine Pimentel, Federal University of Rio Grande do Norte, Brazil Yukiyoshi Kameyama, University of Tsukuba, Japan Petar Maksimovi?, Imperial College, London, UK Yutaka Nagashima, Yale-NUS College, Singapore & University of Innsbruck, Austria Aleksandar Nanevski, IMDEA Software Institute, Spain Vivek Nigam, fortiss GmbH, Germany & Federal University of Para?ba, Brazil Jorge A. P?rez, University of Groningen, The Netherlands Sanjiva Prasad, Indian Institute of Technology Delhi, India Alexis Saurin, CNRS, Universit? de Paris & INRIA , France Tom Schrijvers , KU Leuven, The Netherlands Paul Tarau, University of North Texas, USA Tarmo Uustalu, Reykjavik University, Island & Tallinn University of Technology, Estonia ------------------------- -------------------- --------------------- Program committee co-chair: Nick Benton, Facebook, UK Program committee co-chair: Silvia Ghilezan, University of Novi Sad & Mathematical Institute SASA, Serbia Organising committee chair: Niccol? Veltri, Tallinn University of Technology, Estonia Steering committee chair: James Cheney, Edinburgh University, UK ------------------------- -------------------- --------------------- All questions about submissions should be emailed to the program chair Silvia Ghilezan >. All questions about local information should be emailed to the local organiser Niccol? Veltri >. -------------- next part -------------- An HTML attachment was scrubbed... URL: From aart.middeldorp at uibk.ac.at Mon May 10 06:29:42 2021 From: aart.middeldorp at uibk.ac.at (Aart Middeldorp) Date: Mon, 10 May 2021 12:29:42 +0200 Subject: [TYPES/announce] postdoc position (6 years) in CL group in Innsbruck Message-ID: <3C027D67-AB3C-4213-96DB-6BE39F04849E@uibk.ac.at> 6 year postdoc position in computational logic ============================================== The University of Innsbruck invites applications for a 6 year postdoctoral position in the Computational Logic research group. Candidates must hold a PhD degree in computer science. A strong background in computational logic is required and knowledge of term rewriting is a welcome additional qualification. The ideal candidate enjoys working with students at all levels. Candidates are expected to conduct research leading to a habilitation and contribute to teaching and administration. Knowledge of German is not essential. The position is a full-time "B1/3 position" with teaching obligations of 4 hours per semester. The annual gross salary is approximately EUR 55,000. The official job advert (reference MIP-11910) appeared at https://lfuonline.uibk.ac.at/public/karriereportal.details?asg_id_in=11910 Applications (including CV, publication list, and two letters of recommendation) must be submitted electronically at https://lfuonline.uibk.ac.at/public/karriereportal.bewerben?page=w&a_id=11910 no later than 28 May 2021. The starting date for the position is 1 October 2021. Informal inquiries may be addressed to aart.middeldorp at uibk.ac.at The city of Innsbruck, which hosted the Olympic Winter Games in 1964 and 1976, is superbly located in the beautiful surroundings of the Tyrolean Alps. The combination of the Alpine environment and urban life in this historic town provides a high quality of living. Further information is available from the following links: Computational Logic: http://cl-informatik.uibk.ac.at/ Department of Computer Science: http://informatik.uibk.ac.at/ University of Innsbruck: http://www.uibk.ac.at/ City of Innsbruck: http://www.innsbruck.at/ From dario.dellamonica at uniud.it Fri May 7 05:23:13 2021 From: dario.dellamonica at uniud.it (Dario Della Monica) Date: Fri, 7 May 2021 11:23:13 +0200 Subject: [TYPES/announce] Overlay 2021: Call For Papers Message-ID: <5a228eb1-4d46-0560-5691-93c9507064e0@uniud.it> *** We apologize for possible cross posting *** *********** CALL FOR PAPER *********** OVERLAY 2021 September 22, 2021 Padova, Italy (unless held online, depending on the pandemic emergency situation) https://overlay.uniud.it/workshop/2021/ The increasing adoption of Artificial Intelligence techniques in safety-critical systems, employed in real world scenarios, requires the design of reliable, robust, and verifiable methodologies. Artificial Intelligence systems employed in such applications need to provide formal guarantees about their safety, increasing the need for a close interaction between the Artificial Intelligence and Formal Methods scientific communities. To witness this increasing need, tools and methodologies integrating Formal Methods and Artificial Intelligence solutions are getting more and more attention. The workshop is the main official initiative supported by the OVERLAY group (https://overlay.uniud.it/). The event aims at establishing a stable, long-term scientific forum on relevant topics connected to the relationships between Artificial Intelligence and Formal Methods, by providing a stimulating environment where researchers can discuss about opportunities and challenges at the border of the two areas. Important goals of the workshop are (i) to encourage the ongoing interaction between the formal methods and artificial intelligence communities, (ii) to identify innovative tools and methodologies, and (iii) to elicit a discussion on open issues and new challenges. This year edition will be held on September 22, 2021, and will be co-located with GandALF 2021 (https://gandalf2021.math.unipd.it/), which is scheduled to be held in Padova, Italy (unless it will be an online event, depending on the pandemic emergency situation). *** Invited speaker *** Roderick Bloem, professor at Institute of Applied Information Processing and Communications - Graz, Austria https://www.iaik.tugraz.at/person/roderick-bloem/ *** Call for contributions *** We accept extended abstracts (4 pages + references) focusing on the interaction between Artificial Intelligence and Formal Methods. Invited talks will complement the presentations of contributed papers. Topics of interest include (but are not limited to): ??? automata theory ??? automated reasoning ??? automated planning and scheduling ??? controller synthesis ??? formal specification languages ??? formal verification ??? game theory ??? hybrid and discrete systems ??? logics in computer science ??? reactive synthesis ??? runtime verification and monitoring ??? specification and verification of machine learning systems ??? tools and applications Contributed papers can present recent results at the border of the two fields, new research directions, challenges and perspectives. Presentation of results recently published in other scientific journals or conferences is also welcome. We plan on including all papers in the Proceedings of the event, published at CEUR Workshop Proceedings. CEUR WS proceedings are archival proceedings indexed by DBLP and Scopus. Submitted papers should not exceed four (4) pages plus references. Authors are asked to use CEUR's LaTeX style, available at http://ceur-ws.org/Vol-XXX/CEURART.zip. Submissions must be in PDF format and will be handled via the EasyChair Conference system at the following address: https://easychair.org/conferences/?conf=overlay21. *** Important dates *** - Paper submission: July 11th, 2021 - Acceptance notification: July 23rd, 2021 - Camera-ready submission: August 31st, 2021 - Workshop: September 22nd, 2021 *** COVID-19 Information *** Taking into account the emergency situation, the organizers of OVERLAY 2021 will closely monitor the evolution of the pandemic and will take all the necessary actions to guarantee a successful event. In the case that an in-person event will not be possible, OVERLAY 2021 will be a hybrid or fully virtual conference. Updates on the organization mode will be published and advertised in due time. In any case, OVERLAY 2021 will be a no-fee event. *** Program Committee *** Chairs Dario Della Monica - Universit? di Udine, Italy Gian Luca Pozzato - Universit? di Torino, Italy Enrico Scala - Universit? di Brescia, Italy PC Members Alessandro Artale - Libera Universit? di Bolzano Davide Bresolin - Universit? di Padova Luca Geatti - Universit? di Udine Nicola Gigante - Libera Universit? di Bolzano Laura Giordano - Universit? del Piemonte Orientale Ivan Lanese - Universit? di Bologna Federico Mari - Universit? di Roma Foro Italico Andrea Micheli - Fondazione Bruno Kessler Fabio Mogavero - Universit? di Napoli Federico II Laura Nenzi - Universit? di Trieste AndreA Orlandini - ISTC-CNR, Roma Gennaro Parlato - Universit? del Molise Adriano Peron - Universit? di Napoli Federico II Gabriele Puppis - Universit? di Udine Guido Sciavicco - Universit? di Ferrara Stefano Tonetta - Fondazione Bruno Kessler Enrico Tronci - Universit? di Roma La Sapienza Tiziano Villa - Universit? di Verona Enea Zaffanella - Universit? di Parma Matteo Zavatteri - Universit? di Verona *** Contacts *** For more information email overlay21 at easychair.org. -- Dario Della Monica, Assistant Professor (RTD-B, tenure track) Department of Mathematics, Computer Science, and Physics University of Udine via delle Scienze, 206 - 33100 Udine, Italy cell: (+39) 328 2477327 email: dario.dellamonica [at] uniud.it skype: dariodellamonica web site: http://users.dimi.uniud.it/~dario.dellamonica/ From mwwhalen at umn.edu Fri May 7 10:45:50 2021 From: mwwhalen at umn.edu (Michael Whalen) Date: Fri, 7 May 2021 09:45:50 -0500 Subject: [TYPES/announce] [Deadline Extension] FMCAD 2021 Call for Papers Message-ID: [One Week Deadline Extension. New dates are FIRM] Apologies for multiple postings. ************************************************** The Twenty First Formal Methods in Computer-Aided Design Conference https://fmcad.org/FMCAD21/. October 19-22, 2021 Yale University, Connecticut, USA ************************************************** The conference will be held in an in-person/virtual hybrid format at Yale University, USA, possibly transitioning to fully virtual depending on the COVID-19 situation. IMPORTANT DATES Abstract Submission: May 14, 2021 (May 7, 2021) Paper Submission: May 21, 2021. (May 14, 2021) Author Response: June 30- July 2, 2021 (June 23-25, 2021) Author Notification: July 9, 2021 (July 2, 2021) Camera-Ready Version: August 16, 2021 Early registration: September 15, 2021 All deadlines are 11:59 pm AoE (Anywhere on Earth) FMCAD Tutorial Day: Oct. 19, 2021 Regular Program: Oct. 20-22, 2021 Part of the FMCAD 2021 program: FMCAD Student Forum Co-located with FMCAD: VSTTE 2021 CONFERENCE SCOPE AND PUBLICATION FMCAD 2021 is the twenty-first in a series of conferences on the theory and applications of formal methods in hardware and system verification. FMCAD provides a leading forum to researchers in academia and industry for presenting and discussing groundbreaking methods, technologies, theoretical results, and tools for reasoning formally about computing systems. FMCAD covers formal aspects of computer-aided system design including verification, specification, synthesis, and testing. FMCAD employs a rigorous peer-review process. Accepted papers are published by TU Wien Academic Press under a Creative Commons license (the authors retain the copyright) and distributed through the IEEE XPlore digital library. There are no publication fees. At least one of the authors is required to register for the conference and present the accepted paper. A small number of outstanding FMCAD submissions will be considered for inclusion in a Special Issue of the journal on Formal Methods in System Design (FMSD). TOPICS OF INTEREST FMCAD welcomes submission of papers reporting original research on advances in all aspects of formal methods and their applications to computer- aided design. Topics of interest include (but are not limited to):* Model checking, theorem proving, equivalence checking, abstraction and reduction, compositional methods, decision procedures at the bit- and word-level, probabilistic methods, combinations of deductive methods and decision procedures. * Synthesis and compilation for computer system descriptions, modeling, specification, and implementation languages, formal semantics of languages and their subsets, model-based design, design derivation and transformation, correct-by-construction methods. * Application of formal and semi-formal methods to functional and non-functional specification and validation of hardware and software, including timing and power modeling, verification of computing systems on all levels of abstraction, system-level design and verification for embedded systems, cyber-physical systems, automotive systems and other safety-critical systems, hardware-software co-design and verification, and transaction-level verification. * Experience with the application of formal and semi-formal methods to industrial-scale designs; tools that represent formal verification enablement, new features, or a substantial improvement in the automation of formal methods. * Application of formal methods to verifying safety, connectivity and security properties of networks, distributed systems, smart contracts, block chains, and IoT devices. SUBMISSIONS Submissions must be made electronically in PDF format via EasyChair: https://easychair.org/my/conference/?conf=fmcad21Two categories of papers are invited: Regular papers, and Tool & Case Study papers. Regular papers are expected to offer novel foundational ideas, theoretical results, or algorithmic improvements to existing methods, along with experimental impact validation where applicable. Tool & Case Study papers are expected to report on the design, implementation or use of verification (or related) technology in a practically relevant context (which need not be industrial), and its impact on design processes. Both Regular and Tool & Case study papers must use the IEEE Transactions format on letter-size paper with a 10-point font size. Papers in both categories can be either 8 pages (long) or 4 pages (short) in length not including references. Short papers that describe emerging results, practical experiences, or original ideas that can be described succinctly are encouraged. Authors will be required to select an appropriate paper category at abstract submission time. Submissions may contain an optional appendix, which will not appear in the final version of the paper. The reviewers should be able to assess the quality and the relevance of the results in the paper without reading the appendix. Submissions in both categories must contain original research that has not been previously published, nor is concurrently submitted for publication. Any partial overlap with published or concurrently submitted papers must be clearly indicated. If experimental results are reported, authors are strongly encouraged to provide the reviewers access to their data at submission time, so that results can be independently verified. The review process is single blind. Authors of accepted contributions will be required to sign the FMCAD copyright transfer form found here: https://fmcad.or.at/pdf/copyright.pdf. STUDENT FORUM Continuing the tradition of the previous years, FMCAD 2021 is hosting a Student Forum that provides a platform for graduate students at any career stage to introduce their research to the wider Formal Methods community, and solicit feedback.Submissions for the event must be short reports describing research ideas or ongoing work that the student is currently pursuing, and must be within the scope of FMCAD. Work, part of which has been previously published, will be considered; the novel aspect to be addressed in future work must be clearly described in such cases. All submissions will be reviewed by a select group of FMCAD program committee members. PROGRAM CHAIRS: Ruzica Piskac, Yale University Michael Whalen, Amazon, Inc. and the University of Minnesota PC: Erika Abraham, RWTH Aachen University Jade Alglave, University College London Pranav Ashar, Real Intent Per Bjesse, Synopsys Inc. Roderick Bloem, Graz University of Technology Ivana Cerna, Masaryk University Supratik Chakraborty, IIT Bombay Sylvain Conchon, Universite Paris-Sud Leonardo de Moura, Microsoft Rayna Dimitrova, CISPA Helmholtz Center for Information Security Grigory Fedyukovich, Florida State University Arie Gurfinkel, University of Waterloo Liana Hadarean, Amazon Web Services, Inc. Ziyad Hanna, Cadence Design Systems Fei He, Tsinghua University Marijn Heule, Carnegie Mellon University Warren Hunt, The University of Texas at Austin Alexander Ivrii, IBM Dejan Jovanovi?, SRI International Alan Jovic, University of Zagreb Laura Kovacs, Vienna University of Technology Ton Chanh Le, Stevens Institute of Technology Rebekah Leslie-Hurd, Intel Kuldeep Meel, National University of Singapore Elizabeth Polgreen, University of California, Berkeley Andrew Reynolds, University of Iowa Cristoph Scholl, University of Freiburg Natasha Sharygina, Universit? della Svizzera italiana (USI Lugano, Switzerland) Anna Slobodova, Centaur Technology Christoph Sticksel, The Mathworks Murali Talupur, Amazon Web Services, Inc. Jean-Baptiste Tristram, Boston College Yakir Vizel, Technion Thomas Wahl, Northeastern University Georg Weissenbacher, Vienna University of Technology Thomas Wies, New York University Valentin W?stholz, ConsenSys Lenore Zuck, University of Illinois in Chicago STUDENT FORUM CHAIR: Mark Santolucito, Barnard College PUBLICATION CHAIR: Georg Weissenbacher, TU Wien SPONSORSHIP CHAIR: Daniel Schoepe, Amazon Web Services, Inc. FMCAD STEERING COMMITTEE: Clark Barrett, Stanford University, CA, USA Armin Biere, Johannes Kepler University in Linz, Austria Georg Weissenbacher, TU Vienna, Austria Anna Slobodova, Centaur Technology, TX, USA -------------- next part -------------- An HTML attachment was scrubbed... URL: From Damien.Pous at ens-lyon.fr Mon May 10 10:10:17 2021 From: Damien.Pous at ens-lyon.fr (Damien Pous) Date: Mon, 10 May 2021 16:10:17 +0200 Subject: [TYPES/announce] Postdoc position at the LIP laboratory, ENS de Lyon, France Message-ID: The LIP laboratory, located at the ENS de Lyon in France, is offering a 1 year post-doc position in computer science, starting on the 1st September 2021. Candidates should have a PhD and a strong background in one of the subjects studied in the LIP. (Please refer to http://www.ens-lyon.fr/LIP/ for details.) The salary will depend on the successful candidate's prior research experience with a guaranteed minimum of 2300 EUR/month before taxes. An application consists of a single PDF file containing: - a CV including a full list of publications; and - a research project that in particular proposes a mentor in one of the research teams of the LIP. Inside the LIP laboratory, the Plume team http://www.ens-lyon.fr/LIP/PLUME/?page_id=7 could be of particular interest to the readers of the types and fom mailing lists (logic, semantics, formal verification). The application should be sent by email to russell.harmer at ens-lyon.fr and nicolas.trotignon at ens-lyon.fr by the 30th May, 23:59 UT. Reference letters should be sent directly by email to the same addresses with the same deadline. With best regards, Damien Pous -------------- next part -------------- An HTML attachment was scrubbed... URL: From s-dgq at thorsten-wissmann.de Mon May 10 11:55:22 2021 From: s-dgq at thorsten-wissmann.de (Thorsten Wissmann) Date: Mon, 10 May 2021 17:55:22 +0200 Subject: [TYPES/announce] CALCO 2021: Second call for papers Message-ID: <20210510155522.GA9021@dobby> [Apologies if you receive multiple copies of this message] ========================================================= CALL FOR PAPERS: CALCO 2021 9th International Conference on Algebra and Coalgebra in Computer Science 31 Aug - 03 Sep 2021 Salzburg, Austria (if possible) Co-located with MFPS XXXV ========================================================== Paper submission: 3 June 2021 Author notification: 29 July 2021 Final version due: 12 August 2021 ========================================================== Scope ===== Algebraic and coalgebraic methods and tools are a mainstay of computer science. From data types to development techniques and specification formalisms, both theoreticians and practitioners have benefited from the large body of research proposed and implemented since the pioneering works of the 1960s. CALCO aims to bring together researchers with interests in both foundational and applicative uses of algebra and coalgebra in computer science, traditional as well as emerging ones. CALCO is a high-level, bi-annual conference formed by joining the forces and reputations of CMCS (the International Workshop on Coalgebraic Methods in Computer Science) and WADT (the Workshop on Algebraic Development Techniques). Previous CALCO editions took place in Swansea (Wales, 2005), Bergen (Norway, 2007), Udine (Italy, 2009), Winchester (UK, 2011), Warsaw (Poland, 2013), Nijmegen (the Netherlands, 2015), Ljubljana (Slovenia,2017), and London (UK, 2019). The 9th edition will be held in Salzburg, Austria, colocated with MFPS XXXVII. Joint CALCO-MFPS Speaker ======================== * Eugenia Cheng (School of the Art Institute of Chicago) Submission Categories ===================== CALCO invites papers relating to all aspects of algebraic and coalgebraic theory and applications, and distinguishes between four categories of submissions. 1. Regular papers that report * results on theoretical foundations * novel methods and techniques for software development * experiences with the technology transfer to industry. 2. (Co)Algebraic Pearls papers that * present possibly known material in a novel and enlightening way. 3. Early ideas abstracts that lead to * presentations of work in progress * proposals for original venues of research. 4. Tool presentation papers that * report on the features and uses of algebraic/coalgebra-based tools. Topics of Interests =================== All topics relating to algebraic and coalgebraic theory and applications are of interest for CALCO, and among them * Models and logics - Automata and languages - Graph transformations and term rewriting - Modal logics - Proof systems - Relational systems * Algebraic and coalgebraic semantics - Abstract data types - Re-engineering techniques (program transformation) - Semantics of conceptual modelling methods and techniques - Semantics of programming languages * Methodologies in software and systems engineering - Development processes - Method integration - Usage guidelines * Specialised models and calculi - Hybrid, probabilistic, and timed systems - Concurrent, distributed, mobile, cyber-physical, and context-aware computational paradigms - Systems theory and computational models (chemical, biological, etc.) * System specification and verification - Formal testing and quality assurance - Generative programming and model-driven development - Integration of formal specification techniques - Model-driven development - Specification languages, methods, and environments * Tools supporting algebraic and coalgebraic methods for - Advances in automated verification - Model checking - Theorem proving - Testing * String diagrams and network theory - Theory of PROPs and operads - Rewriting problems and higher-dimensional approaches - Automated reasoning with string diagrams - Applications of string diagrams * Quantum computing - Categorical semantics for quantum computing - Quantum calculi and programming languages - Foundational structures for quantum computing - Applications of quantum algebra Submissions Guidelines ====================== All submissions will be handled via EasyChair https://easychair.org/conferences/?conf=calco2021 The format for all submissions is specified by LIPIcs. Please use the latest version of the style http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ It is recommended that submissions adhere to that format and length. Submissions that are clearly too long may be rejected immediately. Regular papers ============== Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Regular papers should be maximum 15 pages long, excluding references. Proofs omitted due to space limitations may be included in a clearly marked appendix. Each submission will be evaluated by at least three reviewers. Proceedings will be published in the Dagstuhl LIPIcs Leibniz International Proceedings in Informatics series. A special issue of the open access journal Logical Methods in Computer Science (http://www.lmcs-online.org), containing extended versions of selected papers, is planned. (Co)algebraic pearls ==================== This is a new submission category in 2021. Explaining a known idea in a new way may make as strong a contribution as inventing a new idea. We encourage the submission of pearls: elegant essays that illustrate an idea in a beautiful or didactically clever way, perhaps by developing an application. Pearls are typically short and concise and so should not be longer than regular papers in the format specified by LIPIcs. Authors who feel they need a bit more space should consult with the PC co-chairs. The accepted papers will be included in the final proceedings of the conference. Each submission will be evaluated by at least two reviewers. Early ideas abstracts ===================== Submissions should not exceed 2 pages in the format specified by LIPIcs. The volume of selected abstracts will be made available on arXiv and on the CALCO pages. Authors will retain copyright, and are also encouraged to disseminate the results by subsequent publication elsewhere. Each submission will be evaluated by at least two reviewers. Tool papers =========== Submissions should not exceed 5 pages in the format specified by LIPIcs. The accepted tool papers will be included in the final proceedings of the conference. The tools should be made available on the web at the time of submission for download and evaluation. Each submission will be evaluated by at least three reviewers, and one or more of the reviewers will be asked to download and use the tool. Best Paper and Best Presentation Awards ======================================= This edition of CALCO will feature two awards: a Best Paper Award whose recipients will be selected by the PC before the conference and a Best Presentation Award, elected by the participants. Programme Committee =================== * Zena M. Ariola (University of Oregon) * Paolo Baldan (University of Padova) * Rui Soares Barbosa (International Iberian Nanotechnology Laboratory) * Luis Caires (NOVA University Lisbon) * Francisco Dur?n (University of M?laga) * Brendan Fong (Massachusetts Institute of Technology) * Fabrizio Romano Genovese (University of Pisa) * Jules Hedges (University of Strathclyde, Glasgow) * Thomas Hildebrandt (IT University of Copenhagen) * Peter Jipsen (Chapman University) * Wolfram Kahl (McMaster University) * Marie Kerjean (CNRS -- Laboratoire d'Informatique de Paris Nord) * Jean Krivine (CNRS -- Universit? de Paris) * Michele Loreti (University of Camerino) * Sonia Marin (University College London) * Manuel A. Martins (University of Aveiro) * Annabelle McIver (Macquarie University) * Hernan Melgratti (University of Buenos Aires) * Koko Muroya (RIMS, Kyoto University) * Elaine Pimentel (UFRN) * Elvinia Riccobene (University of Milan) * Alex Simpson (University of Ljubljana) * David I. Spivak (Massachusetts Institute of Technology) * Christine Tasson (LIP6 - Sorbonne Universit?) * Tarmo Uustalu (Reykjavik University/Tallinn U. of Technology) * Maaike Zwart (University of Oxford) * Rob van Glabbeek (Data61 - CSIRO) Chairs ====== * Fabio Gadducci (University of Pisa) * Alexandra Silva (University College London) Local Organiser =============== * Ana Sokolova (University of Salzburg) From ruy at cin.ufpe.br Tue May 11 07:48:44 2021 From: ruy at cin.ufpe.br (Ruy Jose Guerra Barretto de Queiroz) Date: Tue, 11 May 2021 08:48:44 -0300 Subject: [TYPES/announce] 27th WoLLIC 2021 - Call for Papers (DEADLINE APPROACHING: May 18th) Message-ID: (Deadline APPROACHING: May 18th) [Please circulate. Apologies for multiple copies.] CALL FOR PAPERS WoLLIC 2021 27th Workshop on Logic, Language, Information and Computation October 5 to 8, 2021 ORGANISATION Universidade de S?o Paulo, Brazil University College London, UK 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 online from October 5 to 8, 2021. 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 2021 EasyChair website (https://easychair.org/conferences/?conf=wollic2021 ). PROCEEDINGS The proceedings of WoLLIC 2021, 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 2021 issue of a scientific journal (to be confirmed). INVITED SPEAKERS Catarina Dutilh Novaes (VU Amsterdam) Santiago Figueira (Universidad de Buenos Aires, Argentina) Andreas Herzig (IRIT, France) Cl?udia Nalon (UnB - Brazil) Giselle Reis (CMU - Qatar) IMPORTANT DATES May 18, 2021: Full paper deadline June 29, 2021: Author notification July 30, 2021: Final version deadline (firm) PROGRAMME COMMITTEE Carlos Areces (FaMAF - Universidad Nacional de C?rdoba, Argentina) Arthur Azevedo de Amorim (Boston University, USA) Paul Brunet (University College London, UK) Nina Gierasimczuk (Technical University of Denmark, Denmark) Helle Hvid Hansen (University of Groningen, The Netherlands) Justin Hsu (University of Pennsylvania, USA) Fairouz Kamareddine (Heriot-Watt University, UK) Sandra Kiefer (RWTH 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, and Univ Birmingham, UK) Elaine Pimentel (UFRN, Brazil) Revantha Ramanayake (University of Groningen, The Netherlands) Jurriaan Rot (Radboud University, The Netherlands) 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 Renata Wassermann (Univ S?o Paulo) (Co-Chair) Alexandra Silva (Univ College London) (Co-Chair) Anjolina G. de Oliveira (Univ Federal de Pernambuco, Brasil) Ruy de Queiroz (Univ Federal de Pernambuco, Brasil) (co-chair) SCIENTIFIC SPONSORSHIP Interest Group in Pure and Applied Logics (IGPL) The Association for Logic, Language and Information (FoLLI) Association for Symbolic Logic (ASL) European Association for Theoretical Computer Science (EATCS) 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/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From ksk at riec.tohoku.ac.jp Tue May 11 10:35:00 2021 From: ksk at riec.tohoku.ac.jp (Keisuke Nakano) Date: Tue, 11 May 2021 23:35:00 +0900 Subject: [TYPES/announce] [Deadline Extension] WPTE 2021: Call For Papers Message-ID: <30ABCF79-4412-4C6C-A1DE-8BA51566EF1D@riec.tohoku.ac.jp> --------------------------------------------------------------------------- WPTE 2021: 8th International Workshop on Rewriting Techniques for Program Transformations and Evaluation Held online on July 18, 2021 --------------------------------------------------------------------------- Conference Web site: https://www.ipl.riec.tohoku.ac.jp/wpte2021/ Submission link: https://easychair.org/conferences/?conf=wpte2021 Submission deadline: May 24, 2021 (EXTENDED!) --------------------------------------------------------------------------- The aim of WPTE is to bring together the researchers working on program transformations, evaluation, and operationally based programming language semantics, using rewriting methods, in order to share the techniques and recent developments and to exchange ideas to encourage further activation of research in this area. The 8th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2021) is affiliated with FSCD 2021, https://fscd2021.dc.uba.ar/ List of Topics --------------------------------------------------------------------------- * Correctness of program transformations, optimizations and translations. * Program transformations for proving termination, confluence, and other properties. * Correctness of evaluation strategies. * Operational semantics of programs, operationally-based program equivalences such as contextual equivalences and bisimulations. * Cost-models for arguing about the optimizing power of transformations and the costs of evaluation. * Program transformations for verification and theorem proving purposes. * Translation, simulation, equivalence of programs with different formalisms, and evaluation strategies. * Program transformations for applying rewriting techniques to programs in specific programming languages. * Program transformations for program inversions and program synthesis. * Program transformation and evaluation for Haskell and rewriting. Submission Guidelines --------------------------------------------------------------------------- For the paper submission deadline an extended abstract of at most 10 pages is required to be submitted. The extended abstract may present original work or also work in progress. Based on the submissions the program committee will select the presentations for the workshop. All selected contributions will be included in the informal proceedings distributed to the workshop participants. One author of each accepted extended abstract is expected to present it at the workshop. Submissions must be prepared in LaTeX using the EPTCS macro package. All submissions will be electronic via https://easychair.org/conferences/?conf=wpte2021. Formal Proceedings --------------------------------------------------------------------------- WPTE post-proceedings of selected papers will be published in a JLAMP special issue. For this, full papers must be submitted until the post-proceedings deadline. The authors of selected contributions will have the opportunity (but no obligation) to submit a full paper for the formal post-proceedings. These must represent original work and should not be submitted to another conference at the same time. The submission deadline for these post-proceedings will be after the workshop in September 2021. There will be a second round of reviewing for selecting papers to be published in the formal proceedings. Important Dates --------------------------------------------------------------------------- Submission of extended abstracts: May 24, 2021 (AoE) Notification of acceptance: June 14, 2021 Final version for proceedings deadline: June 27, 2021 Workshop: July 18, 2021 Submission to post-proceedings: September 2021 Program Committees --------------------------------------------------------------------------- Keisuke Nakano, Tohoku University, Japan (Chair) Adrian Riesco, Universidad Complutense de Madrid, Spain. (co-Chair) ?tefan Ciob?c?, Universitatea Alexandru Ioan Cuza din Ia?i, Romania Makoto Hamana, Gunma University, Japan Akimasa Morihata, the University of Tokyo, Japan Shin-Cheng Mu, Academia Sinica, Taiwan Koko Muroya, Kyoto University, Japan David Sabel, LMU, Germany Julia Sapi?a, Polytechnic University of Valencia, Spain Janis Voigtl?nder, University of Duisburg-Essen, Germany Contact --------------------------------------------------------------------------- All questions about submissions should be emailed to wpte2021 (at) easychair.org -- ???? ???? ??????? ksk at riec.tohoku.ac.jp From mjp.pereira at fct.unl.pt Tue May 11 05:41:08 2021 From: mjp.pereira at fct.unl.pt (Mario Pereira) Date: Tue, 11 May 2021 10:41:08 +0100 Subject: [TYPES/announce] SBLP 2021 - Second Call for Papers (deadline extension) Message-ID: Differences regarding first CFP: one week deadline extension and update on pages limit. [ Please distribute, apologies for multiple postings. ] ================================================================= Call for Papers - XXV Brazilian Symposium on Programming Languages (SBLP 2021) Online, September 27 - October 1, 2021 Conference website: http://cbsoft2021.joinville.udesc.br/sblp.php Submission link: https://easychair.org/conferences/?conf=sblp2021 SBLP 2021 is the 25th edition of the Brazilian Symposium on Programming Languages. It is promoted by the Brazilian Computer Society (SBC) and constitutes a forum for researchers, students and professionals to present and discuss ideas and innovations in the design, definition, analysis, implementation and practical use of programming languages. SBLP's first edition was in 1996. Since 2010, it has been part of CBSoft, the Brazilian Conference on Software: Theory and Practice. The symposium is planned to take place from September 27 to October 1, 2021, fully online. Submission Guidelines ------------------------------------------- Papers can be written in Portuguese or English. Submissions in English are encouraged because only accepted papers written in English will appear in the proceedings indexed in the ACM Digital Library. The acceptance of a paper implies that at least one of its authors will register for the symposium to present it. Papers must be original and not simultaneously submitted to another journal or conference. SBLP 2021 will use a lightweight double-blind review process. The manuscripts should be submitted for review anonymously (i.e., without listing the author?s names on the paper) and references to own work should be made in the third person. Papers must be submitted electronically (in PDF format) via the Easychair System: https://easychair.org/conferences/?conf=sblp2021 The following paper categories are welcome (page limits include figures, references and appendices): Full papers: up to 8 pages long in ACM 2-column conference format, available at http://www.acm.org/publications/proceedings-template Full papers can be further specialized, at submission time, as Student papers (i.e., as papers describing research conducted mainly by a student at any level). Student papers will be subject to the exact same reviewing process and criteria, but may be entitled for an award (see below). Short papers: up to 3 pages in the same format. Short papers can discuss new ideas which are at an early stage of development or can report partial results of on-going dissertations or theses. *Each paper can have a maximum of one extra page for references.* Awards: Two best paper awards will be attributed, distinguishing full paper submissions of the best: * student paper; * non-student paper. List of Topics (related but not limited to the following) ------------------------------------------- * Programming paradigms and styles, scripting and domain-specific languages and support for real-time, service-oriented, multi-threaded, parallel, distributed, and quantum programming * Program generation and transformation * Formal semantics and theoretical foundations: denotational, operational, algebraic and categorical * Program analysis and verification, type systems, static analysis, and abstract interpretation * Programming language design and implementation, programming, language environments, compilation and interpretation techniques * Programming languages for the blockchain technology: design and implementation of Smart Contract languages, implementation of consensus protocols, language-based security and cryptographic primitives Publication ------------------------------------------- SBLP proceedings will be published in ACM's digital library. A selection of the best papers appearing in the 2019 and 2020 editions of SBLP have been invited to be extended and considered for publication in a special issue of the Journal of Computer languages (COLA), by Elsevier. We will approach COLA for a similar special issue regarding the 2021 edition of SBLP. Important dates ------------------------------------------- Abstract submission: 9 May, 2021 23 May, 2021 Paper submission: 16 May, 2021 23 May, 2021 Author notification: 09 July, 2021 Camera ready deadline: 23 July, 2021 Program Committee ------------------------------------------- * Program Committee Chair: - Jo?o Paulo Fernandes, Universidade do Porto, Portugal * Publicity Chair: - M?rio Pereira, NOVA LINCS & Universidade Nova de Lisboa, Portugal * Program Committee: - Adrien Guatto, Universit? de Paris, CNRS, IRIF, France - Alberto Pardo, Universidad de la Rep?blica, Uruguay - Alcides Fonseca, Universidade de Lisboa, Portugal - Alejandro D?az-Caro, Universidad Nacional de Quilmes & ICC (CONICET / UBA), Argentina - Alex Kavvos, University of Bristol, UK - Anderson Faustino da Silva, Universidade Estadual de Maring?, Brazil - Andrei Rimsa, Centro Federal de Educa??o Tecnol?gica de Minas Gerais, Brazil - Arthur Azevedo de Amorim, Boston University, USA - Bruno Oliveira, University of Hong Kong, Hong Kong - Caterina Urban, INRIA & ?cole Normale Sup?rieure | Universit? PSL, France - Cl?udio Louren?o, Huawei Research, UK - Cristiano Vasconcellos, Universidade do Estado de Santa Catarina, Brazil - Dalvan Griebler, Pontif?cia Universidade Cat?lica do Rio Grande do Sul (PUCRS) / Sociedade Educacional Tr?s de Maio (Setrem), Brazil - Emmanuel Chailloux, Sorbonne Universit?, France - Eric Van Wyk, University of Minnesota, USA - Fernando Castor, Universidade Federal do Pernambuco, Brazil - Fernando Pereira, Universidade Federal de Minas Gerais, Brazil - Francisco Junior, Universidade Federal do Cear?, Brazil - Francisco Sant'anna, Universidade do Estado do Rio de Janeiro, Brazil - Jean-Christophe Filli?tre, CNRS/Universit? Paris-Saclay, France - L?on Gondelman, University of Aarhus, Denmark - Lourdes Gonz?lez Huesca, Universidad Nacional Aut?noma de M?xico, Mexico - Luiz Fernandes, Pontif?cia Universidade Cat?lica do Rio Grande do Sul, Brazil - Marcos Viera, Universidad de la Rep?blica, Uruguay - M?rio Pereira, NOVA LINCS & Universidade Nova de Lisboa, Portugal - Mauro Jaskelioff, Universidad Nacional de Rosario, Argentina - Noemi Rodriguez, Pontif?cia Universidade Cat?lica do Rio de Janeiro, Brazil - Paul Leger, Universidad Cat?lica del Norte, Chile - Roberto Bigonha, Universidade Federal de Minas Gerais, Brazil - Roberto Ierusalimschy, Pontif?cia Universidade Cat?lica do Rio de Janeiro, Brazil - Rodrigo Ribeiro, Universidade Federal de Ouro Preto, Brazil - Rui Pereira, HASLab/INESC Tec, Portugal - Samuel Feitosa, Instituto Federal de Santa Catarina, Brazil - S?rgio Medeiros, Universidade Federal do Rio Grande do Norte, Brazil - Sim?o Melo de Sousa, NOVA-LINCS & Universidade da Beira Interior, Portugal - Stefania Dumbrava, ?cole Nationale Sup?rieure d'Informatique pour l'industrie et l'Entreprise, France - St?phane Lengrand, Stanford Research Institute, USA Contact ------------------------------------------- All questions about submissions should be emailed to Jo?o Paulo Fernandes (jpaulo at fe.up.pt) -------------- next part -------------- An HTML attachment was scrubbed... URL: From richard.moot at icloud.com Tue May 11 08:15:40 2021 From: richard.moot at icloud.com (Richard Moot) Date: Tue, 11 May 2021 12:15:40 -0000 Subject: [TYPES/announce] =?utf-8?q?Call_for_papers_Logical_Aspects_of_Co?= =?utf-8?q?mputational_Linguistics_2021?= Message-ID: Logical Aspects of Computational Linguistics 2021 LACL 2021 December 13-17 2021 (online) Call for papers PRESENTATION LACL'2021 is the tenth edition of the international conference on Logical Aspects of Computational Linguistics that was launched in Nancy in 1996. The scope of this conference is the use of type theoretic, proof theoretic and model theoretic methods for describing natural language syntax, semantics and pragmatics, as well as the implementation of natural language processing software relying on logical formalisation. LACL 2021 will be held online 13-17 December 2021, as part of the Mathematical Linguistics (MALIN) week, and held conjointly with Mathematics of Language, Logic and Algorithms in Computational Linguistics, and Natural Language and Computer Science. SCOPE Computer scientists, linguists, mathematicians and philosophers are invited to present their work on the use of logical methods in computational linguistics and natural language processing, in natural language analysis, generation or acquisition. Topics of either theoretical or applied interest include, but are not limited to: - Logical foundation of syntactic formalisms, in particular categorial grammars and other type theoretic grammars, parsing as deduction, model theoretic syntax; - Logical frameworks for lexical semantics; - Logical semantics of sentences, discourse and dialogue; - Applications of these logical frameworks to natural language processing tasks (automated analysis, generation, acquisition, textual inference); - Applications of the logical formalisation of the language faculty to cognitive sciences. SUBMISSION LACL accepts two kinds of papers: - Regular (long) papers between 12 and 16 pages, - Short papers (work in progress, system descriptions, position papers) between 4 and 8 pages Submission is exclusively admitted electronically, in PDF format, through the EasyChair system at https://easychair.org/conferences/?conf=lacl2021 IMPORTANT DATES Paper submission deadline: June 27, 2021 Notification of acceptance: September 12, 2021 Camera ready copies due: October 01, 2021 Conference dates: December 13-17 2021 CONFERENCE WEBSITE https://lacl2021.github.io CONTACTS Annie Foret and Richard Moot lacl2021 at protonmail.com -------------- next part -------------- An HTML attachment was scrubbed... URL: From chisvasileandrei at gmail.com Wed May 12 05:10:04 2021 From: chisvasileandrei at gmail.com (Andrei Chis) Date: Wed, 12 May 2021 11:10:04 +0200 Subject: [TYPES/announce] CFP: SLE 2021 - 14th ACM SIGPLAN International Conference on Software Language Engineering Message-ID: ------------------------------------------------------------------------ 14th ACM SIGPLAN International Conference on Software Language Engineering (SLE 2021) October 17-19, 2021 Chicago, Illinois https://conf.researchr.org/home/sle-2021 http://www.sleconf.org/2021 Follow us on twitter: https://twitter.com/sleconf ------------------------------------------------------------------------ We are pleased to invite you to submit papers to the 14th ACM SIGPLAN International Conference on Software Language Engineering (SLE 2021), held in conjunction with SPLASH, GPCE and SAS 2021. Based on the future developments the conference will be hosted in Chicago, Illinois, United States on October 17-19, 2021 or will be held as a virtual event. --------------------------- Scope --------------------------- The ACM SIGPLAN International Conference on Software Language Engineering (SLE) is devoted to the principles of software languages: their design, their implementation, and their evolution. With the ubiquity of computers, software has become the dominating intellectual asset of our time. In turn, this software depends on software languages, namely the languages it is written in, the languages used to describe its environment, and the languages driving its development process. Given that everything depends on software and that software depends on software languages, it seems fair to say that for many years to come, everything will depend on software languages. Software language engineering (SLE) is the discipline of engineering languages and their tools required for the creation of software. It abstracts from the differences between programming languages, modelling languages, and other software languages, and emphasizes the engineering facet of the creation of such languages, that is, the establishment of the scientific methods and practices that enable the best results. While SLE is certainly driven by its metacircular character (software languages are engineered using software languages), SLE is not self-satisfying: its scope extends to the engineering of languages for all and everything. Like its predecessors, the 14th edition of the SLE conference, SLE 2021, will bring together researchers from different areas united by their common interest in the creation, capture, and tooling of software languages. It overlaps with traditional conferences on the design and implementation of programming languages, model-driven engineering, and compiler construction, and emphasizes the fusion of their communities. To foster the latter, SLE traditionally fills a two-day program with a single track, with the only temporal overlap occurring between co-located events. --------------------------- Topics of Interest --------------------------- SLE 2021 solicits high-quality contributions in areas ranging from theoretical and conceptual contributions, to tools, techniques, and frameworks in the domain of software language engineering. Broadly speaking, SLE covers software language engineering rather than engineering a specific software language. Topics of interest include, but are not limited to: * Software Language Design and Implementation - Approaches to and methods for language design - Static semantics (e.g., design rules, well-formedness constraints) - Techniques for specifying behavioral / executable semantics - Generative approaches (incl. code synthesis, compilation) - Meta-languages, meta-tools, language workbenches * Software Language Validation - Verification and formal methods for languages - Testing techniques for languages - Simulation techniques for languages * Software Language Integration and Composition - Coordination of heterogeneous languages and tools - Mappings between languages (incl. transformation languages) - Traceability between languages - Deployment of languages to different platforms * Software Language Maintenance - Software language reuse - Language evolution - Language families and variability * Domain-specific approaches for any aspects of SLE (design, implementation, validation, maintenance) * Empirical evaluation and experience reports of language engineering tools - User studies evaluating usability - Performance benchmarks - Industrial applications --------------------------- Important Dates --------------------------- All dates are Anywhere on Earth. * Mon 5 Jul 2021 - Abstract Submissions * Fri 9 Jul 2021 - Paper Submissions * Wed 1 Sep 2021 - Review Notification * Wed-Fri 1-3 Sep 2021 - Author Response Period * Mon 13 Sep 2021 - Notification * Wed 15 Sept 2021 - Artifact Submissions * Tue 28 Sep 2021 - Artifact Kick-the-tires Author Response * Tue 12 Oct 2021 - Artifact Notification * Sun-Tue 17-19 Oct 2021 - SLE Conference --------------------------- Types of Submissions --------------------------- SLE 2021 solicits three types of papers: * Research papers These are "traditional" papers detailing research contributions to SLE. These papers have a limit of 12 pages, and may optionally include 8 further pages of bibliography/appendices * Tool papers These are papers which focus on the tooling aspects which are often forgotten or neglected in research papers. A good tool paper focuses on practical insights that are likely to be useful to other implementers or users in the future. Any of the SLE topics of interest are appropriate areas for tool demonstrations. Submissions must not exceed 5 pages and may optionally include 1 further page of bibliography / appendices. They may optionally come with an appendix with a demo outline / screenshots and/or a short video/screencast illustrating the tool. The title of a Tool paper must start with "Tool Demo:". *New ideas / vision papers These are papers on forward-looking, innovative research in software language engineering. Our aim here is to accelerate the exposure of the software language engineering community to early yet potentially ground-breaking research results, or to techniques and perspectives that challenge the status quo in the discipline. New ideas / vision papers must not exceed 5 pages, and may optionally include 1 further page of bibliography / appendices. The title of a new ideas / vision papers must start with "New Ideas:" or "Vision:". --------------------------- Artifact Evaluation --------------------------- For the sixth year, SLE will use an evaluation process for assessing the quality of the artifacts on which papers are based to foster the culture of experimental reproducibility. Authors of accepted papers are invited to submit artifacts. For more information, please have a look at the Artifact Evaluation page (http://www.sleconf.org/2021/ArtifactEvaluation.html). --------------------------- Submission --------------------------- Submissions have to use the ACM SIGPLAN Conference Format ?acmart? ( http://sigplan.org/Resources/Author/#acmart-format); please make sure that you always use the latest ACM SIGPLAN acmart LaTeX template( https://www.acm.org/binaries/content/assets/publications/consolidated-tex-template/acmart-master.zip), and that the document class definition is \documentclass[sigplan,anonymous,review]{acmart}. Do not make any changes to this format! Ensure that your submission is legible when printed on a black and white printer. In particular, please check that colors remain distinct and font sizes in figures and tables are legible. To increase fairness in reviewing, a double-blind review process has become standard across SIGPLAN conferences. In this line, SLE will follow the double-blind process. Author names and institutions should be omitted from submitted papers, and references to the authors? own related work should be in the third person. No other changes are necessary, and authors will not be penalized if reviewers are able to infer their identities in implicit ways. All submissions must be in PDF format. Concurrent Submissions: Papers must describe unpublished work that is not currently submitted for publication elsewhere as described by SIGPLAN?s Republication Policy ( http://www.sigplan.org/Resources/Policies/Republication). Submitters should also be aware of ACM?s Policy and Procedures on Plagiarism ( http://www.acm.org/publications/policies/plagiarism_policy). Submissions that violate these policies will be desk-rejected. Submission Site: Submissions will be accepted at https://sle21.hotcrp.com/ --------------------------- Reviewing Process --------------------------- All submitted papers will be reviewed by at least three members of the program committee. Research papers and tool papers will be evaluated concerning novelty, correctness, significance, readability, and alignment with the conference call. New ideas / vision papers will be evaluated primarily concerning novelty, significance, readability, and alignment with the conference call. For fairness reasons, all submitted papers must conform to the above instructions. Submissions that violate these instructions may be rejected without review, at the discretion of the PC chairs. --------------------------- Awards --------------------------- * Distinguished paper: Award for most notable paper, as determined by the PC chairs based on the recommendations of the programme committee. * Distinguished reviewer: Award for distinguished reviewer, as determined by the PC chairs. * Distinguished artifact: Award for the artifact most significantly exceeding expectations, as determined by the AEC chairs based on the recommendations of the artifact evaluation committee. --------------------------- Publication --------------------------- All accepted papers will be published in the ACM Digital Library. AUTHORS TAKE NOTE: The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work. --------------------------- Organisation --------------------------- Chairs: * General chair: Eelco Visser, Delft University of Technology, Netherlands * Program co-chair: Dimitris Kolovos, University of York, United Kingdom * Program co-chair: Emma S?derberg, Lund University, Sweden * Artefact Evaluation co-chair: Elias Castegren, KTH, Sweden * Artefact Evaluation co-chair: Andreas Wortmann, RWTH Aachen University, Germany Program Committee: Vincent Aranega, University of Lille, France Mikhail Barash, University of Bergen, Norway Melanie Bats, Obeo, France David Broman, KTH, Sweden Shigeru Chiba, University of Tokyo, Japan Alfonso de la Vega, University of York, United Kingdom Juan De Lara, Universidad Aut?noma de Madrid, Spain Davide Di Ruscio, University of L'Aquila, Italy Marcos Didonet del Fabro, Universidade Federal do Paran?, Brazil Juergen Dingel, Queen's University, Canada Michalis Famelis, University of Montreal, Canada Bernd Fischer, Stellenbosch University, South Africa Niklas Fors, Lund University, Sweden Antonio Garcia Dominguez, Aston University, United Kingdom Esther Guerra, Universidad Aut?noma de Madrid, Spain G?rel Hedin, Lund University, Sweden Stuart Hutchesson, Independent, United Kingdom Adrian Johnstone, Royal Holloway, United Kingdom Paddy Krishnan, Oracle Labs, Australia James Noble, Victoria University of Wellington, New Zealand Carlos Olarte, ECT UFRN, Brazil Jo?o Saraiva, HASLab / INESC TEC and Universidade do Minho, Portugal Anthony Sloane, Macquarie University, Australia Daniel Str?ber, Radboud University , Netherlands Ulyana Tikhonova, CWI, Netherlands Mark van der Brand, TU Eindhoven, Netherlands Juan Manuel Vara, Universidad Rey Juan Carlos, Spain Ran Wei, Dalian University of Technology, China Bahman Zamani, University of Isfahan, Iran --------------------------- Contact --------------------------- For additional information, clarification, or answers to questions, please contact the Programme Chairs (Emma S?derberg and Dimitris Kolovos). -------------- next part -------------- An HTML attachment was scrubbed... URL: From ruy at cin.ufpe.br Tue May 11 14:09:02 2021 From: ruy at cin.ufpe.br (Ruy Jose Guerra Barretto de Queiroz) Date: Tue, 11 May 2021 15:09:02 -0300 Subject: [TYPES/announce] 27th WoLLIC 2021 - Call for Papers (DEADLINE APPROACHING: May 18th) In-Reply-To: References: Message-ID: (Deadline APPROACHING: May 18th) [Please circulate. Apologies for multiple copies.] CALL FOR PAPERS WoLLIC 2021 27th Workshop on Logic, Language, Information and Computation October 5 to 8, 2021 ORGANISATION Universidade de S?o Paulo, Brazil University College London, UK 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 online from October 5 to 8, 2021. 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 2021 EasyChair website (https://easychair.org/conferences/?conf=wollic2021 ). PROCEEDINGS The proceedings of WoLLIC 2021, 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 2021 issue of a scientific journal (to be confirmed). INVITED SPEAKERS Catarina Dutilh Novaes (VU Amsterdam) Santiago Figueira (Universidad de Buenos Aires, Argentina) Andreas Herzig (IRIT, France) Cl?udia Nalon (UnB - Brazil) Giselle Reis (CMU - Qatar) IMPORTANT DATES May 18, 2021: Full paper deadline June 29, 2021: Author notification July 30, 2021: Final version deadline (firm) PROGRAMME COMMITTEE Carlos Areces (FaMAF - Universidad Nacional de C?rdoba, Argentina) Arthur Azevedo de Amorim (Boston University, USA) Paul Brunet (University College London, UK) Nina Gierasimczuk (Technical University of Denmark, Denmark) Helle Hvid Hansen (University of Groningen, The Netherlands) Justin Hsu (University of Pennsylvania, USA) Fairouz Kamareddine (Heriot-Watt University, UK) Sandra Kiefer (RWTH 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, and Univ Birmingham, UK) Elaine Pimentel (UFRN, Brazil) Revantha Ramanayake (University of Groningen, The Netherlands) Jurriaan Rot (Radboud University, The Netherlands) 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 Renata Wassermann (Univ S?o Paulo) (Co-Chair) Alexandra Silva (Univ College London) (Co-Chair) Anjolina G. de Oliveira (Univ Federal de Pernambuco, Brasil) Ruy de Queiroz (Univ Federal de Pernambuco, Brasil) (co-chair) SCIENTIFIC SPONSORSHIP Interest Group in Pure and Applied Logics (IGPL) The Association for Logic, Language and Information (FoLLI) Association for Symbolic Logic (ASL) European Association for Theoretical Computer Science (EATCS) 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/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From harley.eades at gmail.com Wed May 12 12:53:05 2021 From: harley.eades at gmail.com (Harley D. Eades III) Date: Wed, 12 May 2021 12:53:05 -0400 Subject: [TYPES/announce] Seminar talk on Mathematical Structures in Dependent Type Theory Message-ID: Hi, everyone. On Friday, May 14, 2021 between 9am and 10am EDT (1pm - 2pm UTC), Assia Mahboubi will be giving a presentation as part of the CS Colloquium Series at Augusta University. Presentation details can be found here: https://the-au-forml-lab.github.io/colloquium_talks/Mahboubi.html Assia will be talking about the design of hierarchies of algebraic structures in proof assistants based on dependent type theory. It's going to be super interesting! This talk will be open to the general public via Zoom only. We will not be recording or stream the presentation. Please let me know if you would like to join and I'll send you the Zoom link. Feel free to share this message with everyone you know. I hope all of you, your family and friends are doing well! Very best, Harley -------------- next part -------------- An HTML attachment was scrubbed... URL: From niccolo.veltri at gmail.com Thu May 13 04:25:55 2021 From: niccolo.veltri at gmail.com (=?UTF-8?Q?Niccol=c3=b2_Veltri?=) Date: Thu, 13 May 2021 11:25:55 +0300 Subject: [TYPES/announce] LOPSTR 2021 - Call for Papers: Extended Deadline Message-ID: <73551bb5-ca53-c234-f900-68585989bc84@gmail.com> 31st International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2021 http://saks.iasi.cnr.it/lopstr21/ Tallinn (Estonia) and Virtual September 7-9, 2021 (co-located with PPDP 2021) *** EXTENDED SUBMISSION DEADLINE: June 7, 2021 *** * The conference will be held as a hybrid (blended) meeting, both in-person and virtual. * ============================================================ The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. The 31st International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2021) will be held as a hybrid (blended) meeting, both in-person (at the Teachers' House in Tallinn, Estonia) and virtual. Previous symposia were held in Bologna (as a virtual meeting), Porto, Frankfurt am Main, Namur, Edinburgh, Siena, Canterbury, Madrid, Leuven, Odense, Hagenberg, Coimbra, Valencia, Kongens Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester. LOPSTR 2021 will be co-located with PPDP 2021 (International Symposium on Principles and Practice of Declarative Programming). Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large, including, but not limited to: ? - synthesis ? - transformation ? - specialization ? - composition ? - optimization ? - inversion ? - specification ? - analysis and verification ? - testing and certification ? - program and model manipulation ? - machine learning for program development ? - verification and testing of machine learning systems ? - transformational techniques in SE ? - applications and tools Both full papers and extended abstracts describing foundations and applications in these areas are welcome. Survey papers that present some aspects of the above topics from a new perspective and papers that describe experience with industrial applications are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chairs in case of questions). * Important Dates * Paper/Extended abstract submission (extended): June 7, 2021 Notification (extended): July 16, 2021 Camera-ready (for electronic pre-proceedings): August 20, 2021 Symposium: September 7-9, 2021 Revised paper submission: November 1, 2021 (AoE) Notification: December 1, 2021 Final version (for post-proceedings): January 16, 2022 * Submission Guidelines * Authors should submit an electronic copy of the paper (written in English) in PDF, formatted in LNCS style. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email; abstract; and three to four keywords which will be used to assist the PC in selecting appropriate reviewers for the paper. Page numbers (and, if possible, line numbers) should appear on the manuscript to help the reviewers in writing their report. Full papers cannot exceed 15 pages excluding references. Extended abstracts cannot exceed 8 pages excluding references. Additional pages may be used for appendices not intended for publication. Reviewers are not required to read the appendices, and thus papers should be intelligible without them. Papers should be submitted via EasyChair: https://easychair.org/conferences/?conf=lopstr2021 * Proceedings * The formal post-conference proceedings will be published by Springer in the Lecture Notes in Computer Science series as in previous years. Full papers can be directly accepted for publication in the formal proceedings, or accepted only for presentation at the symposium and inclusion in informal proceedings. After the symposium, all authors of extended abstracts and full papers accepted only for presentation will be invited to revise and/or extend their submissions. Then, after another round of reviewing, these revised papers may also be published in the formal proceedings. Authors should consult Springer?s authors? guidelines and use their proceedings templates for the preparation of their papers. Springer encourages authors to include their ORCIDs in their papers. * Best paper awards * Thanks to Springer's sponsorship, two awards (including a 500 EUR prize each) will be given at LOPSTR 2021. The program committee will select the winning papers based on relevance, originality and technical quality but may also take authorship into account (e.g. a student paper). * Invited Speaker * TBA * Program Committee * Roberto Amadini, University of Bologna, Italy Sabine Broda, University of Porto, Portugal Maximiliano Cristi?, CIFASIS-UNR, Argentina W?odzimierz Drabent, IPI PAN, Poland & Link?ping University, Sweden Catherine Dubois, ENSIIE-Samovar, France Gregory Duck, National University of Singapore, Singapore Fabio Fioravanti, University of Chieti-Pescara, Italy Jeremy Gibbons, University of Oxford, UK Gopal Gupta, University of Texas at Dallas, USA Geoff Hamilton, Dublin City University, Ireland Michael Hanus, Kiel University, Germany Bishoksan Kafle, IMDEA Software Institute, Spain Maja Kirkeby, Roskilde University, Denmark Temur Kutsia, RISC J. Kepler University of Linz, Austria Michael Leuschel, University of D?sseldorf, Germany Pedro L?pez-Garc?a, IMDEA Software Institute & CSIC, Spain Jacopo Mauro, University of Southern Denmark, Denmark Fred Mesnard, Universit? de la R?union, France Alberto Momigliano, University of Milano, Italy Jorge A. Navas, SRI International, USA Naoki Nishida, Nagoya University, Japan Alicia Villanueva, Universitat Polit?cnica de Val?ncia, Spain * Program Chairs * Emanuele De Angelis, IASI-CNR, Italy Wim Vanhoof, University of Namur, Belgium * Local organisation * Niccol? Veltri, Tallinn University of Technology, Estonia * Contact * For more information, please contact the Program Committee Chairs: emanuele.deangelis at iasi.cnr.it, wim.vanhoof at unamur.be From m.roggenbach at swansea.ac.uk Wed May 12 06:46:29 2021 From: m.roggenbach at swansea.ac.uk (Roggenbach M.) Date: Wed, 12 May 2021 10:46:29 +0000 Subject: [TYPES/announce] 5 permanent positions (lecturer, senior lecturer, associate professor) at Swansea University, UK Message-ID: <59BCFEE4-BACB-48FF-B0C6-04C0511CC26B@swansea.ac.uk> 5 Permanent Posts at Swansea University, UK - Closing Date: 13-06-2021 * LECTURER/ SENIOR LECTURER IN COMPUTER SCIENCE (RESEARCH) - https://tinyurl.com/SU-CSresearch2021 * ASSOCIATE PROFESSOR - COMPUTER SCIENCE (RESEARCH) - https://tinyurl.com/SU-CSresearchAP2021 * LECTURER/SENIOR LECTURER IN COMPUTER SCIENCE (TEACHING) - https://tinyurl.com/SU-CSteaching2021 Swansea University is seeking to appoint motivated individuals to enhance our research and learning and teaching within Computer Science. The research focus can be in any area of Computer Science. The Department of Computer Science at Swansea boasts one of the largest Theory groups in the UK. Over the past 50 years, Swansea theoreticians have made seminal discoveries in the theories of data, algorithms, processes, languages and verification. Informal enquiries can be sent to Prof M Roggenbach (Director of Research): M.Roggenbach at swansea.ac.uk -------------- next part -------------- An HTML attachment was scrubbed... URL: From kutsia at risc.jku.at Thu May 13 04:56:20 2021 From: kutsia at risc.jku.at (Temur Kutsia) Date: Thu, 13 May 2021 10:56:20 +0200 Subject: [TYPES/announce] Last CfP: SCSS 2021 Message-ID: <4eb83374-7cb9-39b5-3e32-4952ac8600d3@risc.jku.at> ========================= SCSS 2021 The 9th International Symposium on Symbolic Computation in Software Science -- In the era of Computational and Artificial Intelligence -- September 8--10, 2021, virtual Organized by RISC, Johannes Kepler University Linz, Austria https://www.risc.jku.at/conferences/scss2021/ ========================= Overview -------- Symbolic Computation is the science of computing with symbolic objects (terms, formulae, programs, representations of algebraic objects, etc.). Powerful algorithms have been developed during the past decades for the major subareas of symbolic computation: computer algebra and computational logic. These algorithms and methods are successfully applied in various fields, including software science, which covers a broad range of topics about software construction and analysis. Meanwhile, artificial intelligence methods and machine learning algorithms are widely used nowadays in various domains and, in particular, combined with symbolic computation. Several approaches mix artificial intelligence and symbolic methods and tools deployed over large corpora to create what is known as cognitive systems. Cognitive computing focuses on building systems that interact with humans naturally by reasoning, aiming at learning at scale. The purpose of SCSS 2021 is to promote research on theoretical and practical aspects of symbolic computation in software science, combined with modern artificial?intelligence?techniques. Scope ------ SCSS 2021 solicits submissions on all aspects of symbolic computation and their applications in software science, in combination with artificial intelligence and cognitive computing techniques. The topics of the symposium include, but are not limited to the following: - automated reasoning, knowledge reasoning, common-sense reasoning and reasoning in science - algorithm (program) synthesis and/or verification, alignment and joint processing of formal, semi-formal, and informal libraries. - formal methods for the analysis of network and system security - termination analysis and complexity analysis of algorithms (programs) - extraction of specifications from algorithms (programs) - theorem proving methods and techniques, collaboration between automated and interactive theorem proving - proof carrying code - generation of inductive assertion for algorithm (programs) - algorithm (program) transformations - combinations of linguistic/learning-based and semantic/reasoning methods - formalization and computerization of knowledge (maths, medicine, economy, etc.) - methods for large-scale computer understanding of mathematics and science - artificial intelligence, machine learning and big-data methods in theorem proving and mathematics - formal verification of artificial intelligence and machine learning algorithms, explainable artificial intelligence, symbolic artificial intelligence - cognitive computing, cognitive vision, perception systems and artificial reasoners for robotics - component-based programming - computational origami - query languages (in particular for XML documents) - semantic web and cloud computing Important Dates --------------- May 18: title and single-paragraph abstract submission deadline. May 25: paper submission deadline. July 12: notification deadline. July 30: final paper submission deadline. September 8-10, 2021: the symposium dates (virtual). Keynote speaker --------------- Bruno Buchberger (RISC, Johannes Kepler University Linz, Austria) Invited Speakers ------ Tateaki Sasaki (University of Tsukuba, Japan) Martina Seidl (Johannes Kepler University Linz, Austria) Stephen M. Watt (University of Waterloo, Canada) General Chairs ----- Adel Bouhoula (Arabian Gulf University, Bahrain) Tetsuo Ida (University of Tsukuba, Japan) Program Chair ----- Temur Kutsia (Johannes Kepler University, Austria) Program Committee --------- David Cerna (Czech Academy of Sciences, Czech Republic, and Johannes Kepler University Linz, Austria) Changbo Chen (Chinese Academy of Sciences, China) Rachid Echahed (CNRS, Grenoble, France) Seyed Hossein Haeri (UC Louvain, Belgium) Mohamed-B?cha Ka?niche (Sup'Com, Carthage University, Tunisia) Cezary Kaliszyk (University of Innsbruck, Austria) Yukiyoshi Kameyama (University of Tsukuba, Japan) Michael Kohlhase (University of Erlangen-Nuremberg, Germany) Laura Kovacs (Vienna University of Technology, Austria) Temur Kutsia (Johannes Kepler University Linz, Austria) (Chair) Zied Lachiri (ENIT, University of Tunis El Manar, Tunisia) Christopher Lynch (Clarkson University, USA) Mircea Marin (West University of Timisoara, Romania) Yasuhiko Minamide (Tokyo Institute of Technology, Japan) Yoshihiro Mizoguchi (Kyushu University, Japan) Julien Narboux (Strasbourg University, France) Micha?l Rusinowitch (INRIA, France) Wolfgang Schreiner (Johannes Kepler University Linz, Austria) Sofiane Tahar (Concordia University, Canada) Dongming Wang (CNRS, Paris, France) Submission ---------- Submission is via EasyChair: https://easychair.org/conferences/?conf=scss2021 Original submissions are invited in two categories: regular research papers and tool papers. We recommend using the EPTCS Class format to prepare manuscripts. Regular research papers must not exceed 12 pages with up to 3 additional pages for technical appendices. Tool papers must not exceed 6 pages. They should include information about a URL from where the tool can be downloaded or accessed on-line. Publication ----------- The proceedings of SCSS 2021 will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS). A special issue of Annals of Mathematics and Artificial Intelligence (AMAI) will be organized after the symposium. Submitted full-length papers will be refereed according to the usual standards of the journal. From patrick.baillot at ens-lyon.fr Thu May 13 06:18:39 2021 From: patrick.baillot at ens-lyon.fr (Baillot Patrick) Date: Thu, 13 May 2021 12:18:39 +0200 Subject: [TYPES/announce] Seminar talk by Georg Moser on Automated Analysis of Splaying et al. (SCOT seminar) Message-ID: <62bdbca7-9d47-551a-8d4e-76316294b3a1@ens-lyon.fr> Dear colleagues, ?? The recently started web Seminar on Semantic and Formal Approaches to Complexity (SCOT) can be of interest to some members of the Types community. The next talk will be given by Georg Moser: * Tuesday May 18th 2021, 3pm-4pm (CEST). *Georg Moser *(University of Innsbruck). *Title*: Automated Analysis of Splaying et al. ( the virtual room will open at 2:40 for coffee/chat) Abstract: Being able to argue about the performance of self-adjusting data structures such as splay trees has been a main objective, when Sleator and Tarjan introduced the notion of *amortised* complexity. Analysing these data structures requires sophisticated potential functions, which typically contain logarithmic expressions. Possibly for these reasons, and despite the recent progress in automated resource analysis, they have so far eluded automation. ?? In this talk, I will report on the first fully-automated amortised complexity analysis of self-adjusting data structures and the underlying theory. Following earlier work, the analysis is based on potential function templates with unknown coefficients. This is joint work with Lorenz Leutgeb, David Obwaller and Florian Zuleger. * *Connexion informations:* To get the connexion link please subscribe to the mailing list; for that send an email with subject "subscribe scot_webinar" and empty body to sympa at groupes.renater.fr **About the seminar:* The SCOT Seminar is devoted to the problem of reasoning on the complexity of programs in formal and compositional ways. Many approaches have been exploited for that, taking advantage from logic, category theory, denotational semantics, type systems, interpretations, etc. This seminar aims at providing a forum of discussion for all issues related to these questions, from foundational aspects on semantics of complexity to automated time or space complexity analysis. The seminar is held virtually and on a monthly basis. Best regards For the seminar: Isabel Oitavem, Patrick Baillot, Ugo Dal Lago ------------------------ Seminar web page: http://www.cs.unibo.it/~dallago/SCOSEM/ The list's homepage: https://groupes.renater.fr/sympa/info/scot_webinar General information? about mailing lists: https://groupes.renater.fr/sympa/help/introduction To unsubscribe from this list: send an email with subject "unsubscribe scot_webinar" and empty body to sympa at groupes.renater.fr If you wish to subscribe: same procedure with subject "subscribe scot_webinar" -------------- next part -------------- An HTML attachment was scrubbed... URL: From wim.vanhoof at unamur.be Fri May 14 02:57:12 2021 From: wim.vanhoof at unamur.be (Wim Vanhoof) Date: Fri, 14 May 2021 08:57:12 +0200 Subject: [TYPES/announce] LOPSTR 2021 Deadline extension Message-ID: 31st International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2021 http://saks.iasi.cnr.it/lopstr21/ Tallinn (Estonia) and Virtual September 7-9, 2021 (co-located with PPDP 2021) *** EXTENDED SUBMISSION DEADLINE: June 07, 2021 *** * The conference will be held as a hybrid (blended) meeting, both in-person and virtual. * ============================================================ The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. The 31st International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2021) will be held as a hybrid (blended) meeting, both in-person (at the Teachers' House in Tallinn, Estonia) and virtual. Previous symposia were held in Bologna (as a virtual meeting), Porto, Frankfurt am Main, Namur, Edinburgh, Siena, Canterbury, Madrid, Leuven, Odense, Hagenberg, Coimbra, Valencia, Kongens Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester. LOPSTR 2021 will be co-located with PPDP 2021 (International Symposium on Principles and Practice of Declarative Programming). Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large, including, but not limited to: - synthesis - transformation - specialization - composition - optimization - inversion - specification - analysis and verification - testing and certification - program and model manipulation - machine learning for program development - verification and testing of machine learning systems - transformational techniques in SE - applications and tools Both full papers and extended abstracts describing foundations and applications in these areas are welcome. Survey papers that present some aspects of the above topics from a new perspective and papers that describe experience with industrial applications are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chairs in case of questions). * Important Dates * Paper/Extended abstract submission (extended): June 07, 2021 Notification (extended): July 16, 2021 Camera-ready (for electronic pre-proceedings): August 20, 2021 Symposium: September 7-9, 2021 Revised paper submission: November 1, 2021 (AoE) Notification: December 1, 2021 Final version (for post-proceedings): January 16, 2022 * Submission Guidelines * Authors should submit an electronic copy of the paper (written in English) in PDF, formatted in LNCS style. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email; abstract; and three to four keywords which will be used to assist the PC in selecting appropriate reviewers for the paper. Page numbers (and, if possible, line numbers) should appear on the manuscript to help the reviewers in writing their report. Full papers cannot exceed 15 pages excluding references. Extended abstracts cannot exceed 8 pages excluding references. Additional pages may be used for appendices not intended for publication. Reviewers are not required to read the appendices, and thus papers should be intelligible without them. Papers should be submitted via EasyChair: https://easychair.org/conferences/?conf=lopstr2021 * Proceedings * The formal post-conference proceedings will be published by Springer in the Lecture Notes in Computer Science series as in previous years. Full papers can be directly accepted for publication in the formal proceedings, or accepted only for presentation at the symposium and inclusion in informal proceedings. After the symposium, all authors of extended abstracts and full papers accepted only for presentation will be invited to revise and/or extend their submissions. Then, after another round of reviewing, these revised papers may also be published in the formal proceedings. Authors should consult Springer?s authors? guidelines and use their proceedings templates for the preparation of their papers. Springer encourages authors to include their ORCIDs in their papers. * Best paper awards * Thanks to Springer's sponsorship, two awards (including a 500 EUR prize each) will be given at LOPSTR 2021. The program committee will select the winning papers based on relevance, originality and technical quality but may also take authorship into account (e.g. a student paper). * Invited Speaker * TBA * Program Committee * Roberto Amadini, University of Bologna, Italy Sabine Broda, University of Porto, Portugal Maximiliano Cristi?, CIFASIS-UNR, Argentina W?odzimierz Drabent, IPI PAN, Poland & Link?ping University, Sweden Catherine Dubois, ENSIIE-Samovar, France Gregory Duck, National University of Singapore, Singapore Fabio Fioravanti, University of Chieti-Pescara, Italy Jeremy Gibbons, University of Oxford, UK Gopal Gupta, University of Texas at Dallas, USA Geoff Hamilton, Dublin City University, Ireland Michael Hanus, Kiel University, Germany Bishoksan Kafle, IMDEA Software Institute, Spain Maja Kirkeby, Roskilde University, Denmark Temur Kutsia, RISC J. Kepler University of Linz, Austria Michael Leuschel, University of D?sseldorf, Germany Pedro L?pez-Garc?a, IMDEA Software Institute & CSIC, Spain Jacopo Mauro, University of Southern Denmark, Denmark Fred Mesnard, Universit? de la R?union, France Alberto Momigliano, University of Milano, Italy Jorge A. Navas, SRI International, USA Naoki Nishida, Nagoya University, Japan Alicia Villanueva, Universitat Polit?cnica de Val?ncia, Spain * Program Chairs * Emanuele De Angelis, IASI-CNR, Italy Wim Vanhoof, University of Namur, Belgium * Local organisation * Niccol? Veltri, Tallinn University of Technology, Estonia * Contact * For more information, please contact the Program Committee Chairs: emanuele.deangelis at iasi.cnr.it, wim.vanhoof at unamur.be From Simon.Gay at glasgow.ac.uk Fri May 14 07:00:21 2021 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Fri, 14 May 2021 12:00:21 +0100 Subject: [TYPES/announce] ICALP 2021 Call for Participation Message-ID: <7bd5c5e8-ee53-7148-5198-2e115cd74f64@glasgow.ac.uk> ==================================================================== CALL FOR PARTICIPATION 48th International Colloquium on Automata, Languages and Programming ICALP 2021 online from the University of Glasgow, Scotland, 13-16 July 2021 https://easyconferences.eu/icalp2021/ ==================================================================== ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS). * Track A: Algorithms, Complexity and Games (PC Chair: Nikhil Bansal, CWI Amsterdam, Netherlands) * Track B: Automata, Logic, Semantics, and Theory of Programming (PC Chair: James Worrell, University of Oxford, UK) ================ Invited Speakers ================ Unifying Invited Speakers: Adi Shamir, Weizmann Institute of Science, Israel Toniann Pitassi, University of Toronto, Canada Andrei Bulatov, Simon Fraser University, Canada * Track A Invited Speakers: Keren Censor-Hillel, Technion, Israel David Woodruff, Carnegie Mellon University, USA * Track B Invited Speaker: Christel Baier, Technical University of Dresden, Germany ================== Contributed papers ================== http://easyconferences.eu/icalp2021/accepted/ ================= Conference format ================= * Afternoons, European time, 13-16 July * Full-length invited talks * Contributed papers have 5-minute live talk, live Q&A, 25-minute video available in advance * Workshops: full day, European time, 11-12 July =========================== Workshops - 11-12 July 2021 =========================== * Algorithmic Aspects of Temporal Graphs IV Organisers: George B. Mertzios, Paul G. Spirakis, Eleni C. Akrida, Viktor Zamaraev http://community.dur.ac.uk/george.mertzios/Workshops/ICALP-21-Satellite/Temporal-Graphs-ICALP-2021.html * VEST: Verification of Session Types Organisers: Ornela Dardha, Ant?nio Ravara https://sites.google.com/view/vest21/home * 2nd Workshop on Programming Research in Mainstream Languages (PRiML 2021) Organisers: Seyed Hossein, Paul Keir * Graph Width Parameters: from Structure to Algorithms (GWP 2021) Organisers: Flavia Bonomo, Nick Brettell, Andrea Munaro, Daniel Paulusma * Combinatorial Reconfiguration Organisers: Takehiro Ito, Jun Kawahara, Yoshio Okamoto https://core.dais.is.tohoku.ac.jp/en/report/event/detail/---id-27.html * Formal Methods Education Online: Tips, Tricks & Tools Organisers: Jan K?et?nsk?, Maximilian Weininger, Thomas Zeume https://www7.in.tum.de/~kretinsk/fomeo.html * Flavours of Uncertainty in Verification, Planning and Optimization (FUNCTION) Organisers: Moritz Hahn, Nils Jansen, Gethin Norman https://function-2021.cs.ru.nl ============ Registration ============ http://easyconferences.eu/icalp2021/registration/ * Author registration until 15 June * Standard registration until 30 June * Late registration from 1 July * Low-cost registration for non-authors * Free registration for PhD students at Scottish universities, sponsored by SICSA (Scottish Informatics and Computer Science Alliance). Free registrations are limited to 2 author registrations and 30 non-author registrations, and will be allocated on a first-come-first-served basis. ================== Student volunteers ================== We have a student volunteer programme which offers free registration in exchange for technical assistance with running the sessions. Please check http://easyconferences.eu/icalp2021/registration/ for details. =============================== ICALP 2021 Organizing Committee =============================== Simon Gay, Conference Chair Oana Andrei Ornela Dardha Jessica Enright David Manlove Kitty Meeks Alice Miller Gethin Norman Sofiat Olaosebikan Michele Sevegnani ========== Contact us ========== For enquiries on academic programme please contact: Local Organizing Committee Email: icalp2021 at glasgow.ac.uk For enquiries, registration support, travel and logistics please contact: Easy Conferences Email: info at easyconferences.eu Tel: +357 22 591 900 =============== Twitter Account =============== @ICALPconf https://twitter.com/ICALPconf From caterina.urban at ens.fr Sat May 15 12:02:13 2021 From: caterina.urban at ens.fr (Caterina Urban) Date: Sat, 15 May 2021 18:02:13 +0200 Subject: [TYPES/announce] SOAP 2021 - Call for Participation Message-ID: <18516F5C-1C33-4278-B923-628525BB7EE1@ens.fr> CALL FOR PARTICIPATION SOAP 2021 10th ACM SIGPLAN International Workshop on the State of the Art in Program Analysis Virtual Workshop @ PLDI 2021, June 22nd, 2021 https://pldi21.sigplan.org/home/SOAP-2021 --------------------------------------------------------------------- ABOUT In line with past workshops, SOAP 2021 aims to bring together the members of the program analysis community to share new developments and shape new innovations in program analysis. The 10th ACM SIGPLAN International Workshop on the State of the Art in Program Analysis (SOAP 2021) is co-located with the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (PLDI 2021). REGISTRATION Registration is open. Please visit: https://pldi21.sigplan.org/attending/Registration The deadline for early registration is May 31st, 2021. INVITED TALKS - S?bastien Bardin (CEA, France) Towards Security-Oriented Program Analysis - Cristina Cifuentes (Oracle Labs, Australia) Towards Intelligent Application Security - Patrick Cousot (New York University, USA) Dynamic Abstract Interpretation ACCEPTED PAPERS The list of accepted papers is available at: https://pldi21.sigplan.org/home/SOAP-2021#event-overview Hope to see you virtually in June! Lisa Nguyen Quang Do Caterina Urban SOAP 2021 Program Chairs From bahareh1812 at gmail.com Sun May 16 06:16:39 2021 From: bahareh1812 at gmail.com (Bahareh Afshari) Date: Sun, 16 May 2021 12:16:39 +0200 Subject: [TYPES/announce] PhD position in Derivation Systems for Modal Fixpoint Logics Message-ID: <93F670AA-ABC9-4968-9437-866AD03FE410@gmail.com> We are looking for a PhD candidate for a research project Derivation Systems for Modal Fixpoint Logics. Many applications of modal logic, in particular in computer science, require the formalism to deal with various kinds of recursion. Modal fixpoint logics are extensions of basic modal logic that deal with the concept of recursion in an elegant and fundamental way by adding operators or connectives that can express recursive statements. Whereas semantic and computational aspects of these logics are by now reasonably well understood, the theory of proof systems for modal fixpoint logics has remained relatively underdeveloped. The aim of the Derivation Systems for Modal Fixpoint Logics project is to develop a general and uniform theory of proof systems for modal fixpoint logics. Such a theory will extend that of basic modal logics with proof systems that allow fo derivations that are circular or feature other mechanisms for dealing with the recursive nature of fixpoints. The envisaged methodology for designing and studying such proof systems will integrate insights from proof theory with ideas from the theories of automata, infinite games, and (co-)algebra. The research project Derivation Systems for Modal Fixpoint Logics was awarded to Prof.Dr. Yde Venema by the Netherlands Organisation for Scientific Research (NWO) in the ENW TOP grant programme. It is part of a larger project on proof systems for modal fixpoint logics, directed by Venema together with Dr. Bahareh Afshari. For more details and information on the application procedure, see https://www.illc.uva.nl/NewsandEvents/News/Positions/newsitem/12740/PhD-in-Proof-Systems-for-Modal-Fixpoint-Logics or contact Yde Venema at y.venema at uva.nl, or Bahareh Afshari at b.afshari at uva.nl. The deadline for applications is Monday 7 June; the preferred starting date is 1 September 2021. -------------- next part -------------- An HTML attachment was scrubbed... URL: From dennis.mueller at fau.de Mon May 17 11:10:51 2021 From: dennis.mueller at fau.de (=?UTF-8?Q?Dennis_M=C3=BCller?=) Date: Mon, 17 May 2021 17:10:51 +0200 (CEST) Subject: [TYPES/announce] Call for Participation - Workshop on Natural Formal Mathematics (NatFoM 2021) Message-ID: <1931444790.0.1621264251749@Raupenbox> NATURAL FORMAL MATHEMATICS - NatFoM (Call for extended abstracts) A workshop held between July 26 - 31, 2021 as part of the 14th Conference on Intelligent Computer Mathematics (CICM 2021) (WILL BE HELD ONLINE OR HYBRID; details to be announced on the CICM website https://cicm-conference.org/2021/cicm.php) In mathematics there has always existed a strong informal sense of "naturality". Natural theories, notions, properties, or proofs are prefered over technical, convoluted, or counterintuitive approaches. If formal mathematics is to become part of mainstream mathematics, its formalizations and user experience have to become more natural. This workshop, following a first edition in 2020, broadly addresses the issue of naturality in formal mathematics. Topics of interest include (but are not limited to): The notion of naturality in mathematics generally Natural input and output languages for formal mathematics systems Parsing natural mathematical language Controlled natural languages (CNL) for mathematics Making formal mathematics documents readable Naturality of foundational theories (types, sets, HOL, ...) Naturality of proof methods Natural proof structures and granularities Natural structurings of formalized mathematical texts and libraries Mathematical type setting (LaTeX) and formal mathematics Examples of natural formalizations Invited speaker: Jeremy Avigad Submissions We call for submissions of extended abstracts (1 page) and demonstration proposals presenting work related to the workshop's topics of interest. Accepted abstracts can optionally be expanded to full papers (4 to 15 pages) to be published in proceedings on ceur-ws.org. To promote Natural Formal Mathematics, unfinished or exploratory work will also be welcome. Electronic submission is done through EasyChair at https://easychair.org/conferences/?conf=cicm2021 (select the author role, select the "new submission" tab, and choose "NatFom"). Extended abstracts and papers should be formatted in LaTeX using the style onecolceurws. - Submission is continuous (early submit -> early notify). - July 1. 2021: Final revised papers due - July 26 - 31. 2021: Workshop (half day; date to be announced) Accepted abstracts and demonstrations should be presented online and live, to allow for questions and discussions. Program Committee Peter Koepke, Bonn (co-chair) Dennis M?ller, Erlangen (co-chair) Merlin Carl, Flensburg Marcos Cramer, Dresden Michael Junk, Konstanz Cezary Kaliszyk, Innsbruck Andrea Kohlhase, Neu-Ulm Aarne Ranta, Gothenburg Josef Urban, Prague -- Dennis M. M?ller "To do mathematics is to be, at once, touched by fire and bound by reason. This is no contradiction. Logic forms a narrow channel through which intuition flows with vastly augmented force" - Jordan Ellenberg (How Not to Be Wrong) From dom.orchard at gmail.com Mon May 17 17:23:48 2021 From: dom.orchard at gmail.com (Dominic Orchard) Date: Mon, 17 May 2021 22:23:48 +0100 Subject: [TYPES/announce] 2nd Call for papers - Workshop on Type-Driven Development (TyDe 2021) at ICFP 2021 Message-ID: Workshop on Type-Driven Development 2021 (TyDe) co-located with ICFP 2021 ----------------------------------------- https://icfp21.sigplan.org/home/TyDe-2021 ----------------------------------------- May 19 (AoE): Paper submission deadline May 26 (AoE): Extended abstract submission deadline # Goals of the Workshop The Workshop on Type-Driven Development (TyDe) aims to show how static type information may be used effectively in the development of computer programs. Co-located with ICFP, this workshop brings together leading researchers and practitioners who are using or exploring types as a means of program development. We welcome all contributions, both theoretical and practical, on a range of topics including: * dependently typed programming; * generic programming; * design and implementation of programming languages, exploiting types in novel ways; * exploiting typed data, data dependent data, or type providers; * static and dynamic analyses of typed programs; * tools, IDEs, or testing tools exploiting type information; * pearls, being elegant, instructive examples of types used in the derivation, calculation, or * construction of programs. # Submission Details Submissions should fall into one of two categories: * regular research papers (12 pages); * extended abstracts (3 pages). The bibliography will not be counted against the page limits for either category. Regular research papers are expected to present novel and interesting research results, and will be included in the formal proceedings. Extended abstracts should report work in progress that the authors would like to present at the workshop. Extended abstracts will be distributed to workshop attendees but will not be published in the formal proceedings. More details can be found on https://icfp21.sigplan.org/home/TyDe-2021 # Important Dates (all are Anywhere-on-Earth). * May 19: Paper submission deadline * May 26: Extended abstract submission deadline * June 16: Author notification * July 1: Camera-ready deadline * August 22: Workshop (tentative) # Program Committee Chairs: * Hsiang-Shang ?Josh? Ko, Institute of Information Science, Academia Sinica, Taiwan (co-chair) * Dominic Orchard, University of Kent, UK (co-chair) Programme Committee: * Kenichi Asai, Ochanomizu University, Japan * Jean-Philippe Bernardy, University of Gothenburg, Sweden * Liang-Ting Chen, Institute of Information Science, Academia Sinica, Taiwan * Ornela Dardha, University of Glasgow, UK * Martin Escardo, University of Birmingham, UK * Patricia Johann, Appalachian State University, USA * Neel Krishnaswami, University of Cambridge, UK * Ana Milanova, Rensselaer Polytechnic Institute, USA * Keiko Nakata, SAP Innovation Center Network, Potsdam, Germany * KC Sivaramakrishnan, IIT Madras, India * Stephanie Weirich, University of Pennsylvania, USA * James Wood, University of Strathclyde, UK * Beta Ziliani, FAMAF, UNC and CONICET, Argentina # Proceedings and Copyright We will have formal proceedings, published by the ACM. Accepted papers will be included in the ACM Digital Library. Authors must grant ACM publication rights upon acceptance, but may retain copyright if they wish. Authors are encouraged to publish auxiliary material with their paper (source code, test data, and so forth). The proceedings will be freely available for download from the ACM Digital Library from one week before the start of the conference until two weeks after the conference. -------------- next part -------------- An HTML attachment was scrubbed... URL: From ruy at cin.ufpe.br Mon May 17 11:38:48 2021 From: ruy at cin.ufpe.br (Ruy Jose Guerra Barretto de Queiroz) Date: Mon, 17 May 2021 12:38:48 -0300 Subject: [TYPES/announce] 27th WoLLIC 2021 - Call for Papers (DEADLINE EXTENDED: May 25th) In-Reply-To: References: Message-ID: (DEADLINE EXTENDED: *May 25th*) [Please circulate. Apologies for multiple copies.] CALL FOR PAPERS WoLLIC 2021 27th Workshop on Logic, Language, Information and Computation October 5 to 8, 2021 ORGANISATION Universidade de S?o Paulo, Brazil University College London, UK 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 online from October 5 to 8, 2021. 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 2021 EasyChair website (https://easychair.org/conferences/?conf=wollic2021 ). PROCEEDINGS The proceedings of WoLLIC 2021, 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 2021 issue of the Journal of Logic and Computation (Oxford Univ Press). INVITED SPEAKERS Catarina Dutilh Novaes (VU Amsterdam) Santiago Figueira (Universidad de Buenos Aires, Argentina) Andreas Herzig (IRIT, France) Cl?udia Nalon (UnB - Brazil) Giselle Reis (CMU - Qatar) IMPORTANT DATES *May 25, 2021: Full paper deadline * June 29, 2021: Author notification July 30, 2021: Final version deadline (firm) PROGRAMME COMMITTEE Carlos Areces (FaMAF - Universidad Nacional de C?rdoba, Argentina) Arthur Azevedo de Amorim (Boston University, USA) Paul Brunet (University College London, UK) Nina Gierasimczuk (Technical University of Denmark, Denmark) Helle Hvid Hansen (University of Groningen, The Netherlands) Justin Hsu (University of Pennsylvania, USA) Fairouz Kamareddine (Heriot-Watt University, UK) Sandra Kiefer (RWTH 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, and Univ Birmingham, UK) Elaine Pimentel (UFRN, Brazil) Revantha Ramanayake (University of Groningen, The Netherlands) Jurriaan Rot (Radboud University, The Netherlands) 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 Renata Wassermann (Univ S?o Paulo) (Co-Chair) Alexandra Silva (Univ College London) (Co-Chair) Anjolina G. de Oliveira (Univ Federal de Pernambuco, Brasil) Ruy de Queiroz (Univ Federal de Pernambuco, Brasil) (co-chair) SCIENTIFIC SPONSORSHIP Interest Group in Pure and Applied Logics (IGPL) The Association for Logic, Language and Information (FoLLI) Association for Symbolic Logic (ASL) European Association for Theoretical Computer Science (EATCS) 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/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From shankar at csl.sri.com Tue May 18 01:05:00 2021 From: shankar at csl.sri.com (Natarajan Shankar) Date: Mon, 17 May 2021 22:05:00 -0700 Subject: [TYPES/announce] Isaac Newton Institute Workshop on Verified Software: Tools and Experiments (June 7-11, 2021); Register by May 20 Message-ID: <9b09e21d-1b1c-e489-eea9-d71eb918996c@csl.sri.com> Verified software: Tools and Experiments June 7-11, 2021 URL: https://www.newton.ac.uk/event/vsow04 Workshop theme The Tools and Experiments workshop is aimed at defining an integrated tool resources for automated formal methods with standardized interfaces and interchange and data/evidence formats that allow services and arguments to be composed and test cases and counterexamples to be shared across different formal models. ?The goal of the INI Virtual Workshop is to lay the foundation for powerful automated tools and integrated tool suites that can be deployed in a range of large-scale experiments and case studies. The workshop will include a special event marking the 60th anniversary of?Tony Hoare's invention of Quicksort as well as a memorial event honoring the pioneering contributions of Edmund Clarke and Robert Kurshan. -------------- next part -------------- An HTML attachment was scrubbed... URL: From spreen at math.uni-siegen.de Tue May 18 07:19:09 2021 From: spreen at math.uni-siegen.de (Dieter Spreen) Date: Tue, 18 May 2021 13:19:09 +0200 Subject: [TYPES/announce] CID; CCC 2021; call for submissions Message-ID: Continuity, Computability, Constructivity ? From Logic to Algorithms (CCC 2021) In honour of Ulrich Berger?s 65th Birthday Birmingham / Online workshop 19 - 24 September 2021 Call for submissions www.cs.bham.ac.uk/~axj/ccc2021 CCC is a workshop series that brings together researchers applying logical methods to the development of algorithms, with a particular focus on computation with infinite data, where issues of continuity, computability and constructivity play major roles. Specific topics include exact real number computation, computable analysis, effective descriptive set theory, constructive analysis, and related areas. The overall aim is to apply logical methods in these disciplines to provide a sound foundation for obtaining exact and provably correct algorithms for computations with real numbers and other continuous data, which are of increasing importance in safety critical applications and scientific computation. Due to the COVID-19 pandemic and its consequences with respect to travelling and gathering together, the workshop will take place online. Previous workshops have been held in Cologne 2009, Trier 2012, Gregynog 2013, Ljubljana 2014, Kochel 2015, Nancy 2017, Faro 2018, Ljubljana 2019, Faro 2020 (online). The workshop is open to all researchers in the area. Scope: The workshop specifically invites contributions in the areas of Exact real number computation, Correctness of algorithms on infinite data, Computable analysis, Complexity of real numbers, real-valued functions, etc. Effective descriptive set theory, Domain theory, Constructive analysis, Category-theoretic approaches to computation on infinite data, Weihrauch degrees, And related areas. Invited Speakers: Suguman Bransal (U Penn) Franz Brau?e (U Manchester) Sewon Park (KAIST) Monika Seisenberger (Swansea U) Michael Yampolsky (U Toronto) Tutorial Speaker: Andr? Platzer (CMU) Submssion: Extended abstracts (1-2 pages) of original work are welcome. Deadline: 30 August 2021 Upload your submission via EasyChair: https://easychair.org/conferences/?conf=ccc2021 Programme Committee: Ulrich Berger (Swansea) Daniel Gra?a (Faro) Achim Jung (co-chair) Milly Maietti (Padua) Elvira Mayordomo (Zaragoza) Norbert M?ller (Trier) Paul Potgieter (Pretoria) Dieter Spreen (Siegen) (co-chair) Hideki Tsuiki (Kyoto) Organizing Committee: Achim Jung (Birmingham) Dieter Spreen (Siegen) -------------- next part -------------- An HTML attachment was scrubbed... URL: From ariesco at fdi.ucm.es Tue May 18 13:39:12 2021 From: ariesco at fdi.ucm.es (ADRIAN RIESCO RODRIGUEZ) Date: Tue, 18 May 2021 19:39:12 +0200 Subject: [TYPES/announce] 12th International School on Rewriting (ISR 2021), online and free Message-ID: ================== ANNOUNCEMENT ================== 12th International School on Rewriting (ISR 2021) 5-16 July 2021 Virtual event hosted via zoom by Universidad Complutense de Madrid https://dalila.sip.ucm.es/isr2021/ ================== Rewriting is a powerful model of computation that underlies much of declarative programming and is ubiquitous in mathematics, logic, theorem proving, verification, model-checking, compilation, biology, chemistry, physics, etc. In 2021, the 12th International School on Rewriting (ISR 2021) will take place online as a virtual event hosted via zoom by the Computer Science School at Universidad Complutense de Madrid, Spain. The school is aimed at Master and PhD students, researchers and practitioners interested in the use or the study of rewriting and its applications. >From July 5 to July 16 a course will be taught every day, according to the schedule published in the web page. ================== COURSES ================== Christiano Braga: Compiler construction in Maude Paola Bruscoli: An introduction to deep inference methodology in proof theory Santiago Escobar: Unification and Narrowing in Maude 3.0 Maribel Fernandez: Nominal rewriting Carsten Fuhs: Automated complexity analysis for term rewriting Maja H. Kirkeby & Robert Gl?ck: Inversion and term rewriting systems Jean-Jacques Levy: Lambda calculus, the generalized finite development theorem Luigi Liquori & Vincent van Oostrom: Lambda calculi with patterns Dorel Lucanu, Xiaohong Chen & Grigore Rosu: From rewriting to matching logic Jorge A. Perez: Session types for message-passing concurrency Carolyn Talcott: Pathway Logic, using rewriting logic to understand how cells work ================== REGISTRATION ================== Registration will be free but required. Details about registration will be published soon. ================== ORGANIZERS ================== David de Frutos Escrig Narciso Marti-Oliet Albert Rubio Contact: narciso at ucm.es ISR 2021 is promoted by the IFIP WG1.6 and supported by Universidad Complutense de Madrid. ================== -------------- next part -------------- An HTML attachment was scrubbed... URL: From jasmine.xuereb.15 at um.edu.mt Tue May 18 14:33:13 2021 From: jasmine.xuereb.15 at um.edu.mt (Jasmine Xuereb) Date: Tue, 18 May 2021 20:33:13 +0200 Subject: [TYPES/announce] Second Call for Participation DisCoTec 2021 Message-ID: [Apologies for multiple postings] ************************************************************************ Joint Call for Participation 16th International Federated Conference on Distributed Computing Techniques DisCoTec 2021 Valletta, Malta, 14-18 June 2021 https://www.discotec.org/2021 ************************************************************************ DisCoTec 2021 is one of the major events sponsored by the International Federation for Information Processing (IFIP) and the European Association for Programming Languages and Systems (EAPLS). It gathers conferences and workshops that cover a broad spectrum of distributed computing subjects ? from theoretical foundations and formal description techniques, testing and verification methods, to language design and system implementation approaches. As mentioned in our previous emails, DisCoTec 2021 will be held online again this year as a Zoom Webinar. Presentations will be recorded and broadcasted, followed by live Q&A sessions after each talk. The full programme is now available at https://www.discotec.org/2021/programme. * Registration * The conference registration can be found at https://www.discotec.org/2021/#registration. Please read the full information before registering. The registration form can be reached by following the link at the bottom of the page. When registering, be sure to give your full details. The email address you provide will be used for future correspondence. At least one presenter for each paper is required to pay the nominal registration fee; co-authors are exempt, but *still need* to register to attend the conference free of charge. Deadline for registration: 07 June 2021 midnight CET. * Additional Information * For further discussions, join our dedicated Slack workspace https://join.slack.com/t/discotec2021/shared_invite/zt-qd3ed8l2-BC1WA_re3N~e6AjNbFNIzQ. The full instructions for attendees can be found at https://www.discotec.org/2021/#instructions-for-attendees-and-presenters. * Keynote Speakers * - Gilles Fedak (iExec, FR) - Mira Mezini (Technical University of Darmstadt, DE) - Alexandra Silva (University College London, UK) (See https://www.discotec.org/2021/invited for a detailed overview of the titles and abstracts.) * Main Conferences (June 15 - June 17) * - COORDINATION (https://www.discotec.org/2021/coordination) 23rd International Conference on Coordination Models and Languages PC Chairs: Ferruccio Damiani (University of Turin, IT) and Ornela Dardha (University of Glasgow, UK) - DAIS (https://www.discotec.org/2021/dais) 21st International Conference on Distributed Applications and Interoperable Systems PC Chairs: Fab?ola Greve (Federal University of Bahia, BR) and Miguel Matos (University of Lisboa & INESC-ID, PT) - FORTE (https://www.discotec.org/2021/forte) 41st International Conference on Formal Techniques for Distributed Objects, Components and Systems PC Chairs: Kirstin Peters (Technical University of Darmstadt, DE) and Tim Willemse (Eindhoven University of Technology, NL) * Satellite Events (June 14 and June 18) * - DisCoTec Tools (https://www.discotec.org/2021/tutorials) Tutorial Sessions - ICE 2021 (https://www.discotec.org/2021/ice) 14th Workshop on Interaction and Concurrency Experience - FOCODILE 2021 (https://www.discotec.org/2021/focodile) 2nd International Workshop on the Foundations of Consensus and Distributed Ledgers - REMV 2021 (https://www.discotec.org/2021/remv) 1st International Workshop on Robotics, Electronics and Machine Vision To receive live, up-to-date information, follow us on Twitter @DisCoTecConf. From smuller2 at iit.edu Tue May 18 16:16:15 2021 From: smuller2 at iit.edu (Stefan Muller) Date: Tue, 18 May 2021 15:16:15 -0500 Subject: [TYPES/announce] Full-time teaching faculty position at Illinois Tech (Chicago) Message-ID: <45551b27-32ee-cc4d-b5b2-08e5a17e0389@iit.edu> TLDR: We're hiring full-time teaching faculty to start this fall, and PL is an area of particular interest. Feel free to contact me with any questions, or apply here: https://academicjobsonline.org/ajo/jobs/18562 -- The Department of Computer Science at the Illinois Institute of Technology invites applications for full-time, non-tenure-track teaching faculty (Lecturer or Senior Lecturer ranks), beginning August 2021. Teaching responsibilities will include undergraduate and graduate courses in computer science, both for majors and for non-majors. Particular areas of interest are Programming Languages, Theory, Cybersecurity, and AI. Candidates must have an M.S. or Ph.D. in Computer Science or a closely related field. The successful candidate will have experience and demonstrated excellence in teaching and developing instructional materials in computer science. We seek an individual who has a genuine interest in teaching and curriculum development and dedication to student success. The department offers Bachelor of Science, Master of Science, Professional Master, and Ph.D. degrees; and has approximately 1000 students. The department offers courses at the Main campus that is located within 10 minutes of downtown Chicago. Illinois Institute of Technology is an EEO/AA/Title VI/Title IX/Section 504/ADA/ADEA employer committed to enhancing equity, inclusion and diversity within its community. It actively seeks applications from all individuals regardless of race, color, sex, marital status, religion, creed, national origin, disability, age, military or veteran status, sexual orientation, and/or gender identity and expression. All qualified applicants will receive equal consideration for employment. -- Stefan Muller Gladwin Development Chair Assistant Professor Computer Science Department Illinois Institute of Technology From gregor at vt.edu Wed May 19 01:58:09 2021 From: gregor at vt.edu (Gregory Kildow) Date: Wed, 19 May 2021 01:58:09 -0400 Subject: [TYPES/announce] Call for Papers -- GPCE 2021 Message-ID: Hello! Please share this information with any who are interested. Note: the dates for the conference itself, while roughly accurate, have not yet been finalized. Thank you! ------------------------------------------------------------------------------- GPCE 2021: 20th International Conference on Generative Programming: Concepts & Experiences October 17th-22nd, 2021 (co-located with SPLASH) Chicago, Illinois, United States (hybrid) https://conf.researchr.org/home/gpce-2021 ------------------------------------------------------------------------------- --------------------------- CALL FOR PAPERS --------------------------- The ACM SIGPLAN International Conference on Generative Programming: Concepts & Experiences is a programming languages conference focusing on techniques and tools for code generation, language implementation, and product-line development. GPCE seeks conceptual, theoretical, empirical, and technical contributions to its topics of interest, which include but are not limited to: - program transformation, staging, macro systems, preprocessors, program synthesis, and code-recommendation systems, - domain-specific languages, language embedding, language design, and language workbenches, - feature-oriented programming, domain engineering, and feature interactions, - applications and properties of code generation, language implementation, and product-line development. Authors are welcome to check with the PC chair whether their planned papers are in scope. --------------------------- PAPER CATEGORIES --------------------------- GPCE solicits three kinds of submissions: - **Full Papers** reporting original and unpublished results of research that contribute to scientific knowledge in any GPCE topic listed above. Full paper submissions must not exceed 12 pages excluding bibliography. - **Short Papers** presenting unconventional ideas or visions about any GPCE topic listed above. Short papers do not always require complete results as in the case of a full paper. In this way, authors can introduce new ideas to the community and get early feedback. Please note that short papers are not intended to be position statements. Short papers are included in the proceedings and will be presented at the conference. Short paper submissions must not exceed 6 pages excluding bibliography. Short papers must have the text ?(Short Paper)? appended to their title, though any papers of 6 or fewer pages that are not tool demonstration papers will be considered as short papers. - **Tool Demonstrations** presenting tools for any GPCE topic listed above. Tools must be available for use and must not be purely commercial. Submissions must provide a tool description not exceeding 6 pages excluding bibliography and a separate demonstration outline including screenshots also not exceeding 6 pages. Tool demonstrations must have the keywords ?Tool Demo? or ?Tool Demonstration? in their title. If the submission is accepted, the tool description will be published in the proceedings. The demonstration outline will only be used by the program committee for evaluating the submission. --------------------------- PAPER SELECTION --------------------------- The GPCE program committee will evaluate each submission according to the following selection criteria: - Novelty. Papers must present new ideas or evidence and place them appropriately within the context established by previous research in the field. - Significance. The results in the paper must have the potential to add to the state of the art or practice in significant ways. - Evidence. The paper must present evidence supporting its claims. Examples of evidence include formalizations and proofs, implemented systems, experimental results, statistical analyses, and case studies. - Clarity. The paper must present its contributions and results clearly. --------------------------- IMPORTANT DATES --------------------------- - Abstract submission: July 5th, 2021 (Monday), AoE - Paper submission: July 9th, 2021 (Friday), AoE - Review notification: September 1st (Wednesday), AoE - Author response period: September 1st (Wednesday) till September 3rd (Friday), AoE - Final notification: September 13th (Monday) - Camera-ready submission: September 27th (Monday) --------------------------- PAPER SUBMISSION --------------------------- All submissions must use the ACM SIGPLAN Conference Format ?acmart?. Please be sure to use the latest LaTeX templates and class files. the SIGPLAN sub-format, and 10 point font. Consult the sample-sigplan.tex template and use the document-class \documentclass[sigplan,anonymous,review]{acmart}. To increase fairness in reviewing, a double-blind review process has become standard across SIGPLAN conferences. Author names and institutions should be omitted from submitted papers, and references to the authors? own related work should be in the third person. No other changes are necessary, and authors will not be penalised if reviewers are able to infer their identities in implicit ways. Papers must be submitted using HotCRP: https://gpce2021.hotcrp.com/ For additional information, clarification, or answers to questions please contact the program chair. The official publication date is the date the proceedings are made available in the ACM Digital Library. Papers must describe work not currently submitted for publication elsewhere as described by the SIGPLAN Republication Policy ( http://www.sigplan.org/Resources/Policies/Republication/). --------------------------- ORGANIZATION --------------------------- - Steering Committee Chair: Sebastian Erdweg (Germany) - General Chair: Eli Tilevich (USA) - Program Chair: Coen De Roover (Belgium) - Publicity Chair: Gregory Kildow (USA) For additional information, clarification, or answers to questions please contact the program chair at coen.de.roover at vub.be --------------------------- PROGRAM COMMITTEE --------------------------- Aggelos Biboudis, Swisscom AG, Switzerland Christoph Reichenbach, Lund University, Sweden Daniel Str?ber, Radboud University Nijmegen, Sweden Elena Zucca, University of Genova, Italy Friedrich Steimann, Fernuniversit?t in Hagen, Germany Jaakko J?rvi, University of Turku, Finland Jeff Gray, University of Alabama, United States of America Justyna Petke, University College London, United Kingdom KC Sivaramakrishnan, IIT Madras, India Klaus Ostermann, University of Tuebingen, Germany Leopoldo Teixeira, Federal University of Pernambuco, Brazil Lidia Fuentes, Universidad de M?laga, Spain Maja Kirkeby, Roskilde University, Denmark Manuel Serrano, Inria, France Marianne Huchard, Universit? de Montpellier, France Martin Erwig, Oregon State University, United States of America Matthew Flatt, University of Utah, United States of America Mikhail Barash, University of Bergen, Norway Raffi Khatchadourian, City University of New York (CUNY) Hunter College, United States of America Sandro Stucki, Chalmers University of Technology / University of Gothenburg, Sweden Sebastian Erdweg, JGU Mainz, Germany Shigeru Chiba, The University of Tokyo, Japan Shoaib Kamil, Adobe, United States of America Sibylle Schupp, Hamburg University of Technology, Germany Thomas Th?m, University of Ulm, Germany Tijs van der Storm, CWI, Netherlands Ulrik Schultz, University of Southern Denmark, Denmark Vadim Zaytsev, Universiteit Twente, Netherlands Yukiyoshi Kameyama, University of Tsukuba, Japan -- *Gregor Kildow* Ph.D. Candidate Computer Science @ Virginia Tech Software Innovations Lab "*Ut Prosim*" -------------- next part -------------- An HTML attachment was scrubbed... URL: From kutsia at risc.jku.at Wed May 19 15:10:23 2021 From: kutsia at risc.jku.at (Temur Kutsia) Date: Wed, 19 May 2021 21:10:23 +0200 Subject: [TYPES/announce] SCSS 2021: deadline extension Message-ID: ========================= SCSS 2021 The 9th International Symposium on Symbolic Computation in Software Science -- In the era of Computational and Artificial Intelligence -- September 8--10, 2021, virtual Organized by RISC, Johannes Kepler University Linz, Austria https://www.risc.jku.at/conferences/scss2021/ ========================= Extended submission deadlines ------------------------------ May 31: title and single-paragraph abstract submission deadline. June 7: paper submission deadline. Overview -------- Symbolic Computation is the science of computing with symbolic objects (terms, formulae, programs, representations of algebraic objects, etc.). Powerful algorithms have been developed during the past decades for the major subareas of symbolic computation: computer algebra and computational logic. These algorithms and methods are successfully applied in various fields, including software science, which covers a broad range of topics about software construction and analysis. Meanwhile, artificial intelligence methods and machine learning algorithms are widely used nowadays in various domains and, in particular, combined with symbolic computation. Several approaches mix artificial intelligence and symbolic methods and tools deployed over large corpora to create what is known as cognitive systems. Cognitive computing focuses on building systems that interact with humans naturally by reasoning, aiming at learning at scale. The purpose of SCSS 2021 is to promote research on theoretical and practical aspects of symbolic computation in software science, combined with modern artificial?intelligence?techniques. Scope ------ SCSS 2021 solicits submissions on all aspects of symbolic computation and their applications in software science, in combination with artificial intelligence and cognitive computing techniques. The topics of the symposium include, but are not limited to the following: - automated reasoning, knowledge reasoning, common-sense reasoning and reasoning in science - algorithm (program) synthesis and/or verification, alignment and joint processing of formal, semi-formal, and informal libraries. - formal methods for the analysis of network and system security - termination analysis and complexity analysis of algorithms (programs) - extraction of specifications from algorithms (programs) - theorem proving methods and techniques, collaboration between automated and interactive theorem proving - proof carrying code - generation of inductive assertion for algorithm (programs) - algorithm (program) transformations - combinations of linguistic/learning-based and semantic/reasoning methods - formalization and computerization of knowledge (maths, medicine, economy, etc.) - methods for large-scale computer understanding of mathematics and science - artificial intelligence, machine learning and big-data methods in theorem proving and mathematics - formal verification of artificial intelligence and machine learning algorithms, explainable artificial intelligence, symbolic artificial intelligence - cognitive computing, cognitive vision, perception systems and artificial reasoners for robotics - component-based programming - computational origami - query languages (in particular for XML documents) - semantic web and cloud computing Important Dates --------------- May 31: title and single-paragraph abstract submission deadline (extended). June 7: paper submission deadline (extended). July 12: notification deadline. July 30: final paper submission deadline. September 8-10, 2021: the symposium dates (virtual). Keynote speaker --------------- Bruno Buchberger (RISC, Johannes Kepler University Linz, Austria) Invited Speakers ------ Tateaki Sasaki (University of Tsukuba, Japan) Martina Seidl (Johannes Kepler University Linz, Austria) Stephen M. Watt (University of Waterloo, Canada) General Chairs ----- Adel Bouhoula (Arabian Gulf University, Bahrain) Tetsuo Ida (University of Tsukuba, Japan) Program Chair ----- Temur Kutsia (Johannes Kepler University, Austria) Program Committee --------- David Cerna (Czech Academy of Sciences, Czech Republic, and Johannes Kepler University Linz, Austria) Changbo Chen (Chinese Academy of Sciences, China) Rachid Echahed (CNRS, Grenoble, France) Seyed Hossein Haeri (UC Louvain, Belgium) Mohamed-B?cha Ka?niche (Sup'Com, Carthage University, Tunisia) Cezary Kaliszyk (University of Innsbruck, Austria) Yukiyoshi Kameyama (University of Tsukuba, Japan) Michael Kohlhase (University of Erlangen-Nuremberg, Germany) Laura Kovacs (Vienna University of Technology, Austria) Temur Kutsia (Johannes Kepler University Linz, Austria) (Chair) Zied Lachiri (ENIT, University of Tunis El Manar, Tunisia) Christopher Lynch (Clarkson University, USA) Mircea Marin (West University of Timisoara, Romania) Yasuhiko Minamide (Tokyo Institute of Technology, Japan) Yoshihiro Mizoguchi (Kyushu University, Japan) Julien Narboux (Strasbourg University, France) Micha?l Rusinowitch (INRIA, France) Wolfgang Schreiner (Johannes Kepler University Linz, Austria) Sofiane Tahar (Concordia University, Canada) Dongming Wang (CNRS, Paris, France) Submission ---------- Submission is via EasyChair: https://easychair.org/conferences/?conf=scss2021 Original submissions are invited in two categories: regular research papers and tool papers. We recommend using the EPTCS Class format to prepare manuscripts. Regular research papers must not exceed 12 pages with up to 3 additional pages for technical appendices. Tool papers must not exceed 6 pages. They should include information about a URL from where the tool can be downloaded or accessed on-line. Publication ----------- The proceedings of SCSS 2021 will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS). A special issue of Annals of Mathematics and Artificial Intelligence (AMAI) will be organized after the symposium. Submitted full-length papers will be refereed according to the usual standards of the journal. From hossein.haeri at gmail.com Wed May 19 11:23:45 2021 From: hossein.haeri at gmail.com (Seyed H. HAERI (Hossein)) Date: Wed, 19 May 2021 17:23:45 +0200 Subject: [TYPES/announce] Call for Papers: 8th Workshop on Advances in Programming Languages (WAPL'21) Message-ID: CALL FOR PAPERS ******************************************************************************* 8th Workshop on Advances in Programming Languages (WAPL'21) https://www.fedcsis.org/2021/sew-iwcps Organized within 2021 Federated Conference on Computer Science and Intelligence Systems (FedCSIS'21; IEEE #52320) ***************************** COVID-19 Information **************************** While we have planned the 2021 conference to take place in Sofia, Bulgaria, slow progress in fighting the global pandemic has forced us to switch to the fully online mode. Therefore, we plan to organize FedCSIS 2022 in Sofia, and hope that by that time COVID will be over, and we will be able to meet in person. FedCSIS organizers ******************************************************************************* FOR PAPER SUBMISSION DEADLINES SEE THE BOTTOM OF THIS MESSAGE Programming languages (PLs) are programmers' most basic tools. With appropriate programming languages one can drastically reduce the cost of building new applications as well as maintaining existing ones. In the last decades there have been many advances in PL technology in traditional programming paradigms such as functional, logic, and object-oriented programming, as well as the development of new paradigms such as aspect-oriented programming. The main driving force was and will be to better express programmers' ideas. Therefore, research in programming languages is an endless activity and the core of computer science. New language features, new programming paradigms, and better compile-time and run-time mechanisms can be foreseen in the future. The aim of this session is to provide a forum for exchange of ideas and experience in topics concerned with programming languages and systems. Original papers and implementation reports are invited in all areas of programming languages. This year, a special attention will be given to submissions on programming research in mainstream languages. That can include, but is not limited to: ? porting existing results from research languages to mainstream ones to examine their interplay with other features than those carefully cherry-picked for the targeted research. And, ? gauging generality of research results by studying their obtainability using different sets of features than originally thought of. Such submission needs to clarify the added value of performing their research in a mainstream language (over a lab one). Topics: Major topics of interest include but are not limited to the following: ? Software language engineering ? Interplay between languages and machine learning (and other branches of AI), especially for Code Repair and Code Smells ? Interplay between languages and security ? Automata theory and applications ? Compiling techniques ? Context-oriented programming languages to specify the behavior of software systems and dynamic adaptations ? Domain-specific languages ? Formal semantics and syntax ? Generative and generic programming ? Grammarware and grammar based systems ? Knowledge engineering languages, integration of knowledge engineering and software engineering ? Languages and tools for trustworthy computing ? Language theory and applications ? Language concepts, design and implementation ? Markup languages (XML) ? Metamodeling and modeling languages ? Model-driven engineering languages and systems ? Practical experiences with programming languages ? Program analysis, optimization and verification ? Program generation and transformation ? Programming paradigms (aspect-oriented, functional, logic, object-oriented, etc.) ? Programming tools and environments ? Proof theory for programs ? Specification languages ? Type systems ? Virtual machines and just-in-time compilation ? Visual programming languages ZDZIS?AW PAWLAK BEST PAPER AWARD The Professor Zdzis?aw Pawlak Awards are given in two categories: Best Paper and Best Student Paper. Each award carries a prize of 300 EUR founded by the Mazowsze Chapter of the Polish Information Processing Society. The awards have been originally associated with the International Symposium on Advanced Artificial Intelligence in Applications (AAIA) held every year as a part of FedCSIS. Currently, all papers accepted to FedCSIS are eligible to be considered as the award winners. This award will be awarded independently from awards given by individual FedCSIS events (Tracks and/or Technical Sessions). Past Award winners can be found here: https://fedcsis.org/2021/zp_award PAPER PUBLICATION: ? Authors should submit draft papers (as Postscript, PDF or MSWord file). ? The total length of a paper should not exceed 10 pages IEEE style (including tables, figures and references). IEEE style templates are available here. ? Papers will be refereed and accepted on the basis of their scientific merit and relevance to the workshop. ? Preprints containing accepted papers will be published on a USB memory stick provided to the FedCSIS participants. ? Only papers presented at the conference will be published in Conference Proceedings and submitted for inclusion in the IEEE Xplore? database. ? Conference proceedings will be published in a volume with ISBN, ISSN and DOI numbers and posted at the conference WWW site. ? Conference proceedings will be indexed in BazEkon and submitted for indexation in: Thomson Reuters - Conference Proceedings Citation Index, SciVerse Scopus, Inspec, Index Copernicus, DBLP Computer Science Bibliography and Google Scholar ? Organizers reserve right to move accepted papers between FedCSIS technical sessions. ? Extended versions of selected papers presented during the conference will be published as Special Issue(s). IMPORTANT DATES: + Paper submission (strict deadline): May 24, 2021, 23:59:59 (UCT-12; there will be no extension) + Position paper submission: June 14, 2021 + Author notification: July 5, 2021 + Final paper submission and registration: July 26, 2021 + Conference date: September 2-5, 2021 Please forward this announcement to your colleagues and associates who could be interested in it. STEERING COMMITTEE: ? Janousek, Jan, Czech Technical University, Czech Republic ? Lukovi?, Ivan, University of Novi Sad, Serbia ? Mernik, Marjan, University of Maribor, Slovenia ? Slivnik, Bo?tjan, University of Ljubljana, Slovenia ? Rangel Henriques, Pedro, Universidade do Minho, Portugal ? Varanda Pereira, Maria Joao, Instituto Politecnico de Braganca, Portugal PROGRAM COMMITTEE: ? Barisic, Ankica, Universit? C?te d'Azur, France ? Blasband, Darius, RainCode Labs, Belgium ? Falcou, Joel, Univerist? Paris Sud, France ? Fernandes, Joao ? Horv?th, Zolt?n, E?tv?s Lor?nd University, Hungary ? Kardas, Geylani, Ege University, Turkey ? Keir, Paul, University of the West of Scotland, United Kingdom ? Kosar, Tomaz, University of Maribor, Slovenia ? Mandreoli, Federica, DII - University of Modena, Italy ? Mila?inovi?, Boris, University of Zagreb, Hungary ? Papaspyrou, Nikolaos S., National Technical University of Athens, Greece ? Porub?n, Jaroslav, Technical University of Ko?ice, Slovakia ? Ramezanian, Rasoul, Ferdowsi University of Mashhad, Iran ? Saraiva, Joao, Universidade do Minho, Portugal ? Sierra, Jose Luis, Universidad Complutense de Madrid, Spain ? Singer, Jeremy, University of Glasgow, United Kingdom ? Varanda Pereira, Maria Jo?o, Instituto Politecnico de Braganca, Portugal ? Zaytsev, Vadim, Universiteit Twente, The Netherlands TECHNICAL SESSION CHAIR: ? Seyed Hossein Haeri, IOHK and University of Bergen, Norway Contact: hossein.haeri at gmail.com -------------------------------------------------------------------------------------------------------------- Seyed H. HAERI (Hossein), Dr. Software Scientist Formal Methods Team IOHK Adjunct Associate Professor Department of Informatics University of Bergen, Norway ACCU - Professionalism in programming - http://www.accu.org/ -------------------------------------------------------------------------------------------------------------- From andrei.h.popescu at gmail.com Wed May 19 15:27:14 2021 From: andrei.h.popescu at gmail.com (Andrei Popescu) Date: Wed, 19 May 2021 20:27:14 +0100 Subject: [TYPES/announce] Position of Lecturer or Senior Lecturer in Cybersecurity at University of Sheffield Message-ID: Greetings, The Department of Computer Science at University of Sheffield has an open position of Lecturer or Senior Lecturer in Cybersecurity. Details can be found here: https://www.jobs.ac.uk/job/CFN168/lecturer-senior-lecturer-in-cybersecurity Note that "formalisation and proof of system security properties" is listed as a topic of interest. Women are particularly encouraged to apply. All applicants will be given equal consideration. Best wishes, Andrei From C.Kop at cs.ru.nl Thu May 20 06:54:44 2021 From: C.Kop at cs.ru.nl (Cynthia Kop) Date: Thu, 20 May 2021 12:54:44 +0200 Subject: [TYPES/announce] PhD position in higher-order rewriting and program equivalence at Radboud University Nijmegen Message-ID: <6dec31fd-01b7-1eee-2e03-81f1f1448db2@cs.ru.nl> Dear all, There is currently a PhD position available at Radboud University Nijmegen (the Netherlands) in the topic /Higher-order Term Rewriting for Program Equivalence/. The position is for four years, and comes with a competitive salary and very attractive employment conditions. Interested students who either already hold a Masters' degree in computer science, mathematics, or a related area, or who will complete such a degree before September, are encouraged to apply. The initial application deadline is 20 June, but will be extended if no suitable candidate is found by that time. *The project* As a PhD candidate, you will conduct research into higher-order term rewriting systems with logical constraints. This project brings together two different areas of theoretical computer science: /higher-order term rewriting/ and /program equivalence analysis/. /Term rewriting/ is a formal system that can be used to specify algorithms. Its simple, rigorous definition makes it very suitable for formal analysis, and as a result, its properties are well studied. Higher-order term rewriting extends standard term rewriting with anonymous functions and binders as in the lambda-calculus, thus providing a highly liberal class of systems. Term rewriting can be combined with a logical theory and logical constraints; for example, integer numbers and conditions such as x >= 1 /\ y != x. With this approach, it Is possible to model programs in common programming languages; higher-order term rewriting systems in particular offer a natural model to analyse functional and object-oriented programming languages. /Program equivalence analysis/ is the study of whether two systems of program code have the same result, given the same input. This is a challenging field with many applications both in business practice and in other areas of computing science. In this project, your task will be to develop techniques for program equivalence analysis, by analysing in particular higher-order term rewriting systems with logical constraints, which encode realistic programs. The majority of the project is the development of theory, but since it is a goal to develop automatable techniques, you will also implement some of your techniques in a prototype analysis tool. You will be supervised by Dr Cynthia Kop. If you wish to learn more, feel free to send an e-mail to C.Kop at cs.ru.nl. *Work environment* Strategically located in Europe, Radboud University is one of the leading academic communities in the Netherlands. It is a place with a personal touch, where top-notch education and research take place on a beautiful green campus, in modern buildings with state-of-the-art facilities. The position is available in the Software Science group of the Institute for Computing and Information Sciences (iCIS) at Radboud University. Research at iCIS focuses on software science, digital security and data science. During recent evaluations, iCIS has been consistently ranked as the No. 1 Computing Science department in the Netherlands. Evaluation committees praised our flat and open organisational structure, our ability to attract external funding, our strong ties to other disciplines, and our solid contacts with government and industrial partners. The Software Science group is well known for its contributions to the mathematical foundations of software, formal methods, and functional programming. *What we expect from you* * you will be able to start at some time between the end of August and the end of November; * you hold an Msc or equivalent degree in computer science, mathematics or a closely related field -- or will graduate from such a field before starting the PhD position; * you are able to work both independently and as part of a team; * you are proficient in English (knowledge of Dutch is not required); * you have some programming experience. Note that prior knowledge of term rewriting or implicit complexity is not required. *What we have to offer* * employment: 1.0 FTE; * a maximum gross monthly salary of ??2,972 based on a 38-hour working week; * the gross starting salary amounts to ?2,325 per month, and will increase to ?2,972 in the fourth year; * in addition to the salary: an 8% holiday allowance and an 8.3% end-of-year bonus; * duration of the contract: 4 years; * your performance will be evaluated after 18 months. If the evaluation is positive, the contract will be extended by 2.5 years; * you will be classified as a PhD Candidate (promovendus) in the Dutch university job-ranking system (UFO); * you will be able to make use of our dual career service ( https://www.ru.nl/english/working-at/why-work-at-radboud-university-0/our-way-working-personal-approach/dual-career-service/ ) where our Dual Career Officer will assist with family related support, such as child care, and help your partner prepare for the local labour market and with finding an occupation; * For our employment conditions, see https://www.ru.nl/english/working-at/why-work-at-radboud-university-0/terms-employment/ . *How to apply* Submit a motivation letter, your CV, and a list of courses taken and grades obtained by e-mail to C.Kop at cs.ru.nl (you will receive a notification confirming when it has arrived). -------------- next part -------------- An HTML attachment was scrubbed... URL: From mail at robbertkrebbers.nl Thu May 20 08:52:56 2021 From: mail at robbertkrebbers.nl (Robbert Krebbers) Date: Thu, 20 May 2021 14:52:56 +0200 Subject: [TYPES/announce] PhD or postdoc position on program verification in Coq/Iris at Radboud University Nijmegen Message-ID: <3937411c-e979-6582-9c61-4cb852971c6f@robbertkrebbers.nl> Dear all, I have an opening for a 4 year PhD position at Radboud University. The position comes with an attractive salary and employment conditions. In case of an exceptionally strong candidate, the PhD position can be turned into a postdoc position for 1.5 to 2 years. The project involves the development of automatic methods for program verification based on concurrent separation logic and type systems. You will apply the developed methods to verify security and correctness properties of a realistic hypervisor written in C, as part of an ongoing collaborative project with Google, MPI-SWS, Cambridge, SNU, and Aarhus. The foundations of this project will be developed on top of the Iris framework for concurrent separation logic in the Coq proof assistant. Iris has been developed over the last 5 years in collaboration with MPI-SWS and Aarhus, and has been used by (and received many contributions from) a large network of other institutes (including Aarhus University, BedRock Systems, Boston College, CNRS/LRI, Groningen University, INRIA, ITU Copenhagen, KU Leuven, Microsoft Research, MIT, MPI-SWS, NYU, Saarland University, and Vrije Universiteit Brussel). See https://iris-project.org/ for the many projects and papers that involve Iris. **Requirements**: You have a strong background in programming language theory and formal verification. You like to work on deep foundational research, and apply your research to verification of real-life software. You are required to have a master's degree (or equivalent) in computer science or mathematics (or you expect to obtain such a degree soon). Prior knowledge of Coq is preferred. **Application**: The initial application deadline is 20 June, but will be extended if no suitable candidate is found by that time. To apply for the position, please send a resume, grade transcript, motivation letter and research statement to me at robbert at cs.ru.nl. If you have questions, do not hesitate to contact me before submitting an application. **Employment conditions**: Radboud University offers an attractive salary (the gross salary of a PhD student starts at 2.395 EUR per month, and increases to 3.061 EUR per month in the last year, based on a 38-hour working week) and excellent employment conditions (including 8% holiday allowance, 8% end-of-year bonus, assistance with family-related support such as child care). See https://www.ru.nl/phd/ for more information. The starting date is flexible, but I would prefer it if you could start between the end of August and the end of November. Best regards, Robbert Krebbers Associate Professor in Computer Science Radboud University Nijmegen, The Netherlands robbert at cs.ru.nl https://robbertkrebbers.nl From jonathan.protzenko at gmail.com Thu May 20 23:19:49 2021 From: jonathan.protzenko at gmail.com (Jonathan Protzenko) Date: Thu, 20 May 2021 20:19:49 -0700 Subject: [TYPES/announce] ML Family Workshop 2021: final call for short abstracts and presentations Message-ID: <911f233b-c506-06d4-3cad-b37a720a7b82@gmail.com> (tl;dr) The ML family workshop is back, and the deadline is in a week. The workshop does not have proceedings, making it the perfect venue to run some ideas with the community or present some work in progress within a friendly environment. The PC has a broad expertise and submissions are 3 pages long: when in doubt, just submit! (long version) We are happy to announce that the ML Family Workshop is back for its 2021 edition, which we will be held online on Thursday August 26th, in conjunction with ICFP 2021. The ML family workshop warmly welcomes submission touching on the programming languages traditionally seen as part of the "ML family" (Standard ML, OCaml, F#, CakeML, SML#, Manticore, MetaOCaml, etc.). The scope of the workshop includes all aspects of the design, semantics, theory, application, implementation, and teaching of the members of the ML family. We also encourage presentations from related languages (such as Haskell, Scala, Rust, Nemerle, Links, Koka, F*, Eff, ATS, etc), to exchange experience of further developing ML ideas. ## Submission details Submissions must be at most three pages long; see the full call for papers for details. Submission site: https://ml21.hotcrp.com/ ## Important dates Thu, May 27th 2021 (AoE): submission deadline Thu, Jun 17th 2021 (AoE): author notification Thu, Aug 26th: workshop (time slots TBD) ## Program committee Danel Ahman (University of Ljubljana) Robert Atkey (University of Strathclyde) Fr?d?ric Bour (Tarides) Ezgi ?i?ek (Facebook London) Youyou Cong (Tokyo Institute of Technology) Richard A. Eisenberg (Tweag I/O) Martin Elsman (University of Copenhagen, Denmark) Ohad Kammar (University of Edinburgh) Naoki Kobayashi (University of Tokyo, Japan) Beno?t Montagu (Inria) Jonathan Protzenko (Microsoft Research) (Chair) Kristina Sojakova (INRIA Paris) Don Syme (Microsoft) Mat?as Toro (University of Chile) Katsuhiro Ueno (Tohoku University) From Simon.Gay at glasgow.ac.uk Fri May 21 08:32:46 2021 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Fri, 21 May 2021 13:32:46 +0100 Subject: [TYPES/announce] ICALP 2021: Call for Student Volunteers Message-ID: <3d8c061b-b698-73e4-6802-780b8c1a8514@glasgow.ac.uk> ICALP 2021 is offering a student volunteer programme which offers free registration in exchange for technical assistance with running the sessions. Please check http://easyconferences.eu/icalp2021/registration/ for details. The main duties of a student volunteer: - To provide support in technical sessions, either for the main conference or workshops or both. This mainly consists of helping presenters to work with the online conference platform. Training will be given. - To help with social sessions, in as-yet-unspecified ways ? for example, helping to assign people to groups, or technical troubleshooting. - To answer queries from conference participants, passing such queries to members of the organising committee if necessary. The dates when you will be needed are as follows: - Morning of the 1st and afternoon of the 2nd July for conference rehearsal and training. - Tuesday 13th to Friday 16th July inclusive for the main conference - though you will only be asked to volunteer over two of these days. We will do our best to accomodate preferences in our scheduling. The benefits of volunteering: - Helping with a major event. - Experience for your CV. - Free registration for the conference, including access to social events and invited talks. However, you will not have a free choice of technical sessions because you will be assigned to certain sessions as a volunteer. - Camaraderie with fellow volunteers, and our gratitude - we are planning appreciation events for our student volunteers. If you are interested in volunteering, please see the draft job description, and email Dr Jess Enright (jessica.enright at glasgow.ac.uk) to register your interest, including ?ICALP Student Volunteer? in the subject line. Applications are open until sufficient volunteers are recruited, or until June 18th at the latest. You should be notified of the outcome of your application within 5 business days of your application. From Radu.Iosif at univ-grenoble-alpes.fr Fri May 21 13:30:19 2021 From: Radu.Iosif at univ-grenoble-alpes.fr (Radu Iosif) Date: Fri, 21 May 2021 19:30:19 +0200 Subject: [TYPES/announce] PhD positions in Grenoble, France Message-ID: The VERIMAG laboratory in Grenoble (http://www-verimag.imag.fr/) is seeking several outstanding PhD candidates to fill 3-years funded positions on the following subjects: 1. Software Vulnerability Analysis with Respect to Countermeasure and Attacker Models Advisors: Marie-Laure.Potet and Laurent.Mounier URL: https://www-verimag.imag.fr/Funded-PhD-software-vulnerability.html 2. Convex Polyhedra in Floating Point Advisors: David Monniaux and Michael Perin URL: https://www-verimag.imag.fr/Convex-polyhedra-in-floating-point.html 3. Decision Procedures for Inductive Separation Logic Modulo Data Theories Advisors: Nicolas Peltier (LIG) and Radu Iosif (VERIMAG) URL: http://nts.imag.fr/images/2/25/SepLogDataPhD.pdf 4. Proving Correctness of Reconfigurable Systems Advisors: Radu Iosif URL: http://nts.imag.fr/images/5/58/Reconfiguration.pdf This list is not exhaustive and we encourage potential candidates to contact us and discuss possible alternative subjects. How to apply: contact directly the person in charge for each subject. In the French system, PhD candidates start their work with a 6-month internship (part of the Master) before signing up for a 3-year PhD contract. The internship is not required for students coming from non-French universities (including the European Union) that may start working directly on their PhD. Hosting institution: VERIMAG is an academic laboratory focusing on theoretical and practical aspects of formal methods for embedded system development. Since its creation, in 1993, VERIMAG has a proven record in both basic theoretical research and in development of tools for system verification. In the recent years, VERIMAG became deeply involved in the area of rigorous construction of embedded cyber-physical systems. VERIMAG hosts 20 professors, 7 full-time researchers and over 15 PhD students. -------------- next part -------------- An HTML attachment was scrubbed... URL: From hossein.haeri at gmail.com Fri May 21 18:54:00 2021 From: hossein.haeri at gmail.com (Seyed H. HAERI (Hossein)) Date: Sat, 22 May 2021 00:54:00 +0200 Subject: [TYPES/announce] Link Correction - CFP: 8th Workshop on Advances in Programming Languages (WAPL'21) In-Reply-To: References: Message-ID: The correct link for WAPL is: https://fedcsis.org/2021/wapl My apologies for the mistake. On Wed, 19 May 2021 at 17:23, Seyed H. HAERI (Hossein) wrote: > > CALL FOR PAPERS > > ******************************************************************************* > > 8th Workshop on Advances in Programming Languages (WAPL'21) > https://www.fedcsis.org/2021/sew-iwcps > > Organized within 2021 Federated Conference on Computer Science and > Intelligence Systems (FedCSIS'21; IEEE #52320) > > ***************************** COVID-19 Information **************************** > > While we have planned the 2021 conference to take place in Sofia, > Bulgaria, slow progress in fighting the global pandemic has forced us > to switch to the fully online mode. Therefore, we plan to organize > FedCSIS 2022 in Sofia, and hope that by that time COVID will be over, > and we will be able to meet in person. > > FedCSIS organizers > > ******************************************************************************* > > FOR PAPER SUBMISSION DEADLINES SEE THE BOTTOM OF THIS MESSAGE > > Programming languages (PLs) are programmers' most basic tools. With > appropriate programming languages one can drastically reduce the cost > of building new applications as well as maintaining existing ones. In > the last decades there have been many advances in PL technology in > traditional programming paradigms such as functional, logic, and > object-oriented programming, as well as the development of new > paradigms such as aspect-oriented programming. The main driving force > was and will be to better express programmers' ideas. Therefore, > research in programming languages is an endless activity and the core > of computer science. New language features, new programming paradigms, > and better compile-time and run-time mechanisms can be foreseen in the > future. > > The aim of this session is to provide a forum for exchange of ideas > and experience in topics concerned with programming languages and > systems. Original papers and implementation reports are invited in all > areas of programming languages. > > This year, a special attention will be given to submissions on > programming research in mainstream languages. That can include, but is > not limited to: > ? porting existing results from research languages to mainstream > ones to examine their interplay with other features than those > carefully cherry-picked for the targeted research. And, > ? gauging generality of research results by studying their > obtainability using different sets of features than originally thought > of. > > Such submission needs to clarify the added value of performing their > research in a mainstream language (over a lab one). > > Topics: > Major topics of interest include but are not limited to the following: > ? Software language engineering > ? Interplay between languages and machine learning (and other > branches of AI), especially for Code Repair and Code Smells > ? Interplay between languages and security > ? Automata theory and applications > ? Compiling techniques > ? Context-oriented programming languages to specify the behavior > of software systems and dynamic adaptations > ? Domain-specific languages > ? Formal semantics and syntax > ? Generative and generic programming > ? Grammarware and grammar based systems > ? Knowledge engineering languages, integration of knowledge > engineering and software engineering > ? Languages and tools for trustworthy computing > ? Language theory and applications > ? Language concepts, design and implementation > ? Markup languages (XML) > ? Metamodeling and modeling languages > ? Model-driven engineering languages and systems > ? Practical experiences with programming languages > ? Program analysis, optimization and verification > ? Program generation and transformation > ? Programming paradigms (aspect-oriented, functional, logic, > object-oriented, etc.) > ? Programming tools and environments > ? Proof theory for programs > ? Specification languages > ? Type systems > ? Virtual machines and just-in-time compilation > ? Visual programming languages > > > ZDZIS?AW PAWLAK BEST PAPER AWARD > > The Professor Zdzis?aw Pawlak Awards are given in two categories: Best > Paper and Best Student Paper. Each award carries a prize of 300 EUR > founded by the Mazowsze Chapter of the Polish Information Processing > Society. The awards have been originally associated with the > International Symposium on Advanced Artificial Intelligence in > Applications (AAIA) held every year as a part of FedCSIS. Currently, > all papers accepted to FedCSIS are eligible to be considered as the > award winners. > > This award will be awarded independently from awards given by > individual FedCSIS events (Tracks and/or Technical Sessions). > > Past Award winners can be found here: https://fedcsis.org/2021/zp_award > > > PAPER PUBLICATION: > > ? Authors should submit draft papers (as Postscript, PDF or MSWord file). > ? The total length of a paper should not exceed 10 pages IEEE > style (including tables, figures and references). IEEE style templates > are available here. > ? Papers will be refereed and accepted on the basis of their > scientific merit and relevance to the workshop. > ? Preprints containing accepted papers will be published on a USB > memory stick provided to the FedCSIS participants. > ? Only papers presented at the conference will be published in > Conference Proceedings and submitted for inclusion in the IEEE Xplore? > database. > ? Conference proceedings will be published in a volume with ISBN, > ISSN and DOI numbers and posted at the conference WWW site. > ? Conference proceedings will be indexed in BazEkon and submitted > for indexation in: Thomson Reuters - Conference Proceedings Citation > Index, SciVerse Scopus, Inspec, Index Copernicus, DBLP Computer > Science Bibliography and Google Scholar > ? Organizers reserve right to move accepted papers between FedCSIS > technical sessions. > ? Extended versions of selected papers presented during the > conference will be published as Special Issue(s). > > > IMPORTANT DATES: > > + Paper submission (strict deadline): May 24, 2021, 23:59:59 (UCT-12; > there will be no extension) > + Position paper submission: June 14, 2021 > + Author notification: July 5, 2021 > + Final paper submission and registration: July 26, 2021 > + Conference date: September 2-5, 2021 > > > Please forward this announcement to your colleagues and associates who > could be interested in it. > > > STEERING COMMITTEE: > > ? Janousek, Jan, Czech Technical University, Czech Republic > ? Lukovi?, Ivan, University of Novi Sad, Serbia > ? Mernik, Marjan, University of Maribor, Slovenia > ? Slivnik, Bo?tjan, University of Ljubljana, Slovenia > ? Rangel Henriques, Pedro, Universidade do Minho, Portugal > ? Varanda Pereira, Maria Joao, Instituto Politecnico de Braganca, Portugal > > > PROGRAM COMMITTEE: > > ? Barisic, Ankica, Universit? C?te d'Azur, France > ? Blasband, Darius, RainCode Labs, Belgium > ? Falcou, Joel, Univerist? Paris Sud, France > ? Fernandes, Joao > ? Horv?th, Zolt?n, E?tv?s Lor?nd University, Hungary > ? Kardas, Geylani, Ege University, Turkey > ? Keir, Paul, University of the West of Scotland, United Kingdom > ? Kosar, Tomaz, University of Maribor, Slovenia > ? Mandreoli, Federica, DII - University of Modena, Italy > ? Mila?inovi?, Boris, University of Zagreb, Hungary > ? Papaspyrou, Nikolaos S., National Technical University of Athens, Greece > ? Porub?n, Jaroslav, Technical University of Ko?ice, Slovakia > ? Ramezanian, Rasoul, Ferdowsi University of Mashhad, Iran > ? Saraiva, Joao, Universidade do Minho, Portugal > ? Sierra, Jose Luis, Universidad Complutense de Madrid, Spain > ? Singer, Jeremy, University of Glasgow, United Kingdom > ? Varanda Pereira, Maria Jo?o, Instituto Politecnico de Braganca, Portugal > ? Zaytsev, Vadim, Universiteit Twente, The Netherlands > > > > TECHNICAL SESSION CHAIR: > > ? Seyed Hossein Haeri, IOHK and University of Bergen, Norway > > Contact: hossein.haeri at gmail.com > > -------------------------------------------------------------------------------------------------------------- > > Seyed H. HAERI (Hossein), Dr. > > Software Scientist > Formal Methods Team > IOHK > > Adjunct Associate Professor > Department of Informatics > University of Bergen, Norway > > ACCU - Professionalism in programming - http://www.accu.org/ > -------------------------------------------------------------------------------------------------------------- From Frank.Piessens at cs.kuleuven.be Mon May 24 10:14:29 2021 From: Frank.Piessens at cs.kuleuven.be (Frank Piessens) Date: Mon, 24 May 2021 16:14:29 +0200 Subject: [TYPES/announce] IEEE SecDev 2021 CFP Message-ID: IEEE SecDev is a venue for presenting ideas, research, and experience about how to develop secure systems. It focuses on theory, techniques, and tools to ?build security in? to existing and new computing systems, and does not focus on simply discovering the absence of security. Call For Papers and Tutorials We solicit research papers, position papers, and "best practice" papers on a broad range of topics relating to secure systems development. Examples of topics that are in scope include: development libraries, tools, or processes to produce systems resilient to certain attacks; formal foundations that underpin a language, tool, or testing strategy that improves security; techniques that drastically improve the scalability of security solutions for practical deployment; and experience, designs, or applications showing how to apply cryptographic techniques effectively to secure systems. SecDev also seeks hands-on and interactive tutorials on processes, frameworks, languages, and tools for building security in. The goal is to share knowledge on the art and science of secure systems development. SecDev also seeks posters and tool demos, and abstracts from practitioners to share their practical experiences and challenges in security development. Information on these solicitations are available on the SecDev website https://secdev.ieee.org/2021/home/ Areas of interest include (but are not limited to): ? Security/resiliency-focused system designs (HW/SW/architecture) ? Tools and methodology for secure code development ? Risk management and testing strategies to improve security ? Security engineering processes, from requirements to maintenance ? Security benchmarks ? Comparative experimental evaluation ? From research to practice - gaps and transitions ? Programming languages, development tools, and ecosystems supporting security ? Static program analysis for software security ? Dynamic analysis and runtime approaches for software security ? Automation of programming, deployment, and maintenance tasks for security ? Software ecosystem and software supply chain security ? Distributed systems design and implementation for security ? Privacy by design ? Human-centered design for systems security ? Formal verification and other high-assurance methods for security ? Code reviews, red teams, and other human-centered assurance Submission Details ? The website for submissions: https://secdev2021.hotcrp.com/ ? Submissions must use the two-column IEEE Proceedings style: https://www.ieee.org/conferences/publishing/templates.html Submissions must be one of two categories: ? Papers, up to 6 pages, excluding references and well-marked appendices. These must be well-argued and worthy of publication and citation, on the topics above. Research papers must present new work, evidence, or ideas. Position papers with exceptional visions will also be considered. Authors of accepted papers will present their work at the conference (e.g., in a 30-minute slot) and their papers will appear in the conference?s formal IEEE proceedings. To improve the fairness of the reviewing process, SecDev will follow a light-weight double-blind reviewing process. Submitted papers must (a) omit any reference to the authors? names or the names of their institutions, and (b) reference the authors? own related work in the third person (e.g., not ?We build on our previous work ?? but rather ?We build on the work of ??). Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult (e.g., important background references should not be omitted or anonymized). Please see the double-blind FAQ for the answers to many common concerns about SecDev?s double-blind reviewing process. When in doubt, contact the program chairs. ? Tutorial proposals, up to 2 pages and cover (a) the topic; (b) a summary of the tutorial format highlighting hands-on aspects and possibly pointers to relevant materials; (c) the expected audience and expected learning outcomes; (d) prior tutorials or talks on similar topics by the authors (and audience size), if any. The title of the submission should be prefixed with ?Tutorial:?. Tutorial proposals do not need to be anonymized. Accepted tutorials should aim to be either 90 minutes or 180 minutes long. We strongly encourage tutorials to have hands-on components and audience interactions. We do not recommend simply slide presentations. Accepted tutorials may provide an abstract that will appear in the conference?s formal IEEE proceedings. Tutorials will occur on the first day of the conference (Monday October 18). Note that if an accepted tutorial requires special materials or environments for the hands-on participation, we expect the authors to provide necessary preparation instructions for the attendees. At least one author of each accepted paper and tutorial must register for the conference and present the paper/tutorial. We are devoted to seeking broad representation in the program, and may take this into account when reviewing multiple submissions from the same authors. If you have any questions, please email us: secdev21-pc at ieee.org. Important Dates ? Paper submission deadline: June 4th, 2021 ? Author notification: August 6th, 2021 ? Camera-ready: September 10, 2021 ? Conference: October 18-20, 2021 -------------- next part -------------- An HTML attachment was scrubbed... URL: From bcpierce at cis.upenn.edu Wed May 26 08:45:00 2021 From: bcpierce at cis.upenn.edu (Benjamin Pierce) Date: Wed, 26 May 2021 08:45:00 -0400 Subject: [TYPES/announce] =?utf-8?q?New_Software_Foundations_title=3A_Sep?= =?utf-8?q?aration_Logic_Foundations_by_Arthur_Chargu=C3=A9raud?= Message-ID: The Software Foundations team is pleased to announce another new volume in the series and significant updates to other volumes. *NEW! *Software Foundations volume 6, Separation Logic Foundations , by Arthur Chargu?raud, is an in-depth introduction to separation logic?a practical approach to modular verification of imperative programs?and how to build program verification tools on top of it. [image: image.png] *UPDATED!* Volume 2, *Programming Language Foundations* *,* surveys the theory of programming languages, including operational semantics, Hoare logic, and static type systems. The concrete notations in this volume have been extensively revamped for better readability, using the advanced Notation features of recent versions of Coq. The other volumes in the series have been updated to track the current Coq release and incorporate many large and small improvements made since the last release. Watch for a major update to Volume 5, Verifiable C , later this summer! All Software Foundations titles are available electronically, free of charge. Share and enjoy! - Benjamin -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: image.png Type: image/png Size: 131868 bytes Desc: not available URL: From andrei.h.popescu at gmail.com Wed May 26 09:23:15 2021 From: andrei.h.popescu at gmail.com (Andrei Popescu) Date: Wed, 26 May 2021 14:23:15 +0100 Subject: [TYPES/announce] =?utf-8?q?PhD_position_on_the_formalization_of_?= =?utf-8?q?logical_calculi_in_Saarbr=C3=BCcken?= Message-ID: A PhD position is open at the MPI for Informatics in Saarbr?cken, supervised by Christoph Weidenbach, Jasmin Blanchette and Sophie Tourret. The project is about using Isabelle/HOL to formalize logical calculi. See https://www.cs.vu.nl/~jbe248/sb_job.html for more information. From s.lasota at uw.edu.pl Thu May 27 15:16:29 2021 From: s.lasota at uw.edu.pl (=?UTF-8?Q?S=C5=82awomir_Lasota?=) Date: Thu, 27 May 2021 21:16:29 +0200 Subject: [TYPES/announce] Highlights of Logic, Games, and Automata 2021: 3rd Call for Presentations In-Reply-To: References: Message-ID: ******************************************************** HIGHLIGHTS 2021: 9th annual conference on Highlights of LOGIC, GAMES, and AUTOMATA 15-17 September 2021, online (originally planned to be held in Aachen) http://highlights-conference.org We invite submissions for contributed talks (around 10 minutes). IMPORTANT DATES: + Submission deadline: 4 JUNE AoE + Notification: 18 JUNE SUBMISSION WEB PAGE: https://easychair.org/conferences/?conf=highlights2021 ******************************************************** HIGHLIGHTS 2021 is the 9th conference on Highlights of Logic, Games, and Automata that aims to integrate the diverse research community working in the areas of Logic, Finite Model Theory, Automata Theory, Games 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 three-day conference (15-17 September) will be preceded by a tutorial day (14 September). This year's edition will be held online, with no registration fees or with a moderate one (around 10 EUR). TUTORIALS (September 14) + Christoph Haase, "A guided tour through Presburger arithmetic and friends" + Micha? Pilipczuk, "Old and new advances in model checking first order logic" KEYNOTES + Rajeev Alur + Balder ten Cate + Karoliina Lehtinen + Nutan Limaye + Joel Ouaknine -------------- next part -------------- An HTML attachment was scrubbed... URL: From david.nowak at univ-lille.fr Fri May 28 02:40:14 2021 From: david.nowak at univ-lille.fr (David Nowak) Date: Fri, 28 May 2021 08:40:14 +0200 Subject: [TYPES/announce] PhD position on program verification in Coq Message-ID: <72A3C904-CC85-40ED-8675-0772BB94399F@univ-lille.fr> Dear all, We have an opening for a 3-year PhD position at University of Lille, France. The successful applicant will be funded -- including salary and (international) conference travel -- through a new French-German ANR-funded project. There will also be an opportunity to collaborate with a research team in Japan. Lille is at the heart of Europe: 45 minutes from Bruxelles, 1 hour from Paris, 1 hour and half from London. This is an important university hub that hosts the annual International Cybersecurity Forum (FIC). The start date is September 1st, but might possibly be postponed to October 1st. The PhD position is about the formal proof in Coq for shallow-embedded imperative programs and their compilation into C (more details below). Interested students should meet the following requirements: - Be interested by the topic of the PhD :-) - Have or be about to complete a Master in Computer Science or a related field (Logic, Mathematics, etc.). If you are interested in applying for this opportunity please begin by contacting us {gilles.grimaud,samuel.hym,david.nowak}@univ-lille.fr as soon as possible with the following information: - CV/Resume - A brief introduction of yourself, your scientific interests, and if you are familiar with any of the following topics: * formal proof / formal verification, * functional programming * monads * semantics ??????????????????????????????????? Summary: The topic of this PhD offer is the formal proof in Coq for shallow-embedded imperative programs and their compilation into C. More precisely, the objective is to conceive and develop formal tools to simplify code writing and proof of system software for low-end devices. Context: The Coq proof assistant [1] allows to prove properties of programs. Its language, called Gallina, is purely functional. In the Pip project [2], we have considered a monadic subset of C-like Gallina enough to formally write an OS kernel. Objectives: A first objective of this PhD is to extend the monadic subset in order to include further imperative features (such as loops, references or exceptions) that will simplify code writing and proof of system software for low-end devices. For security properties the monadic Hoare logic used for Pip will have to be extended to deal with the new imperative features. For functional properties, there are two possible directions: either use the monadic Hoare logic or monadic equational reasoning as developed in Monae [3]. The relation with FreeSpec [4] should also be investigated. A second objective is to automatically translate programs written in this monadic subset into an AST of the CompCert C verified compiler [5] and to prove formally that this translation is correct, in the sense that properties proved on the monadic subset are also true of the generated C code. [1] https://coq.inria.fr [2] http://pip.univ-lille1.fr [3] https://github.com/affeldt-aist/monae [4] https://github.com/lthms/FreeSpec [5] https://compcert.org ??????????????????????????????????? All the best, -- Gilles Grimaud, Samuel Hym, David Nowak -------------- next part -------------- An HTML attachment was scrubbed... URL: From peter.mueller at inf.ethz.ch Fri May 28 08:49:41 2021 From: peter.mueller at inf.ethz.ch (Mueller Peter) Date: Fri, 28 May 2021 12:49:41 +0000 Subject: [TYPES/announce] PhD student and post-doc positions in Program Verification at ETH Zurich Message-ID: <6c081d4c29ec48bd96ba0ef7735b1c85@inf.ethz.ch> The Programming Methodology group (http://www.pm.inf.ethz.ch/) at ETH Zurich is recruiting PhD students and post-docs in the area of program verification. We are especially interested in strengthening our teams working on Rust verification (https://www.pm.inf.ethz.ch/research/prusti.html) and Go verification (https://www.pm.inf.ethz.ch/research/gobra.html). Our goal is to develop verification techniques and tools that can be used to prove correctness and security of advanced systems. Key requirements for successful applications: * Strong commitment to research * Interest in combining theory and practice * For PhD students: excellent M.Sc. degree in Computer Science or in a related subject with a strong Computer Science component * For post-docs: publications in top conferences or journals * Proficiency in English and excellent communication skills, both oral and written Applications and questions should be sent to Peter M?ller (jobs-pm at inf.ethz.ch). The application should include a CV and a description of research interests. We will consider applications until the positions are filled. The start date is negotiable. More details about the positions: * PhD and post-doc positions are fully funded and have an attractive salary and social benefits. * Full scholarships are available for outstanding B.Sc. students interested in the PhD. * ETH has one of the top computer science departments in the world * Zurich is consistently ranked among the top destinations in the world for quality of life. General information on doctoral studies at ETH is available at www.inf.ethz.ch/doctorate.html -------------- next part -------------- An HTML attachment was scrubbed... URL: From jonathan.protzenko at gmail.com Fri May 28 15:07:07 2021 From: jonathan.protzenko at gmail.com (Jonathan Protzenko) Date: Fri, 28 May 2021 12:07:07 -0700 Subject: [TYPES/announce] ML Family Workshop 2021: deadline extension Message-ID: The deadline for the ML family workshop has been extended by a week. If you were on the fence, please submit! --- We are happy to announce that the ML Family Workshop is back for its 2021 edition, which we will be held online on Thursday August 26th, in conjunction with ICFP 2021. The ML family workshop warmly welcomes submission touching on the programming languages traditionally seen as part of the "ML family" (Standard ML, OCaml, F#, CakeML, SML#, Manticore, MetaOCaml, etc.). The scope of the workshop includes all aspects of the design, semantics, theory, application, implementation, and teaching of the members of the ML family. We also encourage presentations from related languages (such as Haskell, Scala, Rust, Nemerle, Links, Koka, F*, Eff, ATS, etc), to exchange experience of further developing ML ideas. ## Submission details Submissions must be at most three pages long; see the full call for papers for details. Submission site: https://ml21.hotcrp.com/ ## Important dates Thu, Jun 3th 2021 (AoE): submission deadline Thu, Jun 24th 2021 (AoE): author notification Thu, Aug 26th: workshop (time slots TBD) ## Program committee Danel Ahman (University of Ljubljana) Robert Atkey (University of Strathclyde) Fr?d?ric Bour (Tarides) Ezgi ?i?ek (Facebook London) Youyou Cong (Tokyo Institute of Technology) Richard A. Eisenberg (Tweag I/O) Martin Elsman (University of Copenhagen, Denmark) Ohad Kammar (University of Edinburgh) Naoki Kobayashi (University of Tokyo, Japan) Beno?t Montagu (Inria) Jonathan Protzenko (Microsoft Research) (Chair) Kristina Sojakova (INRIA Paris) Don Syme (Microsoft) Mat?as Toro (University of Chile) Katsuhiro Ueno (Tohoku University) From s-dgq at thorsten-wissmann.de Sat May 29 10:42:38 2021 From: s-dgq at thorsten-wissmann.de (Thorsten Wissmann) Date: Sat, 29 May 2021 16:42:38 +0200 Subject: [TYPES/announce] CALCO 2021: Deadline extension and invited speakers Message-ID: <20210529144238.GA6418@dobby> [Apologies if you receive multiple copies of this message] ========================================================= CALL FOR PAPERS: CALCO 2021 9th International Conference on Algebra and Coalgebra in Computer Science 31 Aug - 03 Sep 2021 Salzburg, Austria (if possible) Co-located with MFPS XXXV ========================================================== Paper submission: 10 June 2021 AoE (NEW) Author notification: 29 July 2021 Final version due: 12 August 2021 ========================================================== Scope ===== Algebraic and coalgebraic methods and tools are a mainstay of computer science. From data types to development techniques and specification formalisms, both theoreticians and practitioners have benefited from the large body of research proposed and implemented since the pioneering works of the 1960s. CALCO aims to bring together researchers with interests in both foundational and applicative uses of algebra and coalgebra in computer science, traditional as well as emerging ones. CALCO is a high-level, bi-annual conference formed by joining the forces and reputations of CMCS (the International Workshop on Coalgebraic Methods in Computer Science) and WADT (the Workshop on Algebraic Development Techniques). Previous CALCO editions took place in Swansea (Wales, 2005), Bergen (Norway, 2007), Udine (Italy, 2009), Winchester (UK, 2011), Warsaw (Poland, 2013), Nijmegen (the Netherlands, 2015), Ljubljana (Slovenia,2017), and London (UK, 2019). The 9th edition will be held in Salzburg, Austria, co-located with MFPS XXXVII. Joint CALCO-MFPS Invited Speaker ================================ * Eugenia Cheng (School of the Art Institute of Chicago) CALCO Invited Speakers ====================== * Valeria De Paiva (Topos Institute, Berkeley) * Holger Giese (Hasso-Plattner Institute, Potsdam) * Viktor Vafeiadis (Max Plank Institute, Kaiserslautern) Joint CALCO-MFPS Special Session on Termination Analysis and Synthesis ====================================================================== * Azadeh Farzan (University of Toronto) Submission Categories ===================== CALCO invites papers relating to all aspects of algebraic and coalgebraic theory and applications, and distinguishes between four categories of submissions. 1. Regular papers that report * results on theoretical foundations * novel methods and techniques for software development * experiences with the technology transfer to industry. 2. (Co)Algebraic Pearls papers that * present possibly known material in a novel and enlightening way. 3. Early ideas abstracts that lead to * presentations of work in progress * proposals for original venues of research. 4. Tool presentation papers that * report on the features and uses of algebraic/coalgebra-based tools. Topics of Interests =================== All topics relating to algebraic and coalgebraic theory and applications are of interest for CALCO, and among them * Models and logics - Automata and languages - Graph transformations and term rewriting - Modal logics - Proof systems - Relational systems * Algebraic and coalgebraic semantics - Abstract data types - Re-engineering techniques (program transformation) - Semantics of conceptual modelling methods and techniques - Semantics of programming languages * Methodologies in software and systems engineering - Development processes - Method integration - Usage guidelines * Specialised models and calculi - Hybrid, probabilistic, and timed systems - Concurrent, distributed, mobile, cyber-physical, and context-aware computational paradigms - Systems theory and computational models (chemical, biological, etc.) * System specification and verification - Formal testing and quality assurance - Generative programming and model-driven development - Integration of formal specification techniques - Model-driven development - Specification languages, methods, and environments * Tools supporting algebraic and coalgebraic methods for - Advances in automated verification - Model checking - Theorem proving - Testing * String diagrams and network theory - Theory of PROPs and operads - Rewriting problems and higher-dimensional approaches - Automated reasoning with string diagrams - Applications of string diagrams * Quantum computing - Categorical semantics for quantum computing - Quantum calculi and programming languages - Foundational structures for quantum computing - Applications of quantum algebra Submissions Guidelines ====================== All submissions will be handled via EasyChair https://easychair.org/conferences/?conf=calco2021 The format for all submissions is specified by LIPIcs. Please use the latest version of the style http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ It is recommended that submissions adhere to that format and length. Submissions that are clearly too long may be rejected immediately. Regular papers ============== Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Regular papers should be maximum 15 pages long, excluding references. Proofs omitted due to space limitations may be included in a clearly marked appendix. Each submission will be evaluated by at least three reviewers. Proceedings will be published in the Dagstuhl LIPIcs Leibniz International Proceedings in Informatics series. A special issue of the open access journal Logical Methods in Computer Science (http://www.lmcs-online.org) will contain the extended versions of selected papers. (Co)algebraic pearls ==================== This is a new submission category in 2021. Explaining a known idea in a new way may make as strong a contribution as inventing a new idea. We encourage the submission of pearls: elegant essays that illustrate an idea in a beautiful or didactically clever way, perhaps by developing an application. Pearls are typically short and concise and so should not be longer than regular papers in the format specified by LIPIcs. Authors who feel they need a bit more space should consult with the PC co-chairs. The accepted papers will be included in the final proceedings of the conference. Each submission will be evaluated by at least two reviewers. Early ideas abstracts ===================== Submissions should not exceed 2 pages in the format specified by LIPIcs. The volume of selected abstracts will be made available on arXiv and on the CALCO pages. Authors will retain copyright, and are also encouraged to disseminate the results by subsequent publication elsewhere. Each submission will be evaluated by at least two reviewers. Tool papers =========== Submissions should not exceed 5 pages in the format specified by LIPIcs. The accepted tool papers will be included in the final proceedings of the conference. The tools should be made available on the web at the time of submission for download and evaluation. Each submission will be evaluated by at least three reviewers, and one or more of the reviewers will be asked to download and use the tool. Best Paper and Best Presentation Awards ======================================= This edition of CALCO will feature two awards: a Best Paper Award whose recipients will be selected by the PC before the conference and a Best Presentation Award, elected by the participants. Programme Committee =================== * Zena M. Ariola (University of Oregon) * Paolo Baldan (University of Padova) * Rui Soares Barbosa (International Iberian Nanotechnology Laboratory) * Luis Caires (NOVA University Lisbon) * Francisco Dur?n (University of M?laga) * Brendan Fong (Massachusetts Institute of Technology) * Fabrizio Romano Genovese (University of Pisa) * Jules Hedges (University of Strathclyde, Glasgow) * Thomas Hildebrandt (IT University of Copenhagen) * Peter Jipsen (Chapman University) * Wolfram Kahl (McMaster University) * Marie Kerjean (CNRS -- Laboratoire d'Informatique de Paris Nord) * Jean Krivine (CNRS -- Universit? de Paris) * Michele Loreti (University of Camerino) * Sonia Marin (University College London) * Manuel A. Martins (University of Aveiro) * Annabelle McIver (Macquarie University) * Hernan Melgratti (University of Buenos Aires) * Koko Muroya (RIMS, Kyoto University) * Elaine Pimentel (UFRN) * Elvinia Riccobene (University of Milan) * Alex Simpson (University of Ljubljana) * David I. Spivak (Massachusetts Institute of Technology) * Christine Tasson (LIP6 - Sorbonne Universit?) * Tarmo Uustalu (Reykjavik University/Tallinn U. of Technology) * Maaike Zwart (University of Oxford) * Rob van Glabbeek (Data61 - CSIRO) Chairs ====== * Fabio Gadducci (University of Pisa) * Alexandra Silva (University College London) Local Organiser =============== * Ana Sokolova (University of Salzburg) From sebastien.bardin at cea.fr Sun May 30 17:38:53 2021 From: sebastien.bardin at cea.fr (=?iso-8859-1?Q?BARDIN_S=E9bastien?=) Date: Sun, 30 May 2021 21:38:53 +0000 Subject: [TYPES/announce] =?iso-8859-1?q?Two_positions_=28one_PhD_and_one?= =?iso-8859-1?q?_Postdoc=29_in_quantum_formal_verification_=40__Universit?= =?iso-8859-1?q?=E9_Paris-Saclay=2C_CEA_List=2C_France?= Message-ID: <330fbb8caeb149be8a27c42ac6ee6065@cea.fr> The emerging quantum software group @ CEA List, Universit? Paris-Saclay, offers 2 fully-funded positions at the crossroad of quantum programming, program analysis and formal methods. === OUR GROUP We are an emerging group in formal verification and static analysis of quantum programs, integrated in the Software Safety Laboratory of CEA List, Universit? Paris-Saclay. Our long term goal is to design and develop formal techniques and tools enabling productive and certified quantum programming. Especially, we develop Qbricks [1], a proof of concept environment for formally verified quantum programming language. See our website at https://qbricks.github.io/ for additional information. === Position#1 (3 years PhD) Probing quantum verification in the NISQ era The goal of this doctoral position is to probe formal verification against first generation of quantum application (NISQ era). Possibilities include, among other: extending Qbricks semantic and proof model to the hybrid paradigm, develop and implement a specification and proof system for error propagation and correction in quantum computing, develop certified ready-to-use NISQ applications. Keywords: quantum programming, formal verification, NISQ, quantum error correction === Position#2 (2 years PostDoc) The goal of this post-doctoral position is to extend formal verification practice to quantum compilation. Possibilities include, among others, error correction mechanisms in certified quantum code, together with specifications and reasoning technique for certifying its reliability, automatized certified optimizer for quantum circuits, hardware agnostic assembly language together with its compiler, Keywords: quantum programming, compilation, optimization, formal verification === HOW TO APPLY Applications should be sent to sebastien.bardin at cea.fr as soon as possible (first come, first served) and by early July 2021 at the latest. Candidates should send a CV, a cover letter, a transcript of all their university results, as well as contact information of two references. Each position is expected to start in October 2021. Advisors: S?bastien Bardin (CEA), Christophe Chareton (CEA) Contact: sebastien.bardin at cea.fr [1] C. Chareton, S. Bardin, F. Bobot, V. Perrelle, and B. Valiron. An Automated Deductive Verification Framework for Circuit-building Quantum Programs. ESOP 2021. -------------- next part -------------- An HTML attachment was scrubbed... URL: From eunsukk at andrew.cmu.edu Sun May 30 22:26:39 2021 From: eunsukk at andrew.cmu.edu (Eunsuk Kang) Date: Sun, 30 May 2021 22:26:39 -0400 Subject: [TYPES/announce] Postdoc position at CMU: Verified DSLs for high assurance systems Message-ID: We are looking for a motivated postdoctoral scholar to work on formal methods for the development of high-assurance software and cyber-physical systems. In particular, the project involves the development and enhancement of systems through the composition and verification of programs written in high-level domain-specific languages (DSLs). Potential research problems include: (1) design and implementation of DSLs for high-assurance autonomous systems, (2) compositional verification techniques for the DSLs, and (3) techniques for debugging and repair of DSL programs. You will also be expected to mentor PhD students involved in this project and contribute to the development of a scalable, practical DSL development environment. ** Location ** You will be a member of the Institute for Software Research, School of Computer Science at Carnegie Mellon University in the USA. Pending the evolving situation with COVID-19, you will be expected to work from Pittsburgh, PA. ** Qualifications ** Candidates are expected to have a PhD in Computer Science or related fields, with a strong background and research record in formal methods, software engineering, and/or programming languages. Familiarity with automated verification technologies (e.g., model checkers, SMT solvers) is desirable. ** Timeline ** The position is expected to begin in September 2021 for 1 year, with a possibility of extension. ** Instructions ** To apply, please send a copy of your latest CV and research statement to Eunsuk Kang (eskang at cmu.edu). -------------- next part -------------- An HTML attachment was scrubbed... URL: From sebastien.bardin at cea.fr Mon May 31 18:08:38 2021 From: sebastien.bardin at cea.fr (=?windows-1256?Q?BARDIN_S=E9bastien?=) Date: Mon, 31 May 2021 22:08:38 +0000 Subject: [TYPES/announce] =?cp1256?q?=5BPhD_grants=5D_Two_fully-funded_Ph?= =?cp1256?q?D_positions_in_software_security=2C_program_analysis_=26_forma?= =?cp1256?q?l_methods__=40__Universit=E9_Paris-Saclay=2C_CEA_List=2C_Franc?= =?cp1256?q?e?= Message-ID: The BINary-level SECurity research group (BINSEC) @ CEA offers 2 fully-funded Ph.D. positions at the crossroad of software security, program analysis and formal methods. We are looking for motivated applicants, interested in pursuing a Ph.D. degree in one of the following topics: === Topic#1 Speculating About Low-level Security Recent micro-architectural attacks take advantage of subtle behaviours at the micro-architectural levels, typically speculative behaviours introduced in modern architectures for efficiency, in order to bypass protections and leak sensitive data [4]. These vulnerabilities are extremely hard to find by a human expert, as they require to reason at a very low-level, on an exponential number of otherwise-hidden speculative behaviours, and on complex security properties (leaks and data interference, rather than standard memory corruptions). The goal of this doctoral work is to understand how automated symbolic verification methods (especially but not limited to, symbolic execution [2]) can be efficiently lifted to the case of speculative micro-architectural attacks, with the ultimate goal of securing essential security primitives in cryptographic libraries and OS kernels. Keywords: micro-architectural attacks, binary-level analysis, speculative executions, information leaks, symbolic execution Advisor: S?bastien Bardin (CEA), Tamara Rezk (Inria) Prior results: preliminary results on side channels and Spectre attacks published in top-tiers security conferences [1,3] Contact: sebastien.bardin at cea.fr References [1] Lesly-Ann Daniel, S?bastien Bardin, Tamara Rezk. Binsec/Rel: Efficient Relational Symbolic Execution for Constant-Time at Binary-Level. In S&P 2020 [2] Cristian Cadar, Koushik Sen: Symbolic execution for software testing: three decades later. Commun. ACM 56(2):82-90 (2013) [3] Lesly-Ann Daniel, S?bastien Bardin, Tamara Rezk. Hunting the Haunter: Efficient Relational Symbolic Execution for spectre with Haunted RelSE. In NDSS 2021 [4] Jo Van Bulck, Michael Schwarz et al. A Systematic Evaluation of Transient Execution Attacks and Defenses, in USENIX Security Symposium, 2019. === Topic#2 Binary-level static verification of embedded operating systems security Systems software need systems programming languages, like C, C++, or assembly, that gives programmers low-level control over resource management at the expense of safety. The goal of the PhD thesis is to design and implement a scalable sound static analysis [5] for systems software, targeting in particular OS kernels and hypervisors, that can efficiently verify advanced security properties directly from machine code [6] while requiring only a low amount of annotations. Keywords: abstract interpretation, advanced type systems, low-level code, operating systems, cybersecurity Advisor: Matthieu Lemerre (CEA), Mihaela Sighireanu (ENS Paris-Saclay) Prior results: preliminary results on scalable static analysis and kernel verification published in formal methods and systems conferences [1,2] Contact: matthieu.lemerre at cea.fr References [5] H. Illous, M. Lemerre, and X. Rival. Interprocedural shape analysis using separation logic-based transformer summaries. SAS, 2020. [6] O. Nicole, M. Lemerre, S. Bardin, and X. Rival. No Crash, No Exploit: Automated Verification of Embedded Kernels RTAS, 2021. (outstanding paper award) === HOW TO APPLY Detailed topics are available on demand. Applications should be sent to binsec-jobs at saxifrage.saclay.cea.fr as soon as possible (first come, first served) and by the end of June 2021 at the latest. Candidates should send the topic code(s) they are interested in, a CV, a cover letter, a transcript of all their university results, as well as contact information of two referees. Each Ph.D. position is expected to start in October 2021 and will have a duration of 3 years. == The BINSEC team @ CEA The BINary-level SECurity research group (BINSEC) of CEA List is a dynamic team of 4 senior researchers focusing on developing low-level program analysis tailored to security needs. The group has frequent publications in top-tier security, formal methods and software engineering conferences. We work in close collaboration with other French and international research teams, industrial partners and national agencies. The team is part of Universit? Paris-Saclay, the world?s 14th and European Union?s 1st university, according to Shanghai ARWU Ranking 2020. We have developed a high-level expertise in several binary-level code analysis approaches, namely formal methods, symbolic execution, abstract interpretation and fuzzing. We apply these techniques to low-level software security problems, covering notably vulnerability detection, malware analysis, code hardening and patching, criticality assessment and formal verification. See https://binsec.github.io/ for additional information. -------------- next part -------------- An HTML attachment was scrubbed... URL: From sebastien.bardin at cea.fr Mon May 31 18:22:27 2021 From: sebastien.bardin at cea.fr (=?Windows-1252?Q?BARDIN_S=E9bastien?=) Date: Mon, 31 May 2021 22:22:27 +0000 Subject: [TYPES/announce] =?windows-1252?q?=5BPostdoc_grants=5D_Three_ful?= =?windows-1252?q?ly-funded_postdoc_positions_in_software_security=2C_prog?= =?windows-1252?q?ram_analysis_=26_formal_methods__=40__Universit=E9_Paris?= =?windows-1252?q?-Saclay=2C_CEA_List=2C_France?= Message-ID: <4e7f5565abc949c0b65c6b6654241115@cea.fr> The BINary-level SECurity research group (BINSEC) @ CEA offers 3 fully-funded postdoc positions within the BINSEC team ( https://binsec.github.io ), at the crossroad of binary-level software security, program analysis and formal methods. We are looking for motivated applicants interested in pursuing a postdoc in one of the following topics: POSTDOC-hardening) Hardening software and guaranteeing code security POSTDOC-exploitability) Symbolic execution techniques for exploitability assessment POSTDOC-static) Static analysis techniques for software security To apply for one or several topic(s), candidates should send the topic code(s), a CV, a full list of publications, a cover letter, a transcript of all master-level university results and of all Ph.D. evaluation reports, as well as contact information of three referees to binsec-jobs at saxifrage.saclay.cea.fr as soon as possible (first come, first served) and by early July at the latest. Each position is expected to start between October and December 2021 and will have a duration of 2 or 3 years. Detailed topics are available on demand. == The BINSEC team @ CEA The BINary-level SECurity research group (BINSEC) of CEA List is a dynamic team of 4 senior researchers focusing on developing low-level program analysis tailored to security needs. The group has frequent publications in top-tier security, formal methods and software engineering conferences (recently: S&P 2020, NDSS 2021, CCS 2021, ICSE 2021, CAV 2021). We work in close collaboration with other French and international research teams, industrial partners and national agencies. The team is part of Universit? Paris-Saclay, the world?s 14th and European Union?s 1st university, according to Shanghai ARWU Ranking 2020. We have developed a high-level expertise in several binary-level code analysis approaches, namely formal methods, symbolic execution, abstract interpretation and fuzzing. We apply these techniques to low-level software security problems, covering notably vulnerability detection, malware analysis, code hardening and patching, criticality assessment and formal verification. -------------- next part -------------- An HTML attachment was scrubbed... URL: From davide.bresolin at unipd.it Tue Jun 1 05:11:15 2021 From: davide.bresolin at unipd.it (Davide Bresolin) Date: Tue, 1 Jun 2021 11:11:15 +0200 Subject: [TYPES/announce] CFP: GandALF2021 - 12th International Symposium on Games, Automata, Logics, and Formal Verification In-Reply-To: <5f823dba-4eb6-4eca-88de-9ced77c535fd@Spark> References: <5f823dba-4eb6-4eca-88de-9ced77c535fd@Spark> Message-ID: <024b053c-8bd0-407f-9a25-f553e9f55b22@Spark> ***************************************************************************** CALL FOR PAPERS - GandALF 2021 ***************************************************************************** The 12th International Symposium on Games, Automata, Logics, and Formal Verification will be held in Padua (Italy) on September 20-22, 2021. This year, GANDALF will be organised together with the 3rd Workshop on Artificial Intelligence and fOrmal VERification, Logic, Automata, and sYnthesis (OVERLAY 2021,?https://overlay.uniud.it/workshop/2021/). The OVERLAY workshop focuses on the relationships between Artificial Intelligence and Formal Methods, and discusses on the opportunities and challenges at the border of the two areas. Both events will be hosted by the University of Padua, and will share some invited speakers. We encourage participation in both events. GANDALF 2021 is planned to be a hybrid conference. We aim at organizing an in-presence event, but there will be possibilities for virtual participation for delegates affected by travel restrictions. https://gandalf2021.math.unipd.it/ ***************************************************************************** The aim of GandALF 2021 is to bring together researchers from academia and industry which are actively working in the fields of Games, Automata, Logics, and Formal Verification. The idea is to cover an ample spectrum of themes, ranging from theory to applications, and stimulate cross-fertilization. Papers focused on formal methods are especially welcome. Authors are invited to submit original research or tool papers on all relevant topics in these areas. Papers discussing new ideas that are at an early stage of development are also welcome. The topics covered by the conference include, but are not limited to, the following: Automata Theory Automated Deduction Computational aspects of Game Theory Concurrency and Distributed computation Decision Procedures Deductive, Compositional, and Abstraction Techniques for Verification Finite Model Theory First-order and Higher-order Logics Formal Languages Formal Methods for Systems Biology, Hybrid, Embedded, and Mobile Systems Games and Automata for Verification Game Semantics Logical aspects of Computational Complexity Logics of Programs Modal and Temporal Logics Model Checking Models of Reactive and Real-Time Systems Probabilistic Models (Markov Decision processes) Program Analysis and Software Verification Reinforcement Learning Run-time Verification and Testing Specification and Verification of Finite and Infinite-state Systems Synthesis IMPORTANT DATES (all dates are AoE) ***************************************************************************** Abstract submission: June 23, 2021 Paper submission: June 30, 2021 Notification: July 30, 2021 Camera-ready: August 30, 2021 Conference: September 20-22, 2021 PUBLICATIONS ***************************************************************************** The proceedings will be published by Electronic Proceedings in Theoretical Computer Science. ***Authors of the best papers will be invited to submit a revised version of their work to a special issue of Logical Methods in Computer Science***. The previous editions of GandALF already led to special issues of the International Journal of Foundations of Computer Science (GandALF 2010), Theoretical Computer Science (GandALF 2011 and 2012), Information and Computation (GandALF 2013, 2014, 2016, 2017, 2019 and 2020), and Acta Informatica (GandALF 2015). SUBMISSIONS ***************************************************************************** Submitted papers should not exceed 14 pages (excluding references and clearly marked appendices) using EPTCS format, be unpublished and contain original research. Please use the LaTeX style provided at?http://style.eptcs.org?to format the paper. For papers reporting experimental results, authors are encouraged to make their data available with their submission. Submissions must be in PDF format and will be handled via the EasyChair Conference system at the following address: https://www.easychair.org/conferences/?conf=gandalf2021 INVITED SPEAKERS ***************************************************************************** Roderick Bloem, TU Graz, Austria Anca Muscholl, LaBRI, Bordeaux, France Nicola Olivetti, Aix-Marseille University, France S.E. (Sicco) Verwer, TU Delft, The Netherlands PROGRAM CHAIRS ***************************************************************************** Davide Bresolin, University of Padua (Italy) Pierre Ganty, IMDEA Software Institute, Madrid (Spain) PROGRAM COMMITTEE ***************************************************************************** Mohamed Faouzi Atig, Uppsala University (Sweden) Christel Baier, TU Dresden (Germany) Saddek Bensalem, VERIMAG (France) Nathalie Bertrand, INRIA (France) Pedro Cabalar, University of Corunna (Spain) Thomas Colcombet, CNRS (France) Wojciech Czerwi?ski, University of Warsaw (Poland) Orna Kupferman, Hebrew University (Israel) S?awomir Lasota, University of Warsaw (Poland) Konstantinos Mamouras, Rice University (USA) Roland Meyer, TU Braunschweig (Germany) Marco Montali, Free University of Bozen-Bolzano (Italy) Paritosh Pandya, TIFR (India) Doron Peled, Bar Ilan University (Israel) Guillermo Perez, University of Antwerp (Belgium) R. Ramanujam, Institute of Mathematical Sciences (India) Francesco Ranzato, University of Padua (Italy) Pierre-Alain Reynier, Aix-Marseille Universit? (France) Mark Reynolds, The University of Western Australia (Australia) Ashutosh Trivedi, University of Colorado Boulder (USA) STEERING COMMITTEE ***************************************************************************** Luca Aceto, Reykjavik University (Iceland) Javier Esparza, University of Munich (Germany) Salvatore La Torre, University of Salerno (Italy) Angelo Montanari, University of Udine (Italy) Mimmo Parente, University of Salerno (Italy) Jean-Fran?ois Raskin, Universit? libre de Bruxelles (Belgium) Martin Zimmermann, University of Liverpool (UK) -------------- next part -------------- An HTML attachment was scrubbed... URL: From ivan.lanese at gmail.com Tue Jun 1 05:40:05 2021 From: ivan.lanese at gmail.com (ivan.lanese) Date: Tue, 1 Jun 2021 11:40:05 +0200 (CEST) Subject: [TYPES/announce] Expression of Interest for MSCA PF on Reversible Computing @ UNIBO, Italy Message-ID: Dear all, University of Bologna (Italy) is encouraging young researchers to apply for a MSCA Postdoctoral Fellowships with University of Bologna as host institution. All information on MSCA Postdoctoral Fellowships can be found at: https://ec.europa.eu/research/mariecurieactions/actions/postdoctoral-fellowships I am particularly interested in supervising future applicants (and work with them towards an application) in the area of reversible computing and reversible debugging. Reversible computing allows a program to execute both forward and backward, and it found a natural application in the exploration of an execution forward and backward looking for a bug. The technique is used in mainstream debuggers such as GDB and WinDBG. If you are interested or would like to have more information feel free to contact me. Best, Ivan Lanese From yallop at gmail.com Tue Jun 1 08:57:26 2021 From: yallop at gmail.com (Jeremy Yallop) Date: Tue, 1 Jun 2021 12:57:26 +0000 Subject: [TYPES/announce] Postdoc position at Cambridge in programming with equations Message-ID: We have an opening in Cambridge for a researcher on the Frex project (https://www.cl.cam.ac.uk/~jdy22/projects/frex). Informal enquiries are welcome: please feel free to get in touch. --------------------------------------------------------------------------------------------------- Research Assistant / Associate in Programming with Equations (Fixed Term) https://www.jobs.cam.ac.uk/job/29773/ Applications are invited for a Research Assistant/Associate to join the Frex project. The Frex project investigates the use of equations in programming. There is often a large gap between what programmers know about their programs and what compilers are able to deduce. Frex targets this gap by exposing to the compiler the equations proved by programmers about programs so that they can be used to improve optimisation and type checking. The position will involve working with Frex project members at the Universities of Cambridge, Edinburgh and St Andrews to extend and improve the design and implementations of Frex. Work up to this point has focused on equations for first-order single-sorted algebras and we plan to extend the techniques to more elaborate settings. The successful candidate is likely to have (or expect to be awarded soon) a PhD in computer science or a related discipline, as well as a track record of published research and experience or demonstrable interest in some combination of the following: - Dependently typed programming languages or proof assistants based on type theory (e.g. Agda, Idris, Coq, Lean) - Functional programming languages (e.g. F#, OCaml, Haskell) - Partial evaluation, normalization by evaluation, multi-stage programming, supercompilation or related techniques - Algebraic structures, universal algebra and categorical algebra Informal enquiries are welcome and should be directed to Dr Jeremy Yallop (jeremy.yallop at cl.cam.ac.uk) Expected starting date: 1 September 2021 From mcoblenz at umd.edu Tue Jun 1 09:42:54 2021 From: mcoblenz at umd.edu (Michael Coblenz) Date: Tue, 1 Jun 2021 09:42:54 -0400 Subject: [TYPES/announce] Call for papers: HATRA (Human Aspects of Types and Reasoning Assistants) Message-ID: Programming language designers seek to provide strong tools to help developers reason about their programs. For example, the formal methods community seeks to enable developers to prove correctness properties of their code, and type system designers seek to exclude classes of undesirable behavior from programs. The security community creates tools to help developers achieve their security goals. In order to make these approaches as effective as possible for developers, recent work has integrated approaches from human-computer interaction research into programming language design. This workshop brings together programming languages, software engineering, security, and human-computer interaction researchers to investigate methods for making languages that provide stronger safety properties more effective for programmers and software engineers. We have two goals: (1) to provide a venue for discussion and feedback on early-stage approaches that might enable people to be more effective at achieving stronger safety properties in their programs; (2) to facilitate discussion about relevant topics of participant interest. HATRA is interested in two different kinds of contributions. First, extended abstracts that summarize an existing body of work that is relevant to the workshop?s topic; the presentations serve to familiarize the community, which may be diverse, with work that already exists. Second, research papers that describe a new idea, approach, or hypothesis in the space, and are presented as an opportunity for the authors to receive community feedback and for the community to seek inspiration from others. The day will be divided into two segments. In the first segment, authors of accepted papers will present their work. In the second segment, we will conduct an ?unconference?-style meeting. By allowing the participants to drive the agenda, we hope to focus on topics that provide stimulating and enlightening discussion. HATRA welcomes two kinds of submissions: ? Extended abstracts summarizing existing published work that would be of interest to the community. ? Research proposals, position papers, and early-stage result papers. These come in short (up to four pages) and long (up to eight pages) varieties. These may describe hypotheses, ideas for research, or early-stage results. The objective is to provide an opportunity for the authors to receive feedback from the community as well as to help inspire participants to identify and clarify their own research directions. To encourage submission of ideas that may be published in other venues in the future, papers will not be published in the ACM Digital Library. Topics of interest include, but are not limited to: ? Type system design ? Programming language evaluation ? Programming language and tool design methodology ? Interactive theorem provers ? Lightweight specification tools ? Proof engineering ? Psychology of programming The submission deadline is August 6, 2021. For more information, please see the web site: https://2021.splashcon.org/home/hatra-2021 Organizing Committee: Michael Coblenz (University of Maryland) Luke Church (University of Cambridge) Chris Martens (North Carolina State University) Program Committee: Will Crichton (Stanford University) Jonathan Edwards Molly Feldman (Williams College) Andrew Head (UC Berkeley) Alan Jeffrey (Roblox) Shriram Krishnamurthi (Brown University) Niek Mulleners (Utrecht University) Cyrus Omar (University of Michigan) Peter-Michael Osera (Grinnell College) Hila Peleg (Technion Israel Institute of Technology) Alastair Reid (Google Research) Tianyi Zhang (Harvard University) -------------- next part -------------- An HTML attachment was scrubbed... URL: From arradha at microsoft.com Tue Jun 1 11:58:09 2021 From: arradha at microsoft.com (Arjun Radhakrishna) Date: Tue, 1 Jun 2021 15:58:09 +0000 Subject: [TYPES/announce] Verification Mentorship Workshop 2021: Call for Participation Message-ID: Verification Mentoring Workshop (VMW) 2021 http://i-cav.org/2021/mentoring/ co-located online with CAV 2021 18-19th July 2021 Call for Participation Are you an undergraduate or a graduate student interested in computer aided verification and formal methods, but don't know where to start? Are you looking for advice and mentoring on doing research, on grad school and beyond? We invite you to participate in the Verification Mentoring Workshop (VMW) 2021. VMW is co-hosted with Computer Aided Verification (CAV) 2021 and will be held online on July 18th and 19th 2021. The purpose of the Verification Mentoring Workshop is to provide mentoring and career advice to early-stage graduate students and late-stage undergraduate students, and introduce them to research topics aligned with the CAV conference and, more generally, formal methods. The workshop particularly encourages participation of women and underrepresented minorities. The program for VMW 2021 includes a number of talks and interactive sessions. The technical talks will provide gentle introductions to several recurring research themes in CAV, while the mentoring talks will provide useful tips about how to do good research and how to communicate your research well. The program also includes a panel that will feature leading researchers in the field. More information can be found at http://i-cav.org/2021/mentoring/. VMW will provide financial support to select students to cover the registration fees for VMW and the CAV conference. Interested students are encouraged to apply here before June 18th, 2021: https://forms.gle/acivSdF4P4Xkjm4u7. Confirmed Speakers: Christel Baier, TU Dresden Chuchu Fan, MIT Temesghen Kahsai, Amazon Oded Padon, VMWare Research Sukyoung Ryu, KAIST Moshe Y. Vardi, Rice University In case of questions, please contact the organizers: Jean-Baptiste Jeannin, University of Michigan Arjun Radhakrishna, Microsoft Suguman Bansal, University of Pennsylvania Caterina Urban, INRIA & ?cole Normale Sup?rieure | PSL University Roopsha Samanta, Purdue University -------------- next part -------------- An HTML attachment was scrubbed... URL: From florin.manea at informatik.uni-goettingen.de Wed Jun 2 02:49:32 2021 From: florin.manea at informatik.uni-goettingen.de (Manea, Florin) Date: Wed, 2 Jun 2021 06:49:32 +0000 Subject: [TYPES/announce] CSL 2022 - call for papers Message-ID: ==Apologies for cross-posting== ===================================== Second call for papers (CSL'22) ===================================== News: Invited speakers announced, Helena-Rasiowa-Award, website open, submission site open, colocated events ===================================== Computer Science Logic (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. CSL'22 will be held on February 14 - 19, 2022, in G?ttingen, Germany. Currently, we expect that the conference will be organized in a hybrid way: both with an in-presence component and an online component. Website: http://csl2022.uni-goettingen.de/ Invited speakers: ----------------- Annabelle McIver Macquarie (University, Sydney, Australia) Udi Boker (IDC Herzliya, Israel) Martin Escardo (University of Birmingham, UK) Rosalie Iemhoff (Utrecht University, The Netherlands) Karen Lange (Wellesley College, USA) Submission guidelines: ---------------------- Submitted papers must be in English and must provide sufficient detail to allow the Programme Committee to assess the merits of the paper. Full proofs may appear in a clearly marked technical appendix which will be read at the reviewers' discretion. Authors are strongly encouraged to include a well written introduction which is directed at all members of the PC. The CSL 2022 conference proceedings will be published in Leibniz International Proceedings in Informatics (LIPIcs), see https://submission.dagstuhl.de/documentation/authors. 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. Submissions should be made via easychair: https://easychair.org/conferences/?conf=csl2022 Helena-Rasiowa-Award: --------------------- The Helena Rasiowa Award is the best student paper award for the CSL conference series, starting from CSL 2022. The award will be given to the best paper (as decided by the PC) written solely by students or for which students were the main contributors. A student in this context is any person who is currently studying for a degree or whose PhD award date is less than one year prior to the first day of the conference. Important dates: ---------------- Abstract submission: July 5, 2021 (AoE), Paper submission: July 12, 2021 (AoE), Notification: September 30, 2021, Conference: February 14-19, 2022 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 Program Committee: ------------------ Thorsten Altenkirch (Nottingham, UK) Benedikt Bollig (Cachan, France) Agata Ciabattoni (Vienna, Austria) Liron Cohen (Ben-Gurion University, Israel) Anupam Das (Birmingham, UK) Claudia Faggian (Paris, France) Francesco Gavazzo (Bologna, Italy) Stefan G?ller (Kassel, Germany) Willem Heijltjes (Bath, UK) Sandra Kiefer (Aachen, Germany) Emanuel Kieronski (Wroclaw, Poland) Bartek Klin (Warsaw, Poland) Juha Kontinen (Helsinki, Finland) Anthony Lin (Kaiserslautern, Germany) Karoliina Lehtinen (Marseille, France) Florin Manea (G?ttingen, Germany, co-chair) Fredrik Nordvall Forsberg (Strathclyde, UK) Liat Peterfreund (Paris, France and Edinburgh, UK) Daniela Petrisan (Paris, France) Karin Quaas (Lepizig) Alex Simpson (Ljubljana, Slovenia, co-chair) Pawel Sobocinski (Tallin, Estonia) Anna Sokolova (Salzburg, Austria) Linda Brown Westrick (Connecticut, US) Organization Committee: ----------------------- Fundamentals of Computer Science Group - University of G?ttingen, Germany. Colocated events: ----------------- LCC 2022: Logic and Computational Complexity --------- Meetings of the workshop "Logic and Computational Complexity" are aimed at the foundational interconnections between logic and computational complexity, as present, for example, in implicit computational complexity (descriptive and type-theoretic methods); deductive formalisms as they relate to complexity (e.g. ramification, weak comprehension, bounded arithmetic, linear logic and resource logics); complexity aspects of finite model theory and databases; complexity-mindful program derivation and verification; computational complexity at higher type; and proof complexity. LCC 2022 will be the 23rd workshop in the series, see https://www.cs.swansea.ac.uk/lcc/. The program will consist of invited lectures as well as contributed papers selected by the Program Committee. LMW 2022: Logic Mentoring Workshop --------- LMW introduces young researchers to the technical and practical aspects of a career in logic research. It is targeted at students, from senior undergraduates to graduates, and includes talks and panel sessions from leaders in the subject. Contact: -------- Please send all questions about submissions to the PC co-chairs: csl2022 at easychair.org From lutz at lix.polytechnique.fr Wed Jun 2 05:51:46 2021 From: lutz at lix.polytechnique.fr (lutz at lix.polytechnique.fr) Date: Wed, 2 Jun 2021 11:51:46 +0200 Subject: [TYPES/announce] PhD funding on "Reasoning about Concurrent Game Structures with Numerical Resources" Message-ID: <81a4ef67a3974972a9f188834482f6f6.squirrel@webmail.lix.polytechnique.fr> PhD Fellowship - Labex Digicosme - Paris-Saclay (LIX, LMF) Urgent: deadline for application = June 10th 2021 We are looking for a candidate for the PhD proposal "REASONING ABOUT CONCURRENT GAME STRUCTURES WITH NUMERICAL RESOURCES" More details can be found at http://www.lsv.fr/~demri/PhDProposal2021.pdf Financement is secured, assuming that the candidate is known to Labex Digicosme by June 15th. The candidate must hold a Master degree in Computer Science, with a solid background in Theoretical Computer Science or Symbolic AI. Typically, candidates with a good knowledge on formal methods, logics for artificial intelligence and proof theory are much appreciated. Applications can be sent either in English or in French. To apply to the position, please send a CV to demri at lsv.fr and lutz at lix.polytechnique.fr. --- St?phane Demri (CNRS, LMF) https://cv.archives-ouvertes.fr/stephane-demri From pdownen at cs.uoregon.edu Wed Jun 2 13:47:40 2021 From: pdownen at cs.uoregon.edu (Paul Downen) Date: Wed, 2 Jun 2021 10:47:40 -0700 Subject: [TYPES/announce] OPLSS 2021 - See You At The Oregon Programming Languages Summer School Message-ID: We hope to see you at the Oregon Programming Languages Summer School! https://www.cs.uoregon.edu/research/summerschool/summer21/intro.mp4 The OPLSS speakers are not singing (it's hard to compete after PLDI's video). Nonetheless, they give a short introduction to their lectures this year: https://www.cs.uoregon.edu/research/summerschool/summer21/preview.mp4 https://www.youtube.com/watch?v=mUB7_G_Zw4M If you still intend to register, please do so as soon as possible. Space is filling quickly! More information can be found at: https://www.cs.uoregon.edu/research/summerschool/ As in years past, videos of the lectures will be available to all, posted online as soon as we can to the main OPLSS website https://www.cs.uoregon.edu/research/summerschool/summer21/topics.php and to the OPLSS youtube channel https://www.youtube.com/channel/UCDe6N9R7U-RYWA57wzJQ2SQ >From all of us at OPLSS: Stephanie Balzer ? Carnegie Melon University Session-Typed Concurrent Programming Ugo Dal Lago ? University of Bologna >From Program Equivalences to Program Metrics Robert Harper ? Carnegie Melon University Principles of Programming Languages Justin Hsu ? University of Wisconsin?Madison Reasoning about Probabilistic Programs Patricia Johann ? Appalachian State University Semantics of Advanced Data Types Alejandro Russo ? Chalmers University Information-flow Control Libraries Alexandra Silva ? University College London Kleene Algebras and Applications Nikhil Swamy ? Microsoft Research Proof-oriented Programming in F* Tarmo Uustalu ? Reykjavik University Monads and Interaction Zena Ariola, Marco Gaboardi, and Paul Downen [image: OPLSS_Logo.png] -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: OPLSS_Logo.png Type: image/png Size: 29413 bytes Desc: not available URL: From icfp.publicity at googlemail.com Wed Jun 2 15:11:58 2021 From: icfp.publicity at googlemail.com (Sam Tobin-Hochstadt) Date: Wed, 02 Jun 2021 15:11:58 -0400 Subject: [TYPES/announce] Call for Tutorial, Panel, and Discussion Proposals: ICFP 2021 Message-ID: <60b7d7fee6876_24cee2942798@homer.mail> CALL FOR TUTORIAL, PANEL, AND DISCUSSION PROPOSALS ICFP 2020 25th ACM SIGPLAN International Conference on Functional Programming August 22 - 27, 2021 Virtual https://icfp21.sigplan.org/ The 25th ACM SIGPLAN International Conference on Functional Programming will be held virtually on August 22-27, 2021. ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. Proposals are invited for tutorials, lasting approximately 3 hours each, to be presented during ICFP and its co-located workshops and other events. These tutorials are the successor to the CUFP tutorials from previous years, but we also welcome tutorials whose primary audience is researchers rather than practitioners. Tutorials may focus either on a concrete technology or on a theoretical or mathematical tool. Ideally, tutorials will have a concrete result, such as "Learn to do X with Y" rather than "Learn language Y". Just like last year, following the success of the #ShutDownPL event @ ICFP, we are also inviting proposals for panels and discussions on topics of broader interest to the PL community. Tutorials, panels, and discussions may occur before or after ICFP, co-located with the associated workshops, on August 22 or August 26-27. ---------------------------------------------------------------------- Submission details Deadline for submission: June 28th, 2020 Notification of acceptance: July 5th, 2020 Prospective organizers of tutorials are invited to submit a completed tutorial proposal form in plain text format to the ICFP 2021 workshop co-chairs (Leonidas Lampropoulos and Zoe Paraskevopoulou), via email to icfp-workshops-2021 at googlegroups.com by June 28th, 2021. Please note that this is a firm deadline. Organizers will be notified if their event proposal is accepted by July 5th, 2021. The proposal form is available at: http://www.icfpconference.org/icfp2021-files/icfp21-panel-form.txt http://www.icfpconference.org/icfp2021-files/icfp21-tutorials-form.txt ---------------------------------------------------------------------- Selection committee The proposals will be evaluated by a committee comprising the following members of the ICFP 2021 organizing committee. Tutorials Co-Chair: Zoe Paraskevopoulou (Northeastern) Tutorials Co-Chair: Leonidas Lampropoulos (University of Maryland) General Chair: Sukyoung Ryu (KAIST) Program Chair: Ron Garcia (University of British Columbia) ---------------------------------------------------------------------- Further information Any queries should be addressed to the tutorial co-chairs ( Leonidas Lampropoulos and Zoe Paraskevopoulou), via email to icfp-workshops-2021 at googlegroups.com From ariesco at fdi.ucm.es Thu Jun 3 09:16:53 2021 From: ariesco at fdi.ucm.es (ADRIAN RIESCO RODRIGUEZ) Date: Thu, 3 Jun 2021 15:16:53 +0200 Subject: [TYPES/announce] [Call for Participation] 12th International School on Rewriting Message-ID: ================== CALL FOR PARTICIPATION ================== 12th International School on Rewriting (ISR 2021) 5-16 July 2021 Virtual event hosted via zoom by Universidad Complutense de Madrid https://dalila.sip.ucm.es/isr2021/ Registration is already open: https://eventos.ucm.es/66824/detail/12th-international-school-on-rewriting-isr-2021.html ================== Rewriting is a powerful model of computation that underlies much of declarative programming and is ubiquitous in mathematics, logic, theorem proving, verification, model-checking, compilation, biology, chemistry, physics, etc. In 2021, the 12th International School on Rewriting (ISR 2021) will take place online as a virtual event hosted via zoom by the Computer Science School at Universidad Complutense de Madrid, Spain. The school is aimed at Master and PhD students, researchers and practitioners interested in the use or the study of rewriting and its applications. >From July 5 to July 16 a course will be taught every day, according to the schedule published in the web page. ================== COURSES ================== Christiano Braga: Compiler construction in Maude Paola Bruscoli: An introduction to deep inference methodology in proof theory Santiago Escobar: Unification and Narrowing in Maude 3.0 Maribel Fernandez: Nominal rewriting Carsten Fuhs: Automated complexity analysis for term rewriting Maja H. Kirkeby & Robert Gl?ck: Inversion and term rewriting systems Jean-Jacques Levy: Lambda calculus, the generalized finite development theorem Luigi Liquori & Vincent van Oostrom: Lambda calculi with patterns Dorel Lucanu, Xiaohong Chen & Grigore Rosu: From rewriting to matching logic Jorge A. Perez: Session types for message-passing concurrency Carolyn Talcott: Pathway Logic, using rewriting logic to understand how cells work ================== REGISTRATION ================== Registration is free but required. https://eventos.ucm.es/66824/detail/12th-international-school-on-rewriting-isr-2021.html ================== ORGANIZERS ================== David de Frutos Escrig Narciso Marti-Oliet Albert Rubio Manuel Montenegro Adrian Riesco Contact: narciso at ucm.es ISR 2021 is promoted by the IFIP WG1.6 and supported by Universidad Complutense de Madrid. ================== -------------- next part -------------- An HTML attachment was scrubbed... URL: From anas at cs.uni-salzburg.at Thu Jun 3 13:28:32 2021 From: anas at cs.uni-salzburg.at (Ana Sokolova) Date: Thu, 3 Jun 2021 19:28:32 +0200 Subject: [TYPES/announce] MFPS 2021: Deadline Extension and Invited Speakers Message-ID: ========================================================= CALL FOR PAPERS: MFPS XXXVII https://www.coalg.org/calco-mfps-2021/mfps 37th Conference on Mathematical Foundations of Programming Semantics August 30 - September 2, 2021 Online or hybrid, from Salzburg Co-located with CALCO 2021 ========================================================== Paper submission: June 14, 2021 AoE (NEW) Author notification: August 2, 2021 Final version due: August 16, 2021 ========================================================== We are delighted to announce the 37th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2021). MFPS 2021 will be hosted by the University of Salzburg, Austria, and will take place on August 30 - September 2, 2021. Due to the pandemic situation, the conference will take place online. Should the situation improve and allow some international travel, we will do our best to organize a small component of the meeting in Salzburg for those participants who wish to attend the meeting in person. MFPS conferences are dedicated to the areas of mathematics, logic, and computer science that are related to models of computation in general, and to semantics of programming languages in particular. This is a forum where researchers in mathematics and computer science can meet and exchange ideas. The participation of researchers in neighbouring areas is strongly encouraged. Topics include, but are not limited to, the following: bio-computation; concurrent qualitative and quantitative distributed systems; constructive mathematics; domain theory and categorical models; formal languages; formal methods; game semantics; lambda calculus; logic; probabilistic systems; process calculi; programming-language theory; quantum computation; security; topological models; type systems; type theory. We also welcome contributions that address applications of semantics to novel areas such as complex systems, markets, and networks, for example. MFPS 2021 is co-located with the 9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021). ------------------------------------------------- INVITED SPEAKERS: Eugenia Cheng, School of the Art Institute of Chicago (joint with CALCO) Amina Doumane, ENS Lyon Shin-Ya Katsumata, NII Tokyo Krishna S., IIT Bombay INVITED TUTORIAL SPEAKERS (SPECIAL SESSIONS): Azadeh Farzan, University of Toronto (Termination Analysis and Synthesis -- joint with CALCO) Sam Staton, University of Oxford (Probabilistic Programming Semantics) Paul Andr? Melli?s, IRIF Universit? Paris Denis Diderot (Categorical Type Theory) Filippo Bonchi, University of Pisa and Pawel Sobocinski, Taltech (String Diagrams) ------------------------------------------------- PROGRAMME COMMITTEE: Sandra Alves, University of Porto, Portugal Henning Basold, University of Leiden, Netherlands Andrej Bauer, University of Ljubljana, Slovenia Stephen Brookes, Carnegie Mellon University, USA Corina Cirstea, University of Southampton, UK Fabio Gadducci, University of Pisa, Italy Ichiro Hasuo, NII, Japan Helle Hvid Hansen, University of Groningen, Netherlands Justin Hsu, University of Wisconsin-Madison, USA Patricia Johann, Appalachian State University, USA Achim Jung, University of Birmingham, UK Sandra Kiefer, RWTH Aachen University, Germany / University of Warsaw, Poland Barbara K?nig, University of Duisburg-Essen, Germany Catherine Meadows, NRL, USA Michael Mislove, Tulane University, USA Joel Ouaknine, Max Planck Institute for Software Systems, Germany Prakash Panangaden, McGill University Montreal, Canada Daniela Petrisan, IRIF, Paris 7, France Tatjana Petrov, University of Konstanz, Germany Jurriaan Rot, Radboud University Nijmegen, Netherlands Mehrnoosh Sadrzadeh, UCL, UK Lutz Schr?der, Friedrich-Alexander-Universit?t Erlangen-N?rnberg, Germany Ana Sokolova, University of Salzburg, Austria (PC chair) Valeria Vignudelli, CNRS/ENS Lyon, France ------------------------------------------------- MFPS ORGANIZERS: Andrej Bauer, University of Ljubljana, Slovenia Stephen Brookes, Carnegie Mellon University, USA Achim Jung, University of Birmingham, UK Catherine Meadows, NRL, USA Michael Mislove, Tulane University, USA Joel Ouaknine, Max Planck Institute for Software Systems, Germany Prakash Panangaden, McGill University Montreal, Canada ------------------------------------------------- SUBMISSIONS Submissions via https://easychair.org/conferences/?conf=mfps37 ------------------------------------------------- PROCEEDINGS Elsevier ceased publication of ENTCS at the end of 2020. ENTCS was the traditional publication venue for MFPS. Negotiations are underway to establish a new arrangement for MFPS proceedings publication going forward. The new venue will be announced as soon as arrangements are complete. We anticipate the formal proceedings of this year?s conference will be published after the meeting, as has been the tradition for MFPS for many years. A preliminary proceedings will be distributed to participants at the meeting. Please use the old ENTCS style for the submission, as announced on the webpage. ------------------------------------------------- CONTACT For any further information about MFPS 2021, please contact Ana Sokolova (anas at cs.uni-salzburg.at) -------------- next part -------------- An HTML attachment was scrubbed... URL: From benedikt.ahrens at gmail.com Thu Jun 3 17:21:58 2021 From: benedikt.ahrens at gmail.com (Benedikt Ahrens) Date: Thu, 3 Jun 2021 23:21:58 +0200 Subject: [TYPES/announce] Research position in Formal Verification at HENSOLDT Cyber in Munich Message-ID: Dear All, A job opening for a "Researcher (in) Formal Verification" is being advertised at Hensoldt Cyber GmbH at the outskirts of Munich, Germany. If you would like to contribute to making software and hardware more secure, this job might be for you! The job ad (reproduced below), with information on how to apply, is located at https://hensoldt-cyber.com/job-offers/#job-549910. The ad mentions an official contact email address. Additionally, please don't hesitate to get in touch with me with any informal inquiries. All the best, Benedikt HENSOLDT Cyber develops embedded IT products that meet the highest security requirements. It integrates an invulnerable operating system with security-hardened hardware to build the most secure product on the global IT market. The company combines more than 50 years of domain experience with world-class expertise in hardware and software design to achieve global leadership. We are buidling up a new research team, which is working on cutting-edge projects targeting the aspects formal verification, operating system design and cryptography with the focus on secure embedded systems. If you have a strong interest and/or background in secure operating system development, we would like to get in touch with you. Tasks ===== - Research on formal verification of software, with a focus on deductive verification - Design new tools and methods to make verification possible in new areas, or extend and improve existing tools to reduce verification effort - Actively participate in international and national funded research and customer projects - Contribute to research communities and efforts, including publishing in top conferences and relevant journals Requirements ============ - PhD in Computer Science, Mathematics or other comparable subject - Demonstrable experience in theorem proving (e.g. Coq, Isabelle, Agda) - Strong publication record and demonstrated research capability (e.g. obtained grants, patent submissions, etc.) - Prior experience in software verification is a plus - Experience in hardware verification is a plus - Experience in cryptography is a plus - Experience in C/C++ programming would be an advantage - Proficiency in English (both written and spoken) and interest to work in a truly diverse cultural environment - Excellent communication skills, teamwork spirit, initiative and autonomous working are required We are not only offering flexible and mobile working, but the opportunity to be involved in the development of cutting-edge security products in an international and innovative environment. Did we spark your interest? Then we are looking forward to your application. If you have any questions on the vacancy please don't hesitate to contact us via mail (hr-cyber at hensoldt-cyber.com). From benedikt.ahrens at gmail.com Thu Jun 3 17:22:46 2021 From: benedikt.ahrens at gmail.com (Benedikt Ahrens) Date: Thu, 3 Jun 2021 23:22:46 +0200 Subject: [TYPES/announce] PhD position in HoTT/UF at TU Delft Message-ID: <3ad64418-4ea0-c2e4-b08a-fb67fcbcd42b@gmail.com> A PhD position [1] is open in the Programming Languages group [2] at TU Delft, in the area of HoTT/UF. The student will be supervised by Benedikt Ahrens [3]. Information about the position is available on the dedicated website [1]. If you have any questions or consider applying, please get in touch with Benedikt (benedikt.ahrens at gmail.com). [1] https://pl.ewi.tudelft.nl/hiring/2021/phd-student-hottuf/ [2] https://pl.ewi.tudelft.nl/ [3] https://benediktahrens.gitlab.io/ From gabriel.scherer at gmail.com Fri Jun 4 04:44:02 2021 From: gabriel.scherer at gmail.com (Gabriel Scherer) Date: Fri, 4 Jun 2021 10:44:02 +0200 Subject: [TYPES/announce] Logic and Interactions 2022 (Marseille, France) -- Early announcement Message-ID: Dear announcements list, I'm sending this message on behalf of Lionel Vaux. [ Please distribute, apologies for multiple postings. ] ======================================================================== EARLY ANNOUNCEMENT LOGIC AND INTERACTIONS 2022 (LI2022) WINTER SCHOOLS and WORKSHOPS Monday 24 January - Friday 25 February 2022 CIRM, Luminy, Marseille, France https://conferences.cirm-math.fr/2507.html We are delighted to announce Logic and Interactions 2022: a five week session at the CIRM in Luminy (Marseille, France), on logic and its interactions in mathematics and computer science, but also in the broader perspective of its transdisciplinary nature, with connexions to philosophy and linguistics. Two weeks will be organized as thematic schools targeted primarily at PhD students and non-specialist researchers. The other three will be workshops presenting the state of the art in specific areas. This is the fourth month-long session organized in Marseille on the broad topic of ?logic in computer science?, following *Logic and interactions 2002*, *Geometry of computation 2006* and *Logic and Interactions 2012*. As for previous sessions, we expect this event to offer a friendly venue not only for established specialists but also for students and young researchers as well as non-specialists. In addition to the thematic schools, each week will include introductory material. We encourage colleagues, and especially students and young researchers, to attend several weeks or even the full month, in order to make the most of this special occasion. Outline of the programme ======================== Week 1: Linear Logic Winter School (24 to 28 January) https://conferences.cirm-math.fr/2685.html This school will offer an introduction to the main concepts and essential results in Linear Logic, based on an undergoing project to produce a reference textbook, within the International Research Network on Linear Logic [*]. In addition to the main lectures, the week will be concluded by a series of tutorial talks on a selection of advanced subjects. [*] https://www.linear-logic.org Week 2. Logic of Probabilistic Programming (31 January to 4 February) https://conferences.cirm-math.fr/2686.html This meeting will be devoted to the applications of logic, category theory and denotational semantics to the foundation of formal methods for probabilistic program analysis and probabilistic system verification. It will stress the specificities of Bayesian programming and machine learning where programs represent statistical models. Week 3. Logic and Transdisciplinarity (7 to 11 February) https://conferences.cirm-math.fr/2687.html We will present and discuss some questions arisen from the development of logic which were an impulse for fruitful and long-lasting research at the interface between mathematics, philosophy and linguistics. During the week, seven half-days will be devoted to courses presenting selected themes on logic, philosophy and linguistics. Two afternoons will be devoted to invited talks by leading researchers in some of the areas touched during the courses. Week 4. Logic, Databases and Complexity (14 to 18 February) https://conferences.cirm-math.fr/2688.html This week aims at revisiting the connection between databases, complexity and logic. We will investigate the areas of database theory, descriptive complexity and team-based logics. The week will be organised as an informal workshop, with invited talks, introductory or specialist tutorial, and talks by the participants. Week 5. Logic and Higher Structures (21 to 25 February) https://conferences.cirm-math.fr/2689.html Voevodsky's univalent foundations program has revealed deep connections between logic and homotopy theory, in particular via higher category theory. The goal of this week is to explore these interactions, bringing together mathematicians from the communities of type theory, higher rewriting, higher category theory and homotopy theory. The week will consist of two mini-courses (one on Voedvodsky's univalent foundations and one on higher category theory), invited talks and a limited number of contributed talks. Practical information ===================== We hope that the sanitary conditions will allow us to hold the event mainly in the pre-CoVid fashion: with participants attending physically at the CIRM. In any case, attending remotely will certainly be possible: the CIRM has invested a lot of efforts to make hybrid events the standard practice. Accommodation at the CIRM will be available for participants attending physically. A limited number of fundings will be available to cover the accommodation and travel expenses, especially for students. Pre-registrations will open soon. In the meantime, you can already save those weeks in your agenda. -------------- next part -------------- An HTML attachment was scrubbed... URL: From eacsl.ls1 at cs.tu-dortmund.de Fri Jun 4 05:30:51 2021 From: eacsl.ls1 at cs.tu-dortmund.de (EACSL Mail-Account) Date: Fri, 4 Jun 2021 11:30:51 +0200 Subject: [TYPES/announce] ACKERMANN AWARD 2021: 2nd and final Call for Nominations Message-ID: <8A0E09D7-A7A3-4A87-A2E7-6E406C7F868E@cs.tu-dortmund.de> ACKERMANN AWARD 2021 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE CALL FOR NOMINATIONS (Note: there are no changes since the first call for nomination. However, since the first call was sent out in February and the deadline is July, a reminder might be helpful. Apologies for the extra mail.) Nominations are now invited for the 2021 Ackermann Award. PhD dissertations in topics specified by the CSL and LICS conferences, which were formally accepted as PhD theses at a university or equivalent institution between 1 January 2019 and 31 December 2020 are eligible for nomination for the award. The deadline for submission is 1 July 2021. Submission details follow below. Nominations can be submitted from 1 March 2021 and should be sent to the chair of the Jury, Thomas Schwentick, by e-mail: thomas.schwentick at tu-dortmund.de *** 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 the thesis in the FoLLI subseries of Springer LNCS, and * financial support to attend the conference. The jury is entitled to give the award to more (or less) than one dissertation in a year. *** The Jury The jury consists of: * 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. *** How to submit The candidate or his/her supervisor should submit 1. the thesis (ps or pdf file); 2. a detailed description (not longer than 20 pages) of the thesis in ENGLISH (ps or pdf file); 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; 3. a supporting letter by the PhD advisor and two supporting letters by other senior researchers (in English); supporting letters can also be sent directly to Thomas Schwentick (thomas.schwentick at tu-dortmund.de); 4. a short CV of the candidate; 5. a copy of the document asserting that the thesis was accepted as a PhD thesis at a recognized University (or equivalent institution) and that the candidate has received his/her PhD within the specified period. The submission should be sent by e-mail as attachments to the chairman of the jury, Thomas Schwentick: thomas.schwentick at tu-dortmund.de With the following subject line and text: * Subject: Ackermann Award 20 Submission * Text: Name of candidate, list of attachments Submission can be sent via several e-mail messages. If this is the case, please indicate it in the text. From j.a.perez at rug.nl Fri Jun 4 07:17:52 2021 From: j.a.perez at rug.nl (Jorge A. Perez) Date: Fri, 4 Jun 2021 13:17:52 +0200 Subject: [TYPES/announce] Two PhD positions and Two Postdoc positions in Logic (Groningen) *15 June 2021 deadline* In-Reply-To: References: <2850e3a3-2ce5-2439-e46a-77c20b9e8ca6@rug.nl> Message-ID: Dear all, Helle Hvid Hansen and Revantha Ramanayake have several PhD and postdoc positions available - please see below for details. Best regards, Jorge ******************************************************* * Two PhD positions and Two Postdoc positions in Logic * University of Groningen, Netherlands * Application deadline: 15 June 2021 / until filled ******************************************************* We are looking for excellent PhD candidates and Postdocs to join us at the Fundamental Computing group, Bernoulli Institute for Mathematics, Computer Science and Artificial Intelligence, University of Groningen. Two PhD positions and two Postdoc positions are available. * PhD Position in Logic and Theoretical Computer Science Supervisor: Revantha Ramanayake https://www.rug.nl/about-ug/work-with-us/job-opportunities/?details=00347-02S0008EOP * PhD Position in Logic and Semantics of Computing Supervisor: Helle Hvid Hansen https://www.rug.nl/about-ug/work-with-us/job-opportunities/?details=00347-02S0008ENP * Two Postdoctoral Positions in Logic and Theoretical Computer Science Supervisor: Revantha Ramanayake https://www.rug.nl/about-ug/work-with-us/job-opportunities/?details=00347-02S0008EQP Applications received *before 16 June 2021 (CET)* will receive full consideration but applications will be accepted until the positions are filled. We expect to hold the interviews in the week of 21-25 June 2021. We encourage prospective candidates to contact the respective supervisor to express their interest and to obtain further information. -- Jorge A. P?rez Associate Professor, Fundamental Computing group Bernoulli Institute for Math, CS and AI University of Groningen, The Netherlands URL: http://www.jperez.nl From h.basold at liacs.leidenuniv.nl Fri Jun 4 15:28:00 2021 From: h.basold at liacs.leidenuniv.nl (Henning Basold) Date: Fri, 4 Jun 2021 21:28:00 +0200 Subject: [TYPES/announce] TYPES 2021: Call for Participation Message-ID: <0051c207-dcf6-dfe1-ad68-4ccddabe5f78@liacs.leidenuniv.nl> Call for Participation TYPES 2021 27th International Conference on Types for Proofs and Programs 14 - 18 June 2021 Virtual in Leiden, The Netherlands Leiden Institute for Advanced Computer Science https://types21.liacs.nl/ Venue ---------- This year?s TYPES will be held virtually in an interactive environment. That the conference is held virtually constrains the time of talks, and complicates exchange and collaboration. TYPES 2021 will therefore not only consist of presentations, but also a setup of working groups that get together throughout the week. Every day will be split into a session of talks and tutorials, and a collaboration session during which the working groups will get together. The hope is that we can retain at least some of the exchange and chatter that is the heart of the TYPES conference series. The programme can be found here: https://types21.liacs.nl/programme/ Registration and (no) Fees ---------------------------- Despite the difficulty that a virtual event brings, it also offers a chance. We will make TYPES as inclusive as possible, which means that attending is free of charge for all participants. The costs for the conference are kindly covered by the Leiden Institute of Advanced Computer Science (LIACS, liacs.leidenuniv.nl/). However, registration is required to participate in the TYPES meeting. If you wish to attend, then please fill in the registration form latest by *10 June 2021 AoE*: https://types21.liacs.nl/registration/ In the form you can choose the days on which you wish to attend. Please make sure that you will be, at least partially, present during those days. This helps us to estimate the overall costs better and to ensure that decisions made during the business meeting will be valid. Invited Speakers ----------------------------- Stephanie Balzer (Carnegie Mellon University) Ulrik Buchholtz (Technical University Darmstadt) Sara Negri (University of Genova) Pierre-Marie P?drot (INRIA -- Inria Rennes-Bretagne-Atlantique) Contributed Talks -------------------- The contributed talks can be found here: https://types21.liacs.nl/programme/accepted-contributions/ Abstracts for the contributions will be made available before the conference on the same website. About Types --------------- The TYPES meetings are a forum to present new and on-going work in all aspects of type theory and its applications, especially in formalised and computer assisted reasoning and computer programming. The TYPES areas of interest include, but are not limited to: * Foundations of type theory and constructive mathematics; * Applications of type theory (e.g., linguistics or concurrency); * Dependently typed programming; * Industrial uses of type theory technology; * Meta-theoretic studies of type systems; * Proof assistants and proof technology; * Automation in computer-assisted reasoning; * Links between type theory and functional programming; * Formalising mathematics using type theory; * Homotopy type theory and univalent mathematics. The TYPES meetings from 1990 to 2008 were annual workshops of a sequence of five EU funded networking projects. From 2009 to 2015, TYPES has been run as an independent conference series. From 2016 to 2020, TYPES was partially supported by COST Action EUTypes CA15123. Previous TYPES meetings were held in Antibes (1990), Edinburgh (1991), B?stad (1992), Nijmegen (1993), B?stad (1994), Torino (1995), Aussois (1996), Kloster Irsee (1998), L?keberg (1999), Durham (2000), Berg en Dal near Nijmegen (2002), Torino (2003), Jouy-en-Josas near Paris (2004), Nottingham (2006), Cividale del Friuli (2007), Torino (2008), Aussois (2009), Warsaw (2010), Bergen (2011), Toulouse (2013), Paris (2014), Tallinn (2015), Novi Sad (2016), Budapest (2017), Braga (2018), Oslo (2019) and Torino (2020). Post-proceedings ------------------- Similarly to TYPES 2011 and TYPES 2013-2020, a post-proceedings volume will be published in the Leibniz International Proceedings in Informatics (LIPIcs) series. Submission to that volume will be open to everyone. Tentative dates for post-proceedings: * Non-binding intent (abstract) 29 October 2021 * Paper submission 26 November 2021 * Author notification 25 March 2022 The formal call with binding dates for the post-proceedings will be issued after the conference. Contact ----------- Email: types21 at liacs.leidenuniv.nl Web form: https://types21.liacs.nl/contact/ Programme Committee --------------------- Andreas Abel (Gothenburg University/Chalmers) Henning Basold (LIACS -- Leiden University) (chair) Stefano Berardi (Universit? di Torino) Marc Bezem (University of Bergen) Fr?d?ric Blanqui (INRIA -- ENS Paris-Saclay) Sandrine Blazy (INRIA -- University of Rennes) Ana Bove (Chalmers / U. of Gothenburg) Paolo Capriotti (no affiliation) Jesper Cockx (TU Delft) Jos? Esp?rito Santo (University of Minho) Herman Geuvers (Radboud University Nijmegen) Silvia Ghilezan (University of Novi Sad) Nicolai Kraus (U. of Nottingham) Sergue? Lenglet (Univ. de Lorraine) Assia Mahboubi (INRIA -- Nantes and VU Amsterdam) Ralph Matthes (IRIT -- CNRS and University of Toulouse) Keiko Nakata (Kyoto University) Fredrik Nordvall Forsberg (University of Strathclyde) Jorge A. P?rez (University of Groningen) Gabriel Scherer (INRIA Saclay) Aleksy Schubert (University of Warsaw) Niccol? Veltri (Tallin UT) Stephanie Weirich (U. of Pennsylvania) Organiser ------------ Henning Basold (LIACS -- Leiden University) Tanjona Ralaivaosaona (LIACS -- Leiden University) -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_signature Type: application/pgp-signature Size: 665 bytes Desc: OpenPGP digital signature URL: From Radu.Iosif at univ-grenoble-alpes.fr Fri Jun 4 15:59:08 2021 From: Radu.Iosif at univ-grenoble-alpes.fr (Radu Iosif) Date: Fri, 4 Jun 2021 21:59:08 +0200 Subject: [TYPES/announce] PhD positions in Grenoble, France Message-ID: The VERIMAG laboratory in Grenoble (http://www-verimag.imag.fr/ ) is seeking several outstanding PhD candidates to fill 3-years funded positions on the following subjects: 1. Software Vulnerability Analysis with Respect to Countermeasure and Attacker Models Advisors: Marie-Laure.Potet > and Laurent.Mounier > URL: https://www-verimag.imag.fr/Funded-PhD-software-vulnerability.html 2. Convex Polyhedra in Floating Point Advisors: David Monniaux > and Michael Perin > URL: https://www-verimag.imag.fr/Convex-polyhedra-in-floating-point.html 3. Decision Procedures for Inductive Separation Logic Modulo Data Theories Advisors: Nicolas Peltier > (LIG) and Radu Iosif >(VERIMAG) URL: http://nts.imag.fr/images/2/25/SepLogDataPhD.pdf 4. Proving Correctness of Reconfigurable Systems Advisors: Radu Iosif > URL: http://nts.imag.fr/images/5/58/Reconfiguration.pdf This list is not exhaustive and we encourage potential candidates to contact us and discuss possible alternative subjects. How to apply: contact directly the person in charge for each subject. In the French system, PhD candidates start their work with a 6-month internship (part of the Master) before signing up for a 3-year PhD contract. The internship is not required for students coming from non-French universities (including the European Union) that may start working directly on their PhD. Hosting institution: VERIMAG is an academic laboratory focusing on theoretical and practical aspects of formal methods for embedded system development. Since its creation, in 1993, VERIMAG has a proven record in both basic theoretical research and in development of tools for system verification. In the recent years, VERIMAG became deeply involved in the area of rigorous construction of embedded cyber-physical systems. VERIMAG hosts 20 professors, 7 full-time researchers and over 15 PhD students. -------------- next part -------------- An HTML attachment was scrubbed... URL: From a.serebrenik at tue.nl Mon Jun 7 04:21:16 2021 From: a.serebrenik at tue.nl (Serebrenik, Alexander) Date: Mon, 7 Jun 2021 08:21:16 +0000 Subject: [TYPES/announce] Call for papers: 21st IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM 2021) Message-ID: Apologies for cross-posting - Please forward to anybody who might be interested. 21st IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM) September 27-September 28, 2021 - Luxembourg City, Luxembourg / Virtual http://www.ieee-scam.org/2021/ Call for Research Papers: http://www.ieee-scam.org/2021/#cfpresearchtrack Call for RENE Track Papers: http://www.ieee-scam.org/2021/#cfprenetrack Call for Engineering Papers: http://www.ieee-scam.org/2021/#cfpengtrack Call for New Ideas and Emerging Results: http://www.ieee-scam.org/2021/#cfpniertrack Call for Joint Artifact Evaluation Track (ICSME, VISOFT, SCAM): http://www.ieee-scam.org/2021/#cfpaetrack Important Dates (All submission dates are at 23:59 AoE (Anywhere on Earth, UTC-12). Research track: Abstract Submission: June 21st, 2021 Conflict Declaration: June 21st - June 28h, 2021 Paper Submission: June 28th, 2021 Reviews due Date: July 26th, 2021 Paper Discussion: July 27th - August 1st, 2021 Author Notification: August 2nd, 2021 Camera Ready: August 9th, 2021 RENE, Engineering, New Ideas and Emerging Results Tracks : Abstract Submission: July 26st, 2021 Paper Submission: August 2nd, 2021 Reviews due Date: August 16th, 2021 Paper Discussion: August 16th - August 20th, 2021 Author Notification: August 20th, 2021 Camera Ready: August 27nd, 2021 Joint Artifact Evaluation Track: ICSME, VISSOFT, SCAM all tracks deadlines: Artifact Submission: August 27th, 2021 Author Notification: September 17th, 2021 SCAM aims to bring together researchers and practitioners working on theory, techniques and applications which concern analysis and/or manipulation of the source code of computer systems. For the purpose of clarity ?source code? is taken to mean any fully executable description of a software system. It is therefore so-construed as to include machine code, very high level languages and executable graphical representations of systems. The term ?analysis? is taken to mean any automated or semi automated procedure which takes source code and yields insight into its meaning. The term ?manipulation? is taken to mean any automated or semi-automated procedure which takes and returns source code. We are currently accepting submissions for different tracks of the 21st IEEE International Working Conference on Source Code Analysis and Manipulation (IEEE SCAM 2021). Conference proceedings will be published by IEEE CS and made available through the IEEE Digital Library. Tracks (see the detailed list of topics of interest below): * Research (10 pages + 2 pages for bibliographic references only): contributions on theory, techniques, and applications that concern analysis and/or manipulation of the source code of software systems. * Engineering (6 pages): papers that discuss the innovations and solutions to practical problems that researchers and practitioners face in source code analysis and manipulation of software systems. * Replication and Negative Results (RENE, 10 pages + 2 pages for bibliographic references only): for papers reporting (1) replications of previous empirical studies (including controlled experiments, case studies, and surveys) and (2) important and relevant negative or null results (i.e., results that failed to show an effect, but help to eliminate useless hypotheses. * New Ideas and Emerging Results (NIER, 5 pages): present, discuss, and polish early-stage research. This early-stage research should be innovative and have the potential to make a strong future impact on the research or practice of software engineering. * Artifact Evaluation Track: The combined AE track will introduce the artifact evaluation for the first time to SCAM! Authors of (short and long) papers accepted in the ICSME, SCAM, or VISSOFT 2021 are invited to submit their artifacts for evaluation to the ICSME 2021 Joint Artifact Evaluation Track. How to Submit to SCAM 2021 Papers must conform to the IEEE proceedings paper format guidelines. Templates in Latex and Word are available on IEEE's website. All submissions must be in English. All authors, reviewers, and organizers are expected to uphold the IEEE Code of Conduct. Failure to do so may lead to a (desk) rejection of the paper. We follow a double-blind reviewing process. Submitted papers must adhere to the following rules: * Author names and affiliations must be omitted. (The track co-chairs will check compliance before reviewing begins.) * References to authors' own related work must be in the third person. (For example, not "We build on our previous work..." but rather "We build on the work of...") If the program chairs find that authors did not respect the rules of double-blind review they can decide to (desk) reject the paper. The papers should be submitted electronically in PDF format via EasyChair: https://easychair.org/conferences/?conf=scam2021 Topics of interest of SCAM include, but are not limited to: * abstract interpretation * bad smell detection * bug location and prediction * clone detection * concern, concept, and feature localization and mining * decompilation * energy efficient source code * natural language analysis of source code artifacts * program comprehension * program slicing * program transformation and refactoring * repository, revision, and change analysis * security vulnerability analysis * source level metrics * source level optimization * source-level testing and verification * static and dynamic analysis Additional information can be found on the conference website: http://www.ieee-scam.org/2021/ Organizing Committee General Chair * Alexander Serebrenik, Eindhoven University of Technology, The Netherlands Research Track Program Co-Chairs * Venera Arnaoudova, Washington State University, USA * Ben Hermann, Technical University Dortmund, Germany Engineering Track Program Co-Chairs * Behnaz Hassanshahi, Oracle Labs, Australia * Vadim Zaytsev, University of Twente, The Netherlands RENE Track PC Co-chairs * Bonita Sharif, University of Nebraska Lincoln, USA * Heike Wehrheim, Paderborn University, Germany New Ideas and Emerging Results (NIER) co-chairs * Maleknaz Nayebi, York University, Canada * Yannic Noller, National University of Singapore, Singapore Most Influential Paper Co-chairs * Arpad Beszedes, University of Szeged, Hungary * Dawn Lawrie, Johns Hopkins University, USA Publicity Chair * Camelia Serban, Babes-Bolyai University, Romania Finance Chair * Dave Binkley, Loyola University Maryland, USA Social Media Co-Chairs * Engineer Bainomugisha, Makerere University, Uganda * Keheliya Gallaba, McGill University, Canada Virtualization Co-chairs * Sarah Fakhoury , Washington State University, USA * Daniel Alencar da Costa, University of Otago, New Zealand Web Chair * Nathan Cassee, Eindhoven Unversity of Technology, The Netherlands -------------- next part -------------- An HTML attachment was scrubbed... URL: From rlc3 at leicester.ac.uk Mon Jun 7 11:17:53 2021 From: rlc3 at leicester.ac.uk (Crole, Roy L. (Dr.)) Date: Mon, 7 Jun 2021 15:17:53 +0000 Subject: [TYPES/announce] PhD GTA Positions at University of Leicester, UK Message-ID: Dear Colleagues, Please see below for new PhD positions https://le.ac.uk/study/research-degrees/funded-opportunities/informatics-gta-2021 As a GTA (Graduate Teaching Assistant) you will have a PhD Supervisor, a four year period to complete your PhD, and you will assist with teaching and learning during term time. Staff whose research areas fit most closely with the Types List are Roy Crole (programming types and semantics), Reiko Heckel (graph transformation, and semantics) and Irek Ulidowski (types, concurrency and reversible computation): https://www.cs.le.ac.uk/people/rcrole/ https://www.cs.le.ac.uk/people/rh122/ https://www.cs.le.ac.uk/people/iu3/ Leicester has been actively involved in the Midlands Graduate School over many years: http://www.cs.nott.ac.uk/MGS/ Kind regards, Roy Crole. -------------- next part -------------- An HTML attachment was scrubbed... URL: From ornela.dardha at gmail.com Tue Jun 8 07:02:55 2021 From: ornela.dardha at gmail.com (Ornela Dardha) Date: Tue, 8 Jun 2021 12:02:55 +0100 Subject: [TYPES/announce] VEST 2021: Call for Short Talks Message-ID: ********************************************************************* VEST 2021: 2nd Workshop on Verification of Session Types Online on July 12, 2021, co-located with ICALP 2021 https://sites.google.com/view/vest21/home Submission: Monday, 21st June 2021 ********************************************************************* * Call for Short Talks: This is a call for short talks of 10-15 mins (exact details will follow after the notification). To register your short talk, simply follow the submission link below and enter title, authors and abstract. Make sure you add ?(Short Talk)' to your title. * Submission Link: https://easychair.org/conferences/?conf= vest21 * About VEST The goal of this workshop is to bring together researchers and build and strengthen a community working on verification of session types using various theorem provers such as Agda, Coq, Isabelle or any other. Session types are abstract representations of the sequences of operations that computational entities (such as channels or objects) must perform. Stateful entities offer services in a non-uniform way (one cannot pop from an empty stack); traditional type systems cannot guarantee that operations are only invoked when the entity is in the right state. Large-scale software systems rely on message-passing protocols: their correctness largely depends on sound protocol implementations. Session types can help in the specification of correct-by-construction systems, and in verifying that programs respect their intended protocols. Recent years have seen a steady stream of research on behavioural types: their foundations and their transfer to several programming languages. This has led to highly-cited papers in conferences such as POPL and journals such as TOPLAS. Research projects on behavioural types have advanced the theory and applications of behavioural types. Although the foundations of session types are now well established, and new works build on approaches that have become standard, there is still a lack of reusable libraries, namely machine-verified ones. As on one hand the basis of most works is common, and on the other hand the complexity of the formal systems is considerable and may lead to errors in the proofs of the soundness results, machine verifying the type systems proposed is vital. Libraries, or at least clear formalisations of common approaches, is crucial to avoid not only to repeat work but also to increase the confidence in the knowledge base. Moreover, as many of these systems have a goal to do static analysis to ensure some safety or liveness property, machine verification of these approaches leads to certified software for program analysis. The goal of the VEST workshop is to gather the researchers working on mechanisations of behavioural types using various theorem provers, such as Agda, Coq, Isabelle or any other. The workshop will be a platform to present both the now well-established efforts and the ongoing works the community has put on verification. The workshop will also be a forum to discuss strengths and weaknesses of existing approaches, potential obstacles and to foster collaboration. * Important Dates AoE (UTC-12h) Submission: Monday, 21st June 2021 Notification: Friday, 25th June 2021 Workshop: Monday, 12th July 2021 * Invited Speakers: - Jesper Bengtson (IT University of Copenhagen, Denmark) - Andreia Mordido (University of Lisbon, Portugal) *Tutorial, jointly delivered by: - David Castro-Perez (University of Kent, UK) - Francisco Ferreira-Ruiz (Imperial College, UK) - Lorenzo Gheri (Imperial College, UK) * Program Committee: - Robert Atkey, University of Strathclyde, UK - Laura Bocchi, University of Kent, UK - Ornela Dardha, University of Glasgow, UK (Co-chair) - Cinzia Di Giusto, Universit? C?te d'Azur, CNRS, I3S, France - Wen Kokke, The University of Edinburgh, UK - Robbert Krebbers, Radboud University Nijmegen, Netherlands - Luca Padovani , Universit? di Torino, Italy - Kirstin Peters, TU Darmstadt, Germany - Ant?nio Ravara, NOVA University of Lisbon, Portugal (Co-chair) - Ivan Scagnetto, University of Udine, Italy - Peter Thiemann, Universit?t Freiburg, Germany -------------- next part -------------- An HTML attachment was scrubbed... URL: From hossein.haeri at gmail.com Tue Jun 8 11:15:52 2021 From: hossein.haeri at gmail.com (Seyed H. HAERI (Hossein)) Date: Tue, 8 Jun 2021 17:15:52 +0200 Subject: [TYPES/announce] Call for Position Papers: 8th Workshop on Advances in Programming Languages (WAPL'21) Message-ID: CALL FOR POSITION PAPERS ******************************************************************************* 8th Workshop on Advances in Programming Languages (WAPL'21) *https://fedcsis.org/2021/wapl * Organized within 2021 Federated Conference on Computer Science and Intelligence Systems (FedCSIS'21; IEEE #52320) ***************************** COVID-19 Information **************************** While we have planned the 2021 conference to take place in Sofia, Bulgaria, slow progress in fighting the global pandemic has forced us to switch to the fully online mode. Therefore, we plan to organize FedCSIS 2022 in Sofia, and hope that by that time COVID will be over, and we will be able to meet in person. FedCSIS organizers ******************************************************************************* FOR PAPER SUBMISSION DEADLINES SEE THE BOTTOM OF THIS MESSAGE Programming languages (PLs) are programmers' most basic tools. With appropriate programming languages one can drastically reduce the cost of building new applications as well as maintaining existing ones. In the last decades there have been many advances in PL technology in traditional programming paradigms such as functional, logic, and object-oriented programming, as well as the development of new paradigms such as aspect-oriented programming. The main driving force was and will be to better express programmers' ideas. Therefore, research in programming languages is an endless activity and the core of computer science. New language features, new programming paradigms, and better compile-time and run-time mechanisms can be foreseen in the future. The aim of this session is to provide a forum for exchange of ideas and experience in topics concerned with programming languages and systems. Original papers and implementation reports are invited in all areas of programming languages. This year, a special attention will be given to submissions on programming research in mainstream languages. That can include, but is not limited to: ? porting existing results from research languages to mainstream ones to examine their interplay with other features than those carefully cherry-picked for the targeted research. And, ? gauging generality of research results by studying their obtainability using different sets of features than originally thought of. Such submission needs to clarify the added value of performing their research in a mainstream language (over a lab one). Topics: Major topics of interest include but are not limited to the following: ? Software language engineering ? Interplay between languages and machine learning (and other branches of AI), especially for Code Repair and Code Smells ? Interplay between languages and security ? Automata theory and applications ? Compiling techniques ? Context-oriented programming languages to specify the behavior of software systems and dynamic adaptations ? Domain-specific languages ? Formal semantics and syntax ? Generative and generic programming ? Grammarware and grammar based systems ? Knowledge engineering languages, integration of knowledge engineering and software engineering ? Languages and tools for trustworthy computing ? Language theory and applications ? Language concepts, design and implementation ? Markup languages (XML) ? Metamodeling and modeling languages ? Model-driven engineering languages and systems ? Practical experiences with programming languages ? Program analysis, optimization and verification ? Program generation and transformation ? Programming paradigms (aspect-oriented, functional, logic, object-oriented, etc.) ? Programming tools and environments ? Proof theory for programs ? Specification languages ? Type systems ? Virtual machines and just-in-time compilation ? Visual programming languages ZDZIS?AW PAWLAK BEST PAPER AWARD The Professor Zdzis?aw Pawlak Awards are given in two categories: Best Paper and Best Student Paper. Each award carries a prize of 300 EUR founded by the Mazowsze Chapter of the Polish Information Processing Society. The awards have been originally associated with the International Symposium on Advanced Artificial Intelligence in Applications (AAIA) held every year as a part of FedCSIS. Currently, all papers accepted to FedCSIS are eligible to be considered as the award winners. This award will be awarded independently from awards given by individual FedCSIS events (Tracks and/or Technical Sessions). Past Award winners can be found here: https://fedcsis.org/2021/zp_award PAPER PUBLICATION: ? Authors should submit draft papers (as Postscript, PDF or MSWord file). ? The total length of a paper should not exceed 10 pages IEEE style (including tables, figures and references). IEEE style templates are available here. ? Papers will be refereed and accepted on the basis of their scientific merit and relevance to the workshop. ? Preprints containing accepted papers will be published on a USB memory stick provided to the FedCSIS participants. ? Only papers presented at the conference will be published in Conference Proceedings and submitted for inclusion in the IEEE Xplore? database. ? Conference proceedings will be published in a volume with ISBN, ISSN and DOI numbers and posted at the conference WWW site. ? Conference proceedings will be indexed in BazEkon and submitted for indexation in: Thomson Reuters - Conference Proceedings Citation Index, SciVerse Scopus, Inspec, Index Copernicus, DBLP Computer Science Bibliography and Google Scholar ? Organizers reserve right to move accepted papers between FedCSIS technical sessions. ? Extended versions of selected papers presented during the conference will be published as Special Issue(s). IMPORTANT DATES: + Paper submission (strict deadline): May 24, 2021, 23:59:59 (UCT-12; there will be no extension) + Position paper submission: June 14, 2021 + Author notification: July 5, 2021 + Final paper submission and registration: July 26, 2021 + Conference date: September 2-5, 2021 Please forward this announcement to your colleagues and associates who could be interested in it. STEERING COMMITTEE: ? Janousek, Jan, Czech Technical University, Czech Republic ? Lukovi?, Ivan, University of Novi Sad, Serbia ? Mernik, Marjan, University of Maribor, Slovenia ? Slivnik, Bo?tjan, University of Ljubljana, Slovenia ? Rangel Henriques, Pedro, Universidade do Minho, Portugal ? Varanda Pereira, Maria Joao, Instituto Politecnico de Braganca, Portugal PROGRAM COMMITTEE: ? Barisic, Ankica, Universit? C?te d'Azur, France ? Blasband, Darius, RainCode Labs, Belgium ? Falcou, Joel, Univerist? Paris Sud, France ? Fernandes, Joao ? Horv?th, Zolt?n, E?tv?s Lor?nd University, Hungary ? Kardas, Geylani, Ege University, Turkey ? Keir, Paul, University of the West of Scotland, United Kingdom ? Kosar, Tomaz, University of Maribor, Slovenia ? Mandreoli, Federica, DII - University of Modena, Italy ? Mila?inovi?, Boris, University of Zagreb, Hungary ? Papaspyrou, Nikolaos S., National Technical University of Athens, Greece ? Porub?n, Jaroslav, Technical University of Ko?ice, Slovakia ? Ramezanian, Rasoul, Ferdowsi University of Mashhad, Iran ? Saraiva, Joao, Universidade do Minho, Portugal ? Sierra, Jose Luis, Universidad Complutense de Madrid, Spain ? Singer, Jeremy, University of Glasgow, United Kingdom ? Varanda Pereira, Maria Jo?o, Instituto Politecnico de Braganca, Portugal ? Zaytsev, Vadim, Universiteit Twente, The Netherlands TECHNICAL SESSION CHAIR: ? Seyed Hossein Haeri, IOHK and University of Bergen, Norway Contact: hossein.haeri at gmail.com -------------------------------------------------------------------------------------------------------------- Seyed H. HAERI (Hossein), Dr. Software Scientist Formal Methods Team IOHK Adjunct Associate Professor Department of Informatics University of Bergen, Norway ACCU - Professionalism in programming - http://www.accu.org/ -------------------------------------------------------------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From deligu at di.unito.it Wed Jun 9 06:31:26 2021 From: deligu at di.unito.it (Ugo de Liguoro) Date: Wed, 9 Jun 2021 12:31:26 +0200 Subject: [TYPES/announce] Publication of the TYPES'20 post-proceedi9ngs Message-ID: <659d367a-33c7-434e-12ca-1246c53a1aa7@di.unito.it> Dear colleagues, on behalf of the editors Stefano Berardi, Thorsten Altenkirch and myself, it is my pleasure to communicate that the post-proceedings of TYPES'20 have been published as LIPICS Vol. 188, ISBN 978-3-95977-182-5. The link to the volume is: https://www.dagstuhl.de/dagpub/978-3-95977-182-5 All the best, Ugo -- Ugo de'Liguoro Associate Professor of Computer Science Dipartimento di Informatica Universit? di Torino Corso Svizzera 185, 10149, Torino, Italy phone: +39 011 6706766 - fax: +39 011 751603 From stourret at mpi-inf.mpg.de Wed Jun 9 16:16:54 2021 From: stourret at mpi-inf.mpg.de (Sophie Tourret) Date: Wed, 9 Jun 2021 22:16:54 +0200 Subject: [TYPES/announce] CADE 2021 call for participation In-Reply-To: <8f064fdf-f283-fb9e-5bc5-b5ad6bc8ef57@mpi-inf.mpg.de> References: <1c179272-7300-62f8-8fcb-3ccdeb1d1c23@mpi-inf.mpg.de> <47475eb3-94e1-b720-10a2-f887b6b364f9@mpi-inf.mpg.de> <8f064fdf-f283-fb9e-5bc5-b5ad6bc8ef57@mpi-inf.mpg.de> Message-ID: CADE 2021: 28th International Conference on Automated Deduction July 11-16, 2021, virtual from Pittsburgh, Pennsylvania, USA The conference on Automated Deduction (CADE) is the major international forum at which research on all aspects of automated deduction is presented. The first conference was held in 1974, with this year's conference being the 28th CADE. Early CADEs were mostly biennial, and annual conferences started in 1996. The CADE conference series is managed by CADE Inc. The 28th International Conference on Automated Deduction (CADE-28) will be virtual due to the COVID-19 pandemic. The virtual conference will take place from July 11 to 16, 2021, including affiliated workshops. Important Dates: ??? Early registration until July 4, 2021, end of the day local time (GMT-3) ??? Late registration from July 5, 2021 on. For information about registration, see the conference website at: http://www.cade-28.info/#participation . A preliminary program is available at: https://easychair.org/smart-program/CADE-28/ . -- Sophie Tourret researcher, Inria, France Guest researcher, MPI for Informatics, Germany From sam.staton at cs.ox.ac.uk Thu Jun 10 01:20:02 2021 From: sam.staton at cs.ox.ac.uk (Sam Staton) Date: Thu, 10 Jun 2021 05:20:02 +0000 Subject: [TYPES/announce] LICS 2021 Call for Participation Message-ID: <861C8192-A701-4A6A-B422-963ECE62D80F@cs.ox.ac.uk> CALL FOR PARTICIPATION Thirty-Sixth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS) co-located with ITP 2021 29 June ? 2 July 2021 preceded by workshops 27-28 June 2021 Registration (from 30 euros): http://easyconferences.eu/lics2021/registration/ Program, including links to all preprints and videos: http://easyconferences.eu/lics2021/program/ List of accepted papers: http://easyconferences.eu/lics2021/accepted-papers/ Workshops: LMW: Logic Mentoring Workshop Structure meets Power TLLA: Trends in Linear Logic and Applications WiL: Women in Logic Keynotes from Luca Aceto Martin Grohe Maurizio Lenzerini Nadia Polikarpova Ryan Williams From richard.moot at icloud.com Thu Jun 10 13:19:26 2021 From: richard.moot at icloud.com (Richard Moot) Date: Thu, 10 Jun 2021 19:19:26 +0200 Subject: [TYPES/announce] Logical Aspects of Computational Linguistics 2021: Second Call for Papers Message-ID: An HTML attachment was scrubbed... URL: From andrei.h.popescu at gmail.com Mon Jun 14 03:30:00 2021 From: andrei.h.popescu at gmail.com (Andrei Popescu) Date: Mon, 14 Jun 2021 08:30:00 +0100 Subject: [TYPES/announce] Call for Papers: Fifth Workshop on Formal Mathematics for Mathematicians (FMM 2021) Message-ID: ========================================================= Call for Papers Fifth Workshop on Formal Mathematics for Mathematicians (FMM 2021) 26-31 July 2021 (exact date TBA) Timisoara, Romania (hybrid or fully virtual) https://cicm-conference.org/2021/cicm.php?event=fmm Co-located with 14th Conference on Intelligent Computer Mathematics (CICM 2021) https://cicm-conference.org/2021/cicm.php ========================================================== Paper submission: 14 July 2021 AoE Author notification: 21 July 2021 Final version due: 25 July 2021 ========================================================== Scope ===== The FMM workshop series enables mathematicians interested in computer assistance and researchers in formal and computer-understandable mathematics to meet and exchange ideas. The meeting provides a platform for discussion of suitable forms of computer assistance between the formal community and interested mathematicians and other researchers. The main points of interest include * formalization of challenging mathematical problems * design of proof languages and techniques * repositories of formalized mathematics * interactive and automated theorem proving * development of proof assistants * semantic representation of mathematical knowledge * formal tools in program verification * foundations and philosophy of mathematics * proof assistants in education Invited Speakers ================ Mario Carneiro (Carnegie Mellon University, USA) Manuel Eberl (Technical University of Munich, Germany) Submission Guidelines ===================== Electronic submission is continuous and done via EasyChair: https://easychair.org/conferences/?conf=cicm2021 Select the author role, select the "new submission" tab, and choose FMM. We welcome submission of short papers presenting research related to the workshop's points of interest. Submitted papers should be 4-6 pages long and formatted in LaTeX using the style "onecolceurws". The corresponding style files can be downloaded from http://ceur-ws.org/Vol-XXX/samplestyles/ Submission is continuous until 14 July 2021 AoE. At least one author of each accepted paper is expected to attend FMM and present the work (online or in person). We plan to publish electronic proceedings in the CEUR Workshop Proceedings series. Program Committee (TBC) ======================= Mauricio Ayala Rincon (Brasilia University, Brasil) Jasmin Blanchette (Vrije Universiteit Amsterdam, the Netherlands; co-chair) Anthony Bordg (Cambridge University, UK) Johan Commelin (Universitaet Freiburg, Germany) Sander Dahmen (Vrije Universiteit Amsterdam, the Netherlands) Adam Naumowicz (University of Bialystok, Poland; co-chair) From carsten at dcs.bbk.ac.uk Mon Jun 14 08:35:49 2021 From: carsten at dcs.bbk.ac.uk (Carsten Fuhs) Date: Mon, 14 Jun 2021 13:35:49 +0100 Subject: [TYPES/announce] FSCD 2021: Call for (Online) Participation Message-ID: <1609f04c-74f0-acec-e496-7ce3daaa0627@dcs.bbk.ac.uk> CALL FOR PARTICIPATION Sixth International Conference on Formal Structures for Computation and Deduction (FSCD 2021) July 17 ? July 24, 2021, Buenos Aires, Argentina https://fscd2021.github.io/ In-cooperation with ACM SIGLOG and SIGPLAN The 2021 edition of FSCD and of its satellite workshops will be held online. Participation will, a priori, be free of charge, unless we receive way too many requests, in which case we will invite those who can to pay the modest amount of 7 USD. FSCD 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 (e.g., quantum computing, probabilistic computing, homotopy type theory), semantics and verification in new challenging areas (e.g., blockchain protocols or deep learning algorithms). REGISTRATION --------------- The registration page is already open and linked from: https://fscd2021.dc.uba.ar/registration.html This link should be used also to register for affiliated workshops. Registration is open until July 11. FSCD 2021 will run over the Clowdr platform. After the registration is closed, you will receive an invitation link and instructions on how to participate. INVITED SPEAKERS ---------------- - Zena M. Ariola https://ix.cs.uoregon.edu/~ariola/ - Nao Hirokawa https://www.jaist.ac.jp/~hirokawa/ - Elaine Pimentel https://sites.google.com/site/elainepimentel/ - Sam Staton https://www.cs.ox.ac.uk/people/samuel.staton/main.html FSCD AFFILIATED WORKSHOPS: -------------------------- - HoTT/UF (6th Workshop on Homotopy Type Theory/Univalent Foundations, July 17-18) - ITRS (10th Workshop on Intersection Types and Related Systems, July 17) - WPTE (7th International Workshop on Rewriting Techniques for Program Transformations and Evaluation, July 18) - UNIF (35th International Workshop on Unification, July 18) - LSFA (16th Logical and Semantics Frameworks with Applications, July 23-24) - IWC (10th International Workshop on Confluence, July 23) - IFIP WG 1.6 (24th meeting of the IFIP Working Group 1.6: Rewriting, July 24) PROGRAM COMMITTEE CHAIR ----------------------- Naoki Kobayashi, The University of Tokyo fscd2021 at easychair.org PROGRAM COMMITTEE ----------------- Mauricio Ayala-Rinc?n, Universidade de Bras?lia Stefano Berardi, University of Torino Fr?d?ric Blanqui, INRIA Eduardo Bonelli, Stevens Institute of Technology ?velyne Contejean, CNRS, Universit? Paris-Saclay Thierry Coquand, University of Gothenburg Thomas Ehrhard, Universit? de Paris, CNRS Santiago Escobar, Univ. Polit?cnica de Val?ncia Jos? Esp?rito Santo, University of Minho Claudia Faggian, Universit? de Paris, CNRS Amy Felty, University of Ottawa Santiago Figueira, Universidad de Buenos Aires Marcelo Fiore, University of Cambridge Marco Gaboardi, Boston University Silvia Ghilezan, University of Novi Sad Ichiro Hasuo, National Institute of Informatics Delia Kesner, Universit? de Paris Robbert Krebbers, Radboud University Nijmegen Temur Kutsia, Johannes Kepler University Linz Barbara K?nig, University of Duisburg-Essen Marina Lenisa, University of Udine Naoki Nishida, Nagoya University Luke Ong, University of Oxford Pawe? Parys, University of Warsaw Jakob Rehof, TU Dortmund University Camilo Rocha, Pontificia Univ. Javeriana Cali Alexandra Silva, University College London Alwen Tiu, Australian National University Sarah Winkler, University of Verona Hongseok Yang, KAIST, South Korea CONFERENCE CHAIR ---------------- Alejandro D?az-Caro, Quilmes Univ. & ICC/CONICET ORGANIZING COMMITTEE -------------------- Mauricio Ayala-Rinc?n (Workshops co-chair), Universidade de Bras?lia Santiago Figueira, Universidad de Buenos Aires & ICC Malena Ivnisky (Virtualization co-chair), Universidad de Buenos Aires & ICC Mauro Jaskelioff, Universidad Nacional de Rosario & CIFASIS Carlos L?pez Pombo (Workshops co-chair), Universidad de Buenos Aires & ICC Ricardo Rodr?guez (Virtualization co-chair), Universidad de Buenos Aires & ICC Rafael Romero (Virtualization co-chair), Universidad de Buenos Aires & ICC Nora Szasz, Universidad ORT Uruguay Beta Ziliani, Universidad Nacional de C?rdoba FSCD STEERING COMMITTEE ----------------------- Zena M. Ariola, University of Oregon Mauricio Ayala-Rinc?n, University of Brasilia Carsten Fuhs (Publicity Chair), Birkbeck, University of London Herman Geuvers, Radboud University Silvia Ghilezan, University of Novi Sad Stefano Guerrini, University of Paris 13 Delia Kesner (SC Chair), University of Paris Diderot H?l?ne Kirchner, Inria Cynthia Kop, Radboud University Damiano Mazza, University of Paris 13 Luke Ong, Oxford University Jakob Rehof, TU Dortmund Jamie Vicary (SC Workshop Chair), Oxford University From stevez at seas.upenn.edu Mon Jun 14 09:44:27 2021 From: stevez at seas.upenn.edu (Steve Zdancewic) Date: Mon, 14 Jun 2021 09:44:27 -0400 Subject: [TYPES/announce] Certified Programs and Proofs (CPP) 2022: Call for Papers Message-ID: 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 2022 (https://popl22.sigplan.org/home/CPP-2022) will be held on 16-18 January 2022 and will be co-located with POPL 2022 in Philadelphia, Pennsylvania, United States. CPP 2022 is sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG. CPP 2022 will welcome contributions from all members of the community. The CPP 2022 organizers will strive to enable both in-person and remote participation, in cooperation with the POPL 2022 organizers. IMPORTANT DATES * Abstract Submission Deadline: 16 September 2021 at 23:59 AoE (UTC-12h) * Paper Submission Deadline: 22 September 2021 at 23:59 AoE (UTC-12h) * Notification (tentative): 22 November 2021 * Camera Ready Deadline (tentative): 12 December 2021 * Conference: 16-18 January 2022 Deadlines expire at the end of the day, anywhere on earth. Abstract and submission deadlines are strict and there will be no extensions. DISTINGUISHED PAPER AWARDS Around 10% of the accepted papers at CPP 2022 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. 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. SUBMISSION GUIDELINES Prior to the paper submission deadline, the authors should upload their anonymized paper in PDF format through the HotCRP system at https://cpp2022.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 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 2022 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-Reviewing-FAQ We strongly encourage the authors to provide any supplementary material that supports 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 (possibly virtual) conference. PUBLICATION, COPYRIGHT AND OPEN ACCESS The CPP 2022 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 or HAL. 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 2022 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 Andrei Popescu, University of Sheffield, United Kingdom (co-chair) Steve Zdancewic, University of Pennsylvania, United States (co-chair) Mohammad Abdulaziz, TU M?nchen, Germany Mauricio Ayala-Rinc?n, Universidade de Bras?lia, Brazil Andrej Bauer, University of Ljubljana, Slovenia Thomas Bauereiss, University of Cambridge, United Kingdom Yves Bertot, Inria and Universit? Cote d'Azur, France Lars Birkedal, Aarhus University, Denmark Sylvie Boldo, Inria and Universit? Paris-Saclay, France Qinxiang Cao, Shanghai Jiao Tong University, China ?velyne Contejean, Laboratoire M?thodes Formelles, CNRS, France Benjamin Delaware, Purdue University, United States Simon Foster, University of York, United Kingdom Alwyn Goodloe, NASA Langley Research Center, United States Arma?l Gu?neau, Aarhus University, Denmark John Harrison, Amazon Web Services, United States Joe Hendrix, Galois, Inc, United States Aquinas Hobor, National University of Singapore, Singapore Ralf Jung, MPI-SWS, Germany Cezary Kaliszyk, University of Innsbruck, Austria Jeehoon Kang, KAIST, South Korea Hongjin Liang, Nanjing University, China Gregory Malecha, BedRock Systems, Inc, United States Anders M?rtberg, Stockholm University, Sweden Toby Murray, University of Melbourne, Australia Zoe Paraskevopoulou , Northeastern University, United States Brigitte Pientka, McGill University, Canada Aseem Rastogi, Microsoft Research, India Bas Spitters, Aarhus University, Denmark Kathrin Stark, Princeton University, United States Hira Taqdees Syeda, Chalmers University of Technology, Sweden Joseph Tassarotti, Boston College, United States Laura Titolo, NIA/NASA LaRC, United States Sophie Tourret, Inria, France Dmitriy Traytel, University of Copenhagen, Denmark Floris van Doorn, Paris-Saclay University, France Freek Verbeek, Open University of The Netherlands, Netherlands Freek Wiedijk, Radboud Universiteit Nijmegen, Netherlands ORGANIZERS Lennart Beringer, Princeton University, United States (conference co-chair) Robbert Krebbers, Radboud University, Netherlands (conference co-chair) Andrei Popescu, University of Sheffield, United Kingdom (PC co-chair) Steve Zdancewic, University of Pennsylvania, United States (PC co-chair) CONTACT For any questions please contact the two PC chairs: Andrei Popescu Steve Zdancewic From Simon.Gay at glasgow.ac.uk Mon Jun 14 10:31:10 2021 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Mon, 14 Jun 2021 15:31:10 +0100 Subject: [TYPES/announce] ICALP 2021 2nd Call for Participation Message-ID: ==================================================================== CALL FOR PARTICIPATION 48th International Colloquium on Automata, Languages and Programming ICALP 2021 online from the University of Glasgow, Scotland, 13-16 July 2021 https://easyconferences.eu/icalp2021/ ==================================================================== ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS). * Track A: Algorithms, Complexity and Games (PC Chair: Nikhil Bansal, CWI Amsterdam, Netherlands) * Track B: Automata, Logic, Semantics, and Theory of Programming (PC Chair: James Worrell, University of Oxford, UK) ================ Invited Speakers ================ Unifying Invited Speakers: Adi Shamir, Weizmann Institute of Science, Israel Toniann Pitassi, University of Toronto, Canada Andrei Bulatov, Simon Fraser University, Canada * Track A Invited Speakers: Keren Censor-Hillel, Technion, Israel David Woodruff, Carnegie Mellon University, USA * Track B Invited Speaker: Christel Baier, Technical University of Dresden, Germany ================== Contributed papers ================== http://easyconferences.eu/icalp2021/accepted/ Full schedule now available: http://easyconferences.eu/icalp2021/programme/ ================= Conference format ================= * Afternoons, European time, 13-16 July * Full-length invited talks * Contributed papers have 5-minute live talk, live Q&A, 25-minute video available in advance * Workshops: full day or two afternoons, European time, 11-12 July =========================== Workshops - 11-12 July 2021 =========================== * Algorithmic Aspects of Temporal Graphs IV Organisers: George B. Mertzios, Paul G. Spirakis, Eleni C. Akrida, Viktor Zamaraev http://community.dur.ac.uk/george.mertzios/Workshops/ICALP-21-Satellite/Temporal-Graphs-ICALP-2021.html * VEST: Verification of Session Types Organisers: Ornela Dardha, Ant?nio Ravara https://sites.google.com/view/vest21/home * 2nd Workshop on Programming Research in Mainstream Languages (PRiML 2021) Organisers: Seyed Hossein Haeri, Paul Keir https://agozillon.github.io/PRiML/ (Limited number of free registrations sponsored by IOHK) * Graph Width Parameters: from Structure to Algorithms (GWP 2021) Organisers: Flavia Bonomo, Nick Brettell, Andrea Munaro, Daniel Paulusma https://homepages.ecs.vuw.ac.nz/~bretteni/GWP2021/ * Combinatorial Reconfiguration Organisers: Takehiro Ito, Jun Kawahara, Yoshio Okamoto https://core.dais.is.tohoku.ac.jp/en/report/event/detail/---id-27.html * Formal Methods Education Online: Tips, Tricks & Tools Organisers: Jan K?et?nsk?, Maximilian Weininger, Thomas Zeume https://www7.in.tum.de/~kretinsk/fomeo.html * Flavours of Uncertainty in Verification, Planning and Optimization (FUNCTION) Organisers: Moritz Hahn, Nils Jansen, Gethin Norman https://function-2021.cs.ru.nl ============ Registration ============ http://easyconferences.eu/icalp2021/registration/ * Author registration until 15 June * Standard registration until 30 June * Late registration from 1 July * Low-cost registration for non-authors * Free registration for PhD students at Scottish universities, sponsored by SICSA (Scottish Informatics and Computer Science Alliance). Free registrations are limited to 2 author registrations and 30 non-author registrations, and will be allocated on a first-come-first-served basis. ================== Student volunteers ================== We have a student volunteer programme which offers free registration in exchange for technical assistance with running the sessions. Please check http://easyconferences.eu/icalp2021/registration/ for details. =============================== ICALP 2021 Organizing Committee =============================== Simon Gay, Conference Chair Oana Andrei Ornela Dardha Jessica Enright David Manlove Kitty Meeks Alice Miller Gethin Norman Sofiat Olaosebikan Michele Sevegnani ========== Contact us ========== For enquiries on academic programme please contact: Local Organizing Committee Email: icalp2021 at glasgow.ac.uk For enquiries, registration support, travel and logistics please contact: Easy Conferences Email: info at easyconferences.eu Tel: +357 22 591 900 =============== Twitter Account =============== @ICALPconf https://twitter.com/ICALPconf From ralf.kuesters at sec.uni-stuttgart.de Mon Jun 14 14:43:30 2021 From: ralf.kuesters at sec.uni-stuttgart.de (Ralf Kuesters) Date: Mon, 14 Jun 2021 20:43:30 +0200 Subject: [TYPES/announce] Postdoc Position in Formal Security Analysis of Cryptographic Protocols and Web Applications, University of Stuttgart, Germany Message-ID: The Institute of Information Security at University of Stuttgart offers a fully-funded Postdoc position. The successful candidate is expected to work on tool-supported formal analysis of cryptographic protocols and web applications building, among others, on our work published at EuroS&P 2021, S&P 2019, CSF 2017, CCS 2016, CCS 2015, ESORICS 2015, and S&P 2014. One goal is to provide tool-supported security analysis based on DY* for our web infrastructure model (WIM). The position is available immediately with an internationally competitive salary (German public salary scale TV-L E13 or TV-L E14, depending on the candidate's qualification). The appointment period follows the German Wissenschaftszeitvertragsgesetz (WissZeitVg), ranging from one year to up to six years. The Institute of Information Security offers a creative international environment for top-level international research in Germany's high-tech region. The successful candidate should have a Ph.D. (or should be very close to completion thereof) in Computer Science, Mathematics, Information Security, or a related field. We value strong analytical skills. Knowledge in one or more of the following fields is an asset: - Formal Methods (Verification, Theorem Proving, F*, Type Checking, etc.) - Security Protocol Analysis - Web Security Knowledge of German is not required. The University of Stuttgart is an equal opportunity employer. Applications from women are strongly encouraged. Severely challenged persons will be given preference in case of equal qualifications. To apply, please send email with subject "Application: Postdoc Position" and a single PDF file containing the following documents to ralf.kuesters at sec.uni-stuttgart.de: * Cover letter (explaining your scientific background and your motivation to apply) * Curriculum Vitae * List of publications * Copies of transcripts and certificates (Bachelor, Master, PhD) * Names of at least two references The deadline for applications is July 4th, 2021 Late applications will be considered until the position is filled. See https://sec.uni-stuttgart.de/ for more information about the institute. See https://www.sec.uni-stuttgart.de/institute/job-openings/ for the official job announcement. For further information please contact: Prof. Dr. Ralf K?sters, ralf.kuesters at sec.uni-stuttgart.de. -- Prof. Dr. Ralf K?sters Institute of Information Security - SEC University of Stuttgart Universit?tsstra?e 38 D-70569 Stuttgart Germany https://sec.uni-stuttgart.de Phone: +49 (0) 711 685 88283 From wies at cs.nyu.edu Tue Jun 15 11:20:46 2021 From: wies at cs.nyu.edu (Thomas Wies) Date: Tue, 15 Jun 2021 11:20:46 -0400 Subject: [TYPES/announce] CAV 2021 Student Fellowships Message-ID: <05e0a2bc-0fce-fcc2-726f-632b6a20a571@cs.nyu.edu> ----------------------------------- Call for Applications CAV 2021 Student Fellowships ----------------------------------- Important Dates --------------- Application deadline: July 2, 2021 Notification: July 7, 2021 Conference: July 18-14, 2021 Application Form ---------------- https://forms.gle/wrpY9eKyNEA8gog39 Objectives ---------- CAV 2021 is the 33rd in a series dedicated to the advancement of the theory and practice of computer-aided formal analysis methods for hardware and software systems. The conference will take place virtually 18-24, 2021. CAV has some funds from the National Science Foundation to cover the registration fee for student attendees of CAV'21 that are studying at a US university. The application deadline is July 2, 2021, and recipients will be notified by July 7. Funds will be provided after the conference, upon submission of the receipt for the CAV registration and a short report detailing the student's experience at and benefit from CAV'21 (these reports will be used to compile a final report to our sponsors). Special efforts will be made to bring to CAV students from under-represented groups. Applications from first-year PhD students and undergraduate students interested in formal methods are particularly encouraged. Applications must be received by the deadline. Applicants are required to apply using the following web form: https://forms.gle/wrpY9eKyNEA8gog39 If you have questions, please contact cav2021fellowship at gmail.com. Thomas Wies (CAV'21 Fellowship Chair) From m.huisman at utwente.nl Tue Jun 15 11:20:53 2021 From: m.huisman at utwente.nl (m.huisman at utwente.nl) Date: Tue, 15 Jun 2021 15:20:53 +0000 Subject: [TYPES/announce] PhD position on Embedded Systems Verification at University of Twente, Netherlands Message-ID: We are looking for a PhD candidate for a 4-year project on Formal Methods for Embedded Systems, as part of SAVES (ScAlable Verification of industrial Embedded control Systems), a collaboration with the University of M?nster (WWU M?nster). You will be working on the SAVES project, carried out in collaboration with prof. dr. Paula Herber (University of Twente / WWU M?nster). The overall goal of SAVES is to investigate methods and tools to establish correctness of embedded systems. With trends such as Industry 4.0, the internet of things, and autonomous driving, the complexity of embedded systems is steadily increasing. A prerequisite to ensure the correct functioning of industrial embedded systems under all circumstances is a clear understanding of the models and languages that are used in the development process. Formal methods provide a basis to make the development process systematic, well-defined, and automated. However, for many industrially relevant languages and models, the semantics are only informally defined. Together with the limited scalability of formal design and verification techniques, this makes the formal verification of industrial embedded control systems a difficult challenge, which can not be solved satisfactory with currently available methods and tools. At the same time, we see that in the area of deductive program verification, powerful techniques and tools have been developed to reason about software with unbounded parameters, for example the VerCors tool suite. In this project, we will extend these techniques with concepts to cope with heterogeneity, concurrency, and real-time to make them suitable for industrial embedded systems. The PhD candidate hired at the University of Twente will be supervised by Marieke Huisman and Paula Herber and will work on extensions of the methods and tools developed in the FMT group for embedded systems, in close collaboration with the Embedded Systems group in M?nster. For further information about the group, see https://www.utwente.nl/en/eemcs/fmt/. For further information about the project, see https://www.utwente.nl/en/eemcs/fmt/research/projects/saves/. YOUR PROFILE * You have a MSc degree in Computer Science (or equivalent); * You have a thorough theoretical background and a demonstrable interest in embedded or cyber-physical systems, and ideally some prior experience with embedded systems design, formal methods, and/or interactive theorem provers; * You are an enthusiastic student, skilled in exact and abstract thinking; * You are proficient in English on an academic level. OUR OFFER The terms of employment are in accordance with the Dutch Collective Labour Agreement for Universities (CAO) and include: * A fulltime PhD position for four years, with a qualifier in the first year; * Full status as an employee at the UT, including pension and health care benefits; * The salary will range from ? 2.395 (1st year) to ? 3.061,- (4th year) per month, plus a holiday allowance of 8% and a year-end bonus of 8.3%; * A solid pension scheme; * Excellent facilities for professional and personal development; * A green and lively campus, with lots of sports facilities and other activities. INFORMATION AND APPLICATION Are you interested in this position? Please send your application via https://www.utwente.nl/en/organisation/careers/!/2021-425/phd-position-on-embedded-systems- before 5th of July and include: * A cover letter (explaining your specific interest and qualifications); * A detailed Curriculum Vitae; * A list of all courses + marks and a short description of your MSc thesis; * References (contact information) of two scientific staff members. The deadline of application is July 5, 2021 or until the position is filled. Starting date of the position is as soon as possible, or to be discussed. For further information, you can contact Prof.dr.ir. Paula Herber: https://www.uni-muenster.de/EmbSys/team/herber/ or Prof.dr. Marieke Huisman: https://wwwhome.ewi.utwente.nl/~marieke/ DEPARTMENT In the Formal Methods and Tools (FMT) research group, formal techniques and tools are developed and used as a means to support the development of software. Our central goal is to increase the reliability of the software that we rely on, as individuals and as society. We primarily target complex concurrent ICT systems, embedded in a technological context or in a distributed environment. The FMT group is part of the Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) at the University of Twente. The FMT group also participates in the Digital Systems Institute (DSI). Our institute was ranked first at the most recent research national assessment. ORGANIZATION The faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) uses mathematics, electronics and computer technology to contribute to the development of Information and Communication Technology (ICT). With ICT present in almost every device and product we use nowadays, we embrace our role as contributors to a broad range of societal activities and as pioneers of tomorrow's digital society. As part of a people-first tech university that aims to shape society, individuals and connections, our faculty works together intensively with industrial partners and researchers in the Netherlands and abroad, and conducts extensive research for external commissioning parties and funders. Our research has a high profile both in the Netherlands and internationally. It has been accommodated in three multidisciplinary UT research institutes: Mesa+ Institute, TechMed Centre and Digital Society Institute. As an employer, the EEMCS Faculty offers jobs that matter. We equip you as a staff member to shape new opportunities both for yourself and for our society. With our Faculty, you will be part of a leading tech university that is changing our world for the better. We offer an open, inclusive and entrepreneurial climate, in which we encourage you to make healthy choices, for example, with our flexible, customizable conditions. UNIVERSITY OF TWENTE (UT) University of Twente (UT) has entered the new decade with an ambitious, new vision, mission and strategy. As ?the ultimate people-first university of technology' we are rapidly expanding on our High Tech Human Touch philosophy and the unique role it affords us in society. Everything we do is aimed at maximum impact on people, society and connections through the sustainable utilisation of science and technology. We want to contribute to the development of a fair, digital and sustainable society through our open, inclusive and entrepreneurial attitude. This attitude permeates everything we do and is present in every one of UT's departments and faculties. Building on our rich legacy in merging technical and social sciences, we focus on five distinguishing research domains: Improving healthcare by personalised technologies; Creating intelligent manufacturing systems; Shaping our world with smart materials; Engineering our digital society; and Engineering for a resilient world. As an employer, University of Twente offers jobs that matter. We equip you as a staff member to shape new opportunities both for yourself and for our society. With us, you will be part of a leading tech university that is changing our world for the better. We offer an open, inclusive and entrepreneurial climate, in which we encourage you to make healthy choices, for example, with our flexible, customisable conditions. -------------- next part -------------- An HTML attachment was scrubbed... URL: From ifl21.publicity at gmail.com Tue Jun 15 11:29:10 2021 From: ifl21.publicity at gmail.com (Pieter Koopman) Date: Tue, 15 Jun 2021 17:29:10 +0200 Subject: [TYPES/announce] IFL2021 second call for papers Message-ID: ================================================================================ IFL 2021 33rd Symposium on Implementation and Application of Functional Languages venue: online 1 - 3 September 2021 https://ifl21.cs.ru.nl ================================================================================ News - Paper submission is now open: https://easychair.org/conferences/?conf=ifl21 . - Invited speakers are added: Stephanie Weirich and John Hughes - Sponsor added: Facebook Research Scope The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2021 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. Industrial track and topics of interest This year's edition of IFL explicitly solicits original work concerning *applications* of functional programming in industry and academia. These contributions will be reviewed by experts with an industrial background. Topics of interest to IFL include, but are not limited to: * language concepts * type systems, type checking, type inferencing * compilation techniques * staged compilation * run-time function specialisation * run-time code generation * partial evaluation * (abstract) interpretation * meta-programming * generic programming * automatic program generation * array processing * concurrent/parallel programming * concurrent/parallel program execution * embedded systems * web applications * (embedded) domain-specific languages * security * novel memory management techniques * run-time profiling performance measurements * debugging and tracing * testing and proofing * virtual/abstract machine architectures * validation, verification of functional programs * tools and programming techniques * applications of functional programming in the industry, including ** functional programming techniques for large applications ** successes of the application functional programming ** challenges for functional programming encountered ** any topic related to the application of functional programming that is interesting for the IFL community Post-symposium peer-review Following IFL tradition, IFL 2021 will use a post-symposium review process to produce the formal proceedings. Before the symposium authors submit draft papers. These draft papers will be screened by the program chairs to make sure that they are within the scope of IFL. The draft papers will be made available to all participants at the symposium. Each draft paper is presented by one of the authors at the symposium. After the symposium every presenter is invited to submit a full paper, incorporating feedback from discussions at the symposium. Work submitted to IFL may not be simultaneously submitted to other venues; submissions must adhere to ACM SIGPLAN's republication policy. The program committee will evaluate these submissions according to their correctness, novelty, originality, relevance, significance, and clarity, and will thereby determine whether the paper is accepted or rejected for the formal proceedings. We plan to publish these proceedings in the International Conference Proceedings Series of the ACM Digital Library, as in previous years. Moreover, the proceedings will also be made publicly available as open access. Important dates Submission deadline of draft papers: 17 August 2021 Notification of acceptance for presentation: 19 August 2021 Registration deadline: 30 August 2021 IFL Symposium: 1-3 September 2021 Submission of papers for proceedings: 6 December 2021 Notification of acceptance: 3 February 2022 Camera-ready version: 15 March 2022 Submission details All contributions must be written in English. Papers must use the ACM two columns conference format, which can be found at: http://www.acm.org/publications/proceedings-template The submission Web page for IFL21 is https://easychair.org/conferences/?conf=ifl21 . Peter Landin Prize The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honoured article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. Organisation IFL 2021 Chairs: Pieter Koopman and Peter Achten, Radboud University, The Netherlands IFL Publicity chair: Pieter Koopman, Radboud University, The Netherlands PC: Peter Achten (co-chair) - Radboud University, Netherlands Thomas van Binsbergen - University of Amsterdam, Netherlands Edwin Brady - University of St. Andrews, Scotland Laura Castro - University of A Coru?a, Spain Youyou Cong - Tokyo Institute of Technology, Japan Olaf Chitil - University of Kent, England Andy Gill - University of Kansas, USA Clemens Grelck - University of Amsterdam, Netherlands John Hughes - Chalmers University, Sweden Pieter Koopman (co-chair) - Radboud University, Netherlands Cynthia Kop - Radboud University, Netherlands Jay McCarthey - University of Massachussetts Lowell, USA Neil Mitchell - Facebook, England Jan De Muijnck-Hughes - Glasgow University, Scotland Keiko Nakata - SAP Innovation Center Potsdam, Germany Jurri?n Stutterheim - Standard Chartered, Singapore Simon Thompson - University of Kent, England Melinda T?th - E?tvos Lor?nd University, Hungary Phil Trinder - Glasgow University, Scotland Meng Wang - University of Bristol, England Vikt?ria Zs?k - E?tvos Lor?nd University, Hungary Virtual symposium Because of the Covid-19 pandemic, this year IFL 2021 will be an online event, consisting of paper presentations, discussions and virtual social gatherings. Registered participants can take part from anywhere in the world. [image: beacon] -------------- next part -------------- An HTML attachment was scrubbed... URL: From emilio.tuosto at gssi.it Wed Jun 16 10:50:11 2021 From: emilio.tuosto at gssi.it (Emilio Tuosto) Date: Wed, 16 Jun 2021 16:50:11 +0200 Subject: [TYPES/announce] Postdoc at GSSI (deadline July 8, 2021) Message-ID: <40906181-100e-031a-663d-6d3f0e9fa7b4@gssi.it> dear all A 2-years post-doc position is available (gross salary 36k euros). We are interested in candidates with interest in formal methods, software engineering, or algorithms. Details at https://www.gssi.it/communication/announcements/item/12549-postdoctoral-research-fellowship-june-2021. Please do get in touch if interested. Regards eM -- *************************************************************** Emilio Tuosto Computer Science Gran Sasso Science Institute Viale F. Crispi, 7 67100 L'Aquila (Italy) Office: Palazzo Mariani P1-N Phone: +39 0862 428 0312 L'Aquila Italy homepage -> https://cs.gssi.it/emilio.tuosto/ *************************************************************** From icfp.publicity at googlemail.com Wed Jun 16 22:41:19 2021 From: icfp.publicity at googlemail.com (Sam Tobin-Hochstadt) Date: Wed, 16 Jun 2021 22:41:19 -0400 Subject: [TYPES/announce] ICFP 2021 Student Research Competition: Call for Submissions Message-ID: <60cab64f50deb_4e48e2942753@homer.mail> ICFP 2021 Student Research Competition Call for Submissions ICFP invites students to participate in the Student Research Competition, which will be held virtually alongside the main conference, in order to present their research and receive feedback from prominent members of the programming language research community. As usual, the SRC consists of three rounds: * Extended abstract * Poster session at ICFP 2021 * ICFP presentation To make the virtual competition fruitful, we will make sure that every student will have an "invited audience"?during the poster?session.? We are also planning to organize a social event for the students. Please visit the SRC website for updates. ### Important Dates Submissions due: 2 July 2021 (Friday) https://icfp21src.hotcrp.com Notification: 16 July 2021 (Friday) Conference: 22 August (Sunday) - 27 August (Friday) ### Submission Details Each submission (referred to as "abstract" below) should include the student author?s name and e-mail address; institutional affiliation; research advisor?s name; ACM student member number; category (undergraduate or graduate); research title; and an extended abstract addressing the following: * Problem and Motivation: Clearly state the problem being addressed and explain the reasons for seeking a solution to this problem. * Background and Related Work: Describe the specialized (but pertinent) background necessary to appreciate the work in the context of ICFP areas of interest. Include references to the literature where appropriate, and briefly explain where your work departs from that done by others. * Approach and Uniqueness: Describe your approach in addressing the problem and clearly state how your approach is novel. * Results and Contributions: Clearly show how the results of your work contribute to programming language design and implementation in particular and to computer science in general; explain the significance of those results. * Submissions must be original research that is not already published at ICFP or another conference or journal. One of the goals of the SRC is to give students feedback on ongoing, unpublished work. Furthermore, the abstract must be authored solely by the student. If the work is collaborative with others and*or part of a larger group project, the abstract should make clear what the student?s role was and should focus on that portion of the work. * Formatting: Submissions must be in PDF format, printable in black and white on US Letter sized paper, and interpretable by common PDF tools. All submissions must adhere to the "ACM Small" template that is available (in both LaTeX and Word formats) from https://www.acm.org/publications/authors/submissions. For authors using LaTeX, a lighter-weight package, including only the essential files, is available from http://sigplan.org/Resources/Author/#acmart-format. The submission must not exceed 3 pages in PDF format. Reference lists do not count towards the 3-page limit. Further information is available at the ICFP SRC website: https://icfp21.sigplan.org/track/icfp-2021-Student-Research-Competition Program Committee: Chair: Anders Miltner (UT Austin) Andreea Costea (NUS Singapore) Andrew Hirsch (MPI-SWS) Liam O'Connor (University of Edinburgh) Lionel Parreaux (HKUST) Daming Zou (ETH Zurich) From songfu at shanghaitech.edu.cn Thu Jun 17 01:23:30 2021 From: songfu at shanghaitech.edu.cn (songfu at shanghaitech.edu.cn) Date: Thu, 17 Jun 2021 13:23:30 +0800 Subject: [TYPES/announce] SETTA 2021 Beijing: 3rd Call for Papers Message-ID: <202106171323251118404@shanghaitech.edu.cn> (apologies for cross-posting) ======================================== SETTA 2021: Symposium on Dependable Software Engineering: Theories, Tools and Applications Institute of Software, Chinese Academy of Sciences, Beijing, China, November 25-27, 2021 Submission deadline: July 23rd, 2021 Conference website: https://lcs.ios.ac.cn/setta2021/ Colocated with FM'2021 ======================================== ************************ ABOUT SETTA 2021 ************************ The Symposium on Dependable Software Engineering: Theories, Tools and Applications (SETTA) 2021 will be held in Beijing, China on November 25-27, 2021, co-located with FM'2021. Formal methods emerged as an important area in computer science and software engineering about half a century ago. An international community is formed researching, developing and teaching formal theories, techniques and tools for software modeling, specification, design and verification. However, the impact of formal methods on the quality improvement of software systems in practice is lagging behind. This is for instance reflected by the challenges in applying formal techniques and tools to engineering large-scale systems such as Cyber-Physical Systems (CPS), Internet-of-Things (IoT), Enterprise Systems, Cloud-Based Systems, and so forth. The purpose of the SETTA symposium is to bring international researchers together to exchange research results and ideas on bridging the gap between formal methods and software engineering. The interaction with the Chinese computer science and software engineering community is a central focus point. The aim is to show research interests and results from different groups so as to initiate interest-driven research collaboration. The SETTA symposium is aiming at academic excellence and its objective is to become a flagship conference on formal software engineering in China. To achieve these goals and contribute to the sustainability of the formal methods research, it is important for the symposium to attract young researchers into the community. Thus, this symposium encourages in particular the participation of young researchers and students. This year, SETTA welcomes submissions to the following two tracks: Journal First Papers and Research Papers. All submissions must be in the PDF format. Papers should be written in English. Submitted papers must be unpublished and not submitted for publication elsewhere. Accepted papers for both tracks must be presented at the conference. Latest News: Special issues for the Elsevier Journal of Systems Architecture (JSA) and the International Journal on Software Tools for Technology Transfer (STTT) have been confirmed. Authors of selected papers from SETTA2021 will be invited to submit an extended version of their SETTA2021 paper to one of these special issues. ************************ LIST OF TOPICS ************************ Topics of interest include, but are not limited to: - Requirements specification and analysis - Formalisms for modeling, design and implementation - Model checking, theorem proving, and decision procedures - Scalable approaches to formal system analysis - Formal approaches to simulation, run-time verification, and testing - Integration of formal methods into software engineering practice - Contract-based engineering of components, systems, and systems of systems - Formal and engineering aspects of software evolution and maintenance - Parallel and multicore programming - Embedded, real-time, hybrid, probabilistic, and cyber-physical systems - Mixed-critical applications and systems - Formal aspects of service-oriented and cloud computing - Safety, reliability, robustness, and fault-tolerance - Dependability of smart software and systems - Empirical analysis techniques and integration with formal methods - Applications and industrial experience reports - Software tools to assist the construction or analysis of software systems ************************ CONFIRMED KEYNOTE SPEAKERS ************************ - Prof. Joost-Pieter Katoen RWTH Aachen University - Prof. Fritz Vaandrager Radboud University - Prof. Charles Zhang Hong Kong University of Science and Technology ************************ RESEARCH PAPERS TRACK ************************ Research papers will be published in the SETTA 2021 proceedings as a volume in Springer's LNCS series. Papers should be submitted electronically through the EasyChair submission web page . ------------------------ Important Dates ------------------------ Abstract & Paper Submission: July 23, 2021 (AoE) Notification to authors: September 3, 2021 (AoE) Camera-ready versions: September 20, 2021 (AoE) Conference date: November 25-27, 2021 ------------------------ Submission Guidelines ------------------------ Authors are invited to submit papers on original research, industrial applications, or position papers proposing challenges in fundamental research and technology. The latter two types of submissions are expected to contribute to the development of formal methods and applications thereof in software engineering. This is done by either substantiating the advantages of integrating formal methods into the development cycle or through delineating the need for research by demonstrating weaknesses of existing technologies, especially when addressing new application domains. Submissions can take the form of either regular or short papers. Regular papers should not exceed 16 pages (excluding references) in LNCS format. Short papers can discuss ongoing research at an early stage, including PhD projects. Short papers should not exceed 6 pages (excluding references) in LNCS format. ************************ JOURNAL FIRST PAPERS TRACK ************************ The journal first papers track of SETTA 2021 is implemented in partnership with the Journal of Computer Science and Technology (JCST). Accepted papers to this track will be presented and discussed at the conference SETTA 2021. Papers should be submitted electronically through the journal's submission web page . ------------------------ Important Dates ------------------------ Paper Submission: May 31, 2021 (AoE) Tentative acceptance decision: July 16, 2021 (AoE) Acceptance decision: August 30, 2021 (AoE) Conference date: November 25-27, 2020 ------------------------ Submission Guidelines ------------------------ To submit to this track, authors have to make a journal submission to the Journal of Computer Science and Technology, and select the type of submission to be for the SETTA 2021 special issue. It is recommended that submitted papers follow the submission guidelines of JCST and do not exceed 15 pages including references. ************************ COMMITTEES ************************ General Chair: - Chen Zhao, Institute of Software, Chinese Academy of Sciences Program Chair: - Shengchao Qin, Teesside University - Jim Woodcock, University of York - Wenhui Zhang, Institute of Software, Chinese Academy of Sciences Local Organisation Chair: - Zhilin Wu, Institute of Software, Chinese Academy of Sciences Publicity Chair: - Fu Song, ShanghaiTech University Program Committee Members: - Yamine Ait-Ameur (IRIT/INPT-ENSEEIHT) - Richard Banach (The University of Manchester) - Lei Bu (Nanjing University) - Milan Ceska (Brno University of Technology) - Sudipta Chattopadhyay (Singapore University of Technology and Design) - Liqian Chen (National University of Defense Technology) - Yu-Fang Chen (Academia Sinica) - Alessandro Cimatti (Fondazione Bruno Kessler) - Florin Craciun (Babes-Bolyai University) - Yuxin Deng (East China Normal University) - Wei Dong (National University of Defense Technology) - Hongfei Fu (Shanghai Jiao Tong University) - Jan Friso Groote (Eindhoven University of Technology) - Nan Guan (The Hong Kong Polytechnic University) - Dimitar Guelev (Bulgarian Academy of Sciences) - Thai Son Hoang (University of Southampton) - Chao Huang (University of Liverpool, Northwestern University) - Yu Jiang (Tsinghua University) - Sebastian Junges (University of California, Berkeley) - Guoqiang Li (Shanghai Jiao Tong University) - Yi Li (Nanyang Technological University) - Zhiming Liu (Southwest University) - Yang Liu (Nanyang Technological University) - Tiziana Margaria (Lero) - Dominique Mery (Universite de Lorraine, LORIA) - Stefan Mitsch (Carnegie Mellon University) - Jun Pang (University of Luxembourg) - Dave Parker (University of Birmingham) - Yu Pei (HK Polytechnic University) - Shengchao Qin (Teesside University) - Mickael Randour (F.R.S.-FNRS & Universite de Mons) - Stefan Schupp (TU Wien) - Zhiping Shi (Beijing Eng. Research Center of High Reliable Embbeded Systems) - Fu Song (ShanghaiTech University) - Jeremy Sproston (University of Turin) - Ting Su (East China Normal University) - Jun Sun (Singapore Management University) - Meng Sun (Peking University) - Andrea Turrini (Institute of Software, CAS) - Tarmo Uustalu (Reykjavik University) - Jaco van de Pol (Aarhus University) - Jim Woodcock (University of York) - Xiaofei Xie (Kyushu University) - Zhiwu Xu (Shenzhen University) - Bai Xue (Institute of Software, CAS) - Chenyi Zhang (Jinan University) - Wenhui Zhang (Institute of Software, CAS) ************************ VENUE ************************ The conference will be held in Beijing, China. ************************ CONTACT ************************ All questions about submissions should be emailed to setta2021 at easy*chair.org (remove *). -------------- next part -------------- An HTML attachment was scrubbed... URL: From eliasca at kth.se Thu Jun 17 15:59:37 2021 From: eliasca at kth.se (Elias Castegren) Date: Thu, 17 Jun 2021 19:59:37 +0000 Subject: [TYPES/announce] Call for Papers: AGERE 2021 Message-ID: ---- AGERE 2021, Co-located with SPLASH https://2021.splashcon.org/home/agere-2021 Chicago / Online, 17th - 22nd October (Workshop date TBD) Submission deadline: 6th August 2021 ---- The AGERE! workshop focuses on programming systems, languages and applications based on actors, active/concurrent objects, agents and?more generally?on high-level programming paradigms promoting a mindset of decentralized control in solving problems and developing software. The workshop is intended to cover both the theory and the practice of design and programming, bringing together researchers working on models, languages and technologies, with practitioners developing real-world systems and applications. The goal of the workshop is to serve as a forum for collecting, discussing, and comparing related research works that typically appear in different communities in the context of (distributed) artificial intelligence, distributed computing, computer programming, programming language design and software engineering. The workshop will be organized as a one-day workshop, integrating both: * A part with a mini-conference style, like previous editions, reserving time slots for the presentation and discussion of accepted contributions that are published on the formal proceedings on the ACM Digital Library. * A part featuring presentations of ongoing work and demonstrations of artefacts described by a set of presentation abstracts submitted to the workshop, selected by the Program Committee, to present interesting results and to solicit discussions on ideas and challenges. The workshop welcomes two types of contributions: * Mature contributions: full papers presenting new, previously unpublished research in one or more of the topics identified above. Full papers will be published on the ACM Digital Library as an official ACM SIGPLAN publication. Full papers can be up to 10 pages, excluding references and acknowledgements. * Presentation abstracts: short papers describing preliminary or ongoing work, or artefacts that authors agree to demonstrate at the workshop. The point of these submissions is to trigger discussions and interactions, and to solicit input from the community. Presentation abstracts will only be included in the informal proceedings. Presentation abstracts can be up to 2 pages, excluding references and acknowledgements. Submission: Authors are invited to submit their papers in PDF using the submission system at https://agere21.hotcrp.com/. Please use the ?acmart? LaTeX template (https://www.sigplan.org/Resources/Author/) with the ?sigplan? option. Organisers: * Elias Castegren, KTH * Joeri de Koster, Vrije Universiteit Brussel * Simon Fowler, University of Glasgow Programme Committee: * Marco Autili, University of L'Aquila * Natalia Chechina, Erlang Solutions Ltd. * Sophia Drossopoulou, Imperial College London & Facebook * Elisa Gonzalez Boix, Vrije Universiteit Brussel * Nadeem Jamali, University of Saskatchewan * Srivatsan Ravi, University of Southern California * Guido Salvaneschi, University of St. Gallen * Marjan Sirjani, Malardalen University * Mirko Viroli, Universit? di Bologna * Emilio Tuosto, Gran Sasso Science Institute * Tijs van der Storm, CWI & University of Groningen -------------- next part -------------- An HTML attachment was scrubbed... URL: From benoit.montagu at inria.fr Fri Jun 18 09:31:41 2021 From: benoit.montagu at inria.fr (Benoit Montagu) Date: Fri, 18 Jun 2021 15:31:41 +0200 Subject: [TYPES/announce] Job offer: 3 year research engineer in static analysis of OCaml programs at Inria Rennes Message-ID: <1bc12306-5f50-d106-a5b5-41565bc76350@inria.fr> Dear community, As part of a project between Inria and Nomadic Labs, we are offering a 3 year research engineer position, to work on static analysis for OCaml programs. The position will start in October in the Celtique Inria research team, in the vibrant city of Rennes, France. If you are a talented OCaml programmer, if you are interested in static analysis, or if you simply want to know more about this project, please contact me! The detailed job description is here: https://jobs.inria.fr/public/classic/fr/offres/2021-03821 Please feel free to transfer this announce to people that you think could be interested. -- Beno?t From raghotha at usc.edu Fri Jun 18 20:34:10 2021 From: raghotha at usc.edu (Mukund Raghothaman) Date: Sat, 19 Jun 2021 00:34:10 +0000 Subject: [TYPES/announce] Soliciting nominations for the POPL 2022 Artifact Evaluation Committee Message-ID: Hi everyone, TLDR: Nominate students, postdocs, and researchers for the POPL 2022 Artifact Evaluation Committee by July 8, at https://forms.gle/NxS1F9546HD4r3iL9. For the eighth year, POPL is creating an Artifact Evaluation Committee (AEC) to promote repeatable experiments in the POPL community (https://www.artifact-eval.org/). Last year, 54% of the accepted papers submitted artifacts. We are proud to announce an open call for nominations of senior graduate students, postdocs, or research community members to serve on the POPL 2022 AEC. We encourage self-nominations from anyone interested in participating in the artifact evaluation process. Participation in the AEC can provide useful insight into the value of artifacts and the process of artifact evaluation, and also helps to establish community norms for artifacts. We particularly encourage graduate students to serve on the AEC. Qualified graduate students are often in a much better position than many researchers to handle the diversity of systems expectations we will encounter. In addition, these graduate students represent the future of the community, so involving them in this process early will help push this process forward. The work of the AEC will be done between October 8 and November 1, so we are looking for people who are available during that time. Please fill out this nomination form for each nominee by July 8, 2021: https://forms.gle/NxS1F9546HD4r3iL9. Please note that in the past we have had more nominees than slots on the AEC, and so not all nominees will be able to join the AEC. We look forward to your nominations! Please let us know if you have any questions. Thank you for your help! Pavel Panchekha and Mukund Raghothaman POPL 2022 AEC Chairs -------------- next part -------------- An HTML attachment was scrubbed... URL: From sandra at dcc.fc.up.pt Sun Jun 20 07:58:54 2021 From: sandra at dcc.fc.up.pt (Sandra Alves) Date: Sun, 20 Jun 2021 12:58:54 +0100 Subject: [TYPES/announce] WiL'21 Final Call for Participation Message-ID: <2379CA39-F653-480C-9745-AEAFB152CB5B@dcc.fc.up.pt> -------------------------------------------------------------------------------------------- Final Call for Participation WiL 2021: 5th Women in Logic Workshop https://sites.google.com/g.uporto.pt/wil2021 June 27, 2021 9:20am - 6:45pm CEST part of LICS 2021 * Full funding available for speakers and other participants! * Please apply here: https://forms.gle/cs8QpjeMzd7D4q8d9 Registration: http://easyconferences.eu/lics2021/registration -------------------------------------------------------------------------------------------- Women in Logic 2021 is a satellite event of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS?21) to be held virtually from June 29 until July 2, 2021. The Women in Logic workshop (WiL) provides an opportunity to increase awareness of the valuable contributions made by women in the area of logic in computer science. Its main purpose is to promote the excellent research done by women, with the ultimate goal of increasing their visibility and representation in the community. Our aim is to: - provide a platform for female researchers to share their work and achievements; - increase the feelings of community and belonging, especially among junior faculty, post-docs and students through positive interactions with peers and more established faculty; - establish new connections and collaborations; - foster a welcoming culture of mutual support and growth within the logic research community. We believe these aspects will benefit women working in logic and computer science, particularly early-career researchers. Previous versions of Women in Logic (Reykjav?k, Iceland 2017, Oxford, UK 2018, Vancouver, Canada 2019, and Paris, France 2020) were very successful in showcasing women's work and as catalysts for a recognition of the need for change in the community. -------------------------------------------------------------------------------------------- INVITED TALKS * Simona Ronchi Della Rocca Title: "Intersection types for probabilistic computation? * Rineke Verbrugge Title: "Zero-one laws for provability logic and its transitive sisters" -------------------------------------------------------------------------------------------- CONTRIBUTED TALKS * Laura Fontanella Title: "Realising weak versions of Zorn's lemma? * Iris van der Giessen Title: "Rules in Intuitionistic Modal Logics? * Malena Ivnisky Title: "A finite-dimensional model for affine, linear quantum lambda calculi with general recursion? * Raheleh Jalali Title: "On the complexity of disjunction property? * Katarzyna W. Kowalik Title: "Long and normal solutions for Ramsey-type principles over a weak base theory? * Cleo Pau Title: "Symbolic Techniques for Proximity Relations over Full Fuzzy Signatures" * Alexandra Pavlova Title: "Game Approach to Logical Validity: A Case of Mezhirov's Provability Game" * Nicole Schrader Title: "First-Order Logic with Connectivity Operators" * Sara L. Uckelman Title: "Women in the History of Logic: Why does it Matter Who Our Foremothers Are?" * Shujun Zhang Title: "On Transforming Cut-free Cyclic Proofs into Rewriting Induction Proofs" -------------------------------------------------------------------------------------------- CONTRIBUTED POSTERS * A. Mani Title: "Mereological Emptiness for the Signed Number Problem" * Paola Cattabriga Title: "Paradox free" * Maureen Eckert Title: "Non-Domination and Centering in Val Plumwood?s Feminist Logic" -------------------------------------------------------------------------------------------- PROGRAM The detailed program is available on the WiL'21 website at https://sites.google.com/g.uporto.pt/wil2021/program -------------------------------------------------------------------------------------------- ORGANIZING AND PROGRAM COMMITTEE * Sandra Alves (Co-chair, University of Porto) * Agata Ciabattoni (TU Wien) * Amy Felty (University of Ottawa) * Maribel Fern?ndez (King's College London) * Helle Hansen (University of Groningen) * Delia Kesner (Universit? de Paris) * Sandra Kiefer (Co-chair, RWTH Aachen University/University of Warsaw) * Koko Muroya (RIMS Kyoto University) * Daniele Nantes (University of Bras?lia) * Ayb?ke ?zg?n (ILLC - University of Amsterdam) * Valeria de Paiva (Topos Institute) * Ana Sokolova (Co-chair, University of Salzburg) -------------------------------------------------------------------------------------------- SPONSORS WiL'21 is pleased to acknowledge financial support from: * ILLC, the Institute of Logic, Language and Computation of the University of Amsterdam * SIGLOG, the Special Interest Group of the ACM for Logic -------------- next part -------------- An HTML attachment was scrubbed... URL: From guido.salva at gmail.com Sun Jun 20 16:36:05 2021 From: guido.salva at gmail.com (Guido Salvaneschi) Date: Sun, 20 Jun 2021 22:36:05 +0200 Subject: [TYPES/announce] Postdoc Position, Programming Group - SCS, University of St.Gallen Message-ID: A fully funded postdoc position is open in the Programming Group at the School of Computer Science, University of St. Gallen (CH). The position is supervised by Prof. Guido Salvaneschi. Our research interests include programming languages and software engineering, with applications to distributed systems and security. For an overview of our research topics, please check the page: https://programming-group.com The position is supported by the Swiss National Science Foundation. It is available immediately with an internationally competitive salary and an initial appointment of two years. The successful candidate should have a Ph.D. (or should be very close to completion thereof) in Computer Science, Mathematics, or a related field. The position will be filled as soon as a suitable candidate is found. Applications should be sent to guido.salvaneschi at unisg.ch with a CV, including a publication list, and a short motivation letter. -- Guido Salvaneschi Associate Professor University of St.Gallen - Switzerland -------------- next part -------------- An HTML attachment was scrubbed... URL: From christian.doczkal at inria.fr Mon Jun 21 10:51:25 2021 From: christian.doczkal at inria.fr (Christian Doczkal) Date: Mon, 21 Jun 2021 16:51:25 +0200 Subject: [TYPES/announce] [Call for Participation] July 2nd: The Coq Workshop 2021 Message-ID: *********************************************************************** The Coq Workshop 2021: Call for Participation Colocated with the 12th conference on Interactive Theorem Proving (ITP 2021) online *********************************************************************** We are pleased to invite you to participate in the Coq workshop 2021, which will be held online on *July 2nd*. The Coq workshop is part of ITP 2021 (https://easyconferences.eu/itp2021/) The Coq Workshop 2021 is the 12th iteration of the Coq Workshop series (https://coq-workshop.gitlab.io/). The workshop brings together users, contributors, and developers of the Coq proof assistant (https://coq.inria.fr/). The Coq Workshop focuses on strengthening the Coq community (https://coq.inria.fr/community) and providing a forum for discussing practical issues, including the future of the Coq software and its associated ecosystem of libraries and tools. Thus, rather than serving as a venue for traditional research papers, the workshop is organized around informal presentation and discussions, supplemented with invited talks. Program: + Invited talk: Vincent Laporte. Jasmin: Certified Workbench for High-Assurance and High-Speed Cryptography + Discussion session with the Coq development team + Accepted talks: Reynald Affeldt and Cyril Cohen. Formalization of the Lebesgue Measure in MathComp-Analysis Reynald Affeldt, Xavier Allamigeon, Yves Bertot, Quentin Canu, Cyril Cohen, Pierre Roux, Kazuhiko Sakaguchi, Enrico Tassi, Laurent Th?ry and Anton Trunov. Porting the Mathematical Components library to Hierarchy Builder Cyril Cohen and Th?o Zimmermann. A Nix toolbox for reproducible Coq environments, Continuous Integration and artifact reuse Johannes Hostert, Mark Koch and Dominik Kirst. A Toolbox for Mechanised First-Order Logic Fr?d?ric Besson. ? la Nelson-Oppen Combination for congruence, lia and lra. Valentin Blot, Louise Dubois de Prisque, Chantal Keller and Pierre Vial. General automation in Coq through modular transformations Carmine Abate, Philipp G. Haselwarter, Exequiel Rivas, Antoine Van Muylder, Th?o Winterhalter, Catalin Hritcu, Kenji Maillard and Bas Spitters. SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq Danil Annenkov, Mikkel Milo, Jakob Botsch Nielsen and Bas Spitters. Extending MetaCoq Erasure: Extraction to Rust and Elm L?o Gourdin and Sylvain Boulm?. Certifying assembly optimizations in Coq by symbolic execution with hash-consing Ricardo Katz and Daniel Severin. Coq/Ssreflect for large case-based graph theory proofs See https://coq-workshop.gitlab.io/2021/ for the schedule. Registration: - See the ITP 2021 website for registration information: https://easyconferences.eu/itp2021/registration/ Program Committee: - Evelyne Contejean (CNRS, LRI) - Christian Doczkal (INRIA) [chair] - Amy Felty (University of Ottawa) - Ga?tan Gilbert (INRIA) - Ralf Jung (MPI-SWS) - Marie Kerjean (CNRS, LIPN) - Jean-Marie Madiot (INRIA) [chair] - Kazuhiko Sakaguchi (University of Tsukuba) - Kathrin Stark (Princeton University) - Pierre-Yves Strub (?cole Polytechnique, LIX) Organisation contact (co-chairs): Christian Doczkal and Jean-Marie Madiot (coq2021 at easychair.org) From gaboardi at bu.edu Mon Jun 21 12:16:10 2021 From: gaboardi at bu.edu (Gaboardi, Marco) Date: Mon, 21 Jun 2021 16:16:10 +0000 Subject: [TYPES/announce] Postdoc Position at Simon Fraser University in Vancouver, Canada Message-ID: <2F4FC055-7CE4-46A4-ADE3-F14E8722F2F4@bu.edu> The announcement below may be relevant for people interested in Rust, ownership types, and verification looking for a postdoc position. Best, Marco Steve Ko (Associate Professor at Simon Fraser University in Vancouver, Canada, https://steveyko.github.io/) is looking for a postdoc with a background in programming languages and/or software engineering. The postdoc will work on a research project that explores verification for mobile systems software using the Rust language combined with symbolic execution and other verification tools. The project is being done in collaboration with Marco Gaboardi (Associate Professor at Boston University in Boston, USA, http://cs-people.bu.edu/gaboardi/). The postdoc will be the main lead of the project and potentially work with a group of PhD/MS/undergraduate students. The expected duration of the position is two years. Interested applicants are encouraged to send their CV directly to Steve Ko at steveyko at sfu.ca. - Steve From anupamdotdas at gmail.com Mon Jun 21 15:04:57 2021 From: anupamdotdas at gmail.com (anupamdotdas at gmail.com) Date: Mon, 21 Jun 2021 20:04:57 +0100 Subject: [TYPES/announce] PhD position: Proof Theory and Algebra of Fixed Points. Birmingham, UK and Melbourne, Australia. Deadline: **16 July** Message-ID: <002801d766d0$543466b0$fc9d3410$@gmail.com> Dear colleagues, I have a PhD opportunity available, co-supervised by Daniel Murfet, at the University of Birmingham (UoB), UK, and the University of Melbourne (UoM), Australia. Please encourage any interested students to apply and/or get in touch with us directly for informal enquiries. The deadline is **16 July**, so please get in touch soon! A successful student would conduct research on proof theoretic and algebraic aspects of fixed points, in particular taking advantage of recent advances in cyclic proofs and coalgebra. That said, the project is intentionally broad to accommodate the interests/expertise of the student. The PhD advertisement (and application page) is available here: https://www.findaphd.com/phds/project/proof-theory-and-algebra-for-fixed-poi nts/?p133258 Funding for this position is open to students *worldwide* (not only UK or Australia) for a duration of 3.5 years, beginning October 2021. A successful student would take up the position initially at one of the institutions UoB or UoM, at which they would spend the first 18 and final 12 months of the PhD. The intermediate 12 months should be spent at the other institution, for which extra funds are available. Best, Anupam a.das at bham.ac.uk -------------- next part -------------- An HTML attachment was scrubbed... URL: From davide.bresolin at unipd.it Tue Jun 22 13:16:45 2021 From: davide.bresolin at unipd.it (Davide Bresolin) Date: Tue, 22 Jun 2021 19:16:45 +0200 Subject: [TYPES/announce] DEADLINE EXTENSION: GandALF2021 - 12th International Symposium on Games, Automata, Logics, and Formal Verification In-Reply-To: <8255ad57-cc9a-452c-91f2-3015f8724a89@Spark> References: <8255ad57-cc9a-452c-91f2-3015f8724a89@Spark> Message-ID: <7e52adb0-a49a-4654-855a-539028c18e71@Spark> The Organising Committee of GandALF 2021 decided to extend the deadline to June 30 for abstract submission and July 7 for paper submission. We look forward to your submissions! ***************************************************************************** CALL FOR PAPERS - GandALF 2021 - EXTENDED DEADLINE ***************************************************************************** The 12th International Symposium on Games, Automata, Logics, and Formal Verification will be held in Padua (Italy) on September 20-22, 2021. This year, GANDALF will be organised together with the 3rd Workshop on Artificial Intelligence and fOrmal VERification, Logic, Automata, and sYnthesis (OVERLAY 2021,?https://overlay.uniud.it/workshop/2021/). The OVERLAY workshop focuses on the relationships between Artificial Intelligence and Formal Methods, and discusses on the opportunities and challenges at the border of the two areas. Both events will be hosted by the University of Padua, and will share some invited speakers. We encourage participation in both events. GANDALF 2021 is planned to be a hybrid conference. We aim at organizing an in-presence event, but there will be possibilities for virtual participation for delegates affected by travel restrictions. https://gandalf2021.math.unipd.it/ ***************************************************************************** The aim of GandALF 2021 is to bring together researchers from academia and industry which are actively working in the fields of Games, Automata, Logics, and Formal Verification. The idea is to cover an ample spectrum of themes, ranging from theory to applications, and stimulate cross-fertilization. Papers focused on formal methods are especially welcome. Authors are invited to submit original research or tool papers on all relevant topics in these areas. Papers discussing new ideas that are at an early stage of development are also welcome. The topics covered by the conference include, but are not limited to, the following: Automata Theory Automated Deduction Computational aspects of Game Theory Concurrency and Distributed computation Decision Procedures Deductive, Compositional, and Abstraction Techniques for Verification Finite Model Theory First-order and Higher-order Logics Formal Languages Formal Methods for Systems Biology, Hybrid, Embedded, and Mobile Systems Games and Automata for Verification Game Semantics Logical aspects of Computational Complexity Logics of Programs Modal and Temporal Logics Model Checking Models of Reactive and Real-Time Systems Probabilistic Models (Markov Decision processes) Program Analysis and Software Verification Reinforcement Learning Run-time Verification and Testing Specification and Verification of Finite and Infinite-state Systems Synthesis IMPORTANT DATES (all dates are AoE) - EXTENDED DEADLINES ***************************************************************************** Abstract submission: June 30, 2021 (EXTENDED) Paper submission: July 7, 2021 (EXTENDED) Notification: August 4, 2021 (EXTENDED) Camera-ready: August 30, 2021 Conference: September 20-22, 2021 PUBLICATIONS ***************************************************************************** The proceedings will be published by Electronic Proceedings in Theoretical Computer Science. ***Authors of the best papers will be invited to submit a revised version of their work to a special issue of Logical Methods in Computer Science***. The previous editions of GandALF already led to special issues of the International Journal of Foundations of Computer Science (GandALF 2010), Theoretical Computer Science (GandALF 2011 and 2012), Information and Computation (GandALF 2013, 2014, 2016, 2017, 2019 and 2020), and Acta Informatica (GandALF 2015). SUBMISSIONS ***************************************************************************** Submitted papers should not exceed 14 pages (excluding references and clearly marked appendices) using EPTCS format, be unpublished and contain original research. Please use the LaTeX style provided at?http://style.eptcs.org?to format the paper. For papers reporting experimental results, authors are encouraged to make their data available with their submission. Submissions must be in PDF format and will be handled via the EasyChair Conference system at the following address: https://www.easychair.org/conferences/?conf=gandalf2021 INVITED SPEAKERS ***************************************************************************** Roderick Bloem, TU Graz, Austria Anca Muscholl, LaBRI, Bordeaux, France Nicola Olivetti, Aix-Marseille University, France S.E. (Sicco) Verwer, TU Delft, The Netherlands PROGRAM CHAIRS ***************************************************************************** Davide Bresolin, University of Padua (Italy) Pierre Ganty, IMDEA Software Institute, Madrid (Spain) PROGRAM COMMITTEE ***************************************************************************** Mohamed Faouzi Atig, Uppsala University (Sweden) Christel Baier, TU Dresden (Germany) Saddek Bensalem, VERIMAG (France) Nathalie Bertrand, INRIA (France) Pedro Cabalar, University of Corunna (Spain) Thomas Colcombet, CNRS (France) Wojciech Czerwi?ski, University of Warsaw (Poland) Orna Kupferman, Hebrew University (Israel) S?awomir Lasota, University of Warsaw (Poland) Konstantinos Mamouras, Rice University (USA) Roland Meyer, TU Braunschweig (Germany) Marco Montali, Free University of Bozen-Bolzano (Italy) Paritosh Pandya, TIFR (India) Doron Peled, Bar Ilan University (Israel) Guillermo Perez, University of Antwerp (Belgium) R. Ramanujam, Institute of Mathematical Sciences (India) Francesco Ranzato, University of Padua (Italy) Pierre-Alain Reynier, Aix-Marseille Universit? (France) Mark Reynolds, The University of Western Australia (Australia) Ashutosh Trivedi, University of Colorado Boulder (USA) STEERING COMMITTEE ***************************************************************************** Luca Aceto, Reykjavik University (Iceland) Javier Esparza, University of Munich (Germany) Salvatore La Torre, University of Salerno (Italy) Angelo Montanari, University of Udine (Italy) Mimmo Parente, University of Salerno (Italy) Jean-Fran?ois Raskin, Universit? libre de Bruxelles (Belgium) Martin Zimmermann, University of Liverpool (UK) -------------- next part -------------- An HTML attachment was scrubbed... URL: From Luigia.Petre at abo.fi Wed Jun 23 08:48:22 2021 From: Luigia.Petre at abo.fi (Luigia Petre) Date: Wed, 23 Jun 2021 12:48:22 +0000 Subject: [TYPES/announce] CfP: FMTea21 --> Formal Methods Teaching Workshop and Tutorial, Nov 21, 2021, ONLINE Message-ID: <6cb4bfae638d4e3b9dae0676c675b703@abo.fi> [ Please distribute, apologies for multiple postings. ] ========================================================= Call for Papers: Formal Methods Teaching Workshop and Tutorial (FMTea 2021) 21 November 2021, *online* Co-located with the 24th International Symposium on Formal Methods, FM 2021 FMTea21 is a one-day combined workshop and tutorial that brings together researchers and educators working on formal methods to share their experiences in teaching formal methods, discuss key challenges, and stimulate collaboration that can lead to ways to reboot the presence of formal methods in curricula. FMTea21 will be an online event at the 24th International Symposium on Formal Methods, FM2021. More details can be found on the workshop website: https://fmtea.github.io ========================================================= Invited Speakers ======================== - Tobias Nipkow (Technical University Munich, Germany) Provisional title: "Teaching Algorithms and Data Structures with a Proof Assistant" - A second invited speaker will be announced soon! Important Dates ======================== - 2 July 2021: Deadline for submission of papers (AoE) - 2 August 2021: Notifications to authors - 17 September 2021: Deadline for camera-ready version - 21 November 2021: FMTea21 Workshop (online) Objectives and Scope ======================== Formal Methods provide software engineering with tools and techniques for rigorously reasoning about the correctness of systems. While in recent years formal methods are increasingly being used in industry, university curricula are not adapting at the same pace. Some existing formal methods classes interest and challenge students, whereas others fail to ignite student motivation. It is thus important to develop, share, and discuss approaches to effectively teach formal methods to the next generations. This discussion is now more important than ever due to the challenges and opportunities that arose from the pandemic, which forced many educators to adapt and deliver their teaching online. Exchange of ideas is critical to making these new online approaches a success and having a greater reach. Topics ======================== In the workshop part of the event, we welcome papers detailing experiences with FM Teaching, including papers discussing successes and failures of various methods, case studies, tools, etc. Given the increasing importance of online teaching and self-learning, we also welcome reports of experiences with online teaching, including experiences with teaching formal methods via MOOCs. We invite novel papers that cover, but are not limited to, the following aspects: - Experiences and proposals related with "traditional" FM learning and teaching - Experiences and proposals related with online FM learning and teaching - Integrating/embedding FM teaching/thinking within other computer science courses - Teaching FM for industry - Innovative learning and teaching methods for FM Submission Details ======================== FMTea21 invites high quality papers reporting on opinions, approaches, and experiences related to the topic of teaching Formal Methods. Each submitted paper will be reviewed by at least three PC members. As in previous events, the conference proceedings will be published in Springer's Lecture Notes in Computer Science series. All submissions must be original, unpublished, and not submitted for publication elsewhere. Submissions must be in PDF format, using the Springer LNCS style files. Papers should not exceed 15 pages in length. Submissions should be made using the FMTea21 Easychair web site: https://easychair.org/conferences/?conf=fmtea21 All accepted papers must be remotely presented at the workshop. Authors must be prepared to sign a copyright transfer statement. At least one author of each accepted paper must register to the conference by an early date, to be indicated by the FM2021 organizers, and present the paper. Organization ======================== FMTea21 is organized by FME?s Teaching Committee, whose broad aim is to support a worldwide improvement in learning Formal Methods, mainly by teaching but also via self-learning. To that end, the committee manages a list of FM courses taught worldwide (https://fme-teaching.github.io) and plans to collect other resources as well, such as FM case studies, FM inspirational papers, etc. Program Committee ======================== - Jo?o F. Ferreira (co-chair), INESC-ID & IST, University of Lisbon, Portugal - Alexandra Mendes (co-chair), INESC TEC & University of Beira Interior, Portugal - Claudio Menghi (co-chair), University of Luxembourg, Luxembourg - Sandrine Blazy, University of Rennes 1, France - Brijesh Dongol, University of Surrey, UK - Catherine Dubois, ENSIIE, France - Rustan Leino, Amazon Web Services, US - Jos? N. Oliveira, University of Minho, Portugal - Luigia Petre, ?bo Akademi University, Finland - Leila Ribeiro, Federal University of Rio Grande do Sul, Brazil - Kristin Rozier, Iowa State University, US - Pierluigi San Pietro, Politecnico di Milano, Italy - Emil Sekerinski, McMaster University, Canada - Graeme Smith, The University of Queensland, Australia - Kenji Taguchi, CAV, Japan Contact ======================== All questions about submissions should be emailed to the chairs. __ Luigia Petre, Docent, PhD Faculty of Science and Engineering ?bo Akademi University, Finland www.users.abo.fi/lpetre -------------- next part -------------- An HTML attachment was scrubbed... URL: From benjamin.kaminski at informatik.rwth-aachen.de Wed Jun 23 11:06:44 2021 From: benjamin.kaminski at informatik.rwth-aachen.de (Benjamin Kaminski) Date: Wed, 23 Jun 2021 17:06:44 +0200 Subject: [TYPES/announce] Workshop on Verification of Probabilistic Programs (VeriProP 2021) - Call for Presentations and Participation Message-ID: <53C3B684-6867-4186-ADA2-4B8E0BFF232B@informatik.rwth-aachen.de> The Workshop on Verification of Probabilistic Programs (VeriProP 2021), co-located with CAV 2021, aims to bring together researchers interested in the tool-supported verification of probabilistic programs, models, and systems. This includes probabilistic model checking, program verification in the presence of a source of randomness, or formal guarantees for statistical machine learning algorithms and artificial intelligence systems. The program will consist of invited and contributed presentations. ================== Invited Speakers ================== - Guy van den Broeck - Michael Carbin - Maria Gorinova - Laura Kovacs ==================================== Important Dates and Submission ==================================== Submission date: Monday, July 5 Notification date: Wednesday, July 7 Workshop: Monday, July 19 Submission link: https://easychair.org/my/conference?conf=veriprop2021 For contributed presentations, we solicit *short presentations of 10 minutes* either on ongoing research or giving an overview of past research. Topics of interest include, but are not limited to: - Symbolic approaches to the verification of Markov models - Exact inference techniques - Abstract interpretation for probabilistic programs - Domain-specific probabilistic programming languages - Verification of inference algorithms - Automation of deductive approaches to verifying probabilistic programs- - Probabilistic program reasoning in safety, security, or privacy - Synthesis of probabilistic programs We call for extended abstracts (1-2 pages in pdf format) describing either ongoing research or an overview of past research in the workshop?s scope. We welcome abstracts covering work that has been previously published or is currently under review. There will be no formal proceedings. More information can be found here: https://veriprop.github.io/2021 ================== Organization ================== This workshop will be held *fully online* on July 19th, 2021, as a satellite event of the 33st International Conference on Computer-Aided Verification (CAV). The workshop is chaired by: - Fredrik Dahlqvist, University College London - Sebastian Junges, UC Berkeley - Benjamin Kaminski, University College London - Christoph Matheja, ETH Z?rich From xnningxie at gmail.com Wed Jun 23 14:27:50 2021 From: xnningxie at gmail.com (Ningning Xie) Date: Wed, 23 Jun 2021 14:27:50 -0400 Subject: [TYPES/announce] Final Call for Talks: Haskell Implementors' Workshop @ ICFP'21 Message-ID: Final Call for Talks ACM SIGPLAN Haskell Implementors' Workshop https://icfp21.sigplan.org/home/hiw-2021 Virtual, 22 Aug, 2021 Co-located with ICFP 2021 https://icfp21.sigplan.org/ New: Invited Speaker -------------------- Title: Haskell reinterpreted ? large-scale real-world experience with the Mu compiler in Financial Markets Speaker: Bengt Marten Agren, Standard Chartered Bank Important dates --------------- Deadline: Wednesday, 30 June, 2021 (AoE) Notification: Wednesday, 14 July, 2021 Workshop: Sunday, 22 August, 2021 The 13th Haskell Implementors' Workshop is to be held alongside ICFP 2021 this year virtually. It is a forum for people involved in the design and development of Haskell implementations, tools, libraries, and supporting infrastructure, to share their work and discuss future directions and collaborations with others. Talks and/or demos are proposed by submitting an abstract, and selected by a small program committee. There will be no published proceedings. The workshop will be informal and interactive, with open spaces in the timetable and room for ad-hoc discussion, demos, and lightning short talks. Scope and target audience ------------------------- It is important to distinguish the Haskell Implementors' Workshop from the Haskell Symposium which is also co-located with ICFP 2021. The Haskell Symposium is for the publication of Haskell-related research. In contrast, the Haskell Implementors' Workshop will have no proceedings -- although we will aim to make talk videos, slides and presented data available with the consent of the speakers. The Implementors' Workshop is an ideal place to describe a Haskell extension, describe works-in-progress, demo a new Haskell-related tool, or even propose future lines of Haskell development. Members of the wider Haskell community encouraged to attend the workshop -- we need your feedback to keep the Haskell ecosystem thriving. Students working with Haskell are specially encouraged to share their work. The scope covers any of the following topics. There may be some topics that people feel we've missed, so by all means submit a proposal even if it doesn't fit exactly into one of these buckets: * Compilation techniques * Language features and extensions * Type system implementation * Concurrency and parallelism: language design and implementation * Performance, optimisation and benchmarking * Virtual machines and run-time systems * Libraries and tools for development or deployment Talks ----- We invite proposals from potential speakers for talks and demonstrations. We are aiming for 20-minute talks with 5 minutes for questions and changeovers. We want to hear from people writing compilers, tools, or libraries, people with cool ideas for directions in which we should take the platform, proposals for new features to be implemented, and half-baked crazy ideas. Please submit a talk title and abstract of no more than 300 words. Submissions should be made via HotCRP. The website is: https://icfp-hiw21.hotcrp.com/ We will also have lightning talks session. These have been very well received in recent years, and we aim to increase the time available to them. Lightning talks be ~7mins and are scheduled on the day of the workshop. Suggested topics for lightning talks are to present a single idea, a work-in-progress project, a problem to intrigue and perplex Haskell implementors, or simply to ask for feedback and collaborators. Logistics --------- Due to the on-going COVID-19 situation, ICFP (and, consequently, HIW) will be held remotely this year. However, the organizers are still working hard to provide for a great workshop experience. While we are sad that this year will lack the robust hallway track that is often the highlight of HIW, we believe that this remote workshop presents a unique opportunity to include more of the Haskell community in our discussion and explore new modes of communicating with our colleagues. We hope that you will join us in making this HIW as vibrant as any other. Program Committee ----------------- * Dominique Devriese (Vrije Universiteit Brussel) * Daan Leijen (Microsoft Research) * Andres L?h (Well-Typed LLP) * Julie Moronuki (Typeclass Consulting) * John Wiegley (DFINITY) * Ningning Xie (the University of Hong Kong) * Edward Z. Yang (Facebook AI Research) Contact ------- * Ningning Xie -------------- next part -------------- An HTML attachment was scrubbed... URL: From nclpltt at gmail.com Thu Jun 24 06:25:38 2021 From: nclpltt at gmail.com (Nicola Paoletti) Date: Thu, 24 Jun 2021 11:25:38 +0100 Subject: [TYPES/announce] Lectureships available at Royal Holloway, University of London -- Computer Science and Information Security (multiple posts) Message-ID: ================================ Application closing date: midnight 5 July 2021 Interview date: week commencing 19 July 2021 Please apply at: - https://jobs.royalholloway.ac.uk/vacancy.aspx?ref=0621-185 (Computer Science) - https://jobs.royalholloway.ac.uk/vacancy.aspx?ref=0621-184 (Computer Science with Cyber Security) ================================ The Department of Computer Science at Royal Holloway is looking to appoint an experienced academic to support its research and teaching. We carry out outstanding research and deliver excellent teaching at both undergraduate and postgraduate level: we ranked 11th in the Research Excellence Framework (REF 2014) for the quality of our research output, and in teaching we are in the top 10 in the UK for graduate prospects (Complete University Guide 2021). Over the past seven years, we have undertaken an ambitious plan of expansion: sixteen new academic members of staff were appointed, new undergraduate and integrated-masters programmes were created, and six new postgraduate-taught programmes were launched. We are involved in multiple inter/multidisciplinary activities, from electrical engineering to psychology and social sciences. Recently Royal Holloway launched a catalyst for ?Transformative Digital Technologies, Security and Society?, which we aim to contribute to. Our research strength also generates significant interest and collaborative opportunity from universities and third stream partners. We are now recruiting an academic member of staff who can complement or strengthen our existing research, which falls broadly within Intelligent Systems, Machine Learning, Algorithms and Complexity, and Programming Languages and Systems; we also have strong connections with the Information Security Group. We particularly welcome applications from researchers in Artificial Intelligence and Machine Learning, Systems and the Internet of Things, Distributed Systems and Security, and Networking, but we welcome exceptional candidates from all disciplines in Computer Science and those who can also contribute to the new catalyst(s). The successful candidate will help us seek and seize opportunities for research funding and industrial engagement. They will hold a PhD or equivalent, and will have a proven research record in any of those areas, with a solid background in the underlying theory. Experience in attracting funding, engaging with industry, or contributing to outreach activities would also be valuable. The appointee will be expected to contribute across the full range of departmental activities, including undergraduate and postgraduate teaching and the supervision of mainstream projects over a wide range of topics. In particular, duties and responsibilities of this post include: conducting individual or collaborative research projects; producing high-quality outputs for publication in high-profile journals or conference proceedings; applying for research funding; delivering high-quality teaching to all levels of students; supervising research postgraduate students. This is a full-time and permanent (tenured) post, available from August 2021 or as soon as possible thereafter. The post is based in Egham, Surrey, within commuting distance from London, Europe?s most dynamic technology hub. For further details of the Department see https://royalholloway.ac.uk/research-and-teaching/departments-and-schools/computer-science/ or contact the Head of Department at carlos.matos at rhul.ac.uk. -- Nicola Paoletti Lecturer - Department of Computer Science - Royal Holloway, University of London Bedford building 2-25 https://nicolapaoletti.com/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From ornela.dardha at gmail.com Fri Jun 25 05:41:00 2021 From: ornela.dardha at gmail.com (Ornela Dardha) Date: Fri, 25 Jun 2021 10:41:00 +0100 Subject: [TYPES/announce] VEST'21: Call for Participation Message-ID: <06050913-93A0-4891-A5F5-B809341C2C2E@gmail.com> ********************************************************************* VEST 2021: 2nd Workshop on Verification of Session Types Online on July 12, 2021, co-located with ICALP 2021 https://sites.google.com/view/vest21/home Call for Participation ********************************************************************* * Presentation The goal of this workshop is to bring together researchers and build and strengthen a community working on verification of session types using various theorem provers such as Agda, Coq, Isabelle or any other. Session types are abstract representations of the sequences of operations that computational entities (such as channels or objects) must perform. Stateful entities offer services in a non-uniform way (one cannot pop from an empty stack); traditional type systems cannot guarantee that operations are only invoked when the entity is in the right state. Large-scale software systems rely on message-passing protocols: their correctness largely depends on sound protocol implementations. Session types can help in the specification of correct-by-construction systems, and in verifying that programs respect their intended protocols. Recent years have seen a steady stream of research on behavioural types: their foundations and their transfer to several programming languages. This has led to highly-cited papers in conferences such as POPL and journals such as TOPLAS. Research projects on behavioural types have advanced the theory and applications of behavioural types. Although the foundations of session types are now well established, and new works build on approaches that have become standard, there is still a lack of reusable libraries, namely machine-verified ones. As on one hand the basis of most works is common, and on the other hand the complexity of the formal systems is considerable and may lead to errors in the proofs of the soundness results, machine verifying the type systems proposed is vital. Libraries, or at least clear formalisations of common approaches, is crucial to avoid not only to repeat work but also to increase the confidence in the knowledge base. Moreover, as many of these systems have a goal to do static analysis to ensure some safety or liveness property, machine verification of these approaches leads to certified software for program analysis. The goal of the VEST workshop is to gather the researchers working on mechanisations of behavioural types using various theorem provers, such as Agda, Coq, Isabelle or any other. The workshop will be a platform to present both the now well-established efforts and the ongoing works the community has put on verification. The workshop will also be a forum to discuss strengths and weaknesses of existing approaches, potential obstacles and to foster collaboration. * Invited Speakers: - Jesper Bengtson (IT University of Copenhagen, Denmark) - Andreia Mordido (University of Lisbon, Portugal) *Tutorial, jointly delivered by: - David Castro-Perez (University of Kent, UK) - Francisco Ferreira-Ruiz (Imperial College, UK) - Lorenzo Gheri (Imperial College, UK) * Registration Please follow this link http://easyconferences.eu/icalp2021/registration/ to register. Standard/Early-bird registration before June 30! -------------- next part -------------- An HTML attachment was scrubbed... URL: From ariesco at fdi.ucm.es Fri Jun 25 10:33:42 2021 From: ariesco at fdi.ucm.es (ADRIAN RIESCO RODRIGUEZ) Date: Fri, 25 Jun 2021 16:33:42 +0200 Subject: [TYPES/announce] Last Call for Participation: 12th International School on Rewriting (ISR 2021), online and free Message-ID: ================== LAST CALL FOR PARTICIPATION ================== 12th International School on Rewriting (ISR 2021) 5-16 July 2021 Virtual event hosted via ZOOM by Universidad Complutense de Madrid https://dalila.sip.ucm.es/isr2021/ Registration (FREE but required) is open at: https://eventos.ucm.es/66824/detail/12th-international-school-on-rewriting-isr-2021.html ================== Rewriting is a powerful model of computation that underlies much of declarative programming and is ubiquitous in mathematics, logic, theorem proving, verification, model-checking, compilation, biology, chemistry, physics, etc. In 2021, the 12th International School on Rewriting (ISR 2021) will take place online as a virtual event hosted via ZOOM by the Computer Science School at Universidad Complutense de Madrid, Spain. The school is aimed at Master and PhD students, researchers and practitioners interested in the use or the study of rewriting and its applications. >From July 5 to July 16 a course will be taught every day, according to the schedule published in the web page. ================== COURSES ================== Christiano Braga: Compiler construction in Maude Paola Bruscoli: An introduction to deep inference methodology in proof theory Santiago Escobar: Unification and Narrowing in Maude 3.0 Maribel Fernandez: Nominal rewriting Carsten Fuhs: Automated complexity analysis for term rewriting Maja H. Kirkeby & Robert Gl?ck: Inversion and term rewriting systems Jean-Jacques Levy: Lambda calculus, the generalized finite development theorem Luigi Liquori & Vincent van Oostrom: Lambda calculi with patterns Dorel Lucanu, Xiaohong Chen & Grigore Rosu: From rewriting to matching logic Jorge A. Perez: Session types for message-passing concurrency Carolyn Talcott: Pathway Logic, using rewriting logic to understand how cells work ================== REGISTRATION ================== Registration is FREE but required. https://eventos.ucm.es/66824/detail/12th-international-school-on-rewriting-isr-2021.html ================== ORGANIZERS ================== David de Frutos Escrig Narciso Marti-Oliet Albert Rubio Manuel Montenegro Adrian Riesco Contact: narciso at ucm.es ISR 2021 is promoted by the IFIP WG1.6 and supported by Universidad Complutense de Madrid. ================== -------------- next part -------------- An HTML attachment was scrubbed... URL: From richard.moot at icloud.com Sat Jun 26 11:32:49 2021 From: richard.moot at icloud.com (Richard Moot) Date: Sat, 26 Jun 2021 17:32:49 +0200 Subject: [TYPES/announce] Logical Aspects of Computational Linguistics 2021 - Deadline Extension/Final call for papers Message-ID: An HTML attachment was scrubbed... URL: From tringer at cs.washington.edu Sun Jun 27 20:54:00 2021 From: tringer at cs.washington.edu (Talia Ringer) Date: Sun, 27 Jun 2021 17:54:00 -0700 Subject: [TYPES/announce] Gauging interest for a machine learning & type theory workshop Message-ID: If you're interested in attending or helping organize a workshop at the intersection of machine learning and type theory (dependent types for machine learning, type theory for neurosymbolic AI, and so on), I'd love it if you filled out a form indicating interest and spread the word: https://forms.gle/SkCRszwSCK5s56ZP6 I'm hoping to look back at this in mid-to-late July after a vacation and put together some kind of organizing team. There is already an overwhelming amount of interest from the machine learning community---I think the timing is really perfect. I think this conversation between the two communities is really important, and my hope is for some new collaborations that spin out of the workshop. So it will probably be based more on working groups and less on talks. The form includes an input question prompting for ideas if you have any. Thanks! Talia -------------- next part -------------- An HTML attachment was scrubbed... URL: From florin.manea at informatik.uni-goettingen.de Mon Jun 28 02:43:33 2021 From: florin.manea at informatik.uni-goettingen.de (Manea, Florin) Date: Mon, 28 Jun 2021 06:43:33 +0000 Subject: [TYPES/announce] CSL 2022: Last call for papers Message-ID: <702401b8b553444a93965cd43f78554f@informatik.uni-goettingen.de> ===================================== Last call for papers CSL'22 ===================================== News and updates: Deadlines approaching: abstract submission -- 5.7 (in one week), Paper submission -- 12.7. Updated information on submission guidelines, Helena Rasiowa award, and collocated events. ===================================== Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL), see https://www.eacsl.org/. CSL is an interdisciplinary conference, spanning across both basic and application oriented research in mathematical logic and computer science. CSL'22 will be held on February 14 - 19, 2022, in G?ttingen, Germany. Currently, we expect that the conference will be organized in a hybrid way: both with an in-presence component and an online component. A final decision on the format of the conference will be reached and announced in September 2021. Website: http://csl2022.uni-goettingen.de/ Invited speakers: ----------------- Annabelle McIver Macquarie (University, Sydney, Australia) Udi Boker (IDC Herzliya, Israel) Martin Escardo (University of Birmingham, UK) Rosalie Iemhoff (Utrecht University, The Netherlands) Karen Lange (Wellesley College, USA) Submission guidelines: ---------------------- Submitted papers must be in English and must provide sufficient detail to allow the Programme Committee to assess the merits of the paper. Full proofs may appear in a clearly marked technical appendix which will be read at the reviewers' discretion. Authors are strongly encouraged to include a well written introduction which is directed at all members of the PC. The CSL 2022 conference proceedings will be published in Leibniz International Proceedings in Informatics (LIPIcs), see https://submission.dagstuhl.de/documentation/authors. 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. Proofs omitted due to space constraints should be put into an appendix, to be read by the program committee members at their discretion. 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. Submissions should be made via easychair: https://easychair.org/conferences/?conf=csl2022 Helena-Rasiowa-Award: --------------------- The Helena Rasiowa Award is the best student paper award for the CSL conference series, starting from CSL 2022. The award will be given to the best paper (as decided by the PC) written solely by students or for which students were the main contributors. A student in this context is any person who is currently studying for a degree or whose PhD award date is less than one year prior to the first day of the conference. Read more about the contribution of Helena Rasiowa to logic and computer science, and their interplay, here: https://www.eacsl.org/?page_id=1104 At submission, the authors should clearly indicate if their paper is eligible for this award. Important dates: ---------------- Abstract submission: July 5, 2021 (AoE), Paper submission: July 12, 2021 (AoE), Notification: September 30, 2021, Conference: February 14-19, 2022 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 Program Committee: ------------------ Thorsten Altenkirch (Nottingham, UK) Benedikt Bollig (Cachan, France) Agata Ciabattoni (Vienna, Austria) Liron Cohen (Ben-Gurion University, Israel) Anupam Das (Birmingham, UK) Claudia Faggian (Paris, France) Francesco Gavazzo (Bologna, Italy) Stefan G?ller (Kassel, Germany) Willem Heijltjes (Bath, UK) Sandra Kiefer (Aachen, Germany) Emanuel Kieronski (Wroclaw, Poland) Bartek Klin (Warsaw, Poland) Juha Kontinen (Helsinki, Finland) Anthony Lin (Kaiserslautern, Germany) Karoliina Lehtinen (Marseille, France) Florin Manea (G?ttingen, Germany, co-chair) Fredrik Nordvall Forsberg (Strathclyde, UK) Liat Peterfreund (Paris, France and Edinburgh, UK) Daniela Petrisan (Paris, France) Karin Quaas (Lepizig) Alex Simpson (Ljubljana, Slovenia, co-chair) Pawel Sobocinski (Tallin, Estonia) Anna Sokolova (Salzburg, Austria) Linda Brown Westrick (Connecticut, US) Organization Committee: ----------------------- Fundamentals of Computer Science Group - University of G?ttingen, Germany. Colocated events: ----------------- LCC 2022: Logic and Computational Complexity --------- Meetings of the workshop "Logic and Computational Complexity" are aimed at the foundational interconnections between logic and computational complexity, as present, for example, in implicit computational complexity (descriptive and type-theoretic methods); deductive formalisms as they relate to complexity (e.g. ramification, weak comprehension, bounded arithmetic, linear logic and resource logics); complexity aspects of finite model theory and databases; complexity-mindful program derivation and verification; computational complexity at higher type; and proof complexity. LCC 2022 will be the 23rd workshop in the series, see https://www.cs.swansea.ac.uk/lcc/. The program will consist of invited lectures as well as contributed papers selected by the Program Committee. LMW at CSL: Logic Mentoring Workshop --------- The Logic Mentoring Workshop introduces young researchers to the technical and practical aspects of a career in logic research. It is targeted at students, from senior undergraduates to graduates, and will include talks and panel sessions from leaders in the subject. Building on successful LMW editions from past years, its first winter edition will be collocated with CSL 2022. Website: https://lmw.mpi-sws.org/csl/ Contact: -------- Please send all questions about submissions to the PC co-chairs: csl2022 at easychair.org From sebastien.bardin at cea.fr Mon Jun 28 04:29:55 2021 From: sebastien.bardin at cea.fr (=?iso-8859-1?Q?BARDIN_S=E9bastien?=) Date: Mon, 28 Jun 2021 08:29:55 +0000 Subject: [TYPES/announce] =?iso-8859-1?q?=5BPhD_grant=5D_=22Speculating_a?= =?iso-8859-1?q?bout_low-level_security=22=3A_A_fully-funded_PhD_positions?= =?iso-8859-1?q?_in_software_security=2C_program_analysis_=26_formal_metho?= =?iso-8859-1?q?ds__=40__Universit=E9_Paris-Saclay=2C_CEA_List=2C_France?= In-Reply-To: References: <9496febc9e0d4848980637d3e4a2f801@cea.fr>, , <7463cef84c3a42c3971721bbe9f7b70e@cea.fr>, <18221_1622013357_60ADF5AB_18221_13967_1_62a3942aa9a841978b0f531e04815505@cea.fr>, Message-ID: <2d5ab4db3e5742cb88856011fb584e49@cea.fr> The BINary-level SECurity research group (BINSEC) @ CEA is offering 1 fully-funded Ph.D. position at the crossroad of software security, program analysis and formal methods, in order to develop formal analysis techniques for speculation-based attacks. Interested? Do not hesitate to get in touch with us. keywords: formal methods, security, micro-architectural attacks, program analysis, speculative execution, automated symbolic reasoning === Topic: Speculating About Low-level Security Recent micro-architectural attacks take advantage of subtle behaviours at the micro-architectural levels, typically speculative behaviours introduced in modern architectures for efficiency, in order to bypass protections and leak sensitive data [4]. These vulnerabilities are extremely hard to find by a human expert, as they require to reason at a very low-level, on an exponential number of otherwise-hidden speculative behaviours, and on complex security properties (leaks and data interference, rather than standard memory corruptions). The goal of this doctoral work is to understand how automated symbolic verification methods (especially but not limited to, symbolic execution [2]) can be efficiently lifted to the case of speculative micro-architectural attacks, with the ultimate goal of securing essential security primitives in cryptographic libraries and OS kernels. Keywords: micro-architectural attacks, binary-level analysis, speculative executions, information leaks, symbolic execution Advisor: S?bastien Bardin (CEA), Tamara Rezk (Inria) Prior results: preliminary results on side channels and Spectre attacks published in top-tiers security conferences [1,3] Contact: sebastien.bardin at cea.fr References [1] Lesly-Ann Daniel, S?bastien Bardin, Tamara Rezk. Binsec/Rel: Efficient Relational Symbolic Execution for Constant-Time at Binary-Level. In S&P 2020 [2] Cristian Cadar, Koushik Sen: Symbolic execution for software testing: three decades later. Commun. ACM 56(2):82-90 (2013) [3] Lesly-Ann Daniel, S?bastien Bardin, Tamara Rezk. Hunting the Haunter: Efficient Relational Symbolic Execution for spectre with Haunted RelSE. In NDSS 2021 [4] Jo Van Bulck, Michael Schwarz et al. A Systematic Evaluation of Transient Execution Attacks and Defenses, in USENIX Security Symposium, 2019. === HOW TO APPLY Detailed topics are available on demand. Applications should be sent to sebastien.bardin at cea.fr as soon as possible (first come, first served), and by early July at the latest. Candidates should send a CV, a cover letter, a transcript of all their university results, as well as contact information of two referees. Each Ph.D. position is expected to start in October 2021 and will have a duration of 3 years. == The BINSEC team @ CEA The BINary-level SECurity research group (BINSEC) is a dynamic team of 4 senior researchers focusing on developing low-level program analysis tailored to security needs. The group has frequent publications in top-tier security, formal methods and software engineering conferences. We work in close collaboration with other French and international research teams, industrial partners and national agencies. The team is part of Universit? Paris-Saclay. See https://binsec.github.io/ for additional information. -------------- next part -------------- An HTML attachment was scrubbed... URL: From nachumd at tauex.tau.ac.il Tue Jun 29 06:18:14 2021 From: nachumd at tauex.tau.ac.il (Nachum Dershowitz) Date: Tue, 29 Jun 2021 10:18:14 +0000 Subject: [TYPES/announce] FSCD 2022 call for workshops In-Reply-To: References: <29D10DFB-BE2C-4330-86D6-5AEEF0E2BA15@tauex.tau.ac.il> Message-ID: FSCD 2022 SATELLITE WORKSHOP PROPOSALS Researchers and practitioners are invited to submit proposals for workshops on topics of interest to the Formal Structures for Computation and Deduction (FSCD) community. FSCD 2022 will be the seventh edition of the International Conference on Formal Structures for Computation and Deduction, a merger of two former conferences, the International Conference on Rewriting Techniques and Applications (RTA) and the International Conference on Typed Lambda Calculi and Applications (TLCA). FSCD 2022 will be part of the Eighth Federated Logic Conference (FLoC), which will host ten conferences and their affiliated workshops. FLoC 2022 will be held (health guidelines permitting) at the Technion, in Haifa, Israel, from July 31 to August 12, 2022. For information regarding FLoC, see http://floc2022.org FSCD invites proposals for workshops, tutorials or other satellite events, on any topic related to formal structures in computation, deduction and automated reasoning, from theoretical foundations to tools and applications. Each workshop proposal should consist of the following two parts: ? A short scientific justification of the proposed topic, its significance, and the particular benefits of the workshop to the community, as well as a list of previous or related workshops (if relevant). ? An organizational part including: ? contact information for the workshop organizers; ? proposed affiliated conference (i.e. FSCD); ? estimate of the number of workshop participants (please note that small workshops, i.e. of fewer than ~13 participants, will likely be cancelled or merged); ? proposed format and agenda (e.g. paper presentations, tutorials, demo sessions, etc.); ? potential invited speakers (note that expenses of workshop invited speakers are not covered by FLoC or FSCD); ? procedures for selecting papers and participants; ? plans for dissemination, if any (e.g. a journal special issue); ? duration (which may vary from one day to two days); ? preferred period (pre- or post-FLoC); ? virtual/hybrid backup plans (including platform preference). The FLoC Organizing Committee will determine the final list of accepted workshops based on the recommendations from the workshop chairs of the hosting conferences and availability of space and facilities. For workshop guidelines, further details and FAQ, see http://floc2022.org/workshops Proposals should be submitted through EasyChair: https://easychair.org/conferences/?conf=floc2022workshops IMPORTANT DATES Proposal deadline: September 27, 2021 Notification: November 1, 2021 Pre-FLoC workshops: Sunday & Monday, July 31?August 1, 2022 Post-FLoC workshops: Thursday & Friday, August 11?12, 2022 CONTACT INFORMATION Questions regarding workshop proposals should be sent to the FSCD workshop chair: ? Nachum Dershowitz (nachum at tau.ac.il) Questions regarding FSCD may be addressed to the FSCD program chair: ? Amy Felty (afelty at uottawa.ca) Questions regarding FLoC may be sent to the FLoC workshop chairs: ? Shaull Almagor (shaull at technion.ac.il) ? Guillermo A. Perez (GuillermoAlberto.Perez at uantwerpen.be) From peterol at ifi.uio.no Tue Jun 29 19:04:23 2021 From: peterol at ifi.uio.no (=?utf-8?Q?Peter_Csaba_=C3=98lveczky?=) Date: Wed, 30 Jun 2021 01:04:23 +0200 Subject: [TYPES/announce] Associate professor position in formal methods at the University of Oslo Message-ID: <04000E24-BE79-4890-BBED-1195EE73F342@ifi.uio.no> A full-time tenured/permanent associate professor position in formal methods is available at the University of Oslo, Norway. ** Application deadline: August 11, 2021 ** See https://www.jobbnorge.no/en/available-jobs/job/208063/associate-professor-in-formal-methods for details and on how to apply. The formal methods research group at the University of Oslo is quite international, with faculty and PhD students from all around the world, and is actively involved in European projects and organizing international scientific conferences and workshops. Beautiful and family-friendly Oslo provides rich opportunities for culture and outdoor activities, and Norway is known for its good quality of life. --------- Feel free to contact Professor Peter ?lveczky (peterol AT ifi.uio.no) or Professor Einar Broch Johnsen (einarj AT ifi.uio.no) for more information about the position, and HR Adviser Torunn Standal Guttormsen (t.s.guttormsen AT mn.uio.no) for administrative questions. From alexander.nadel at intel.com Wed Jun 30 02:33:38 2021 From: alexander.nadel at intel.com (Nadel, Alexander) Date: Wed, 30 Jun 2021 06:33:38 +0000 Subject: [TYPES/announce] SMT Workshop 2021: Call for Participation In-Reply-To: References: Message-ID: SMT 2021 Call for Participation 19th International Workshop on Satisfiability Modulo Theories (SMT 2021) July 18-19, 2021, Online 8am -- 12:45pm PDT Affiliated with CAV 2021 http://smt-workshop.cs.uiowa.edu/2021/index.shtml Registration: https://regmaster.com/2021conf/CAV21/register.php Early Registration till July 9: 75$/10$ (students); Regular Registration: 125$/15$ (students) ================================================================================================================================================ We are pleased to invite you to participate in the SMT 2021 workshop. Determining the satisfiability of first-order formulas modulo background theories, known as Satisfiability Modulo Theories (SMT), has proved to be an enabling technology for verification, synthesis, test generation, compiler optimization, scheduling, and other areas. The aim of the annual SMT workshop is to bring together researchers and users of SMT tools and techniques. This year, we have an exciting and versatile program, which includes the following sessions: Sunday, July 18 1. Invited Talk by Guy Katz (Hebrew University): Using SMT and Abstraction-Refinement for Neural Network Verification 2. Theory of SMT 3. Proofs and Interpolation 4. Boosting SMT Solving 5. SMT Competition 2021: Report Monday, July 19 1. Invited Talk by Karem Sakallah (University of Michigan): AVR: Word-Level Verification by Equality Abstraction of Data State 2. SMT Applications 3. SMT-LIB and API (Technical Session) 4. SMT-LIB and Business Meeting Program details appear at http://smt-workshop.cs.uiowa.edu/2021/program.shtml Talks will be live and will include Q&A. Program Chairs: - Aina Niemetz (Stanford University) - Alexander Nadel (Intel) --------------------------------------------------------------------- Intel Israel (74) Limited This e-mail and any attachments may contain confidential material for the sole use of the intended recipient(s). Any review or distribution by others is strictly prohibited. If you are not the intended recipient, please contact the sender and delete all copies. -------------- next part -------------- An HTML attachment was scrubbed... URL: From pangjun at gmail.com Wed Jun 30 02:58:19 2021 From: pangjun at gmail.com (Jun PANG) Date: Wed, 30 Jun 2021 08:58:19 +0200 Subject: [TYPES/announce] Formal Methods 2021: Workshops and Tutorials Message-ID: 24th International Symposium on Formal Methods Beijing, November 20-26, 2021 (held virtually) ---------------------------------------------- Workshops and Tutorials ======================= http://lcs.ios.ac.cn/fm2021/workshops-and-tutorials/ The FM'21 Symposium on Formal Methods will host six exciting workshops and tutorials on various topics related to formal methods. * FMTea: Formal Methods Teaching * appFM: Applicable Formal Methods * Implementing an IDE for "tiny" Event-B with JetBrains Metaprogramming System MPS * FMI Co-simulation Based Digital Twin * Momba: Python for Quantitative Models * Continuous Verification using CBMC For details about these events and how to participate or submit see the Workshops and Tutorials page: http://lcs.ios.ac.cn/fm2021/workshops-and-tutorials/ For questions about the general organization of workshops and tutorials: * FM Workshops Chairs: Carlo A. Furia (Universit? della Svizzera Italiana, Switzerland); Lijun Zhang (Chinese Academy of Sciences, China) * FM Tutorials Chairs: Luigia Petre (?bo Akademi University, Finland); Tim A.C. Willemse (Eindhoven University of Technology, Netherlands) From m.huisman at utwente.nl Wed Jun 30 10:16:55 2021 From: m.huisman at utwente.nl (m.huisman at utwente.nl) Date: Wed, 30 Jun 2021 14:16:55 +0000 Subject: [TYPES/announce] assistant/associate professor in formal methods and programming, at University of Twente, Netherlands Message-ID: <973B50A7-39B9-41E1-A368-A6A7C689D172@utwente.nl> The Formal Methods and Tools (FMT) group of the Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) of the University of Twente is looking for an Assistant/Associate Professor in the area of formal methods and programming. You will teach in - and contribute to the degree programmes of Computer Science and Creative Technology, and you will participate in the teaching program of specialized courses related to Software Technology in Computer Science. In particular, the candidate is expected to contribute to programming education in the first and second year of Creative Technology, as well teaching a course on Principles of Programming, Processes and Patterns Programming and supervising Software Technology students during their Industrial Software Engineering Project. The FMT Group: The mission of FMT is to develop mathematical methods, high-performance data structures and algorithms, and suitable programming languages for the design of reliable software- and data-intensive control systems. We focus on modelling, synthesis, analysis, prediction, and maintenance of their functional, structural and quantitative aspects. We aim to understand a complex systems? safety, reliability, performance, energy usage and the risks and costs associated to its architecture, design, operation, and maintenance. Our mission builds on extensive experience in concurrency theory, static analysis, theorem proving, language design, model checking and term/graph rewriting. More information about the group: https://www.utwente.nl/en/eemcs/fmt/ FMT embraces scholarship in learning and teaching. We are proudly involved in education at all levels: In undergraduate and graduate university curricula, primary and secondary schools, teacher education, extracurricular programs, and post-graduate teaching. We use the classroom setting in our research, co-publish with students, and do active research on educational research. FMT has is an open and welcoming group. We value social interaction and transparency, and we value the input of all members of the group. Your profile You have a strong interest and shown ability to collaborate in an academic, multidisciplinary environment. A successful candidate will also demonstrate her or his intrinsic motivation and strong abilities for teaching at the bachelor and master level, and to various groups of students. You have excellent communication skills, allowing efficient interaction with colleagues. Furthermore, we encourage you to apply if: * You have a PhD degree in Computer Science or a related discipline; * You are capable of strengthening the FMT group; * You have strong abilities for high-quality research and teaching in a multidisciplinary context; * You are effective in acquiring external funding; * You are fluent in English. Knowledge of, or willingness to learn Dutch is an advantage; * You have a University Teaching Qualification (Dutch: BKO) or equivalent, or are willing to acquire one within three years. Our offer * We offer a fulltime structural position, starting with a temporary appointment with the prospect of a permanent position after a positive evaluation; * Our terms of employment are in accordance with the Dutch Collective Labor Agreement for Universities (CAO) and include a holiday allowance of 8% of the gross annual salary and a year-end bonus of 8.3 %; * Depending on your relevant background and experience, the gross monthly salary on a full-time basis ranges from ? 3.746,- to ? 6.940,- per month; * A minimum of 29 leave days in case of full-time employment based on a formal workweek of 38 hours. A fulltime employment in practice means 40 hours a week, therefore resulting in 96 extra leave hours on an annual basis; * Furthermore, we offer excellent professional and personal development programs; * Finally, you will work in a lively, inspiring and dynamic working environment in an organization focusing on internationalization, where you will have a high degree of responsibility and independence. Information and application Are you interested in joining our team? Please submit your application before the 14th of July 2021, via https://www.utwente.nl/en/organisation/careers/!/50/, including: * A curriculum vitae (including, list of publications, research and teaching statement) * A cover letter in which you describe your motivation and qualifications for the position. You are welcome to contact prof.dr. M. Huisman via m.huisman at utwente.nl, for any questions you might have. About the organization The faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) uses mathematics, electronics and computer technology to contribute to the development of Information and Communication Technology (ICT). With ICT present in almost every device and product we use nowadays, we embrace our role as contributors to a broad range of societal activities and as pioneers of tomorrow's digital society. As part of a people-first tech university that aims to shape society, individuals and connections, our faculty works together intensively with industrial partners and researchers in the Netherlands and abroad, and conducts extensive research for external commissioning parties and funders. Our research has a high profile both in the Netherlands and internationally. It has been accommodated in three multidisciplinary UT research institutes: Mesa+ Institute, TechMed Centre and Digital Society Institute. As an employer, the EEMCS Faculty offers jobs that matter. We equip you as a staff member to shape new opportunities both for yourself and for our society. With our Faculty, you will be part of a leading tech university that is changing our world for the better. We offer an open, inclusive and entrepreneurial climate, in which we encourage you to make healthy choices, for example, with our flexible, customizable conditions. University of Twente (UT) University of Twente (UT) has entered the new decade with an ambitious, new vision, mission and strategy. As ?the ultimate people-first university of technology' we are rapidly expanding on our High Tech Human Touch philosophy and the unique role it affords us in society. Everything we do is aimed at maximum impact on people, society and connections through the sustainable utilisation of science and technology. We want to contribute to the development of a fair, digital and sustainable society through our open, inclusive and entrepreneurial attitude. This attitude permeates everything we do and is present in every one of UT's departments and faculties. Building on our rich legacy in merging technical and social sciences, we focus on five distinguishing research domains: Improving healthcare by personalised technologies; Creating intelligent manufacturing systems; Shaping our world with smart materials; Engineering our digital society; and Engineering for a resilient world. As an employer, University of Twente offers jobs that matter. We equip you as a staff member to shape new opportunities both for yourself and for our society. With us, you will be part of a leading tech university that is changing our world for the better. We offer an open, inclusive and entrepreneurial climate, in which we encourage you to make healthy choices, for example, with our flexible, customisable conditions. -------------- next part -------------- An HTML attachment was scrubbed... URL: From ornela.dardha at gmail.com Thu Jul 1 09:08:55 2021 From: ornela.dardha at gmail.com (Ornela Dardha) Date: Thu, 1 Jul 2021 14:08:55 +0100 Subject: [TYPES/announce] PhD positions in PL at University of Glasgow: application deadline 31st July Message-ID: <6C1CCD81-07A1-4381-A1DE-164E9D5F4371@gmail.com> The School of Computing Science at the University of Glasgow is offering studentships to support PhD research for students starting in autumn 2021. Types of Scholarships being offered: Minerva Scholarships. These are Research and Teaching Scholarships. See https://www.gla.ac.uk/schools/computing/postgraduateresearch/prospectivestudents/minervascholarships/ for more information. Excellence Bursaries. These are Research Scholarships. Seehttps://www.gla.ac.uk/schools/computing/postgraduateresearch/prospectivestudents/excellencebursaries for more information. Whilst the above funding is open to students in all areas of computing science, applications in the area of programming languages are most welcomed. Available supervisors in this area at the School include (check the PL theme website https://www.gla.ac.uk/schools/computing/research/researchthemes/pl-theme/ for further details) * Dr Ornela Dardha PL Theme Lead (programming languages foundations, logic, (session) types for functional/concurrent systems, mechanisation), email ornela.dardha at glasgow.ac.uk * Prof Simon Gay (programming language theory, verification techniques based on session types for concurrent/distributed systems), email simon.gay at glasgow.ac.uk * Dr Jeremy Singer (compilers, cloud, managed run-times, parallelism, resource management), email Jeremy.singer at glasgow.ac.uk * Prof Phil Trinder (programming languages, functional programming, parallel/distributed systems), email phil.trinder at glasgow.ac.uk * Prof Wim Vanderbauwhede (programming languages, compilation, heterogeneous & FPGA computing), email wim.vanderbauwhede at glasgow.ac.uk Students can apply for admission to PhD study at any time, but to be considered for the studentships we are offering at this round, we must receive your application by 31 July 2021. For more information about how to apply, see https://www.gla.ac.uk/schools/computing/postgraduateresearch/prospectivestudents/ . This web page includes information about the research proposal, which is required as part of your application. Applicants are strongly encouraged to contact a potential supervisor and discuss an application before the submission deadline. -------------- next part -------------- An HTML attachment was scrubbed... URL: From julien.signoles at cea.fr Thu Jul 1 09:33:31 2021 From: julien.signoles at cea.fr (Julien Signoles) Date: Thu, 1 Jul 2021 15:33:31 +0200 Subject: [TYPES/announce] Call for Book Chapters: Guide to Software Verification with Frama-C Message-ID: <4dadcd16-ba54-f84b-7898-7602c12de09d@cea.fr> Call for Book Chapters Book Title:Guide to Software Verification with Frama-C. Core Components, Usages, and Applications. Edited book to be published by Springer Editors:Nikolai Kosmatov, Virgile Prevosto, Julien Signoles Description This book aims at presenting Frama-C, an open source platform for analyzing C source code. It fosters collaborations between various techniques, by letting individual analyzers exchange information about the properties they can handle. In a similar manner, the platform is meant to be easily extensible, in particular, by third-party developers. Finally, Frama-C is aimed at being usable by software engineers that are not necessarily experts in formal methods. This implies providing as much automation as possible, as well as assessing the performances of the platform on real-world case studies. The purpose of this book is to provide a panorama of the platform, its core components, its usages, and its applications. Frama-C is not a single tool, but a framework that groups together several tools. Each tool is provided as a plug-in. Roughly speaking, the plug-ins distributed with the platform can be decomposed in the following broad categories: * verification plug-ins; * plug-ins supporting the verification process; * plug-ins for better understanding the analyzed code; * plug-ins for simplifying the analyzed code; * plug-ins for extending the expressiveness of other analyzers. Many industries in various domains rely on Frama-C to ensure safety and/or security of their critical applications. The extensibility of the platform allowed industrial engineers and tool developers to abstract from the groundwork of code parsing and data structure design, and to focus on new forms of verification. Target Audience This book targets a large audience of readers interested in software verification and validation. They include industrial practitioners interested in verification of specific software products or development of new verification tools. They also include evaluation and certification authorities working on certification of critical software. Finally, this book will provide a helpful source of information to university professors and students taking courses in software analysis and verification. As a preliminary background, the book will assume only a basic knowledge of the C programming language. In particular, the readers will not need to be familiar with Formal Methods. Information for authors Authors are invited to submit chapter proposals related to Frama-C on the following (non-exhaustive) list of topics: * core verification techniques, * advanced usages, * combination of analysis techniques, * case studies and industrial applications, * emerging domains. A chapter is expected to contain around 20-30 pages. The chapters will be blind-reviewed. Whenever possible, authors should try to make chapters self-contained. Submission The authors will be asked to use the Springer Latex Template. Precise instructions on the Latex template and formatting will be communicated later. Important dates * Declaration of intention by the authors with an abstract of a few lines: at your earliest convenience, ideally before July 15, 2021 * Chapter Submission deadline: November 1st, 2021 * Notification: February 1, 2022 * Final submission: September 1, 2022 * Expected publication by Springer: End of 2022 Contact Information Email: nikolaikosmatov at gmail.com , virgile.prevosto at cea.fr , julien.signoles at cea.fr -------------- next part -------------- An HTML attachment was scrubbed... URL: From sam.staton at cs.ox.ac.uk Thu Jul 1 11:14:12 2021 From: sam.staton at cs.ox.ac.uk (Sam Staton) Date: Thu, 1 Jul 2021 15:14:12 +0000 Subject: [TYPES/announce] Call for Workshops: FLoC 2022 -- The 2022 Federated Logic Conference Message-ID: Second Call for Workshops- FLoC 2022 ? The 2022 Federated Logic Conference July 31 - August 12, 2022 Haifa, Israel http://www.floc2022.org/ Deadline on September 27, 2021 [apologies for cross posting] CALL FOR WORKSHOPS The Eighth Federated Logic Conference (FLoC 2022) will host the following ten conferences and affiliated workshops. LICS (37th Annual ACM/IEEE Symposium on Logic in Computer Science) https://lics.siglog.org// Workshop chair: Frederic Blanqui Frederic.Blanqui at inria.fr FSCD (7th International Conference on Formal Structures for Computation and Deduction) http://fscd-conference.org/ Workshop chair: Nachum Dershowitz nachumd at tau.ac.il ITP (13th International Conference on Interactive Theorem Proving) https://itp-conference.github.io/ Workshop chair: Cyril Cohen cyril.cohen at inria.fr IJCAR (International Joint Conference on Automated Reasoning) http://www.ijcar.org Workshop chairs: Simon Robillard simon.robillard at imt-atlantique.fr Sophie Tourret stourret at mpi-inf.mpg.de CSF (35th IEEE Computer Security Foundations Symposium) http://www.ieee-security.org/CSFWweb/ Workshop chair: Musard Balliu musard at kth.se CAV (34th International Conference on Computer Aided Verification) http://i-cav.org/ Workshop chair: TBD KR (19th International Conference on Principles of Knowledge Representation and Reasoning) http://www.kr.org/ Workshop chair: Stefan Borgwardt stefan.borgwardt at tu-dresden.de ICLP (38th International Conference on Logic Programming) https://www.cs.nmsu.edu/ALP/conferences/ Workshop chair: Daniela Inclezan inclezd at miamioh.edu SAT (25th International Conference on Theory and Applications of Satisfiability Testing) http://www.satisfiability.org Workshop chair: Alexander Nadel alexander.nadel at intel.com CP (25th International Conference on Principles and Practice of Constraint Programming) http://a4cp.org/events/cp-conference-series Workshop chair: TBD SUBMISSION OF WORKSHOP PROPOSALS Researchers and practitioners are invited to submit proposals for workshops on topics in the field of computer science, related to logic in the broad sense. Each workshop proposal must indicate one affiliated conference of FLoC 2022. It is strongly suggested that prospective workshop organizers contact the relevant conference workshop chair before submitting a proposal. Each proposal should consist of the following two parts. 1) A short scientific justification of the proposed topic, its significance, and the particular benefits of the workshop to the community, as well as a list of previous or related workshops (if relevant). 2) An organisational part including: - contact information for the workshop organizers; - proposed affiliated conference; - estimate of the number of workshop participants (please note that small workshops, i.e., of less than ~13 participants, will likely be cancelled or merged); - proposed format and agenda (e.g. paper presentations, tutorials, demo sessions, etc.); - potential invited speakers (note that expenses of workshop invited speakers are not covered by FLoC); - procedures for selecting papers and participants; - plans for dissemination, if any (e.g. a journal special issue); - duration (which may vary from one day to two days); - preferred period (pre or post FLoC); - virtual/hybrid backup plans (including platform preference). The FLoC Organizing Committee will determine the final list of accepted workshops based on the recommendations from the Workshop Chairs of the hosting conferences and availability of space and facilities. Proposals should be submitted through EasyChair: https://easychair.org/conferences/?conf=floc2022workshops Please see the Workshop Guidelines page: https://floc2022.org/workshops/ for further details and FAQ. IMPORTANT DATES Submission of workshop proposals deadline: September 27, 2021 (note extended deadline) Notification: November 1, 2021 Pre-FLoC workshops: Sunday & Monday, July 31?August 1, 2022 (note corrected dates) Post-FLoC workshops: Thursday & Friday, August 11-12, 2022 CONTACT INFORMATION Questions regarding proposals should be sent to the workshop chairs of the proposed affiliated conference. General questions should be sent to: shaull at technion.ac.il GuillermoAlberto.Perez at uantwerpen.be FLoC 2022 WORKSHOP CHAIRS Shaull Almagor Guillermo A. Perez From gtan at cse.psu.edu Thu Jul 1 22:50:03 2021 From: gtan at cse.psu.edu (Gang (Gary) Tan) Date: Thu, 1 Jul 2021 22:50:03 -0400 Subject: [TYPES/announce] Postdoc position in software security at Penn State CSE Message-ID: Postdoc position at Penn State Computer Science and Engineering Applications are invited for a full-time postdoctoral researcher position in the Security of Software (SOS) Lab at Penn State (http://www.cse.psu.edu/~gxt29/sos/). The SOS Lab focuses on methodologies that help create secure software systems. We are seeking a highly qualified individual to work in the area of software security, including topics such as software security verification, compiler-based software security, binary code analysis and hardening. An applicant should possess a doctoral degree in Computer Science or Computer Engineering and have strong background in computer security, programming languages, or formal methods. The candidate must have an excellent track record of original research and the ability to work as part of a team. The postdoc will be provided with competitive salary and employment benefits. The initial appointment will be for one year, with an option to renew for a second year. Inquiries about the position should be directed to Dr. Gang Tan (gtan at psu.edu). Applicants should apply via the following website and be prepared to provide at least two names of references when asked. Applications will be reviewed until the position is filled. https://psu.wd1.myworkdayjobs.com/en-US/PSU_Academic/job/University-Park-Campus/Postdoctoral-Researcher_REQ_0000014314-1 Penn State is a major research university ranked 3rd in U.S. in industry-sponsored research. The CSE department is ranked 6th in computer-security research (as per csrankings.org) and 8th in U.S. in research expenditures and has strong research programs in security. The U.S. News and World Report consistently ranks Penn State's College of Engineering undergraduate and graduate programs among the top in the nation. -- Gang (Gary) Tan Professor, Penn State CSE and ICDS W358 Westgate Building http://www.cse.psu.edu/~gxt29 Tel:814-8657364 -------------- next part -------------- An HTML attachment was scrubbed... URL: From eeide at cs.utah.edu Fri Jul 2 16:16:25 2021 From: eeide at cs.utah.edu (Eric Eide) Date: Fri, 02 Jul 2021 14:16:25 -0600 Subject: [TYPES/announce] CFP: PLOS '21: 11th Workshop on Programming Languages and Operating Systems Message-ID: If you apply type-based or other advanced language ideas in the implementation of operating systems, we hope you will consider submitting a paper to PLOS '21. See the CFP below, or visit the Web site at https://plos-workshop.org/2021/ ------------------------------------------------------------------------------- CALL FOR PAPERS 11th Workshop on Programming Languages and Operating Systems (PLOS 2021) October 25, 2021 Online https://plos-workshop.org/2021/ Sponsored by ACM SIGOPS In conjunction with SOSP 2021 https://sosp2021.mpi-sws.org/index.html Paper submission deadline: August 6, 2021 Notification of acceptance: September 3, 2021 Final papers due: September 24, 2021 Workshop: October 25, 2021 Historically, operating system development and programming language development went hand-in-hand. Challenges in one area were often approached using ideas or techniques developed in the other, and advances in one area enabled new capabilities in the other. Today, although the systems community at large retains an iron grip on C, modern programming language ideas continue to spark innovations in OS design and construction. Conversely, the systems field continues to provide a wealth of challenging problems and practical results that should lead to advances in programming languages, software designs, and idioms. This workshop will bring together researchers and developers from the programming language and operating system domains to discuss recent work at the intersection of these fields. It will be a platform for discussing new visions, challenges, experiences, problems, and solutions arising from the application of advanced programming and software engineering concepts to operating systems construction, and vice versa. Suggested paper topics include, but are not restricted to: * critical evaluations of new programming language ideas in support of OS construction * domain-specific languages for operating systems * type-safe languages for operating systems * the design of language-specific unikernels * language-based approaches to crosscutting system concerns, such as security and run-time performance * language support for system verification, testing, and debugging * synthesis of OS code * static/dynamic configuration of operating systems * static/dynamic specialization within operating systems * the use of OS abstractions and techniques in language runtimes * experience reports on applying new language techniques in commercial OS settings AGENDA The workshop will be a highly interactive event with an agenda designed to promote focused and lively discussions. Part of the workshop program will be based on paper presentations. PLOS welcomes research, experience, and position papers; papers describing industrial experience are particularly encouraged. The set of accepted papers will be made available to registered attendees in advance of the workshop. Participants should come to the workshop prepared with questions and comments. SUBMISSION GUIDELINES All papers must be written in English and should be formatted in the two-column ACM article style (, using the options sigplan,10pt). The CCS Concepts, Keywords, and ACM Reference Format sections are not required in submissions. Submissions are single blind: author names and affiliations should be included. Submissions must not be more than six (6) pages in length, using 10-point font. The bibliography does not count towards the page limit. The page limit will be strictly enforced, and shorter papers are encouraged. Papers must be submitted in PDF format via the workshop website. They will be reviewed by the workshop program committee and designated external reviewers. Papers will be evaluated based on technical quality, originality, relevance, and presentation. By default, accepted papers will be published electronically in the ACM Digital Library. The authors of accepted papers to be included in the ACM Digital Library will be required to sign ACM copyright release forms. The publication of a paper in the PLOS workshop proceedings is not intended to replace future conference publication. PROGRAM COMMITTEE Anton Burtsev, University of California, Irvine Pierre-Evariste Dagand, Universite de Paris (chair) Michael Homer, Victoria University of Wellington Faria Kalim, Apple Inc Jeehoon Kang, KAIST Antoine Kaufmann, MPI for Software Systems Hui Lu, SUNY Binghamton Gustavo Petri, Arm Research Clement Pit-Claudel, Massachusetts Institute of Technology Linhai Song, Pennsylvania State University Alain Tchana, Ecole Normale Superieure de Lyon Chia-Che Tsai, Texas A&M University Carsten Weinhold, Barkhausen Institute ORGANIZING COMMITTEE Antonio Barbalace, The University of Edinburgh Eric Eide, University of Utah Pierre Olivier, The University of Manchester Olaf Spinczyk, Osnabrueck University From nqd.lisa at gmail.com Fri Jul 2 17:22:05 2021 From: nqd.lisa at gmail.com (Lisa Nguyen Quang Do) Date: Fri, 2 Jul 2021 23:22:05 +0200 Subject: [TYPES/announce] Call for participation: 30th ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA'21) and the 35th European Conference on Object-Oriented Programming (ECOOP'21) Message-ID: ============================================================ The 30th Edition of ISSTA and the 35th Edition of ECOOP Call for Participation 11th-17th July 2021 Online https://conf.researchr.org/home/ecoop-issta-2021 Co-located with REBASE 2021 and SPIN 2021 ============================================================ The ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA) is the leading research symposium on software testing and analysis, bringing together academics, industrial researchers, and practitioners to exchange new ideas, problems, and experience on how to analyze and test software systems. ECOOP is Europe?s longest-standing annual Programming Languages conference, bringing together researchers, practitioners, and students to share their ideas and experiences in all topics related to programming languages, software development, object-oriented technologies, systems and applications. ECOOP welcomes high quality research papers relating to these fields in a broad sense. Registration ================ Registration to ECOOP 2021 and ISSTA 2021 is still open - and free of charge! If you haven't registered yet, there are still a few days left to do so. The registration is free for all attendees. You need to register in order to access the Zoom rooms and videos. Registration link: [1]. Programs ================ The ISSTA 2021 program [2] and the ECOOP 2021 program [3] are up online. ISSTA is celebrating its 30th edition and ECOOP, its 35th. To mark the occasion, we have invited 18 experts to chair nine ?Discussion with Experts? sessions, each 40-minutes long. In addition, ISSTA will hold two panels on the past and future of software testing and analysis at ISSTA, featuring senior members of the community. Tune in for a busy week with 51 ISSTA papers, 24 ECOOP papers, a joint poster session, summer school, tool demos, and seven workshops. Presentations will be given twice across three timebands to accommodate the international audience. This model ensures that anyone across the world can watch each talk at a reasonable time. During the week, ECOOP will present multiple awards: - The AITO Dahl-Nygaard Senior prize to Kim Bruce - The AITO Dahl-Nygaard Junior prize to Karim Ali - The AITO Test of Time award 2021 to Gregor Kiczales, Erik Hilsdale, Jim Hugunin, Mik Kersten, Jeffrey Palm, William G. Griswold, for their work published at ECOOP'01: "An Overview of AspectJ" - Two distinguished paper awards to: - ?Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis? by Philipp Schubert, Ben Hermann, and Eric Bodden. - ?Multiparty Languages: the Choreographic and Multitier Cases? by Saverio Giallorenzo, Fabrizio Montesi, Marco Peressotti, David Richter, Guido Salvaneschi and, Pascal Weisenburger. ISSTA will also present: - The ISSTA Impact Paper award to "Automated Debugging: Past, Present, and Future" from Alessandro Orso and Chris Parnin. - Four distinguished paper awards: - ?Type and Interval aware Array Constraint Solving for Symbolic Execution?, by Ziqi Shuai, Zhenbang Chen, Yufeng Zhang, Jun Sun, and Ji Wang. - ?A Lightweight Framework for Function Name Reassignment Based on Large-Scale Stripped Binaries?, by Han Gao, Shaoyin Cheng, Yinxing Xue, and Weiming Zhang. - ?SAND: A Static Analysis Approach for Detecting SQL Antipatterns?, by Yingjun Lyu, Sasha Volokh, William G.J. Halfond, and Omer Tripp. - ?Test-Case Prioritization for Configuration Testing?, by Runxiang Cheng, Lingming Zhang, Darko Marinov, and Tianyin Xu. This year, ISSTA and ECOOP are co-located with REBASE and SPIN, giving all communities the chance to interact and exchange ideas at the intersection of testing, analysis, and programming languages. Looking forward to meeting you online! More Information ================ For additional information, please visit the ISSTA?21 and ECOOP?21 website [4]. [1] https://conf.researchr.org/attending/ecoop-issta-2021/registration [2] https://conf.researchr.org/track/issta-2021/issta-2021-technical-papers#program [3] https://2021.ecoop.org/track/ecoop-2021-ecoop-research-papers#program [4] https://conf.researchr.org/home/ecoop-issta-2021 -------------- next part -------------- An HTML attachment was scrubbed... URL: From c.cadar at imperial.ac.uk Sun Jul 4 04:36:53 2021 From: c.cadar at imperial.ac.uk (Cristian Cadar) Date: Sun, 4 Jul 2021 09:36:53 +0100 Subject: [TYPES/announce] Postdoctoral position at Imperial College London Message-ID: We are looking for motivated applicants with expertise in program analysis and/or software systems for a postdoctoral position in the Software Reliability Group (https://srg.doc.ic.ac.uk/) at Imperial College London, under the direction of Prof. Cristian Cadar. The research will be part of the ERC Consolidator Grant Project PASS: Program Analysis for Safe and Secure Software Evolution, and will focus on helping software systems evolve safely and securely. PASS aims to take a holistic approach to the challenges of safe and secure software evolution, by combining offline program analysis to verify or comprehensively test software changes, with runtime mechanisms for keeping the software updated and secure against potentially erroneous changes that make it into the deployed system. More details about this position can be found at https://srg.doc.ic.ac.uk/vacancies/postdoc-pass-22/ From bruno.bernardo at tutanota.com Mon Jul 5 17:01:42 2021 From: bruno.bernardo at tutanota.com (Bruno Bernardo) Date: Mon, 5 Jul 2021 23:01:42 +0200 (CEST) Subject: [TYPES/announce] FMBC 2021 - Call for Participation Message-ID: [ Please distribute, apologies for multiple postings. ] ======================================================================== 3rd International Workshop on Formal Methods for Blockchains (FMBC) 2021 - Call for Participation https://fmbc.gitlab.io/2021 July 18 and 19, 2021, Online, 8AM-10AM PDT Co-located with the 33rd International Conference on Computer-Aided Verification (CAV 2021) http://i-cav.org/2021/ --------------------------------------------------------- The FMBC workshop is a forum to identify theoretical and practical approaches of formal methods for Blockchain technology. Topics include, but are not limited to: * Formal models of Blockchain applications or concepts * Formal methods for consensus protocols * Formal methods for Blockchain-specific cryptographic primitives or protocols * Design and implementation of Smart Contract languages * Verification of Smart Contracts The list of lightning talks and conditionally accepted papers is available on the FMBC 2021 website: https://fmbc.gitlab.io/2021/program.html There will be one keynote by David Dill, Lead Researcher on Blockchain at Novi/Facebook and professor emeritus at Stanford University, USA. Registration Registration to FMBC 2021 is done through the CAV 2021 registration form: http://i-cav.org/2021/attending/ (*Early bird deadline is July 9.*) From carsten at dcs.bbk.ac.uk Tue Jul 6 06:26:15 2021 From: carsten at dcs.bbk.ac.uk (Carsten Fuhs) Date: Tue, 6 Jul 2021 11:26:15 +0100 Subject: [TYPES/announce] FSCD 2021: Final Call for (Online) Participation (closing on Sun, July 11) Message-ID: CALL FOR PARTICIPATION Sixth International Conference on Formal Structures for Computation and Deduction (FSCD 2021) July 17 ? July 24, 2021, Buenos Aires, Argentina https://fscd2021.dc.uba.ar/ In-cooperation with ACM SIGLOG and SIGPLAN The 2021 edition of FSCD and of its satellite workshops will be held online. Participation will, a priori, be free of charge, unless we receive way too many requests, in which case we will invite those who can to pay the modest amount of 7 USD. FSCD 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 (e.g., quantum computing, probabilistic computing, homotopy type theory), semantics and verification in new challenging areas (e.g., blockchain protocols or deep learning algorithms). REGISTRATION --------------- The registration page is already open and linked from: https://fscd2021.dc.uba.ar/registration.html This link should be used also to register for affiliated workshops. Registration is open until July 11. FSCD 2021 will run over the Clowdr platform. After the registration is closed, you will receive an invitation link and instructions on how to participate. INVITED SPEAKERS ---------------- - Zena M. Ariola https://ix.cs.uoregon.edu/~ariola/ - Nao Hirokawa https://www.jaist.ac.jp/~hirokawa/ - Elaine Pimentel https://sites.google.com/site/elainepimentel/ - Sam Staton https://www.cs.ox.ac.uk/people/samuel.staton/main.html FSCD AFFILIATED WORKSHOPS: -------------------------- - HoTT/UF (6th Workshop on Homotopy Type Theory/Univalent Foundations, July 17-18) - ITRS (10th Workshop on Intersection Types and Related Systems, July 17) - WPTE (7th International Workshop on Rewriting Techniques for Program Transformations and Evaluation, July 18) - UNIF (35th International Workshop on Unification, July 18) - LSFA (16th Logical and Semantics Frameworks with Applications, July 23-24) - IWC (10th International Workshop on Confluence, July 23) - IFIP WG 1.6 (24th meeting of the IFIP Working Group 1.6: Rewriting, July 24) PROGRAM COMMITTEE CHAIR ----------------------- Naoki Kobayashi, The University of Tokyo fscd2021 at easychair.org PROGRAM COMMITTEE ----------------- Mauricio Ayala-Rinc?n, Universidade de Bras?lia Stefano Berardi, University of Torino Fr?d?ric Blanqui, INRIA Eduardo Bonelli, Stevens Institute of Technology ?velyne Contejean, CNRS, Universit? Paris-Saclay Thierry Coquand, University of Gothenburg Thomas Ehrhard, Universit? de Paris, CNRS Santiago Escobar, Univ. Polit?cnica de Val?ncia Jos? Esp?rito Santo, University of Minho Claudia Faggian, Universit? de Paris, CNRS Amy Felty, University of Ottawa Santiago Figueira, Universidad de Buenos Aires Marcelo Fiore, University of Cambridge Marco Gaboardi, Boston University Silvia Ghilezan, University of Novi Sad Ichiro Hasuo, National Institute of Informatics Delia Kesner, Universit? de Paris Robbert Krebbers, Radboud University Nijmegen Temur Kutsia, Johannes Kepler University Linz Barbara K?nig, University of Duisburg-Essen Marina Lenisa, University of Udine Naoki Nishida, Nagoya University Luke Ong, University of Oxford Pawe? Parys, University of Warsaw Jakob Rehof, TU Dortmund University Camilo Rocha, Pontificia Univ. Javeriana Cali Alexandra Silva, University College London Alwen Tiu, Australian National University Sarah Winkler, University of Verona Hongseok Yang, KAIST, South Korea CONFERENCE CHAIR ---------------- Alejandro D?az-Caro, Quilmes Univ. & ICC/CONICET ORGANIZING COMMITTEE -------------------- Mauricio Ayala-Rinc?n (Workshops co-chair), Universidade de Bras?lia Santiago Figueira, Universidad de Buenos Aires & ICC Malena Ivnisky (Virtualization co-chair), Universidad de Buenos Aires & ICC Mauro Jaskelioff, Universidad Nacional de Rosario & CIFASIS Carlos L?pez Pombo (Workshops co-chair), Universidad de Buenos Aires & ICC Ricardo Rodr?guez (Virtualization co-chair), Universidad de Buenos Aires & ICC Rafael Romero (Virtualization co-chair), Universidad de Buenos Aires & ICC Nora Szasz, Universidad ORT Uruguay Beta Ziliani, Universidad Nacional de C?rdoba FSCD STEERING COMMITTEE ----------------------- Zena M. Ariola, University of Oregon Mauricio Ayala-Rinc?n, University of Brasilia Carsten Fuhs (Publicity Chair), Birkbeck, University of London Herman Geuvers, Radboud University Silvia Ghilezan, University of Novi Sad Stefano Guerrini, University of Paris 13 Delia Kesner (SC Chair), University of Paris Diderot H?l?ne Kirchner, Inria Cynthia Kop, Radboud University Damiano Mazza, University of Paris 13 Luke Ong, Oxford University Jakob Rehof, TU Dortmund Jamie Vicary (SC Workshop Chair), Oxford University From msantolu at barnard.edu Wed Jul 7 14:49:57 2021 From: msantolu at barnard.edu (Mark Santolucito) Date: Wed, 7 Jul 2021 14:49:57 -0400 Subject: [TYPES/announce] FMCAD Student Forum CFP (Deadline Sat July 10) Message-ID: # Student Forum Continuing the tradition of the previous years, FMCAD 2021 is hosting a Student Forum that provides a platform for students at any career stage (undergraduate or graduate) to introduce their research to the wider Formal Methods community, and solicit feedback. The Student Forum will be held in a hybrid format, online via video conferencing. ## Submissions Submissions must be short reports describing research ideas or ongoing work that the student is currently pursuing. Joint submissions from two students are allowed, provided the students contributed equally to the work - however, joint submissions must be presented by a single student. The topic of the reports must be within the scope of the FMCAD conference. These reports will NOT be published, thus we welcome reports based on already submitted/published papers. However, the novel aspects to be addressed in future work must be clearly described. Submissions should follow the same formatting guidelines as those for regular FMCAD conference submissions, except that the length is limited to 2 pages IEEE format, including all figures and references. ## Important Dates - Student forum submission: July 10, 2021 - Student forum notification: Aug 6, 2021 These deadlines are 11:59 pm AoE (Anywhere on Earth) More info here: https://fmcad.org/FMCAD21/student_forum/ ## Main Activities ### Student Forum Talks. Each student will give a lightning talk. In the case that a student is attending FMCAD physically, the talk will be given in-person at the conference. In the case that a student is attending FMCAD remotely, the talk will be given over Zoom. ### Discussion Groups. Students will have the opportunity to explain and discuss their work in small groups. More details to come on the logistics of discussion for remote participants. Submissions for the event must be short reports describing research ideas or ongoing work that the student is currently pursuing, and must be within the scope of FMCAD. Work, part of which has been previously published, will be considered; the novel aspect to be addressed in future work must be clearly described in such cases. All submissions will be reviewed by a subgroup of FMCAD committee members. ## Format The event will consist of short presentations by the student authors of each accepted submission, and of a virtual poster session. All participants of the conference are encouraged to attend the talks, ask questions and discuss with their fellow students in the virtual post sessions. Instructions for the preparation of the talks and poster sessions will be announced on notification of acceptance. ## Visibility Accepted submissions will be listed, with title and author name, in the event description in the conference proceedings. The authors will also have the option to upload their slide deck/poster/presentation to the FMCAD website. The report itself will not appear in the FMCAD proceedings; thus, the presentation at FMCAD should not interfere with potential future submissions of this research (to FMCAD or elsewhere). The best contributions (determined by public vote by attendees) will be given public recognition and a certificate at the event. ***Forum Chair*** Mark Santolucito (msantolu at barnard.edu) chairs the Student Forum. Feel free to send an email if you have questions about the event. -------------- next part -------------- An HTML attachment was scrubbed... URL: From mera at process-design-center.com Thu Jul 8 04:38:14 2021 From: mera at process-design-center.com (Edison Mera) Date: Thu, 8 Jul 2021 10:38:14 +0200 (CEST) Subject: [TYPES/announce] Vacancy for a PhD in Computer Science and Functional Programming Message-ID: <20210708083814.5DA4640DA2@process-design-center.com> Vacancy -- Ph.D. in Computer Science & Functional Programming ------------------------------------------------------------- **Process Design Center (PDC) **PDC is seeking a Ph.D. in Computer Science & Functional Programming with good analytical skills, interested in solving problems requiring non-trivial algorithms. PDC is at the forefront of creating a new industry. PDC is a diverse and international team of highly educated and creative individuals (75% doctorates) using Human + Artificial Intelligence to arrive at better solutions. We believe innovation is a joint effort. Thus, our colleagues, partners & clients are at the center of our success. Among our clients are the major players in the industry as well as startups, investors and governments. Be aware that our website www.process-design-center.com is heavily outdated and is currently redesigned, rewritten, and generally revitalized, and we hope to finish the new website in Q3 of this year. **Responsibilities** - You will be in charge of the development of the new Decentralized Applications (DApps) / SmartContracts for the future products of the Company - Use the Cardano protocol (test, develop and deploy DApps on this platform) - Actively participate in multi-disciplinary research projects Requirements - A finished PhD in Computer Science, no more than 5 years after graduation - Functional programming expertise, in particular coding in Haskell/Plutus - Experience in formal software verification methods and techniques - Experience in other programming languages is an advantage - Familiar with automated testing, continuous integration and development - Experience with open source development tools - Knowledge in cybersecurity and cryptography concepts such as encryption, digital signatures, asymmetric keys, etc. - EU passport - Creative, laser-focus - Self-propelling and proactive - Ability to work well in a team but also independently - Good communication skills and a strong command of the English language - Willing to move to Breda - Netherlands **The Challenge & Personal development ** Our philosophy: - Learning-on-the-job is the most effective approach that we adopted to coach our people. - Blending young and experienced people to arrive at innovative results. - we present opportunities for our people to take direct responsibility. This way, we empower them, accelerate their growth and give them the freedom and the space to create and innovate. - We invest in your future by allocating resources to build on our joint ambitions. Contact Interested? Please apply by sending your CV and application letter in English by e-mail to our CEO Hans Keuken: keuken at process-design-center.com PDC provides gender-equal job opportunities and all qualified applicants will receive consideration for employment with regard to any characteristic protected by law. From yallop at gmail.com Thu Jul 8 10:23:45 2021 From: yallop at gmail.com (Jeremy Yallop) Date: Thu, 8 Jul 2021 14:23:45 +0000 Subject: [TYPES/announce] Postdoctoral Position at the University of Cambridge Message-ID: [Posting on behalf of Neel Krishnaswami] Hello, We have an opening in Cambridge for a postdoctoral position with the ERC Consolidator Grant project TypeFoundry. The TypeFoundry project aims to use recent developments in proof theory and semantics, such as polarized type theory and call-by-push-value, to identify the theoretical structures underpinning bidirectional type inference. Informal enquiries are welcome and should be directed to Dr Neel Krishnaswami (nk480 at cl.cam.ac.uk). More details and an application form can be found at < https://www.jobs.cam.ac.uk/job/30485/>. ------------------------------------------------- Research Associate: ?32,816 -?40,322 Fixed-term: The funds for this post are available for 2 years in the first instance with the possibility of extension. We invite applications for a Postdoctoral Research Associate to join the TypeFoundry project. The TypeFoundry project aims to use recent developments in proof theory and semantics, such as polarized type theory and call-by-push-value, to identify the theoretical structure underpinning bidirectional type inference. The overall aim is to develop a theory of type inference capable of scaling up to the support both the wide variety of advanced type system features language designers are interested in (ranging from languages based on substructural types like Rust to dependent type theories like Agda or Idris), and with a framework for proof which scales beyond kernel calculi all the way up to full-scale languages. The project will focus on developing and proving the correctness of new bidirectional type inference algorithms; identifying the common categorical/algebraic structure which makes these algorithms work; and using that structure to develop tooling which can automate the generation of type inference algorithms, as well as support mechanised proofs of their correctness. The position will involve working with TypeFoundry project members (including both PhD students and faculty). It will run initially for 24 months, with the possibility for a further 12 month extension,on any aspect of this project. The successful candidate is likely to have (or expect to be awarded soon) a PhD in computer science or related discipline, as well as a track record of research expertise in a subset of the following topics: Type inference and type theory Structural proof theory Categorical semantics of programming languages Functional programming language implementation Use of dependent type theories and proof assistants (eg, Coq or Agda) Informal enquiries are welcome and should be directed to Dr Neel Krishnaswami (nk480 at cl.cam.ac.uk). The University of Cambridge is committed in its pursuit of academic excellence to a proactive and inclusive approach to equality, which supports and encourages all under-represented groups, promotes an inclusive culture, and values diversity. -------------- next part -------------- An HTML attachment was scrubbed... URL: From nick.hu at cs.ox.ac.uk Thu Jul 8 12:34:06 2021 From: nick.hu at cs.ox.ac.uk (Nick Hu) Date: Thu, 8 Jul 2021 17:34:06 +0100 Subject: [TYPES/announce] CALL FOR PARTICIPATION -- APPLIED CATEGORY THEORY 2021, CAMBRIDGE UK, JULY 12-16 -- HYBRID CONFERENCE Message-ID: <20210708163406.hiognesz4b5nbuwu@alpha> CALL FOR PARTICIPATION Fourth Annual International Conference on Applied Category Theory (ACT 2021) 12 - 16 July, 2021, Cambridge, United Kingdom (and online), 09:00-17:30 BST Webpage: https://www.cl.cam.ac.uk/events/act2021 Registration for online participation: https://forms.gle/KENNAbk6iLwqJ7i36 * * * The Fourth International Conference on Applied Category Theory will take place at the Computer Laboratory of the University of Cambridge on 12-16 July, 2021, preceded by the Adjoint School 2021 on 5-9 July. This conference follows previous events at MIT, Oxford and Leiden. Applied category theory is a topic of interest for a growing community of researchers, interested in studying many different kinds of systems using category-theoretic tools. These systems are found across computer science, mathematics, and physics, as well as in social science, linguistics, cognition, and neuroscience. The background and experience of our members is as varied as the systems being studied. The goal of the Applied Category Theory conference series is to bring researchers together, disseminate the latest results, and facilitate further development of the field. For a full schedule of talks, please see https://www.cl.cam.ac.uk/events/act2021/#programme. The conference will be run as a hybrid event, with physical attendees present in Cambridge, and other participants taking part online. Physical registration is now closed, but online registration is still available: https://www.cl.cam.ac.uk/events/act2021/#registration. ** PROGRAMME COMMITTEE ** Chair: - Kohei Kishida, University of Illinois, Urbana-Champaign Members: - Richard Blute, University of Ottawa - Spencer Breiner, NIST - Daniel Cicala, University of New Haven - Robin Cockett, University of Calgary - Bob Coecke, Cambridge Quantum Computing - Geoffrey Cruttwell, Mount Allison University - Valeria de Paiva, Samsung Research America and University of Birmingham - Brendan Fong, Massachusetts Institute of Technology - Jonas Frey, Carnegie Mellon University - Tobias Fritz, Perimeter Institute for Theoretical Physics - Fabrizio Romano Genovese, Statebox - Helle Hvid Hansen, University of Groningen - Jules Hedges, University of Strathclyde - Chris Heunen, University of Edinburgh - Alex Hoffnung, Bridgewater - Martti Karvonen, University of Ottawa - Kohei Kishida, University of Illinois, Urbana-Champaign (chair) - Martha Lewis, University of Bristol - Bert Lindenhovius, Johannes Kepler University Linz - Ben MacAdam, University of Calgary - Dan Marsden, University of Oxford - Jade Master, University of California, Riverside - Joe Moeller, NIST - Koko Muroya, Kyoto University - Simona Paoli, University of Leicester - Daniela Petrisan, Universit=C3=A9 de Paris, IRIF - Mehrnoosh Sadrzadeh, University College London - Peter Selinger, Dalhousie University - Michael Shulman, University of San Diego - David Spivak, MIT and Topos Institute - Joshua Tan, University of Oxford - Dmitry Vagner - Jamie Vicary, University of Cambridge - John van de Wetering, Radboud University Nijmegen - Vladimir Zamdzhiev, Inria, LORIA, Universit? de Lorraine - Maaike Zwart From ifl21.publicity at gmail.com Fri Jul 9 01:55:39 2021 From: ifl21.publicity at gmail.com (Pieter Koopman) Date: Fri, 9 Jul 2021 05:55:39 +0000 Subject: [TYPES/announce] IFL'21 Third call for papers Message-ID: ================================================================================ IFL 2021 33rd Symposium on Implementation and Application of Functional Languages venue: online 1 - 3 September 2021 https://ifl21.cs.ru.nl ================================================================================ News - Paper submission details. - Registration information added Scope The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2021 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. Industrial track and topics of interest This year's edition of IFL explicitly solicits original work concerning *applications* of functional programming in industry and academia. These contributions will be reviewed by experts with an industrial background. Topics of interest to IFL include, but are not limited to: * language concepts * type systems, type checking, type inferencing * compilation techniques * staged compilation * run-time function specialisation * run-time code generation * partial evaluation * (abstract) interpretation * meta-programming * generic programming * automatic program generation * array processing * concurrent/parallel programming * concurrent/parallel program execution * embedded systems * web applications * (embedded) domain-specific languages * security * novel memory management techniques * run-time profiling performance measurements * debugging and tracing * testing and proofing * virtual/abstract machine architectures * validation, verification of functional programs * tools and programming techniques * applications of functional programming in the industry, including ** functional programming techniques for large applications ** successes of the application functional programming ** challenges for functional programming encountered ** any topic related to the application of functional programming that is interesting for the IFL community Post-symposium peer-review Following IFL tradition, IFL 2021 will use a post-symposium review process to produce the formal proceedings. Before the symposium authors submit draft papers. These draft papers will be screened by the program chairs to make sure that they are within the scope of IFL. The draft papers will be made available to all participants at the symposium. Each draft paper is presented by one of the authors at the symposium. After the symposium every presenter is invited to submit a full paper, incorporating feedback from discussions at the symposium. Work submitted to IFL may not be simultaneously submitted to other venues; submissions must adhere to ACM SIGPLAN's republication policy. The program committee will evaluate these submissions according to their correctness, novelty, originality, relevance, significance, and clarity, and will thereby determine whether the paper is accepted or rejected for the formal proceedings. We plan to publish these proceedings in the International Conference Proceedings Series of the ACM Digital Library, as in previous years. Moreover, the proceedings will also be made publicly available as open access. Important dates Submission deadline of draft papers: 17 August 2021 Notification of acceptance for presentation: 19 August 2021 Registration deadline: 30 August 2021 IFL Symposium: 1-3 September 2021 Submission of papers for proceedings: 6 December 2021 Notification of acceptance: 3 February 2022 Camera-ready version: 15 March 2022 Submission details All contributions must be written in English. Papers must use the ACM two columns conference format, which can be found at: http://www.acm.org/publications/proceedings-template . (For LaTeX users, start your document with \documentclass[format=sigconf]{acmart}.) Note that this format has a rather long but limited list of packages that can be used. Please make sure that your document adheres to this list. The submission Web page for IFL21 is https://easychair.org/conferences/?conf=ifl21 . Peter Landin Prize The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honoured article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. Organisation IFL 2021 Chairs: Pieter Koopman and Peter Achten, Radboud University, The Netherlands IFL Publicity chair: Pieter Koopman, Radboud University, The Netherlands PC: Peter Achten (co-chair) - Radboud University, Netherlands Thomas van Binsbergen - University of Amsterdam, Netherlands Edwin Brady - University of St. Andrews, Scotland Laura Castro - University of A Coru?a, Spain Youyou Cong - Tokyo Institute of Technology, Japan Olaf Chitil - University of Kent, England Andy Gill - University of Kansas, USA Clemens Grelck - University of Amsterdam, Netherlands John Hughes - Chalmers University, Sweden Pieter Koopman (co-chair) - Radboud University, Netherlands Cynthia Kop - Radboud University, Netherlands Jay McCarthey - University of Massachussetts Lowell, USA Neil Mitchell - Facebook, England Jan De Muijnck-Hughes - Glasgow University, Scotland Keiko Nakata - SAP Innovation Center Potsdam, Germany Jurri?n Stutterheim - Standard Chartered, Singapore Simon Thompson - University of Kent, England Melinda T?th - E?tvos Lor?nd University, Hungary Phil Trinder - Glasgow University, Scotland Meng Wang - University of Bristol, England Vikt?ria Zs?k - E?tvos Lor?nd University, Hungary Virtual symposium Because of the Covid-19 pandemic, this year IFL 2021 will be an online event, consisting of paper presentations, discussions and virtual social gatherings. Registered participants can take part from anywhere in the world. Registration Please use the below link to register for IFL 2021: https://docs.google.com/forms/d/e/1FAIpQLSdMFjo-GumKjk4i7szs7n4DhWqKt96t8ofIqshfQFrf4jnvsA/viewform?usp=sf_link Thanks to the sponsors and the support of the Radboud university registration is free of charge. [image: beacon] -------------- next part -------------- An HTML attachment was scrubbed... URL: From tarmo at cs.ioc.ee Fri Jul 9 11:04:52 2021 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Fri, 9 Jul 2021 18:04:52 +0300 Subject: [TYPES/announce] ETAPS 2022 1st joint call for papers Message-ID: <20210709180452.31bf4a7c@cs.ioc.ee> Why choose ETAPS? - ETAPS is one of the world's leading fora for research on software science, with a history of more than 25 years. - ESOP, FoSSaCS, TACAS are CORE 2021 rank A conferences. - The proceedings of ETAPS appear in gold open access, with no article processing charge for the authors specifically. - ETAPS has low participation fees for all and for students in particular. New in 2022: - Like FASE for several years already, ESOP will also use double-blind review this time. - FASE has a new paper category of new ideas and emerging results (NIER) papers. - The pre-paper-acceptance artifact submission deadline for TACAS is now a little later than the paper submission deadline. - ESOP and FASE welcome voluntary submission of artifacts for evaluation after paper acceptance; the outcome will not change the paper acceptance decision. - Among the satellite events, there is a PhD student mentoring workshop. ****************************************************************** JOINT CALL FOR PAPERS 25th European Joint Conferences on Theory and Practice of Software ETAPS 2022 Munich, Germany, 2-7 April 2022 https://etaps.org/2022 ****************************************************************** -- ABOUT ETAPS -- ETAPS is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of four annual conferences, accompanied by satellite workshops. ETAPS 2022 is the twenty-fifth event in the series. -- MAIN CONFERENCES (4-7 April) -- * ESOP: European Symposium on Programming (PC chair: Ilya Sergey, Yale-NUS College and National University of Singapore, Singapore) * FASE: Fundamental Approaches to Software Engineering (PC chairs:Einar Broch Johnsen, University of Oslo, Norway, and Manuel Wimmer, Johannes Kepler Universit?t Linz, Austria) * FoSSaCS: Foundations of Software Science and Computation Structures (PC chairs: Patricia Bouyer, CNRS, LMF, France, and Lutz Schr?der, FAU Erlangen-N?rnberg, Germany) * TACAS: Tools and Algorithms for the Construction and Analysis of Systems (PC chairs: Dana Fisman, Ben-Gurion University of the Negev, Israel, and Grigore Rosu, University of Illinois at Urbana-Champaign, USA) TACAS '22 will host the 11th Competition on Software Verification (SV-COMP). -- INVITED SPEAKERS -- * Unifying speakers: Alexandra Silva (University College London, UK / Cornell University, USA) Tom?? Vojnar (Brno University of Technology, Czechia) * FoSSaCS invited speaker: Nathalie Bertrand (Inria Rennes, France) * TACAS invited speaker: TBA * Tutorial speakers: TBA -- IMPORTANT DATES * Paper submission: 14 October 2021 23:59 AoE * Pre-paper-acceptance artifact submission (TACAS): 4 November 2021 23:59 AoE * Rebuttal (ESOP, FoSSaCS and, partially, TACAS): 7 December 00:01 AoE - 9 December 2021 23:59 AoE * Paper notification: 23 December 2021 * Post-paper-acceptance artifact submission (ESOP, FASE, TACAS): 5 January 2022 23:59 AoE * Paper final versions: 26 January 2022 * Artifact notification: 16 February 2022 -- SUBMISSION INSTRUCTIONS -- The four main conferences of ETAPS 2022 solicit contributions of the following types. All page limits are given **excluding the bibliography**. * ESOP: regular research papers of max 25 pp * FASE: regular research papers and empirical evaluation papers of max 18 pp, new ideas and emerging results (NIER) papers of max 8 pp, tool demonstration papers of max 6 pp (+ mandatory appendix of max 6 pp), * FoSSaCS: regular research papers of max 18 pp * TACAS: regular research papers, case study papers and regular tool papers of max 16 pp, tool demonstration papers of max 6 pp For definitions of the different paper types and specific instructions, where they are present, see the webpages of the individual conferences. All accepted papers will appear in the proceedings and have presentations during the conference. A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. We plan ETAPS 2022 as a hybrid conference; remote attendance and presentation will be possible. Submitted papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere. In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is also forbidden. Submissions must follow the formatting guidelines of Springer's LNCS (use the llncs.cls class) and be submitted electronically in pdf through the Easychair author interface of the respective conference. Submissions not adhering to the specified format and length may be rejected immediately. ESOP and FASE will use **double-blind reviewing**. Authors are asked to omit their names and institutions; refer to prior work in the third person, just as prior work by others; not to include acknowledgements that might identify them. ESOP and FoSSaCS will use an **author rebuttal phase**. TACAS will use rebuttal for selected submissions (those in the gray zone). Artifact submission and evaluation Regular tool paper and tool demonstration paper submissions to TACAS must be accompanied by an artifact submitted shortly after the paper. The artifact will be evaluated and the outcome will be taken into account in the acceptance decision of the paper. For research paper and case study paper submissions, pre-paper-acceptance submission of an artifact is optional; if an artifact is submitted at this point, it will be handled like described above. Alternatively, authors of papers of these categories may submit an artifact for evaluation after the paper has been accepted. The outcome of the artifact evaluation will then not change the paper acceptance decision. ESOP and FASE will also have artifact evaluation, but participation in it is voluntary; the artifact submission deadline is after the paper notification deadline. The outcome will not alter the paper acceptance decision. For specific instructions regarding artifacts, see the webpages of the individual conferences. -- PUBLICATION The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of Springer's LNCS series. The proceedings volumes will appear in gold open access, so the published versions of all papers will be available for everyone to download from the publisher's website freely, from the date of online publication, perpetually. The copyright of the papers will remain with the authors. -- BEST PAPER AWARDS The strongest papers of the four conferences will be nominated for the ETAPS best paper awards of EAPLS, EASST and EATCS. The ETAPS test of time award recognizes outstanding papers published at ETAPS more than 10 years in the past. -- SATELLITE EVENTS (2-3 April) -- A number of satellite workshops and other events will take place before the main conferences. In particular, there will be a PhD student mentoring workshop organized by Caterina Urban, Wolfgang Ahrendt and Gidon Ernst. -- CITY AND HOST INSTITUTION -- Munich, Germany, is the capital and most populous city of Bavaria. Nowadays, the city is a global center of art, science, technology, finance, publishing, culture, innovation, education, business, and tourism. It is home to Ludwig Maximilian's University (LMU) and Technische Universit?t M?nchen (TUM), many scientific institutions, and world-class technology and science museums such as Deutsches Museum and BMW Museum. Iconic places to visit in Munich include the Munich Residenz, Marienplatz, the Old Town Hall, the famous Glockenspiel on the New Town Hall, the Frauenkirche, the English Garden, the Olympic Park and Nymphenburg Palace. The conference will be hosted by Technische Universit?t M?nchen. -- ORGANIZERS -- General chair: Jan K?et?nsk? (Technische Universit?t M?nchen, Germany) Workshops chair: Dirk Beyer (Ludwig-Maximilians Universit?t M?nchen, Germany) From msantolu at barnard.edu Sat Jul 10 13:10:30 2021 From: msantolu at barnard.edu (Mark Santolucito) Date: Sat, 10 Jul 2021 13:10:30 -0400 Subject: [TYPES/announce] FMCAD Student Forum CFP (EXTENDED Deadline: July 17) Message-ID: # Student Forum Continuing the tradition of the previous years, FMCAD 2021 is hosting a Student Forum that provides a platform for students at any career stage (undergraduate or graduate) to introduce their research to the wider Formal Methods community, and solicit feedback. The Student Forum will be held in a hybrid format, online via video conferencing. ## Submissions Submissions must be short reports describing research ideas or ongoing work that the student is currently pursuing. Joint submissions from two students are allowed, provided the students contributed equally to the work - however, joint submissions must be presented by a single student. The topic of the reports must be within the scope of the FMCAD conference. These reports will NOT be published, thus we welcome reports based on already submitted/published papers. However, the novel aspects to be addressed in future work must be clearly described. Submissions should follow the same formatting guidelines as those for regular FMCAD conference submissions, except that the length is limited to 2 pages IEEE format, including all figures and references. ## Important Dates - Student forum submission: July 17, 2021 - Student forum notification: Aug 6, 2021 These deadlines are 11:59 pm AoE (Anywhere on Earth) More info here: https://fmcad.org/FMCAD21/student_forum/ ## Main Activities ### Student Forum Talks. Each student will give a lightning talk. In the case that a student is attending FMCAD physically, the talk will be given in-person at the conference. In the case that a student is attending FMCAD remotely, the talk will be given over Zoom. ### Discussion Groups. Students will have the opportunity to explain and discuss their work in small groups. More details to come on the logistics of discussion for remote participants. Submissions for the event must be short reports describing research ideas or ongoing work that the student is currently pursuing, and must be within the scope of FMCAD. Work, part of which has been previously published, will be considered; the novel aspect to be addressed in future work must be clearly described in such cases. All submissions will be reviewed by a subgroup of FMCAD committee members. ## Format The event will consist of short presentations by the student authors of each accepted submission, and of a virtual poster session. All participants of the conference are encouraged to attend the talks, ask questions and discuss with their fellow students in the virtual post sessions. Instructions for the preparation of the talks and poster sessions will be announced on notification of acceptance. ## Visibility Accepted submissions will be listed, with title and author name, in the event description in the conference proceedings. The authors will also have the option to upload their slide deck/poster/presentation to the FMCAD website. The report itself will not appear in the FMCAD proceedings; thus, the presentation at FMCAD should not interfere with potential future submissions of this research (to FMCAD or elsewhere). The best contributions (determined by public vote by attendees) will be given public recognition and a certificate at the event. ***Forum Chair*** Mark Santolucito (msantolu at barnard.edu) chairs the Student Forum. Feel free to send an email if you have questions about the event. -------------- next part -------------- An HTML attachment was scrubbed... URL: From ralf.kuesters at sec.uni-stuttgart.de Mon Jul 12 06:22:49 2021 From: ralf.kuesters at sec.uni-stuttgart.de (Ralf Kuesters) Date: Mon, 12 Jul 2021 12:22:49 +0200 Subject: [TYPES/announce] Postdoc Position in Formal Verification Message-ID: <4d699644-8c79-d788-5c57-783956a8ae5c@sec.uni-stuttgart.de> The Institute of Information Security at University of Stuttgart offers a fully-funded Postdoc position in formal verification The successful candidate is expected to work on tool-supported formal verification of security-critical systems and security protocols. The position is available immediately with an internationally competitive salary (German public salary scale TV-L E13, or TV-L E14, depending on the candidate's qualification, ranging from about 4.600 Euro to 6.200 Euro monthly gross salary). The appointment period follows the German Wissenschaftszeitvertragsgesetz (WissZeitVg), ranging from one year to up to six years. The Institute of Information Security offers a creative international environment for top-level international research in Germany's high-tech region. The successful candidate should have a Ph.D. (or should be very close to completion thereof) in Computer Science, Mathematics, Information Security, or a related field. We value strong analytical skills and - solid knowledge of logic, proofs and/or formal verification techniques (Theorem Proving, Type Checking, etc.), - solid programming experience. Knowledge in security is not required, but a plus. Knowledge of German is not required. The University of Stuttgart is an equal opportunity employer. Applications from women are strongly encouraged. Severely challenged persons will be given preference in case of equal qualifications. To apply, please send email with subject "Application: Postdoc Position Formal Verification" and a single PDF file containing the following documents to ralf.kuesters at sec.uni-stuttgart.de: * Cover letter (explaining your scientific background and your motivation to apply) * Curriculum Vitae * List of publications * Copies of transcripts and certificates (Bachelor, Master, PhD) * Names of at least two references The deadline for applications is August 1st, 2021. Late applications will be considered until the position is filled. See https://sec.uni-stuttgart.de/ for more information about the institute. See https://www.sec.uni-stuttgart.de/institute/job-openings/ for the official job announcement. For further information please contact: Prof. Dr. Ralf K?sters, ralf.kuesters at sec.uni-stuttgart.de. -- Prof. Dr. Ralf K?sters Institute of Information Security - SEC University of Stuttgart Universit?tsstra?e 38 D-70569 Stuttgart Germany https://sec.uni-stuttgart.de Phone: +49 (0) 711 685 88283 From alastair.donaldson at imperial.ac.uk Tue Jul 13 08:57:34 2021 From: alastair.donaldson at imperial.ac.uk (Alastair Donaldson) Date: Tue, 13 Jul 2021 13:57:34 +0100 Subject: [TYPES/announce] Two postdoc positions on next-generation fuzzing techniques Message-ID: Dear all At Imperial College London we are looking to hire two postdoctoral Research Associates to work on techniques for next-generation fuzzing, including applying methods that have shown success in randomized testing of programming language implementations more generally. We will also consider pre-doctoral candidates. Please see here for full details - I'd be grateful if you could spread the word to interested candidates: https://www.imperial.ac.uk/jobs/description/ENG01757/research-assistantassociate-automated-fuzz-testing-research-x2 If you're interested then do feel free to contact me in advance of applying with informal enquiries. Many thanks Ally -------------- next part -------------- An HTML attachment was scrubbed... URL: From willem.heijltjes at gmail.com Tue Jul 13 15:48:42 2021 From: willem.heijltjes at gmail.com (Willem Heijltjes) Date: Tue, 13 Jul 2021 20:48:42 +0100 Subject: [TYPES/announce] 6-Month postdoc in lambda-calculi and effects, University of Bath Message-ID: We invite applications for a post-doctoral research position, to investigate a new approach to efficient computation with and without computational effects in the lambda-calculus. This is a 6-month fixed-term role starting as soon as possible. It is part of the EPSRC-funded project `Typed Lambda-Calculi with Sharing and Unsharing'. To apply: http://www.bath.ac.uk/jobs/Vacancy.aspx?ref=CC8432 Enquiries: w.b.heijltjes at bath.ac.uk Deadline: 27 July 2021 The project revolves around new ideas in lambda-calculus and functional programming, focused in two areas. The first is *computational effects*, where the project has developed a simple and natural approach that subsumes many existing efforts, called the Functional Machine Calculus (FMC). The second is *efficient computation*, which combines ideas from proof theory and optimal reduction to investigate new, refined type systems for the lambda-calculus. The background and the source of original ideas is a branch of proof theory called "deep inference", which is closely related to category theory. Knowledge of this area is not essential to the advertised role. We are looking for excellent candidates with a PhD (or expected to complete one soon) and a proven track record in one or more of the following areas: * Lambda-calculus * Functional programming theory * Computational effects * Semantics of programming * Deep-inference proof theory As the successful candidate, you would contribute to one of several potential tasks, for example: * expanding the FMC to a prototype functional language * investigating new type systems for the FMC * investigating efficient implementations of the FMC * further develop type systems towards optimal reduction You will be part of the Mathematical Foundations group in the Department of Computer Science. We are a small, lively research group with an excellent international reputation. Some of our members are: Alessio Guglielmi http://alessio.guglielmi.name Willem Heijltjes http://willem.heijltj.es Jim Laird http://researchportal.bath.ac.uk/en/persons/james-laird Guy McCusker http://researchportal.bath.ac.uk/en/persons/guy-mccusker Thomas Powell http://t-powell.github.io Present circumstances permitting, you will have the opportunity to travel to various collaborators on the project in Europe, for example in Bologna and Paris. The University of Bath is a top-ranking university and a great place to work. Bath is a Unesco World Heritage city with fantastic amenities offering excellent quality of life. Links: Job advert: http://www.bath.ac.uk/jobs/Vacancy.aspx?ref=CC8432 Typed Lambda-Calculi with Sharing and Unsharing: http://willem.heijltj.es/Unsharing Mathematical Foundations Group: http://www.bath.ac.uk/projects/mathematical-foundations-of-computation/ Department of Computer Science: http://www.bath.ac.uk/departments/department-of-computer-science/ From p.gardner at imperial.ac.uk Wed Jul 14 07:58:11 2021 From: p.gardner at imperial.ac.uk (Gardner, Philippa A) Date: Wed, 14 Jul 2021 11:58:11 +0000 Subject: [TYPES/announce] three-year postdoc position on verifying concurrent programs Message-ID: Hello all, [Apologies for multiple postings.] I have a three-year post-doctoral research position available on `Gillian: Concurrency?, as part of a wider project on the Gillian platform for unified compositional symbolic reasoning about program correctness and incorrectness. It could turn into a more theoretical or more practical project depending on the strengths of the successful applicant. DEADLINE: 15th August 2021, flexible start date in 2022 (or earlier if you wish). The Gillian project is currently funded by my national fellowship on `Verified Trustworthy Software Specification? and a large Facebook gift. Details of this project are given below and details about my research group in general can be found here. I have further flexible funding so please get in touch if the timing for you is not quite right. If you are interested, please do not hesitate to contact me, cc?ing my administrator Teresa Carbajo Garcia, t.carbajo-garcia at imperial.ac.uk. Best wishes, Philippa --------------------------------------------------------------------------------------- Professor Philippa Gardner FREng Department of Computing Imperial College 180 Queen?s Gate London SW7 2AZ Your working day may not be the same as mine. Please do not feel obliged to reply to this email outside your normal working hours. --------------------------------------------------------------------------------------- Gillian: Concurrency Gillian [1,2] is a multi-language platform for unified compositional symbolic reasoning about program correctness and incorrectness. It is underpinned by a core symbolic execution engine, parametric on the memory model of the target language, with strong mathematical foundations that unifies symbolic testing and verification. Gillian has been instantiated to JavaScript and C, obtaining results on real-world AWS code that demonstrate the viability of our unified, parametric approach. Gillian currently works on sequential programs. This project will extend the core of Gillian with concurrency. A more theoretical project will develop a Gillian instantiation for a small concurrent While language and explore different types of concurrency reasoning for different types of strong and weak memory models, both theoretically and with Gillian. A more practical project will develop a Gillian instantiation for concurrent Rust, building on the current development of a Gillian instantiation for sequential Rust, and explore symbolic testing and verification for real-world Rust programs. The spirit of the group is to get the best fit between people and research, so there is much flexibility with these projects. We have recently developed a general infrastructure for the symbolic analysis of event-driven web applications [3]. I have also worked for many years on the compositional reasoning about concurrent programs, introducing fundamental techniques which underpin modern concurrent separation logics [4,5] and working on weak consistency models for atomic distributed transactions [6]. Some of this experience will inform the choices for extending Gillian with concurrency, but we will start from the beginning working out what are the right first choices for the project. References [1] Gillian, Part 1: A Multi-language Platform for Symbolic Execution, Jose Fragoso Santos, Petar Maksimovic, Sacha-Elie Ayoun and Philippa Gardner, PLDI'20. Talks at Rebase at ECOOP/OOPSLAFaceTAV and Amazon in 2020. [2] Gillian, Part 2: Real-world Verification for JavaScript and C, Petar Maksimovic, Sacha-Elie Ayoun, Jose Fragoso Santos and Philippa Gardner, CAV?21, draft available upon request. Talks at Galois and Coll?ge de France in 2021. [3] A Trusted Infrastructure for Symbolic Analysis of Event-driven Web Applications, Gabriela Sampaio, Jose Fragoso Santos, Petar Maksimovic and Philippa Gardner, ECOOP?20. [4] A Perspective on Specifying and Verifying Concurrent Modules, Thomas Dinsdale-Young, Pedro da Rocha Pinto and Philippa Gardner, Journal of Logical and Algebraic Methods in Programming, 2018. [5] TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs, Emanuele D?Osualdo, Azadeh Farzan, Philippa Gardner and Julian Sutherland, TOPLAS 2021, draft available upon request. [6] Data Consistency in Transactional Storage Systems: a Centralised Approach, Shale Xiong, Andrea Cerone, Azalea Raad and Philippa Gardner, ECOOP'20. -------------- next part -------------- An HTML attachment was scrubbed... URL: From barrett at cs.stanford.edu Wed Jul 14 21:40:06 2021 From: barrett at cs.stanford.edu (Clark Barrett) Date: Wed, 14 Jul 2021 18:40:06 -0700 Subject: [TYPES/announce] Postdoctoral position at Stanford Center for AI Safety Message-ID: The Stanford Center for AI Safety is sponsoring a new postdoctoral fellowship position for Fall 2021. Topics of interest include formal methods applied to AI systems. Details can be found on the center's website at aisafety.stanford.edu. Clark Barrett Co-director, Stanford Center for AI Safety -------------- next part -------------- An HTML attachment was scrubbed... URL: From xu at math.lmu.de Thu Jul 15 05:27:39 2021 From: xu at math.lmu.de (Chuangjie Xu) Date: Thu, 15 Jul 2021 11:27:39 +0200 Subject: [TYPES/announce] Proof and Computation 2021 Message-ID: <20210715112739.16481knnu67pezd7@webmail.mathematik.uni-muenchen.de> [Apologies for multiple postings.] Autumn school "Proof and Computation" Online, 13th and 14th September 2021 http://www.mathematik.uni-muenchen.de/~schwicht/pcv21.php This year's autumn school "Proof and Computation" will be held as an online workshop from 13th to 14th September 2021. SCOPE -------------------- - Predicative Foundations - Constructive Mathematics and Type Theory - Computation in Higher Types - Extraction of Programs from Proofs TALKS -------------------- - Liron Cohen: Effectful Proving (and Disproving) - David Corfield: Modal Type Theories - Grigory Devadze: Computer-certified proofs for control theoretic aspects and program extraction - Dominik Kirst: Formalising Metamathematics in Constructive Type Theory - Klaus Mainzer: Proof and Computation: Perspectives of Mathematics, Computer Science, and Philosophy - Antonio Piccolomini d'Aragona: Epistemic grounding. Semantics and calculi based on Prawitz's theory of grounds - Sebastian Posur: On free abelian categories for theorem proving - Florian Steinberg: Continuity, computability and discreteness - Holger Thies: Complexity Theory in Analysis with Applications to Differential Equations REGISTRATION -------------------- If you are interested in participating, please write to Nils K?pp (koepp at math.lmu.de) to receive the Zoom link. The workshop is supported by the Udo Keller Stiftung (Hamburg) and the CID (Computing with Infinite Data) programme of the European Commission. Klaus Mainzer Peter Schuster Helmut Schwichtenberg ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program. From gunther.reissig at unibw-muenchen.de Fri Jul 16 10:16:06 2021 From: gunther.reissig at unibw-muenchen.de (Gunther Reissig) Date: Fri, 16 Jul 2021 16:16:06 +0200 (CEST) Subject: [TYPES/announce] Postdoc position: Formal methods in control (Munich, Germany), ref 9y22x Message-ID: 17326773335114015903.1696.WolframLanguage.gunther.reissig@unibw-muenchen.de Dear Sirs, I would like to point you to the announcement of a Postdoc position in Munich, Germany, the city of the Oktoberfest. I would appreciate if you could advertise the position in your department or forward it to whomever you deem appropriate. The announcement is attached as a pdf file, and a plain text version can be found at the end of this email. Thank you. Sincerely, Gunther Reissig ==================================================================== Gunther Rei?ig, Dr. habil. Professor Bundeswehr University Munich Department of Aerospace Engineering LRT-15, Institute of Control Engineering 85577 Neubiberg (Munich) Germany -------------------------------------------------------------------- E-Mail: gunther.reissig at unibw-muenchen.de WWW: http://www.reiszig.de/gunther/ FAX: +49-89-6004-4565 Skype: guntherreissig ==================================================================== Postdoc position: Formal methods in control (Munich, Germany) Bundeswehr University Munich, Germany Department of Aerospace Engineering Institute of Control Engineering We invite applications for an EU funded post-doctoral researcher position in the field of formal methods in control. The successful candidate is expected to advance the state of the art of abstraction-based synthesis and verification for nonlinear continuous-state plants and to extend existing synthesis software. Depending on background and interests of the candidate, possible research foci are: automated determination of error bounds for floating-point implementations of numerical algorithms; parallelizable on-the-fly synthesis algorithms; adaptive state discretization; input-output interface of synthesis software. Required qualifications: * PhD degree in Systems and Control, Computer Science, Mathematics, or a related field. Exceptionally qualified and experienced candidates with an MSc degree will also be considered. * Solid experience in one of the following fields: Set-valued numerics; validated floating-point arithmetic; dynamic programming; formal methods in control. * Programming proficiency (C or Ada). * Efficient communication skills in English. The position is full-time and paid according to pay scale ``TVOeD Bund, E 14''. Actual income depends on marital status and professional experience, and starts from EUR 33000 net p.a. (E-13/EUR 31000 for applicants with an MSc degree). Reimbursement for travel expenses to conferences. No teaching load. The position is available immediately and for a duration until April 2023. It is open to applicants worldwide; no special security clearance necessary. Your complete application consists of the following documents, which should be sent as a single PDF file to the email address given below (deadline: July 28, 2021): * CV * One-page cover letter (clearly indicating available start date as well as relevant qualifications, experience and motivation) * University certificates and transcripts (BSc, MSc and PhD degrees) * Up to three letters of recommendation * List of publications * Possibly an English language certificate All documents should be in English or German. Gunther Reissig http://www.reiszig.de/gunther/ Email: gunther2016 at reiszig.de, Subject: Postdoc ref 9y22x -------------- next part -------------- A non-text attachment was scrubbed... Name: AusschreibungEmailA.pdf Type: application/octet-stream Size: 41117 bytes Desc: not available URL: From sey19 at uclive.ac.nz Sat Jul 17 17:17:56 2021 From: sey19 at uclive.ac.nz (Simon Yusuf-Enoch) Date: Sat, 17 Jul 2021 21:17:56 +0000 Subject: [TYPES/announce] CFP: PRDC 2021 - Extended deadline 1 August 2021 Message-ID: -- [Apologies if you receive multiple copies of this email.] -- ********************************************************************** CALL FOR PAPERS - PRDC 2021 The 26th Pacific Rim International Symposium on Dependable Computing Virtual Conference 1 - 4 December, 2021 Face-to-face in Perth, Australia Paper Submission Deadline: 1 August 2021 http://prdc.dependability.org/PRDC2021/ ********************************************************************** PRDC 2021 is the twenty-sixth event in the series of symposia started in 1989 that are devoted to dependable and fault-tolerant computing. PRDC is recognized as the main event in the Pacific area that covers many dimensions of dependability and fault tolerance, encompassing fundamental theoretical approaches, practical experimental projects, and commercial components and systems. As applications of computing systems have permeated into all aspects of daily life, the dependabil- ity of computing systems has become increasingly critical. This sympo- sium provides a forum for countries around the Pacific Rim and other areas of the world to exchange ideas for improving the dependability of computing systems. Topics of interest include (but are not limited to): -Software and hardware reliability, testing, verification, and validation -Dependability measurement, modeling, evaluation, and tools -Self-healing, self-protecting, and fault-tolerant systems -Software aging and rejuvenation -Safety-critical and mixed-criticality systems and software -Architecture and system design for dependability -Fault-tolerant algorithms and protocols -Dependability and security in web and mobile applications -Cloud computing resiliency, security and privacy -(Industrial) Internet of things dependability, security and privacy -Dependability issues in computer networks and communications -Dependability issues in high performance computing -Dependability issues in real-time systems -Dependability issues in storage and databases systems -Dependability issues in cyber-physical systems and Industry 4.0 -Dependability issues in socio-technical systems -Dependability and security in AI and machine learning systems -Blockchain and smart contracts ---------------------------------------------------------------------- Submission and Publication Information Manuscripts should be submitted in the following two categories: Regular Papers and Practical Experience Reports. Regular Papers should describe original research (not submitted or published elsewhere) and be not more than 10 pages using IEEE Computer Society conference format. Practical Experience Reports (max 6 pages using IEEE format guidelines) should describe an experience or a case study, such as the design and deployment of a system or actual failure and recovery field data. All submissions must be made electronically (in PDF format) on the submission website: https://www.easychair.org/conferences/?conf=prdc2021 Please note that all submissions will undergo a double-blind review. Please ensure that you have removed any references that could lead to identifying the authors of the paper. Failure to do so may result in rejection of the paper regardless of the paper contributions. Papers will be reviewed internationally and selected based on their original- ity, significance, relevance, and clarity of presentation. All accepted papers will be published by IEEE Computer Society Press (EI Indexed). One outstanding paper will be selected to receive the Best Paper Award, and one outstanding paper first authored by a stude- nt will receive the Best Student Paper Award. ---------------------------------------------------------------------- Important Dates Paper Submission Deadline : 1 August 2021 Notification of Acceptance : 29 August 2021 ---------------------------------------------------------------------- Organizing Committee General Chair: Jin B. Hong, University of Western Australia, Australia Program Co-Chair: Jin-Hee Cho, Virginia Tech, USA Marcello Cinque, Federico II University of Naples, Italy Local Arrangement Co-Chair: Naveed Akhtar, University of Western Australia, Australia Zeyi Wen, University of Western Australia, Australia Publicity Co-Chair: Gregory Blanc, Telecom SudParis, France Simon Yusuf-Enoch, University of Queensland, Australia Finance Chair: Susan Marie, University of Westner Australia, Australia Steering Committee Yennun Huang, Academia Sinica (Chair) Leon Alkalai, California Institute of Technology Takashi Nanya, University of Tokyo Nobuyasu Kanekawa, Hitachi Research Lab Jin Song Dong, National University of Singapore Karthik Pattabiraman, University of British Columbia Gernot Heiser, University of New South Wales Sy-Yen Kuo, National Taiwan University Michael Lyu, Chinese University of Hong Kong Zhi Jin, Peking University DongSeong Kim, University of Queensland ---------------------------------------------------------------------- Sponsors IEEE Computer Society University of Western Australia Business Events Perth Tourism Western Australia -------------- next part -------------- An HTML attachment was scrubbed... URL: From songfu1983 at shanghaitech.edu.cn Wed Jul 21 02:45:36 2021 From: songfu1983 at shanghaitech.edu.cn (=?gb2312?B?y864uzE5ODM=?=) Date: Wed, 21 Jul 2021 06:45:36 +0000 Subject: [TYPES/announce] SETTA 2021 Beijing: final Call for Papers --extended deadline Message-ID: (apologies for cross-posting) ======================================== SETTA 2021: Symposium on Dependable Software Engineering: Theories, Tools and Applications Institute of Software, Chinese Academy of Sciences, Beijing, China, November 25-27, 2021 Submission deadline: July 30, 2021 Conference website: https://lcs.ios.ac.cn/setta2021/ Colocated with FM'2021 ======================================== ************************ ABOUT SETTA 2021 ************************ The Symposium on Dependable Software Engineering: Theories, Tools and Applications (SETTA) 2021 will be held in Beijing, China on November 25-27, 2021, co-located with FM'2021. Formal methods emerged as an important area in computer science and software engineering about half a century ago. An international community is formed researching, developing and teaching formal theories, techniques and tools for software modeling, specification, design and verification. However, the impact of formal methods on the quality improvement of software systems in practice is lagging behind. This is for instance reflected by the challenges in applying formal techniques and tools to engineering large-scale systems such as Cyber-Physical Systems (CPS), Internet-of-Things (IoT), Enterprise Systems, Cloud-Based Systems, and so forth. The purpose of the SETTA symposium is to bring international researchers together to exchange research results and ideas on bridging the gap between formal methods and software engineering. The interaction with the Chinese computer science and software engineering community is a central focus point. The aim is to show research interests and results from different groups so as to initiate interest-driven research collaboration. The SETTA symposium is aiming at academic excellence and its objective is to become a flagship conference on formal software engineering in China. To achieve these goals and contribute to the sustainability of the formal methods research, it is important for the symposium to attract young researchers into the community. Thus, this symposium encourages in particular the participation of young researchers and students. All submissions must be in the PDF format. Papers should be written in English. Submitted papers must be unpublished and not submitted for publication elsewhere. Accepted papers for both tracks must be presented at the conference. Latest News: Special issues for the Elsevier Journal of Systems Architecture (JSA) and the International Journal on Software Tools for Technology Transfer (STTT) have been confirmed. Authors of selected papers from SETTA2021 will be invited to submit an extended version of their SETTA2021 paper to one of these special issues. ************************ LIST OF TOPICS ************************ Topics of interest include, but are not limited to: - Requirements specification and analysis - Formalisms for modeling, design and implementation - Model checking, theorem proving, and decision procedures - Scalable approaches to formal system analysis - Formal approaches to simulation, run-time verification, and testing - Integration of formal methods into software engineering practice - Contract-based engineering of components, systems, and systems of systems - Formal and engineering aspects of software evolution and maintenance - Parallel and multicore programming - Embedded, real-time, hybrid, probabilistic, and cyber-physical systems - Mixed-critical applications and systems - Formal aspects of service-oriented and cloud computing - Safety, reliability, robustness, and fault-tolerance - Dependability of smart software and systems - Empirical analysis techniques and integration with formal methods - Applications and industrial experience reports - Software tools to assist the construction or analysis of software systems ************************ CONFIRMED KEYNOTE SPEAKERS ************************ - Prof. Joost-Pieter Katoen RWTH Aachen University - Prof. Fritz Vaandrager Radboud University - Prof. Charles Zhang Hong Kong University of Science and Technology ************************ RESEARCH PAPERS TRACK ************************ Research papers will be published in the SETTA 2021 proceedings as a volume in Springer's LNCS series. Papers should be submitted electronically through the EasyChair submission web page . ------------------------ Important Dates ------------------------ Abstract & Paper Submission: July 30, 2021 (AoE) Notification to authors: September 3, 2021 (AoE) Camera-ready versions: September 20, 2021 (AoE) Conference date: November 25-27, 2021 ------------------------ Submission Guidelines ------------------------ Authors are invited to submit papers on original research, industrial applications, or position papers proposing challenges in fundamental research and technology. The latter two types of submissions are expected to contribute to the development of formal methods and applications thereof in software engineering. This is done by either substantiating the advantages of integrating formal methods into the development cycle or through delineating the need for research by demonstrating weaknesses of existing technologies, especially when addressing new application domains. Submissions can take the form of either regular or short papers. Regular papers should not exceed 16 pages (excluding references) in LNCS format. Short papers can discuss ongoing research at an early stage, including PhD projects. Short papers should not exceed 6 pages (excluding references) in LNCS format. ************************ COMMITTEES ************************ General Chair: - Chen Zhao, Institute of Software, Chinese Academy of Sciences Program Chair: - Shengchao Qin, Teesside University - Jim Woodcock, University of York - Wenhui Zhang, Institute of Software, Chinese Academy of Sciences Local Organisation Chair: - Zhilin Wu, Institute of Software, Chinese Academy of Sciences Publicity Chair: - Fu Song, ShanghaiTech University Program Committee Members: - Yamine Ait-Ameur (IRIT/INPT-ENSEEIHT) - Richard Banach (The University of Manchester) - Lei Bu (Nanjing University) - Milan Ceska (Brno University of Technology) - Sudipta Chattopadhyay (Singapore University of Technology and Design) - Liqian Chen (National University of Defense Technology) - Yu-Fang Chen (Academia Sinica) - Alessandro Cimatti (Fondazione Bruno Kessler) - Florin Craciun (Babes-Bolyai University) - Yuxin Deng (East China Normal University) - Wei Dong (National University of Defense Technology) - Hongfei Fu (Shanghai Jiao Tong University) - Jan Friso Groote (Eindhoven University of Technology) - Nan Guan (The Hong Kong Polytechnic University) - Dimitar Guelev (Bulgarian Academy of Sciences) - Thai Son Hoang (University of Southampton) - Chao Huang (University of Liverpool, Northwestern University) - Yu Jiang (Tsinghua University) - Sebastian Junges (University of California, Berkeley) - Guoqiang Li (Shanghai Jiao Tong University) - Yi Li (Nanyang Technological University) - Zhiming Liu (Southwest University) - Yang Liu (Nanyang Technological University) - Tiziana Margaria (Lero) - Dominique Mery (Universite de Lorraine, LORIA) - Stefan Mitsch (Carnegie Mellon University) - Jun Pang (University of Luxembourg) - Dave Parker (University of Birmingham) - Yu Pei (HK Polytechnic University) - Shengchao Qin (Teesside University) - Mickael Randour (F.R.S.-FNRS & Universite de Mons) - Stefan Schupp (TU Wien) - Zhiping Shi (Beijing Eng. Research Center of High Reliable Embbeded Systems) - Fu Song (ShanghaiTech University) - Jeremy Sproston (University of Turin) - Ting Su (East China Normal University) - Jun Sun (Singapore Management University) - Meng Sun (Peking University) - Andrea Turrini (Institute of Software, CAS) - Tarmo Uustalu (Reykjavik University) - Jaco van de Pol (Aarhus University) - Jim Woodcock (University of York) - Xiaofei Xie (Kyushu University) - Zhiwu Xu (Shenzhen University) - Bai Xue (Institute of Software, CAS) - Chenyi Zhang (Jinan University) - Wenhui Zhang (Institute of Software, CAS) ************************ VENUE ************************ The conference will be held in Beijing, China. ************************ CONTACT ************************ All questions about submissions should be emailed to setta2021 at easy*chair.org (remove *). -------------- next part -------------- An HTML attachment was scrubbed... URL: From bart.jacobs at cs.kuleuven.be Wed Jul 21 11:58:15 2021 From: bart.jacobs at cs.kuleuven.be (Bart Jacobs) Date: Wed, 21 Jul 2021 17:58:15 +0200 Subject: [TYPES/announce] Professor Position in Secure and Dependable Software Systems and Services at KU Leuven Message-ID: <6856dea8-b149-661f-dd57-55042b59f00f@kuleuven.be> Dear all, Here at KU Leuven, we have an open professor position in Secure and Dependable Software Systems and Services (deadline 28 October 2021). Your group will be part of the DistriNet research group of the Department of Computer Science. The topic is to be construed broadly; programming languages research is very much in scope. https://www.kuleuven.be/personeel/jobsite/jobs/60022535 https://distrinet.cs.kuleuven.be Best regards, Bart From cliron at bgu.ac.il Thu Jul 22 03:50:51 2021 From: cliron at bgu.ac.il (Liron Cohen) Date: Thu, 22 Jul 2021 07:50:51 +0000 Subject: [TYPES/announce] Funded postdoc and PhD positions in theorem proving and intuitionistic mathematics Message-ID: <1C0C1B27-DD97-4861-8D79-53303D7093A2@bgu.ac.il> We are looking for excellent PhD candidates and postdocs to join our project on ?Extending and Applying Implemented Intuitionistic Mathematics?, which is a joint project between Cornell University in the US and Ben-Gurion University in Israel. The aim of the project is to develop a proof assistant that fully integrates intuitionistic principles, such as the notion of choice sequences, and use the unique resulting computational setting to explore the intuitionistic theory?s wider implications, especially with respect to the broader notion of computation. This implementation includes providing computational interpretations of intuitionistic principles and developing semantics to support them, and using these principles to develop novel intuitionistic theories, namely, intuitionistic calculus and intuitionistic homotopy theory. Another goal is to use the framework to improve the capabilities of theorem proving tools and facilitate significant advances in the internal verification of complex systems. We invite applications for *funded PhD and postdoc positions* in the field of theorem proving and intuitionistic mathematics. Successful candidates are expected to advance the state of the art of existing theorem provers by resizing the predominant role of type theory in theorem proving especially with intuitionistic mathematics, and producing a more user-friendly alternative setting closer to common mathematical thinking. Depending on background and interests of the candidates, possible research foci are: implementing intuitionistic principles into a proof assistant; developing an intuitionistic calculus and studying its computational benefits; developing intuitionistic homotopy theory; applying the intuitionistic framework in formal verification. Successful candidates are likely to have efficient communication skills in English, as well as a track record of research expertise in a subset of the following topics: * Type inference and type theory * Intuitionistic or constructive foundations * Use of dependent type theories and proof assistants (eg, Coq or Agda) * Categorical semantics * Formal verification The positions are available immediately, start dates are flexible. Both positions include reimbursement for travel expenses to conferences and there is no teaching load. The funds for the PhD position are available for 4 years. The funds for the postdoc position are available for two years in the first instance with the possibility of extension. This collaborative project will afford excellent candidates the unique opportunity to study with two groups: in Israel (Ben-Gurion University) and the US (Cornell University). A successful candidate would take up the position at Ben-Gurion University in Israel and will also spend parts of their time at Cornell University in the US. The US visits can be very flexible, and travel expenses will be paid for. The complete application consists of the following documents, which should be sent as a single PDF file to the email address given below: * CV (including list of publications) * One-page cover letter (indicating available start date, relevant qualifications, experience, and motivation) * Up to three letters of recommendation * University certificates and transcripts (BSc, MSc, and PhD degrees, if applicable) Informal inquiries are welcome and should be directed to Dr. Liron Cohen (cliron at cs.bgu.ac.il). From amintimany at gmail.com Fri Jul 23 12:15:05 2021 From: amintimany at gmail.com (Amin Timany) Date: Fri, 23 Jul 2021 18:15:05 +0200 Subject: [TYPES/announce] CoqPL 2022: Call for Presentations Message-ID: <17BDE5AB-B5E3-4489-88AB-798131B43284@gmail.com> =================================================================== CoqPL 2022 8th International Workshop on Coq for Programming Languages -- January, 2022, co-located with POPL Philadelphia, Pennsylvania, United States CALL FOR PRESENTATIONS https://popl22.sigplan.org/home/CoqPL-2022 =================================================================== Workshop Overview ----------------- The series of CoqPL workshops provide an opportunity for programming languages researchers and practitioners with an interest in Coq to meet and interact with one another and members from the core Coq development team. At the meeting, we will discuss upcoming new features, see talks and demonstrations of exciting current projects, solicit feedback for potential future changes to Coq itself, and generally work to strengthen the vibrant community around our favorite proof assistant. Topics in scope include: - Formalizations of PL research in Coq - General purpose libraries and tactic language extensions - Domain-specific libraries for programming language formalization and verification - IDEs, profilers, tracers, debuggers, and testing tools - Reports on ongoing proof efforts conducted via (or in the context of) the Coq proof assistant - Experience reports from Coq usage in educational or industrial contexts Workshop Format --------------- The workshop format will be driven by you, members of the community. We will solicit abstracts for talks and proposals for demonstrations and flesh out format details based on responses. We expect the final program to include experiment reports, panel discussions, and invited talks (details TBA). Talks will be selected according to relevance to the workshop, based on the submission of an extended abstract. To foster open discussion of cutting edge research which can later be published in full conference proceedings, we will not publish papers from the workshop. However, presentations may be recorded and the videos may be made publicly available. Submission Details ------------------ Submission page: https://coqpl22.hotcrp.com/ Important Dates: - Submission: Thursday, October, 21 2021. - Notification: Thursday, November 18, 2021. - Workshop: January, 2021 (the exact date to be determined by the POPL organizing committee). Submissions for talks and demonstrations should be described in an extended abstract, between 1 and 2 pages in length (excluding the bibliography). We suggest formatting the text using the two-column ACM SIGPLAN latex style (9pt font). Templates are available from the ACM SIGPLAN page: http://www.sigplan.org/Resources/Author. Program Committee ----------------- Chairs: - Benjamin Pierce, University of Pennsylvania, USA - Amin Timany, Aarhus University, Denmark Program Committee: - Abhishek Anand, Bedrock Systems, USA - Lourdes del Carmen Gonz?lez-Huesca, National Autonomous University of Mexico (UNAM), Mexico - Jason Gross, Massachusetts Institute of Technology (MIT), USA - Chung-Kil Hur, Seoul National University, South Korea - Leonidas Lampropoulos, University of Maryland, USA - Xavier Leroy, Coll?ge de France & INRIA, France - Enrico Tassi, INRIA, France Covid-19 and Possibility of Virtual Workshop ------------------------------------------------ CoqPL 2022 is a collocated with POPL 2022 and will follow the decision of the organizing committee of POPL 2022 on whether it is held physically, virtually, or a combination thereof. From lindsey at composition.al Fri Jul 23 12:59:54 2021 From: lindsey at composition.al (Lindsey Kuper) Date: Fri, 23 Jul 2021 09:59:54 -0700 Subject: [TYPES/announce] Call for Applications: PLMW @ ICFP 2021 Message-ID: CALL FOR APPLICATIONS ACM SIGPLAN Programming Languages Mentoring Workshop Co-located with ICFP 2021 August 22, 2021 https://icfp21.sigplan.org/home/PLMW-ICFP-2021 The *Programming Languages Mentoring Workshop* (PLMW) is designed to broaden the exposure of *late-stage undergraduate students* and *early-stage graduate students* to research and career opportunities in programming languages. The workshop includes mentoring sessions that cover effective habits for navigating the research landscape, technical sessions that cover core subfields within programming languages, and social sessions that create opportunities for students to interact with researchers in the field. PLMW @ ICFP 2021 will be held August 22, immediately before the International Conference on Functional Programming (ICFP). More details about the workshop are available at https://icfp21.sigplan.org/home/PLMW-ICFP-2021. PLMW @ ICFP 2021 will be a virtual event. Some parts of the workshop, including mentoring socials and panels, will be available only to participants who have applied and been accepted to PLMW. Submit your application using this form (https://icfp21.sigplan.org/home/PLMW-ICFP-2021). *Please complete the application by August 8 for full consideration*. Applications received after August 8 will be considered as space permits. Applications from members of underrepresented groups in computing are especially welcome. Please note that if you apply and are accepted to attend PLMW, your registration fee for PLMW and ICFP is covered by a scholarship; we will automatically register you for ICFP free of cost. Best, PLMW @ ICFP 2021 Organizing Committee Lindsey Kuper, UC Santa Cruz Jose Calderon, University of Maryland / Galois, Inc. -------------- next part -------------- An HTML attachment was scrubbed... URL: From serge.autexier at dfki.de Sun Jul 25 06:52:05 2021 From: serge.autexier at dfki.de (Serge Autexier) Date: Sun, 25 Jul 2021 12:52:05 +0200 (CEST) Subject: [TYPES/announce] CICM 2021, July 26-31, Call for online participation Message-ID: <20210725105205.D2C7C2A2F509@gigondas.localdomain> Call for Participation 14th Conference on Intelligent Computer Mathematics - CICM 2021 - July 26-31, 2021 *Participation on Zoom is FREE after registration* http://www.cicm-conference.org/2021 ---------------------------------------------------------------------- Digital and computational solutions are becoming the prevalent means for the generation, communication, processing, storage and curation of mathematical information. CICM brings together the many separate communities that have developed theoretical and practical solutions for mathematical applications such as computation, deduction, knowledge management, and user interfaces. It offers a venue for discussing problems and solutions in each of these areas and their integration. CICM 2021 Programme committee: see https://www.cicm-conference.org/2021/cicm.php?event=&menu=pc CICM 2021 submissions are about all topics relating to intelligent computer mathematics, in particular but not limited to * theorem proving and computer algebra * mathematical knowledge management * digital mathematical libraries CICM appreciates the varying nature of the relevant research in this area and presents a mix of submissions of different forms: regular papers, project and survey papers, system and dataset descriptions. See you soon on-line! From riccardo.treglia at unito.it Tue Jul 27 07:23:14 2021 From: riccardo.treglia at unito.it (Riccardo Treglia) Date: Tue, 27 Jul 2021 13:23:14 +0200 Subject: [TYPES/announce] ITRS 2021 Call for Post-Proceedings Message-ID: ITRS 2021 Call for Post-ProceedingsTenth Workshop on Intersection Types and Related Systems - ITRS 2021 17 July 2021, Online Affiliated with FSCD , 17-24 July 2021, Buenos Aires Web page: http://www.di.unito.it/~deligu/ITRS2021/ Aims and Scope Intersection types were introduced near the end of the 1970s to overcome the limitations of Curry's type assignment system and to provide a characterization of the strongly normalizing terms of the Lambda Calculus. The key idea is to introduce an intersection type constructor ? such that a term of type t ? s can be used at both type t and s within the same context. This provides a finite polymorphism where various, even unrelated, types of the term are listed explicitly, differently from the more widely used universally quantified types where the polymorphic type is the common schema that stands for its various type instances. As a consequence, more terms (all and only the normalizing terms) can be typed than with universal polymorphism. Although intersection types were initially intended for use in analyzing and/or synthesizing lambda models as well as in analyzing normalization properties, over the last twenty years the scope of the research on intersection types and related systems has broadened in many directions. Restricted (and more manageable) forms have been investigated, such as refinement types. Type systems based on intersection type theory have been extensively studied for practical purposes, such as program analysis and higher-order model checking. The dual notion of union types turned out to be quite useful for programming languages. Finally, the behavioural approach to types, which can give a static specification of computational properties, has become central in the most recent research on type theory. The ITRS 2021 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches. Possible topics for submitted papers include, but are not limited to: - Formal properties of systems with intersection types. - Results for related systems, such as union types, refinement types, or singleton types. - Applications to lambda calculus, pi-calculus and similar systems. - Applications for programming languages, program analysis, and program verification. - Applications for other areas, such as database query languages and program extraction from proofs. - Related approaches using behavioral/intensional types and/or denotational semantics to characterize computational properties. - Quantitative refinements of intersection types. ITRS workshops have been held every two years (with the exception of 2020, because of COVID-19 outbreak). Information about the previous events is available on the ITRS home page . Post-Proceedings We are planning post-proceedings, including presentations to the workshop and submissions accepted via an open call with *dates*: - submission deadline: *1 October* - acceptance communication: *5 November* - camera-ready version: *19 November* Papers should not be published elsewhere, with original results or surveying ongoing research. They should be written in English using LaTex, and will appear on EPTCS: see Information for Authors . Submissions should be 20 pages long, excluding bibliography and avoiding technical appendices. Submissions are expected via EasyChair . Program Committee - Antonio Bucciarelli, Universit? de Paris, France - Daniel de Carvalho, Universit? Grenoble Alpes, France - Andrej Dudenhefner, Saarland University, Germany - Silvia Ghilezan, University of Novi Sad, Serbia - Giulio Guerrieri, University of Bath, UK - Ugo de' Liguoro, Universit? di Torino, Italy (chair) - Jeremy Siek, Indiana University Bloomington, USA (co-chair) Steering Committee - Mariangiola Dezani-Ciancaglini, Universit? di Torino, Italy - Jakob Rehof, TU University of Dortmund, Germany - Joe Wells, Heriot-Watt University, Scotland Organizers: - Ugo de' Liguoro, Universit? di Torino, Italy - Riccardo Treglia, Universit? di Torino, Italy ( riccardo.treglia at unito.it) -------------- next part -------------- An HTML attachment was scrubbed... URL: From jnfoster at cs.cornell.edu Tue Jul 27 10:25:18 2021 From: jnfoster at cs.cornell.edu (Nate Foster) Date: Tue, 27 Jul 2021 10:25:18 -0400 Subject: [TYPES/announce] Postdoctoral Researcher at Cornell University Message-ID: We invite applications for a postdoctoral research associate at Cornell University. The position is part of the Pronto Project (prontoproject.org). We are developing verified compilers for network devices. Applicants should have a PhD in Computer Science, expertise in programming languages design and implementation, strong communication skills, and a desire to work as part of an interdisciplinary team. A background in networking is not required. However, familiarity with formal semantics and proof assistants is preferred. The successful candidate will be provided with significant freedom to explore ideas that expand the scope of the project as well as opportunities for professional development. The position is for one year initially but may be extended to additional years. To apply, please send a CV, a research statement, one representative publication, and the names of three references to Nate Foster ( jnfoster at cs.cornell.edu). We especially welcome applications from women and members of under-represented minority groups. -------------- next part -------------- An HTML attachment was scrubbed... URL: From gunther.reissig at unibw-muenchen.de Tue Jul 27 12:10:43 2021 From: gunther.reissig at unibw-muenchen.de (=?ISO-8859-15?Q?Gunther_Rei=DFig?=) Date: Tue, 27 Jul 2021 18:10:43 +0200 (CEST) Subject: [TYPES/announce] Postdoc position: Formal Verification/Synthesis (Munich, Germany, deadline: August 28, 2021) Message-ID: We invite applications for an EU funded post-doctoral researcher position in the field of formal verification/synthesis. The successful candidate is expected to advance the state of the art of abstraction-based synthesis and verification for nonlinear continuous-state plants and to extend existing synthesis software. Depending on background and interests of the candidate, possible research foci are: automated determination of error bounds for floating-point implementations of numerical algorithms; parallelizable on-the-fly synthesis algorithms; adaptive state discretization; input/output languages and compiler for synthesis software. Required qualifications: * PhD degree in Computer Science, Systems and Control, Mathematics, or a related field. Exceptionally qualified and experienced candidates with an MSc degree will also be considered. * Solid experience in one of the following fields: Set-valued numerics; validated floating-point arithmetic; dynamic programming; formal verification/synthesis; professional grade software development. * Programming proficiency (C or Ada). * Efficient communication skills in English. The position is full-time and paid according to pay scale ``TVOeD Bund, E 14''. Actual income depends on marital status and professional experience, and starts from EUR 33000 net p.a. (E-13/EUR 31000 for applicants with an MSc degree). Reimbursement for travel expenses to conferences. No teaching load. The position is available immediately and for a duration until April 2023. It is open to applicants worldwide; no special security clearance necessary. Your complete application consists of the following documents, which should be sent as a single PDF file to the email address given below (deadline: August 28, 2021): * CV * One-page cover letter (clearly indicating available start date as well as relevant qualifications, experience and motivation) * University certificates and transcripts (BSc, MSc and PhD degrees) * Up to three letters of recommendation * List of publications * Possibly an English language certificate All documents should be in English or German. Gunther Reissig http://www.reiszig.de/gunther/ Email: gunther2016 at reiszig.de, Subject: Postdoc ref 9y22x Bundeswehr University Munich, Germany Department of Aerospace Engineering Institute of Control Engineering From walther.neuper at jku.at Tue Jul 27 13:01:23 2021 From: walther.neuper at jku.at (Walther Neuper) Date: Tue, 27 Jul 2021 19:01:23 +0200 Subject: [TYPES/announce] Call for papers - ThEdu'21 post-proceedings at EPTCS Message-ID: ????????????????????????? Open Call for Papers ************************************************************************** ??????????????????????? Proceedings for ThEdu'21??????????? ??????????? Theorem Proving Components for Educational Software ?????????????? http://www.uc.pt/en/congressos/thedu/thedu21 ************************************************************************** ??????????????????????? to be published by EPTCS, ?????????? Electronic Proceedings in Theoretical Computer Science ?????????????????????? http://published.eptcs.org ************************************************************************** Synopsis ? ThEdu'21, was accepted as a workshop at CADE28 The 28th ? International Conference on Automated Deduction, 11-16 July 2021. ? Because of the COVID-19 pandemic, CADE28 and all its workshops were ? virtual events. It was a very lively virtual meeting with an average ? of 18 attendees. ThEdu'21 programme comprised one invited talk, 11 ? regular contributions and one demonstration, whose abstracts, ? presentations and videos are in the workshop web-page. ? Now post-proceedings are planned to collect the contributions ? upgraded to full papers. The contributions' topics are diverse ? according to ThEdu's scope, and this is a call open for everyone, ? also those who did not participate in the workshop. All papers will ? undergo review according to EPTCS standards. ThEdu'21 Scope: ? Computer Theorem Proving is becoming a paradigm as well as a ? technological base for a new generation of educational software in ? science, technology, engineering and mathematics. This volume of ? EPTCS intends to bring together experts in automated deduction with ? experts in education in order to further clarify the shape of the ? new software generation and to discuss existing systems. Important Dates ?* Submission (Full Papers): 10 October 2021 ?* Notification of acceptance: 28 November 2021 ?* Revised papers due: 12 December 2021 Topics of interest include: ?* methods of automated deduction applied to checking students' input; ?* methods of automated deduction applied to prove post-conditions ?? for particular problem solutions; ?* combinations of deduction and computation enabling systems to ?? propose next steps; ?* automated provers specific for dynamic geometry systems; ?* proof and proving in mathematics education. Submission ? We welcome submission of full papers (12--20 pages) presenting ? original unpublished work which is not being submitted for ? publication elsewhere. ? All contributions will be reviewed (at least three blind reviews) to ? meet the high standards of EPTCS. ? ? The authors should comply with the "instructions for authors", LaTeX ? style files and accept the "Non-exclusive license to distribute" of ? EPTCS: Instructions for authors (http://info.eptcs.org/) LaTeX style ? file and formatting instructions (http://style.eptcs.org/) Copyright ? (http://copyright.eptcs.org/) ? Papers should be submitted via EasyChair,?? ? https://easychair.org/conferences/?conf=thedu21. Program Committee ? Francisco Botana, University of Vigo at Pontevedra, Spain ? David Cerna, Johannes Kepler University, Austria ? Jo?o Marcos, Universidade Federal do Rio Grande do Norte, Brazil (co-chair) ? Filip Maric, University of Belgrade, Serbia ? Adolfo Neto, Universidade Tecnol?gica Federal do Paran?, Brazil ? Walther Neuper, Graz University of Technology, Austria (co-chair) ? Pedro Quaresma, University of Coimbra, Portugal (co-chair) ? Philippe R. Richard, Universit? de Montr?al, Canada ? Vanda Santos, University of Aveiro, Portugal ? Wolfgang Schreiner, Johannes Kepler University, Austria ? J?rgen Villadsen, Technical University of Denmark, Denmark -------------- next part -------------- An HTML attachment was scrubbed... URL: From Radu.Iosif at univ-grenoble-alpes.fr Thu Jul 29 04:27:19 2021 From: Radu.Iosif at univ-grenoble-alpes.fr (Radu Iosif) Date: Thu, 29 Jul 2021 10:27:19 +0200 Subject: [TYPES/announce] PhD position in automated reasoning (Grenoble, France) Message-ID: <34DD11DA-44A5-44EA-B086-EFAFF75BFACA@univ-grenoble-alpes.fr> The LIG (https://www.liglab.fr/) and VERIMAG (http://www-verimag.imag.fr/ ) laboratories in Grenoble are seeking an outstanding PhD candidate to fill the following 3-years funded position: Decision Procedures for Inductive Separation Logic Modulo Data Theories Advisors: Nicolas Peltier > (LIG) and Radu Iosif >(VERIMAG) The goal of this PhD project is to devise decision procedures for Separation Logic with user-provided inductive definitions of predicates. We intend to find a procedure that is optimal from a theoretical point of view, practically efficient, and able to handle a class of definitions that is as large as possible, combining spatial reasoning (to reason on the shape of the considered data structures) with data theory reasoning based on external tools (to take into account the properties of the data stored inside the structure). Full description: http://nts.imag.fr/images/2/25/SepLogDataPhD.pdf How to apply: send your CV to > and > Starting date: October 1st 2021 -------------- next part -------------- An HTML attachment was scrubbed... URL: From jrot at cs.ru.nl Thu Jul 29 07:46:46 2021 From: jrot at cs.ru.nl (Jurriaan Rot) Date: Thu, 29 Jul 2021 13:46:46 +0200 Subject: [TYPES/announce] PhD position on coalgebra and semantics at Radboud University Message-ID: There is a 4-year PhD position in theoretical computer science available at Radboud University. Project: As a PhD candidate on this project, you will conduct research at the intersection of semantics, category theory and coalgebra. Coalgebra is an elegant mathematical theory of state-based systems (transition systems, various kinds of automata, probabilistic models), based on category theory. In this context, distributive laws capture the interaction between coalgebra and algebra, and have shown to be very useful as a general way of modelling programming language semantics, as well as automata constructions and powerful co-inductive proof techniques. The aim of the project is to investigate distributive laws in their own right, and build a toolkit for constructing, combining and analysing them. You can build on several existing approaches, but will have plenty of freedom to define your own direction and focus. If you wish to learn more about the project, don't hesitate to get in touch via jrot at cs.ru.nl We ask: ? You hold an MSc or equivalent degree in computer science, mathematics or a closely related field. ? You are able to work both independently and as part of a team. ? You are proficient in English. (Dutch is not required.) ? Prior knowledge of coalgebra is not required; basic knowledge of category theory will be helpful. Most important is that you are excited about abstract structures in theoretical computer science. Application deadline: 10 September 2021. Starting date: flexible, but 1 January 2022 the latest. Application and further info: https://www.ru.nl/english/working-at/vacature/details-vacature/?recid=1161943&pad=%2fenglish&doel=embed&taal=uk All the best, Jurriaan From Coen.De.Roover at vub.be Fri Jul 30 08:12:42 2021 From: Coen.De.Roover at vub.be (Coen DE ROOVER) Date: Fri, 30 Jul 2021 12:12:42 +0000 Subject: [TYPES/announce] Professor position in "Static security guarantees for programming languages" Message-ID: <9C2159AA-7D8D-4694-B995-6C4C3A220E03@vub.be> The computer science department of the Vrije Universiteit Brussel is offering a full-time position as professor to reinforce its programming languages and software engineering branch within the subject area of "Static security guarantees for programming languages". The position is published under the heading: Tenure track lecturer (Research) ?Static security guarantees for programming languages? on the university's job offers website at https://jobs.vub.be/job/Elsene-Tenure-track-lecturer-%28Research%29-'Static-security-guaranties-for-programming-languages'/687214901/ You will be offered a tenure track appointment, for an assignment of 1 FTE, for 5 years, with eligibility for tenure in the rank of associate professor (or higher) by the end of this initial period, with planned starting date 01/02/2022. The deadline for applying is September 6th, 2021. Applications should reach us through the website. The person to contact for further information is: Prof. dr. Wolfgang De Meuter at Wolfgang.De.Meuter at vub.be or on +02/2629.34.81. ** Position description ** Education and Research domain: Static security guarantees for programming languages Education: * The teaching load associated with a full-time appointment includes teaching general Computer Science courses at the bachelor?s level as well as specialised, research-related courses at the master?s level; * The average teaching load after the initial years is four courses of 6 ECTS a year including a specialised course directly related to your expertise; * For all courses support from teaching assistance is available; * The exact course list will be negotiated with you, and will depend on your expertise and language skills; Research: * You will reinforce the research of the Software Languages Lab (soft.vub.ac.be); * The lab is active in software language research (e.g. programming languages and DBMS languages) and software engineering research; * You will be active in the domain of the static aspects of programming languages with a focus on security aspects. This includes designing static type systems (e.g., dependently typed languages), using automated proof assistants (e.g., Coq), writing secure compilers, secure virtual machines, etc.; Other: * You will be part of the management structure of the Software Languages Lab, and you are expected to actively contribute to the operational aspects and to the further development of the lab; * This implies the guidance of PhD and master students, but also starting new projects and applying for funding; For this function, our Brussels Humanities, Sciences & Engineering Campus (Elsene) will serve as your home base. ** Additional Information ** Applications should be submitted by September 6th, 2021 through https://jobs.vub.be/job/Elsene-Tenure-track-lecturer-%28Research%29-'Static-security-guaranties-for-programming-languages'/687214901/ From ngopalan at umn.edu Fri Jul 30 15:59:32 2021 From: ngopalan at umn.edu (Gopalan Nadathur) Date: Fri, 30 Jul 2021 14:59:32 -0500 Subject: [TYPES/announce] Postdoctoral Opening at the University of Minnesota Message-ID: Applications are invited for a one-year postdoctoral position at the University of Minnesota. The position is available immediately; applications will be reviewed as they are received. The project within which the appointment is to be made concerns the development of a framework that supports the encoding of rule-based relational specifications and the process of reasoning about such specifications through the encoding. An emphasis in the project is the use of the so-called higher-order abstract syntax approach to representing objects that embody a binding structure. In recent work, we have developed a new logic for articulating properties of LF specifications, which has provided the basis for a proof assistant called Adelfa for reasoning about such properties. In other work, we are developing the capability to reason about linear logic specifications within the Abella proof assistant and are also using this system to explore the benefits of higher-order representations of syntax in the verification of compilers and transformers for functional programming languages. The successful candidate will be expected to participate in and help lead the work in some of these directions. To be suitable for the position, the candidate should be broadly conversant with the areas of computational logic and programming languages and should have the mathematical and programming skills necessary for conducting research in them. Some particular facets that would be helpful in engaging immediately with the research problems are a prior exposure to a proof assistant or logical framework such as Coq, Isabelle or Abella, programming experience with a functional language such as OCaml, an understanding of proof theoretic treatments of aspects such as fixed-point definitions, and familiarity with issues related to proof search in sequent calculi and similar logical systems. Please feel free to contact me (Gopalan Nadathur, ngopalan at umn.edu) for more details about the position. To view the official announcement, please visit the URL https://hr.myu.umn.edu/jobs/ext/330828. This site also provides details about how to apply and serves as the portal for applications. A prerequisite for employment in this capacity is a doctoral degree in Computer Science or closely related field. -Gopalan -------------- next part -------------- An HTML attachment was scrubbed... URL: From james.cheney at gmail.com Wed Aug 4 08:58:38 2021 From: james.cheney at gmail.com (James Cheney) Date: Wed, 4 Aug 2021 13:58:38 +0100 Subject: [TYPES/announce] CFP: 24th International Symposium on Practical Aspects of Declarative Languages (PADL 2022) Message-ID: === Call for Papers === 24th International Symposium on Practical Aspects of Declarative Languages (PADL 2022) Philadelphia, Pennsylvania, United States 17-18th January 2022 https://popl22.sigplan.org/home/PADL-2022 Co-located with POPL 2022 Conference Description ---------------------- Declarative languages comprise several well-established classes of formalisms, namely, functional, logic, and constraint programming. Such formalisms enjoy both sound theoretical bases and the availability of attractive frameworks for application development. Indeed, they have been already successfully applied to many different real-world situations, ranging from data base management to active networks to software engineering to decision support systems. New developments in theory and implementation fostered applications in new areas. At the same time, applications of declarative languages to novel and challenging problems raise many interesting research issues, including designing for scalability, language extensions for application deployment, and programming environments. Thus, applications drive the progress in the theory and implementation of declarative systems, and benefit from this progress as well. PADL is a well-established forum for researchers and practitioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative programming, including functional and logic programming, database and constraint programming, and theorem proving. Topic of interest include, but are not limited to: - Innovative applications of declarative languages - Declarative domain-specific languages and applications - Practical applications of theoretical results - New language developments and their impact on applications - Declarative languages and software engineering - Evaluation of implementation techniques on practical applications - Practical experiences and industrial applications - Novel uses of declarative languages in the classroom - Practical extensions such as constraint-based, probabilistic, and reactive languages PADL 2022 especially welcomes new ideas and approaches related to applications, design and implementation of declarative languages going beyond the scope of the past PADL symposia, for example, advanced database languages and contract languages, as well as verification and theorem proving methods that rely on declarative languages. Submissions ----------- PADL 2022 welcomes three kinds of submission: * Technical papers (max. 15 pages) Technical papers must describe original, previously unpublished research results. * Application papers (max. 8 pages) Application papers are a mechanism to present important practical applications of declarative languages that occur in industry or in areas of research other than Computer Science. Application papers are expected to describe complex and/or real-world applications that rely on an innovative use of declarative languages. Application descriptions, engineering solutions and real-world experiences (both positive and negative) are solicited. * Extended abstracts (max. 3 pages) Describing new ideas, a new perspective on already published work, or work-in-progress that is not yet ready for a full publication. Extended abstracts will be posted on the symposium website but will not be published in the formal proceedings. All page limits exclude references. Submissions must be formatted according to the standard Springer LNCS style. The conference proceedings of PADL2022 will be published by Springer-Verlag in the Lecture Notes in Computer Science series. Work that already appeared in unpublished or informally published workshops proceedings may be submitted but the authors should notify the program chairs about the place in which it has previously appeared. PADL 2022 submissions are handled through the EasyChair conference management system: https://easychair.org/conferences/?conf=padl2022. Important dates (tentative) --------------- Abstract submission: 1 October 2021 (AoE) Paper submission: 8 October 2021 Notification of acceptance: 5 November 2021 Symposium: 17-18th January 2022 COVID-19 -------- PADL is co-located with POPL, which will take place January 16-22, 2022, as a physical, virtual, or hybrid physical/virtual meeting. We will be monitoring the Covid-19 situation and will announce a decision on the nature of the meeting in time which will follow suit with POPL. Distinguished Papers -------------------- The authors of a small number of distinguished papers will be invited to submit a longer version for journal publication after the symposium. For papers related to logic programming, in the journal Theory and Practice of Logic Programming (TPLP) https://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming, and for papers related to functional programming, in Journal of Functional Programming (JFP) https://www.cambridge.org/core/journals/journal-of-functional-programming. The extended journal submissions should include roughly 30% more content including, for example, explanations for which there was no space, illuminating examples and proofs, additional definitions and theorems, further experimental results, implementational details and feedback from practical/engineering use, extended discussion of related work and such like. Chairs ------ - James Cheney, University of Edinburgh - Simona Perri, University of Calabria Programme Committee ------------------- Andres L?h, WellTyped Chiaki Sakama, Wakayama University Daniela Inclezan, Miami University Ekaterina Komendantskaya, Heriot-Watt University Esra Erdem, Sabanci University Francesco Calimeri, University of Calabria Jan Christiansen, Flensburg University of Applied Sciences Konstantin Schekotihin, University of Klagenfurt Lionel Parreaux, Hong Kong University of Science and Technology Marco Maratea, University of Genova Marina De Vos, University of Bath Martin Erwig, Oregon State University Martin Gebser, University of Klagenfurt Michael Greenberg, Pomona College Paul Tarau, University of North Texas Pavan Kumar Chittimalli, TCS Research, India Pedro Cabalar, University of Corunna Roly Perera, The Alan Turing Institute Tomas Petricek, University of Kent Torsten Grust, University of T?bingen Tran Cao Son, New Mexico State University Yukiyoshi Kameyama, University of Tsukuba -------------- next part -------------- An HTML attachment was scrubbed... URL: From spreen at math.uni-siegen.de Wed Aug 4 12:53:58 2021 From: spreen at math.uni-siegen.de (Dieter Spreen) Date: Wed, 4 Aug 2021 18:53:58 +0200 Subject: [TYPES/announce] CID; CCC 2021; 2nd call for submissions Message-ID: <5C08ED07-E9F9-468D-9C07-8E75BC901F9B@math.uni-siegen.de> Continuity, Computability, Constructivity ? From Logic to Algorithms (CCC 2021) In honour of Ulrich Berger?s 65th Birthday Birmingham / Online workshop 19 - 24 September 2021 Second call for submissions www.cs.bham.ac.uk/~axj/ccc2021 CCC is a workshop series that brings together researchers applying logical methods to the development of algorithms, with a particular focus on computation with infinite data, where issues of continuity, computability and constructivity play major roles. Specific topics include exact real number computation, computable analysis, effective descriptive set theory, constructive analysis, and related areas. The overall aim is to apply logical methods in these disciplines to provide a sound foundation for obtaining exact and provably correct algorithms for computations with real numbers and other continuous data, which are of increasing importance in safety critical applications and scientific computation. Due to the COVID-19 pandemic and its consequences with respect to travelling and gathering together, the workshop will take place online. Previous workshops have been held in Cologne 2009, Trier 2012, Gregynog 2013, Ljubljana 2014, Kochel 2015, Nancy 2017, Faro 2018, Ljubljana 2019, Faro 2020 (online). The workshop is open to all researchers in the area. Scope: The workshop specifically invites contributions in the areas of Exact real number computation, Correctness of algorithms on infinite data, Computable analysis, Complexity of real numbers, real-valued functions, etc. Effective descriptive set theory, Domain theory, Constructive analysis, Category-theoretic approaches to computation on infinite data, Weihrauch degrees, And related areas. Invited Speakers: Suguman Bansal (U Penn) Franz Brau?e (U Manchester) Sewon Park (KAIST) Monika Seisenberger (Swansea U) Michael Yampolsky (U Toronto) Tutorial Speaker: Andr? Platzer (CMU) Submssion: Extended abstracts (1-2 pages) of original work are welcome. Deadline: 30 August 2021 Upload your submission via EasyChair: https://easychair.org/conferences/?conf=ccc2021 Programme Committee: Ulrich Berger (Swansea) Daniel Gra?a (Faro) Achim Jung (co-chair) Milly Maietti (Padua) Elvira Mayordomo (Zaragoza) Norbert M?ller (Trier) Paul Potgieter (Pretoria) Dieter Spreen (Siegen) (co-chair) Hideki Tsuiki (Kyoto) Organizing Committee: Achim Jung (Birmingham) Dieter Spreen (Siegen) -------------- next part -------------- An HTML attachment was scrubbed... URL: From dom.orchard at gmail.com Wed Aug 4 16:04:26 2021 From: dom.orchard at gmail.com (Dominic Orchard) Date: Wed, 4 Aug 2021 21:04:26 +0100 Subject: [TYPES/announce] Workshop on Type-Driven Development (TyDe 21 @ ICFP) Call for Participation Message-ID: We have an exciting lineup of papers and extended abstracts at TyDe 2021 this year,co-located with ICFP 2021 and scheduled for August 22nd. Details of the programme can be found here: https://icfp21.sigplan.org/home/TyDe-2021#program Our programme includes a keynote from Wen Kokke on "Integrating Agda with SMT-LIB - An incomplete list of pits I feel in". Participation is online and you can register as part of the ICFP registration: https://icfp21.sigplan.org/attending/Registration This year the registration price is modest ($75 for ACM members or free for ACM students) and there is even a discount option of $10 for those who do not have a source of external funding, to further enable wide participation. Early registration rates end August 7th (after which the price goes up slightly). We do hope you will join us. Dominic Orchard and Josh Ko TyDe 2021 chairs -------------- next part -------------- An HTML attachment was scrubbed... URL: From niccolo.veltri at gmail.com Thu Aug 5 02:35:40 2021 From: niccolo.veltri at gmail.com (=?UTF-8?Q?Niccol=c3=b2_Veltri?=) Date: Thu, 5 Aug 2021 09:35:40 +0300 Subject: [TYPES/announce] Call for Participation: PPDP & LOPSTR 2021 Message-ID: <180ea3d3-27a6-e5e5-0064-0f89fde8c09f@gmail.com> ========================= PPDP 2021 | LOPSTR 2021 CALL FOR PARTICIPATION ========================= 23rd International Symposium on Principles and Practice of Declarative Programming (PPDP 2021) and 31st International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2021) 6?8 September 2021, Tallinn, Estonia, and online PPDP website: http://imft.ftn.uns.ac.rs/PPDP2021 LOPSTR website: http://saks.iasi.cnr.it/lopstr21/ Joint PPDP/LOPSTR conference website: http://cs.ioc.ee/ppdp-lopstr21/ =================================== REGISTRATION for physical and online participation: http://cs.ioc.ee/ppdp-lopstr21/regform.html Physical registration is open until *August 18*. =================================== Invited Speakers ---------------- Marko Gaboardi, Boston University (PPDP invited speaker) Harald S?ndergaard, University of Melbourne (joint PPDP-LOPSTR invited speaker) Stephen Wolfram, Wolfram Research (joint PPDP-LOPSTR invited speaker) Bernardo Toninho, Lu?s Caires, and Frank Pfenning (10 year most influential paper award, PPDP 2011) =================================== About PPDP ---------- The PPDP 2021 symposium brings together researchers from the declarative programming communities, including those working in the functional, logic, answer-set, and constraint handling programming paradigms. The goal is to stimulate research in the use of logical formalisms and methods for analyzing, performing, specifying, and reasoning about computations, including mechanisms for concurrency, security, static analysis, and verification. =================================== About LOPSTR ------------ The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. =================================== PPDP Program Committee ----------------------------- Zena Ariola, University of Oregon, USA Nick Benton, Facebook, UK (co-chair) Ma?gorzata Biernacka, University of Wroclaw, Poland James Cheney, The University of Edinburgh, UK Stefania Dumbrava, ENSIIE Paris-Evry, France Silvia Ghilezan, University of Novi Sad & Mathematical Institute SASA, Serbia (co-chair) Hugo Herbelin, INRIA, France Cosimo Laneve, University of Bologna, Italy Pierre Lescanne, ENS de Lyon, France Ugo de?Liguoro, University of Torino, Italy Francesca A. Lisi, University of Bari, Italy Yanhong Annie Liu, Stony Brook University, USA Elaine Pimentel, Federal University of Rio Grande do Norte, Brazil Yukiyoshi Kameyama, University of Tsukuba, Japan Petar Maksimovi?, Imperial College, London, UK Yutaka Nagashima, Yale-NUS College, Singapore & University of Innsbruck, Austria Aleksandar Nanevski, IMDEA Software Institute, Spain Vivek Nigam, fortiss GmbH, Germany & Federal University of Para?ba, Brazil Jorge A. P?rez, University of Groningen, The Netherlands Sanjiva Prasad, Indian Institute of Technology Delhi, India Alexis Saurin, CNRS, Universit? de Paris & INRIA , France Tom Schrijvers, KU Leuven, The Netherlands Paul Tarau, University of North Texas, USA Tarmo Uustalu, Reykjavik University, Iceland & Tallinn University of Technology, Estonia =================================== LOPSTR Program Committee ----------------------------- Roberto Amadini, University of Bologna, Italy Sabine Broda, University of Porto, Portugal Maximiliano Cristi?, CIFASIS-UNR, Argentina Emanuele De Angelis, IASI-CNR, Italy (co-chair) W?odzimierz Drabent, IPI PAN, Poland & Link?ping University, Sweden Catherine Dubois, ENSIIE-Samovar, France Gregory Duck, National University of Singapore, Singapore Fabio Fioravanti, University of Chieti-Pescara, Italy Jeremy Gibbons, University of Oxford, UK Gopal Gupta, University of Texas at Dallas, USA Geoff Hamilton, Dublin City University, Ireland Michael Hanus, Kiel University, Germany Bishoksan Kafle, IMDEA Software Institute, Spain Maja Kirkeby, Roskilde University, Denmark Temur Kutsia, RISC J. Kepler University of Linz, Austria Michael Leuschel, University of D?sseldorf, Germany Pedro L?pez-Garc?a, IMDEA Software Institute & CSIC, Spain Jacopo Mauro, University of Southern Denmark, Denmark Fred Mesnard, Universit? de la R?union, France Alberto Momigliano, University of Milano, Italy Jorge A. Navas, SRI International, USA Naoki Nishida, Nagoya University, Japan Wim Vanhoof, University of Namur, Belgium (co-chair) Alicia Villanueva, Universitat Polit?cnica de Val?ncia, Spain =================================== Local Organizers ----------------------------- Niccol? Veltri, Tallinn University of Technology, Estonia (chair) Tarmo Uustalu, Reykjavik University, Iceland & Tallinn University of Technology, Estonia =================================== Contact: ppdp-lopstr21 at cs.ioc.ee From icfp.publicity at googlemail.com Thu Aug 5 22:51:39 2021 From: icfp.publicity at googlemail.com (Sam Tobin-Hochstadt) Date: Thu, 05 Aug 2021 22:51:39 -0400 Subject: [TYPES/announce] Call for Participation: ICFP 2021 Message-ID: <610ca3bb2944_1ba72e42754@homer.mail> ===================================================================== Call for Participation ICFP 2021 26th ACM SIGPLAN International Conference on Functional Programming and affiliated events August 22 - August 27, 2021 Online http://icfp21.sigplan.org/ Early Registration until August 7! ===================================================================== ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. The conference covers the entire spectrum of work, from practice to theory, including its peripheries. This year, the conference will be a virtual event. All activities will take place online. The main conference will take place from August 23-25, 2021 during two time bands. The first band will be 4PM-11PM Seoul time, and will include both technical and social activities. The second band will repeat (with some variation) the technical program and social activities 12 hours later, 3PM-10PM New York, the following day. We?re excited to announce that ICFP 2021 will feature an invited talk from Ravi Chugh of the University of Chicago. Keynote sessions will take place at 10 PM Seoul/9 AM New York. ICFP has officially accepted 35 exciting papers, and (in its second year) there will also be presentations of 4 papers accepted recently to the Journal of Functional Programming. Co-located symposia and workshops will take place the day before and two days immediately after the main conference. Registration is now open. The early registration deadline is August 7th, 2021. Registration is not free, but is significantly lower than usual, including a $10 discounted registration option available to all. Students who are ACM or SIGPLAN members may register for FREE before the early deadline. https://regmaster.com/2021conf/ICFP21/register.php New this year: Attendees will be able to sign-up for the ICFP Mentoring Program (either to be a mentor, receive mentorship or both). * Overview and affiliated events: http://icfp21.sigplan.org/home * Accepted papers: http://icfp21.sigplan.org/track/icfp-2021-papers#event-overview * JFP Talks: https://icfp21.sigplan.org/track/icfp-2021-jfp-talks#event-overview * Registration is available via: https://regmaster.com/2021conf/ICFP21/register.php Early registration ends 8 August, 2021. * Programming contest: https://icfpcontest2021.github.io/ * Student Research Competition: https://icfp21.sigplan.org/track/icfp-2021-Student-Research-Competition * Follow us on Twitter for the latest news: http://twitter.com/icfp_conference This year, there are 10 events co-located with ICFP: * Erlang Workshop (8/26) * Haskell Implementors' Workshop (8/22) * Haskell Symposium (8/26-8/27) * Higher-Order Programming with Effects (8/22) * miniKanren Workshop (8/26) * ML Family Workshop (8/26) * OCaml Workshop (8/27) * Programming Languages Mentoring Workshop (8/22) * Scheme Workshop (8/27) * Type-Driven Development (8/22) ### ICFP Organizers General Chair: Sukyoung Ryu (KAIST, South Korea) Program Chair: Ron Garcia (UBC, Canada) Artifact Evaluation Co-Chairs: Brent Yorgey (Hendrix College, USA) Gabriel Scherer (INRIA Saclay, France) Industrial Relations Chair: Alan Jeffrey (Roblox, USA) Simon Marlow (Facebook, UK) Programming Contest Organizers: Alex Lang and Jasper Van der Jeugt Publicity and Web Chair: Sam Tobin-Hochstadt (Indiana University, USA) Student Research Competition Chair: Anders Miltner (University of Texas, USA) Workshops Co-Chairs: Zoe Paraskevopoulou (Northeastern University, USA) Leonidas Lampropoulos (University of Maryland, USA) Video Co-Chairs: Leif Andersen (Northeastern University, USA) Ben Chung (Northeastern University, USA) Student Volunteer Co-Chairs: Hanneli Tavante (McGill University, Canada) Jaemin Hong (KAIST, South Korea) Lily Bryant (UBC, Canada) Accessibility Co-Chairs: Lindsey Kuper (UCSC, USA) Kathrin Stark (Princeton, USA) From amal at ccs.neu.edu Fri Aug 6 17:48:53 2021 From: amal at ccs.neu.edu (Amal Ahmed) Date: Fri, 6 Aug 2021 17:48:53 -0400 Subject: [TYPES/announce] OOPSLA 2022: Round 1 Call for Papers Message-ID: <09FB49CE-D3D8-497C-8167-764EA286C12E@ccs.neu.edu> NEW this year: OOPSLA 2022 will have two rounds of reviewing. NOTE: Round 1 paper submission deadline: ** October 12, 2021 ** ======================================================================== PACMPL Issue OOPSLA 2022 Call for Papers OOPSLA 2022 will be held as part of The ACM Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH'22) November 14-19, 2022, Auckland, New Zealand https://2022.splashcon.org/track/splash-2022-oopsla ======================================================================== ### Important dates ROUND 1: Submission deadline: Tue Oct 12, 2021 Author response: Tue Nov 30 - Fri Dec 3 Early Notification: Thu Dec 16 Submission of Revisions: Fri Feb 11 Final Notification: Fri Feb 25 Camera ready: Fri Mar 11 ROUND 2: Submission deadline: Fri Apr 15, 2022 Author response: Sun Jun 12 - Wed Jun 15 Early Notification: Thu Jun 30 Submission of Revisions: Mon Aug 15 Final Notification: Thu Sep 1 Camera ready: Fri Sep 16 Authors of papers published in PACMPL(OOPSLA) will be invited to present their work at the SPLASH conference. In person attendance is not required, SPLASH will provide remote presentation options. ### Scope The OOPSLA issue of the Proceedings of the ACM on Programming Languages (PACMPL) welcomes papers focusing on all practical and theoretical investigations of programming languages, systems and environments. Papers may target any stage of software development, including requirements, modeling, prototyping, design, implementation, generation, analysis, verification, testing, evaluation, maintenance, and reuse of software systems. Contributions may include the development of new tools, techniques, principles, and evaluations. ### Review Process [new this year] PACMPL(OOPSLA) has two _rounds_ of reviewing. The final outcome of each round can be one of Accept, Revise or Reject. *Accept*: Accepted papers will appear at the next PACMPL(OOPSLA). *Revise*: Papers in this category are invited to submit a revision to the _next round_ of submissions with a specific set of expectations to be met. When authors resubmit, they should clearly explain how the revisions address the comments of the reviewers. The revised paper will be re-evaluated, and either accepted or rejected. Resubmitted papers will retain the same reviewers throughout the process. *Reject*: Rejected papers will not be included at the next PACMPL(OOPSLA). Papers in this category are not guaranteed a review if resubmitted less than one year from the date of original submission. A paper will be judged to be a _resubmission_ if it is substantially similar to the original submission. The judgment that a paper is a resubmission of the same work is at the discretion of the Chairs. Each _round_ of reviewing consists of two _phases_. The first phase evaluates the papers and results in an early notification of Reject, Revise, or Conditional Accept. During the first phase, authors will be able to read their reviews and respond to them. The second phase is restricted to conditionally accepted papers. Authors must make a set of mandatory revisions. The second phase assesses whether the required revisions have been addressed. The outcome can be Accept, Revise or Reject. ### Submissions Submitted papers must be at most **23 pages** in 10 point font. There is no page limit on references. No appendices are allowed on the main paper, instead authors can upload supplementary material with no page or content restrictions, but reviewers may choose to ignore it. Submissions must adhere to the ?ACM Small? template available from [the ACM](http://www.acm.org/publications/authors/submissions). Papers are expected to use author-year citations. Author-year citations may be used as either a noun phrase, such as ?The lambda calculus was originally conceived by Church (1932)?, or a parenthetic phase, such as ?The lambda calculus (Church 1932) was intended as a foundation for mathematics?. PACMPL uses double-blind reviewing. Authors? identities are only revealed if a paper is accepted. Papers must 1. omit author names and institutions, 2. use the third person when referencing your work, 3. anonymise supplementary material. Nothing should be done in the name of anonymity that weakens the submission; see the DBR FAQ. When in doubt, contact the Review Committee Chairs. Papers must describe unpublished work that is not currently submitted for publication elsewhere as described by [SIGPLAN?s Republication Policy](http://www.sigplan.org/Resources/Policies/Republication). Submitters should also be aware of [ACM?s Policy and Procedures on Plagiarism](http://www.acm.org/publications/policies/plagiarism_policy). Submissions are expected to comply with the [ACM Policies for Authorship](https://www.acm.org/publications/authors/information-for-authors). ### Artifacts Authors should indicate with their initial submission if an artifact exists, describe its nature and limitations, and indicate if it will be submitted for evaluation. Accepted papers that fail to provide an artifact will be requested to explain the reason they cannot support replication. It is understood that some papers have no artifacts. ### Publication PACMPL is a Gold Open Access journal, all papers will be freely available to the public. Authors can voluntarily cover the article processing charge ($400), but payment is not required. The official publication date is the date the journal are made available in the ACM Digital Library. The journal issue and associated papers may be published up to two weeks prior to the first day of the conference. ### Review Committee Chairs: Amal Ahmed (Northeastern University) Jan Vitek (Northeastern University and Czech Technical University) ### Additional Information Consult FAQ in Call for Papers at: https://2022.splashcon.org/track/splash-2022-oopsla -------------- next part -------------- An HTML attachment was scrubbed... URL: From julien.signoles at cea.fr Thu Aug 5 10:28:18 2021 From: julien.signoles at cea.fr (Julien Signoles) Date: Thu, 5 Aug 2021 16:28:18 +0200 Subject: [TYPES/announce] 3 open positions (2 postdoc, 1 PhD) on runtime verification at CEA LIST, France Message-ID: <2b6178c4-ffe3-ea20-9479-d1cc29d35493@cea.fr> Dear all, The Software Safety and Security Lab at CEA LIST (Universit? Paris-Saclay, France) is opening 2 postdoc and 1 PhD positions in the area of runtime verification for code safety and security: - postdoc: Designing Compilation Techniques for Improving Efficiency of E-ACSL, a Runtime Assertion Checker for C Programs ??? ??? http://julien.signoles.free.fr/positions/postdoc-eacsl.pdf - postdoc: Control Flow Integrity for Remote Attestation ??? ??? http://julien.signoles.free.fr/positions/postdoc-cfi.pdf - PhD: Outline Runtime Assertion Checking ??? ??? http://julien.signoles.free.fr/positions/phd-outline-rac.pdf The candidates will: - solve challenging research problems; - implement their results in Frama-C, an industrial-strength open-source framework for analyses of C code; - evaluate their solutions on concrete benchmarks or/and use cases; - publish their results in international conferences and journals. Requirements vary from one position to another, but strong knowledge in at least one of the following areas is always appreciated: - programming: OCaml and C, semantics of programming languages, ... - formal verification: runtime verification, static analysis, ... - compilation: code generation, program transformation, type system, ... Interested applicants should send a CV and a motivation letter to Julien Signoles (julien dot signoles at cea dot fr) as soon as possible. Best regards, Julien Signoles -- Researcher-engineer | Scientific advisor CEA LIST, Software Safety and Security Lab | Department of Software and System Engineering Julien.Signoles at cea.fr | tel:(+33)1.69.08.00.18 From ifl21.publicity at gmail.com Thu Aug 5 16:53:41 2021 From: ifl21.publicity at gmail.com (Pieter Koopman) Date: Thu, 5 Aug 2021 16:53:41 -0400 Subject: [TYPES/announce] IFL'21 Final call for papers Message-ID: ================================================================================ IFL 2021 33rd Symposium on Implementation and Application of Functional Languages venue: online 1 - 3 September 2021 https://ifl21.cs.ru.nl ================================================================================ Note: - We do accept extended abstracts for presentation - Submission is open - Registration is open Scope The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2021 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. Industrial track and topics of interest This year's edition of IFL explicitly solicits original work concerning *applications* of functional programming in industry and academia. These contributions will be reviewed by experts with an industrial background. Topics of interest to IFL include, but are not limited to: * language concepts * type systems, type checking, type inferencing * compilation techniques * staged compilation * run-time function specialisation * run-time code generation * partial evaluation * (abstract) interpretation * meta-programming * generic programming * automatic program generation * array processing * concurrent/parallel programming * concurrent/parallel program execution * embedded systems * web applications * (embedded) domain-specific languages * security * novel memory management techniques * run-time profiling performance measurements * debugging and tracing * testing and proofing * virtual/abstract machine architectures * validation, verification of functional programs * tools and programming techniques * applications of functional programming in the industry, including ** functional programming techniques for large applications ** successes of the application functional programming ** challenges for functional programming encountered ** any topic related to the application of functional programming that is interesting for the IFL community Post-symposium peer-review Following IFL tradition, IFL 2021 will use a post-symposium review process to produce the formal proceedings. Before the symposium authors submit draft papers. These draft papers will be screened by the program chairs to make sure that they are within the scope of IFL. The draft papers will be made available to all participants at the symposium. Each draft paper is presented by one of the authors at the symposium. After the symposium every presenter is invited to submit a full paper, incorporating feedback from discussions at the symposium. Work submitted to IFL may not be simultaneously submitted to other venues; submissions must adhere to ACM SIGPLAN's republication policy. The program committee will evaluate these submissions according to their correctness, novelty, originality, relevance, significance, and clarity, and will thereby determine whether the paper is accepted or rejected for the formal proceedings. We plan to publish these proceedings in the International Conference Proceedings Series of the ACM Digital Library, as in previous years. Moreover, the proceedings will also be made publicly available as open access. Important dates Submission deadline of draft papers: 17 August 2021 Notification of acceptance for presentation: 19 August 2021 Registration deadline: 30 August 2021 IFL Symposium: 1-3 September 2021 Submission of papers for proceedings: 6 December 2021 Notification of acceptance: 3 February 2022 Camera-ready version: 15 March 2022 Submission details All contributions must be written in English. Papers must use the ACM two columns conference format, which can be found at: http://www.acm.org/publications/proceedings-template . (For LaTeX users, start your document with \documentclass[format=sigconf]{acmart}.) Note that this format has a rather long but limited list of packages that can be used. Please make sure that your document adheres to this list. The submission Web page for IFL21 is https://easychair.org/conferences/?conf=ifl21 . Peter Landin Prize The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honoured article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. Organisation IFL 2021 Chairs: Pieter Koopman and Peter Achten, Radboud University, The Netherlands IFL Publicity chair: Pieter Koopman, Radboud University, The Netherlands PC: Peter Achten (co-chair) - Radboud University, Netherlands Thomas van Binsbergen - University of Amsterdam, Netherlands Edwin Brady - University of St. Andrews, Scotland Laura Castro - University of A Coru?a, Spain Youyou Cong - Tokyo Institute of Technology, Japan Olaf Chitil - University of Kent, England Andy Gill - University of Kansas, USA Clemens Grelck - University of Amsterdam, Netherlands John Hughes - Chalmers University, Sweden Pieter Koopman (co-chair) - Radboud University, Netherlands Cynthia Kop - Radboud University, Netherlands Jay McCarthey - University of Massachussetts Lowell, USA Neil Mitchell - Facebook, England Jan De Muijnck-Hughes - Glasgow University, Scotland Keiko Nakata - SAP Innovation Center Potsdam, Germany Jurri?n Stutterheim - Standard Chartered, Singapore Simon Thompson - University of Kent, England Melinda T?th - E?tvos Lor?nd University, Hungary Phil Trinder - Glasgow University, Scotland Meng Wang - University of Bristol, England Vikt?ria Zs?k - E?tvos Lor?nd University, Hungary Virtual symposium Because of the Covid-19 pandemic, this year IFL 2021 will be an online event, consisting of paper presentations, discussions and virtual social gatherings. Registered participants can take part from anywhere in the world. Registration Please use the link below to register for IFL 2021: https://docs.google.com/forms/d/e/1FAIpQLSdMFjo-GumKjk4i7szs7n4DhWqKt96t8ofIqshfQFrf4jnvsA/viewform?usp=sf_link Thanks to the sponsors and the support of the Radboud university registration is free of charge. [image: beacon] -------------- next part -------------- An HTML attachment was scrubbed... URL: From victor.perez at imdea.org Fri Aug 6 08:26:02 2021 From: victor.perez at imdea.org (Victor Perez) Date: Fri, 6 Aug 2021 14:26:02 +0200 Subject: [TYPES/announce] Call for Workshops - FLoC 2022 Message-ID: <5372f7d6-825a-7b03-9c08-ca99bcfeb519@imdea.org> Second Call for Workshops- FLoC 2022 ? The 2022 Federated Logic Conference July 31 - August 12, 2022 Haifa, Israel http://www.floc2022.org/ CALL FOR WORKSHOPS The Eighth Federated Logic Conference (FLoC 2022) will host the following ten conferences and affiliated workshops. LICS (37th Annual ACM/IEEE Symposium on Logic in Computer Science) http://lics.rwth-aachen.de/ Workshop chair: Frederic Blanqui Frederic.Blanqui at inria.fr FSCD (7th International Conference on Formal Structures for Computation and Deduction) http://fscd-conference.org/ Workshop chair: Nachum Dershowitz nachumd at tau.ac.il ITP (13th International Conference on Interactive Theorem Proving) https://itp-conference.github.io/ Workshop chair: Cyril Cohen cyril.cohen at inria.fr IJCAR (International Joint Conference on Automated Reasoning) http://www.ijcar.org Workshop chairs: Simon Robillard simon.robillard at imt-atlantique.fr Sophie Tourret stourret at mpi-inf.mpg.de CSF (35th IEEE Computer Security Foundations Symposium) http://www.ieee-security.org/CSFWweb/ Workshop chair: Musard Balliu musard at kth.se CAV (34th International Conference on Computer Aided Verification) http://i-cav.org/ Workshop chair: TBD KR (19th International Conference on Principles of Knowledge Representation and Reasoning) http://www.kr.org/ Workshop chair: Stefan Borgwardt stefan.borgwardt at tu-dresden.de ICLP (38th International Conference on Logic Programming) https://www.cs.nmsu.edu/ALP/conferences/ Workshop chair: Daniela Inclezan inclezd at miamioh.edu SAT (25th International Conference on Theory and Applications of Satisfiability Testing) http://www.satisfiability.org Workshop chair: Alexander Nadel alexander.nadel at intel.com CP (25th International Conference on Principles and Practice of Constraint Programming) http://a4cp.org/events/cp-conference-series Workshop chair: TBD SUBMISSION OF WORKSHOP PROPOSALS Researchers and practitioners are invited to submit proposals for workshops on topics in the field of computer science, related to logic in the broad sense. Each workshop proposal must indicate one affiliated conference of FLoC 2022. It is strongly suggested that prospective workshop organizers contact the relevant conference workshop chair before submitting a proposal. Each proposal should consist of the following two parts. 1) A short scientific justification of the proposed topic, its significance, and the particular benefits of the workshop to the community, as well as a list of previous or related workshops (if relevant). 2) An organisational part including: - contact information for the workshop organizers; - proposed affiliated conference; - estimate of the number of workshop participants (please note that small workshops, i.e., of less than ~13 participants, will likely be cancelled or merged); - proposed format and agenda (e.g. paper presentations, tutorials, demo sessions, etc.); - potential invited speakers (note that expenses of workshop invited speakers are not covered by FLoC); - procedures for selecting papers and participants; - plans for dissemination, if any (e.g. a journal special issue); - duration (which may vary from one day to two days); - preferred period (pre or post FLoC); - virtual/hybrid backup plans (including platform preference). The FLoC Organizing Committee will determine the final list of accepted workshops based on the recommendations from the Workshop Chairs of the hosting conferences and availability of space and facilities. Proposals should be submitted through EasyChair: https://easychair.org/conferences/?conf=floc2022workshops Please see the Workshop Guidelines page: https://floc2022.org/workshops/ for further details and FAQ. IMPORTANT DATES Submission of workshop proposals deadline: September 27, 2021 (note extended deadline) Notification: November 1, 2021 Pre-FLoC workshops: Sunday & Monday, July 31?August 1, 2022 (note corrected dates) Post-FLoC workshops: Thursday & Friday, August 11-12, 2022 CONTACT INFORMATION Questions regarding proposals should be sent to the workshop chairs of the proposed affiliated conference. General questions should be sent to: shaull at technion.ac.il GuillermoAlberto.Perez at uantwerpen.be FLoC 2022 WORKSHOP CHAIRS Shaull Almagor Guillermo A. Perez From wies at cs.nyu.edu Mon Aug 9 14:47:33 2021 From: wies at cs.nyu.edu (Thomas Wies) Date: Mon, 9 Aug 2021 14:47:33 -0400 Subject: [TYPES/announce] Call for Papers: VMCAI 2022 Message-ID: <9c2d0fb3-4ace-79ac-8091-8c6b7acf21e0@cs.nyu.edu> Call for Papers [Apologies for multiple copies of this announcement] ******************************************************************************* CALL FOR PAPERS 23rd International Conference on Verification, Model Checking, and Abstract Interpretation VMCAI 2022 January 16-18, 2022 https://urldefense.com/v3/__https://popl22.sigplan.org/home/VMCAI-2022__;!!IBzWLUs!G-t6f2vig9M0Kz-NC6XPoLwn_cVfNSUUdV24GHgU79cCG_WIWXdkZC33ibHGYkSv5k2Jj7WS-9gdeA$ ******************************************************************************* *Call for Papers* VMCAI 2022 is the 23rd International Conference on Verification, Model Checking, and Abstract Interpretation. The conference will be held on January 16-18, 2022, in Philadelphia, PA, United States. VMCAI provides a forum for researchers from the communities of Verification, Model Checking, and Abstract Interpretation, facilitating interaction, cross-fertilization, and advancement of hybrid methods that combine these and related areas. *Scope* The program of VMCAI 2022 will consist of refereed research papers as well as invited lectures and tutorials. Research contributions can report new results as well as experimental evaluations and comparisons of existing techniques. Topics include, but are not limited to: Program Verification Model Checking Abstract Interpretation Abstract Domains Program Synthesis Static Analysis Type Systems Deductive Methods Program Logics First-Order Theories Decision Procedures Interpolation Horn Clause Solving Program Certification Separation Logic Probabilistic Programming and Analysis Error Diagnosis Detection of Bugs and Security Vulnerabilities Program Transformations Hybrid and Cyber-physical Systems Concurrent and distributed Systems Analysis of numerical properties Analysis of smart contracts Analysis of neural networks Case Studies on all of the above topics Submissions can address any programming paradigm, including concurrent, constraint, functional, imperative, logic, and object-oriented programming. *Important Dates AoE (UTC-12)* September 2th, 2021: Paper submission October 7th, 2021: Notification November 15th, 2021: Camera-ready version due Conference Submission Link https://urldefense.com/v3/__https://easychair.org/conferences/?conf=vmcai2022__;!!IBzWLUs!G-t6f2vig9M0Kz-NC6XPoLwn_cVfNSUUdV24GHgU79cCG_WIWXdkZC33ibHGYkSv5k2Jj7XgsyKl6g$ *Submissions* Submissions are required to follow Springer's LNCS format. The page limit depends on the paper's category (see below). In each category, additional material beyond the page limit may be placed in a clearly marked appendix, to be read at the discretion of the reviewers and to be omitted in the final version. Formatting style files and further guidelines for formatting can be found at the Springer website: https://urldefense.com/v3/__https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines__;!!IBzWLUs!G-t6f2vig9M0Kz-NC6XPoLwn_cVfNSUUdV24GHgU79cCG_WIWXdkZC33ibHGYkSv5k2Jj7UiPTYSwg$ . Submission link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=vmcai2022__;!!IBzWLUs!G-t6f2vig9M0Kz-NC6XPoLwn_cVfNSUUdV24GHgU79cCG_WIWXdkZC33ibHGYkSv5k2Jj7XgsyKl6g$ Accepted papers will be published in Springer's Lecture Notes in Computer Science series. There will be three categories of papers: regular papers, tool papers and case studies. Papers in each category have a different page limit and will be evaluated differently. Regular papers clearly identify and justify an advance to the field of verification, abstract interpretation, or model checking. Where applicable, they are supported by experimental validation. Regular papers are restricted to 20 pages in LNCS format, not counting references. Tool papers present a new tool, a new tool component, or novel extensions to an existing tool. They should provide a short description of the theoretical foundations with relevant citations, and emphasize the design and implementation concerns, including software architecture and core data structures. A regular tool paper should give a clear account of the tool's functionality, discuss the tool's practical capabilities with reference to the type and size of problems it can handle, describe experience with realistic case studies, and where applicable, provide a rigorous experimental evaluation. Papers that present extensions to existing tools should clearly focus on the improvements or extensions with respect to previously published versions of the tool, preferably substantiated by data on enhancements in terms of resources and capabilities. Authors are strongly encouraged to make their tools publicly available and submit an artifact. Tool papers are restricted to 12 pages in LNCS format, not counting references. Case studies are expected to describe the use of verification, model checking, and abstract interpretation techniques in new application domains or industrial settings. Papers in this category do not necessarily need to present original research results but are expected to contain novel applications of formal methods techniques as well as an evaluation of these techniques in the chosen application domain. Such papers are encouraged to discuss the unique challenges of transferring research ideas to a real-world setting and reflect on any lessons learned from this technology transfer experience. Case study papers are restricted to 20 pages in LNCS format, not counting references.(Shorter case study papers are also welcome.) *Artifacts* VMCAI 2022 allows authors to submit an artifact along with the paper. Artifacts are any additional material that substantiates the claims made in the paper, and ideally makes them fully replicable. Submitting an artifact is encouraged but not required. Artifact submissions are due one week after the paper submission deadline. The artifact will be evaluated in parallel with the submission by the artifact evaluation committee (AEC). The AEC will read the paper and evaluate the artifact on the following criteria: - consistency with and replicability of results in the paper, - completeness, - documentation, and - ease of use. More information will be available on the conference webpage: https://urldefense.com/v3/__https://popl22.sigplan.org/home/VMCAI-2022__;!!IBzWLUs!G-t6f2vig9M0Kz-NC6XPoLwn_cVfNSUUdV24GHgU79cCG_WIWXdkZC33ibHGYkSv5k2Jj7WS-9gdeA$ *Invited Speakers* - Isil Dillig, UT Austin, United States - Javier Esparza, TU Munich, Germany - Thomas A. Henzinger, IST Austria *Organizing Committee* Program Chairs: - Bernd Finkbeiner, CISPA Helmholtz Center for Information Security, Germany - Thomas Wies, New York University, United States Artifact Evaluation Chair: - Mark Santolucito, Barnard College, Columbia University, United States Publicity Chair: - Ruzica Piskac, Yale University, United States From stourret at mpi-inf.mpg.de Wed Aug 11 02:59:10 2021 From: stourret at mpi-inf.mpg.de (Sophie Tourret) Date: Wed, 11 Aug 2021 08:59:10 +0200 Subject: [TYPES/announce] IJCAR 2022 - Call for Workshops, Tutorials and Competitions In-Reply-To: References: <1c179272-7300-62f8-8fcb-3ccdeb1d1c23@mpi-inf.mpg.de> <47475eb3-94e1-b720-10a2-f887b6b364f9@mpi-inf.mpg.de> <8f064fdf-f283-fb9e-5bc5-b5ad6bc8ef57@mpi-inf.mpg.de> Message-ID: <32a60247-ef72-3c3d-e816-553c233d970f@mpi-inf.mpg.de> IJCAR 2022: call for workshops, tutorials and competitions 11th International Joint Conference on Automated Reasoning ? IJCAR 2022 August 7?12, 2022, Haifa, Israel, part of FLoC 2022, https://urldefense.com/v3/__https://easychair.org/smart-program/IJCAR2022/__;!!IBzWLUs!HWHXfmpj79DZXPcbxITnF8rY0MUFjg4jN8X7nBxv6ekjJh0X5mRnd0qNWAk5NhJdmRJQ9_eoQJ51Tg$ The International Joint Conference on Automated Reasoning (IJCAR 2022), part of the Eighth Federated Logic Conference (FLoC 2022), is soliciting proposals for workshops, tutorials and competitions. Researchers are invited to submit proposals on any topic related to automated reasoning, from theoretical foundations to tools and applications. The workshops and tutorials will take place before and after the FLoC conferences: * Sunday & Monday, July 31?August 1, 2022, and * Thursday & Friday, August 11?12, 2022. (Note that IJCAR will take place on August 7-10, 2022. We recommend that you plan your event on the second period, and indicate it in the proposal.) Proposals for all conferences affiliated to FLoC, including IJCAR, will be reviewed jointly. Please make sure that the proposal indicates an affiliation to IJCAR. Proposals must be submitted before September 27, 2021. For further details about the submission process and the expected content of workshop and tutorial proposals, seehttps://floc2022.org/workshops/ . Competition proposals should be sent directly to Yoni Zohar atyoni206 at gmail.com . From adamc at csail.mit.edu Wed Aug 11 12:56:53 2021 From: adamc at csail.mit.edu (Adam Chlipala) Date: Wed, 11 Aug 2021 12:56:53 -0400 Subject: [TYPES/announce] A book on program proof in Coq [revisited] Message-ID: <4b91b5f9-45f2-3852-d5bc-2bc7c9eefc21@csail.mit.edu> I wrote to this list about five years ago to announce /Formal Reasoning About Programs/ (FRAP), an online book I've been developing to teach students some of the most classic approaches in program verification, using the Coq proof assistant.? In the mean time, I've used the book in four more editions of the class I teach with it, and I'm glad to report that the materials (including homework assignments) now seem to be in good shape for others to pick up and use at their institutions. I'd be glad to correspond with anyone who's curious about perhaps offering a related course. What's different about FRAP as compared to e.g. /Software Foundations/, the alternative I know best? _*Cons*_ * From students, FRAP requires the levels of mathematical & programming sophistication that we associate with undergraduates just about finished with their CS degrees and headed to PhDs. Students really do already need to be familiar with mathematical rigor and proof by induction, whereas /Software Foundations/ does a good job of reinforcing those topics for students who never really "got" them the first time around (doing proofs without machine checking). _*Pros*_ * As a result, we can get a lot further in sophistication of program-reasoning techniques.? For instance, I usually spend the last month or so of class on concurrency.? We look at shared-memory concurrency via model checking (with partial-order reduction) and concurrent separation logic (with shared mutable, linked data structures), and we look at message-passing concurrency via process calculus and session types.? Proofs are highly automated throughout, at the same time as all reasoning techniques are proved from first principles. * I try to highlight commonalities across techniques that are rarely called out elsewhere.? For instance, about 3/4 of the techniques we look at (after the first month or so of class) are instances of finding and proving strengthened invariants for transition systems.? Then the rest are instances of finding simulation relations for pairs of labeled transition systems, and there is a clear family resemblance here to invariant-finding.? Common approaches to abstraction and modularity then apply throughout. * We work up more quickly to more realistic programming languages, using a trick I call "mixed embeddings" that is somewhat similar to how Haskell imports side effects via monads.? We can add arbitrary side effects to Coq's core functional language, which lets us write and verify pretty sophisticated programs without needing to formalize the purely functional constructs we rely on.? At the same time, we can do most of the usual metatheory without compromising on rigor.? I have a functional-pearl paper on this part at ICFP in about two weeks , and I'll be available in the associated Q&A sessions. I'm glad to discuss by whatever medium with folks who might want to make use of these materials. -------------- next part -------------- An HTML attachment was scrubbed... URL: From xnningxie at gmail.com Thu Aug 12 00:29:07 2021 From: xnningxie at gmail.com (Ningning Xie) Date: Thu, 12 Aug 2021 00:29:07 -0400 Subject: [TYPES/announce] Call for Lightning Talks: Haskell Implementors' Workshop @ ICFP'21 Message-ID: Call for Lightning Talks ACM SIGPLAN Haskell Implementors' Workshop https://urldefense.com/v3/__https://icfp21.sigplan.org/home/hiw-2021__;!!IBzWLUs!DTL9dBI349ispEzuuCzPEO-lW1UI-PdQKd2NOKxHKORgS1nNtaHk7_odwM_KH2TpkR4-txda11OygQ$ Virtual, 22 Aug, 2021 Co-located with ICFP 2021 https://urldefense.com/v3/__https://icfp21.sigplan.org/__;!!IBzWLUs!DTL9dBI349ispEzuuCzPEO-lW1UI-PdQKd2NOKxHKORgS1nNtaHk7_odwM_KH2TpkR4-txcYMuSzqQ$ Important dates --------------- Deadline: Thursday, 19 Aug, 2021 (or until slots are full) Workshop: Sunday, 22 Aug, 2021 The 13th Haskell Implementors' Workshop is to be held alongside ICFP 2021 this year virtually. It is a forum for people involved in the design and development of Haskell implementations, tools, libraries, and supporting infrastructure, to share their work and discuss future directions and collaborations with others. We will have a number of slots for lightning talks. Lightning talks will be ~7 minutes and are scheduled on the day of the workshop. Suggested topics for lightning talks are to present a single idea, a work-in-progress project, a problem to intrigue and perplex Haskell implementors, or simply to ask for feedback and collaborators. Lightning talks are proposed by submitting a title and an abstract. Submissions will not be part of the peer-review process. Notification of acceptance will be continuous until all slots are full. Submissions should be made via Google form: https://urldefense.com/v3/__https://forms.gle/BmUSyWWTXt1AMTec8__;!!IBzWLUs!DTL9dBI349ispEzuuCzPEO-lW1UI-PdQKd2NOKxHKORgS1nNtaHk7_odwM_KH2TpkR4-txfNtq96Jw$ Accepted lightning talks will be posted on the workshop?s website. Scope and target audience ------------------------- The Implementors' Workshop is an ideal place to describe a Haskell extension, describe works-in-progress, demo a new Haskell-related tool, or even propose future lines of Haskell development. Members of the wider Haskell community encouraged to attend the workshop -- we need your feedback to keep the Haskell ecosystem thriving. Students working with Haskell are specially encouraged to share their work. The scope covers any of the following topics. There may be some topics that people feel we've missed, so by all means submit a proposal even if it doesn't fit exactly into one of these buckets: * Compilation techniques * Language features and extensions * Type system implementation * Concurrency and parallelism: language design and implementation * Performance, optimisation and benchmarking * Virtual machines and run-time systems * Libraries and tools for development or deployment Logistics --------- Due to the on-going COVID-19 situation, ICFP (and, consequently, HIW) will be held remotely this year. However, the organizers are still working hard to provide for a great workshop experience. While we are sad that this year will lack the robust hallway track that is often the highlight of HIW, we believe that this remote workshop presents a unique opportunity to include more of the Haskell community in our discussion and explore new modes of communicating with our colleagues. We hope that you will join us in making this HIW as vibrant as any other. Contact ------- * Ningning Xie -------------- next part -------------- An HTML attachment was scrubbed... URL: From cong at c.titech.ac.jp Thu Aug 12 08:00:07 2021 From: cong at c.titech.ac.jp (Youyou Cong) Date: Thu, 12 Aug 2021 21:00:07 +0900 Subject: [TYPES/announce] PEPM 2022 - First Call for Papers Message-ID: -- CALL FOR PAPERS -- ACM SIGPLAN Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM) 2022 =============================================================================== * Website : https://urldefense.com/v3/__https://popl22.sigplan.org/home/pepm-2022__;!!IBzWLUs!BoVxzYG5js7a1SGXTeoHtcCXhzSYhcxa2U0e6_5af9mGQsL3YH8aO3UTYe02WVhzLbbv5IxN2mS_Kw$ * Time : 17th--18th January 2022 * Place : Online or Philadelphia, Pennsylvania, United States (co-located with POPL 2022) **Note that the workshop will be held as a physical, virtual, or hybrid physical/virtual meeting in line with POPL 2022. Details to appear.** The ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) has a history going back to 1991 and has been co-located with POPL every year since 2006. It originated with the discoveries of useful automated techniques for evaluating programs with only partial input. Over the years, the scope of PEPM has expanded to include a variety of research areas centred around the theme of semantics-based program manipulation ? the systematic exploitation of treating programs not only as subjects to black-box execution but also as data structures that can be generated, analysed, and transformed while establishing or maintaining important semantic properties. Scope ----- In addition to the traditional PEPM topics (see below), PEPM 2022 welcomes submissions in new domains, in particular: * Semantics based and machine-learning based program synthesis and program optimisation. * Modelling, analysis, and transformation techniques for distributed and concurrent protocols and programs, such as session types, linear types, and contract specifications. More generally, topics of interest for PEPM 2022 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, embedded and resource-limited computation, and security. This list of categories is not exhaustive, and we encourage submissions describing new theories and applications related to semantics-based program manipulation in general. If you have a question as to whether a potential submission is within the scope of the workshop, please contact the programme co-chairs, Zena M. Ariola and Youyou Cong . Submission categories and guidelines ------------------------------------ Two kinds of submissions will be accepted: * Regular Research Papers should describe new results, and will be judged on originality, correctness, significance, and clarity. Regular research papers must not exceed 12 pages. * Short Papers may include tool demonstrations and presentations of exciting if not fully polished research, and of interesting academic, industrial, and open-source applications that are new or unfamiliar. Short papers must not exceed 6 pages. References and appendices are not included in page limits. Appendices may not be read by reviewers. Both kinds of submissions should be typeset using the two-column ?sigplan? sub-format of the new ?acmart? format available at: https://urldefense.com/v3/__http://sigplan.org/Resources/Author/__;!!IBzWLUs!BoVxzYG5js7a1SGXTeoHtcCXhzSYhcxa2U0e6_5af9mGQsL3YH8aO3UTYe02WVhzLbbv5IwPfgP3IA$ and submitted electronically via HotCRP: https://urldefense.com/v3/__https://pepm22.hotcrp.com/__;!!IBzWLUs!BoVxzYG5js7a1SGXTeoHtcCXhzSYhcxa2U0e6_5af9mGQsL3YH8aO3UTYe02WVhzLbbv5IwBrPLidw$ Reviewing will be single-blind. Submissions are welcome from PC members (except the two co-chairs). Accepted regular research papers will appear in formal proceedings published by ACM, and be included in the ACM Digital Library. Accepted short papers do not constitute formal publications and will not appear in the proceedings. At least one author of each accepted contribution must attend the workshop (physically or virtually) and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Important dates --------------- * Paper submission deadline : **Thursday 7th October 2021 (AoE)** * Author notification : **Thursday 11th November 2021 (AoE)** * Workshop : **Monday 17th January 2022 to Tuesday 18th January 2022** Best paper award ---------------- PEPM 2022 continues the tradition of a Best Paper award. The winner will be announced at the workshop. Programme committee ------------------- * Chairs: Zena M. Ariola (University of Oregon, US) Youyou Cong (Tokyo Institute of Technology, Japan) * Maria Alpuente (U.P. Valencia, Spain) * William J. Bowman (UBC, Canada) * Jonathan Immanuel Brachth?user (EPFL, Switzerland) * William E. Byrd (University of Alabama at Birmingham, US) * Robert Gl?ck (University of Copenhagen, Denmark) * Zhenjiang Hu (Peking University, China) * Yukiyoshi Kameyama (University of Tsukuba, Japan) * Gabriele Keller (Utrecht University, Netherlands) * Julia Lawall (INRIA, France) * Y. Annie Liu (Stony Brook University, US) * Keiko Nakata (SAP Innovation Center Potsdam, Germany) * Antonina Nepeivoda (Program Systems Institute of RAS, Russia) * Zoe Paraskevopoulou (Northeastern University, US) * Yann R?gis-Gianas (Nomadic Labs, France) * Tiark Rompf (Purdue University, US) * KC Sivaramakrishnan (IIT Madras, India) * Dimitrios Vytiniotis (DeepMind, UK) * Beta Ziliani (FAMAF, UNC and Manas.Tech, Argentina) -------------- next part -------------- An HTML attachment was scrubbed... URL: From gabriel.scherer at gmail.com Fri Aug 13 09:55:16 2021 From: gabriel.scherer at gmail.com (Gabriel Scherer) Date: Fri, 13 Aug 2021 15:55:16 +0200 Subject: [TYPES/announce] [meta] URL rewriting notice Message-ID: Dear types-announce list, UPenn, who has been generously hosting this mailing-list (and types-list) since 2006, has just setup an email-processing system that rewrites URLs included in all email received by the university, including their mailing-list services, "protecting" them by turning them into a reference to a third-party service (ProofPoint / urldefense) that should redirect to the intended URL after some unknown security-inspired procedures have been applied -- or block access because someone's filter is wrong. We are in touch with the administrators to try to disable this transformation, but in the meantime I decided to keep forwarding the emails as usual to avoid disrupting the flow of announcements. Apologies in advance for the strange, modified URLs, and the inconvenience it may cause (mailing-list email being marked as spam due to failed DKIM verification, etc.). Best -------------- next part -------------- An HTML attachment was scrubbed... URL: From jonathan.protzenko at gmail.com Thu Aug 12 11:18:09 2021 From: jonathan.protzenko at gmail.com (Jonathan Protzenko) Date: Thu, 12 Aug 2021 08:18:09 -0700 Subject: [TYPES/announce] Call for participation: ML Family Workshop 2021 Message-ID: <661d2bf2-50ad-d12d-cfe2-66d2ccc5a4cc@gmail.com> We are happy to announce that the ML Family Workshop is back for its 2021 edition, which we will be held online on Thursday August 26th, in conjunction with ICFP 2021. We invite you to subscribe to, and attend the workshop, in addition to the main ICFP conference. We are thrilled to announce that Don Syme will give this year's keynote: "Narratives and Lessons from The Early History of F#". Please join us! The program features 14 exciting submissions, including 4 short talks. The workshop will be held online in the 6pm-3am time band (Seoul Time). Talks will be pre-recorded and uploaded online for those who cannot attend. * Program: https://urldefense.com/v3/__https://icfp21.sigplan.org/home/mlfamilyworkshop-2021*program__;Iw!!IBzWLUs!Fpan31ZidSzO3P85Zoa1muUb13bpMyI6x9uXMUZdW4NVIZjE9h76AKVVouGBH8kTu0_JrxmM8O9FLw$ * Keynote: https://urldefense.com/v3/__https://icfp21.sigplan.org/details/mlfamilyworkshop-2021-papers/15/Keynote-Narratives-and-Lessons-from-The-Early-History-of-F-__;!!IBzWLUs!Fpan31ZidSzO3P85Zoa1muUb13bpMyI6x9uXMUZdW4NVIZjE9h76AKVVouGBH8kTu0_JrxkjhoQRxw$ * ICFP home: https://urldefense.com/v3/__http://icfp21.sigplan.org/home__;!!IBzWLUs!Fpan31ZidSzO3P85Zoa1muUb13bpMyI6x9uXMUZdW4NVIZjE9h76AKVVouGBH8kTu0_Jrxlzwi6ILQ$ ## Program committee Danel Ahman (University of Ljubljana) Robert Atkey (University of Strathclyde) Fr?d?ric Bour (Tarides) Ezgi ?i?ek (Facebook London) Youyou Cong (Tokyo Institute of Technology) Richard A. Eisenberg (Tweag I/O) Martin Elsman (University of Copenhagen, Denmark) Ohad Kammar (University of Edinburgh) Naoki Kobayashi (University of Tokyo, Japan) Beno?t Montagu (Inria) Jonathan Protzenko (Microsoft Research) (Chair) Kristina Sojakova (INRIA Paris) Don Syme (Microsoft) Mat?as Toro (University of Chile) Katsuhiro Ueno (Tohoku University) From tristanj at bc.edu Thu Aug 12 12:21:35 2021 From: tristanj at bc.edu (Jean-Baptiste Tristan) Date: Thu, 12 Aug 2021 12:21:35 -0400 Subject: [TYPES/announce] Funded postdoc position in Formal Verified Compilation of Probabilistic Programming Languages at Boston College Message-ID: A postdoctoral position is available in the Computer Science department at Boston College under the supervision of Jean-BaptisteTristan and Joseph Tassarotti . The candidate will join our project on the formally verified compilation of probabilistic programs. The goal of the project is to use the Coq proof assistant to implement a compiler for the Stan programming language and prove that the generated inference algorithm converges to the distribution specified by the input program. Our project builds upon the CompCert compiler and compiles Stan programs with a succession of well-defined program transformations. Candidates are expected to participate in the generalization of existing transformations to more features of the Stan language, the design and implementation of new transformations, the definition of the operational semantics of the intermediate languages, and the proofs of semantics preservation. Successful candidates must be proficient in scientific writing and have a track record of expertise in at least one of the following topics: * Formal verification using interactive theorem provers * Semantics and compilation of programming languages * Probabilistic programming The position is available immediately, with a flexible starting date. It includes funds for travel to conferences and comes with no teaching load. Interested candidates should apply at this link and contact Jean-Baptiste Tristan and Joseph Tassarotti with a copy of their CV. -- Jean-Baptiste Tristan Associate Professor Computer Science Department Boston College -------------- next part -------------- An HTML attachment was scrubbed... URL: From Graham.Hutton at nottingham.ac.uk Mon Aug 16 06:20:33 2021 From: Graham.Hutton at nottingham.ac.uk (Graham Hutton) Date: Mon, 16 Aug 2021 10:20:33 +0000 Subject: [TYPES/announce] Assistant/Associate Professorships in Nottingham Message-ID: Dear all, As part of a strategic expansion, the School of Computer Science at the University of Nottingham is seeking to make multiple new appointments at the Assistant or Associate Professor level: https://urldefense.com/v3/__https://tinyurl.com/wruwpnpt__;!!IBzWLUs!AhMrnudKcNWprq8d7ivJoy1FZBrJVPYDZNALIVq73_7y_OGRY0RFWj0IGqDtQ58_NfCaH4Jfpf8TuQ$ https://urldefense.com/v3/__https://tinyurl.com/284svw4y__;!!IBzWLUs!AhMrnudKcNWprq8d7ivJoy1FZBrJVPYDZNALIVq73_7y_OGRY0RFWj0IGqDtQ58_NfCaH4I0N6S4Rw$ Applications in the area of the Functional Programming (FP) lab are strongly encouraged! The FP lab is keen to receive applications from candidates with an excellent publication record (e.g. papers in leading venues such as LICS, POPL, ICFP, JFP, TOPLAS, etc) and the ability to secure external funding to support their research. Further information about the FP lab is available from: https://urldefense.com/v3/__https://tinyurl.com/y2ekdkqa__;!!IBzWLUs!AhMrnudKcNWprq8d7ivJoy1FZBrJVPYDZNALIVq73_7y_OGRY0RFWj0IGqDtQ58_NfCaH4J5jOoiFA$ The deadline for applications is Monday 20th September 2021. The advert mentions some specific research areas, but the positions are open to applicants from any area of Computer Science. -- Graham Hutton and Thorsten Altenkirch This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law. From Simon.Gay at glasgow.ac.uk Mon Aug 16 07:33:50 2021 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Mon, 16 Aug 2021 12:33:50 +0100 Subject: [TYPES/announce] Academic job in Programming Language Foundations, University of Glasgow Message-ID: <26218906-e2c4-93fd-4baf-9bc62f8ec7ee@glasgow.ac.uk> University of Glasgow - School of Computing Science Lecturer/ Senior Lecturer/ Reader in Programming Language Foundations Salary: Grade 7 (Lecturer) ?35,845 - ?40,322 Grade 8 (Lecturer) ?44,045 - ?51,034 Grade 9 (Senior Lecturer / Reader) ?52,560 - ?59,135 per annum. The University of Glasgow, established in 1451, is a member of the UK's Russell Group of leading universities. The University is committed to enhancing its position as one of the world's great broad-based research-intensive universities. Applications for the post are welcome in the area of Programming Language Foundations. Research in this area is situated within the Formal Analysis, Theory and Algorithms (FATA) Section and the Programming Languages Theme (https://urldefense.com/v3/__http://www.gla.ac.uk/schools/computing/research/researchthemes/pl-theme/__;!!IBzWLUs!GRaKX9b4_HiLLGge8oOWfxclC_jy3OMPTz5Ouu2HoX6cOB9OW0QCrXQDyxvE5qu7pt8J52SEk1-dpg$ ) of the School of Computing Science. Current topics include programming language semantics and type systems, session types for concurrent and distributed systems, mechanised metatheory for programming languages, and quantum programming languages. A broader context is provided by collaboration with the Glasgow Systems Section (GLASS) on topics including actor languages, runtime systems, automatic parallelisation, and digital security by design. We also run the Programming Languages at University of Glasgow (PLUG) seminar series, participate in the Scottish Programming Languages Seminar (SPLS), contribute to the Scottish Programming Languages and Verification Summer School, and collaborate Europe-wide in the Behavioural API (BehAPI) network. The postholder will develop, lead and sustain research of international standard in Computing Science; contribute to teaching, assessment, project supervision and curriculum design at undergraduate and postgraduate levels; and participate in School management and organisation. For appointment at Reader you will have an outstanding track record of national and international distinction and leadership in research, including publications, income, and awards, bringing external recognition and distinction to yourself and the University. This position is equivalent to US tenure track Assistant or Associate Professor. For further details please visit: https://urldefense.com/v3/__https://www.flipsnack.com/UofGRecruitment/lslr-in-programming-language-foundations-063787.html__;!!IBzWLUs!GRaKX9b4_HiLLGge8oOWfxclC_jy3OMPTz5Ouu2HoX6cOB9OW0QCrXQDyxvE5qu7pt8J52Tgqq9sDA$ https://urldefense.com/v3/__https://www.jobs.ac.uk/job/CII151/lecturer-senior-lecturer-reader-in-programming-language-foundations__;!!IBzWLUs!GRaKX9b4_HiLLGge8oOWfxclC_jy3OMPTz5Ouu2HoX6cOB9OW0QCrXQDyxvE5qu7pt8J52Q6Wb9IUg$ We strongly endorse the principles of Athena SWAN, including a supportive and flexible working environment, with commitment from all levels of the organisation in promoting gender equity. We particularly welcome applications from women and other groups who are traditionally under-represented in Computing Science. From stevez at seas.upenn.edu Wed Aug 18 17:27:06 2021 From: stevez at seas.upenn.edu (Steve Zdancewic) Date: Wed, 18 Aug 2021 17:27:06 -0400 Subject: [TYPES/announce] Certified Programs and Proofs (CPP) 2022: Final Call for Papers Message-ID: <4f818968-e02a-299e-521d-dc3aaf7367aa@seas.upenn.edu> 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 2022 (https://urldefense.com/v3/__https://popl22.sigplan.org/home/CPP-2022__;!!IBzWLUs!DtBDesUocVvI0KJxdGT8lS21OcYmM42PRPhdG4b4uLfkWKELPA5aYUyQHNHsP9p4dj8$ ) will be held on 17-18 January 2022 and will be co-located with POPL 2022 in Philadelphia, Pennsylvania, United States. CPP 2022 is sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG. CPP 2022 will welcome contributions from all members of the community. The CPP 2022 organizers will strive to enable both in-person and remote participation, in cooperation with the POPL 2022 organizers. NEWS If the authors of a CPP 2022 accepted paper will be unable or unwilling to travel to the conference, the organizers can confirm that this will not affect the paper?s publication in the proceedings, and the authors will be able to upload recorded talks that will be made publicly available. IMPORTANT DATES * Abstract Submission Deadline: 16 September 2021 at 23:59 AoE (UTC-12h) * Paper Submission Deadline: 22 September 2021 at 23:59 AoE (UTC-12h) * Notification (tentative): 22 November 2021 * Camera Ready Deadline (tentative): 12 December 2021 * Conference: 17-18 January 2022 Deadlines expire at the end of the day, anywhere on earth. Abstract and submission deadlines are strict and there will be no extensions. DISTINGUISHED PAPER AWARDS Around 10% of the accepted papers at CPP 2022 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. 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. SUBMISSION GUIDELINES Prior to the paper submission deadline, the authors should upload their anonymized paper in PDF format through the HotCRP system at https://urldefense.com/v3/__https://cpp2022.hotcrp.com__;!!IBzWLUs!DtBDesUocVvI0KJxdGT8lS21OcYmM42PRPhdG4b4uLfkWKELPA5aYUyQHNHs8-hvWck$ 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 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 2022 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://urldefense.com/v3/__https://popl20.sigplan.org/track/POPL-2020-Research-Papers*Submission-and-Reviewing-FAQ__;Iw!!IBzWLUs!DtBDesUocVvI0KJxdGT8lS21OcYmM42PRPhdG4b4uLfkWKELPA5aYUyQHNHseMvit9g$ We strongly encourage the authors to provide any supplementary material that supports 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://urldefense.com/v3/__https://www.sigplan.org/Resources/Policies/Republication/__;!!IBzWLUs!DtBDesUocVvI0KJxdGT8lS21OcYmM42PRPhdG4b4uLfkWKELPA5aYUyQHNHskK93Bcs$ ) and the ACM Policy on Plagiarism (https://urldefense.com/v3/__https://www.acm.org/publications/policies/plagiarism__;!!IBzWLUs!DtBDesUocVvI0KJxdGT8lS21OcYmM42PRPhdG4b4uLfkWKELPA5aYUyQHNHsq444C5s$ ). 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 (possibly virtual) conference. PUBLICATION, COPYRIGHT AND OPEN ACCESS The CPP 2022 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 or HAL. 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 2022 proceedings will also be available via SIGPLAN OpenTOC (https://urldefense.com/v3/__http://www.sigplan.org/OpenTOC/*cpp__;Iw!!IBzWLUs!DtBDesUocVvI0KJxdGT8lS21OcYmM42PRPhdG4b4uLfkWKELPA5aYUyQHNHsMAhUWgk$ ). For ACM?s take on this, see their Copyright Policy (https://urldefense.com/v3/__http://www.acm.org/publications/policies/copyright-policy__;!!IBzWLUs!DtBDesUocVvI0KJxdGT8lS21OcYmM42PRPhdG4b4uLfkWKELPA5aYUyQHNHsOw_JuVs$ ) and Author Rights (https://urldefense.com/v3/__http://authors.acm.org/main.html__;!!IBzWLUs!DtBDesUocVvI0KJxdGT8lS21OcYmM42PRPhdG4b4uLfkWKELPA5aYUyQHNHsEFy0nQE$ ). PROGRAM COMMITTEE Andrei Popescu, University of Sheffield, United Kingdom (co-chair) Steve Zdancewic, University of Pennsylvania, United States (co-chair) Mohammad Abdulaziz, TU M?nchen, Germany Mauricio Ayala-Rinc?n, Universidade de Bras?lia, Brazil Andrej Bauer, University of Ljubljana, Slovenia Thomas Bauereiss, University of Cambridge, United Kingdom Yves Bertot, Inria and Universit? Cote d'Azur, France Lars Birkedal, Aarhus University, Denmark Sylvie Boldo, Inria and Universit? Paris-Saclay, France Qinxiang Cao, Shanghai Jiao Tong University, China ?velyne Contejean, Laboratoire M?thodes Formelles, CNRS, France Benjamin Delaware, Purdue University, United States Simon Foster, University of York, United Kingdom Alwyn Goodloe, NASA Langley Research Center, United States Arma?l Gu?neau, Aarhus University, Denmark John Harrison, Amazon Web Services, United States Joe Hendrix, Galois, Inc, United States Aquinas Hobor, National University of Singapore, Singapore Ralf Jung, MPI-SWS, Germany Cezary Kaliszyk, University of Innsbruck, Austria Jeehoon Kang, KAIST, South Korea Hongjin Liang, Nanjing University, China Gregory Malecha, BedRock Systems, Inc, United States Anders M?rtberg, Stockholm University, Sweden Toby Murray, University of Melbourne, Australia Zoe Paraskevopoulou , Northeastern University, United States Brigitte Pientka, McGill University, Canada Aseem Rastogi, Microsoft Research, India Bas Spitters, Aarhus University, Denmark Kathrin Stark, Princeton University, United States Hira Taqdees Syeda, Chalmers University of Technology, Sweden Joseph Tassarotti, Boston College, United States Laura Titolo, NIA/NASA LaRC, United States Sophie Tourret, Inria, France Dmitriy Traytel, University of Copenhagen, Denmark Floris van Doorn, Paris-Saclay University, France Freek Verbeek, Open University of The Netherlands, Netherlands Freek Wiedijk, Radboud Universiteit Nijmegen, Netherlands ORGANIZERS Lennart Beringer, Princeton University, United States (conference co-chair) Robbert Krebbers, Radboud University, Netherlands (conference co-chair) Andrei Popescu, University of Sheffield, United Kingdom (PC co-chair) Steve Zdancewic, University of Pennsylvania, United States (PC co-chair) CONTACT For any questions please contact the two PC chairs: Andrei Popescu Steve Zdancewic From cristi at ifi.uio.no Wed Aug 18 04:00:40 2021 From: cristi at ifi.uio.no (Christian Johansen) Date: Wed, 18 Aug 2021 10:00:40 +0200 Subject: [TYPES/announce] PhD position in Formal Methods for Security and Concurrency at NTNU (Norwegian University of Science and Technology) Message-ID: <211875f8-85f8-099b-2d6b-90bfb301963e@ifi.uio.no> We have a vacancy for a PhD researcher at the Systems Security Group in the Information Security Division of the Department of Information Security and Communication Technology at the Norwegian University of Science and Technology (NTNU) in the Gj?vik campus. * Deadline: 30 September * (Apply through the official announcement https://www.jobbnorge.no/en/available-jobs/job/209665/phd-candidate-in-formal-methods-for-security-and-concurrency ) The topic is generally placed at the intersection between security and concurrency with applications to many modern systems included under the term concurrency, such as distributed and communicating systems, multi-core or high-performance computing, or more generally systems of systems. The main focus of the topic will be on formal methods and tools applied to novel problems stemming from the combinations of security and highly complex concurrent systems. Depending on the inclinations and skills of the applicant, the work can include theoretical investigations as well as development and improvement of existing methods and tools for solving verification challenges in such modern applications; but the work can also include modelling and verification of real-world protocols pertaining to, e.g., IoT, Smart Grids, or Smart Contracts. Therefore, the research tasks can be anything from more theoretical, designing new formalisms and algorithms, to more practical, implementing modules, extensions, or new tools. If the work will go in a more theoretical direction, the candidate can expect to look into formalisms such as process algebras and their methods such as bisimulations, or into concurrency models and the challenges these bring to security, or into more mathematical topics including logics, relational algebras, automata, etc. If the work will go in a more practical direction, the candidate can expect to work with security verification tools such as Isabelle or Tamarin. * Contact: christian.johansen at ntnu.no * (for inquires about the position) Details follow. * Duties of the position * ? Work with formal tools such as Isabelle or Tamarin ? Develop formalisms/logics/algorithms for modelling and verification of security ? Apply formal methods to study novel problems at the intersection of security and modern concurrent systems ? Participate in teaching and supervision duties on topics related to the above * Required selection criteria * ? You must have a technically relevant background in Mathematics or Computer Science, with an advantage given by background in Security or Concurrent systems ? Your education must correspond to a five-year Norwegian degree programme, where 120 credits are obtained at master's level ? You must have a strong academic background from your previous studies and an average grade from the master's degree program, or equivalent education, which is equal to B or better compared with NTNU's grading scale. If you do not have letter grades from previous studies, you must have an equally good academic basis. If you have a weaker grade background, you may be assessed if you can document that you are particularly suitable for a PhD education (e.g., having long practical experience in relevant fields). ? Good grades in topics close to Theoretical Computer Science or Mathematics * Preferred selection criteria * ? Both Mathematics and Computer Science count as suitable backgrounds due to the generality and inclusiveness of the topic focused on formal methods. ? Background in Security and its applications is only secondary, because formal methods techniques is the more difficult part of the topic, whereas Security is the applications part. ? Excellent written and oral English language skills should be documented either through tests or through already produced works. ? Scandinavian language speakers have advantage due to their suitability for the teaching and supervision duties of the position. * Personal characteristics * ? Motivated for research with a curious character and inquisitive mind ? Hardworking and tenacious with a flair for detail and organization of knowledge ? Appreciative yet critical, always looking for the differences and similarities between concepts ? Good team and collaboration skills and appreciation for diversity of people and consideration for opposite views * We offer * ? exciting and stimulating tasks in a strong international academic environment ? an open and inclusive work environment with many opportunities for career development ? long-term stays abroad and collaboration opportunities with, e.g.: Gothenburg, Rennes, Sheffield, Warsaw, Luxembourg. ? a large number of possible industrial collaborators to provide you research results with test scenarios and innovation opportunities ? favourable terms in the Norwegian Public Service Pension Fund (https://www.spk.no/en/) ? employee benefits (https://innsida.ntnu.no/wiki/-/wiki/Norsk/Ansattegoder+og+fordeler) Salary and conditions As a PhD candidate (code 1017) you are normally paid from gross NOK 482 200 per annum before tax, depending on qualifications and seniority. From the salary, 2% is deducted as a contribution to the Norwegian Public Service Pension Fund. The period of employment is 3 or 4 years (with teaching duties https://lovdata.no/dokument/SF/forskrift/2006-01-31-102 ). Appointment to a PhD position requires that you are admitted to the PhD programme in Information Security within three months of employment, and that you participate in an organized PhD programme during the employment period. (https://lovdata.no/dokument/SFE/forskrift/2018-12-05-1878 ) * About the application process * The application and supporting documentation to be used as the basis for the assessment must be in English. Publications and other scientific work must follow the application. Please note that applications are only evaluated based on the information available on the application deadline. You should ensure that your application shows clearly how your skills and experience meet the criteria which are set out above. _The application must include:_ ? CV, certificates and diplomas ? transcripts and diplomas for bachelor's and master's degrees. If you have not completed the master's degree, you must submit a confirmation that the master's thesis has been submitted. ? A copy of the master's thesis. If you recently have submitted your master's thesis, you can attach a draft of the thesis. Documentation of a completed master's degree must be presented before taking up the position. ? Project proposal (or Letter of Interest) detailing why you fit for the position ? Research plan ? Name and address of three referees ? If you have publications or other relevant research work If all, or parts, of your education has been taken abroad, we also ask you to attach documentation of the scope and quality of your entire education, both bachelor's and master's education, in addition to other higher education. Description of the documentation required can be found (https://www.ntnu.edu/positions/documentation-requirements-of-academic-credentials). If you already have a statement from NOKUT, please attach this as well. Joint works will be considered. If it is difficult to identify your contribution to joint works, you must attach a brief description of your participation. In the evaluation of which candidate is best qualified, emphasis will be placed on education, experience and personal and interpersonal qualities. Motivation, ambitions, and potential will also count in the assessment of the candidates. NTNU is committed to following evaluation criteria for research quality according to The San Francisco Declaration on Research Assessment - DORA. * General information * Working at NTNU (https://www.ntnu.edu/nirs) A good work environment is characterized by diversity. We encourage qualified candidates to apply, regardless of their gender, functional capacity or cultural background. The city of Gj?vik has a population of ca.30 000 and is a town known for its rich music and cultural life. Gj?vik is located at a 2h train ride from the capital, Oslo, which is often a place for students to go when needing a more exciting/cultural outing. The beautiful nature surrounding the city is ideal for an active outdoor life! The Norwegian welfare state, including healthcare, schools, kindergartens and overall equality, is probably the best of its kind in the world. ------------------------------------------------- Have a nice day from Christian Johansen assoc.prof. in Systems Security group at Dept. Inf. Sec. & Comm. Tech. of NTNU Norwegian University of Science and Technology Webpage: https://christian.johansenresearch.info/ ------------------------------------------------- -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_signature Type: application/pgp-signature Size: 495 bytes Desc: OpenPGP digital signature URL: From Luigia.Petre at abo.fi Fri Aug 20 05:20:47 2021 From: Luigia.Petre at abo.fi (Luigia Petre) Date: Fri, 20 Aug 2021 09:20:47 +0000 Subject: [TYPES/announce] FMTea (Formal Methods Teaching) Tutorial series starting soon! In-Reply-To: <13396e5f0cf3410a82e3ae7b765c687e@abo.fi> References: <2ecf0370d12a4e4b9643903cd7023ccd@abo.fi>, , , , <2fbf9426a2cd452fb06d67e85b466049@abo.fi>, <18d07574e40a425c99a634b35406c369@abo.fi>, , <0d39f9cc5fc8487c89dfd373b658b8e3@abo.fi>, <0b8b460c4fef4795a87ef65c5359c9da@abo.fi>, <1f87c91705ed4499b454fdc2ddd7ba97@abo.fi>, , <2db868bffc894b9d97a38d021f2fabe6@abo.fi>, <7aafc7071d1d488b8fcf5710e01f9cc9@abo.fi>, , <943ab3efba334bd78d55e6c7d252deda@abo.fi>, <243761bb9ed642408916d292c0c2cf54@abo.fi>, <2ac362d453414e9b80e688bdd9c5831d@abo.fi>, , <99b99930fb8d4e8195b6785f4a8a75bd@abo.fi>, <788b6243bab44e90bf819ccbc7454444@abo.fi>, , <81972c5b505c49eba05fa0125776174c@abo.fi>, , <770649d5ae3b40f38b29863bf49e6d 73@abo.fi>, , <802afcc9bbe04cc9865eaddb62e86f55@abo.fi>, <0c1ab755fe2e4b0296088a64210b29e7@abo.fi>, , <4dfa4cf7b6de4993af7a16380c8baf4a@abo.fi>, <23bb0184a2514946aa94921aecf01870@abo.fi>, <4acdfad6a8a44c07a531fe909f785af5@abo.fi>, <7580c74cced440e4950c42bc5bde98a2@abo.fi>, <7ebe87bf684644f69d118ff859589021@abo.fi>, , <4d4d76bcd3f34bf5a80554dcbce51f29@abo.fi>, , <7926c8220f944a0c85f69237555f699d@abo.fi>, , <7f69f9563caf434f806cb011c598a390@abo.fi>, , , <1a458e04856a46fd97ca66d1b9b89e7f@abo.fi>, , <749bc3c41219410f89aa7f43bf9412ce@abo.fi>, <1d39373710324bd3a19e2309cd572889@abo.fi>, <315c81248c884f1da4ad1dbce28cb071@abo.fi>, <07bb8c0f1c4f4f079bd237f46e70f64d@abo.fi>, <1efde05b0ce74a23b08 6677528bb8025@abo.fi>, <5546a8d1b9354604a60b3b4a883149d2@abo.fi>, , <3a99f3e2987945209d136fa42ae2df30@abo.fi>, <13396e5f0cf3410a82e3ae7b765c687e@abo.fi> Message-ID: <2b8170fff58543cd9b9e2208e3c641ea@abo.fi> Dear all, In the FME Teaching Committee we are launching a new tutorial series, planned to be held monthly. The idea is to increase the awareness and sharing of tools and techniques used for teaching formal methods. The tutorial will be held online via zoom. We will record (whenever the speaker agrees) these presentations and collect them on the FME Teaching Committee website: https://urldefense.com/v3/__https://fme-teaching.github.io__;!!IBzWLUs!BUOXqdJRwq8YlIn8lyoZ3ygltDFj3E9SkoaUN0ciUnrk-qsb-s24vbmJIJfkBiqbTWvfknuzD1ijZA$ . [https://urldefense.com/v3/__https://fme-teaching.github.io/media/logo_hub96a365879c5829aace43d4a4da98a91_104111_300x300_fit_lanczos_2.png__;!!IBzWLUs!BUOXqdJRwq8YlIn8lyoZ3ygltDFj3E9SkoaUN0ciUnrk-qsb-s24vbmJIJfkBiqbTWvfknt0oRxAwg$ ] Formal Methods Teaching Committee fme-teaching.github.io The aim of the FME Teaching Committee is to support a worldwide improvement in learning formal methods, mainly by teaching but also via self-learning. We are very happy to announce the first speaker in the series: Prof Sandrine Blazy, University of Rennes 1, France, https://urldefense.com/v3/__https://people.irisa.fr/Sandrine.Blazy/__;!!IBzWLUs!BUOXqdJRwq8YlIn8lyoZ3ygltDFj3E9SkoaUN0ciUnrk-qsb-s24vbmJIJfkBiqbTWvfknt3Kjkgzg$ , who will talk about using the Why3 tool for deductive program verification. This tutorial will take place on September 24, at 3pm CET. The zoom coordinates are below. The online event is planned to take about one hour, give or take. Everyone welcome!! With best regards, Luigia Petre on behalf of the FME Teaching Committee Luigia Petre is inviting you to a scheduled Zoom meeting. Topic: FMTea Tutorial Series Time: This is a recurring meeting Meet anytime Join Zoom Meeting https://urldefense.com/v3/__https://aboakademi.zoom.us/j/64254430116__;!!IBzWLUs!BUOXqdJRwq8YlIn8lyoZ3ygltDFj3E9SkoaUN0ciUnrk-qsb-s24vbmJIJfkBiqbTWvfkntlAquyow$ Meeting ID: 642 5443 0116 Join by SIP 64254430116 at 109.105.112.236 64254430116 at 109.105.112.235 Join by H.323 109.105.112.236 109.105.112.235 Meeting ID: 642 5443 0116 __ Luigia Petre, Docent, PhD Faculty of Science and Engineering ?bo Akademi University, Finland https://urldefense.com/v3/__http://www.users.abo.fi/lpetre__;!!IBzWLUs!BUOXqdJRwq8YlIn8lyoZ3ygltDFj3E9SkoaUN0ciUnrk-qsb-s24vbmJIJfkBiqbTWvfknvRzjOkVw$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From davide.bresolin at unipd.it Fri Aug 20 14:20:33 2021 From: davide.bresolin at unipd.it (Davide Bresolin) Date: Fri, 20 Aug 2021 20:20:33 +0200 Subject: [TYPES/announce] Call for participation GandALF 2021 In-Reply-To: References: Message-ID: GandALF 2021: 12th International Symposium on Games, Automata, Logics, and Formal Verification September 20-22, 2021, Padua (Italy) and also online. CALL FOR PARTICIPATION https://urldefense.com/v3/__https://gandalf2021.math.unipd.it/__;!!IBzWLUs!GCumOO8Jbx8hlKFhqmhcJm86yvPdRKpviW_KO4PlH3MF2_aL1n3cvJ6Xn82h1PK8CGdOrBBEpDBPEA$ We are looking forward to seeing you in Padua or at the virtual conference! ABOUT GandALF GandALF 2021 is the 12th in a series dedicated to Games, Automata, Logics, and Formal Verification. The aim of GandALF 2021 symposium is to bring together researchers from academia and industry which are actively working in the fields of Games, Automata, Logics, and Formal Verification. The idea is to cover an ample spectrum of themes, ranging from theory to applications, and stimulate cross-fertilization. This year, GANDALF will be organised together with the 3rd Workshop on Artificial Intelligence and fOrmal VERification, Logic, Automata, and sYnthesis (OVERLAY 2021). The OVERLAY workshop focuses on the relationships between Artificial Intelligence and Formal Methods, and discusses the opportunities and challenges at the border of the two areas. Both events will be hosted by the University of Padua, and will share some invited speakers. We encourage participation in both events. REGISTRATION The registration for the conference is now open:?https://urldefense.com/v3/__https://gandalf2021.math.unipd.it/registration__;!!IBzWLUs!GCumOO8Jbx8hlKFhqmhcJm86yvPdRKpviW_KO4PlH3MF2_aL1n3cvJ6Xn82h1PK8CGdOrBCv-apJCw$ . Early registration is possible until August 31st 2021, with regular registration being possible up to the conference. Registration fees vary from 0? to 350? depending on what you wish to attend and your professional situation. GandALF 2021 PROGRAM Soon, you will find a link to the program here:?https://urldefense.com/v3/__https://gandalf2021.math.unipd.it/program__;!!IBzWLUs!GCumOO8Jbx8hlKFhqmhcJm86yvPdRKpviW_KO4PlH3MF2_aL1n3cvJ6Xn82h1PK8CGdOrBA8qqH87A$ . Talks and keynotes will happen in the working hours of the CEST time zone. Program Overview: - Overlay Workshop: September 22, 2021 - Main conference: September 20-22, 2021 INVITED SPEAKERS Keynotes?https://urldefense.com/v3/__https://gandalf2021.math.unipd.it/invited-speakers__;!!IBzWLUs!GCumOO8Jbx8hlKFhqmhcJm86yvPdRKpviW_KO4PlH3MF2_aL1n3cvJ6Xn82h1PK8CGdOrBB4AkV8Xg$ : ? Roderick Bloem, TU Graz, Austria: ?Shield Synthesis for Safe Reinforcement Learning? ? Anca Muscholl, LaBRI, Bordeaux, France: ?Sound Negotiations? ? Nicola Olivetti, Aix-Marseille University, France: ?Non-normal modal logics vindicated? ? S.E. (Sicco) Verwer, TU Delft, The Netherlands: ?State machine learning in practice using Flexfringe: flexibility, use-cases, and interpretability? LIST OF ACCEPTED PAPERS Shufang Zhu, Lucas Martinelli Tabajara, Geguang Pu and Moshe Vardi: ?Temporal Knowledge Compilation for Realizability Checking and Synthesis? Miikka Vilander: ?Games for Succinctness of Regular Expressions? Javier Esparza, Mikhail Raskin and Christoph Welzel: ?Abduction of trap invariants in parameterized systems? Giovanni Pagliarini and Guido Sciavicco: ?Decision Tree Learning with Spatial Modal Logics? A. R. Balasubramanian and Chana Weil-Kennedy: ?Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent? Erich Gr?del, Niels L?cking and Matthias Naaf: ?Semiring Provenance for B?chi Games: Strategy Analysis with Absorptive Polynomials? Simon Jantsch, Jakob Piribauer and Christel Baier: ?Witnessing subsystems for probabilistic systems with low tree width? Jan Rooduijn and Yde Venema: ?Filtration and canonical completeness for the continuous modal ?-calculus? Florian Gallay and Ylies Falcone: ?Decentralized LTL Enforcement? Dhananjay Raju, Ruediger Ehlers and Ufuk Topcu: ?Adapting to the Behavior of Environments with Bounded Memory? Ashwani Anand, Nathana?l Fijalkow, Ali?nor Goubault-Larrecq, Leroux J?r?me and Pierre Ohlmann: ?New Algorithms for Combinations of Objectives using Separating Automata? Raoul Koudijs: ?Finite Model Property and Bisimulation for Local Logics of Dependence? Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari and Stefano Tonetta: ?Expressiveness of Extended Bounded Response LTL? Tobias Winkler and Maximilian Weininger: ?Stochastic Games with Disjunctions of Multiple Objectives? Clemens Kupke, Johannes Marti and Yde Venema: ?On the Size of Disjunctive Formulas in the ?-calculus? Laura Bozzelli, Angelo Montanari, Adriano Peron and Pietro Sala: ?Adding the relation Meets to the temporal logic of prefixes and infixes makes it EXPSPACE-complete? Gustav Grabolle: ?A Nivat theorem for weighted alternating automata over commutative semirings? Domenico Cantone, Andrea De Domenico and Pietro Maugeri: ?On the convexity of a fragment of pure set theory with applications within a Nelson-Oppen framework? Antti Kuusisto and Raine R?nnholm: ?The optimal way to play the most difficult repeated coordination games? We hope to welcome you to GandALF 2021 in Padua (Italy) or online! CONTACT For any questions please contact the two PC chairs: Davide Bresolin (davide.bresolin at unipd.it), Pierre Ganty (pierre.ganty at imdea.org) -------------- next part -------------- An HTML attachment was scrubbed... URL: From xnningxie at gmail.com Fri Aug 20 17:57:39 2021 From: xnningxie at gmail.com (Ningning Xie) Date: Fri, 20 Aug 2021 17:57:39 -0400 Subject: [TYPES/announce] Call for Participation: Haskell Implementors' Workshop 2021 Message-ID: Call for Participation ACM SIGPLAN Haskell Implementors' Workshop Sunday 22 Aug 20:00-05:00 (Seoul) https://urldefense.com/v3/__https://icfp21.sigplan.org/home/hiw-2021__;!!IBzWLUs!FClp3eBxYpem9p4wuIBGSQ-9fZddZv6EJZPrMJ3Pw3m-8tqefFTlRviMKVzkVr_OvmCHkRDpURO4wQ$ We are happy to announce that Haskell Implementors' Workshop is taking place this Sunday, co-located with ICFP 2021. The workshop will be live streamed on Youtube. We invite you to watch the talks, and attend the workshop. The program features 11 exciting talks, along with 4 lightning talks. The keynote is given by Bengt Marten Agren (Standard Chartered Bank), on "Haskell reinterpreted ? large-scale real-world experience with the Mu compiler in Financial Markets". Program details: https://urldefense.com/v3/__https://icfp21.sigplan.org/home/hiw-2021*program__;Iw!!IBzWLUs!FClp3eBxYpem9p4wuIBGSQ-9fZddZv6EJZPrMJ3Pw3m-8tqefFTlRviMKVzkVr_OvmCHkRBKGoYIMw$ Keynote details: https://urldefense.com/v3/__https://icfp21.sigplan.org/details/hiw-2021-papers/14/Haskell-reinterpreted-large-scale-real-world-experience-with-the-Mu-compiler-in-Fin__;!!IBzWLUs!FClp3eBxYpem9p4wuIBGSQ-9fZddZv6EJZPrMJ3Pw3m-8tqefFTlRviMKVzkVr_OvmCHkRCMi60FUQ$ Program Committee ----------------- * Dominique Devriese (Vrije Universiteit Brussel) * Daan Leijen (Microsoft Research) * Andres L?h (Well-Typed LLP) * Julie Moronuki (Typeclass Consulting) * John Wiegley (DFINITY) * Ningning Xie (the University of Hong Kong) * Edward Z. Yang (Facebook AI Research) Contact ------- * Ningning Xie -------------- next part -------------- An HTML attachment was scrubbed... URL: From n.yoshida at imperial.ac.uk Sun Aug 22 09:36:01 2021 From: n.yoshida at imperial.ac.uk (Yoshida, Nobuko) Date: Sun, 22 Aug 2021 13:36:01 +0000 Subject: [TYPES/announce] Research Assistant/Associate at Department of Computing, Imperial College London Message-ID: Department of Computing, Imperial College London Research Assistant/Associate Position (Full Time) 36,394 GBP to 49,210 GBP per annum Reference: Fixed-term: 3 years Starting date: as soon as possible Closing Date: 16th September 2021 The Research Assistant will work under the EPSRC Established Career Fellowship Project, POST: Protocols, Observabilities and Session Types and/or other EPSRC projects (see below). Please contact with Nobuko Yoshida (n.yoshida at imperial.ac.uk), Imperial College London if you would like to apply to the position to have informal discussions. Details: https://urldefense.com/v3/__https://www.imperial.ac.uk/jobs/description/ENG01832/research-assistant-associate__;!!IBzWLUs!Bli8ufJJJ7qTrAUMSwKCAM50W0Ea948jAD5zNsfkvxjdcilxV_5MRiaw5A7tad4fjQg7BzuGVjc2_w$ ------------------------------------------------------------ The project has particular emphasis on putting theory into practice, by embedding session types in a range of programming languages and applying them to case studies; or developing the links between session types and other areas of theoretical computer science. The research programme includes collaboration with several companies and organisations. Candidates for the post-doc position will need to have expertise in either: 1. programming language design and implementation; or 2. formal semantics, type theory and concurrency theory Different positions will be suitable for different points on the theory/practice spectrum. We are especially interested in candidates with a combination of theoretical and practical skills. For more details, see https://urldefense.com/v3/__http://mrg.doc.ic.ac.uk__;!!IBzWLUs!Bli8ufJJJ7qTrAUMSwKCAM50W0Ea948jAD5zNsfkvxjdcilxV_5MRiaw5A7tad4fjQg7BzsKplNdGQ$ . The focus of Imperial College London Group is theories and applications of session types which include: -- Go, Rust, TypeScript, Scala, F*, F#, Haskell, OCaml, Java, Erland, MPI-C and Python; -- mechanisation of session types meta-theory (Coq, Isabelle, Agda, etc) (PLDI'21 Zooid, https://urldefense.com/v3/__http://mrg.doc.ic.ac.uk/publications/zooid-paper/__;!!IBzWLUs!Bli8ufJJJ7qTrAUMSwKCAM50W0Ea948jAD5zNsfkvxjdcilxV_5MRiaw5A7tad4fjQg7BztU6Mfusw$ ) -- session types theories, automata theories, game semantics, linear logic; and -- other applications such as blockchains and robotics The candidate will work on POST and/or other related projects -- Stardust (https://urldefense.com/v3/__https://epsrc-stardust.github.io/__;!!IBzWLUs!Bli8ufJJJ7qTrAUMSwKCAM50W0Ea948jAD5zNsfkvxjdcilxV_5MRiaw5A7tad4fjQg7BzvGQEnGcQ$ ) -- AppControl (https://urldefense.com/v3/__https://dsbd-appcontrol.github.io/people.html__;!!IBzWLUs!Bli8ufJJJ7qTrAUMSwKCAM50W0Ea948jAD5zNsfkvxjdcilxV_5MRiaw5A7tad4fjQg7BzsmobkPpA$ ) The candidate is welcome to discuss the details about the above project(s) with the contact person: Professor Nobuko Yoshida, Imperial College London (n.yoshida at imperial.ac.uk) -------------- next part -------------- An HTML attachment was scrubbed... URL: From harley.eades at gmail.com Tue Aug 24 15:19:03 2021 From: harley.eades at gmail.com (Harley D. Eades III) Date: Tue, 24 Aug 2021 15:19:03 -0400 Subject: [TYPES/announce] Seminar talk on Session Logical Relations for Noninterference Message-ID: Hi, everyone. On Friday, Sept. 9, 2021 between 1pm and 2pm EST (5pm - 6pm UTC), Dr. Stephanie Balzer will be giving a presentation as part of the CS Colloquium Series at Augusta University. Presentation details can be found here: https://urldefense.com/v3/__https://the-au-forml-lab.github.io/colloquium_talks/Balzer.html__;!!IBzWLUs!GOSB3nxVDAh6Ykj93axBSK31kq-JF9ClLcripfo0sODbzsCog5jv5EL3Go3y2my_KboeN8OOSLWwJA$ Stephanie will be discussing their recent work on linear session types and interference. It is going to be super interesting. These talks are open to the general public via Zoom and Youtube. I'll be live streaming it on Youtube. If you are interested in attending the Zoom meeting please RSVP with me before the talk. Questions will be taken from those on Zoom and YouTube. If you care to watch via YouTube, please use the following link: https://urldefense.com/v3/__https://youtu.be/lJpK9CIgT30__;!!IBzWLUs!GOSB3nxVDAh6Ykj93axBSK31kq-JF9ClLcripfo0sODbzsCog5jv5EL3Go3y2my_KboeN8MfsGfxpg$ Feel free to share this message with everyone you know. I hope all of you, your family and friends are doing well! Very best, Harley -------------- next part -------------- An HTML attachment was scrubbed... URL: From npapoylias at gmail.com Tue Aug 24 15:24:46 2021 From: npapoylias at gmail.com (Nick Papoylias) Date: Tue, 24 Aug 2021 21:24:46 +0200 Subject: [TYPES/announce] [OSys PL Labs] 3 UI/UX Research Engineer Positions for Progr. Languages and Tools (Remote) Message-ID: Dear colleagues, The newly founded PL (Programming Languages) research Group at OutSystems has a goal of exploring the UI/UX frontier of Programming Tools. We are looking for 3 UI/UX Research Engineers for Programming Languages & Tools (Remote) to join our group. Please forward to anyone you think might be interested by our call: Europe/EMEA: https://urldefense.com/v3/__https://www.outsystems.com/careers/job-detail/8a7887a87acffd16017b1cedb4930469/__;!!IBzWLUs!Fs9tkRW8Mye_OFM_u2tlsk7AILIbfl-gZds03fpyNszOOv5nHl7zm2X4LMcndCtfA8tcwLT7Nmh0bw$ US/Americas: https://urldefense.com/v3/__https://www.outsystems.com/careers/job-detail/8a7885a87b55f750017b7479ec9f365b/__;!!IBzWLUs!Fs9tkRW8Mye_OFM_u2tlsk7AILIbfl-gZds03fpyNszOOv5nHl7zm2X4LMcndCtfA8tcwLS1tGtoaQ$ India/APAC: https://urldefense.com/v3/__https://www.outsystems.com/careers/job-detail/8a7883a97ad004d8017b1011897d76de/__;!!IBzWLUs!Fs9tkRW8Mye_OFM_u2tlsk7AILIbfl-gZds03fpyNszOOv5nHl7zm2X4LMcndCtfA8tcwLTrsKWyMA$ Best Regards, Dr. Papoulias (@npapoylias ) *Director of Research **@OutSystems* ================================================== *If you consider yourself (or aspire to be) a UI/UX expert with programming experience that wants to: ?Boldly go where no programmer has gone before? don?t let any impostor syndrome stop you, apply to join us! What we are looking for in our research group -- first and foremost -- is explorers. Take a look at this short video to quickly learn more about OutSystems: https://urldefense.com/v3/__https://youtu.be/0gx3hMMDOZI__;!!IBzWLUs!Fs9tkRW8Mye_OFM_u2tlsk7AILIbfl-gZds03fpyNszOOv5nHl7zm2X4LMcndCtfA8tcwLSYKsOYGA$ . * *Responsibilities:* ** Your base responsibility will be the development of research prototypes from an engineering perspective. Nevertheless, the research nature of these prototypes will almost always require you to either learn a new language, a new system or way of working. You will always be given time and guidance (bibliography, books and an engineering starting point) to do so. The director of the group will always be there to guide you with all aspects of your work.* ** Once this base responsibility is fulfilled your UI/UX experience and expertise will help us go even further. What can we add to a good prototype to bring aesthetics and usability to the mix ? What will make us smile every time we use it ?* ** When you become comfortable with the above responsibilities you can start proposing your own experiments to the team and guide our newest members through the whole R&D process.* ** Finally, according to the group?s needs you will be tasked to present our work to colleagues, internally or externally (to the wider industrial and academic community), participate in conferences, publications and in the general dissemination of our work.* -------------- next part -------------- An HTML attachment was scrubbed... URL: From harley.eades at gmail.com Wed Aug 25 08:38:04 2021 From: harley.eades at gmail.com (Harley D. Eades III) Date: Wed, 25 Aug 2021 08:38:04 -0400 Subject: [TYPES/announce] Seminar talk on Session Logical Relations for Noninterference In-Reply-To: References: Message-ID: Hi, everyone. I'm very sorry for the mess up. I think I get the date wrong at least once a semester; at least I got it out of the way. :-) The correct date is 3/9/2021 or Friday, Sept. 3 2021 between 1pm and 2pm EST (5pm - 6pm UTC). Thanks to all of you who pointed this out! Again, very sorry! Best, Harley On Tue, Aug 24, 2021 at 3:19 PM Harley D. Eades III wrote: > Hi, everyone. > > On Friday, Sept. 9, 2021 between 1pm and 2pm EST (5pm - 6pm UTC), Dr. > Stephanie Balzer will be giving a presentation as part of the > CS Colloquium Series at Augusta University. > > Presentation details can be found here: > > https://urldefense.com/v3/__https://the-au-forml-lab.github.io/colloquium_talks/Balzer.html__;!!IBzWLUs!CZ7LHjJwgjlHpAHCw2dS-Ma8xoraANFrSyUcwgLUDvZ_QVqMHb-0K6LMSeIMUuemA1jkvS-Nxk-14g$ > > Stephanie will be discussing their recent work on linear session types and > interference. It is going to be super interesting. > > These talks are open to the general public via Zoom and Youtube. I'll be > live streaming it on Youtube. If you are interested in attending the Zoom > meeting please RSVP with me before the talk. > > Questions will be taken from those on Zoom and YouTube. > > If you care to watch via YouTube, please use the following link: > > https://urldefense.com/v3/__https://youtu.be/lJpK9CIgT30__;!!IBzWLUs!CZ7LHjJwgjlHpAHCw2dS-Ma8xoraANFrSyUcwgLUDvZ_QVqMHb-0K6LMSeIMUuemA1jkvS8WU6Y99g$ > > Feel free to share this message with everyone you know. > > I hope all of you, your family and friends are doing well! > > Very best, Harley > -------------- next part -------------- An HTML attachment was scrubbed... URL: From cj-xu at outlook.com Wed Aug 25 08:39:26 2021 From: cj-xu at outlook.com (Chuangjie Xu) Date: Wed, 25 Aug 2021 14:39:26 +0200 Subject: [TYPES/announce] Research position at fortiss, Munich Message-ID: We are looking for a researcher to strengthen our Safety & Security team at fortiss, a research institute in Munich with close connections both to the Munich universities TUM and LMU and to industry. The Safety & Security team develops new methods and engineering principles related to safety and security in software and system development. Example areas of interest include: - Automated reasoning for safety/security-engineering - Security aspects of distributed systems, such as accountability and privacy - Formal semantics, verification, and analysis of access control systems - Program analysis and type systems The position is available starting as soon as possible and will be for at least two years initially, with the possibility of extension. You would be a team member contributing to our research in one of the above areas. Applications from candidates with skills in related areas are also welcome. More details about this position can be found at: https://urldefense.com/v3/__https://recruitment.fortiss.org/RESEARCHER-SAFETYSEVURITY-MFD-eng-j163.html__;!!IBzWLUs!Ctfl_C4HZdw9U86JDjICpD2Sc7Ck8A5iZY4RzgW95F1kB4fDskX35fRIo5t0BDxWmA3mZaLxj6Vucg$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From ifl21.publicity at gmail.com Wed Aug 25 12:10:57 2021 From: ifl21.publicity at gmail.com (Pieter Koopman) Date: Wed, 25 Aug 2021 09:10:57 -0700 Subject: [TYPES/announce] IFL'21 call for participation Message-ID: ================================================================================ IFL 2021 33rd Symposium on Implementation and Application of Functional Languages venue: online 1 - 3 September 2021 https://urldefense.com/v3/__https://ifl21.cs.ru.nl__;!!IBzWLUs!AS_mPF7V1F0E3BFIGD3L8OBEUOL5Tp5xtBKEtOd-z7UIq4n70uU38illFmZ-w1j3YfM49xVQToSaiA$ *Registration* Registration is free of charge, but required for participation! Use the below link to register for IFL 2021: https://urldefense.com/v3/__https://docs.google.com/forms/d/e/1FAIpQLSdMFjo-GumKjk4i7szs7n4DhWqKt96t8ofIqshfQFrf4jnvsA/viewform?usp=sf_link__;!!IBzWLUs!AS_mPF7V1F0E3BFIGD3L8OBEUOL5Tp5xtBKEtOd-z7UIq4n70uU38illFmZ-w1j3YfM49xUK7KkLzg$ *Scope* The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2021 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. *Program* The program is now available at https://urldefense.com/v3/__https://ifl21.cs.ru.nl/Program__;!!IBzWLUs!AS_mPF7V1F0E3BFIGD3L8OBEUOL5Tp5xtBKEtOd-z7UIq4n70uU38illFmZ-w1j3YfM49xUA2gVEOw$ . *Organisation* IFL 2021 Chairs: Pieter Koopman and Peter Achten, Radboud University, The Netherlands IFL Publicity chair: Pieter Koopman, Radboud University, The Netherlands *PC* Peter Achten (co-chair) - Radboud University, Netherlands Thomas van Binsbergen - University of Amsterdam, Netherlands Edwin Brady - University of St. Andrews, Scotland Laura Castro - University of A Coru?a, Spain Youyou Cong - Tokyo Institute of Technology, Japan Olaf Chitil - University of Kent, England Andy Gill - University of Kansas, USA Clemens Grelck - University of Amsterdam, Netherlands John Hughes - Chalmers University, Sweden Pieter Koopman (co-chair) - Radboud University, Netherlands Cynthia Kop - Radboud University, Netherlands Jay McCarthey - University of Massachussetts Lowell, USA Neil Mitchell - Facebook, England Jan De Muijnck-Hughes - Glasgow University, Scotland Keiko Nakata - SAP Innovation Center Potsdam, Germany Jurri?n Stutterheim - Standard Chartered, Singapore Simon Thompson - University of Kent, England Melinda T?th - E?tvos Lor?nd University, Hungary Phil Trinder - Glasgow University, Scotland Meng Wang - University of Bristol, England Vikt?ria Zs?k - E?tvos Lor?nd University, Hungary [image: beacon] -------------- next part -------------- An HTML attachment was scrubbed... URL: From bcpierce at cis.upenn.edu Wed Aug 25 22:53:00 2021 From: bcpierce at cis.upenn.edu (Benjamin Pierce) Date: Wed, 25 Aug 2021 22:53:00 -0400 Subject: [TYPES/announce] New Software Foundations release Message-ID: Just in time for Fall courses... the Software Foundations team is pleased to announce a new release of all six titles in the SF series of formally verified textbooks on programming languages and formal reasoning about programs. - Volume 1: Logical Foundations - Volume 2: Programming Language Foundations - Volume 3: Verified Functional Algorithms - Volume 4: QuickChick: Property-Based Testing in Coq - Volume 5: Verifiable C - Volume 6: Separation Logic Foundations This release is compatible with Coq 8.13 and includes improvements to notations, several new chapters in the Verifiable C volume, and many, many other additions and refinements. Enjoy! - Benjamin -------------- next part -------------- An HTML attachment was scrubbed... URL: From connor.yang at mdpi.com Fri Aug 27 06:49:26 2021 From: connor.yang at mdpi.com (Connor Yang) Date: Fri, 27 Aug 2021 18:49:26 +0800 Subject: [TYPES/announce] [Types-announce] CFP: Special Issue "Selected Papers from the Flavors of Uncertainty in Verification, Planning, and Optimization Workshop (co-located with International Colloquium on Automata, Languages and Programming 2021)" Message-ID: <11f54ddf-e1be-8a5e-c5a1-1f2bce28f78d@mdpi.com> Dear all, We're pleased to announce the Special Issue "Selected Papers from the Flavors of Uncertainty in Verification, Planning, and Optimization Workshop (co-located with International Colloquium on Automata, Languages and Programming 2021)", welcome to submit, please see the details below Special issue website: https://urldefense.com/v3/__https://www.mdpi.com/journal/entropy/special_issues/Uncertainty_Verification__;!!IBzWLUs!Hpj6o4nzO94AiMn8ecGouiRhMdJmEn8J13pWqzsvwYGNOcCPIhjm_ATgTtCXYiJ6DeowMnA75fylhg$ Submission Deadline: 31 December 2021 Keywords: Quantitative formal methods Dynamic mechanism design Planning under uncertainty Robustness Probabilistic model checking Partial observability Markov decision processes Parametric systems Statistical inference Parameter synthesis. Kind regards, Mr. Connor Yang From wies at cs.nyu.edu Sun Aug 29 14:00:16 2021 From: wies at cs.nyu.edu (Thomas Wies) Date: Sun, 29 Aug 2021 14:00:16 -0400 Subject: [TYPES/announce] Deadline Extension: VMCAI 2022 Message-ID: <73c551e2-d942-823c-bf3d-38458a85523a@cs.nyu.edu> Call for Papers - Deadline Extension [Apologies for multiple copies of this announcement] ******************************************************************************* CALL FOR PAPERS 23rd International Conference on Verification, Model Checking, and Abstract Interpretation VMCAI 2022 January 16-18, 2022 https://urldefense.com/v3/__https://popl22.sigplan.org/home/VMCAI-2022__;!!IBzWLUs!D1QMh133dUFuY1i_3oG0m92_w6hkfiFl1KKSVvChnFcNhiWhfZIlrRpt8z0peu0ChVwnZX_sBIRqJw$ ******************************************************************************* *Call for Papers* VMCAI 2022 is the 23rd International Conference on Verification, Model Checking, and Abstract Interpretation. The conference will be held on January 16-18, 2022, in Philadelphia, PA, United States. VMCAI provides a forum for researchers from the communities of Verification, Model Checking, and Abstract Interpretation, facilitating interaction, cross-fertilization, and advancement of hybrid methods that combine these and related areas. *Scope* The program of VMCAI 2022 will consist of refereed research papers as well as invited lectures and tutorials. Research contributions can report new results as well as experimental evaluations and comparisons of existing techniques. Topics include, but are not limited to: Program Verification Model Checking Abstract Interpretation Abstract Domains Program Synthesis Static Analysis Type Systems Deductive Methods Program Logics First-Order Theories Decision Procedures Interpolation Horn Clause Solving Program Certification Separation Logic Probabilistic Programming and Analysis Error Diagnosis Detection of Bugs and Security Vulnerabilities Program Transformations Hybrid and Cyber-physical Systems Concurrent and distributed Systems Analysis of numerical properties Analysis of smart contracts Analysis of neural networks Case Studies on all of the above topics Submissions can address any programming paradigm, including concurrent, constraint, functional, imperative, logic, and object-oriented programming. *Important Dates AoE (UTC-12)* September 9th, 2021 (New): Paper submission October 7th, 2021: Notification November 15th, 2021: Camera-ready version due Conference Submission Link https://urldefense.com/v3/__https://easychair.org/conferences/?conf=vmcai2022__;!!IBzWLUs!D1QMh133dUFuY1i_3oG0m92_w6hkfiFl1KKSVvChnFcNhiWhfZIlrRpt8z0peu0ChVwnZX-HlMHOnw$ *Submissions* Submissions are required to follow Springer's LNCS format. The page limit depends on the paper's category (see below). In each category, additional material beyond the page limit may be placed in a clearly marked appendix, to be read at the discretion of the reviewers and to be omitted in the final version. Formatting style files and further guidelines for formatting can be found at the Springer website: https://urldefense.com/v3/__https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines__;!!IBzWLUs!D1QMh133dUFuY1i_3oG0m92_w6hkfiFl1KKSVvChnFcNhiWhfZIlrRpt8z0peu0ChVwnZX9tNLWeBw$ . Submission link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=vmcai2022__;!!IBzWLUs!D1QMh133dUFuY1i_3oG0m92_w6hkfiFl1KKSVvChnFcNhiWhfZIlrRpt8z0peu0ChVwnZX-HlMHOnw$ Accepted papers will be published in Springer's Lecture Notes in Computer Science series. There will be three categories of papers: regular papers, tool papers and case studies. Papers in each category have a different page limit and will be evaluated differently. Regular papers clearly identify and justify an advance to the field of verification, abstract interpretation, or model checking. Where applicable, they are supported by experimental validation. Regular papers are restricted to 20 pages in LNCS format, not counting references. Tool papers present a new tool, a new tool component, or novel extensions to an existing tool. They should provide a short description of the theoretical foundations with relevant citations, and emphasize the design and implementation concerns, including software architecture and core data structures. A regular tool paper should give a clear account of the tool's functionality, discuss the tool's practical capabilities with reference to the type and size of problems it can handle, describe experience with realistic case studies, and where applicable, provide a rigorous experimental evaluation. Papers that present extensions to existing tools should clearly focus on the improvements or extensions with respect to previously published versions of the tool, preferably substantiated by data on enhancements in terms of resources and capabilities. Authors are strongly encouraged to make their tools publicly available and submit an artifact. Tool papers are restricted to 12 pages in LNCS format, not counting references. Case studies are expected to describe the use of verification, model checking, and abstract interpretation techniques in new application domains or industrial settings. Papers in this category do not necessarily need to present original research results but are expected to contain novel applications of formal methods techniques as well as an evaluation of these techniques in the chosen application domain. Such papers are encouraged to discuss the unique challenges of transferring research ideas to a real-world setting and reflect on any lessons learned from this technology transfer experience. Case study papers are restricted to 20 pages in LNCS format, not counting references.(Shorter case study papers are also welcome.) *Artifacts* VMCAI 2022 allows authors to submit an artifact along with the paper. Artifacts are any additional material that substantiates the claims made in the paper, and ideally makes them fully replicable. Submitting an artifact is encouraged but not required. Artifact submissions are due one week after the paper submission deadline. The artifact will be evaluated in parallel with the submission by the artifact evaluation committee (AEC). The AEC will read the paper and evaluate the artifact on the following criteria: - consistency with and replicability of results in the paper, - completeness, - documentation, and - ease of use. More information will be available on the conference webpage: https://urldefense.com/v3/__https://popl22.sigplan.org/home/VMCAI-2022__;!!IBzWLUs!D1QMh133dUFuY1i_3oG0m92_w6hkfiFl1KKSVvChnFcNhiWhfZIlrRpt8z0peu0ChVwnZX_sBIRqJw$ *Invited Speakers* - Isil Dillig, UT Austin, United States - Javier Esparza, TU Munich, Germany - Thomas A. Henzinger, IST Austria *Organizing Committee* Program Chairs: - Bernd Finkbeiner, CISPA Helmholtz Center for Information Security, Germany - Thomas Wies, New York University, United States Artifact Evaluation Chair: - Mark Santolucito, Barnard College, Columbia University, United States Publicity Chair: - Ruzica Piskac, Yale University, United States From Simon.Gay at glasgow.ac.uk Mon Aug 30 09:33:53 2021 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Mon, 30 Aug 2021 14:33:53 +0100 Subject: [TYPES/announce] Academic positions in cybersecurity, University of Glasgow, UK Message-ID: <8a404273-7523-be85-93f1-9f0d8ca5b708@glasgow.ac.uk> University of Glasgow - School of Computing Science Lecturer/ Senior Lecturer/ Reader in Cybersecurity Salary: Grade 7 (Lecturer) ?35,845 - ?40,322 Grade 8 (Lecturer) ?44,045 - ?51,034 Grade 9 (Senior Lecturer / Reader) ?52,560 - ?59,135 per annum. The University of Glasgow, established in 1451, is a member of the UK's Russell Group of leading universities. The University is committed to enhancing its position as one of the world's great broad-based research-intensive universities. The School of Computing Science invites applications for the post of Lecturer / Senior Lecturer / Reader (based on experience and qualifications) in Cybersecurity. We are particularly interested in applicants with outstanding achievements in areas covering embedded and networked systems security and resilience, operating systems security, hardware security, data privacy, and cryptography. Applicants with expertise in formal approaches to security, including programming language approaches, are welcome. We have a long-standing record in areas spanning topics related to the security and resilience of networked systems, and the security and safety for Cyber-Physical Systems (CPS). We have expanded our portfolio into hardware security, software verification, IoT privacy as well as human-centered and usable security. We are currently hosting two out of the nine projects funded nationally by the UKRI digital security by design Industrial Strategy Challenge Fund (ISCF) in 2020 to explore hardware capabilities in designing secure systems. We have also recently been awarded five out of a total of eighteen projects from the 2nd Strategic Research Fund (SRF) Funding Call of the PETRAS National Centre of Excellence for IoT Systems Cybersecurity. We are hosting the Cyber Defence Lab, a unique laboratory facility providing exclusive access to a set of safety-critical network infrastructures, hosting data from digital twins of several UK critical infrastructures. You will develop, lead and sustain research of international standard in Computing Science; contribute to teaching, assessment, project supervision, and curriculum design at undergraduate and postgraduate levels; and participate in School management and organisation. For appointment at Reader you will have an outstanding track record of national and international distinction and leadership in research, including publications, income and awards, bringing external recognition and distinction to yourself and the University. Two positions are available. These positions are equivalent to US tenure track Assistant or Associate Professor. For further details please visit: https://urldefense.com/v3/__https://www.flipsnack.com/UofGRecruitment/lslr-in-cybersecurity-063667.html__;!!IBzWLUs!FM3O4BKycMScH-tQlob9HOYD2pF5Y1XR1idL3_Xvc8k9uez2btxYFSAH7HN_S2cU_pM16c5YgTmV-Q$ We strongly endorse the principles of Athena SWAN, including a supportive and flexible working environment, with commitment from all levels of the organisation in promoting gender equity. We particularly welcome applications from women and other groups who are traditionally under-represented in Computing Science. From gunther.reissig at unibw-muenchen.de Mon Aug 30 12:32:45 2021 From: gunther.reissig at unibw-muenchen.de (=?ISO-8859-15?Q?Gunther_Rei=DFig?=) Date: Mon, 30 Aug 2021 18:32:45 +0200 (CEST) Subject: [TYPES/announce] Postdoc position: Formal Methods (Munich, Germany) Message-ID: We invite applications for a post-doctoral researcher position in the field of formal methods, in Munich, Germany, the city of the Oktoberfest. The successful candidate is expected to advance the state of the art of abstraction-based synthesis and verification and to extend existing synthesis software. Depending on background and interests of the candidate, possible research foci are: automated determination of error bounds for floating-point implementations of numerical algorithms; parallelizable on-the-fly synthesis algorithms; adaptive state discretization; input/output languages and problem specific compiler for synthesis software. Required qualifications: * PhD degree in Computer Science, Systems and Control, Mathematics, or a related field. Exceptionally qualified and experienced candidates with an MSc degree will also be considered. * Solid experience in one of the following fields: Set-valued numerics; validated floating-point arithmetic; dynamic programming; formal methods; reachability analysis; software development. * Programming proficiency (C or Ada). * Efficient communication skills in English. The position is full-time and paid according to pay scale ``TVOeD Bund, E 14''. Actual income depends on marital status and professional experience, and starts from EUR 33000 net p.a. (E-13/EUR 31000 for applicants with an MSc degree). Reimbursement for travel expenses to conferences. No teaching load. The position is available immediately and for a duration until April 2023. It is open to applicants worldwide; no special security clearance necessary. Your complete application consists of the following documents, which should be sent as a single PDF file to the email address given below (deadline: September 19, 2021): * CV * One-page cover letter (clearly indicating available start date as well as relevant qualifications, experience and motivation) * University certificates and transcripts (BSc, MSc and PhD degrees) * Up to three letters of recommendation * List of publications * Possibly an English language certificate All documents should be in English or German. Gunther Reissig https://urldefense.com/v3/__http://www.reiszig.de/gunther/__;!!IBzWLUs!EgjqJNBwkxQajNf9KNtq1VHZe5mDmNadGClXcuNGBg8XbbzKAivNcbY_sPbUIyx4-_c3jb83jy2igA$ Email: gunther2016 at reiszig.de, Subject: Postdoc ref 9y22x Bundeswehr University Munich, Germany Department of Aerospace Engineering Institute of Control Engineering From ifl21.publicity at gmail.com Mon Aug 30 15:32:24 2021 From: ifl21.publicity at gmail.com (Pieter Koopman) Date: Mon, 30 Aug 2021 12:32:24 -0700 Subject: [TYPES/announce] IFL'21 final call for participation Message-ID: ================================================================================ IFL 2021 33rd Symposium on Implementation and Application of Functional Languages venue: online 1 - 3 September 2021 https://urldefense.com/v3/__https://ifl21.cs.ru.nl__;!!IBzWLUs!CUUOamf3xjRt8N37T_MbOQwv6Omni6qDdNPeL_8JUzLLkxAVpcJAOPrZaU0yge_5-xywnH6Z96B6lA$ *Registration* *Registration is **free of charge, but required for participation!* We will mail the zoom link only to registered participants. Use the below link to register for IFL 2021: https://urldefense.com/v3/__https://docs.google.com/forms/d/e/1FAIpQLSdMFjo-GumKjk4i7szs7n4DhWqKt96t8ofIqshfQFrf4jnvsA/viewform?usp=sf_link__;!!IBzWLUs!CUUOamf3xjRt8N37T_MbOQwv6Omni6qDdNPeL_8JUzLLkxAVpcJAOPrZaU0yge_5-xywnH4UPOIBQA$ *Program* The program is now available at https://urldefense.com/v3/__https://ifl21.cs.ru.nl/Program__;!!IBzWLUs!CUUOamf3xjRt8N37T_MbOQwv6Omni6qDdNPeL_8JUzLLkxAVpcJAOPrZaU0yge_5-xywnH49dWwGdA$ . *Scope* The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2021 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. *Organisation* IFL 2021 Chairs: Pieter Koopman and Peter Achten, Radboud University, The Netherlands IFL Publicity chair: Pieter Koopman, Radboud University, The Netherlands *PC* Peter Achten (co-chair) - Radboud University, Netherlands Thomas van Binsbergen - University of Amsterdam, Netherlands Edwin Brady - University of St. Andrews, Scotland Laura Castro - University of A Coru?a, Spain Youyou Cong - Tokyo Institute of Technology, Japan Olaf Chitil - University of Kent, England Andy Gill - University of Kansas, USA Clemens Grelck - University of Amsterdam, Netherlands John Hughes - Chalmers University, Sweden Pieter Koopman (co-chair) - Radboud University, Netherlands Cynthia Kop - Radboud University, Netherlands Jay McCarthey - University of Massachussetts Lowell, USA Neil Mitchell - Facebook, England Jan De Muijnck-Hughes - Glasgow University, Scotland Keiko Nakata - SAP Innovation Center Potsdam, Germany Jurri?n Stutterheim - Standard Chartered, Singapore Simon Thompson - University of Kent, England Melinda T?th - E?tvos Lor?nd University, Hungary Phil Trinder - Glasgow University, Scotland Meng Wang - University of Bristol, England Vikt?ria Zs?k - E?tvos Lor?nd University, Hungary [image: beacon] -------------- next part -------------- An HTML attachment was scrubbed... URL: From tristanj at bc.edu Mon Aug 30 18:51:24 2021 From: tristanj at bc.edu (Jean-Baptiste Tristan) Date: Mon, 30 Aug 2021 18:51:24 -0400 Subject: [TYPES/announce] Call for extended abstracts: Languages for Inference 2022 (LAFI'22) Message-ID: Call for Extended Abstracts ===================================================================== Call for Extended Abstracts LAFI 2022 POPL 2022 workshop on Languages for Inference January 16, 2022 https://urldefense.com/v3/__https://popl22.sigplan.org/home/lafi-2022__;!!IBzWLUs!BMDu21e5s7dUb1mpczYYKC2ua77kE2ZWOuUKCY4Q1qIlH0lR7eoNqE5KWsuL9b6mKQnaiM2_ovmoPw$ Submission deadline on October 15, 2021! ==================================================================== ***** Submission Summary ***** Deadline: October 15, 2021 (AoE) Link: https://urldefense.com/v3/__https://lafi22.hotcrp.com/__;!!IBzWLUs!BMDu21e5s7dUb1mpczYYKC2ua77kE2ZWOuUKCY4Q1qIlH0lR7eoNqE5KWsuL9b6mKQnaiM0QZJ5BWw$ Format: extended abstract (2 pages + references) ***** Call for Extended Abstracts ***** Inference concerns re-calibrating program parameters based on observed data, and has gained wide traction in machine learning and data science. Inference can be driven by probabilistic analysis and simulation, and through back-propagation and differentiation. Languages for inference offer built-in support for expressing probabilistic models and inference methods as programs, to ease reasoning, use, and reuse. The recent rise of practical implementations as well as research activity in inference-based programming has renewed the need for semantics to help us share insights and innovations. This workshop aims to bring programming-language and machine-learning researchers together to advance all aspects of languages for inference. Topics include but are not limited to: - design of programming languages for inference and/or differentiable programming; - inference algorithms for probabilistic programming languages, including ones that incorporate automatic differentiation; - automatic differentiation algorithms for differentiable programming languages; - probabilistic generative modeling and inference; - variational and differential modeling and inference; - semantics (axiomatic, operational, denotational, games, etc) and types for inference and/or differentiable programming; - efficient and correct implementation; - and last but not least, applications of inference and/or differentiable programming. We expect this workshop to be informal, and our goal is to foster collaboration and establish common ground. Thus, the proceedings will not be a formal or archival publication, and we expect to spend only a portion of the workshop day on traditional research talks. Nevertheless, as a concrete basis for fruitful discussions, we call for extended abstracts describing specific and ideally ongoing work on probabilistic and differential programming languages, semantics, and systems. ***** Submission guidelines ***** Submission deadline on October 15, 2021 (AoE) Submission link: https://urldefense.com/v3/__https://lafi22.hotcrp.com/__;!!IBzWLUs!BMDu21e5s7dUb1mpczYYKC2ua77kE2ZWOuUKCY4Q1qIlH0lR7eoNqE5KWsuL9b6mKQnaiM0QZJ5BWw$ Anonymous extended abstracts are up to 2 pages in PDF format, excluding references. In line with the SIGPLAN Republication Policy, inclusion of extended abstracts in the program is not intended to preclude later formal publication. -- Jean-Baptiste Tristan Associate Professor Computer Science Department Boston College Website -------------- next part -------------- An HTML attachment was scrubbed... URL: From xu at math.lmu.de Wed Sep 1 03:30:40 2021 From: xu at math.lmu.de (Chuangjie Xu) Date: Wed, 01 Sep 2021 09:30:40 +0200 Subject: [TYPES/announce] Proof and Computation 2021 Message-ID: <20210901093040.83979q6ke1g4ulgg@webmail.mathematik.uni-muenchen.de> [Second call for participation] [Apologies for multiple postings.] Autumn school "Proof and Computation" Online, 13th and 14th September 2021 https://urldefense.com/v3/__http://www.mathematik.uni-muenchen.de/*schwicht/pcv21.php__;fg!!IBzWLUs!GB5JhgLLRZcY_wf7v3SD40Lbp7hzmVIvjdtyJDFTZ2AwbzjW-KmMTv9yIjMkedPDcG3NvAxOTTj19Q$ This year's autumn school "Proof and Computation" will be held as an online workshop from 13th to 14th September 2021. SCOPE -------------------- - Predicative Foundations - Constructive Mathematics and Type Theory - Computation in Higher Types - Extraction of Programs from Proofs TALKS -------------------- - Liron Cohen: Effectful Proving (and Disproving) - David Corfield: Modal Type Theories - Grigory Devadze: Computer-certified proofs for control theoretic aspects and program extraction - Dominik Kirst: Formalising Metamathematics in Constructive Type Theory - Klaus Mainzer: Proof and Computation: Perspectives of Mathematics, Computer Science, and Philosophy - Antonio Piccolomini d'Aragona: Epistemic grounding. Semantics and calculi based on Prawitz's theory of grounds - Sebastian Posur: On free abelian categories for theorem proving - Florian Steinberg: Continuity, computability and discreteness - Holger Thies: Complexity Theory in Analysis with Applications to Differential Equations REGISTRATION -------------------- If you are interested in participating, please write to Nils K?pp (koepp at math.lmu.de) to receive the Zoom link. The workshop is supported by the Udo Keller Stiftung (Hamburg) and the CID (Computing with Infinite Data) programme of the European Commission. Klaus Mainzer Peter Schuster Helmut Schwichtenberg ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program. From johannes.kinder at unibw.de Wed Sep 1 10:56:11 2021 From: johannes.kinder at unibw.de (Kinder, Johannes) Date: Wed, 1 Sep 2021 14:56:11 +0000 Subject: [TYPES/announce] PhD and Postdoc positions in Security and Program Analysis at UniBw Munich Message-ID: <91531807-9459-468C-BFAC-FCDF331CCFD0@unibw.de> Applications are invited for postdoc and PhD positions at the CODE Research Institute of UniBw Munich, Germany, in Johannes Kinder's PATCH lab ( https://urldefense.com/v3/__https://www.unibw.de/patch/__;!!IBzWLUs!DZ2w3oRka2U-cE6zbrFki_h6VUH8tY56kaFTUxCj0xVH7TwyHZR-dPEYw-5SZPhGTye3sYBF9Bmv9g$ ). The positions are fully funded at federal salary level E13. Positions are available on two projects on secure software supply chains. Relevant topics include but are not limited to: - Static analysis of dynamically typed languages - Modeling of malicious behavior - Anomaly detection in runtime behavior across software versions - Combinatorial fuzz testing Interested candidates should send their application to Johannes Kinder by September 15, 2021. More information on the positions and the application process is available at https://urldefense.com/v3/__https://www.unibw.de/patch/vacancies__;!!IBzWLUs!DZ2w3oRka2U-cE6zbrFki_h6VUH8tY56kaFTUxCj0xVH7TwyHZR-dPEYw-5SZPhGTye3sYA6S_e_Dg$ From harley.eades at gmail.com Wed Sep 1 15:07:30 2021 From: harley.eades at gmail.com (Harley D. Eades III) Date: Wed, 1 Sep 2021 15:07:30 -0400 Subject: [TYPES/announce] Update: Seminar talk on Session Logical Relations for Noninterference Message-ID: Hi, everyone. This is a friendly reminder regarding this weeks seminar talk. Please be advised that the Zoom link this semester is different from last years. Please RSVP to get the updated link. Thanks, Harley On Friday, Sept. 3, 2021 between 1pm and 2pm EST (5pm - 6pm UTC), Dr. Stephanie Balzer will be giving a presentation as part of the CS Colloquium Series at Augusta University. Presentation details can be found here: https://urldefense.com/v3/__https://the-au-forml-lab.github.io/colloquium_talks/Balzer.html__;!!IBzWLUs!BGgwTcPqNNh-eFvjSWVjMaGckfN8pOE4Cil7ZsiP4e8mPFJUC1PsKjYtbdxeG1nZVeWkf9tT45QhLw$ Stephanie will be discussing their recent work on linear session types and interference. It is going to be super interesting. These talks are open to the general public via Zoom and Youtube. I'll be live streaming it on Youtube. If you are interested in attending the Zoom meeting please RSVP with me before the talk. Questions will be taken from those on Zoom and YouTube. If you care to watch via YouTube, please use the following link: https://urldefense.com/v3/__https://youtu.be/lJpK9CIgT30__;!!IBzWLUs!BGgwTcPqNNh-eFvjSWVjMaGckfN8pOE4Cil7ZsiP4e8mPFJUC1PsKjYtbdxeG1nZVeWkf9sRvqjyRg$ Feel free to share this message with everyone you know. I hope all of you, your family and friends are doing well! -------------- next part -------------- An HTML attachment was scrubbed... URL: From riccardo.treglia at unito.it Wed Sep 1 15:34:35 2021 From: riccardo.treglia at unito.it (Riccardo Treglia) Date: Wed, 1 Sep 2021 21:34:35 +0200 Subject: [TYPES/announce] ITRS Call for Post-Proceedings Message-ID: ITRS 2021 Call for Post-ProceedingsTenth Workshop on Intersection Types and Related Systems - ITRS 2021 17 July 2021, Online Affiliated with FSCD , 17-24 July 2021, Buenos Aires Web page: https://urldefense.com/v3/__http://www.di.unito.it/*deligu/ITRS2021/__;fg!!IBzWLUs!AR_MVm7M1emYukg5-ncWfFC6B2TnQeW6IDRSf1zYYJEA4kOsvG_PBUUyITHn2U2YUo-7l8D8xCybkw$ Aims and Scope Intersection types were introduced near the end of the 1970s to overcome the limitations of Curry's type assignment system and to provide a characterization of the strongly normalizing terms of the Lambda Calculus. The key idea is to introduce an intersection type constructor ? such that a term of type t ? s can be used at both type t and s within the same context. This provides a finite polymorphism where various, even unrelated, types of the term are listed explicitly, differently from the more widely used universally quantified types where the polymorphic type is the common schema that stands for its various type instances. As a consequence, more terms (all and only the normalizing terms) can be typed than with universal polymorphism. Although intersection types were initially intended for use in analyzing and/or synthesizing lambda models as well as in analyzing normalization properties, over the last twenty years the scope of the research on intersection types and related systems has broadened in many directions. Restricted (and more manageable) forms have been investigated, such as refinement types. Type systems based on intersection type theory have been extensively studied for practical purposes, such as program analysis and higher-order model checking. The dual notion of union types turned out to be quite useful for programming languages. Finally, the behavioral approach to types, which can give a static specification of computational properties, has become central in the most recent research on type theory. The ITRS 2021 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches. Possible topics for submitted papers include, but are not limited to: - Formal properties of systems with intersection types. - Results for related systems, such as union types, refinement types, or singleton types. - Applications to lambda calculus, pi-calculus and similar systems. - Applications for programming languages, program analysis, and program verification. - Applications for other areas, such as database query languages and program extraction from proofs. - Related approaches using behavioral/intensional types and/or denotational semantics to characterize computational properties. - Quantitative refinements of intersection types. ITRS workshops have been held every two years (with the exception of 2020, because of COVID-19 outbreak). Information about the previous events is available on the ITRS home page . Post-Proceedings We are planning post-proceedings, including presentations to the workshop and submissions accepted via an open call with *dates*: - submission deadline: *1 October* - acceptance communication: *5 November* - camera-ready version: *19 November* Papers should not be published elsewhere, with original results or surveying ongoing research. They should be written in English using LaTex and will appear on EPTCS: see Information for Authors . Submissions should be 20 pages long, excluding bibliography and avoiding technical appendices. Submissions are expected via EasyChair . Program Committee - Antonio Bucciarelli, Universit? de Paris, France - Daniel de Carvalho, Universit? Grenoble Alpes, France - Andrej Dudenhefner, Saarland University, Germany - Silvia Ghilezan, University of Novi Sad, Serbia - Giulio Guerrieri, University of Bath, UK - Ugo de' Liguoro, Universit? di Torino, Italy (chair) - Jeremy Siek, Indiana University Bloomington, USA (co-chair) ------------------------------ Steering Committee - Mariangiola Dezani-Ciancaglini, Universit? di Torino, Italy - Jakob Rehof, TU University of Dortmund, Germany - Joe Wells, Heriot-Watt University, Scotland Organizers: - Ugo de' Liguoro, Universit? di Torino, Italy - Riccardo Treglia, Universit? di Torino, Italy ( riccardo.treglia at unito.it) -------------- next part -------------- An HTML attachment was scrubbed... URL: From jonathan.protzenko at gmail.com Wed Sep 1 15:35:46 2021 From: jonathan.protzenko at gmail.com (Jonathan Protzenko) Date: Wed, 1 Sep 2021 12:35:46 -0700 Subject: [TYPES/announce] Call for Submissions: Programming Languages and the Law (ProLaLa) Message-ID: <62553c8d-bab4-1894-39d9-fd091c98eaa8@gmail.com> ----------------------------------------------------------------------- ?? ProLaLa 2022 -- 1st Workshop on Programming Languages and the Law ?????????????????????? Sunday Jan 16th, 2022 ???????????????????????? Philadelphia, PA ???????????????????? co-located with POPL 2022 ----------------------------------------------------------------------- ??????????????????? (please forward to anyone who might be interested!) We are pleased to announce ProLaLa'22, a new workshop concerned with the intersection of PL (Programming Languages) techniques and the law. We are particularly concerned with the following topics: - language design for legal matters; - static analysis of legal texts; - program synthesis and repair for legal software components; - formal modeling of legal semantics; - non-standard logics in support of legal reasoning; - program verification for legal expert systems. If you have explored any of these areas, we encourage you to submit a short abstract. We are hoping to solidify around this workshop what we believe is a nascent community. As such, the workshop will be informal, and we strongly encourage you to submit ongoing or already-published work in the form of a brief 3-page submission for a long talk, or a 1-page submission for a short talk. Full details: https://urldefense.com/v3/__https://popl22.sigplan.org/home/prolala-2022*Call-for-submissions__;Iw!!IBzWLUs!AloyNnJt7KiJd_-0r2oZovKXP6F0lt-y-BCRNtudlg-AO259turMNrhdXyld6fxMijBrpHmPWOBU3g$ ### Venue ProLaLa will be colocated with POPL'22. If POPL'22 goes virtual, we will be virtual too. If POPL'22 happens in-person, we will support hybrid (in-person and remote) participation. ### Submission details We accept two kinds of submissions. - Long talks: 3 pages excluding references - Short talks: 1 page excluding references No formatting requirements. We recommend using SIGPLAN's two-column LaTeX format if possible. Submission site: https://urldefense.com/v3/__https://prolala22.hotcrp.com/__;!!IBzWLUs!AloyNnJt7KiJd_-0r2oZovKXP6F0lt-y-BCRNtudlg-AO259turMNrhdXyld6fxMijBrpHkB4QL-eg$ ### Important dates - Thu 28 Oct 2021: Submission deadline - Thu 11 Nov 2021: Notification of acceptance - Sun 16 Jan 2022: Workshop ## Program committee - Timos Antonopoulos, Yale University - Joaquin Arias, Universidad Polit?cnica de Madrid and IMDEA Software Institute, Spain - Shrutarshi Basu, Cornell University, USA - Nate Foster, Cornell University, USA - James Grimmelmann, Cornell University, USA - Sarah Lawsky (Co-Chair), Northwestern University, USA - Denis Merigoux, INRIA, France - Ruzica Piskac, Yale University, USA - Jonathan Protzenko (Co-Chair), Microsoft Research, USA - Giovanni Sartor, University of Bologna, Italy - Ken Satoh, National Institute of Informatics, Japan - Kanae Tsushima, National Institute of Informatics, Japan - Meng Weng Wong, Singapore Management University, Singapore From frederic.blanqui at inria.fr Fri Sep 3 04:00:17 2021 From: frederic.blanqui at inria.fr (=?UTF-8?B?RnLDqWTDqXJpYyBCbGFucXVp?=) Date: Fri, 3 Sep 2021 10:00:17 +0200 Subject: [TYPES/announce] EuroProofNet - Call for Working Group membership Application In-Reply-To: <973e881b-ab94-21e4-17b2-f94f75643e2b@inria.fr> References: <973e881b-ab94-21e4-17b2-f94f75643e2b@inria.fr> Message-ID: Dear all, Registration to EuroProofNet working groups is open on https://urldefense.com/v3/__https://e-services.cost.eu/action/CA20111/working-groups/apply__;!!IBzWLUs!HACKadZ3dG8OMy8PylFKyN8vfXHPjunfXyUqaQcDROVA7ESErVDZN8UNDeBhByowFVKR_ag2DK5rMQ$ (it's possible to register to several working groups). EuroProofNet is new COST action (see https://urldefense.com/v3/__https://www.cost.eu/actions/CA20111/__;!!IBzWLUs!HACKadZ3dG8OMy8PylFKyN8vfXHPjunfXyUqaQcDROVA7ESErVDZN8UNDeBhByowFVKR_aguWLrMiQ$ ) aiming at federating all the European researchers working on proofs in order to improve the interoperability of proof systems. There are currently 6 working groups (WG): - WG1: Proof systems interoperability. - WG2: Automated theorem provers. - WG3: Program verification. - WG4: Libraries of formal proofs. - WG5: Machine learning on proofs. - WG6: Type theory. You will find all the details on the objectives of EuroProofNet in https://urldefense.com/v3/__https://e-services.cost.eu/files/domain_files/CA/Action_CA20111/mou/CA20111-e.pdf__;!!IBzWLUs!HACKadZ3dG8OMy8PylFKyN8vfXHPjunfXyUqaQcDROVA7ESErVDZN8UNDeBhByowFVKR_ahUkW2abQ$ . A COST action can fund visits to other labs, and participation to summer schools, workshops and conferences. Anyone willing to contribute to the goals of the action is eligible. If you are interested, you just need to register on https://urldefense.com/v3/__https://e-services.cost.eu/action/CA20111/working-groups/apply__;!!IBzWLUs!HACKadZ3dG8OMy8PylFKyN8vfXHPjunfXyUqaQcDROVA7ESErVDZN8UNDeBhByowFVKR_ag2DK5rMQ$ . Best regards, Fr?d?ric Blanqui, chair of EuroProofNet. From Pascal.Fontaine at inria.fr Fri Sep 3 08:41:50 2021 From: Pascal.Fontaine at inria.fr (Pascal Fontaine) Date: Fri, 3 Sep 2021 14:41:50 +0200 Subject: [TYPES/announce] Call for Participation: In-person School on Verification Technology, Systems and Applications (VTSA 2021) Message-ID: <319245d2-5175-cee2-e87b-c1d9b7b55a34@inria.fr> Dear All, you will find below a call for participation for an in-person school, essentially for PhD students in the domain.? Notice the short deadline. We would be grateful if you could forward to your students. Best regards, ? Pascal (for the organizing committee) --- In-person School on Verification Technology, Systems and Applications (VTSA 2021) October 11-15, 2021, Liege, Belgium The school on verification technology, systems & applications focuses on fundamental aspects of verification techniques, their implementation, and their use for concrete applications. It is organized by Inria Nancy, the Max-Planck-Institut f?r Informatik in Saarbr?cken, and the Universities of Liege and of Luxembourg, and will take place at the University of Liege, Belgium, from October 11 to 15, 2021. The following speakers have agreed to lecture at the school: Gilles Audemard: SAT solver essentials, SAT modeling and algorithms Cezara Dragoi: Towards automated verification of fault-tolerant distributed systems Christoph Haase: Linear arithmetic theories: theory and applications Leslie Lamport: Discussion Josef Widder: Consensus in distributed systems Participation in the school is free to anybody holding at least a bachelor degree or equivalent; it includes the lectures, coffee and lunch breaks, and a school dinner. Attendance is limited to 40 participants. Please apply electronically by sending an email to vtsa2021 at montefiore.ulg.ac.be including - a one-page CV, - an application letter explaining your interest in the school and your experience in the area, and the question to Leslie Lamport (see below) - a copy of your bachelor certificate (or equivalent or a more significant certificate) - a short statement if you want to contribute to the student session We are very happy that Leslie Lamport, Turing Award 2013, will be present for a discussion at VTSA 2021.? We ask every applicant to watch his talk "If you're Not Writing a Program Don't Use a Programming Language": https://urldefense.com/v3/__http://newsroom.hlf-foundation.org/newsroom/lectures/video/lecture-if-youre-not-writing-a-program-dont-use-a-programming-language.html__;!!IBzWLUs!AiV_PiQ8oMrDWTZ4JPlLOs-_2ClgpSpqTh3O2aecN4FNcRh0fRyl_wBCPA7UalygQX2GUQ9aS_nPVg$ and think about one question that she/he would like to ask during this discussion with Leslie Lamport.? Please provide this question in your application letter. The deadline for application is September 15, 2021. Notification of acceptance will be given by September 20, 2021. There is still some uncertainty with the current sanitary crisis. Please check the traveling rules for Belgium that apply to you here: https://urldefense.com/v3/__https://www.info-coronavirus.be/en/travels/__;!!IBzWLUs!AiV_PiQ8oMrDWTZ4JPlLOs-_2ClgpSpqTh3O2aecN4FNcRh0fRyl_wBCPA7UalygQX2GUQ86oKzSKQ$ As for now, fully vaccinated people from EU are allowed to travel to Belgium without quarantine, but filling a Passenger Locator Form (PLF) is required. If the school cannot happen in person, it will be canceled (and rescheduled when the situation gets clear). More details is available on the school Web page at https://urldefense.com/v3/__https://www.mpi-inf.mpg.de/vtsa21__;!!IBzWLUs!AiV_PiQ8oMrDWTZ4JPlLOs-_2ClgpSpqTh3O2aecN4FNcRh0fRyl_wBCPA7UalygQX2GUQ8VQrjj8Q$ From peterol at ifi.uio.no Sun Sep 5 12:16:35 2021 From: peterol at ifi.uio.no (=?utf-8?Q?Peter_Csaba_=C3=98lveczky?=) Date: Sun, 5 Sep 2021 18:16:35 +0200 Subject: [TYPES/announce] Call for (virtual and free) participation, ICTAC'21, Sept 8-10 Message-ID: <8CFEDA60-D0BA-42E0-9DF7-3159ADC0CF9F@ifi.uio.no> -------------------------------------------------------------------- Call for Participation ICTAC 2021 18th International Colloquium on Theoretical Aspects of Computing Virtually from Nur-Sultan, Kazakhstan, September 8-10, 2021 https://urldefense.com/v3/__https://ictac2021.github.io/__;!!IBzWLUs!HfWaH087TPZ3piWPWsHr-OAqwhgMew5X-74qnwAl6cmw4KtmQxtoszPd6EQrqtFkNf8O1OrO7sY0BA$ --------------------------------------------------------------------- We are looking forward to seeing you virtually at ICTAC 2021! ICTAC 2021 is a virtual event with no conference fee. You can join us using the Zoom link https://urldefense.com/v3/__https://nu-edu-kz.zoom.us/j/91588633830?pwd=WUhFdXhkMzFyMkZCV1Uzb004R2lrdz09__;!!IBzWLUs!HfWaH087TPZ3piWPWsHr-OAqwhgMew5X-74qnwAl6cmw4KtmQxtoszPd6EQrqtFkNf8O1Oq1ovfOjA$ The full conference schedule is available at https://urldefense.com/v3/__https://ictac2021.github.io/programme.html__;!!IBzWLUs!HfWaH087TPZ3piWPWsHr-OAqwhgMew5X-74qnwAl6cmw4KtmQxtoszPd6EQrqtFkNf8O1OqadmudRw$ KEYNOTE TALKS ? Kim Larsen - Model Checking and Machine Learning Joining Forces ? Wednesday 8 September at 9:30am GMT+2 (Central European Summer Time) ? Wil van der Aalst - Concurrency and Objects Matter: Disentangling the Fabric of Real Operational Processes ? Thursday 9 September at 9:30am GMT+2 (Central European Summer Time) ? Grigore Rosu - Formal Design, Implementation and Verification of Blockchain Languages ? Thursday 9 September at 3:00pm GMT+2 (Central European Summer Time) ? Alan Dix - Qualitative?Quantitative Reasoning: thinking informally about formal things ? Friday 10 September at 9:30am GMT+2 (Central European Summer Time) OVERVIEW AND SCOPE The ICTAC conference series aims at bringing together researchers and practitioners from academia, industry and government to present research and exchange ideas and experience addressing challenges in both theoretical aspects of computing and the exploitation of theory through methods and tools for system development. ICTAC also aims to promote research cooperation between developing and industrial countries. See you at ICTAC 2021! Antonio Cerone and Peter ?lveczky ICTAC 2021 Program Co-chairs From andersmortberg at gmail.com Mon Sep 6 07:49:51 2021 From: andersmortberg at gmail.com (Anders Mortberg) Date: Mon, 6 Sep 2021 13:49:51 +0200 Subject: [TYPES/announce] Postdoctoral position in homotopy type theory and related topics at Stockholm University Message-ID: Dear all, I?m pleased to announce that we?re hiring a postdoctoral researcher in homotopy type theory and related topics at Stockholm University. It?s a 2 year position, provisionally starting January 2022, in the computational mathematics group of the Mathematics Department. The application deadline is 1 October. We welcome all applicants interested in working on homotopy type theory and related topics. Potential project topics include, but are not limited to: homotopy type theory, categorical models of type theories, cubical type theories, implementation of proof assistants, computer formalization of mathematics and computer science. Full details and application at: https://urldefense.com/v3/__https://www.su.se/english/about-the-university/work-at-su/available-jobs?rmpage=job&rmjob=15797&rmlang=UK__;!!IBzWLUs!HW4ucEENQqx0BeLkozigKEQZvUCYDHotG1kK5qIwWKsCeLbO6op2tU3PfHYbudVh0FwcIjXC5tgMKw$ Departmental webpage: https://urldefense.com/v3/__https://www.math.su.se/english/research__;!!IBzWLUs!HW4ucEENQqx0BeLkozigKEQZvUCYDHotG1kK5qIwWKsCeLbO6op2tU3PfHYbudVh0FwcIjUx0D4ePg$ Please get in touch with me if you have any questions about the position! Best, Anders -------------- next part -------------- An HTML attachment was scrubbed... URL: From J.G.H.Cockx at tudelft.nl Mon Sep 6 11:15:10 2021 From: J.G.H.Cockx at tudelft.nl (Jesper Cockx) Date: Mon, 6 Sep 2021 15:15:10 +0000 Subject: [TYPES/announce] Call for Contributions: WITS 2022 Message-ID: ---------------------------------------------------------------------- CALL FOR CONTRIBUTIONS 1st Workshop on the Implementation of Type Systems WITS 2022 January 22, 2022 Philadelphia, PA, USA https://urldefense.com/v3/__https://popl22.sigplan.org/home/wits-2022__;!!IBzWLUs!B2cM8NuFBN0bcJro06kAJVn9d3MZse0tTMZsjzD-cdfb7mDVGTEtTvYHK6FL_X_KcaxqurkmRFq8tw$ ---------------------------------------------------------------------- WITS 2022 is the first Workshop on the Implementation of Type Systems. The workshop will be held on January 22, 2022, in Philadelphia, PA, United States, co-located with POPL. The goal of this workshop is to bring together the implementors of a variety of languages with advanced type systems. The main focus is on the practical issues that come up in the implementation of these systems, rather than the theoretical frameworks that underlie them. In particular, we want to encourage exchanging ideas between the communities around specific systems that would otherwise be accessible to only a very select group. Given the importance of collaboration among the attendees at WITS, if circumstances around covid-19 force POPL (and its co-located events) to go virtual, WITS will be deferred until a time when we can come together safely in person. The workshop will have a mix of invited and contributed talks, organized discussion times, and informal collaboration time. *Scope* We invite participants to share their experiences, study differences among the implementations, and generalize lessons from those. We also want to promote the creation of a shared vocabulary and set of best practices for implementing type systems. Here are a few examples of topics we are interested to discuss: * syntax with binders and substitution * conversion modulo beta and eta * implicit arguments and metavariables * unification and constraint solving * metaprogramming and tactic languages * editor integration and automation * discoverability of language features * pretty printing and error messages This list is not exhaustive, so please contact the PC chairs in case you are unsure if a topic falls within the scope of the workshop. *Submissions* WITS solicits two kinds of submissions: * Contributed talks on the basis of an abstract. This can be on recently published or submitted work, work in progress, or even a project that is still in the idea phase. * Proposals for roundtable discussions. This can be on any topic within the scope of the workshop, but should have a broader scope than a contributed talk. If accepted, you will be in charge of leading a discussion of 45 minutes around the proposed topic together with other interested attendees. Both kinds of proposals should be accompanied by an abstract of max. 1 page (exclusive of references), formatted according to the guidelines for SIGPLAN conferences: use the `sigplan` option to the `acmart` LaTeX document class. WITS will have no published proceedings, so submitting to WITS does not interfere with submission (before, after, or simultaneously) with other venues. Submissions are handled via https://urldefense.com/v3/__https://wits22.hotcrp.com/__;!!IBzWLUs!B2cM8NuFBN0bcJro06kAJVn9d3MZse0tTMZsjzD-cdfb7mDVGTEtTvYHK6FL_X_KcaxqurkgDsyIGg$ . *Important Dates* - Abstract submission deadline: 16 November, 2021 (AoE) - Notification: 1 December, 2021 (AoE) - Workshop in Philadelphia: 22 January, 2022 *Attendance and registration* WITS 2022 is colocated with POPL 2022 in Philadelphia, USA. More information on registration and attendance will be announced later. *Program Committee* William J. Bowman, U. of British Columbia, Canada Jesper Cockx, TU Delft, Netherlands (co-chair) Leonardo de Moura, Microsoft Research, USA Richard A. Eisenberg, Tweag, USA (co-chair) Andr?s Kov?cs, Eotvos Lorand U., Hungary Pierre-Marie P?drot, INRIA, France Aaron Stump, U. of Iowa, USA Niki Vazou, IMDEA, Spain From marco.maggesi at unifi.it Tue Sep 7 15:29:41 2021 From: marco.maggesi at unifi.it (Marco Maggesi) Date: Tue, 7 Sep 2021 21:29:41 +0200 Subject: [TYPES/announce] School on Univalent Mathematics, Cortona (Italy), July 17-23, 2022 Message-ID: We are pleased to announce the School on Univalent Mathematics 2022, to be held at the Palazzone di Cortona (https://urldefense.com/v3/__https://www.sns.it/en/palazzone-di-cortona__;!!IBzWLUs!BhiubkeKgFdyTsF1oPcw791XFb5zABT5yfIoT3qU1IxDuuMRbOgNS9nO_xGSA2dp9I1lPW0m3Ozo6Q$ ), Cortona, Italy, July 17-23, 2022 (https://urldefense.com/v3/__https://unimath.github.io/cortona2022/__;!!IBzWLUs!BhiubkeKgFdyTsF1oPcw791XFb5zABT5yfIoT3qU1IxDuuMRbOgNS9nO_xGSA2dp9I1lPW1urJlFLw$ ) Overview ======== Homotopy Type Theory is an emerging field of mathematics that studies a fruitful relationship between homotopy theory and (dependent) type theory. This relation plays a crucial role in Voevodsky's program of Univalent Foundations, a new approach to foundations of mathematics based on ideas from homotopy theory, such as the Univalence Principle. The UniMath library is a large repository of computer-checked mathematics, developed from the univalent viewpoint. It is based on the computer proof assistant Coq. In this school, we aim to introduce newcomers to the ideas of Univalent Foundations and mathematics therein, and to the formalization of mathematics in UniMath (https://urldefense.com/v3/__https://github.com/UniMath/UniMath__;!!IBzWLUs!BhiubkeKgFdyTsF1oPcw791XFb5zABT5yfIoT3qU1IxDuuMRbOgNS9nO_xGSA2dp9I1lPW3_uXxGog$ ), a library of Univalent Mathematics based on the Coq proof assistant. Format ======= Participants will receive an introduction to Univalent Foundations and to mathematics in those foundations. In the accompanying problem sessions, they will formalize pieces of univalent mathematics in the UniMath library. Prerequisites ========== Participants should be interested in mathematics and the use of computers for mathematical reasoning. Participants do not need to have prior knowledge of logic, Coq, or Univalent Foundations. Application and funding ======================= For information on how to participate, please visit https://urldefense.com/v3/__https://unimath.github.io/cortona2022__;!!IBzWLUs!BhiubkeKgFdyTsF1oPcw791XFb5zABT5yfIoT3qU1IxDuuMRbOgNS9nO_xGSA2dp9I1lPW15t2RSCw$ . Best regards, The organizers Benedikt Ahrens and Marco Maggesi -------------- next part -------------- An HTML attachment was scrubbed... URL: From andrei.h.popescu at gmail.com Wed Sep 8 03:00:00 2021 From: andrei.h.popescu at gmail.com (Andrei Popescu) Date: Wed, 8 Sep 2021 08:00:00 +0100 Subject: [TYPES/announce] 30 months postdoctoral research position at University of Sheffield involving proof-assistant-based verification -- application deadline 23 Sept. 2021 Message-ID: Greetings, A postdoctoral research position (Grade 7) is available at the University of Sheffield. The goal is to perform research in one of the following areas: 1. Formal modelling and verification of security properties for digital twins. This involves the design and development of theoretical mathematical models and the use of proof assistants, automated theorem provers, model checkers or related tools to formalize and verify properties of these models. 2. Fine-grained access control system for mission-critical digital twins. This involves the design and development of an advanced access control policy and the usage of security models and public key cryptography (such as CCA) to build proofs of concept in enhancing the security of digital twins. Closing date for applications: 23 Sept. 2021 Starting date: 7 Oct. 2021 or later Duration: 30 months Salary: ?32,344 Applications can be made by going to this page https://urldefense.com/v3/__https://jobs.shef.ac.uk/sap/bc/webdynpro/sap/hrrcf_a_posting_apply?PARAM=cG9zdF9pbnN0X2d1aWQ9NjEyNzRBN0Y2QjU4M0VEMUUxMDAwMDAwQUMxRTg4NzgmY2FuZF90eXBlPUVYVA*3d*3d&sap-client=400&sap-language=EN&sap-accessibility=X&sap-ep-themeroot=*2fSAP*2fPUBLIC*2fBC*2fUR*2fuos*__;JSUlJSUlJSM!!IBzWLUs!CcdJ6uGLgJj6Wd5gEo3znA0wJ0G9XqgyrmQJdFLcNMe8feFlWo4x-5GMoeYbrLq6xhyxOfh2wldrDQ$ and clicking on the "Apply" link. The "About the job" link contains more details about the position. I am happy to answer any informal inquiries. Best wishes, Andrei From harley.eades at gmail.com Wed Sep 8 11:05:13 2021 From: harley.eades at gmail.com (Harley D. Eades III) Date: Wed, 8 Sep 2021 11:05:13 -0400 Subject: [TYPES/announce] Seminar talk on Adjoint Reactive GUI Programming Message-ID: On Friday, Sept. 10, 2021 between 1pm and 2pm EST (6pm - 7pm UTC), Dr. Neel Krishnaswami will be giving a presentation as part of the CS Colloquium Series at Augusta University. Presentation details can be found here: https://urldefense.com/v3/__https://the-au-forml-lab.github.io/colloquium_talks/Krishnaswami.html__;!!IBzWLUs!GbuPXwwuPPS0w2loQ9fWXVZ8GvCLelb4EmYFuzzMG6H9ioeQIcNa6Gl1b4d_dgrVtakN8YRB0mR8Kw$ Neel will be telling us about his super interesting work on reactive programming and adjoints! These talks are open to the general public via Zoom and Youtube. I'll be live streaming it on Youtube. If you are interested in attending the Zoom meeting please RSVP with me before the talk. Note that this semester we are using a new Zoom account and so the access link is different from past semesters so please RSVP. Questions will be taken from those on Zoom and YouTube. If you care to watch via YouTube, please use the following link: https://urldefense.com/v3/__https://youtu.be/Jp5DsOXs6fE__;!!IBzWLUs!GbuPXwwuPPS0w2loQ9fWXVZ8GvCLelb4EmYFuzzMG6H9ioeQIcNa6Gl1b4d_dgrVtakN8YQOdxfpYw$ Feel free to share this message with everyone you know. I hope all of you, your family and friends are doing well! Best, Harley -------------- next part -------------- An HTML attachment was scrubbed... URL: From wjb at williamjbowman.com Wed Sep 8 13:16:52 2021 From: wjb at williamjbowman.com (William J. Bowman) Date: Wed, 8 Sep 2021 10:16:52 -0700 Subject: [TYPES/announce] PLDI 2022 First Call for Papers Message-ID: Please distribute widely. *Call for Papers* ==================== 2022 ACM Conference on Programming Language Design and Implementation (PLDI) Mon 20 - Fri 24 June 2022 San Diego, California, United States https://urldefense.com/v3/__https://pldi22.sigplan.org/track/pldi-2022-pldi*Call-for-Papers__;Iw!!IBzWLUs!Cy5YtOXW9ZHUE-inlRK9CfCvs_2ORsF0YOVQ1Yg5dSG0XlT0n8hFns0V0h12v40Ex7JzZg9dMivTsA$ PLDI is a premier forum for programming language research, broadly construed, including design, implementation, theory, applications, and performance. PLDI seeks outstanding research that extends and/or applies programming-language concepts to advance the field of computing. Novel system designs, thorough empirical work, well-motivated theoretical results, and new application areas are all welcome emphases in strong PLDI submissions. Reviewers will evaluate each contribution for its accuracy, significance, originality, and clarity. Submissions should be organized to communicate clearly to a broad programming-language audience as well as to experts on the paper?s topics. Papers should identify what has been accomplished and how it relates to previous work. Authors of empirical papers are encouraged to consider the seven categories of the SIGPLAN Empirical Evaluation Guidelines when preparing their submissions. (https://urldefense.com/v3/__http://www.sigplan.org/Resources/EmpiricalEvaluation/__;!!IBzWLUs!Cy5YtOXW9ZHUE-inlRK9CfCvs_2ORsF0YOVQ1Yg5dSG0XlT0n8hFns0V0h12v40Ex7JzZg8cDImXZQ$ ) *Important Dates* =============== Fri 19 Nov 2021, Submission Deadline Mon 7 Feb - Wed 9 Feb 2022, Author Response Fri 25 Feb 2022, Author Notification *Author Instructions* ================== https://urldefense.com/v3/__https://pldi22.sigplan.org/track/pldi-2022-pldi*Call-for-Papers__;Iw!!IBzWLUs!Cy5YtOXW9ZHUE-inlRK9CfCvs_2ORsF0YOVQ1Yg5dSG0XlT0n8hFns0V0h12v40Ex7JzZg9dMivTsA$ Submission site: https://urldefense.com/v3/__https://pldi2022.hotcrp.com/__;!!IBzWLUs!Cy5YtOXW9ZHUE-inlRK9CfCvs_2ORsF0YOVQ1Yg5dSG0XlT0n8hFns0V0h12v40Ex7JzZg8N9R4uEA$ *Organizing Committee* ==================== General Chair: Ranjit Jhala, U. of California at San Diego Program Chair: Isil Dillig, U. of Texas at Austin Web Chair: Dan Barowy, Williams College Publicity Co-Chairs: William J. Bowman, U. of British Columbia Arjun Guha, Northeastern U. Sponsorship Co-Chairs: Ravi Chugh, U. of Chicago Sasa Misailovic, U. of Illinois at Urbana-Champaign Workshops Co-Chairs: Nadia Polikarpova, U. of California at San Diego Alexandra Silva, U. College London Student Research Competition Co-Chairs: Tyler Sorensen, U. of California at Santa Cruz Jubi Taneja, Microsoft Research Artifact Evaluation Co-Chairs: Niki Vazou, IMDEA Software Institute Xinyu Wang, U. of Michigan https://urldefense.com/v3/__https://pldi22.sigplan.org/committee/pldi-2022-organizing-committee__;!!IBzWLUs!Cy5YtOXW9ZHUE-inlRK9CfCvs_2ORsF0YOVQ1Yg5dSG0XlT0n8hFns0V0h12v40Ex7JzZg-YjXeyCg$ -- William J. Bowman From shiloviis at mail.ru Thu Sep 9 05:05:56 2021 From: shiloviis at mail.ru (=?UTF-8?B?U2hpbG92IE5pa29sYXk=?=) Date: Thu, 09 Sep 2021 12:05:56 +0300 Subject: [TYPES/announce] =?utf-8?q?Call_for_short_submissions_-_PSSV-202?= =?utf-8?q?1=3A_Workshop_Program_Semantics=2C_Specification_and_Verificati?= =?utf-8?q?on_=28hybrid_format=29?= Message-ID: <1631178356.22461596@f384.i.mail.ru> PSSV-2021:?XII Workshop Program Semantics, Specification and Verification?(Theory and Applications)? is planned to be held in hybrid mode online (using Zoom)? and offline (at Innopolis University, ? https://urldefense.com/v3/__https://innopolis.university/en/__;!!IBzWLUs!BDvOi8schEL0XUvu9uvUjwVyRNGgWGo4cW2dMHrY1V-oM3wb5-EMz9S3DaXjTJIwpgidqZKN1tVQyg$ ) on Thursday and Friday November 4-5, 2021 ? PSSV-2021 workshop' page: ? https://urldefense.com/v3/__https://persons.iis.nsk.su/en/pssv21__;!!IBzWLUs!BDvOi8schEL0XUvu9uvUjwVyRNGgWGo4cW2dMHrY1V-oM3wb5-EMz9S3DaXjTJIwpgidqZIIgYXoEA$ ? PSSV Scope and Topics Research, work in progress, position and student papers were welcome. List of topics of interest includes (but is not limited to): * formalisms for program semantics * formal models and semantics of programs and systems * semantics of programming and specification languages * formal description techniques * logics for formal specification and verification * deductive program verification * automatic theorem proving * model checking of programs and systems * static analysis of programs * formal approach to testing and validation * program analysis and verification tools ? PSSV-2021 Program Committee: * Thomas Baar (University of Applied Sciences HTW Berlin, Germany) * Vladimir Itsykson (St. Petersburg State Polytech. University, Russia) * Andrei Klimov (Keldysh Institute of Applied Mathematics, Moscow, Russia) * Igor Konnov (Informal Systems, Austria) * Victor Kuliamin (Institute for System Programming, Moscow, Russia) * Alexei Lisitsa (University of Liverpool, UK) * Irina Lomazova (Higher School of Economics, Moscow, Russia) * Manuel Mazzara (Innopolis University, Russia) * Dmitry Mordvinov (St. Petersburg State University and JetBrains Research, Russia) * Sergey Staroletov (Polzunov Altai State Technical University, Barnaul, Russia), * Nina Yevtushenko (Tomsk State University and Institute for System Programming, RAS, Moscow, Russia). ? PSSV-2021 Program Co-Chairs: * Nikolay Shilov (Innopolis University, Russia, shiloviis(at)mail.ru) * Vladimir Zakharov (Moscow State University, Russia, zakh(at)cs.msu.su) ? Invited Sessions and Speakers * Invited session devoted to the anniversary the achievements of Professor Alexander K. Petrenko, Head of the Software Engineering Department of Institute for System Programming Russian Academy of Sciences (SED ISP RAS) ? ** Alexander K. Petrenko: The position of formal methods in nowadays software industrial development ? ** Victor V. Kuliamin: Formal Security Models ? ** Alexander S. Kamkin: High-Level Synthesis of Computing Systems: Motivation, Challenges, and Existing Solutions * Host session: talks from Innopolis University ? ** Nikolai D. Kudasov: Nameless and scope-safe (de Bruijn notation as a nested datatype)ms: Sound, Expressive, Fast. * More session(s) and speaker(s) may be added soon. (Please refer h https://urldefense.com/v3/__https://persons.iis.nsk.su/en/pssv21*invited__;Iw!!IBzWLUs!BDvOi8schEL0XUvu9uvUjwVyRNGgWGo4cW2dMHrY1V-oM3wb5-EMz9S3DaXjTJIwpgidqZK4-sgLOQ$ ? for more information about invited sessions, speakers and their talks.)? ? Submission and Publication The submission Web page for PSSV-2021:via EasyChair ( https://urldefense.com/v3/__https://easychair.org/conferences/?conf=pssv2021__;!!IBzWLUs!BDvOi8schEL0XUvu9uvUjwVyRNGgWGo4cW2dMHrY1V-oM3wb5-EMz9S3DaXjTJIwpgidqZIWuK33Dg$ ) ? Program Committee solicits? * regular research submissions in the form of an extended detailed abstract (6-8 pages in English, LNCS style recommended) to be reviewed by 3 PC members; * work in progress, position, poster and student research reports in the form of extended abstract (3-4 pages in English, LNCS style recommended) to be reviewed by a PC member. a PC member. ? Right now Easy Chair submission page ? https://urldefense.com/v3/__https://easychair.org/conferences/?conf=pssv2021__;!!IBzWLUs!BDvOi8schEL0XUvu9uvUjwVyRNGgWGo4cW2dMHrY1V-oM3wb5-EMz9S3DaXjTJIwpgidqZIWuK33Dg$ ? is open for regular paprs. Selected revised and extended papers will be published (after the workshop) in the Modeling and Analysis of Information Systems ( https://urldefense.com/v3/__https://www.mais-journal.ru__;!!IBzWLUs!BDvOi8schEL0XUvu9uvUjwVyRNGgWGo4cW2dMHrY1V-oM3wb5-EMz9S3DaXjTJIwpgidqZKDj9m7nw$ ), a Russian peer-review journal where PSSV selected and revised papers are published since the very first edition of the workshop in 2010. (See for example Vol 27, No 4 (2020) at ? https://urldefense.com/v3/__https://www.mais-journal.ru/jour/issue/view/124/showToc__;!!IBzWLUs!BDvOi8schEL0XUvu9uvUjwVyRNGgWGo4cW2dMHrY1V-oM3wb5-EMz9S3DaXjTJIwpgidqZLUnZpjIQ$ ? with selected and revised papers of PSSV-2020.) We expect (as it was in the previous years of the PSSV) that English translations of some of these selected papers will appear next year in Automatic Control and Computer Sciences( https://urldefense.com/v3/__http://www.springer.com/computer/hardware/journal/11950__;!!IBzWLUs!BDvOi8schEL0XUvu9uvUjwVyRNGgWGo4cW2dMHrY1V-oM3wb5-EMz9S3DaXjTJIwpgidqZIjUQG_7Q$ ) (indexed by WoS and Scopus). ? Important dates: * regular research submissions (extended detailed abstracts) - Sunday September 26, 2021 * short submissions (abstracts of work in progress, position papers, etc.) - start - Sunday October 10, 2021, end - Sunday October 17, 2021 * notification for ALL submissions - Sunday October 24, 2021 * workshop (hybrid) - Thursday and Friday November 4-5, 2021 * invitations of selected talks to post-proceedings - Sunday November 7, 2021 * papers for the post-proceedings - Sunday November 14, 2021 * notification for the post-proceedings papers - around the end of November, 2021 ? Dr. Nikolay Shilov Assistant Professor of?Innopolis University (Russia) ?? https://urldefense.com/v3/__https://innopolis.university/professor/nikolay-shilov/__;!!IBzWLUs!BDvOi8schEL0XUvu9uvUjwVyRNGgWGo4cW2dMHrY1V-oM3wb5-EMz9S3DaXjTJIwpgidqZK6dGbPsg$ ,? personal web-page ??? https://urldefense.com/v3/__http://persons.iis.nsk.su/en/person/shilov__;!!IBzWLUs!BDvOi8schEL0XUvu9uvUjwVyRNGgWGo4cW2dMHrY1V-oM3wb5-EMz9S3DaXjTJIwpgidqZKbsQXWSA$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From C.E.Brandt at tudelft.nl Thu Sep 9 05:57:08 2021 From: C.E.Brandt at tudelft.nl (Carolin Brandt) Date: Thu, 9 Sep 2021 09:57:08 +0000 Subject: [TYPES/announce] ECOOP 2022: Call for Papers Message-ID: <46CEE9CB-FFEF-413F-8777-AFA3F386B648@tudelft.nl> NEW this year: ECOOP 2022 will have two rounds of reviewing. Round 1 paper submission deadline: ** December 1, 2021 ** ============================ ECOOP 2022 Call for Papers ECOOP 2022 will be held on Mon 6th - Fri 10th of June in Berlin, Germany. https://urldefense.com/v3/__https://2022.ecoop.org/__;!!IBzWLUs!HE5piLxH9_aqlfBhW1NfND2LoUd4_LCrlh2tlAyxyAroo2-6dlDuF1C8niBx35aFI_smquH30oQHOA$ ============================ ECOOP is a conference about programming originally focused on object-orientation, but now including all practical and theoretical investigations of programming languages, systems and environments. ECOOP solicits innovative solutions to real problems as well as evaluations of existing solutions. Authors are asked to pick one of the following categories: - Research. The most traditional category for papers that advance the sate of the art. - Reproduction. An empirical evaluation that reconstructs a published experiment in a different context in order to validate the results of that earlier work. - Experience. Applications of known PL techniques in practice as well as tools. Industry papers will be reviewed by practitioners. We welcome negative results that may provide inspiration for future research. - Pearls/Brave New Ideas. Articles that either explain a known idea in an elegant way or unconventional papers introducing ideas that may take some time to substantiate. These papers may be short. ==== Submissions ==== Submission must not have been published, or have major overlap with previous work. In case of doubt, contact the chair. Proceedings are published in open access by Dagstuhl LIPIcs in the Dagstuhl LIPIcs LaTeX-style template. ECOOP uses double-blind reviewing. Authors? identities are only revealed if a paper is accepted. Papers must 1. omit author names and institutions, and 2. use the third person when referencing the authors? own work. Nothing should be done in the name of anonymity that weakens the submission; see the DB FAQ. When in doubt, contact the chair. There is no page limit on submissions, but authors must understand that reviewers have a fixed time budget for each paper, so the quality of the comments is likely to be inversely proportional to length. Brevity is a virtue. Authors will be given a three-day period to read and respond to the reviews of their papers before the program committee meeting. Responses have no length limit. ==== Artifact Evaluation and Intent ==== To support replication of experiments, authors of research papers may submit artifacts to the Artifact Evaluation Committee. They will be asked whether they intend to submit an artifact at submission time. It is understood that some paper do not have artifacts. ======== Important Dates ======== ECOOP 2022 will have two deadlines for submissions, three months apart. Future years may have more deadlines. Papers submitted in each round can be (a) accepted, (b) rejected, or (c) asked for revisions. Revisions can be submitted at a later round. Papers retain their reviewers during revision. - Submission R1: 1 December 2021 - R1 Artifacts due: 10 December 2021 - Response R1: 23 January 2022 - Notification R1: 1 February 2022 - Submission R2: 1 March 2022 - R2 Artifacts due: 10 March 2022 - Response R2: 23 April 2022 - Notification R2: 1 May 2022 ==== Journal First and Journal After ==== We have Journal First / After arrangements with ACM?s Transactions on Programming Languages and Systems (TOPLAS), Elsevier?s Science of Computer Programming (SCP) and AITO?s Journal of Object Technology (JOT). Only new research papers are eligible to be Journal First (JF). JF papers will have an extended abstract in the ECOOP proceedings. The deadline is that same as round 1 of submissions and the notification is aligned with round 2 notification. TOPLAS JF papers should be submitted according to this announcement. SCP JF papers should follow this call for papers. JF papers are presented at the conference and eligible for awards. Journal After (JA) papers are papers for which the authors request to be considered for post conference journal publication. Once accepted by the ECOOP PC, these papers will be forwarded to the journal editors. Reviews and reviewers will be forwarded and used at the editor?s discretion. JA papers will have an extended abstract (up to 12 pages) in the conference proceedings. Find answers to frequently asked questions on our website: https://urldefense.com/v3/__https://2022.ecoop.org/track/ecoop-2022-papers__;!!IBzWLUs!HE5piLxH9_aqlfBhW1NfND2LoUd4_LCrlh2tlAyxyAroo2-6dlDuF1C8niBx35aFI_smquFfiOcMaw$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From ezio.bartocci at tuwien.ac.at Thu Sep 9 07:43:18 2021 From: ezio.bartocci at tuwien.ac.at (Ezio Bartocci) Date: Thu, 9 Sep 2021 13:43:18 +0200 Subject: [TYPES/announce] Pre-Call for 20 PhD Positions in Computer Science at TU Wien, Vienna, Austria Message-ID: <717F4088-8D8E-45F5-A4E3-19BD814D64EA@tuwien.ac.at> The novel interdisciplinary Marie Sk?odowska-Curie COFUND doctoral training programme LogiCS at TUWien - Logics for Computer Science ?https://urldefense.com/v3/__http://www.vcla.at/msca__;!!IBzWLUs!ABUU5I4xCy6nnDmfbgjS5ItolJdde-fZz-1wIXnMMlKqqzxjkfwuLJZI5zcqBzgWM7pea7sYThWzDw$ co-funded by the European Commission, will offer 20 full-time PhD positions. The program is hosted by TU Wien, one of the most successful technical universities in Europe and the largest one in Austria. The Faculty of Informatics of TU Wien ranks among the top 20% research and teaching institutions in the field worldwide. In the heart of Europe, Vienna has a prominent history in mathematics, computer science, and logic research, and offers one of the highest living standards in the world. The doctoral positions are open to international high-potential early-stage researchers, working on Logical Methods in Computer Science and their applications, including: * Artificial Intelligence * Databases * Verification * Algorithms * Security * Cyber-Physical Systems The programme provides a 4-year long doctoral training for international PhD candidates within an English-language curriculum. LogiCS at TUWien will run for 60 months and foresees the recruitment of 20 PhD candidates. The PhD candidates will be supervised by: * Ezio Bartocci * Pavol Cerny * Agata Ciabattoni * Thomas Eiter * Robert Ganian * Georg Gottlob * Laura Kov?cs * Matteo Maffei * Magdalena Ortiz * Stefan Szeider * Georg Weissenbacher * Stefan Woltran * Florian Zuleger Two calls will accomplish the recruitment of the 20 positions; the first call will be published on October 1, 2021, with an application deadline of November 30, 2021. See https://urldefense.com/v3/__http://www.vcla.at/msca__;!!IBzWLUs!ABUU5I4xCy6nnDmfbgjS5ItolJdde-fZz-1wIXnMMlKqqzxjkfwuLJZI5zcqBzgWM7pea7sYThWzDw$ for details. -------------- next part -------------- An HTML attachment was scrubbed... URL: From juan.fumero at manchester.ac.uk Fri Sep 10 02:44:45 2021 From: juan.fumero at manchester.ac.uk (Juan Fumero) Date: Fri, 10 Sep 2021 06:44:45 +0000 Subject: [TYPES/announce] Call For Participation - SPLASH 2021: ACM SIGPLAN Conference on Systems, Programming, Languages, and Applications: Software for Humanity Message-ID: ======================================================================== Call For Participation ACM Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH'21) Hybrid Conference (Online and In-Person) October 17-22, 2021, Chicago, USA Attendees are required to be fully vaccinated to attend SPLASH 2021 in-person. Masks are required at SPLASH 2021. https://urldefense.com/v3/__https://2021.splashcon.org/__;!!IBzWLUs!H5Q1umqqb34zicE-7pl3zkeOTQprNaJO0Ko11yXtD8F-2ZOgI211ZxYs-LWnZ_XB_kUDp0sObEVO1w$ Follow us on Twitter @splashcon ======================================================================== FULL LIST OF EVENTS: - OOPSLA - Onward! Papers - Onward! Essays - In-person presentations of papers from virtual PLDI, ICFP, OOPSLAs - PLMW - SPLASH-E - Workshops: - AGERE - BCNC - CONFLANG - DSM - HATRA - LIVE - REBLS - VMIL - Poster Sessions - Doctoral Symposioum - Student Research Competition (SRC) - Co-hosted Symposiums - Scala - Co-located events: - APLAS - Dynamic Languages Symposium (DLS) - GPCE - SAS - SLE ======================================================================== The ACM SIGPLAN conference on Systems, Programming, Languages and Applications: Software for Humanity (SPLASH) embraces all aspects of software construction and delivery to make it the premier conference at the intersection of programming, languages, and software engineering. This year, SPLASH will be held as a Hybrid Conference. There will be a physical conference in Chicago as well as a virtual component. Note that, for in-person participation, attendees are required to be fully vaccinated. More details below. ======================================================================== # Regarding COVID19 ======================================================================== SPLASH 2021 will require in-person attendees to be fully vaccinated, as defined by the Center for Disease Control (CDC): https://urldefense.com/v3/__https://www.cdc.gov/coronavirus/2019-ncov/vaccines/fully-vaccinated.html__;!!IBzWLUs!H5Q1umqqb34zicE-7pl3zkeOTQprNaJO0Ko11yXtD8F-2ZOgI211ZxYs-LWnZ_XB_kUDp0v0Kssp_Q$ According to the CDC, attendees ?are considered fully vaccinated (a) 2 weeks after their second dose in a 2-dose series, such as the Pfizer or Moderna vaccines, or (b) 2 weeks after a single-dose vaccine, such as Johnson & Johnson?s Janssen vaccine. If you don?t meet these requirements, regardless of your age, you are NOT fully vaccinated.? SPLASH 2021 will offer virtual attendance options for those individuals who are not fully vaccinated. Vaccination validation will be conducted by a vendor contracted by the ACM to perform this validation for the SPLASH 2021 conference. Masks are required at SPLASH 2021. ======================================================================== # Participation ======================================================================== Please register using this online registration form: https://urldefense.com/v3/__https://regmaster.com/2021conf/SPLASH21/register.php__;!!IBzWLUs!H5Q1umqqb34zicE-7pl3zkeOTQprNaJO0Ko11yXtD8F-2ZOgI211ZxYs-LWnZ_XB_kUDp0ucoA7GFw$ Early registration closes on September 18, 2021. You are required to be fully vaccinated to attend the in-person conference in Chicago. The virtual attendance option is available to unvaccinated attendees. Masks are required at SPLASH 2021. ======================================================================== # List of Events ======================================================================== ** OOPSLA Research Papers ** Papers that address any aspect of software development are welcome, including requirements, modelling, prototyping, design, implementation, generation, analysis, verification, testing, evaluation, maintenance, reuse, replacement, and retirement of software systems. Papers may address these topics in a variety of ways, including new tools (such as languages, program analyses, and runtime systems), new techniques (such as methodologies, design processes, code organization approaches, and management techniques), and new evaluations (such as formalisms and proofs, corpora analyses, user studies, and surveys). ** Onward! Research Papers ** Onward! is a premier multidisciplinary conference focused on everything to do with programming and software: including processes, methods, languages, communities, and applications. Onward! is more radical, more visionary, and more open than other conferences to ideas that are well-argued but not yet proven. We welcome different ways of thinking about, approaching, and reporting on programming language and software engineering research. ** Onward! Essays ** Onward! Essays conference is looking for clear and compelling pieces of writing about topics important to the software community construed broadly. An essay can be an exploration of a topic, its impact, or the circumstances of its creation; it can present a personal view of what is, explore a terrain, or lead the reader in an act of discovery; it can be a philosophical digression or a deep analysis. It can describe a personal journey, perhaps that by which the author reached an understanding of such a topic. The subject area should be interpreted broadly and can include the relationship of software to human endeavours, or its philosophical, sociological, psychological, historical, or anthropological underpinnings. ** In-person presentations of papers from recent virtual conferences ** Several SIGPLAN conferences have been held virtually since March 2020. We have invited authors of papers from virtual OOPSLA 2020, PLDI 2020 and 2021, and ICFP 2020 to present their work in person at SPLASH, and many authors have accepted. These presentations will be given during the main conference days, in parallel with OOPSLA and Onward! 2021 presentations. They will not be streamed, since they were already streamed at their respective virtual conferences. ** PLMW at SPLASH ** The SPLASH 2021 Programming Languages Mentoring Workshop encourages graduate students (PhD and MSc) and senior undergraduate students to pursue research in programming languages. This workshop will provide mentoring sessions on how to prepare for and thrive in graduate school and in a research career, focusing both on cutting-edge research topics and practical advice. The workshop brings together leading researchers and junior students in an inclusive environment in order to help welcome newcomers to our field of programming languages research. The workshop will show students the many paths that they might take to enter and contribute to our research community. ======================================================================== ** Workshops ** ======================================================================== **** AGERE 2021 **** The AGERE! workshop is aimed at focusing on programming systems, languages and applications based on actors, active/concurrent objects, agents and?more generally?on high-level programming paradigms which promote decentralized control in solving problems and developing software. The workshop is intended to cover both the theory and the practice of design and programming, bringing together researchers working on models, languages and technologies, and practitioners developing real-world systems and applications. **** BCNC 2021 **** The first international workshop on ?Beyond Code: No Code,? (BCNC 2021) targets one of the most engaging topics currently spanning the software engineering community. The No-Code movement is making its way through all industries, saving time, empowering workers, and creating new possibilities. No Code is changing the software industry by accelerating development and opening up opportunities for less tech-savvy individuals to create life-changing products. **** CONFLANG 2021 **** CONFLANG is a new workshop on the design, the usage and the tooling of configuration programming languages. CONFLANG aims at uniting language designers, industry practitioners and passionate hobbyists to share knowledge in any form. Topics of interest include, but are not limited to: - Infrastructure and configuration code maintenance and evolution - Specification learning and mining for configurations - Infrastructure and Configuration testing and verification - Infrastructure as Code and configuration repair - New languages for configuration - The application of language security and type theory to program configuration **** DSM?21 **** Domain-Specific Modeling (DSM) languages provide a viable and time-tested solution for continuing to raise the level of abstraction, and thus productivity, beyond coding, making systems and software development faster and easier. In DSM, the models are constructed using concepts that represent things in the application domain, not concepts of a given programming language. The modeling language follows the domain abstractions and semantics, allowing developers to perceive themselves as working directly with domain concepts. Together with frameworks and platforms, DSM can automate a large portion of software production. The goals of the workshop are to share experiences and demonstrate the DSM solutions that have been developed by both researchers and practitioners, identify research questions and continuing to build the community. **** HATRA 2021 **** Programming language designers seek to provide strong tools to help developers reason about their programs. For example, the formal methods community seeks to enable developers to prove correctness properties of their code, and type system designers seek to exclude classes of undesirable behavior from programs. The security community creates tools to help developers achieve their security goals. In order to make these approaches as effective as possible for developers, recent work has integrated approaches from human-computer interaction research into programming language design. This workshop brings together programming languages, software engineering, security, and human-computer interaction researchers to investigate methods for making languages that provide stronger safety properties more effective for programmers and software engineers. **** LIVE 2021 **** Programming is cognitively demanding, and too difficult. LIVE is a workshop exploring new user interfaces that improve the immediacy, usability, and learnability of programming. Whereas PL research traditionally focuses on programs, LIVE focuses more on the activity of programming. **** REBLS 2021 **** Reactive programming and event-based programming are two closely related programming styles that are becoming ever more important with the advent of advanced HPC technology and the ever increasing requirement for our applications to run on the web or on collaborating mobile devices. A number of publications on middleware and language design ? so-called reactive and event-based languages and systems (REBLS) ? have already seen the light, but the field still raises several questions. For example, the interaction with mainstream language concepts is poorly understood, implementation technology is in its infancy and modularity mechanisms are almost totally lacking. This workshop will gather researchers in reactive and event-based languages and systems. The goal of the workshop is to exchange new technical research results and to define better the field by coming up with taxonomies and overviews of the existing work. **** VMIL 2021 **** The concept of Virtual Machines is pervasive in the design and implementation of programming systems. Virtual Machines and the languages they implement are crucial in the specification, implementation and/or user-facing deployment of most programming technologies. The VMIL workshop is a forum for researchers and cutting-edge practitioners in language virtual machines, the intermediate languages they use, and related issues. ======================================================================== ** SPLASH Posters ** ======================================================================== The SPLASH Posters track provides an excellent forum for authors to present their recent or ongoing projects in an interactive setting, and receive feedback from the community. SPLASH posters cover any aspect of programming, systems, languages and applications. The goal of the poster session is to encourage and facilitate small groups of individuals interested in a technical area to gather and interact. It is held early in the conference, to promote continued discussion among interested parties. ======================================================================== ** Doctoral Symposium ** ======================================================================== The SPLASH Doctoral Symposium provides students with useful guidance for completing their dissertation research and beginning their research careers. The symposium will provide an interactive forum for doctoral students who have progressed far enough in their research to have a structured proposal, but will not be defending their dissertation in the next 12 months. ======================================================================== ** Student Research Competition ** ======================================================================== The ACM Student Research Competition (SRC), sponsored by Microsoft Research, offers a unique opportunity for undergraduate and graduate students to present their research to a panel of judges and conference attendees at SPLASH. The SRC provides visibility and exposes up-and-coming researchers to computer science research and the research community. This competition also gives students an opportunity to discuss their research with experts in their field, get feedback, and sharpen their communication and networking skills. ======================================================================== ** SPLASH-E ** ======================================================================== SPLASH-E is a forum for educators to make connections between programming languages research and the ways we educate computer science students. We invite work that could improve or inform computer science educators, especially work that connects with introductory computer science courses, programming languages, compilers, software engineering, and other SPLASH-related topics. Educational tools, experience reports, and new curricula are all welcome. ======================================================================== *** ACM SIGPLAN Scala Symposium *** ======================================================================== Scala is a general-purpose programming language designed to express common programming patterns in a concise, elegant, and type-safe way. It smoothly integrates features of object-oriented and functional languages. The Scala Symposium is the leading forum for researchers and practitioners related to the Scala programming language. We welcome a broad spectrum of research topics and support many submission formats for industry and academia alike. ======================================================================== *** Co-Located Events *** ======================================================================== ** Asian Symposium on Programming Languages and Systems (APLAS) ** The 19th Asian Symposium on Programming Languages and Systems (APLAS). APLAS aims to stimulate programming language research by providing a forum for the presentation of the latest results and the exchange of ideas in programming languages and systems. APLAS is based in Asia but is an international forum that serves the worldwide programming languages community. APLAS 2021 will be held online and co-located with SPLASH 2021. ** Dynamic Languages Symposium (DLS) ** DLS is the premier forum for researchers and practitioners to share knowledge and research on dynamic languages, their implementation, and applications. The influence of dynamic languages ? from Lisp to Smalltalk to Python to JavaScript ? on real-world practice and research, continues to grow. We invite high-quality papers reporting original research, innovative contributions, or experience related to dynamic languages, their implementation, and applications. ** 20th International Conference on Generative Programming: Concepts & Experiences (GPCE) ** GPCE is a venue for researchers and practitioners interested in techniques that use program generation, domain-specific languages, and component deployment to increase programmer productivity, improve software quality, and shorten the time-to-market of software products. In addition to exploring cutting-edge techniques of generative software, our goal is to foster further cross-fertilization between software engineering and the programming languages research communities. ** The 28th Static Analysis Symposium (SAS 2021) ** Static analysis is widely recognized as a fundamental tool for program verification, bug detection, compiler optimization, program understanding, and software maintenance. The series of Static Analysis Symposia has served as the primary venue for the presentation of theoretical, practical, and application advances in the area. ** 13th International ACM SIGPLAN Conference on Software Language Engineering (SLE) ** SLE is the discipline of engineering languages and the tools required for the creation of software. It abstracts from the differences between programming languages, modelling languages, and other software languages, and emphasizes the engineering facet of the creation of such languages, that is, the establishment of the scientific methods and practices that enable the best results. SLE overlaps with traditional conferences on the design and implementation of programming languages, model-driven engineering, and compiler construction, and emphasizes the fusion of their communities. ======================================================================== # Organizing Committee SPLASH 2021: ======================================================================== SPLASH General Chair: Hridesh Rajan (Iowa State University) OOPSLA Review Committee Chair: Sophia Drossopoulou (Imperial College London) GPCE General Chair: Eli Tilevich (Virginia Tech) GPCE Program Chair: Coen De Roover (Vrije Universiteit Brussel) SLE General Chair: Eelco Visser (Delft University of Technology) SLE Program Co-Chair: Dimitris Kolovos (University of York) SLE Program Co-Chair: Emma S?derberg (Lund University) SLE Artifact Evaluation Co-Chair: Elias Castegren (KTH) SLE Artifact Evaluation Co-Chair: Andreas Wortmann (RWTH Aachen University) DLS Chair: Arjun Guha (Northeastern University) Onward! Papers Chair: Wolfgang De Meuter (Vrije Universiteit Brussel) Onward! Essays Chair: Elisa Baniassad (University of British Columbia) SPLASH-E Co-Chair: Charlie Curtsinger (Grinnell College) SPLASH-E Co-Chair: Tien N. Nguyen (University of Texas at Dallas) Artifact Evaluation Co-Chair: Colin Gordon (Drexel University) Artifact Evaluation Co-Chair: Ana Milanova (Rensselaer Polytechnic Institute) Artifact Evaluation Co-Chair: Anders M?ller (Aarhus University) Hybridization Co-Chair: Jonathan Aldrich (Carnegie Mellon University) Hybridization Co-Chair: Steve Blackburn (Australia National University) Hybridization Co-Chair: Benjamin Chung (Northeastern University) Hybridization Co-Chair: Youyou Cong (Tokyo Institute of Technology) Hybridization Co-Chair: Alex Potanin (Victoria University of Wellington) Hybridization Co-Chair: Talia Ringer (University of Illinois at Urbana-Champaign) Workshops Co-Chair: Mehdi Bagherzadeh (Oakland University) Workshops Co-Chair: Raffi Khatchadourian (CUNY Hunter College) Student Research Competition Co-Chair: Julia Rubin (University of British Columbia) Publicity Chair: Juan Fumero (University of Manchester) Web Chair: Rangeet Pan (Iowa State University) Student Volunteer Co-Chair: Breno Dantas Cruz (Virginia Tech) Student Volunteer Co-Chair: Samantha Syeda Khairunnesa (Iowa State University) Sponsorship Co-Chair: Ganesha Upadhyaya (Harmony.one) Poster Co-Chair: Christos Dimoulas (PLT @ Northwestern University) Poster Co-Chair: Murali Krishna Ramanathan (Uber Technologies Inc.) Publications Chair: Saba Alimadadi (Simon Fraser University) Accessibility Chair: Sumon Biswas (Iowa State University, USA) ======================================================================== -------------- next part -------------- An HTML attachment was scrubbed... URL: From bchung at ccs.neu.edu Fri Sep 10 11:47:19 2021 From: bchung at ccs.neu.edu (Benjamin Chung) Date: Fri, 10 Sep 2021 11:47:19 -0400 (EDT) Subject: [TYPES/announce] Seeking new SIGPLAN video chairs Message-ID: <489744001.1555100.1631288839666.JavaMail.zimbra@zimbra.ccs.neu.edu> Do you want to help out the community of PL researchers? Enjoy meeting new and interesting people at conferences? Like cameras and recording videos? For free? SIGPLAN is looking for new video chairs! The position is responsible for recording (and now streaming) videos at ICFP, PLDI, POPL, and SPLASH, with the cost of equipment and travel covered by the conferences, coming with membership of the organizing committee. We're looking for several interested volunteers (ideally, partitioning up who is responsible for which conference) who can come to SPLASH (covered by the event) to find out more about the role and learn how the equipment works. It's a great opportunity for early grad students to meet, get to know, and work with the entire SIGPLAN community. If interested, please contact me (bchung at ccs.neu.edu)! If you're a PhD or MS student, please let me know what year you are; anyone is welcome to apply! In all cases, please include where you're located, and if you'll be able to attend SPLASH. No previous experience with cameras or video is required. From nclpltt at gmail.com Sun Sep 12 09:38:49 2021 From: nclpltt at gmail.com (Nicola Paoletti) Date: Sun, 12 Sep 2021 15:38:49 +0200 Subject: [TYPES/announce] ACM HSCC 2022 -- 2nd Call for Papers Message-ID: ============================================================ ACM HSCC 2022 Call for Papers 25th ACM International Conference on Hybrid Systems: Computation and Control (HSCC 2022) Part of CPS-IoT Week 2022 May 4-6, 2022 Milan, Italy URL: https://urldefense.com/v3/__https://hscc.acm.org/2022/__;!!IBzWLUs!Bfe2AUE27RTvAzBc-4JmZjLt7gQ7aT609Bx6Bz_qwkngw6wFP4BHjXanQ61TOVlza8GTyhtRvLMnvw$ ============================================================ Hybrid Systems: Computation and Control (HSCC) 2022 is the 25th in a series of conferences focusing on original research on concepts, tools, and techniques from computer science, control theory, and applied mathematics for the analysis and control of hybrid dynamical systems, with an emphasis on computational aspects. By drawing on strategies from computation and control, the hybrid systems field offers techniques that are applicable to both man-made cyber-physical systems (ranging from small robots to global infrastructure networks) and natural systems (ranging from biochemical networks to physiological models). Papers in the conference are expected to range over a wide spectrum of topics from theoretical results to practical considerations, and from academic research to industrial adoption. Topics of interest include, but are not limited to: - Mathematical foundations, computability and complexity - Analysis, verification, validation, and testing - Modeling paradigms and techniques - Design, synthesis, planning, and control - Programming and specification languages - Network science and network-based control - Security, privacy, and resilience for cyber-physical systems with focus on computation and control - Safe autonomy, Artificial intelligence and Machine learning in CPS - Software tools for the above topics - Applications and industrial case studies in: automotive, transportation, autonomous systems, avionics, energy and power, robotics, medical devices, manufacturing, systems and synthetic biology, models for the life sciences, and other related areas. Submission Guidelines ============================================================ HSCC invites submissions in two categories: (1) regular papers and (2) tool and case study papers. Submissions in *both* these categories can be either long (10 pages max, 9pt font, two-column ACM format) or short papers (6 pages max, 9pt font, two-column ACM format). We will employ a double-blind reviewing process and will have a rebuttal phase to provide authors with the opportunity to reply to the reviewers? concerns. Authors are asked to submit their paper using EasyChair: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=hscc2022__;!!IBzWLUs!Bfe2AUE27RTvAzBc-4JmZjLt7gQ7aT609Bx6Bz_qwkngw6wFP4BHjXanQ61TOVlza8GTyhtnMrdVyQ$ Important dates ============================================================ Submission deadline: *October 29, 2021 (AOE)* Tool/case study paper repeatability package submission deadline: November 1, 2021 (AOE) Rebuttal phase: December 15-17, 2021 Acceptance/rejection notifications: January 17, 2022 Posters/demos submission deadline: January 31, 2021 (AOE) Awards ============================================================ HSCC 2022 will confer four different awards: - *ACM SIGBED HSCC Best Paper Award* (all regular papers are eligible) - *HSCC Test-Of-Time Award* (call for nominations and guidelines TBA) - *Best Demo/Poster Award* - *Repeatability Evaluation Badge* Organization ============================================================ PC Chairs: Ezio Bartocci (TU Wien, Austria) Sylvie Putot (?cole Polytechnique, France) Repeatability Evaluation Chairs: Stanley Bak (Stony Brook University, USA) Aditya Zutshi (Galois Inc., USA) Publication Chair: Stefan Schupp (TU Wien, Austria) Publicity Chair: Nicola Paoletti (Royal Holloway, University of London, UK) Demo/Poster Chair: Chuchu Fan (MIT, USA) Awards Chair: Alessandro Abate (University of Oxford, UK) Steering Committee: Alessandro Abate (University of Oxford, UK) Thao Dang (Verimag, France) Martin Fr?nzle (Universit?t Oldenburg, Germany) Radu Grosu (TU Wien, Austria) Sayan Mitra (UIUC, USA) Paulo Tabuada (UCLA, USA) Claire Tomlin (University of California, Berkeley, USA) -- Nicola Paoletti Lecturer - Department of Computer Science - Royal Holloway, University of London Bedford building 2-25 https://urldefense.com/v3/__https://nicolapaoletti.com/__;!!IBzWLUs!Bfe2AUE27RTvAzBc-4JmZjLt7gQ7aT609Bx6Bz_qwkngw6wFP4BHjXanQ61TOVlza8GTyhuTdEuQxg$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From walther.neuper at jku.at Mon Sep 13 04:42:53 2021 From: walther.neuper at jku.at (Walther Neuper) Date: Mon, 13 Sep 2021 10:42:53 +0200 Subject: [TYPES/announce] 2nd CfP - ThEdu'21 post-proceedings at EPTCS Message-ID: Open Call for Papers ************************************************************************** Proceedings for ThEdu'21 Theorem Proving Components for Educational Software https://urldefense.com/v3/__http://www.uc.pt/en/congressos/thedu/thedu21__;!!IBzWLUs!GNpC0QHeaHo_ixZh0VbKSFSQ_fFqeKYyn-u4wbqFCBK4iA-SmXAaBQyhnWtb2LPWmNp7WPlFILnDXQ$ ************************************************************************** to be published by EPTCS, Electronic Proceedings in Theoretical Computer Science https://urldefense.com/v3/__http://published.eptcs.org__;!!IBzWLUs!GNpC0QHeaHo_ixZh0VbKSFSQ_fFqeKYyn-u4wbqFCBK4iA-SmXAaBQyhnWtb2LPWmNp7WPnQclFWbw$ ************************************************************************** Synopsis ThEdu'21, was accepted as a workshop at CADE28 The 28th International Conference on Automated Deduction, 11-16 July 2021. Because of the COVID-19 pandemic, CADE28 and all its workshops were virtual events. It was a very lively virtual meeting with an average of 18 attendees. ThEdu'21 programme comprised one invited talk, 11 regular contributions and one demonstration, whose abstracts, presentations and videos are in the workshop web-page. Now post-proceedings are planned to collect the contributions upgraded to full papers. The contributions' topics are diverse according to ThEdu's scope, and this is a call open for everyone, also those who did not participate in the workshop. All papers will undergo review according to EPTCS standards. ThEdu'21 Scope: Computer Theorem Proving is becoming a paradigm as well as a technological base for a new generation of educational software in science, technology, engineering and mathematics. This volume of EPTCS intends to bring together experts in automated deduction with experts in education in order to further clarify the shape of the new software generation and to discuss existing systems. Important Dates * Submission (Full Papers): 10 October 2021 * Notification of acceptance: 28 November 2021 * Revised papers due: 12 December 2021 Topics of interest include: * methods of automated deduction applied to checking students' input; * methods of automated deduction applied to prove post-conditions for particular problem solutions; * combinations of deduction and computation enabling systems to propose next steps; * automated provers specific for dynamic geometry systems; * proof and proving in mathematics education. Submission We welcome submission of full papers (12--20 pages) presenting original unpublished work which is not being submitted for publication elsewhere. All contributions will be reviewed (at least three blind reviews) to meet the high standards of EPTCS. The authors should comply with the "instructions for authors", LaTeX style files and accept the "Non-exclusive license to distribute" of EPTCS: Instructions for authors (https://urldefense.com/v3/__http://info.eptcs.org/__;!!IBzWLUs!GNpC0QHeaHo_ixZh0VbKSFSQ_fFqeKYyn-u4wbqFCBK4iA-SmXAaBQyhnWtb2LPWmNp7WPkbDFFtsA$ ) LaTeX style file and formatting instructions (https://urldefense.com/v3/__http://style.eptcs.org/__;!!IBzWLUs!GNpC0QHeaHo_ixZh0VbKSFSQ_fFqeKYyn-u4wbqFCBK4iA-SmXAaBQyhnWtb2LPWmNp7WPkxCaiTHA$ ) Copyright (https://urldefense.com/v3/__http://copyright.eptcs.org/__;!!IBzWLUs!GNpC0QHeaHo_ixZh0VbKSFSQ_fFqeKYyn-u4wbqFCBK4iA-SmXAaBQyhnWtb2LPWmNp7WPl9jg_ONA$ ) Papers should be submitted via EasyChair, https://urldefense.com/v3/__https://easychair.org/conferences/?conf=thedu21__;!!IBzWLUs!GNpC0QHeaHo_ixZh0VbKSFSQ_fFqeKYyn-u4wbqFCBK4iA-SmXAaBQyhnWtb2LPWmNp7WPnnrmFTSQ$ . Program Committee Francisco Botana, University of Vigo at Pontevedra, Spain David Cerna, Johannes Kepler University, Austria Jo?o Marcos, Universidade Federal do Rio Grande do Norte, Brazil (co-chair) Filip Maric, University of Belgrade, Serbia Adolfo Neto, Universidade Tecnol?gica Federal do Paran?, Brazil Walther Neuper, Graz University of Technology, Austria (co-chair) Pedro Quaresma, University of Coimbra, Portugal (co-chair) Philippe R. Richard, Universit? de Montr?al, Canada Vanda Santos, University of Aveiro, Portugal Wolfgang Schreiner, Johannes Kepler University, Austria J?rgen Villadsen, Technical University of Denmark, Denmark -------------- next part -------------- An HTML attachment was scrubbed... URL: From ucacsam at ucl.ac.uk Mon Sep 13 06:21:23 2021 From: ucacsam at ucl.ac.uk (Matteo Sammartino) Date: Mon, 13 Sep 2021 10:21:23 +0000 Subject: [TYPES/announce] Postdoctoral position on verification of concurrent systems via model learning, Royal Holloway University of London -- Application deadline extended to 17 Oct 2021 Message-ID: - Application deadline: Midnight, 17 Oct 2021 - Starting date: As soon as possible after Oct 1 - Salary: ?35,931-?37,979 - Duration: until February 2023 Applications are invited for the post of Post-Doctoral Research Assistant in the Computer Science Department at Royal Holloway, University of London. Successful applicants will be working on the EPSRC-funded "Verification of Hardware Concurrency via Model Learning" (CLeVer) project (EP/S028641/1), led by Alexandra Silva (UCL) and Matteo Sammartino (Royal Holloway, University of London). This is a joint research effort involving Royal Holloway University of London, University College London, and ARM, world-leading designer of multi-core chips. For an informal discussion about the post, please contact Dr. Matteo Sammartino on matteo.sammartino at rhul.ac.uk. # Project Description Digital devices increasingly rely on multi-threaded computation, with sophisticated concurrent behaviour becoming prevalent at any scale. As the complexity of these systems increases, there is a pressing need to automate the assessment of their correctness, especially with respect to concurrency-related aspects. Formal verification provides highly effective techniques to assess the correctness of systems. However, formal models are usually built by humans, and as such can be error-prone and inaccurate. The CLeVer project aims to: - develop a novel verification framework that relies on learning techniques to automatically build and verify models of concurrency, with a particular focus on multi-core systems. - apply the framework to real-world verification tasks, in collaboration with ARM. # The ideal candidate We are looking for candidates with a PhD in one of the following areas: model-based testing and verification, formal methods for concurrency, automated analysis of hardware systems. Experience in multiple areas will be valued. Candidates ideally should also have strong programming skills. # Where to apply https://urldefense.com/v3/__https://jobs.royalholloway.ac.uk/0721-259-R__;!!IBzWLUs!B30ivyr_dXHAqITFCIhJmgB781RnlqNHUmGcyfTSRAXlL4L6VMBKQOYi2uWy6lSqc4yr1QCiENRCMw$ From mwwhalen at umn.edu Mon Sep 13 11:44:16 2021 From: mwwhalen at umn.edu (Michael Whalen) Date: Mon, 13 Sep 2021 10:44:16 -0500 Subject: [TYPES/announce] FMCAD 2021 Call for Participation Message-ID: Apologies for multiple postings. The 21th International Conference on Formal Methods in Computer-Aided Design (FMCAD) will be held from October 19 to October 22, 2021. The conference will be held virtually. Registration is free, but obligatory to attend the conference: https://urldefense.com/v3/__https://fmcad.org/FMCAD21/registration/__;!!IBzWLUs!EcfV-6iX-NWJGvnojGFbT5NyAGGnhgNsgDf-KKSQafklWKMeMXGDZwOEnJ7PeNlfY-TCWb8n8Ip1XQ$ FMCAD 2021: CALL FOR PARTICIPATION International Conference on Formal Methods in Computer-Aided Design (FMCAD) https://urldefense.com/v3/__https://www.fmcad.org/FMCAD21__;!!IBzWLUs!EcfV-6iX-NWJGvnojGFbT5NyAGGnhgNsgDf-KKSQafklWKMeMXGDZwOEnJ7PeNlfY-TCWb89c0_phg$ FMCAD Tutorial Day: October 19, 2021 FMCAD Regular Program: October 20-22, 2021 Co-Chairs: Ruzica Piskac and Michael Whalen CONFERENCE SCOPE FMCAD'21 is the 21st in a series of conferences on the theory and applications of formal methods in hardware and system verification. FMCAD provides a leading forum to researchers in academia and industry for presenting and discussing ground-breaking methods, technologies, theoretical results, and tools for reasoning formally about computing systems. FMCAD covers formal aspects of computer-aided system design including verification, specification, synthesis, and testing. TECHNICAL PROGRAM The program comprises presentations of 30 papers, 4 tutorials and 3 keynotes, a student forum, and a sponsors? night: https://urldefense.com/v3/__https://easychair.org/smart-program/FMCAD2021/__;!!IBzWLUs!EcfV-6iX-NWJGvnojGFbT5NyAGGnhgNsgDf-KKSQafklWKMeMXGDZwOEnJ7PeNlfY-TCWb-U75SNyg$ Short presentations will be given on Zoom and longer versions of the talks will be made available for download. KEYNOTES Barbara Liskov ?From Viewstamped Replication to Blockchains? Seny Kamara ?Algorithms for the People? Peter Sewell ?Engineering with Full-scale Formal Architecture: Morello, CHERI, Armv8-A, and RISC-V? TUTORIALS Frits Vaandrager ?Active Automata Learning: from L* to L#? Viktor Kun?ak ?Stainless Verification System Tutorial? Rayna Dimitrova ?Reactive Synthesis Beyond Realizability? Matteo Maffei ?Formal Methods for the Security Analysis of Smart Contracts? SPONSORS Financial support: Amazon Web Services, Amazon Prime Video, Intel, Cadence, Centaur, Synopsys, Galois, Novi. Technical Co-Sponsor: IEEE Supported by the FMCAD Association (https://urldefense.com/v3/__https://fmcad.or.at__;!!IBzWLUs!EcfV-6iX-NWJGvnojGFbT5NyAGGnhgNsgDf-KKSQafklWKMeMXGDZwOEnJ7PeNlfY-TCWb_k2x__wg$ ) -------------- next part -------------- An HTML attachment was scrubbed... URL: From kmbae at postech.ac.kr Mon Sep 13 23:32:46 2021 From: kmbae at postech.ac.kr (Kyungmin Bae) Date: Tue, 14 Sep 2021 12:32:46 +0900 Subject: [TYPES/announce] CfP: 14th International Workshop on Rewriting Logic and its Applications Message-ID: --------------------------------------------------------------------------- Call for Papers WRLA 2022 14th International Workshop on Rewriting Logic and its Applications An ETAPS 2022 satellite event, Munich, Germany, April 2-3, 2022 --------------------------------------------------------------------------- IMPORTANT DATES Abstract submission deadline: Dec 21, 2021 (AoE) Paper submission deadline: Dec 28, 2021 (AoE) Notification: Feb 8, 2022 Conference: April 2-3, 2022 AIMS AND SCOPE Rewriting is a natural model of computation and an expressive semantic framework for concurrency, parallelism, communication, and interaction. It can be used for specifying a wide range of systems and languages in various application domains. It also has good properties as a metalogical framework for representing logics. Several successful languages based on rewriting (ASF+SDF, CafeOBJ, ELAN, Maude) have been designed and implemented. The aim of WRLA is to bring together researchers with a common interest in rewriting and its applications, and to give them the opportunity to present their recent work, discuss future research directions, and exchange ideas. The topics of the workshop include, but are not limited to: A. Foundations and models of rewriting and rewriting logic * termination, confluence, coherence, and complexity * unification, generalization, narrowing, and partial evaluation * constrained rewriting and symbolic algebra * graph rewriting, tree automata, and rewriting strategies * rewriting-based calculi and explicit substitutions B. Rewriting as a logical and semantic framework * uses of rewriting as a logical framework, including deduction modulo * uses of rewriting as a semantic framework for programming languages * rewriting semantics of concurrency models and distributed systems * rewriting semantics of real-time, hybrid, and probabilistic systems * uses of rewriting for compilation and language transformation C. Rewriting languages * rewriting-based declarative languages * type systems for rewriting * implementation techniques * tools supporting rewriting languages D. Verification techniques * confluence, termination, coherence, and sufficient completeness * temporal, modal, and reachability logics for rewrite theories * model checking techniques for rewrite theories * rewriting-based theorem proving * rewriting-based constraint solving and satisfiability * rewriting-semantics-based verification and analysis of programs E. Applications * applications in logic, mathematics, physics, chemistry, and biology * security specification and verification * applications to distributed, network, mobile, and cloud computing * applications to cyber-physical and intelligent systems * applications to model-based software engineering * applications to engineering and planning. PAPER SUBMISSION We solicit submissions of regular papers, tool papers, and work-in-progress papers. Regular papers must contain original contributions, be clearly written, and include appropriate references and comparison with related work. Tool papers have to present a new tool, a new tool component, or novel extensions to an existing tool. Work-in-progress papers present early-stage work or other types of innovative or thought-provoking work. All submissions must be original, unpublished, and not submitted simultaneously for publication elsewhere. Papers must be formatted according to the guidelines for Springer LNCS papers and should not exceed 15 pages (excluding references). Paper submission is done via EasyChair at https://urldefense.com/v3/__https://easychair.org/conferences/?conf=wrla2022__;!!IBzWLUs!HEjV8sEDGLNo7CqhLMdqvl9Ooz8ktl9W_hgVNra5IDL2VyH60uDJZX8t71TKWJ9A0LnOx8IM7bAuVw$ . PUBLICATION All accepted papers will be presented at the workshop and included in the pre-proceedings, which will be available during the workshop. Following the tradition of the last editions, regular, tool, and invited papers will be published as a volume in Springer's Lecture Notes in Computer Science (LNCS) series to be distributed after the workshop. The authors of a subset of accepted papers will be invited to submit extended versions of their papers to a special issue of the Journal of Logical and Algebraic Methods in Programming (JLAMP). BEST PAPER AWARD The program committee will consider a best paper award (a diploma and 500 euro) for a paper in which at least one author is a junior researcher (a PhD student or the PhD defense was less than two years ago). The PC chair may require the other authors to declare that at least 50% of the contribution was made by the junior researcher. PROGRAM COMMITTEE Erika Abraham (RWTH Aachen University, Germany) Mar?a Alpuente (Universitat Polit?cnica de Val?ncia, Spain) Kyungmin Bae (chair) (POSTECH, Korea) Roberto Bruni (Universit? di Pisa, Italy) Francisco Dur?n (Universidad de M?laga, Spain) Santiago Escobar (Universitat Polit?cnica de Val?ncia, Spain) Maribel Fern?ndez (King's College London, United Kingdom) Mark Hills (East Carolina University, USA) Nao Hirokawa (JAIST, Japan) Alexander Knapp (University Augsburg, Germany) Temur Kutsia (Johannes Kepler University Linz, Austria) Alberto Lluch-Lafuente (Technical University of Denmark, Denmark) Dorel Lucanu (Alexandru Ioan Cuza University, Romania) Salvador Lucas (Universitat Polit?cnica de Val?ncia, Spain) Narciso Mart?-Oliet (Universidad Complutense de Madrid, Spain) Jos? Meseguer (University of Illinois at Urbana-Champaign, USA) Aart Middeldorp (University of Innsbruck, Austria) Vivek Nigam (Federal University of Para?ba, Brazil) Kazuhiro Ogata (JAIST, Japan) Peter ?lveczky (University of Oslo, Norway) Adri?n Riesco (Universidad Complutense de Madrid, Spain) Christophe Ringeissen (INRIA, France) Camilo Rocha (Pontificia Universidad Javeriana, Colombia) Vlad Rusu (INRIA Lille, France) Traian-Florin Serbanuta (University of Bucharest, Romania) Carolyn Talcott (SRI International, USA) CONTACT INFORMATION For more information, please contact the organizer kmbae at postech.ac.kr or visit the workshop web page https://urldefense.com/v3/__http://sv.postech.ac.kr/wrla2022__;!!IBzWLUs!HEjV8sEDGLNo7CqhLMdqvl9Ooz8ktl9W_hgVNra5IDL2VyH60uDJZX8t71TKWJ9A0LnOx8I9eyr-KA$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From Simon.Gay at glasgow.ac.uk Tue Sep 14 06:28:46 2021 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Tue, 14 Sep 2021 11:28:46 +0100 Subject: [TYPES/announce] Academic job in Programming Language Foundations, University of Glasgow Message-ID: <33a616c9-f1b2-3e1c-d87f-4f00c0661a64@glasgow.ac.uk> University of Glasgow - School of Computing Science Lecturer/ Senior Lecturer/ Reader in Programming Language Foundations Salary: Grade 7 (Lecturer) ?35,845 - ?40,322 Grade 8 (Lecturer) ?44,045 - ?51,034 Grade 9 (Senior Lecturer / Reader) ?52,560 - ?59,135 per annum. The University of Glasgow, established in 1451, is a member of the UK's Russell Group of leading universities. The University is committed to enhancing its position as one of the world's great broad-based research-intensive universities. Applications for the post are welcome in the area of Programming Language Foundations. Research in this area is situated within the Formal Analysis, Theory and Algorithms (FATA) Section and the Programming Languages Theme (https://urldefense.com/v3/__http://www.gla.ac.uk/schools/computing/research/researchthemes/pl-theme/__;!!IBzWLUs!ACC0faVAOVmM92kfWZK3bfLz2K_ZvOfOGSV1n4oyizsubJrvAepfX6qyIgTA0WFLHUHxMe11QwwePQ$ ) of the School of Computing Science. Current topics include programming language semantics and type systems, session types for concurrent and distributed systems, mechanised metatheory for programming languages, and quantum programming languages. A broader context is provided by collaboration with the Glasgow Systems Section (GLASS) on topics including actor languages, runtime systems, automatic parallelisation, and digital security by design. We also run the Programming Languages at University of Glasgow (PLUG) seminar series, participate in the Scottish Programming Languages Seminar (SPLS), contribute to the Scottish Programming Languages and Verification Summer School, and collaborate Europe-wide in the Behavioural API (BehAPI) network. The postholder will develop, lead and sustain research of international standard in Computing Science; contribute to teaching, assessment, project supervision and curriculum design at undergraduate and postgraduate levels; and participate in School management and organisation. For appointment at Reader you will have an outstanding track record of national and international distinction and leadership in research, including publications, income, and awards, bringing external recognition and distinction to yourself and the University. This position is equivalent to US tenure track Assistant or Associate Professor. The application deadline is 30th September. For further details please visit: https://urldefense.com/v3/__https://www.flipsnack.com/UofGRecruitment/lslr-in-programming-language-foundations-063787.html__;!!IBzWLUs!ACC0faVAOVmM92kfWZK3bfLz2K_ZvOfOGSV1n4oyizsubJrvAepfX6qyIgTA0WFLHUHxMe10PArhsg$ https://urldefense.com/v3/__https://www.jobs.ac.uk/job/CII151/lecturer-senior-lecturer-reader-in-programming-language-foundations__;!!IBzWLUs!ACC0faVAOVmM92kfWZK3bfLz2K_ZvOfOGSV1n4oyizsubJrvAepfX6qyIgTA0WFLHUHxMe3UdP_Fdg$ Informal enquiries are welcome to Simon Gay or Ornela Dardha (email: firstname.lastname at glasgow.ac.uk). We strongly endorse the principles of Athena SWAN, including a supportive and flexible working environment, with commitment from all levels of the organisation in promoting gender equity. We particularly welcome applications from women and other groups who are traditionally under-represented in Computing Science. From cliron at bgu.ac.il Tue Sep 14 10:33:29 2021 From: cliron at bgu.ac.il (Liron Cohen) Date: Tue, 14 Sep 2021 14:33:29 +0000 Subject: [TYPES/announce] PhD and Postdoc positions: cyclic proof theory and coinductive reasoning Message-ID: We are looking for excellent PhD candidates and postdocs to join our project on cyclic proof theory and coinductive reasoning. The positions are available in the Computer Science Department at Ben-Gurion University in Israel. This is a joint research effort involving Ben-Gurion University, Royal Holloway University of London, and the University of Sheffield. The aim of the project is to use cyclic proof theory to push forward the state-of-the-art in the formal treatment of coinduction. Another related goal of the project is to fully integrate cyclic (implicit) reasoning into current verification tools, focusing on interactive theorem provers. We invite applications for *funded PhD and postdoc positions* in the field of cyclic proof theory, coinduction and automated reasoning. Depending on background and interests of the candidates, possible research foci are: developing a concise logical framework for coinduction; studying structural proof theory of cyclic systems for coinduction; implementing cyclic proof machinery into modern proof assistants; improving the foundations of cyclic proofs with a focus on soundness and modular reasoning. Successful candidates are likely to have efficient communication skills in English, as well as a track record of research expertise in a subset of the following topics: * Proof theory * Inductive and coinductive reasoning * Use of proof assistants (eg, Coq or HOL\Isabelle) The positions are available immediately, start dates are flexible. Both positions include reimbursement for travel expenses to conferences and there is no teaching load. The funds for the PhD position are available for 4 years. The funds for the postdoc position are available for one year in the first instance with the possibility of extension. The complete application consists of the following documents, which should be sent as a single PDF file to the email address given below: * CV (including list of publications) * One-page cover letter (indicating available start date, relevant qualifications, experience, and motivation) * Up to three letters of recommendation * University certificates and transcripts (BSc, MSc, and Ph.D. degrees, if applicable) Application deadline: October-20-2021. Informal inquiries are welcome and should be directed to Dr. Liron Cohen (cliron at cs.bgu.ac.il). -------------- next part -------------- An HTML attachment was scrubbed... URL: From jonathan.protzenko at gmail.com Tue Sep 14 16:39:07 2021 From: jonathan.protzenko at gmail.com (Jonathan Protzenko) Date: Tue, 14 Sep 2021 13:39:07 -0700 Subject: [TYPES/announce] Call for Presentations: PriSC 2022 @ POPL 2022 Message-ID: Apologies if you're getting this email multiple times. All details are on the PriSC site . ================================================ Call for Presentations: PriSC 2022 @ POPL 2022 ================================================ The emerging field of secure compilation aims to preserve security properties of programs when they have been compiled to low-level languages such as assembly, where high-level abstractions don?t exist, and unsafe, unexpected interactions with libraries, other programs, the operating system and even the hardware are possible. For unsafe source languages like C, secure compilation requires careful handling of undefined source-language behavior (like buffer overflows and double frees). Formally, secure compilation aims to protect high-level language abstractions in compiled code, even against adversarial low-level contexts, thus enabling sound reasoning about security in the source language. A complementary goal is to keep the compiled code efficient, often leveraging new hardware security features and advances in compiler design. Other necessary components are identifying and formalizing properties that secure compilers must possess, devising efficient security mechanisms (both software and hardware), and developing effective verification and proof techniques. Research in the field thus puts together advances in compiler design, programming languages, systems security, verification, and computer architecture. 6th Workshop on Principles of Secure Compilation (PriSC 2022) ============================================================= The Workshop on Principles of Secure Compilation (PriSC) is a relatively new, informal 1-day workshop without any proceedings. The goal is to bring together researchers interested in secure compilation and to identify interesting research directions and open challenges.? The 6th edition of PriSC will be held on January 22, together with the ACM SIGPLAN Symposium on Principles of Programming Languages (POPL), 2022. We hope to hold the workshop in person with for support for dial-in attendees. Important Dates =============== * Thu 28 Oct 2021: Submission Deadline * Thu 18 Nov 2021: Acceptance Notification * Sat 22 Jan 2022: Workshop Presentation Proposals and Attending the Workshop ================================================= Anyone interested in presenting at the workshop should submit an extended abstract (up to 2 pages, details below) covering past, ongoing, or future work. Any topic that could be of interest to secure compilation is in scope. Secure compilation should be interpreted very broadly to include any work in security, programming languages, architecture, systems or their combination that can be leveraged to preserve security properties of programs when they are compiled or to eliminate low-level vulnerabilities.? Presentations that provide a useful outside view or challenge the community are also welcome. This includes presentations on new attack vectors such as microarchitectural side-channels, whose defenses could benefit from compiler techniques. Specific topics of interest include but are not limited to: * Attacker models for secure compiler chains. * Secure compiler properties: fully abstract compilation and similar properties, memory safety, control-flow integrity, preservation of safety, information flow and other (hyper-)properties against adversarial contexts, secure multi-language interoperability. * Secure interaction between different programming languages: foreign function interfaces, gradual types, securely combining different memory management strategies. * Enforcement mechanisms and low-level security primitives: static checking, program verification, typed assembly languages, reference monitoring, program rewriting, software-based isolation/hiding techniques (SFI, crypto-based, randomization-based, OS/hypervisor-based), security-oriented architectural features such as Intel?s SGX, MPX and MPK, capability machines, side-channel defenses, object capabilities. * Experimental evaluation and applications of secure compilers. * Proof methods relevant to compilation: (bi)simulation, logical relations, game semantics, trace semantics, multi-language semantics, embedded interpreters. * Formal verification of secure compilation chains (protection mechanisms, compilers, linkers, loaders), machine-checked proofs, translation validation, property-based testing. Guidelines for Submitting Extended Abstracts ============================================ Extended abstracts should be submitted in PDF format and not exceed 2 pages (references not including). They should be formatted in two-column layout, 10pt font, and be printable on A4 and US Letter sized paper. We recommend using the new acmart LaTeX style in sigplan mode. Submissions are not anonymous and should provide sufficient detail to be assessed by the program committee. Presentation at the workshop does not preclude publication elsewhere. Submission website: https://urldefense.com/v3/__https://prisc22.hotcrp.com/__;!!IBzWLUs!ERrw_BUFLYI5HIWB51Nf-cHmxJSTRiisKr9dsa84lqA-TCLhcU5qproqJ_RkVIGT3cfW3FX-OQ9bWw$ Program Committee ================= Owen Arden, UC Santa Cruz Arthur Azevedo de Amorim, Carnegie Mellon University Iulia Bastys, Chalmers University of Technology Roberto Blanco, Max Planck Institute for Security and Privacy Tegan Brennan, Stevens Institute of Technology Matteo Busi, Universit? di Pisa - Dipartimento di Informatica Sunjay Cauligi, University of California at San Diego Marco Guarnieri, IMDEA Software Institute (co-chair) Arma?l Gu?neau, Aarhus University Johannes Kinder, Bundeswehr University Munich Adrien Koutsos, INRIA Paris Elisavet Kozyri, Arctic University of Norway Scott Moore, Galois Toby Murray, University of Melbourne Andrew C. Myers, Cornell University David Pichardie, Facebook Jonathan Protzenko, Microsoft Research (co-chair) Christine Rizkallah, UNSW Sydney Zhong Shao, Yale University ?ric Tanter, University of Chile Danfeng Zhang, Pennsylvania State University Contact and More Information ============================ You can find more information on the workshop website: https://urldefense.com/v3/__https://popl22.sigplan.org/home/prisc-2022__;!!IBzWLUs!ERrw_BUFLYI5HIWB51Nf-cHmxJSTRiisKr9dsa84lqA-TCLhcU5qproqJ_RkVIGT3cfW3FWjWP1ysg$ For questions please contact the workshop chairs, Jonathan Protzenko and Marco Guarnieri . From nachumd at tauex.tau.ac.il Wed Sep 15 05:36:33 2021 From: nachumd at tauex.tau.ac.il (Nachum Dershowitz) Date: Wed, 15 Sep 2021 09:36:33 +0000 Subject: [TYPES/announce] please publicise References: Message-ID: Final Call for Workshops - FLoC 2022 ? The 2022 Federated Logic Conference July 31 - August 12, 2022 Haifa, Israel https://urldefense.com/v3/__http://www.floc2022.org/__;!!IBzWLUs!EsPUFY3DCh9dIjktjICYWEAjoytcRQHEBbLRRvxJpjp_QcfSs3T8pwHbQlJQwlTonxZhJbkgKKYsNQ$ CALL FOR WORKSHOPS The Eighth Federated Logic Conference (FLoC 2022) will host the following ten conferences and affiliated workshops. LICS (37th Annual ACM/IEEE Symposium on Logic in Computer Science) https://urldefense.com/v3/__http://lics.rwth-aachen.de/__;!!IBzWLUs!EsPUFY3DCh9dIjktjICYWEAjoytcRQHEBbLRRvxJpjp_QcfSs3T8pwHbQlJQwlTonxZhJbkOAffFSw$ Workshop chair: Frederic Blanqui Frederic.Blanqui at inria.fr ***FSCD (7th International Conference on Formal Structures for Computation and Deduction) https://urldefense.com/v3/__http://fscd-conference.org/__;!!IBzWLUs!EsPUFY3DCh9dIjktjICYWEAjoytcRQHEBbLRRvxJpjp_QcfSs3T8pwHbQlJQwlTonxZhJbmnB5LQvg$ Workshop chair: Nachum Dershowitz nachumd at tau.ac.il ***See https://urldefense.com/v3/__http://www.cs.tau.ac.il/*nachumd/FSCD/__;fg!!IBzWLUs!EsPUFY3DCh9dIjktjICYWEAjoytcRQHEBbLRRvxJpjp_QcfSs3T8pwHbQlJQwlTonxZhJbm-oLLxMg$ ITP (13th International Conference on Interactive Theorem Proving) https://urldefense.com/v3/__https://itp-conference.github.io/__;!!IBzWLUs!EsPUFY3DCh9dIjktjICYWEAjoytcRQHEBbLRRvxJpjp_QcfSs3T8pwHbQlJQwlTonxZhJbmvEVXlrg$ Workshop chair: Cyril Cohen cyril.cohen at inria.fr IJCAR (International Joint Conference on Automated Reasoning) https://urldefense.com/v3/__http://www.ijcar.org__;!!IBzWLUs!EsPUFY3DCh9dIjktjICYWEAjoytcRQHEBbLRRvxJpjp_QcfSs3T8pwHbQlJQwlTonxZhJbm5anEL4Q$ Workshop chairs: Sophie Tourret stourret at mpi-inf.mpg.de and Simon Robillard CSF (35th IEEE Computer Security Foundations Symposium) https://urldefense.com/v3/__http://www.ieee-security.org/CSFWweb/__;!!IBzWLUs!EsPUFY3DCh9dIjktjICYWEAjoytcRQHEBbLRRvxJpjp_QcfSs3T8pwHbQlJQwlTonxZhJbkx_uMANA$ Workshop chair: Musard Balliu musard at kth.se CAV (34th International Conference on Computer Aided Verification) https://urldefense.com/v3/__http://i-cav.org/__;!!IBzWLUs!EsPUFY3DCh9dIjktjICYWEAjoytcRQHEBbLRRvxJpjp_QcfSs3T8pwHbQlJQwlTonxZhJbn7GAtsGQ$ Workshop chair: Grigory Fedyukovich grigory at cs.fsu.edu KR (19th International Conference on Principles of Knowledge Representation and Reasoning) https://urldefense.com/v3/__http://www.kr.org/__;!!IBzWLUs!EsPUFY3DCh9dIjktjICYWEAjoytcRQHEBbLRRvxJpjp_QcfSs3T8pwHbQlJQwlTonxZhJbngSKM0Hw$ Workshop chair: Stefan Borgwardt stefan.borgwardt at tu-dresden.de ICLP (38th International Conference on Logic Programming) https://urldefense.com/v3/__https://www.cs.nmsu.edu/ALP/conferences/__;!!IBzWLUs!EsPUFY3DCh9dIjktjICYWEAjoytcRQHEBbLRRvxJpjp_QcfSs3T8pwHbQlJQwlTonxZhJbl0ctNkgw$ Workshop chair: Daniela Inclezan inclezd at miamioh.edu SAT (25th International Conference on Theory and Applications of Satisfiability Testing) https://urldefense.com/v3/__http://www.satisfiability.org__;!!IBzWLUs!EsPUFY3DCh9dIjktjICYWEAjoytcRQHEBbLRRvxJpjp_QcfSs3T8pwHbQlJQwlTonxZhJbkSdoRaOg$ Workshop chair: Alexander Nadel alexander.nadel at intel.com CP (25th International Conference on Principles and Practice of Constraint Programming) https://urldefense.com/v3/__http://a4cp.org/events/cp-conference-series__;!!IBzWLUs!EsPUFY3DCh9dIjktjICYWEAjoytcRQHEBbLRRvxJpjp_QcfSs3T8pwHbQlJQwlTonxZhJbl4aaip-w$ Workshop chair: Ciaran McCreesh ciaran.mccreesh at glasgow.ac.uk SUBMISSION OF WORKSHOP PROPOSALS Researchers and practitioners are invited to submit proposals for workshops on topics in the field of computer science, related to logic in the broad sense. Each workshop proposal must indicate one affiliated conference of FLoC 2022. It is strongly suggested that prospective workshop organizers contact the relevant conference workshop chair before submitting a proposal. Each proposal should consist of the following two parts. 1) A short scientific justification of the proposed topic, its significance, and the particular benefits of the workshop to the community, as well as a list of previous or related workshops (if relevant). 2) An organisational part including: - contact information for the workshop organizers; - proposed affiliated conference; - estimate of the number of workshop participants (please note that small workshops, i.e., of less than ~13 participants, will likely be cancelled or merged); - proposed format and agenda (e.g. paper presentations, tutorials, demo sessions, etc.); - potential invited speakers (note that expenses of workshop invited speakers are not covered by FLoC); - procedures for selecting papers and participants; - plans for dissemination, if any (e.g. a journal special issue); - duration (which may vary from one day to two days); - preferred period (pre or post FLoC); - virtual/hybrid backup plans (including platform preference). The FLoC Organizing Committee will determine the final list of accepted workshops based on the recommendations from the Workshop Chairs of the hosting conferences and availability of space and facilities. Proposals should be submitted through EasyChair: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=floc2022workshops__;!!IBzWLUs!EsPUFY3DCh9dIjktjICYWEAjoytcRQHEBbLRRvxJpjp_QcfSs3T8pwHbQlJQwlTonxZhJbkVp2HwCA$ Please see the Workshop Guidelines page: https://urldefense.com/v3/__https://floc2022.org/workshops/__;!!IBzWLUs!EsPUFY3DCh9dIjktjICYWEAjoytcRQHEBbLRRvxJpjp_QcfSs3T8pwHbQlJQwlTonxZhJblkEM77VA$ for further details and FAQ. IMPORTANT DATES Submission of workshop proposals deadline: September 27, 2021 Notification: November 1, 2021 Pre-FLoC workshops: Sunday & Monday, July 31?August 1, 2022 Post-FLoC workshops: Thursday & Friday, August 11-12, 2022 CONTACT INFORMATION Questions regarding proposals should be sent to the workshop chairs of the proposed affiliated conference. General questions should be sent to: shaull at technion.ac.il GuillermoAlberto.Perez at uantwerpen.be FLoC 2022 WORKSHOP CHAIRS Shaull Almagor Guillermo A. Perez -------------- next part -------------- An HTML attachment was scrubbed... URL: From pangjun at gmail.com Wed Sep 15 07:47:26 2021 From: pangjun at gmail.com (Jun PANG) Date: Wed, 15 Sep 2021 13:47:26 +0200 Subject: [TYPES/announce] Doctoral Symposium at FM 2021: Call for Research Abstracts In-Reply-To: References: Message-ID: Doctoral Symposium at FM 2021 ============================ Call for Research Abstracts --------------------------- (See also: https://urldefense.com/v3/__https://lcs.ios.ac.cn/fm2021/doctoral-symposim/__;!!IBzWLUs!H3hoYZY1-n2sZQPlKzcQ6UxuuRtvUTkzEXodugbJ-ML69GvmJ3IhViDQs4MiMhNVq8yIpGhWXeeo8Q$ ) A Doctoral Symposium will be held in conjunction with the 24th International Symposium on Formal Methods (FM 2021), 20-26 November. The hosting institution of FM 2021 is the Institute of Software, Chinese Academy of Sciences, Beijing, China. Just like the entire FM, the Doctoral Symposium will be held as an online event. Doctoral Symposium Chairs ------------------------- - Wolfgang Ahrendt, Chalmers University of Technology, Gothenburg, Sweden - Ji Wang, National University of Defence Technology, Changsha, China Goals and Scope --------------- This symposium aims to provide a supportive environment in which selected PhD students can present and discuss their ongoing work, meet other students working in the field of formal methods, and receive feedback and advice from experienced researchers. In addition to talks followed by discussions, the event will also provide opportunities for PhD students to meet senior academics in smaller groupings, to informally discuss research strategies, career aspects, or any other topic of interest. If you are a PhD student researching any topic that falls within the area of formal methods, you are warmly invited to submit a Research Abstract for consideration to be selected as a participant of the Doctoral Symposium. There will be a best presentation award. Invited Speaker --------------- - Erika Abraham, RWTH Aachen University, Aachen, Germany Research Abstracts ------------------ Research Abstracts should be no more than 4 pages in Springer LNCS format. Your Research Abstract should: - Outline the problem being addressed, its relevance, the solution you are working on, your research approach (such as your research method) and your expected contribution. - Contain a very brief literature survey indicating the most important references related to: 1) the problem being addressed and/or 2) existing solutions as appropriate - Indicate your progress to date and the current stage of research. The Research Abstract should be written by yourself as sole author, but may include references to relevant papers you have already published, including joint publications with collaborators. How to Submit ------------- Please upload your Research Abstract via the Easy Chair submission page: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=dsfm2021__;!!IBzWLUs!H3hoYZY1-n2sZQPlKzcQ6UxuuRtvUTkzEXodugbJ-ML69GvmJ3IhViDQs4MiMhNVq8yIpGh7_NGrTg$ Important Dates: - Submission deadline: October 4th, 2021 - Notification: October 22nd, 2021 From traytel at di.ku.dk Wed Sep 15 15:24:41 2021 From: traytel at di.ku.dk (Dmitriy Traytel) Date: Wed, 15 Sep 2021 19:24:41 +0000 Subject: [TYPES/announce] PhD position at the University of Copenhagen Message-ID: <8348ACB0-11D6-4597-8C9F-832C1016494D@di.ku.dk> Dear all, I have an open PhD position at the University of Copenhagen from January 2022 on the topic of formally verifying a data stream processing framework. Please see the official ad for more details and instructions on how to apply: https://urldefense.com/v3/__https://jobportal.ku.dk/phd/?show=154783__;!!IBzWLUs!FjI8ONvi3dLmFmleGN95vDMXnYoUmhUxh6T6UW3p3U28iUPlypy6WKsdUNTau5IOdHPT46tXzZDdjg$ The application deadline is 10 October 2021, 23:59 GMT +2. The position is funded by a grant from the Novo Nordisk Foundation. Familiarity with proof assistants is a big plus. Feel free to contact me, if you have any questions or know suitable candidates. Best wishes, Dmitriy From dimitri.ara at univ-amu.fr Thu Sep 16 03:45:01 2021 From: dimitri.ara at univ-amu.fr (Dimitri Ara) Date: Thu, 16 Sep 2021 09:45:01 +0200 Subject: [TYPES/announce] Conference Logic and Higher Structures Message-ID: Dear all, This is an announcement for the conference Logic and Higher Structures 21-25 February 2022 CIRM, Marseille, France https://urldefense.com/v3/__https://conferences.cirm-math.fr/2689.html__;!!IBzWLUs!CJxvKAO7FAtTUnh09Mxp_Q7lAd9-SHfYzrU3k-kpXDpmQ3zTYRnkStpEIkcIjAF2eaLbtHIr29OY6A$ Description =========== Voevodsky's univalent foundations program has revealed deep connections between logic and homotopy theory, in particular via higher category theory. The goal of this conference is to explore these interactions, bringing together mathematicians from the communities of type theory, higher rewriting, higher category theory and homotopy theory. The conference will consist of two mini-courses, one given by Egbert Rijke on Voedvodsky's univalent foundations and one given by Emily Riehl on higher category theory, 12 talks by invited speakers and a limited number of contributed talks for PhD students or young researchers. This conference is part of a thematic month entitled Logic and Interactions that will be held at the CIRM, Marseille, France, from January 24 to February 25 2022. Here is the webpage of this month: https://urldefense.com/v3/__https://conferences.cirm-math.fr/2507.html__;!!IBzWLUs!CJxvKAO7FAtTUnh09Mxp_Q7lAd9-SHfYzrU3k-kpXDpmQ3zTYRnkStpEIkcIjAF2eaLbtHIiDj-SVw$ * Mini-courses: Emily Riehl Egbert Rijke * Speakers: Andrej Bauer Ulrik Buchholtz Eric Finster Chris Kapulkin (TBC) Joachim Kock Nicolai Kraus Andrea Gagna Rune Haugseng Lyne Moser Viktoriya Ozornova Simona Paoli Christian Sattler Registration ============ Participation is free, and we expect to fund the accommodation of all participants requiring it, as well as providing a limited number of travel grants. See the "Funding" section below. Please pre-register early on the website https://urldefense.com/v3/__https://conferences.cirm-math.fr/2689.html__;!!IBzWLUs!CJxvKAO7FAtTUnh09Mxp_Q7lAd9-SHfYzrU3k-kpXDpmQ3zTYRnkStpEIkcIjAF2eaLbtHIr29OY6A$ if you are interested in attending, as this will help us organize the event in the best conditions. A first round of travel grants will be attributed in October. Funding ======= We plan to fund the accommodation of any participant, within the limits of the capacity of the CIRM and of our budget. If you have available funding, allowing you to pay for your own accommodation, please let us know nonetheless: this will allow us to allocate more of our own funding to other participants. The details of your accommodation will be managed by the CIRM. We also plan to offer a limited number of travel grants, mainly targeted at young researchers (master or PhD students, postdocs) attending several consecutive weeks or even the whole session of the thematic month: you can apply for such a grant in the pre-registration form. From mahsa at irif.fr Thu Sep 16 12:39:05 2021 From: mahsa at irif.fr (Mahsa) Date: Thu, 16 Sep 2021 18:39:05 +0200 Subject: [TYPES/announce] [ICALP 2022] Call for workshops Message-ID: ***Apologies for multiple receptions of this message*** First Call for Workshops - ICALP 2022 - July 4 - July 8, 2022 Paris, France https://urldefense.com/v3/__https://icalp2022.irif.fr/__;!!IBzWLUs!DycAMf2FsvyMBMx9XRLlQHr_rHuMVzaMvELhiDA4-xtakQVAQrTxAl4fboSieyy4LabIvpPvZMqCsg$ The International Colloquium on Automata, Languages and Programming (ICALP) is the main conference and annual meeting of the EATCS (European Association for Theoretical Computer Science). This year, after two virtual ICALP events, we are happy to be able to host this event in hybrid mode--and hope that many of us will be able to meet again in beautiful Paris! This is a call for workshops to be affiliated with ICALP 2022. We invite researchers to organise workshops on central topics on Automata, Languages and Programming, to help further mark off ICALP 2022. Important Dates: Workshop proposal deadline: Friday 19 November 2021, 23:59 AoE Workshop notification: Friday 10 December 2021 Workshops: Monday 4 July 2022. We strongly suggest that prospective workshop organizers contact the workshop selection committee before submitting a proposal. Workshop Proposal Guidelines: Proposals should be submitted no later than *** Friday 19 November 2021 *** by sending an email to the workshop selection committee, see below. You should expect notification on the acceptance of your proposal by 10 December 2021. A workshop proposal submission should consist of the following A short scientific justification of the proposed topic, its significance, and the particular benefits of the workshop to the community. An organisational part including: - workshop?s name and URL (if already available); - contact information for the workshop organizers (including their webpages); - expected number of participants (if available, please include the data of previous years); - proposed format and agenda (e.g. paper presentations, tutorials, see below for more details); - potential invited speakers; - plans for dissemination, if any (e.g. a journal special issue); - planned format of the event (see below for mode details); - virtual/hybrid backup plans (including platform preference). As for the format, a standard option is a full one-day workshop consisting of invited talks by leading experts and of shorter contributed talks, either directly invited by the organizers or selected among presentation submissions. Deviations from this standard are also welcome, including open problem sessions, discussion panels, or working sessions. If you plan to have invited speakers, please specify their expected number and, if possible, tentative names. If you plan a call for contributed talks (or papers) followed by a selection procedure, the submission date should be scheduled after ICALP 2022 notification (11 April 2022), while the notification should take place before the early registration deadline. In your submission please include details on the schedule, planned procedure of selecting contributed talks (or papers). If you plan to have published proceedings of your workshop, please provide the name of the publisher. Note that ICALP 2022 is not able to provide financial support for the organization of workshops. The conference can however provide a room, internet connection and help with some local organisation. For workshops that are online or in hybrid mode, it is expected that the organizers provide the supporting technical infrastructure. Workshop Selection Committee: Track A: Valia Mitsou > Track B: Mahsa Shirmohammadi > -------------- next part -------------- An HTML attachment was scrubbed... URL: From gabriel.scherer at gmail.com Fri Sep 17 04:58:30 2021 From: gabriel.scherer at gmail.com (Gabriel Scherer) Date: Fri, 17 Sep 2021 10:58:30 +0200 Subject: [TYPES/announce] Fwd: [gdri-ll] CfP: Logic and Interaction, Marseille, 24 Jan-25 Feb 2022 In-Reply-To: References: Message-ID: Dear announcements list, I'm sending this message on behalf of Lionel Vaux. --- Call for participation LOGIC AND INTERACTIONS 2022 (LI2022) Winter schools and Workshops Monday 24 January - Friday 25 February 2022 CIRM, Luminy, Marseille, France https://urldefense.com/v3/__https://conferences.cirm-math.fr/2507.html__;!!IBzWLUs!EaeeGg4mREv_4DMVH_5pzJquzL1FvgQ7yv7dc-rgYgZNR-x5gpsCaj2Qb3YAMgIYTT2Ixvvcauj_3g$ Pre-registration for Logic and Interaction 2022 is now open! Participation is free, and we expect to fund the accommodation of all participants requiring it, as well as providing a limited number of travel grants. See the "Funding" section below. Please pre-register early if you are interested in attending, as this will help us organize the event in the best conditions. Note that it is necessary to register for each week separately, using the registration link of the web page dedicated to that week. A first round of travel grants will be attributed in October. If you have any question regarding the event, feel free to email the organizers: li2022 at listes.math.cnrs.fr . Description =========== Logic and Interactions 2022 is a five-week session at the CIRM in Luminy (Marseille, France), on logic and its interactions in mathematics and computer science, but also in the broader perspective of its transdisciplinary nature, with connections to philosophy and linguistics. Two weeks will be organized as thematic schools targeted primarily at PhD students and non-specialist researchers. The other three will be workshops presenting the state of the art in specific areas. This is the fourth month-long session organized in Marseille on the broad topic of ?logic in computer science?, following *Logic and interactions 2002*, *Geometry of computation 2006* and *Logic and Interactions 2012*. As for previous sessions, we expect this event to offer a friendly venue not only for established specialists but also for students and young researchers as well as non-specialists. In addition to the thematic schools, each week will include introductory material. We encourage colleagues, and especially students and young researchers, to attend several weeks or even the full month, in order to make the most of this special occasion. Outline of the programme ======================== Week 1: Linear Logic Winter School (24 to 28 January) https://urldefense.com/v3/__https://conferences.cirm-math.fr/2685.html__;!!IBzWLUs!EaeeGg4mREv_4DMVH_5pzJquzL1FvgQ7yv7dc-rgYgZNR-x5gpsCaj2Qb3YAMgIYTT2IxvvoIgq7GA$ This school will offer an introduction to the main concepts and essential results in Linear Logic, based on an undergoing project to produce a reference textbook, within the International Research Network on Linear Logic [*]. In addition to the main lectures, the week will be concluded by a series of tutorial talks on a selection of advanced subjects. [*] https://urldefense.com/v3/__https://www.linear-logic.org__;!!IBzWLUs!EaeeGg4mREv_4DMVH_5pzJquzL1FvgQ7yv7dc-rgYgZNR-x5gpsCaj2Qb3YAMgIYTT2IxvvWhC9vHg$ Week 2. Logic of Probabilistic Programming (31 January to 4 February) https://urldefense.com/v3/__https://conferences.cirm-math.fr/2686.html__;!!IBzWLUs!EaeeGg4mREv_4DMVH_5pzJquzL1FvgQ7yv7dc-rgYgZNR-x5gpsCaj2Qb3YAMgIYTT2IxvsbwuQF8g$ This meeting will be devoted to the applications of logic, category theory and denotational semantics to the foundation of formal methods for probabilistic program analysis and probabilistic system verification. It will stress the specificities of Bayesian programming and machine learning where programs represent statistical models. Week 3. Logic and Transdisciplinarity (7 to 11 February) https://urldefense.com/v3/__https://conferences.cirm-math.fr/2687.html__;!!IBzWLUs!EaeeGg4mREv_4DMVH_5pzJquzL1FvgQ7yv7dc-rgYgZNR-x5gpsCaj2Qb3YAMgIYTT2Ixvv4XtZieg$ We will present and discuss some questions arisen from the development of logic which were an impulse for fruitful and long-lasting research at the interface between mathematics, philosophy and linguistics. During the week, seven half-days will be devoted to courses presenting selected themes on logic, philosophy and linguistics. Two afternoons will be devoted to invited talks by leading researchers in some of the areas touched during the courses. Week 4. Logic, Databases and Complexity (14 to 18 February) https://urldefense.com/v3/__https://conferences.cirm-math.fr/2688.html__;!!IBzWLUs!EaeeGg4mREv_4DMVH_5pzJquzL1FvgQ7yv7dc-rgYgZNR-x5gpsCaj2Qb3YAMgIYTT2Ixvuth-q47g$ This week aims at revisiting the connection between databases, complexity and logic. We will investigate the areas of database theory, descriptive complexity and team-based logics. The week will be organised as an informal workshop, with invited talks, introductory or specialist tutorial, and talks by the participants. Week 5. Logic and Higher Structures (21 to 25 February) https://urldefense.com/v3/__https://conferences.cirm-math.fr/2689.html__;!!IBzWLUs!EaeeGg4mREv_4DMVH_5pzJquzL1FvgQ7yv7dc-rgYgZNR-x5gpsCaj2Qb3YAMgIYTT2IxvvTRi-aIw$ Voevodsky's univalent foundations program has revealed deep connections between logic and homotopy theory, in particular via higher category theory. The goal of this week is to explore these interactions, bringing together mathematicians from the communities of type theory, higher rewriting, higher category theory and homotopy theory. The week will consist of two mini-courses (one on Voedvodsky's univalent foundations and one on higher category theory), invited talks and a limited number of contributed talks. Funding ======= We plan to fund the accommodation of any participant, within the limits of the capacity of the CIRM and of our budget. If you have available funding, allowing you to pay for your own accommodation, please let us know nonetheless: this will allow us to allocate more of our own funding to other participants. The details of your accommodation will be managed by the CIRM. We also plan to offer a limited number of travel grants, mainly targeted at young researchers (master or PhD students, postdocs) attending several consecutive weeks or even the whole session: you can apply for such a grant in the pre-registration form. -------------- next part -------------- An HTML attachment was scrubbed... URL: From ralf.kuesters at sec.uni-stuttgart.de Fri Sep 17 06:56:18 2021 From: ralf.kuesters at sec.uni-stuttgart.de (Ralf Kuesters) Date: Fri, 17 Sep 2021 12:56:18 +0200 Subject: [TYPES/announce] CFP: IEEE CSF 2022 - Fall Cycle (Submission Deadline: Oct 1st) Message-ID: <3002895e-0bc6-a4a8-598e-1f969f687e46@sec.uni-stuttgart.de> ------------------------------------------------------------------------ IEEE COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF) 2022 https://urldefense.com/v3/__https://www.ieee-security.org/TC/CSF2022/__;!!IBzWLUs!CyF3HCqoPM2HaAMAcYA7U8LPvi_jIx1j5pDHKFx5yvHXr_6_Zob7H-P0cNA21kCFoIY5GukUL0e32A$ ------------------------------------------------------------------------ The Computer Security Foundations Symposium (CSF) is an annual conference for researchers in computer security. CSF seeks papers on foundational aspects of computer security, such as formal security models, relationships between security properties and defenses, principled techniques and tools for design and rigorous analysis of security mechanisms, as well as their application to practice. While CSF welcomes submissions beyond the topics listed below, the main focus of CSF is foundational security and privacy. Papers lacking foundational aspects risk desk rejection without further evaluation of their merits; contact the PC chairs when in doubt. CSF 2022 continues to have rolling deadlines. Starting from CSF 2020, CSF has started to invite submissions three times a year: Spring (passed), Fall, and Winter. Spring cycle: May 14th, 2021: paper submission deadline July 16th, 2021: author notification Fall cycle: October 1st, 2021: paper submission deadline December 7th, 2021: author notification Winter cycle: February 4th, 2022: paper submission deadline April 8th, 2022: author notification TOPICS New results in security and privacy are welcome. We also encourage challenge/vision papers, which may describe open questions and raise fundamental concerns about security and privacy. Possible topics for all papers include, but are not limited to: - access control - accountability - anonymity - attack models - authentication - blockchains and smart contracts - cloud security - cryptography - data provenance - data and system integrity - database security - decidability and complexity - decision theory - distributed systems security - electronic voting - embedded systems security - forensics - formal methods and verification - hardware-based security - information flow control - intrusion detection - language-based security - mobile security - network security - privacy - security and privacy aspects of machine learning - security and privacy for the Internet of Things - security architecture - security metrics - security policies - security protocols - software security - socio-technical security - trust management - usable security - web security SYSTEMATIZATION OF KNOWLEDGE PAPERS CSF'22 solicits systematization of knowledge (SoK) papers in foundational security and privacy research. These papers systematize, re-formulate, or evaluate existing work in one established and significant research topic. Such papers must provide new insights. Survey papers without new insights are not appropriate. Papers trying to identify robust foundations of research areas still lacking them are particularly welcome. Submissions will be distinguished by the prefix ?SoK:? in the title and a checkbox on the submission form. SPECIAL SESSIONS This year, we strongly encourage papers in three foundational areas of research we would like to promote at CSF by means of special sessions. Special sessions serve to identify selected research topics of particular interest to the community. Papers submitted to special sessions are expected to comply with the same requirements as other papers. This year, we have the following special sessions: - MACHINE LEARNING MEETS SECURITY AND PRIVACY (Session Chair: Francesco Ranzato). Machine learning has revolutionized computer science. However, machine learning algorithms have been applied to problem domains as black boxes and offer little guarantees in terms of fairness and transparency of the results and privacy of the dataset, We invite submissions on foundational work in this area. Topics include security, privacy, and fairness issues of machine learning algorithms, reasoning techniques necessary to justify safety of its autonomous decisions, and techniques for protecting the privacy of the dataset. - BLOCKCHAIN and SMART CONTRACT (Session Chair: Aniket Kate). Many challenges arise with the rapid development of the blockchain technology and its main application: smart contract. The need for formal foundations for the security and privacy of blockchains and smart contracts. We invite submissions on foundational work in this area. Topics include security and privacy issues, analysis and verification of existing solutions, design of new systems, broader foundational issues such as how blockchain mechanisms fit into larger distributed ecosystems and foundational security aspects of applications built on top of blockchain mechanisms, new programming languages for smart contracts, and formal analysis of smart contracts. - CRYPTOGRAPHY (Session Chair: Ralf Kuesters). Cryptography is at the heart of many security- and privacy-critical systems. As such it is an integral part of the field of security and privacy. While modern cryptography is built on firm theoretical foundations, new applications frequently need new cryptographic solutions, new security definitions, models, and proof techniques and tools. We invite submissions in this area. Topics include, but are not limited to, the design and analysis of cryptographic protocols, new cryptographic frameworks and proof techniques, including composability as well as automated, tool-supported analysis and verification of cryptographic primitives and protocols. These papers will be reviewed under the supervision of the special session chairs. They will be presented at the conference, and will appear in the CSF proceedings, without any distinction from the other papers. PROGRAM CHAIRS Stefano Calzavara (University of Venice) David Naumann (Stevens Institute of Technology) PROGRAM COMMITTEE Mario Alvim (Federal University of Minas Gerais) Myrto Arapinis (University of Edinburgh) Owen Arden (UC Santa Cruz) Aslan Askarov (Aarhus University) Musard Balliu (KTH Royal Institute of Technology) Manuel Barbosa (University of Porto) Lennart Beringer (Princeton University) Karthikeyan Bhargavan (INRIA) Abhishek Bichhawat (Carnegie Mellon University) Roberto Blanco (Max Planck Institute) Tegan Brennan (Stevens Institute of Technology) Yinzhi Cao (Johns Hopkins University) Tom Chotia (University of Birmingham) V?ronique Cortier (LORIA/INRIA) Geoffroy Couteau (CNRS IRIF) St?phanie Delaune (IRISA) Francois Dupressoir (University of Bristol) Michael Emmi (AWS) Marc Fischlin (TU Darmstadt) Riccardo Focardi (Ca' Foscari University) Marco Guarnieri (IMDEA) Joshua Guttman (MIT Lincoln Labs) Charlie Jacomme (CISPA) Aniket Kate (Purdue University) Boris Kopf (Microsoft Research) Elisavet Kozyri (Harvard University) Robert K?nnemann (CISPA) Ralf K?sters (University of Stuttgart) Peeter Laud (Cybernetica AS) Giovanni Livraga (University of Milan, Statale) Heiko Mantel (TU Darmstadt) Sebastian M?dersheim (Technical University of Denmark) Johannes M?ller (University of Luxembourg) Toby Murray (University of Melbourne) Sabine Oechsner (University of Edinburgh) Catuscia Palamidessi (INRIA) Frank Piessens (KU Leuven) Jonathan Protzenko (Microsoft Research) Francesco Ranzato (University of Padua) Aseem Rastogi (Microsoft Research India) Andrei Sabelfeld (University of Chalmers) Ralf Sasse (ETH Zurich) Clara Schneidewind (Max Planck Institute) Dominique Schr?der (FAU Erlangen-N?rnberg) Pierre-Yves Strub (?cole Polytechnique) Tachio Terauchi (Waseda University) Alwen Tiu (Australian National University) Mayank Varia (Boston University) -- Prof. Dr. Ralf K?sters Institute of Information Security - SEC University of Stuttgart Universit?tsstra?e 38 D-70569 Stuttgart Germany https://urldefense.com/v3/__https://sec.uni-stuttgart.de__;!!IBzWLUs!CyF3HCqoPM2HaAMAcYA7U8LPvi_jIx1j5pDHKFx5yvHXr_6_Zob7H-P0cNA21kCFoIY5GunIigN8ow$ Phone: +49 (0) 711 685 88283 From carsten at dcs.bbk.ac.uk Fri Sep 17 10:00:34 2021 From: carsten at dcs.bbk.ac.uk (Carsten Fuhs) Date: Fri, 17 Sep 2021 16:00:34 +0200 Subject: [TYPES/announce] FSCD 2022: Final Call for Workshops (deadline: September 27, 2021) Message-ID: Final Call for Workshops - FLoC 2022 ? The 2022 Federated Logic Conference July 31 - August 12, 2022 Haifa, Israel https://urldefense.com/v3/__http://www.floc2022.org/__;!!IBzWLUs!HUOcQ1wZeMUCF_wQp0lLxhPwCFx9n3xY6B8Lg268QrgjLswKrAwMOJv5TCFppJ17TsNASFyjwQlAVA$ CALL FOR WORKSHOPS The Eighth Federated Logic Conference (FLoC 2022) will host the following ten conferences and affiliated workshops. LICS (37th Annual ACM/IEEE Symposium on Logic in Computer Science) https://urldefense.com/v3/__http://lics.rwth-aachen.de/__;!!IBzWLUs!HUOcQ1wZeMUCF_wQp0lLxhPwCFx9n3xY6B8Lg268QrgjLswKrAwMOJv5TCFppJ17TsNASFyfAMLzHg$ Workshop chair: Frederic Blanqui Frederic.Blanqui at inria.fr ***FSCD (7th International Conference on Formal Structures for Computation and Deduction) https://urldefense.com/v3/__http://fscd-conference.org/__;!!IBzWLUs!HUOcQ1wZeMUCF_wQp0lLxhPwCFx9n3xY6B8Lg268QrgjLswKrAwMOJv5TCFppJ17TsNASFx29DE41g$ Workshop chair: Nachum Dershowitz nachumd at tau.ac.il ***See https://urldefense.com/v3/__http://www.cs.tau.ac.il/*nachumd/FSCD/__;fg!!IBzWLUs!HUOcQ1wZeMUCF_wQp0lLxhPwCFx9n3xY6B8Lg268QrgjLswKrAwMOJv5TCFppJ17TsNASFzJaZ6pOw$ ITP (13th International Conference on Interactive Theorem Proving) https://urldefense.com/v3/__https://itp-conference.github.io/__;!!IBzWLUs!HUOcQ1wZeMUCF_wQp0lLxhPwCFx9n3xY6B8Lg268QrgjLswKrAwMOJv5TCFppJ17TsNASFzSWdFT7g$ Workshop chair: Cyril Cohen cyril.cohen at inria.fr IJCAR (International Joint Conference on Automated Reasoning) https://urldefense.com/v3/__http://www.ijcar.org__;!!IBzWLUs!HUOcQ1wZeMUCF_wQp0lLxhPwCFx9n3xY6B8Lg268QrgjLswKrAwMOJv5TCFppJ17TsNASFxcTHRTtQ$ Workshop chairs: Sophie Tourret stourret at mpi-inf.mpg.de and Simon Robillard CSF (35th IEEE Computer Security Foundations Symposium) https://urldefense.com/v3/__http://www.ieee-security.org/CSFWweb/__;!!IBzWLUs!HUOcQ1wZeMUCF_wQp0lLxhPwCFx9n3xY6B8Lg268QrgjLswKrAwMOJv5TCFppJ17TsNASFzN8FnUHQ$ Workshop chair: Musard Balliu musard at kth.se CAV (34th International Conference on Computer Aided Verification) https://urldefense.com/v3/__http://i-cav.org/__;!!IBzWLUs!HUOcQ1wZeMUCF_wQp0lLxhPwCFx9n3xY6B8Lg268QrgjLswKrAwMOJv5TCFppJ17TsNASFz2FMqt8w$ Workshop chair: Grigory Fedyukovich grigory at cs.fsu.edu KR (19th International Conference on Principles of Knowledge Representation and Reasoning) https://urldefense.com/v3/__http://www.kr.org/__;!!IBzWLUs!HUOcQ1wZeMUCF_wQp0lLxhPwCFx9n3xY6B8Lg268QrgjLswKrAwMOJv5TCFppJ17TsNASFz3pNSdDw$ Workshop chair: Stefan Borgwardt stefan.borgwardt at tu-dresden.de ICLP (38th International Conference on Logic Programming) https://urldefense.com/v3/__https://www.cs.nmsu.edu/ALP/conferences/__;!!IBzWLUs!HUOcQ1wZeMUCF_wQp0lLxhPwCFx9n3xY6B8Lg268QrgjLswKrAwMOJv5TCFppJ17TsNASFyXVYkYhg$ Workshop chair: Daniela Inclezan inclezd at miamioh.edu SAT (25th International Conference on Theory and Applications of Satisfiability Testing) https://urldefense.com/v3/__http://www.satisfiability.org__;!!IBzWLUs!HUOcQ1wZeMUCF_wQp0lLxhPwCFx9n3xY6B8Lg268QrgjLswKrAwMOJv5TCFppJ17TsNASFyO794rvQ$ Workshop chair: Alexander Nadel alexander.nadel at intel.com CP (25th International Conference on Principles and Practice of Constraint Programming) https://urldefense.com/v3/__http://a4cp.org/events/cp-conference-series__;!!IBzWLUs!HUOcQ1wZeMUCF_wQp0lLxhPwCFx9n3xY6B8Lg268QrgjLswKrAwMOJv5TCFppJ17TsNASFyXJRXmHQ$ Workshop chair: Ciaran McCreesh ciaran.mccreesh at glasgow.ac.uk SUBMISSION OF WORKSHOP PROPOSALS Researchers and practitioners are invited to submit proposals for workshops on topics in the field of computer science, related to logic in the broad sense. Each workshop proposal must indicate one affiliated conference of FLoC 2022. It is strongly suggested that prospective workshop organizers contact the relevant conference workshop chair before submitting a proposal. Each proposal should consist of the following two parts. 1) A short scientific justification of the proposed topic, its significance, and the particular benefits of the workshop to the community, as well as a list of previous or related workshops (if relevant). 2) An organisational part including: - contact information for the workshop organizers; - proposed affiliated conference; - estimate of the number of workshop participants (please note that small workshops, i.e., of less than ~13 participants, will likely be cancelled or merged); - proposed format and agenda (e.g. paper presentations, tutorials, demo sessions, etc.); - potential invited speakers (note that expenses of workshop invited speakers are not covered by FLoC); - procedures for selecting papers and participants; - plans for dissemination, if any (e.g. a journal special issue); - duration (which may vary from one day to two days); - preferred period (pre or post FLoC); - virtual/hybrid backup plans (including platform preference). The FLoC Organizing Committee will determine the final list of accepted workshops based on the recommendations from the Workshop Chairs of the hosting conferences and availability of space and facilities. Proposals should be submitted through EasyChair: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=floc2022workshops__;!!IBzWLUs!HUOcQ1wZeMUCF_wQp0lLxhPwCFx9n3xY6B8Lg268QrgjLswKrAwMOJv5TCFppJ17TsNASFypbiKJYw$ Please see the Workshop Guidelines page: https://urldefense.com/v3/__https://floc2022.org/workshops/__;!!IBzWLUs!HUOcQ1wZeMUCF_wQp0lLxhPwCFx9n3xY6B8Lg268QrgjLswKrAwMOJv5TCFppJ17TsNASFwQEeeBEQ$ for further details and FAQ. IMPORTANT DATES Submission of workshop proposals deadline: September 27, 2021 Notification: November 1, 2021 Pre-FLoC workshops: Sunday & Monday, July 31?August 1, 2022 Post-FLoC workshops: Thursday & Friday, August 11-12, 2022 CONTACT INFORMATION Questions regarding proposals should be sent to the workshop chairs of the proposed affiliated conference. General questions should be sent to: shaull at technion.ac.il GuillermoAlberto.Perez at uantwerpen.be FLoC 2022 WORKSHOP CHAIRS Shaull Almagor Guillermo A. Perez From riccardo.treglia at unito.it Tue Sep 21 05:31:14 2021 From: riccardo.treglia at unito.it (Riccardo Treglia) Date: Tue, 21 Sep 2021 11:31:14 +0200 Subject: [TYPES/announce] ITRS Call for Post-Proceedings Message-ID: ITRS 2021 Call for Post-ProceedingsTenth Workshop on Intersection Types and Related Systems - ITRS 2021 17 July 2021, Online Affiliated with FSCD , 17-24 July 2021, Buenos Aires Web page: https://urldefense.com/v3/__http://www.di.unito.it/*deligu/ITRS2021/__;fg!!IBzWLUs!FLn7aHMzY6HrXO3KJJA59O83OnWqksX9LvNZresHtiVy7ClLtbwjipgIXqebOfIjGgo_N6dpZd2c0Q$ Aims and Scope Intersection types were introduced near the end of the 1970s to overcome the limitations of Curry's type assignment system and to provide a characterization of the strongly normalizing terms of the Lambda Calculus. The key idea is to introduce an intersection type constructor ? such that a term of type t ? s can be used at both type t and s within the same context. This provides a finite polymorphism where various, even unrelated, types of the term are listed explicitly, differently from the more widely used universally quantified types where the polymorphic type is the common schema that stands for its various type instances. As a consequence, more terms (all and only the normalizing terms) can be typed than with universal polymorphism. Although intersection types were initially intended for use in analyzing and/or synthesizing lambda models as well as in analyzing normalization properties, over the last twenty years the scope of the research on intersection types and related systems has broadened in many directions. Restricted (and more manageable) forms have been investigated, such as refinement types. Type systems based on intersection type theory have been extensively studied for practical purposes, such as program analysis and higher-order model checking. The dual notion of union types turned out to be quite useful for programming languages. Finally, the behavioral approach to types, which can give a static specification of computational properties, has become central in the most recent research on type theory. The ITRS 2021 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches. Possible topics for submitted papers include, but are not limited to: - Formal properties of systems with intersection types. - Results for related systems, such as union types, refinement types, or singleton types. - Applications to lambda calculus, pi-calculus and similar systems. - Applications for programming languages, program analysis, and program verification. - Applications for other areas, such as database query languages and program extraction from proofs. - Related approaches using behavioral/intensional types and/or denotational semantics to characterize computational properties. - Quantitative refinements of intersection types. ITRS workshops have been held every two years (with the exception of 2020, because of COVID-19 outbreak). Information about the previous events is available on the ITRS home page . Post-Proceedings We are planning post-proceedings, including presentations to the workshop and submissions accepted via an open call with *dates*: - submission deadline: *1 October* - acceptance communication: *5 November* - camera-ready version: *19 November* Papers should not be published elsewhere, with original results or surveying ongoing research. They should be written in English using LaTex and will appear on EPTCS: see Information for Authors . Submissions should be 20 pages long, excluding bibliography and avoiding technical appendices. Submissions are expected via EasyChair . Program Committee - Antonio Bucciarelli, Universit? de Paris, France - Daniel de Carvalho, Universit? Grenoble Alpes, France - Andrej Dudenhefner, Saarland University, Germany - Silvia Ghilezan, University of Novi Sad, Serbia - Giulio Guerrieri, University of Bath, UK - Ugo de' Liguoro, Universit? di Torino, Italy (chair) - Jeremy Siek, Indiana University Bloomington, USA (co-chair) ------------------------------ Steering Committee - Mariangiola Dezani-Ciancaglini, Universit? di Torino, Italy - Jakob Rehof, TU University of Dortmund, Germany - Joe Wells, Heriot-Watt University, Scotland Organizers: - Ugo de' Liguoro, Universit? di Torino, Italy - Riccardo Treglia, Universit? di Torino, Italy ( riccardo.treglia at unito.it) -------------- next part -------------- An HTML attachment was scrubbed... URL: From ruy at cin.ufpe.br Mon Sep 20 08:55:08 2021 From: ruy at cin.ufpe.br (Ruy Jose Guerra Barretto de Queiroz) Date: Mon, 20 Sep 2021 09:55:08 -0300 Subject: [TYPES/announce] 27th WoLLIC 2021 - Call for Participation (Online) In-Reply-To: References: Message-ID: [Please circulate. Apologies for multiple copies.] CALL FOR PARTICIPATION WoLLIC 2021 27th Workshop on Logic, Language, Information and Computation October 5 to 8, 2021 (Virtual Event) ORGANISATION Universidade de S?o Paulo, Brazil University College London, UK Centro de Inform?tica, Universidade Federal de Pernambuco, Brazil VISION 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 online from October 5 to 8, 2021. 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). INVITED SPEAKERS Catarina Dutilh Novaes (VU Amsterdam) Santiago Figueira (Universidad de Buenos Aires, Argentina) Andreas Herzig (IRIT, France) Cl?udia Nalon (UnB - Brazil) PROGRAMME COMMITTEE Carlos Areces (FaMAF - Universidad Nacional de C?rdoba, Argentina) Arthur Azevedo de Amorim (Boston University, USA) Paul Brunet (University College London, UK) Nina Gierasimczuk (Technical University of Denmark, Denmark) Helle Hvid Hansen (University of Groningen, The Netherlands) Justin Hsu (University of Pennsylvania, USA) Fairouz Kamareddine (Heriot-Watt University, UK) Sandra Kiefer (RWTH 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, and Univ Birmingham, UK) Elaine Pimentel (UFRN, Brazil) Revantha Ramanayake (University of Groningen, The Netherlands) Jurriaan Rot (Radboud University, The Netherlands) Alexandra Silva (Cornell Univ, USA) (Co-Chair) Christine Tasson (IRIF, France) Sebastiaan Terwijn (Radboud University, The Netherlands) Renata Wassermann (Univ S?o Paulo, Brazil) (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 Renata Wassermann (Univ S?o Paulo, Brazil) (Co-Chair) Alexandra Silva (Cornell Univ, USA) (Co-Chair) Anjolina G. de Oliveira (Univ Federal de Pernambuco, Brazil) Ruy de Queiroz (Univ Federal de Pernambuco, Brazil) (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 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." (https://urldefense.com/v3/__http://www.zalafilms.com/secrets/__;!!IBzWLUs!HEv2-DwY0JEZr8aScD9B1yw79wdD-a-pgVZ_n72_bUTrQV5pu_SRyVcmZ2SbOZEPAUdfL1m7Pzn_wQ$ ) FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee. WEB PAGE https://urldefense.com/v3/__http://wollic.org/__;!!IBzWLUs!HEv2-DwY0JEZr8aScD9B1yw79wdD-a-pgVZ_n72_bUTrQV5pu_SRyVcmZ2SbOZEPAUdfL1n1iA0frA$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From eva at mpi-sws.org Tue Sep 21 06:25:58 2021 From: eva at mpi-sws.org (Eva Darulova) Date: Tue, 21 Sep 2021 12:25:58 +0200 Subject: [TYPES/announce] Call for (Self-)Nominations for the ASPLOS 2022 Artifact Evaluation Committee Message-ID: <78045c52-5204-32ef-84be-1bcf8343e378@mpi-sws.org> We are looking for motivated students, researchers and engineers to be part of the ASPLOS'22 artifact evaluation committee. This year, you can nominate yourself or your students/postdocs or fellow engineers. You can find more information about ASPLOS'22 artifact evaluation here: https://urldefense.com/v3/__https://ctuning.org/ae/asplos2022.html__;!!IBzWLUs!BSsrsk8wGDOu8-Zfqun3mlmWvGycVTqcWfzaTh43CDHOoCaRoVVTwJqUdjGI7ruClng3wxiUVH_Xmg$ The (self-)nomination form is available at: https://urldefense.com/v3/__https://forms.gle/pTVYYeYcfR1vLj6GA__;!!IBzWLUs!BSsrsk8wGDOu8-Zfqun3mlmWvGycVTqcWfzaTh43CDHOoCaRoVVTwJqUdjGI7ruClng3wxjpBDfyTQ$ , and open until 22 October. As a committee member, your responsibility will be to review artifacts submitted for already accepted papers, e.g. by inspecting and running code and checking whether it allows to reproduce the main results of the paper. All evaluators will be acknowledged in the proceedings. ASPLOS AE'22 will use the HotCRP submission website to communicate asynchronously with artifact authors to allow to resolve issues quickly. We expect the main work to take place between December 8 and January 17. From gaboardi at bu.edu Tue Sep 21 11:09:09 2021 From: gaboardi at bu.edu (Gaboardi, Marco) Date: Tue, 21 Sep 2021 15:09:09 +0000 Subject: [TYPES/announce] tenure-track assistant professor positions at Boston University Computer Science Department Message-ID: <1F996582-CD2A-41E3-8409-222D6374C7C6@bu.edu> Boston University Computer Science Department has openings for two tenure-track assistant professorships. The search is open to all the areas of computer science and strong applicants working on the principles of programming languages and related areas will be seriously considered. You can find below the official announcement, which is also available at the link: https://urldefense.com/v3/__https://www.bu.edu/cs/2021/09/17/bu-cs-invites-applications-for-new-faculty-members/__;!!IBzWLUs!CMKBQNqbXEeJD5W5B1dMbgTBYGnzsLkWrjfywyUVGokca_ZGVHBX26EkWD5uD0bJWUjwfWbSUCKoyA$ We do hope to expand our Principles of Programming Languages and Verification group. https://urldefense.com/v3/__http://www.bu.edu/cs/research/popv/__;!!IBzWLUs!CMKBQNqbXEeJD5W5B1dMbgTBYGnzsLkWrjfywyUVGokca_ZGVHBX26EkWD5uD0bJWUjwfWY-t4-Wfw$ I am happy to answer any question that interested candidates may have. Best! Marco Official Announcement ??????????? Boston University Computer Science has openings for two tenure-track assistant professorships beginning July 1, 2022. Strong applicants in all areas of computer science, including security, privacy, foundations of programming languages and formal verification, machine learning and optimization, systems, human-computer interaction, artificial intelligence, algorithms, and theory, are encouraged to apply. We also have an opening for an associate professor of the practice beginning July 1, 2022. This search is particularly focused in the areas of artificial intelligence, machine learning, and deep learning. The Department is in the midst of an extended period of sustained growth, and is looking to both deepen areas of existing strength as well as to broaden into additional, new areas. Over the past several years, the tenure track faculty size has grown by 50%, with corresponding increases in graduate student population as well as in space and other resources. In December 2019, Boston University broke ground on a new 17-story, 350,000-square-foot Data Sciences Center, to house Computer Science along with other units contributing to Data Science, with planned opening in January 2023. Boston University, which has steadily increased in rankings over the past decade, is committed to nurturing and supporting interdisciplinary and cross-departmental research. BU is situated centrally in Boston, a vibrant city with an enormous range of options for industrial and academic collaboration around technology. The Department consists of a diverse group of 32 tenured and tenure-track faculty members, and offers programs leading to B.A., M.S., and Ph.D. degrees. The Department has research strengths in data mining, databases, graphics, image and video computing, machine learning, natural language processing, networking, distributed systems, operating systems, software design and implementation, real-time systems, security and cryptography, and theory of computation and algorithms. In addition, members of the Department collaborate closely with faculty across the university including mathematics and statistics, computer engineering, mechanical engineering, biology, earth and environment, economics, law, medicine, among others.Additional information about the Department is available at https://urldefense.com/v3/__http://www.bu.edu/cs__;!!IBzWLUs!CMKBQNqbXEeJD5W5B1dMbgTBYGnzsLkWrjfywyUVGokca_ZGVHBX26EkWD5uD0bJWUjwfWaVu0197A$ . Boston University as well as the Department of Computer Science expect excellence in research and in teaching and are committed to building a culturally, racially, and ethnically diverse scholarly community. To apply: Assistant Professor position (review to begin on 12/1/21 and continue on a rolling basis): https://urldefense.com/v3/__https://academicjobsonline.org/ajo/jobs/19503__;!!IBzWLUs!CMKBQNqbXEeJD5W5B1dMbgTBYGnzsLkWrjfywyUVGokca_ZGVHBX26EkWD5uD0bJWUjwfWaoWnpNHQ$ BU is an equal opportunity employer and all qualified applicants will receive consideration for employment without regard to race, color, religion, sex, sexual orientation, gender identity, national origin, disability status, protected veteran status, or any other characteristic protected by law. We are a VEVRAA Federal Contractor. Applicants are encouraged to consider other open faculty positions in related academic units at Boston University, including Computing & Data Sciences, Electrical & Computer Engineering, and Statistics. Upon request, successful candidates will have the opportunity to secure secondary appointments in cognate academic units at Boston University as appropriate. From abraham at informatik.rwth-aachen.de Tue Sep 21 14:07:17 2021 From: abraham at informatik.rwth-aachen.de (Erika Abraham) Date: Tue, 21 Sep 2021 20:07:17 +0200 Subject: [TYPES/announce] CfP Software Verification and Testing Track at SAC 2022 In-Reply-To: <9b21d639-f33c-4c3f-c38a-03f58233bba4@informatik.rwth-aachen.de> References: <9b21d639-f33c-4c3f-c38a-03f58233bba4@informatik.rwth-aachen.de> Message-ID: <097f1ece-4fc3-a7ed-2b2b-210feca70582@informatik.rwth-aachen.de> 37th Annual ACM/SIGAPP Symposium on Applied Computing Software Verification and Testing Track Brno, Czech Republic April 25-29, 2022 SAC 2022 website: https://urldefense.com/v3/__https://www.sigapp.org/sac/sac2022/__;!!IBzWLUs!HguDhwyE0DLDs44JNg27-c3v-B1Z4taG0QjGtGMfArzNa8LUnUWPtn42spR5AUP7ZXfxC3J9dUXiAw$ SAC-SVT 2022 website: https://urldefense.com/v3/__http://logimics.mics.centralesupelec.fr/en/SAC-SVT-2022__;!!IBzWLUs!HguDhwyE0DLDs44JNg27-c3v-B1Z4taG0QjGtGMfArzNa8LUnUWPtn42spR5AUP7ZXfxC3K4i9zwmA$ ==== Important dates ==== Oct. 15, 2021 - Submission of regular papers and SRC research abstracts Dec. 10, 2021 - Notification Dec. 21, 2021 - Camera-ready version Dec. 21, 2021 - Author registration due date ==== ACM Symposium on Applied Computing ==== The ACM Symposium on Applied Computing (SAC) has gathered scientists from different areas of computing over the last thirty years. The forum represents an opportunity to interact with different communities sharing an interest in applied computing. SAC 2022 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and will take place on April 25-29, 2022 in Brno, Czech Republic. ==== Software Verification and Testing Track (SVT) ==== The Software Verification and Testing track aims at contributing to the challenge of improving the usability of formal methods in software engineering. The track covers areas such as formal methods for verification and testing, based on theorem proving, model checking, static analysis, and run-time verification. We invite authors to submit new results in formal verification and testing, as well as development of technologies to improve the usability of formal methods in software engineering. Also are welcome detailed descriptions of applications of mechanical verification to large scale software. ==== Topics ==== Possible topics include, but are not limited to: * model checking * theorem proving * correct by construction development * model-based testing * software testing * symbolic execution * static and dynamic analysis * abstract interpretation * analysis methods for dependable systems * software certification and proof carrying code * fault diagnosis and debugging * verification and validation of large scale software systems * real world applications and case studies applying software testing and verification * benchmarks and data sets for software testing and verification ==== Submission Guidelines ==== Paper submissions must report on original, unpublished work. Submitted papers will undergo a double-blind review process. Author(s) name(s) and address(es) must not appear in the body of the paper, and self- reference should be avoided and made in the third person. We welcome research papers and posters. Research papers should have at most 8 two-column pages in ACM format (further two pages, to a total of 10 pages, may be available at a charge). The length of a poster is limited to three pages (one extra page may be available at a charge). Please comply to this page limitation already at submission time. Furthermore, in the context of the Student Research Competition (SRC) Program to provide graduate students the opportunity to meet and exchange ideas with researchers and practitioners in their areas of interest, graduate students are invited to submit research abstracts (maximum of 4 pages in ACM camera-ready format) following the instructions published at the SAC 2022 website at https://urldefense.com/v3/__https://www.sigapp.org/sac/sac2022/authorkit/ACM_SigConf-SRC2022.pdf__;!!IBzWLUs!HguDhwyE0DLDs44JNg27-c3v-B1Z4taG0QjGtGMfArzNa8LUnUWPtn42spR5AUP7ZXfxC3IT43u8Pg$ Submission of the same abstract to multiple tracks is not allowed. Accepted papers will be published in the ACM SAC 2022 proceedings in the ACM digital library. Paper registration is required, allowing the inclusion of the paper/poster in the conference proceedings. An author or a proxy attending SAC MUST present the paper. This is a requirement for the paper/poster to be included in the ACM digital library. No-show of registered papers and posters will result in excluding them from the ACM digital library. Detailed submission instructions are available on the SAC 2022 website. ==== Track Chairs ==== Erika Abraham, RWTH Aachen University, Germany Pascale Le Gall, CentraleSup?lec, Universit? Paris-Saclay, France For further information we refer to the SAC-SVT 2022 website: https://urldefense.com/v3/__http://logimics.mics.centralesupelec.fr/en/SAC-SVT-2022__;!!IBzWLUs!HguDhwyE0DLDs44JNg27-c3v-B1Z4taG0QjGtGMfArzNa8LUnUWPtn42spR5AUP7ZXfxC3K4i9zwmA$ From wjb at williamjbowman.com Tue Sep 21 15:48:21 2021 From: wjb at williamjbowman.com (William J. Bowman) Date: Tue, 21 Sep 2021 12:48:21 -0700 Subject: [TYPES/announce] Call for Tutorials and Workshops: PLDI 2022 Message-ID: Please distribute widely: # Call for Workshops and Tutorials PLDI 2022 is a world-class forum for researchers and practitioners in programming language design and implementation. As in previous years, PLDI is soliciting proposals for co-located workshops and tutorials that will take place on Monday June 20th, and Tuesday June 21st. Please propose your workshop or tutorial via the submission system. The following details will be asked on submission: * Name of the workshop/tutorial. * Duration of the workshop/tutorial. * Organizers: names, affiliation, contact information, brief (100 words) biography. * A short description (150-200 words) of the topic. * Event format: workshop/tutorial; type of submissions, if any; review process; results dissemination. * Expected attendance and target audience within the PLDI community. * How you plan to foster an inclusive environment and promote a diverse attendance. * Information on any previous iterations of the workshop or tutorial. *Note:* Workshops must make their own acceptance decisions by April 21, 2022 if there will be proceedings (final versions due May 5, 2022), or May 5, 2022. ## Submission Submission site: https://urldefense.com/v3/__https://pldi22.sigplan.org/createProposal/d625158d-7188-4844-88cd-9bf71182aa9a__;!!IBzWLUs!CCl-RYsNYGH7YS0ia9oUuB-QeOvMMHsfGzUOZ6gY4BxKHS6cLvAx4ukxCc-Okbx9XJ7Y4m7rD1yHCg$ Workshops that would like their proceedings included in the ACM Digital Library must submit a proposal by November 18, 2021. Workshops and tutorials that will have no formal proceedings should submit a proposal by November 30, 2021. ## Review Proposals are reviewed by the Workshop and Tutorials Chairs, and if necessary, by the PLDI general chair. * Proposals will be evaluated according to the relevance of the topic, the expertise and experience of the workshop organizers, and their potential to attract participants. * Proposals submitted between November 18th and 30th will be evaluated on a first-come-first-served basis. ## Notification We will notify workshop/tutorial acceptance by December 9th. ## Timeline Submission deadline (with proceedings): November 18 Submission deadline (no proceedings): November 30 Notification: December 9 ## Dissemination A proposal should clearly state how the results of the workshop ? i.e., published papers and other outcomes ? will be made available to participants and others before and after the workshop event. The Workshops and Tutorials Chair will provide guidance to the organizers of accepted workshops that wish to publish proceedings in the ACM Digital Library. For those that choose to publish their papers in ACM Digital Library, please add the following text in the workshop call for papers and on the website: *AUTHORS TAKE NOTE:* The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of your conference. The official publication date affects the deadline for any patent filings related to published work. (For those rare conferences whose proceedings are published in the ACM Digital Library after the conference is over, the official publication date remains the first day of the conference.) Workshops that elect to publish proceedings can do so in the ACM Digital Library with sponsoring by SIGPLAN. The application for SIGPLAN sponsorship includes reviewing the proposed program committee with the SIGPLAN Executive Committee, a process which the chairs will help facilitate. ## Workshop Co-Chairs - Nadia Polikarpova, U. of California at San Diego - Alexandra Silva, U. College London From fm-announcements at lists.nasa.gov Tue Sep 21 17:30:38 2021 From: fm-announcements at lists.nasa.gov (Havelund, Klaus (US 348B) via fm-announcements) Date: Tue, 21 Sep 2021 21:30:38 +0000 Subject: [TYPES/announce] [fm-announcements] NFM 2022 - First Call for Papers Message-ID: <74308E10-871F-4B2B-AABC-7834A3C9DB6E@jpl.nasa.gov> NFM 2022 - FIRST CALL FOR PAPERS The 14th NASA Formal Methods Symposium https://urldefense.com/v3/__https://shemesh.larc.nasa.gov/nfm2022/__;!!IBzWLUs!FYwmhSFfFgasWL7_0T1hFMIba3VnOHDybs4fGoQ0p_cP-uxfkS55MYckyWBmYB05QFVeRnt8kQ_H8Q$ May 24-27, 2022 Pasadena, California, USA The symposium is planned to be held in person at California Institute of Technology, but potentially transitioning to fully virtual if the COVID situation persists. Virtual presentations will be possible even if the conference is held in-person. The symposium has NO registration fee for presenting and attending. IMPORTANT DATES - Abstract Submission: December 3, 2021 - Paper Submission: December 10, 2021 - Paper Notifications: February 4, 2022 - Camera-ready Papers: March 4, 2022 - Symposium: May 24-27, 2022 THEME OF SYMPOSIUM The widespread use and increasing complexity of mission-critical and safety-critical systems at NASA and in the aerospace industry requires advanced techniques that address these systems' specification, design, verification, validation, and certification requirements. The NASA Formal Methods Symposium (NFM) is a forum to foster collaboration between theoreticians and practitioners from NASA, academia, and industry. NFM's goals are to identify challenges and to provide solutions for achieving assurance for such critical systems. The focus of the symposium will be on formal/rigorous techniques for software assurance, including their theory, current capabilities and limitations, as well as their potential application to aerospace during all stages of the software life-cycle. The NASA Formal Methods Symposium is an annual event organized by the NASA Formal Methods (NFM) Research Group, composed of researchers spanning six NASA centers. The organization of NFM 2022 is being led by the Jet Propulsion Laboratory (JPL), located in Pasadena, California. TOPICS ON INTEREST Topics of interest include, but are not limited to, the following aspects of formal methods: Advances in formal methods - Interactive and automated theorem proving - SMT and SAT solving - Model checking - Static analysis - Runtime verification - Automated testing - Specification languages, textual and graphical - Refinement - Code synthesis - Design for verification and correct-by-design techniques - Requirements specification and analysis Integration of formal methods techniques - Integration of diverse formal methods techniques - Use of machine learning and probabilistic reasoning techniques in formal methods - Integration of formal methods into software engineering practices? - Combination of formal methods with simulation and analysis techniques - Formal methods and fault tolerance, resilient computing, and self healing systems - Formal methods and graphical modeling languages such as SysML, UML, MATLAB/Simulink - Formal methods and autonomy, e.g., verification of systems and languages for planning and scheduling (PDDL, Plexil, etc.), self-sufficient systems, and fault-tolerant systems. Formal methods in practice - Experience reports of application of formal methods on real systems, such as autonomous systems, safety-critical systems, concurrent and distributed systems, cyber-physical, embedded, and hybrid systems, fault-detection, diagnostics, and prognostics systems, and human-machine interaction analysis. - Use of formal methods in systems engineering (including hardware components) - Use of formal methods in education - Reports on negative results in the development and the application for formal methods in practice. - Usability of formal method tools, and their infusion into industrial contexts. - Challenge problems for future reference by the formal methods community. The formulation of these papers can range from plain English description of a problem over formal specifications, to specific implementations in a programming language. NASA OPEN SOURCE Courageous authors, who want to delve in open source software being applied in real NASA missions, and find possible connections to and applications of Formal Methods, are invited to visit the open source repositories for the following two frameworks for programming flight software: - F? (https://urldefense.com/v3/__https://gcc02.safelinks.protection.outlook.com/?url=https*3A*2F*2Fnasa.github.io*2Ffprime*2F&data=04*7C01*7Cfm-announcements*40lists.nasa.gov*7Cb2b5a7571d6d41d1373708d97d471022*7C7005d45845be48ae8140d43da96dd17b*7C0*7C0*7C637678566447486427*7CUnknown*7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0*3D*7C1000&sdata=ROIuOk*2FESRja7M8MTYCT4eioKC7hL3Pz1*2BpcOsQBOsw*3D&reserved=0__;JSUlJSUlJSUlJSUlJSUlJSUlJSU!!IBzWLUs!FYwmhSFfFgasWL7_0T1hFMIba3VnOHDybs4fGoQ0p_cP-uxfkS55MYckyWBmYB05QFVeRns_jO67sA$ ) - cFS (https://urldefense.com/v3/__https://cfs.gsfc.nasa.gov/__;!!IBzWLUs!FYwmhSFfFgasWL7_0T1hFMIba3VnOHDybs4fGoQ0p_cP-uxfkS55MYckyWBmYB05QFVeRnvgmPN-XA$ ) SUBMISSIONS There are two categories of submissions: - Regular papers describing fully developed work and complete results (maximum 15 pages, excluding references); - Short papers on tools, experience reports, or work in progress with preliminary results (maximum 6 pages, excluding references). Additional appendices can be submitted as supplementary material for reviewing purposes. They will not be included in the proceedings. All papers must be in English and describe original work that has not been published. All submissions will be reviewed by at least three members of the Program Committee. We encourage authors to focus on readability of their submissions. Papers will appear in the Formal Methods subline of Springer's Lecture Notes in Computer Science (LNCS) and must use LNCS style formatting (https://urldefense.com/v3/__https://gcc02.safelinks.protection.outlook.com/?url=https*3A*2F*2Fwww.springer.com*2Fgp*2Fcomputer-science*2Flncs*2Fconference-proceedings-guidelines&data=04*7C01*7Cfm-announcements*40lists.nasa.gov*7Cb2b5a7571d6d41d1373708d97d471022*7C7005d45845be48ae8140d43da96dd17b*7C0*7C0*7C637678566447486427*7CUnknown*7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0*3D*7C1000&sdata=XplH34U*2FbxjiotWOFwrclXTdSD8CGh3Z9wyYUHuBUhk*3D&reserved=0__;JSUlJSUlJSUlJSUlJSUlJSUlJSUl!!IBzWLUs!FYwmhSFfFgasWL7_0T1hFMIba3VnOHDybs4fGoQ0p_cP-uxfkS55MYckyWBmYB05QFVeRnsiyRhwsA$ ). Papers must be submitted in PDF format at the EasyChair submission site: https://urldefense.com/v3/__https://gcc02.safelinks.protection.outlook.com/?url=https*3A*2F*2Feasychair.org*2Fconferences*2F*3Fconf*3Dnfm2022&data=04*7C01*7Cfm-announcements*40lists.nasa.gov*7Cb2b5a7571d6d41d1373708d97d471022*7C7005d45845be48ae8140d43da96dd17b*7C0*7C0*7C637678566447486427*7CUnknown*7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0*3D*7C1000&sdata=lqAXRGauREQGXYis9lvTL9EfFXQtyw3k86O9QpfvBx8*3D&reserved=0__;JSUlJSUlJSUlJSUlJSUlJSUlJSU!!IBzWLUs!FYwmhSFfFgasWL7_0T1hFMIba3VnOHDybs4fGoQ0p_cP-uxfkS55MYckyWBmYB05QFVeRnsURTZ-Mg$ . Authors of selected best papers will be invited to submit an extended version to a special issue in Springer's Innovations in Systems and Software Engineering: A NASA Journal (https://urldefense.com/v3/__https://gcc02.safelinks.protection.outlook.com/?url=https*3A*2F*2Fwww.springer.com*2Fjournal*2F11334&data=04*7C01*7Cfm-announcements*40lists.nasa.gov*7Cb2b5a7571d6d41d1373708d97d471022*7C7005d45845be48ae8140d43da96dd17b*7C0*7C0*7C637678566447486427*7CUnknown*7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0*3D*7C1000&sdata=KWg6bOFbtOA0Y6LzpdjQJWR3XjWkbFzDq*2B4gxx54unM*3D&reserved=0__;JSUlJSUlJSUlJSUlJSUlJSUlJQ!!IBzWLUs!FYwmhSFfFgasWL7_0T1hFMIba3VnOHDybs4fGoQ0p_cP-uxfkS55MYckyWBmYB05QFVeRnvwZlLX7w$ ). ARTIFACTS Authors are encouraged, but not strictly required, to submit artifacts that support the conclusions of their work (if allowed by their institutions). Artifacts may contain software, mechanized proofs, benchmarks, examples, case studies and data sets. Artifacts will be evaluated by the Program Committee together with the paper. ORGANIZERS PC chairs - Klaus Havelund, JPL, USA - Jyo Deshmukh, USC, USA - Ivan Perez, NIA, USA Application Advisors - Robert Bocchino, JPL, USA - John Day, JPL, USA - Maged Elasaar, JPL, USA - Amalaye Oyake, Blue Origin, USA - Nicolas Rouquette, JPL, USA - Vandi Verma, JPL, USA Application advisors advise the PC chairs to ensure a strong connection to the problems facing NASA. Local Organizers - Richard Murray, Caltech, USA - Monica Nolasco, Caltech, USA Program Committee - Aaron Dutle, NASA, USA - Alessandro Cimatti, Fondazione Bruno Kessler, Italy - Anastasia Mavridou, SGT Inc. / NASA Ames Research Center, USA - Anne-Kathrin Schmuck, Max-Planck-Institute for Software Systems, Germany - Arie Gurfinkel, University of Waterloo, Canada - Bardh Hoxha, Toyota Research Institute North America, USA - Bernd Finkbeiner, CISPA Helmholtz Center for Information Security, Germany - Betty H.C. Cheng, Michigan State University, USA - Borzoo Bonakdarpour, Michigan State University, USA - Carolyn Talcott, SRI International, USA - Chuchu Fan, MIT, USA - Constance Heitmeyer, Naval Research Laboratory, USA - Corina Pasareanu, CMU, NASA, KBR, USA - Cristina Seceleanu, M?lardalen University, Sweden - Dejan Nickovic, Austrian Institute of Technology AIT, Austria - Dirk Beyer, LMU Munich, Germany - Doron Peled, Bar Ilan University, Israel - Erika Abraham, RWTH Aachen University, Germany - Ewen Denney, NASA, USA - Gerard Holzmann, Nimble Research, USA - Giles Reger, The University of Manchester, UK - Huafeng Yu, TOYOTA InfoTechnology Center USA, USA - Jean-Christophe Filliatre, CNRS, France - Johann Schumann, NASA, USA - John Day, Jet Propulsion Laboratory, USA - Julia Badger, NASA, USA - Julien Signoles, CEA LIST, France - Kerianne Hobbs, Air Force Research Laboratory, USA - Kristin Yvonne Rozier, Iowa State University, USA - Leonardo Mariani, University of Milano Bicocca, Italy - Lu Feng, University of Virginia, USA - Marcel Verhoef, European Space Agency, The Netherlands - Marie Farrell, Maynooth University, Ireland - Marieke Huisman, University of Twente, The Netherlands - Marielle Stoelinga, University of Twente, The Netherlands - Martin Feather, Jet Propulsion Laboratory, USA - Martin Leucker, University of Luebeck, Germany - Michael Lowry, NASA, USA - Misty Davies, NASA, USA - Natasha Neogi, NASA, USA - Nicolas Rouquette, Jet Propulsion Laboratory, USA - Nikos Arechiga, Toyota Research Institute, USA - Rajeev Joshi, Amazon Web Services, USA - Stanley Bak, Stony Brook University, USA - Sylvie Boldo, INRIA, France - Vandi Verma, NASA, USA - Willem Visser, Amazon Web Services, USA CONTACT Email: nfm2022 [at] easychair [dot] org LAST UPDATE 2021-09-20 -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- --- To opt-out from this mailing list, send an email to fm-announcements-request at lists.nasa.gov with the word 'unsubscribe' as subject or in the body. You can also make the request by contacting fm-announcements-owner at lists.nasa.gov From cong at c.titech.ac.jp Wed Sep 22 08:00:00 2021 From: cong at c.titech.ac.jp (Youyou Cong) Date: Wed, 22 Sep 2021 21:00:00 +0900 Subject: [TYPES/announce] PEPM 2022 - Second Call for Papers Message-ID: -- CALL FOR PAPERS -- ACM SIGPLAN Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM) 2022 =============================================================================== * Website : https://urldefense.com/v3/__https://popl22.sigplan.org/home/pepm-2022__;!!IBzWLUs!C7aOwMFnKEHVjjLpB79HbFINDLOsqBwtHSV5a9eoWKHbm-rwbD4OngVGRHExhcjA-sm3tgK_qx_W-Q$ * Time : 17th--18th January 2022 * Place : Online or Philadelphia, Pennsylvania, United States (co-located with POPL 2022) ** Deadline: 7th October ** ** Update: We are organizing a special event on the history of PEPM. Details will be posted on the workshop website. ** The ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) has a history going back to 1991 and has been co-located with POPL every year since 2006. It originated with the discoveries of useful automated techniques for evaluating programs with only partial input. Over the years, the scope of PEPM has expanded to include a variety of research areas centred around the theme of semantics-based program manipulation ? the systematic exploitation of treating programs not only as subjects to black-box execution but also as data structures that can be generated, analysed, and transformed while establishing or maintaining important semantic properties. Scope ----- In addition to the traditional PEPM topics (see below), PEPM 2022 welcomes submissions in new domains, in particular: * Semantics based and machine-learning based program synthesis and program optimisation. * Modelling, analysis, and transformation techniques for distributed and concurrent protocols and programs, such as session types, linear types, and contract specifications. More generally, topics of interest for PEPM 2022 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, embedded and resource-limited computation, and security. This list of categories is not exhaustive, and we encourage submissions describing new theories and applications related to semantics-based program manipulation in general. If you have a question as to whether a potential submission is within the scope of the workshop, please contact the programme co-chairs, Zena M. Ariola and Youyou Cong . Submission categories and guidelines ------------------------------------ Two kinds of submissions will be accepted: * Regular Research Papers should describe new results, and will be judged on originality, correctness, significance, and clarity. Regular research papers must not exceed 12 pages. * Short Papers may include tool demonstrations and presentations of exciting if not fully polished research, and of interesting academic, industrial, and open-source applications that are new or unfamiliar. Short papers must not exceed 6 pages. References and appendices are not included in page limits. Appendices may not be read by reviewers. Both kinds of submissions should be typeset using the two-column ?sigplan? sub-format of the new ?acmart? format available at: https://urldefense.com/v3/__http://sigplan.org/Resources/Author/__;!!IBzWLUs!C7aOwMFnKEHVjjLpB79HbFINDLOsqBwtHSV5a9eoWKHbm-rwbD4OngVGRHExhcjA-sm3tgLWGjGOhQ$ and submitted electronically via HotCRP: https://urldefense.com/v3/__https://pepm22.hotcrp.com/__;!!IBzWLUs!C7aOwMFnKEHVjjLpB79HbFINDLOsqBwtHSV5a9eoWKHbm-rwbD4OngVGRHExhcjA-sm3tgKI3Qe_sQ$ Reviewing will be single-blind. Submissions are welcome from PC members (except the two co-chairs). Accepted regular research papers will appear in formal proceedings published by ACM, and be included in the ACM Digital Library. Accepted short papers do not constitute formal publications and will not appear in the proceedings. At least one author of each accepted contribution must attend the workshop (physically or virtually) and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Important dates --------------- * Paper submission deadline : **Thursday 7th October 2021 (AoE)** * Author notification : **Thursday 11th November 2021 (AoE)** * Workshop : **Monday 17th January 2022 to Tuesday 18th January 2022** Best paper award ---------------- PEPM 2022 continues the tradition of a Best Paper award. The winner will be announced at the workshop. Programme committee ------------------- * Chairs: Zena M. Ariola (University of Oregon, US) Youyou Cong (Tokyo Institute of Technology, Japan) * Maria Alpuente (U.P. Valencia, Spain) * William J. Bowman (UBC, Canada) * Jonathan Immanuel Brachth?user (EPFL, Switzerland) * William E. Byrd (University of Alabama at Birmingham, US) * Robert Gl?ck (University of Copenhagen, Denmark) * Zhenjiang Hu (Peking University, China) * Yukiyoshi Kameyama (University of Tsukuba, Japan) * Gabriele Keller (Utrecht University, Netherlands) * Julia Lawall (INRIA, France) * Y. Annie Liu (Stony Brook University, US) * Keiko Nakata (SAP Innovation Center Potsdam, Germany) * Antonina Nepeivoda (Program Systems Institute of RAS, Russia) * Zoe Paraskevopoulou (Northeastern University, US) * Yann R?gis-Gianas (Nomadic Labs, France) * Tiark Rompf (Purdue University, US) * KC Sivaramakrishnan (IIT Madras, India) * Dimitrios Vytiniotis (DeepMind, UK) * Beta Ziliani (FAMAF, UNC and Manas.Tech, Argentina) -------------- next part -------------- An HTML attachment was scrubbed... URL: From james.cheney at gmail.com Wed Sep 22 10:47:33 2021 From: james.cheney at gmail.com (James Cheney) Date: Wed, 22 Sep 2021 15:47:33 +0100 Subject: [TYPES/announce] Second Call for Papers: 24th International Symposium on Practical Aspects of Declarative Languages (PADL 2022) Message-ID: === Second Call for Papers === 24th International Symposium on Practical Aspects of Declarative Languages (PADL 2022) Philadelphia, Pennsylvania, United States 17-18th January 2022 https://urldefense.com/v3/__https://popl22.sigplan.org/home/PADL-2022__;!!IBzWLUs!CUJkoXwB8YNFMYqTMfQi2nh4iTf9ciyiOgXisWIQad8MjfyaW32SNxVOhvcN_r4yW7xtDKwwFepPaQ$ Co-located with POPL 2022 Conference Description ---------------------- Declarative languages comprise several well-established classes of formalisms, namely, functional, logic, and constraint programming. Such formalisms enjoy both sound theoretical bases and the availability of attractive frameworks for application development. Indeed, they have been already successfully applied to many different real-world situations, ranging from database management to active networks to software engineering to decision support systems. New developments in theory and implementation fostered applications in new areas. At the same time, applications of declarative languages to novel and challenging problems raise many interesting research issues, including designing for scalability, language extensions for application deployment, and programming environments. Thus, applications drive the progress in the theory and implementation of declarative systems, and benefit from this progress as well. PADL is a well-established forum for researchers and practitioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative programming, including functional and logic programming, database and constraint programming, and theorem proving. Topic of interest include, but are not limited to: - Innovative applications of declarative languages - Declarative domain-specific languages and applications - Practical applications of theoretical results - New language developments and their impact on applications - Declarative languages and software engineering - Evaluation of implementation techniques on practical applications - Practical experiences and industrial applications - Novel uses of declarative languages in the classroom - Practical extensions such as constraint-based, probabilistic, and reactive languages PADL 2022 especially welcomes new ideas and approaches related to applications, design and implementation of declarative languages going beyond the scope of the past PADL symposia, for example, advanced database languages and contract languages, as well as verification and theorem proving methods that rely on declarative languages. Submissions ----------- PADL 2022 welcomes three kinds of submission: * Technical papers (max. 15 pages) Technical papers must describe original, previously unpublished research results. * Application papers (max. 8 pages) Application papers are a mechanism to present important practical applications of declarative languages that occur in industry or in areas of research other than Computer Science. Application papers are expected to describe complex and/or real-world applications that rely on an innovative use of declarative languages. Application descriptions, engineering solutions and real-world experiences (both positive and negative) are solicited. * Extended abstracts (max. 3 pages) Describing new ideas, a new perspective on already published work, or work-in-progress that is not yet ready for a full publication. Extended abstracts will be posted on the symposium website but will not be published in the formal proceedings. All page limits exclude references. Submissions must be formatted according to the standard Springer LNCS style. The conference proceedings of PADL2022 will be published by Springer-Verlag in the Lecture Notes in Computer Science series. Work that already appeared in unpublished or informally published workshops proceedings may be submitted but the authors should notify the program chairs about the place in which it has previously appeared. PADL 2022 submissions are handled through the EasyChair conference management system: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=padl2022__;!!IBzWLUs!CUJkoXwB8YNFMYqTMfQi2nh4iTf9ciyiOgXisWIQad8MjfyaW32SNxVOhvcN_r4yW7xtDKykQVrbHQ$ . Important dates (tentative) --------------- Abstract submission: 1 October 2021 (AoE) Paper submission: 8 October 2021 Notification of acceptance: 5 November 2021 Symposium: 17-18th January 2022 COVID-19 -------- PADL is co-located with POPL, which will take place January 16-22, 2022, as a physical, virtual, or hybrid physical/virtual meeting. We will be monitoring the Covid-19 situation and will announce a decision on the nature of the meeting in time which will follow suit with POPL. Distinguished Papers -------------------- The authors of a small number of distinguished papers will be invited to submit a longer version for journal publication after the symposium. For papers related to logic programming, in the journal Theory and Practice of Logic Programming (TPLP) https://urldefense.com/v3/__https://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming__;!!IBzWLUs!CUJkoXwB8YNFMYqTMfQi2nh4iTf9ciyiOgXisWIQad8MjfyaW32SNxVOhvcN_r4yW7xtDKxs8GspBg$ , and for papers related to functional programming, in Journal of Functional Programming (JFP) https://urldefense.com/v3/__https://www.cambridge.org/core/journals/journal-of-functional-programming__;!!IBzWLUs!CUJkoXwB8YNFMYqTMfQi2nh4iTf9ciyiOgXisWIQad8MjfyaW32SNxVOhvcN_r4yW7xtDKyvrUjIFA$ . The extended journal submissions should include roughly 30% more content including, for example, explanations for which there was no space, illuminating examples and proofs, additional definitions and theorems, further experimental results, implementational details and feedback from practical/engineering use, extended discussion of related work and such like. Invited Speakers ---------------- PADL 2022 features two invited talks by: - Marcello Balduccini (https://urldefense.com/v3/__https://www.sju.edu/faculty/marcello-balduccini/__;!!IBzWLUs!CUJkoXwB8YNFMYqTMfQi2nh4iTf9ciyiOgXisWIQad8MjfyaW32SNxVOhvcN_r4yW7xtDKwwcoNDhg$ ) - Shriram Krishnamurthi (https://urldefense.com/v3/__https://cs.brown.edu/*sk/__;fg!!IBzWLUs!CUJkoXwB8YNFMYqTMfQi2nh4iTf9ciyiOgXisWIQad8MjfyaW32SNxVOhvcN_r4yW7xtDKzL3u-GDA$ ) Chairs ------ - James Cheney, University of Edinburgh - Simona Perri, University of Calabria Programme Committee ------------------- Andres L?h, WellTyped Chiaki Sakama, Wakayama University Daniela Inclezan, Miami University Ekaterina Komendantskaya, Heriot-Watt University Esra Erdem, Sabanci University Francesco Calimeri, University of Calabria Jan Christiansen, Flensburg University of Applied Sciences Konstantin Schekotihin, University of Klagenfurt Lionel Parreaux, Hong Kong University of Science and Technology Marco Maratea, University of Genova Marina De Vos, University of Bath Martin Erwig, Oregon State University Martin Gebser, University of Klagenfurt Michael Greenberg, Stevens Institute of Technology Paul Tarau, University of North Texas Pavan Kumar Chittimalli, TCS Research, India Pedro Cabalar, University of Corunna Roly Perera, The Alan Turing Institute Tomas Petricek, University of Kent Torsten Grust, University of T?bingen Tran Cao Son, New Mexico State University Yukiyoshi Kameyama, University of Tsukuba -------------- next part -------------- An HTML attachment was scrubbed... URL: From andersmortberg at gmail.com Fri Sep 24 07:19:44 2021 From: andersmortberg at gmail.com (Anders Mortberg) Date: Fri, 24 Sep 2021 13:19:44 +0200 Subject: [TYPES/announce] Reminder: 2 year position on HoTT and related topics in Stockholm, deadline Friday next week Message-ID: Dear all, A quick reminder of the postdoctoral position in HoTT and related topics that I advertised a couple of weeks ago, with deadline *October 1* (midnight Stockholm time). Full details and application at: https://urldefense.com/v3/__https://www.su.se/english/about-the-university/work-at-su/available-jobs?rmpage=job&rmjob=15797&rmlang=UK__;!!IBzWLUs!DtuZsNTodN62rcs7_yEB1aKIn1Xx8dTk9UiLbqd1uYMpxjvbcYqcbVS_QBUW8oYrJdHrxn_2FSOquA$ Departmental webpage: https://urldefense.com/v3/__https://www.math.su.se/english/research__;!!IBzWLUs!DtuZsNTodN62rcs7_yEB1aKIn1Xx8dTk9UiLbqd1uYMpxjvbcYqcbVS_QBUW8oYrJdHrxn-xPny4KA$ Once again, please get in touch with me if you have any questions about the position or application process! Best, Anders On Mon, Sep 6, 2021 at 1:43 PM Anders Mortberg wrote: > Dear all, > > I?m pleased to announce that we?re hiring a postdoctoral researcher in > homotopy type theory and related topics at Stockholm University. It?s a 2 > year position, provisionally starting January 2022, in the computational > mathematics group of the Mathematics Department. The application deadline > is 1 October. > > We welcome all applicants interested in working on homotopy type theory > and related topics. Potential project topics include, but are not limited > to: homotopy type theory, categorical models of type theories, cubical type > theories, implementation of proof assistants, computer formalization of > mathematics and computer science. > > Full details and application at: > https://urldefense.com/v3/__https://www.su.se/english/about-the-university/work-at-su/available-jobs?rmpage=job&rmjob=15797&rmlang=UK__;!!IBzWLUs!DtuZsNTodN62rcs7_yEB1aKIn1Xx8dTk9UiLbqd1uYMpxjvbcYqcbVS_QBUW8oYrJdHrxn_2FSOquA$ > > Departmental webpage: https://urldefense.com/v3/__https://www.math.su.se/english/research__;!!IBzWLUs!DtuZsNTodN62rcs7_yEB1aKIn1Xx8dTk9UiLbqd1uYMpxjvbcYqcbVS_QBUW8oYrJdHrxn-xPny4KA$ > > Please get in touch with me if you have any questions about the position! > > Best, > Anders > > -------------- next part -------------- An HTML attachment was scrubbed... URL: From dom.orchard at gmail.com Fri Sep 24 15:04:19 2021 From: dom.orchard at gmail.com (Dominic Orchard) Date: Fri, 24 Sep 2021 20:04:19 +0100 Subject: [TYPES/announce] Two Lecturer (Assistant Professor) Positions at the University of Kent Message-ID: We are seeking to appoint two Lecturers in Computing at our Canterbury campus, University of Kent. Job description / Additional Information / Please apply at https://urldefense.com/v3/__https://jobs.kent.ac.uk/vacancy.aspx?ref=CEMS-034-21-R-R__;!!IBzWLUs!Bl5AIC9R-hhni_f1DB5h-zyuSbgci14G6muA6_cSvBQSG8JusDjO06V8N4gQSIIo1n27m_z69XE7YQ$ Closing date for applications: 21 October 2021 We invite applications from candidates with research interests that can complement or enhance the School?s existing research strengths. This spans a broad range of computer science and is organized into 4 large and active research groups: - Programming Languages and Systems - Cyber security - Computational intelligence - Data Science The School of Computing [1] is a welcoming, supportive, and diverse environment whose commitment to gender equality has been recognised with a Bronze Athena SWAN [2] award. We are keen to enhance the balanced, inclusive and diverse nature of the community within our School and would particularly encourage female candidates to apply for these posts. We are committed to delivering high quality research and education. The School?s four broad research areas are Programming Languages and Systems (PLAS); Computer Security; Computational Intelligence; and Data Science. Full details can be found at: https://urldefense.com/v3/__https://www.kent.ac.uk/computing/research__;!!IBzWLUs!Bl5AIC9R-hhni_f1DB5h-zyuSbgci14G6muA6_cSvBQSG8JusDjO06V8N4gQSIIo1n27m_xx0tSLxg$ and for the PLAS group in particular here: https://urldefense.com/v3/__https://research.kent.ac.uk/programming-languages-systems/__;!!IBzWLUs!Bl5AIC9R-hhni_f1DB5h-zyuSbgci14G6muA6_cSvBQSG8JusDjO06V8N4gQSIIo1n27m_yIhQu9fw$ The School of Computing is based in Canterbury, and the University of Kent has specialist postgraduate centres in Brussels and Paris. Overlooking the city centre, and with 125 nationalities represented, the Canterbury campus has a very cosmopolitan feel. Canterbury is a small city that retains parts of its medieval walls (with Roman foundations). Famous for its heritage (Canterbury Cathedral; Chaucer?s Tales; etc), Canterbury is a vibrant community and UNESCO World Heritage site whose culture and leisure facilities are enhanced by hosting three universities. The city and surrounding region combines an attractive and affordable environment, excellent schools, and fast transport links to London and mainland Europe. Links: [1] https://urldefense.com/v3/__https://cs.kent.ac.uk/__;!!IBzWLUs!Bl5AIC9R-hhni_f1DB5h-zyuSbgci14G6muA6_cSvBQSG8JusDjO06V8N4gQSIIo1n27m_ydSUnLcg$ [2] https://urldefense.com/v3/__http://www.ecu.ac.uk/equality-charters/athena-swan/__;!!IBzWLUs!Bl5AIC9R-hhni_f1DB5h-zyuSbgci14G6muA6_cSvBQSG8JusDjO06V8N4gQSIIo1n27m_wP3LTjVQ$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From breandan.considine at gmail.com Fri Sep 24 16:52:15 2021 From: breandan.considine at gmail.com (Breandan Considine) Date: Fri, 24 Sep 2021 16:52:15 -0400 Subject: [TYPES/announce] AIPLANS Workshop at NeurIPS 2021 (Advances in Programming Languages and Neurosymbolic Systems) Message-ID: Dear Colleagues, Greetings! We are pleased to announce the first annual AIPLANS workshop, to be held this December 14th at NeurIPS 2021. AIPLANS will feature exciting new research on the frontiers of programming language theory, mechanized reasoning, and neural-symbolic learning. For illustrative purposes, we welcome submissions related to one the following areas: Mechanized reasoning - Induction of formal languages (e.g., grammar inference, automata extraction) - Programing language theory (e.g., type theory, category theory, denotational semantics) - Satisfiability checking and symbolic computation (e.g. SAT/SMT solving, Boolean circuits) - Logic and equational reasoning (e.g., ?-calculus, ?-calculus, tensor and combinator calculi) Machine learning - Neural program synthesis (e.g., search-based, syntax or execution-guided) - Bayesian program learning (e.g., higher-order probabilistic programming) - Neural-symbolic reasoning (e.g., automated program verification and testing) - Neural program extraction (e.g., procedural or relational knowledge distillation) - Inference algorithms (e.g., backpropagation, belief propagation, survey propagation et al.) Programming language implementation - Natural language programming (e.g., machine teaching, programming by example) - Declarative programming (e.g., tabled LP, ILP, constraint programming et al.) - New programming languages for reasoning (e.g., LF/Twelf, HOL, miniKanren, L??N, et al.) - New programming languages for learning (e.g., Dex, Hasktorch, Torch-Struct, et al.) If you or someone you may know is working on one of these topics, we would be very glad to have your/their participation! Our call for papers will close Oct. 4th, 2021 AoE. AIPLANS is non-archival and allows dual submission where permitted by a third-party. Further details may be found at the following URL: https://urldefense.com/v3/__https://aiplans.github.io/callforpapers/__;!!IBzWLUs!DjxJPonv114vMQC_NU49JrRlMsAKdv-Np-T8xHsLmqJZ1XovksYX7lZY5qtz8gybapOQNkZbZAWqVA$ AIPLANS is also seeking qualified reviewers working in these or related areas. If you would be interested in helping review workshop submissions, please consider filling out and submitting this form and one of the organizers will be in touch with you shortly: https://urldefense.com/v3/__https://forms.gle/FMtc4AfaMWeo8YFp8__;!!IBzWLUs!DjxJPonv114vMQC_NU49JrRlMsAKdv-Np-T8xHsLmqJZ1XovksYX7lZY5qtz8gybapOQNkaprsELYw$ Should you have any inquiries or suggestions, please do not hesitate to reach out to us officially at aiplans2021 at gmail.com or contact one of the organizers and we would be eager to assist. Thank you for your consideration. On behalf of all of us at AIPLANS, we are excited to hear about your research and look forward to your participation! Best regards, Breandan Considine On behalf of the AIPLANS organizers: Disha Shrivastava, David Yu-Tung Hui, Chin-Wei Huang and Shawn Tan -------------- next part -------------- An HTML attachment was scrubbed... URL: From tarmo at cs.ioc.ee Fri Sep 24 20:56:54 2021 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Sat, 25 Sep 2021 03:56:54 +0300 Subject: [TYPES/announce] ETAPS 2022 2nd joint call for papers Message-ID: <20210925035654.15bb6536@cs.ioc.ee> Why choose ETAPS? - ETAPS is one of the world's leading fora for research on software science, with a history of more than 25 years. - The proceedings of ETAPS appear in gold open access, with no article processing charge for the authors specifically. - ETAPS has low participation fees for all and for students in particular. New in 2022: - Like FASE for several years already, ESOP will also use double-blind review this time. - FASE has a new paper category of new ideas and emerging results (NIER) papers. - The pre-paper-acceptance artifact submission deadline for TACAS is now a little later than the paper submission deadline. - ESOP and FASE welcome voluntary submission of artifacts for evaluation after paper acceptance; the outcome will not change the paper acceptance decision. - Among the satellite events, there is a PhD student mentoring workshop. ****************************************************************** JOINT CALL FOR PAPERS 25th European Joint Conferences on Theory and Practice of Software ETAPS 2022 Munich, Germany, 2-7 April 2022 https://urldefense.com/v3/__https://etaps.org/2022__;!!IBzWLUs!GmsL5mqqmDOPfpJPfPmJVN2zUxasq5MzDlbgmJGqD9umfN3lWmyTk_c-eK3_p7WST7lCwpkdyy4v0Q$ ****************************************************************** -- ABOUT ETAPS -- ETAPS is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of four annual conferences, accompanied by satellite workshops. ETAPS 2022 is the twenty-fifth event in the series. -- MAIN CONFERENCES (4-7 April) -- * ESOP: European Symposium on Programming (PC chair: Ilya Sergey, Yale-NUS College and National University of Singapore, Singapore) * FASE: Fundamental Approaches to Software Engineering (PC chairs:Einar Broch Johnsen, University of Oslo, Norway, and Manuel Wimmer, Johannes Kepler Universit?t Linz, Austria) * FoSSaCS: Foundations of Software Science and Computation Structures (PC chairs: Patricia Bouyer, CNRS, LMF, France, and Lutz Schr?der, FAU Erlangen-N?rnberg, Germany) * TACAS: Tools and Algorithms for the Construction and Analysis of Systems (PC chairs: Dana Fisman, Ben-Gurion University of the Negev, Israel, and Grigore Rosu, University of Illinois at Urbana-Champaign, USA) TACAS '22 will host the 11th Competition on Software Verification (SV-COMP). -- INVITED SPEAKERS -- * Unifying speakers: Alexandra Silva (University College London, UK / Cornell University, USA) Tom?? Vojnar (Brno University of Technology, Czechia) * FoSSaCS invited speaker: Nathalie Bertrand (Inria Rennes, France) * TACAS invited speaker: Lenore Zuck (University of Illinois at Chicago, USA) * Tutorial speakers: Stacey Jeffery (CWI and QuSoft, The Netherlands) a further tutorial speaker tba -- IMPORTANT DATES * Paper submission (also, pre-paper-acceptance artifact registration (TACAS)): 14 October 2021 23:59 AoE * Pre-paper-acceptance artifact submission (TACAS): 4 November 2021 23:59 AoE * Rebuttal (ESOP, FoSSaCS and, partially, TACAS): 7 December 00:01 AoE - 9 December 2021 23:59 AoE * Paper notification: 23 December 2021 * Post-paper-acceptance artifact submission (ESOP, FASE, TACAS): 5 January 2022 23:59 AoE * Paper final versions: 26 January 2022 * Artifact notification: 16 February 2022 -- SUBMISSION INSTRUCTIONS -- The four main conferences of ETAPS 2022 solicit contributions of the following types. All page limits are given **excluding the bibliography**. * ESOP: regular research papers of max 25 pp * FASE: regular research papers and empirical evaluation papers of max 18 pp, new ideas and emerging results (NIER) papers of max 8 pp, tool demonstration papers of max 6 pp (+ mandatory appendix of max 6 pp), * FoSSaCS: regular research papers of max 18 pp * TACAS: regular research papers, case study papers and regular tool papers of max 16 pp, tool demonstration papers of max 6 pp For definitions of the different paper types and specific instructions, where they are present, see the webpages of the individual conferences. All accepted papers will appear in the proceedings and have presentations during the conference. A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. We plan ETAPS 2022 as a hybrid conference; remote attendance and presentation will be possible. Submitted papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere. In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is also forbidden. Submissions must follow the formatting guidelines of Springer's LNCS (use the llncs.cls class) and be submitted electronically in pdf through the Easychair author interface of the respective conference. Submissions not adhering to the specified format and length may be rejected immediately. ESOP and FASE will use **double-blind reviewing**. Authors are asked to omit their names and institutions; refer to prior work in the third person, just as prior work by others; not to include acknowledgements that might identify them. ESOP and FoSSaCS will use an **author rebuttal phase**. TACAS will use rebuttal for selected submissions (those in the gray zone). Artifact submission and evaluation Regular tool paper and tool demonstration paper submissions to TACAS must be accompanied by an artifact submitted shortly after the paper. The artifact will be evaluated and the outcome will be taken into account in the acceptance decision of the paper. For research paper and case study paper submissions, pre-paper-acceptance submission of an artifact is optional; if an artifact is submitted at this point, it will be handled like described above. Alternatively, authors of papers of these categories may submit an artifact for evaluation after the paper has been accepted. The outcome of the artifact evaluation will then not change the paper acceptance decision. ESOP and FASE will also have artifact evaluation, but participation in it is voluntary; the artifact submission deadline is after the paper notification deadline. The outcome will not alter the paper acceptance decision. For specific instructions regarding artifacts, see the webpages of the individual conferences. -- PUBLICATION The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of Springer's LNCS series. The proceedings volumes will appear in gold open access, so the published versions of all papers will be available for everyone to download from the publisher's website freely, from the date of online publication, perpetually. The copyright of the papers will remain with the authors. -- BEST PAPER AWARDS The strongest papers of the four conferences will be nominated for the ETAPS best paper awards of EAPLS, EASST and EATCS. The ETAPS test of time award recognizes outstanding papers published at ETAPS more than 10 years in the past. -- SATELLITE EVENTS (2-3 April) -- A number of satellite workshops and other events will take place before the main conferences: CMCS, COOP, HCVS, LiVe, MARS, MSFP, PLACES, QAVS, RRRR, Rust Workshop, SynCop, VerifyThis, VPT, WRLA Also in the satellite events program is a Mentoring Workshop. For closer information, check https://urldefense.com/v3/__https://etaps.org/2022/workshops__;!!IBzWLUs!GmsL5mqqmDOPfpJPfPmJVN2zUxasq5MzDlbgmJGqD9umfN3lWmyTk_c-eK3_p7WST7lCwplteFazwg$ . -- CITY AND HOST INSTITUTION -- Munich, Germany, is the capital and most populous city of Bavaria. Nowadays, the city is a global center of art, science, technology, finance, publishing, culture, innovation, education, business, and tourism. It is home to Ludwig Maximilian's University (LMU) and Technische Universit?t M?nchen (TUM), many scientific institutions, and world-class technology and science museums such as Deutsches Museum and BMW Museum. Iconic places to visit in Munich include the Munich Residenz, Marienplatz, the Old Town Hall, the famous Glockenspiel on the New Town Hall, the Frauenkirche, the English Garden, the Olympic Park and Nymphenburg Palace. The conference will be hosted by Technische Universit?t M?nchen. -- ORGANIZERS -- General chair: Jan K?et?nsk? (Technische Universit?t M?nchen, Germany) Workshops chair: Dirk Beyer (Ludwig-Maximilians Universit?t M?nchen, Germany) From tarmo at cs.ioc.ee Sun Sep 26 16:51:19 2021 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Sun, 26 Sep 2021 23:51:19 +0300 Subject: [TYPES/announce] NWPT 2021 call for contributions - deadline 10 October Message-ID: <20210926235119.5a4b8296@cs.ioc.ee> NWPT is a series of annual regional-scope workshops on programming theory, targeted especially at younger researchers. In 2020, the workshop had been scheduled to take place in Reykjavik, Iceland, but had to be cancelled (postponed) because of the pandemic. As the epidemiological situation in Iceland is currently relatively good, NWPT 2021 is now going ahead at short notice as a hybrid meeting, the circumstances permitting. We hope this will be a nice opportunity especially for our PhD students and postdocs to attend a real physical workshop and present their work and to meet their colleagues from elsewhere in the Nordic countries - after a break of 1.5 years. --- 32nd Nordic Workshop on Programming Theory, NWPT '21 Reykjavik, Iceland and online, 4-6 November 2021 ---------------------------------------------------------------------- Important dates Submission of abstracts 10 October Notification 17 October ---------------------------------------------------------------------- About NWPT The NWPT series of annual workshops is a forum bringing together programming theorists from the Nordic and Baltic countries, but also from elsewhere. Topics of interest include (but are not limited to) - semantics of programming languages, - programming language design and programming methodology, - programming logics, - formal specification of programs, - program verification, - program construction, - tools for program verification and construction, - program transformation and refinement, - real-time and hybrid systems, - models of concurrency and distributed computing, - model-based testing, - language-based security. Contributed talks Authors wishing to give a talk at the workshop are requested to submit abstracts of 2-3 pages (pdf, printable on A4 paper, typeset with LaTeX with easychair.cls) through EasyChair (https://urldefense.com/v3/__https://easychair.org/conferences/?conf=nwpt2021__;!!IBzWLUs!CCsFzUAOG9muZEhPCn_-T4nulo_qdlW9weyvoJvmwyDp8qmCG4AsEUPCFde4FV42xQY18mluJ2YMyg$ ) by 10 October. Work in progress as well as abstracts of manuscripts submitted for formal publication elsewhere are permitted. The abstracts of the accepted contributions will be available electronically before the workshop. By submitting to EasyChair you agree that your abstract will be publicly available. Moreover, you as an author are responsible for the content. Social program We are planning a trip/hike to the currently active Geldingadalir volcano. https://urldefense.com/v3/__https://www.visitreykjanes.is/en/volcano-eruption/eruption-information__;!!IBzWLUs!CCsFzUAOG9muZEhPCn_-T4nulo_qdlW9weyvoJvmwyDp8qmCG4AsEUPCFde4FV42xQY18mkRWSMabA$ Organizers Antonis Achilleos, Elli Anastasiadi, Dylan McDermott, Tarmo Uustalu Travel to Iceland This may change, but at the moment anyone fully vaccinated or recovered from Covid can enter the country without any restriction of movement after arrival, but needs to present a negative result from a PCR or rapid antigen test taken before departure (not older than 72 hours). https://urldefense.com/v3/__https://www.covid.is/english__;!!IBzWLUs!CCsFzUAOG9muZEhPCn_-T4nulo_qdlW9weyvoJvmwyDp8qmCG4AsEUPCFde4FV42xQY18mm2IgTWfw$ https://urldefense.com/v3/__https://island.is/en/p/entry__;!!IBzWLUs!CCsFzUAOG9muZEhPCn_-T4nulo_qdlW9weyvoJvmwyDp8qmCG4AsEUPCFde4FV42xQY18mmicbZmsQ$ Further information More details will appear at this url: https://urldefense.com/v3/__http://icetcs.ru.is/nwpt21/__;!!IBzWLUs!CCsFzUAOG9muZEhPCn_-T4nulo_qdlW9weyvoJvmwyDp8qmCG4AsEUPCFde4FV42xQY18mms-Fz2Cg$ From martin.avanzini at inria.fr Mon Sep 27 07:00:54 2021 From: martin.avanzini at inria.fr (Martin Avanzini) Date: Mon, 27 Sep 2021 13:00:54 +0200 Subject: [TYPES/announce] Post-Doc position at INRIA on semantics and verification of probabilistic programs Message-ID: <50a37e74-8aa7-ac2f-21e7-e6a2e559d5c1@inria.fr> The ANR Research Project PPS (Probabilistic Programming Semantics, ANR-19-CE48-0014) offers one 12 month postdoc position starting at the beginning of the 2022 solar year, at INRIA Sophia Antipolis: https://urldefense.com/v3/__https://www.inria.fr/en/centre-inria-sophia-antipolis-mediterranee__;!!IBzWLUs!CFfoJxiQN-mBYD9r0KyrFuURJ--mYnmJdzr_b98660WGXGWtA56juZ1qQAuGk-Sw_lqbPYM80syyDA$ Our goal is to develop the semantics (e.g. coherent semantics, rewriting) and verification tools (e.g. type systems, logical frameworks) for probabilistic higher-order languages, building on the many connections between proof theory, linear algebra, rewriting, and programming language theory. Acquaintance with probabilistic programming languages, their mathematical semantics and/or their implementation, is welcome but not mandatory, although we expect the applicant to be excited to work on these topics. Anyone interested should contact as soon as possible Martin Avanzini (martin.avanzini at i nria.fr ) and Ugo Dal Lago (ugo.dallago at unibo.it) briefly outlining their academic background and research interests. More details about the project are available here: https://urldefense.com/v3/__https://www.irif.fr/anrpps__;!!IBzWLUs!CFfoJxiQN-mBYD9r0KyrFuURJ--mYnmJdzr_b98660WGXGWtA56juZ1qQAuGk-Sw_lqbPYNXvtmbug$ As a second step, a complete application consisting of + a cover letter; + a detailed CV including a list of publications and a summary of research; + contact information for two or three academic references; is expected to be sent by email to Martin Avanzini and Ugo Dal Lago The review of applications will begin on October 15th and continue until the position is filled. -------------- next part -------------- An HTML attachment was scrubbed... URL: From P.Achten at cs.ru.nl Mon Sep 27 08:02:54 2021 From: P.Achten at cs.ru.nl (Peter Achten) Date: Mon, 27 Sep 2021 14:02:54 +0200 Subject: [TYPES/announce] [TFP'22] first call for papers: Trends in Functional Programming 2022, 10-11 February (with Lambda Days 2022 & TFPIE 2022) Message-ID: <1c43365a-f195-f7b6-fc4d-a280ab44a205@cs.ru.nl> ====== TFP 2022 ====== 23rd Symposium on Trends in Functional Programming 10-11 February, 2022 Krakow, Poland https://urldefense.com/v3/__https://trendsfp.github.io/index.html__;!!IBzWLUs!Av6Kx-i9p67Z3MceH7OIvMrgsMa1KCTDhopAM7-7MVz4_mgc71FgvVg6Igfhxm7Lg8DZqxGVeAHrvg$ == Important Dates == Submission deadline for pre-symposium review??????????? Wednesday 1st December, 2021 Submission deadline for draft papers??????????????????? Wednesday 12th January, 2022 Notification for pre-symposium submissions????????????? Friday 21st January, 2022 Notification for draft submissions????????????????????? Friday 21st January, 2022 Symposium dates???????????????????????????????????????? Thursday 10th - Friday 11th February, 2022 Submission deadline for post-symposium reviewing??????? Wednesday 16th March, 2022 Notification for post-symposium submissions???????????? Friday 13rd May, 2022 The Symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions. Please be aware that TFP uses two distinct rounds of submissions. TFP 2022 will be co-located with two other functional programming events. TFP 2022 will be accompanied by the International Workshop on Trends in Functional Programming in Education (TFPIE), which will take place on February 11. Simultaneously with TFP, Lambda Days '22 is a two day conference where academia meets industry, where research and practical application collide. == Scope == The symposium recognizes that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: * Research Articles: ? Leading-edge, previously unpublished research work * Position Articles: ?On what new trends should or should not be * Project Articles: ? Descriptions of recently started new projects * Evaluation Articles: ? What lessons can be drawn from a finished project * Overview Articles: ? Summarizing work with respect to a trendy subject Articles must be original and not simultaneously submitted for publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or experience-oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Topics suitable for the symposium include, but are not limited to: * Functional programming and multicore/manycore computing * Functional programming in the cloud * High performance functional computing * Extra-functional (behavioural) properties of functional programs * Dependently typed functional programming * Validation and verification of functional programs * Debugging and profiling for functional languages * Functional programming in different application areas: ? security, mobility, telecommunications applications, embedded ? systems, global computing, grids, etc. * Interoperability with imperative programming languages * Novel memory management techniques * Program analysis and transformation techniques * Empirical performance studies * Abstract/virtual machines and compilers for functional languages * (Embedded) domain specific languages * New implementation strategies * Any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2022 program chairs, Wouter Swierstra and Nicolas Wu. == Best Paper Awards == To reward excellent contributions, TFP awards a prize for the best paper accepted for the formal proceedings. TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year. In both cases, it is the PC of TFP that awards the prize. In case the best paper happens to be a student paper, that paper will then receive both prizes. == Instructions to Author == Papers must be submitted at: ? https://urldefense.com/v3/__https://easychair.org/conferences/?conf=tfp22__;!!IBzWLUs!Av6Kx-i9p67Z3MceH7OIvMrgsMa1KCTDhopAM7-7MVz4_mgc71FgvVg6Igfhxm7Lg8DZqxFTjFJJYw$ Authors of papers have the choice of having their contributions formally reviewed either before or after the Symposium. == Pre-symposium formal review == Papers to be formally reviewed before the symposium should be submitted before an early deadline and receive their reviews and notification of acceptance for both presentation and publication before the symposium. A paper that has been rejected in this process may still be accepted for presentation at the symposium, but will not be considered for the post-symposium formal review. == Post-symposium formal review == Draft papers will receive minimal reviews and notification of acceptance for presentation at the symposium. Authors of draft papers will be invited to submit revised papers based on the feedback received at the symposium. A post-symposium refereeing process will then select a subset of these articles for formal publication. == Paper categories == Draft papers and papers submitted for formal review are submitted as extended abstracts (4 to 10 pages in length) or full papers (20 pages). The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate which authors are research students, and whether the main author(s) are students. A draft paper for which all authors are students will receive additional feedback by one of the PC members shortly after the symposium has taken place. == Format == Papers must be written in English, and written using the LNCS style. For more information about formatting please consult the Springer LNCS web site. == Program Committee == Program Co-chairs Nicolas Wu - Imperial College London Wouter Swierstra - Utrecht University The remainder of the PC will be announced on the conference website. From maaike.annebeth at gmail.com Mon Sep 27 08:08:49 2021 From: maaike.annebeth at gmail.com (Maaike Zwart) Date: Mon, 27 Sep 2021 14:08:49 +0200 Subject: [TYPES/announce] SYCO 8 - Call for Papers Message-ID: -------------------------------------------------------------- CALL FOR PAPERS EIGHTH SYMPOSIUM ON COMPOSITIONAL STRUCTURES (SYCO 8) Tallinn University of Technology, Estonia 13-14 December 2021 https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/8/__;!!IBzWLUs!HphgkclMgwZkryyQdsX4Kv9qwSVvFZJhaTXBYGi0DR1rSK5gxoC1EJGHOq7knD-QJaNuwP_fr6mngA$ -------------------------------------------------------------- After a long break, SYCO is back! The Symposium on Compositional Structures (SYCO) is an interdisciplinary series of meetings aiming to support the growing community of researchers interested in the phenomenon of compositionality, from both applied and abstract perspectives, and in particular where category theory serves as a unifying common language. Previous SYCO events have been held at University of Birmingham, University of Strathclyde, University of Oxford, Chapman University, and University of Leicester. We welcome submissions from researchers across computer science, mathematics, physics, philosophy, and beyond, with the aim of fostering friendly discussion, disseminating new ideas, and spreading knowledge between fields. Submission is encouraged for both mature research and work in progress, and by both established academics and junior researchers, including students. -------------------------------------------------------------- RESTART OF SYCO The main aim of SYCO is to bring the community together and exchange ideas across interdisciplinary fields. In-person contact facilitates this in a way that online meetings cannot. This meant that unfortunately, SYCO 7, the previous edition of SYCO, had to be cancelled. To restart the series, SYCO 8 will take the following into account: - Submissions that were accepted for SYCO 7 can be resubmitted for SYCO 8, and will be given priority over other submissions. These submissions will be treated as being deferred from SYCO 7, see submission instructions below. - Authors that had a submission accepted for SYCO can also submit new material. These submissions will also be given priority over other submissions, if accepted through peer-review. SYCO 8 will be mainly an in-person event, and we expect that most speakers will be physically present. However, we do support a hybrid format, so if for some reason you cannot be present in person but would still like to present your work at SYCO, please contact the programme chair, Maaike Zwart (maaike.annebeth at gmail.com) -------------------------------------------------------------- TOPICS OF INTEREST While no list of topics could be exhaustive, SYCO welcomes submissions with a compositional focus related to any of the following areas, in particular from the perspective of category theory: - logical methods in computer science, including classical and quantum programming, type theory, concurrency, natural language processing and machine learning; - graphical calculi, including string diagrams, Petri nets and reaction networks; - languages and frameworks, including process algebras, proof nets, type theory and game semantics; - abstract algebra and pure category theory, including monoidal category theory, higher category theory, operads, polygraphs, and relationships to homotopy theory; - quantum algebra, including quantum computation and representation theory; - tools and techniques, including rewriting, formal proofs and proof assistants, and game theory; - industrial applications, including case studies and real-world problem descriptions. -------------------------------------------------------------- IMPORTANT DATES All deadlines are 23:59 Anywhere on Earth. Submission deadline: Monday 25 October 2021 Author notification: Wednesday 3 November 2021 Symposium dates: Monday 13 and Tuesday 14 December 2021 -------------------------------------------------------------- SUBMISSION INSTRUCTIONS Submission are by EasyChair, via the SYCO 8 submission page: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=syco8__;!!IBzWLUs!HphgkclMgwZkryyQdsX4Kv9qwSVvFZJhaTXBYGi0DR1rSK5gxoC1EJGHOq7knD-QJaNuwP_-tkOGMw$ Submission is easy, with no format requirements or page restrictions. The meeting does not have proceedings, so work can be submitted even if it has been submitted or published elsewhere. Think creatively: you could submit a recent paper, or notes on work in progress, or even a recent Masters or PhD thesis. In the event that more good-quality submissions are received than can be accommodated in the timetable, the programme committee may choose to *defer* some submissions to a future meeting, rather than reject them. Deferred submissions can be re-submitted to any future SYCO meeting, where they will not need peer review, and where they will be prioritised for inclusion in the programme. Meetings will be held sufficiently frequently to avoid a backlog of deferred papers. If you have a submission which was deferred from a previous SYCO meeting, it will not automatically be considered for SYCO 8; you still need to submit it again through EasyChair. When submitting, append the words "DEFERRED FROM SYCO X" to the title of your paper, replacing "X" with the appropriate meeting number. There is no need to attach any documents. -------------------------------------------------------------- PROGRAMME COMMITTEE TBA Chair: Maaike Zwart, IT University of Copenhagen Local organisers: Amar Hadzihasanovic, Tallinn University of Technology Pawel Sobocinski, Tallinn University of Technology -------------------------------------------------------------- STEERING COMMITTEE Ross Duncan, University of Strathclyde Chris Heunen, University of Edinburgh Dominic Horsman, University of Oxford Aleks Kissinger, University of Oxford Samuel Mimram, ?cole Polytechnique Simona Paoli, University of Aberdeen Mehrnoosh Sadrzadeh, University College London Pawel Sobocinski, Tallinn University of Technology Jamie Vicary, University of Cambridge -------------- next part -------------- An HTML attachment was scrubbed... URL: From shiloviis at mail.ru Mon Sep 27 10:30:40 2021 From: shiloviis at mail.ru (=?UTF-8?B?U2hpbG92IE5pa29sYXk=?=) Date: Mon, 27 Sep 2021 17:30:40 +0300 Subject: [TYPES/announce] =?utf-8?q?Second_call_for_submissions_=28and_de?= =?utf-8?q?adline_extension=29_-_PSSV-2021=3A_Workshop_Program_Semantics?= =?utf-8?q?=2C_Specification_and_Verification_=28hybrid_format=29?= Message-ID: <1632753040.117986706@f536.i.mail.ru> Second call for submissions (and deadline extension) - PSSV-2021: Workshop Program Semantics, Specification and Verification (hybrid format) ? PSSV-2021:?XII Workshop Program Semantics, Specification and Verification?(Theory and Applications)? is planned to be held in hybrid mode online (using Zoom)? and offline (at Innopolis University, https://urldefense.com/v3/__https://innopolis.university/en/__;!!IBzWLUs!G6_ars4TeZ1F6IxVJzpA36mgjfCiT8KBHDMiB0XsbhUoQLrsO2VYj9_tP9QOoECVleO3e52hmtpbCg$ ) on Thursday and Friday November 4-5, 2021 ? PSSV-2021 workshop' page: https://urldefense.com/v3/__https://persons.iis.nsk.su/en/pssv21__;!!IBzWLUs!G6_ars4TeZ1F6IxVJzpA36mgjfCiT8KBHDMiB0XsbhUoQLrsO2VYj9_tP9QOoECVleO3e52SXjMLqg$ ? PSSV Scope and Topics Research, work in progress, position and student papers were welcome. List of topics of interest includes (but is not limited to): * formalisms for program semantics * formal models and semantics of programs and systems * semantics of programming and specification languages * formal description techniques * logics for formal specification and verification * deductive program verification * automatic theorem proving * model checking of programs and systems * static analysis of programs * formal approach to testing and validation * program analysis and verification tools ? PSSV-2021 Program Committee: * Thomas Baar (University of Applied Sciences HTW Berlin, Germany) * Alexander Bolotov (University of Westminster, UK) * Vladimir Itsykson (St. Petersburg State Polytech. University, Russia) * Andrei Klimov (Keldysh Institute of Applied Mathematics, Moscow, Russia) * Igor Konnov (Informal Systems, Austria) * Victor Kuliamin (Institute for System Programming, Moscow, Russia) * Alexei Lisitsa (University of Liverpool, UK) * Irina Lomazova (Higher School of Economics, Moscow, Russia) * Manuel Mazzara (Innopolis University, Russia) * Dmitry Mordvinov (St. Petersburg State University and JetBrains Research, Russia) * Sergey Staroletov (Polzunov Altai State Technical University, Barnaul, Russia), * Nina Yevtushenko (Tomsk State University and Institute for System Programming, RAS, Moscow, Russia). ? PSSV-2021 Program Co-Chairs: * Nikolay Shilov (Innopolis University, Russia, shiloviis(at)mail.ru) * Vladimir Zakharov (Moscow State University, Russia, zakh(at)cs.msu.su) ? Invited Sessions and Speakers * Session devoted to the anniversary the achievements of Professor Alexander K. Petrenko, Head of the Software Engineering Department of Institute for System Programming Russian Academy of Sciences (SED ISP RAS) ??** Alexander K. Petrenko: The position of formal methods in nowadays software industrial development ??** Victor V. Kuliamin: Formal Security Models ??** Alexander S. Kamkin: High-Level Synthesis of Computing Systems: Motivation, Challenges, and Existing Solutions ? ** Alexey V. Khoroshilov: Verification of operating systems * Host session: talks from Innopolis University ? ** Yegor Bugayenko: EOLANG and ?-calculus ??** Nikolai D. Kudasov: Nameless and scope-safe (de Bruijn notation as a nested datatype)ms: Sound, Expressive, Fast ? ** Alexandr V. Naumchev: The Role of Formalism in System Requirements (- joint work with Jean-Michel Bruel, Sophie Ebersold, Florian Galinier,Manuel Mazzara, Bertrand Meyer) * Partner session: talks from Laboratory of Theoretical Programming of A.P. Ershov Institute of Informatics Systems ? ** Igor S. Anureev: The Ontological Approach to Deductive Program Verification. ? ** Nataliya O. Garanina: The Optimization Problem with Model Checking ? ** Dmitry A. Kondratyev: Automatic deductive verification of C programs using the C-lightVer system (Please refer h https://urldefense.com/v3/__https://persons.iis.nsk.su/en/pssv21*invited__;Iw!!IBzWLUs!G6_ars4TeZ1F6IxVJzpA36mgjfCiT8KBHDMiB0XsbhUoQLrsO2VYj9_tP9QOoECVleO3e52osBV4DQ$ for more information about invited sessions, speakers and their talks.)? ? Submission and Publication The submission Web page for PSSV-2021:via EasyChair ( https://urldefense.com/v3/__https://easychair.org/conferences/?conf=pssv2021__;!!IBzWLUs!G6_ars4TeZ1F6IxVJzpA36mgjfCiT8KBHDMiB0XsbhUoQLrsO2VYj9_tP9QOoECVleO3e53klVDJjg$ ) ? Program Committee solicits? * regular research submissions in the form of an extended detailed abstract (6-8 pages in English, LNCS style recommended) to be reviewed by 3 PC members; * work in progress, position, poster and student research reports in the form of extended abstract (3-4 pages in English, LNCS style recommended) to be reviewed by a PC member. a PC member. ? Right now Easy Chair submission page https://urldefense.com/v3/__https://easychair.org/conferences/?conf=pssv2021__;!!IBzWLUs!G6_ars4TeZ1F6IxVJzpA36mgjfCiT8KBHDMiB0XsbhUoQLrsO2VYj9_tP9QOoECVleO3e53klVDJjg$ is open for regular papers. ? Selected revised and extended papers will be published (after the workshop) in the Modeling and Analysis of Information Systems ( https://urldefense.com/v3/__https://www.mais-journal.ru__;!!IBzWLUs!G6_ars4TeZ1F6IxVJzpA36mgjfCiT8KBHDMiB0XsbhUoQLrsO2VYj9_tP9QOoECVleO3e52pgmOHhQ$ ), a Russian peer-review journal where PSSV selected and revised papers are published since the very first edition of the workshop in 2010. (See for example Vol 27, No 4 (2020) at https://urldefense.com/v3/__https://www.mais-journal.ru/jour/issue/view/124/showToc__;!!IBzWLUs!G6_ars4TeZ1F6IxVJzpA36mgjfCiT8KBHDMiB0XsbhUoQLrsO2VYj9_tP9QOoECVleO3e53XYBe1rg$ with selected and revised papers of PSSV-2020.) We expect (as it was in the previous years of the PSSV) that English translations of some of these selected papers will appear next year in Automatic Control and Computer Sciences( https://urldefense.com/v3/__http://www.springer.com/computer/hardware/journal/11950__;!!IBzWLUs!G6_ars4TeZ1F6IxVJzpA36mgjfCiT8KBHDMiB0XsbhUoQLrsO2VYj9_tP9QOoECVleO3e50pa--HXg$ ) (indexed by WoS and Scopus). ? Important dates: * regular research submissions (extended detailed abstracts) - Sunday October 10, 2021 (extended, - no further extensions) * short submissions (abstracts of work in progress, position papers, etc.) - start - Sunday October 10, 2021, end - Sunday October 17, 2021 * notification for ALL submissions - Sunday October 24, 2021 * workshop (hybrid) - Thursday and Friday November 4-5, 2021 * invitations of selected talks to post-proceedings - Sunday November 7, 2021 * papers for the post-proceedings - Sunday November 14, 2021 * notification for the post-proceedings papers - around the end of November, 2021 -------------- next part -------------- An HTML attachment was scrubbed... URL: From d.pym at ucl.ac.uk Tue Sep 28 09:30:32 2021 From: d.pym at ucl.ac.uk (Pym, David) Date: Tue, 28 Sep 2021 13:30:32 +0000 Subject: [TYPES/announce] Research Fellows in Logic at UCL, London Message-ID: <9EDDAF91-3E7C-43AF-843F-C931A1D170FC@ucl.ac.uk> [Apologies for cross-postings. Please share widely. Thank you.] I am looking for Research Fellows in Logic to join me in UCL?s PPLV group (https://urldefense.com/v3/__http://pplv.cs.ucl.ac.uk/welcome/__;!!IBzWLUs!DTDptt52ywEVFd63zIz4-H_yv468BNNZHPAN-q3Jv4fvZ3w5nHsk8sPTGrlsZ5UuqDseCMYipsX7Mw$ ) in London. I?m interested in the following topics: - Foundational work in classical, intuitionistic, modal, and substructural logic, with a particular interests in - proof-theoretic semantics, including primary and categorical approaches, and - foundational work in reductive logic and proof-search. - Applications of logical ideas to systems modelling. - The development of logical tools for systems modelling, including dynamic, epistemic, deontic, and doxastic approaches, with case studies in security and policy modelling. Posts are 12 months in the first instance with possible extensions subject to agreement. The posts are funded by UK EPSRC grants. Please note that the closing date is 15 October. Details, including salary, terms, and how to apply may be found at UCL?s jobs page: https://urldefense.com/v3/__https://atsv7.wcn.co.uk/search_engine/jobs.cgi__;!!IBzWLUs!DTDptt52ywEVFd63zIz4-H_yv468BNNZHPAN-q3Jv4fvZ3w5nHsk8sPTGrlsZ5UuqDseCMYvWkn9ag$ under Research Fellow/Senior Research Fellows in Logic, specifically https://urldefense.com/v3/__https://atsv7.wcn.co.uk/search_engine/jobs.cgi?SID=amNvZGU9MTg3OTAwMiZ2dF90ZW1wbGF0ZT05NjYmb3duZXI9NTA0MTE3OCZvd25lcnR5cGU9ZmFpciZicmFuZF9pZD0wJnZhY194dHJhNTA0MTE3OC41MF81MDQxMTc4PTkyNzg2JnZhY3R5cGU9MTI3NiZwb3N0aW5nX2NvZGU9MjI0__;!!IBzWLUs!DTDptt52ywEVFd63zIz4-H_yv468BNNZHPAN-q3Jv4fvZ3w5nHsk8sPTGrlsZ5UuqDseCMaJXFzTXw$ For an informal discussion, please contact me at - d.pym at ucl.ac.uk - https://urldefense.com/v3/__http://www.cs.ucl.ac.uk/staff/D.Pym/__;!!IBzWLUs!DTDptt52ywEVFd63zIz4-H_yv468BNNZHPAN-q3Jv4fvZ3w5nHsk8sPTGrlsZ5UuqDseCMbACLC8zw$ Thank you, David ? Prof. David J. Pym Professor of Information, Logic, and Security Head of Programming Principles, Logic, and Verification University College London Honorary Research Fellow, Institute of Philosophy, University of London Director, UCL Centre for Doctoral Training in Cybersecurity Editor-in-Chief, OUP Journal of Cybersecurity d.pym at ucl.ac.uk https://urldefense.com/v3/__http://www.cs.ucl.ac.uk/people/D.Pym.html__;!!IBzWLUs!DTDptt52ywEVFd63zIz4-H_yv468BNNZHPAN-q3Jv4fvZ3w5nHsk8sPTGrlsZ5UuqDseCMa3eicOpA$ https://urldefense.com/v3/__http://www.cs.ucl.ac.uk/staff/D.Pym/__;!!IBzWLUs!DTDptt52ywEVFd63zIz4-H_yv468BNNZHPAN-q3Jv4fvZ3w5nHsk8sPTGrlsZ5UuqDseCMbACLC8zw$ Assistant: Julia Savage, j.savage at ucl.ac.uk, +44 (0)20 7679 0327 From gabriel.scherer at inria.fr Tue Sep 28 12:51:51 2021 From: gabriel.scherer at inria.fr (Gabriel Scherer) Date: Tue, 28 Sep 2021 18:51:51 +0200 Subject: [TYPES/announce] One-year postdoc position on category theory for lambda-calculus and proof theory, in the Paris area Message-ID: <50994ec2-213e-bd0a-ad37-c249d9583e68@inria.fr> We (Gabriel Scherer and Noam Zeilberger) are looking for candidates for a one-year post-doc position, ideally starting in January 2022, at INRIA Saclay / ?cole Polytechnique (in the Paris area, France), as part of the [Partout](https://urldefense.com/v3/__https://team.inria.fr/partout/__;!!IBzWLUs!AieDZCGwuwPDfX6iSfYr6GdXfU_bK2i8s9wyqkZ8OOtKXIsSmddTgUhJweA1Fbgv82-3YG6zXRCrxw$ ) research group. Broadly, the subject of the postdoc will be categorical perspectives on the lambda-calculus and proof theory. Potential topics of interest include, for example, (multi)categorical structures capturing notions of focusing, as usually formulated in sequent calculi for various logics, as well as fibrational structures capturing different notions of type inference for lambda-calculi. Interested applicants should contact us directly: Gabriel Scherer Noam Zeilberger please include a CV with your application. Best From alejandro at diaz-caro.info Tue Sep 28 14:56:08 2021 From: alejandro at diaz-caro.info (=?UTF-8?Q?Alejandro_D=C3=ADaz=2DCaro?=) Date: Tue, 28 Sep 2021 15:56:08 -0300 Subject: [TYPES/announce] ECI 2022: Call for course proposals - Buenos Aires, July 2022 In-Reply-To: <25b244cbf2c697ba95548f83f68a3ca6@dc.uba.ar> References: <75f003f55d27dc18c445db0da4969094@dc.uba.ar> <25b244cbf2c697ba95548f83f68a3ca6@dc.uba.ar> Message-ID: ---------- Forwarded message --------- From: ECI 2022-chair *Call for course proposals* *35th Informatics Sciences School - ECI 2022* *July 25 to 29, 2022* *Buenos Aires, Argentina* IMPORTANT DATES 26 November 2021: Proposal submission deadline End of January 2022: Notification This is an invitation to submit proposals for courses in all areas of Computer Science to be included in the program of the "35a Escuela de Ciencias Inform?ticas" - ECI 2022, to be held at Departamento de Computaci?n, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, from July 25th to 29th, 2020. The Escuela de Ciencias Inform?ticas (ECI) has been held annually at our department since 1987. The goal of ECI is to offer to Computer Science students and practitioners intensive, top-level courses on topics not covered by the regular curricula. These courses are taught by prestigious lecturers from universities and institutions from all around the world. Each year, between 400 and 800 people participate in ECI, taking one, two or three courses each. COURSE FORMAT ECI courses last 15 hours in total (3 hours per day from Monday to Friday) and are addressed to advanced undergraduate or graduate students. These courses should include a final evaluation, which can be a take-home to be sent by e-?mail to the lecturer. Submissions for courses to be taught in Spanish or English are accepted. The school will cover travel, hotel and local expenses of ECI 2022 lecturers. *Given the current health crisis, a full decision whether the event will be a physical conference or a virtual one will be taken later this year (around December 2021). Please let us know if a virtual format would be acceptable for your class if needed.* SUBMISSION INSTRUCTIONS Proposals should be submitted using the following form: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=eci2022__;!!IBzWLUs!AH_W1hxo-dvysVNwdEEfJ-4nvOdAMDPFdpOHFRJ1cIbtOavVpOXRCqXtWPsjO0Ho45elFls6C_D_hg$ The submission must be done in PDF format, containing only the following sections: * Title * Abstract (At most 1300 characters) * Objectives of the course (At most 1300 characters) * Topic (You must choose among the first level of ACM CCS ( https://urldefense.com/v3/__https://dl.acm.org/ccs/ccs.cfm__;!!IBzWLUs!AH_W1hxo-dvysVNwdEEfJ-4nvOdAMDPFdpOHFRJ1cIbtOavVpOXRCqXtWPsjO0Ho45elFltk-Hticg$ ), e.g. "Computer Systems Organization"). * Language: [English/Spanish] * Brief index (a list of topics that will be covered during the course) * Schedule (Approximate timeline of how these topics will be presented from Monday to Friday). * Suggested bibliography (At least three books or papers that are related to the topics of the course) * Student's preferred background (Background the students should have to be able to follow the course. A general description in the form of course names or topics will suffice.). * Will the course have a lab section? [Yes/No] (Optionally, your course can have a lab section for hands-on practice. In this case, the ECI organization will assign lab space with computers for the students). * Would you be willing to teach the course in an online format if needed? [Yes/No] * Optional: Local contact. (A local contact in the Department of Computer Science, FCEyN, UBA is desirable, but not mandatory) * A CV must be attached to the end of the proposal. For information about previous editions, please refer to https://urldefense.com/v3/__http://www.dc.uba.ar/events/eci/2019/anteriores__;!!IBzWLUs!AH_W1hxo-dvysVNwdEEfJ-4nvOdAMDPFdpOHFRJ1cIbtOavVpOXRCqXtWPsjO0Ho45elFlvl5nS4Jg$ or send e-?mail to eci2022-chair at dc.uba.ar. Maria Vanina Martinez (Chair) Emmanuel Iarussi (Co-Chair) -- https://urldefense.com/v3/__http://staff.dc.uba.ar/adiazcaro__;!!IBzWLUs!AH_W1hxo-dvysVNwdEEfJ-4nvOdAMDPFdpOHFRJ1cIbtOavVpOXRCqXtWPsjO0Ho45elFltScz12Ew$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From m.luckcuck at liverpool.ac.uk Thu Sep 30 06:01:19 2021 From: m.luckcuck at liverpool.ac.uk (Matt Luckcuck) Date: Thu, 30 Sep 2021 11:01:19 +0100 Subject: [TYPES/announce] Formal Methods for Autonomous Systems 2021: Registration Message-ID: <4A21B383-CC95-474F-A363-349273D846E0@getmailspring.com> Third Workshop on Formal Methods for Autonomous Systems (FMAS 2021) This two-day workshop will bring together researchers working on a range of techniques for formal verification of autonomous systems, to present recent work in the area, discuss key difficulties, and stimulate collaboration between the robotics and formal methods communities. FMAS2021 will be held **online**, due to the ongoing disruption caused by COVID-19, on the **21st and 22nd of October 2021**. You can register to attend FMAS2021, for free, using our eventbrite page: https://urldefense.com/v3/__https://www.eventbrite.co.uk/e/third-workshop-on-formal-methods-for-autonomous-systems-fmas-2021-tickets-177959861737__;!!IBzWLUs!Ea3GdeesaqM0auCD_rYtJouSyPf-iEh8-5bpmPbS4-7nqePiHdlxymkW43dQzAp4htKxY0HuR3j59g$ (https://urldefense.com/v3/__https://link.getmailspring.com/link/4A21B383-CC95-474F-A363-349273D846E0 at getmailspring.com/0?redirect=https*3A*2F*2Fwww.eventbrite.co.uk*2Fe*2Fthird-workshop-on-formal-methods-for-autonomous-systems-fmas-2021-tickets-177959861737&recipient=dHlwZXMtYW5ub3VuY2VAbGlzdHMuc2Vhcy51cGVubi5lZHU*3D__;JSUlJSUl!!IBzWLUs!Ea3GdeesaqM0auCD_rYtJouSyPf-iEh8-5bpmPbS4-7nqePiHdlxymkW43dQzAp4htKxY0F0Co4wnw$ ) More details, including the full list of accepted papers, can be found on our website: https://urldefense.com/v3/__https://fmasworkshop.github.io/FMAS2021__;!!IBzWLUs!Ea3GdeesaqM0auCD_rYtJouSyPf-iEh8-5bpmPbS4-7nqePiHdlxymkW43dQzAp4htKxY0FvIPLh4A$ (https://urldefense.com/v3/__https://link.getmailspring.com/link/4A21B383-CC95-474F-A363-349273D846E0 at getmailspring.com/1?redirect=https*3A*2F*2Ffmasworkshop.github.io*2FFMAS2021&recipient=dHlwZXMtYW5ub3VuY2VAbGlzdHMuc2Vhcy51cGVubi5lZHU*3D__;JSUlJSU!!IBzWLUs!Ea3GdeesaqM0auCD_rYtJouSyPf-iEh8-5bpmPbS4-7nqePiHdlxymkW43dQzAp4htKxY0EcblqRqA$ ) Scope Autonomous -- and Robotic -- Systems present unique challenges for formal methods. They are embodied entities that can interact with the real world and make autonomous decisions. Amongst others, they can be viewed as safety-critical, cyber-physical, hybrid, and real-time systems. Key issues for formal methods applied to autonomous systems include capturing how the system will deal with a dynamic external environment and verification of the system's decision making capabilities -- including planning, safety, ethical, and reconfiguration choices. Some autonomous systems require certification before deployment, others require public trust for wide adoption; both of these scenarios are being tackled by formal methods. The goals of this workshop are to bring together leading researchers in this area to present recent and ongoing work, including experience reports and case studies as well as identify future directions for this emerging application of formal methods. This workshop is concerned with the use of formal methods to specify, model, or verify autonomous or robotic systems, in whole or in part. Submissions may focus on case studies that identify the challenges for formal methods in this area, or experience reports that provide guidelines for tackling these challenges. We are especially interested in work using integrated formal methods, discussing the future directions of the field, using Runtime Verification or other approaches to deal with the _reality gap_, the cross over of safety and security, and verification of systems against safety assurance arguments or standards documents. Registration This year, FMAS will be held **online** via a video conference system. We will circulate details closer to the event, when the number of attendees is clearer. You can register to attend FMAS2021, for free, using our eventbrite (https://urldefense.com/v3/__https://link.getmailspring.com/link/4A21B383-CC95-474F-A363-349273D846E0 at getmailspring.com/2?redirect=https*3A*2F*2Fwww.eventbrite.co.uk*2Fe*2Fthird-workshop-on-formal-methods-for-autonomous-systems-fmas-2021-tickets-177959861737&recipient=dHlwZXMtYW5ub3VuY2VAbGlzdHMuc2Vhcy51cGVubi5lZHU*3D__;JSUlJSUl!!IBzWLUs!Ea3GdeesaqM0auCD_rYtJouSyPf-iEh8-5bpmPbS4-7nqePiHdlxymkW43dQzAp4htKxY0GXTvt-NA$ ) page. Invited Talks We have two invited talks for FMAS 2021: "Help or Hazard: Towards Verifying Autonomous Robot Systems" by Clare Dixon, Professor of Computer Science at the University of Manchester (UK) "Understanding and Verifying Deep Neural Networks" by Divya Gopinath, Researcher in Formal Verification in the Robust Software Engineering (RSE) group at the NASA Ames Research Center Chairs Matt Luckcuck , Maynooth University, Ireland Marie Farrell , Maynooth University, Ireland -------------- next part -------------- An HTML attachment was scrubbed... URL: From tristanj at bc.edu Thu Sep 30 12:10:47 2021 From: tristanj at bc.edu (Jean-Baptiste Tristan) Date: Thu, 30 Sep 2021 12:10:47 -0400 Subject: [TYPES/announce] ProbProg 2021: CALL FOR PARTICIPATION Message-ID: The 3rd International Conference on Probabilistic Programming (ProbProg21) will be held from October 20 to October 22, 2021. The conference will be held virtually. Website Registration Schedule Accepted submissions KEYNOTES Katie Bouman, California Institute of Technology John winn, Microsoft Research Bob Carpenter, Flatiron Institute ORGANIZERS Program Chairs: Guy van den Broeck & Lawrence Murray General Chairs: Jan-Willem van de Meent & Jean-Baptiste Tristan SPONSORS Facebook Google CONFERENCE SCOPE Probabilistic programming is an emergent field based on the idea that probabilistic models can be efficiently represented as executable code. This idea has enabled researchers to formalize, automate, and scale up many aspects of modeling and inference; to make modeling and inference accessible to a broader audience of developers and domain experts; and to develop new programmable AI systems that integrate modeling and inference approaches from multiple domains. PROBPROG is the first international conference dedicated to probabilistic programming. PROBPROG includes presentations on basic research, applied research, open source, and the practice of probabilistic programming. PROBPROG attendees come from academia, industry, non-profits, and government. The conference aims to achieve three goals: 1. Create a venue where researchers from multiple fields ? e.g. programming languages, statistics, machine learning, and artificial intelligence ? can meet, interact, and exchange ideas. 2. Grow a diverse and inclusive probabilistic programming community, by actively seeking participation from under-represented groups, and providing networking opportunities, mentorship, and feedback to all members. 3. Support the development of the practice of probabilistic programming, including open-source systems and real-world applications, and provide a bridge between the practice of probabilistic programming and basic research. PROBPROG welcomes abstract submissions for contributed research presentations, demonstrations, open-source systems, participants in open discussions, and consideration for invited publication in an online journal. Submissions should indicate alignment with one or more of the following themes: 1. Artificial and Natural Intelligence. Probabilistic programs and probabilistic programming technology for formulating and solving the core problems of intelligence, including research relevant for engineering artificial intelligence and for reverse-engineering natural intelligence. A central theme in this track is new AI architectures based on probabilistic programming that integrate statistical, symbolic, neural, Bayesian, and simulation-based approaches to knowledge representation and learning. Another central theme is proposals for learning probabilistic programs from data, and modeling high-level forms of human learning using probabilistic program synthesis. This track also includes research at the intersection of probabilistic programming and intelligence augmentation, collective intelligence, machine learning, and the development and analysis of intelligent infrastructure. 2. Statistics and Data Analysis. Probabilistic programs and probabilistic programming technology for formulating and solving problems in statistics and data analysis. Topics include latent variable models, parameter estimation, automated data modeling, Bayesian inference, calibration, model checking, model criticism, visualization, and testing of statistical models and inference algorithms. This track also includes statistical applications and deployments of probabilistic programming for data analysis. 3. Languages, Tools, and Systems. The design, implementation, and formal semantics of probabilistic programming languages and systems, including domain-specific and general-purpose languages, interpreters, compilers, probabilistic meta-programming techniques, probabilistic meta-programming languages, and runtime systems. This track also includes research on dynamic and static analysis of probabilistic programs, and empirical and theoretical study of the usability, performance, and accuracy of probabilistic programming languages and systems. 4. The Practice of Probabilistic Programming. This track is centered on four themes: (i) probabilistic programs and systems based on probabilistic programming that solve problems in industry, government, philanthropic work, applied research, and teaching, as well as potential use cases for probabilistic programs or probabilistic programming technology in these areas; (ii) challenges that arise when using probabilistic programming in practice, including inspection, debugging, testing, and performance engineering; (iii) human-centric design of probabilistic programs and probabilistic programming technology; and (iv) probabilistic programming tools, probabilistic program analyses, probabilistic programming styles/workflows, probabilistic programming practices/guidelines/experience reports, and probabilistic programming environments with the potential to address issues faced by practitioners. -- Jean-Baptiste Tristan Associate Professor Computer Science Department Boston College Website -------------- next part -------------- An HTML attachment was scrubbed... URL: From carsten at dcs.bbk.ac.uk Fri Oct 1 13:53:20 2021 From: carsten at dcs.bbk.ac.uk (Carsten Fuhs) Date: Fri, 1 Oct 2021 18:53:20 +0100 Subject: [TYPES/announce] FSCD 2022: First Call for Papers Message-ID: <46d5a4ab-fde4-b3b4-6b3d-57c9bf1275d2@dcs.bbk.ac.uk> CALL FOR PAPERS Seventh International Conference on Formal Structures for Computation and Deduction (FSCD 2022) August 2 - 5, 2022, Haifa, Israel https://urldefense.com/v3/__https://fscd2022.github.io/__;!!IBzWLUs!FfMtQmYIKrIhqT3MA_-6BZ8sF6N96AJh4CUaI_euXD3IqF6Hhn9Nwe8dKtCxcqVnBuWCeK4OtY6aqQ$ In-cooperation with ACM SIGLOG and SIGPLAN IMPORTANT DATES --------------- All deadlines are midnight anywhere-on-earth (AoE); late submissions will not be considered. Abstract: February 8, 2022 Submission: February 11, 2022 Rebuttal: March 29-April 1, 2022 Notification: April 15, 2022 Final version: April 30, 2022 FSCD (https://urldefense.com/v3/__http://fscd-conference.org/__;!!IBzWLUs!FfMtQmYIKrIhqT3MA_-6BZ8sF6N96AJh4CUaI_euXD3IqF6Hhn9Nwe8dKtCxcqVnBuWCeK6Dv-Wnig$ ) 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 --------------------- The submission site is: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=fscd2022__;!!IBzWLUs!FfMtQmYIKrIhqT3MA_-6BZ8sF6N96AJh4CUaI_euXD3IqF6Hhn9Nwe8dKtCxcqVnBuWCeK5_6H-TIw$ Submissions must be formatted using the LIPIcs style files (https://urldefense.com/v3/__https://submission.dagstuhl.de/series/details/5*author__;Iw!!IBzWLUs!FfMtQmYIKrIhqT3MA_-6BZ8sF6N96AJh4CUaI_euXD3IqF6Hhn9Nwe8dKtCxcqVnBuWCeK6pvFRZIg$ ). Submissions can be made in two categories. Regular research papers are limited to 15 pages, excluding references and appendices. They must present original research which is unpublished and not submitted elsewhere. System descriptions are limited to 15 pages, excluding references. They must present new software tools, or significantly new versions of such tools, in which FSCD topics play an important role. An archive of the code with instructions on how to install and run the tool must be submitted. In addition, a webpage where the system can be experimented with should be provided. One author of an accepted paper is expected to present it at the (physical) conference, unless Covid restrictions prevent travel. 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 ----------------------- Amy Felty, University of Ottawa fscd2022 at easychair.org PROGRAM COMMITTEE ----------------- Amal Ahmed, Northeastern University Thorsten Altenkirch, Nottingham University Takahito Aoto, Niigata University Kazuyuki Asada, Tohoku University Franz Baader, TU Dresden James Cheney, University of Edinburgh Agata Ciabattoni, Vienna University of Technology Horatiu Cirstea, Loria Nachum Dershowitz, Tel Aviv University Gilles Dowek, Inria & ENS Paris-Saclay Carsten Fuhs, Birkbeck, University of London Hugo Herbelin, Inria & Universit? de Paris Patricia Johann, Appalachian State University Daniel Licata, Wesleyan University Salvador Lucas, Universitat Polit?cnica de Val?ncia Christopher Lynch, Clarkson University Ralph Matthes, IRIT, CNRS, TU Toulouse Paul-Andr? Melli?s, CNRS, Universit? de Paris Alexandre Miquel, Universidad de la Rep?blica Georg Moser, Universit?t Innsbruck Daniele Nantes, Universidade de Bras?lia Vivek Nigam, Huawei ERC & UFPB Carlos Olarte, UFRN Valeria de Paiva, Topos Institute Giselle Reis, CMU Qatar Masahiko Sakai, Nagoya University Renate Schmidt, University of Manchester Martina Seidl, Johannes Kepler University Sam Staton, University of Oxford Christine Tasson, Sorbonne Universit? Beno?t Valiron, LRI & Universit? de Paris Stephanie Weirich, University of Pennsylvania CONFERENCE CHAIR ---------------- Nachum Dershowitz, Tel Aviv University WORKSHOP CHAIRS -------------- Shaull Almagor, Technion Guillermo A. P?rez, University of Antwerp STEERING COMMITTEE WORKSHOP CHAIR -------------------------------- Jamie Vicary, Oxford University PUBLICITY CHAIR --------------- Carsten Fuhs, Birkbeck, University of London FSCD STEERING COMMITTEE ----------------------- Zena Ariola, University of Oregon Alejandro D?az-Caro, Quilmes University & ICC/CONICET Carsten Fuhs, Birkbeck, University of London Herman Geuvers (Chair), Radboud University Silvia Ghilezan, University of Novi Sad Stefano Guerrini, Universit? de Paris 13 Delia Kesner, Universit? de Paris Diderot Naoki Kobayashi, The University of Tokyo Luigi Liquori, Inria Damiano Mazza, Universit? de Paris 13 Jakob Rehof, TU Dortmund Jamie Vicary, Oxford University From gc at irif.fr Sat Oct 2 11:59:17 2021 From: gc at irif.fr (Giuseppe Castagna) Date: Sat, 2 Oct 2021 17:59:17 +0200 Subject: [TYPES/announce] Postdoctoral positions at IRIF, Paris, France Message-ID: <5a7361f2-26da-7deb-db6a-ffb1c7dfbefe@irif.fr> IRIF (CNRS and Universit? de Paris), Paris, France, is seeking excellent candidates for postdoctoral positions in all areas of the Foundations of Computer Science. Every year, 5-10 new postdocs join IRIF. IRIF (Institute for Research in Foundations of Computer Science) is a joint laboratory of the CNRS (French National Center for Scientific Research) and Universit? de Paris. Currently, it hosts about 90 permanent faculty members, 40 non-permanent full-time researchers, and 50 Ph.D. students. For further information about IRIF please see https://urldefense.com/v3/__https://www.irif.fr/en/informations/presentation__;!!IBzWLUs!Bzp5b7Pypo_heU6Y-25wPJQ80ztuO563cixdljliJ9h0QPr1E7Efa51qqm0oBvcq70wVj96hq77Kig$ ?. The postdoc positions at IRIF are financed either by the laboratory resources, or by group or personal grants, or by joint applications of IRIF members and the candidate to outside funding agencies with which IRIF is affiliated. The starting date of the positions is usually in September-October, but this may sometimes vary. Candidates must hold a Ph.D. degree in Computer Science or a related area before the starting date of the position. Knowledge of French is not required, and applications can be sent either in French or in English. The application deadline for most application tracks is November 1st, 2021. For a list of specific openings as well as instructions how to apply please visit https://urldefense.com/v3/__https://www.irif.fr/postes/postdoc__;!!IBzWLUs!Bzp5b7Pypo_heU6Y-25wPJQ80ztuO563cixdljliJ9h0QPr1E7Efa51qqm0oBvcq70wVj963tIEljQ$ ?. -------------- next part -------------- An HTML attachment was scrubbed... URL: From rl.stpuu at gmail.com Sun Oct 3 06:33:04 2021 From: rl.stpuu at gmail.com (Roussanka Loukanova) Date: Sun, 3 Oct 2021 12:33:04 +0200 Subject: [TYPES/announce] CfP: LACompLing2021 Logic and Algorithms in Computational Linguistics 2021, MALIN, Montpellier Message-ID: CALL FOR PAPERS Symposium Logic and Algorithms in Computational Linguistics 2021 (LACompLing2021) 13 - 17 December 2021, online https://urldefense.com/v3/__https://staff.math.su.se/rloukanova/LACompLing2021-web/__;!!IBzWLUs!FpU_vT_yoTaQ7yH8F2L4rgG_R1yF71QBfhl1CBXr3fXHRXhkVuLBY-6PcGYM1zPmcnZmbqQc0u_9qQ$ LACompLing2021 is part of the week Mathematical Linguistics (MALIN) 2021, Universit? de Montpellier (UM), Montpellier, France, 13 - 17 December 2021, Online DESCRIPTION of LACompLing Computational linguistics studies natural language in its various manifestations from a computational point of view, both on the theoretical level (modeling grammar modules dealing with natural language form and meaning, and the relation between these two) and on the practical level (developing applications for language and speech technology). Right from the start in the 1950s, there have been strong links with computer science, logic, and many areas of mathematics - one can think of Chomsky's contributions to the theory of formal languages and automata, or Lambek's logical modeling of natural language syntax. The symposium assesses the place of logic, mathematics, and computer science in present day computational linguistics. It intends to be a forum for presenting new results as well as work in progress. SCOPE of LACompLing The symposium focuses mainly on logical approaches to computational processing of natural language, and on the applicability of methods and techniques from the study of artificial languages (programming/logic) in computational linguistics. We invite participation and submissions from other relevant approaches too, especially if they can inspire new work and approaches. The topics of LACompLing2021 include, but are not limited to: - Computational theories of human language - Computational syntax - Computational semantics - Computational syntax-semantics interface - Interfaces between morphology, lexicon, syntax, semantics, speech, text, pragmatics - Computational grammar - Logic and reasoning systems for linguistics - Type theories for linguistics - Models of computation and algorithms for linguistics - Computational approaches of computational linguistics for domain specific areas - Language processing - Parsing algorithms - Generation of language from semantic representations - Large-scale grammars of natural languages - Multilingual processing - Computational theories and systems of reasoning in natural language - Data science in language processing - Machine learning of language - Interdisciplinary methods - Integration of formal, computational, model theoretic, graphical, diagrammatic, statistical, and other related methods - Logic for information extraction or expression in written and / or spoken language - Language theories based on biological fundamentals of information and languages - Computational neuroscience of language LACompLing2021 is especially interested in topics on the interconnections between Logic, Language, and Argumentation, e.g.: - Formal languages of reasoning and argumentation - Algorithms related to natural language of argumentation - theories, implementations, applications - Formal models of argumentations - Logic of preferences - Beliefs, attitudes, persuasions - theories and applications IMPORTANT DATES Submission: 30 October 2021 Notifications: 6 November 2021 Final submissions: TBA ?? LACompLing2021: 13 - 17 December 2021 SUBMISSION INSTRUCTIONS We welcome submissions of abstracts of presentations of original work. The intended papers should not be submitted concurrently to another conference or conference event and should not have been published or submitted for publication consideration elsewhere. NOTE: We will not accept submissions that are on work submitted to another event at MALIN 2021, concurrently during the submission to LACompLing2021. - Submission of abstracts of presentations: limited to 1 page, including the title, other heading material, about half of a page text, and references - Authors can submit more than one abstract. Invited speakers can submit invited and contributed abstracts. - The camera-ready submissions may require all the necessary typesetting sources, which are not in the standard LaTeX distribution Typesetting Instructions For LaTeX, authors are required to use Springer LNCS package. Styles and templates can be downloaded from Springer, for LaTeX (recommended!) and Microsoft Word: https://urldefense.com/v3/__https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines__;!!IBzWLUs!FpU_vT_yoTaQ7yH8F2L4rgG_R1yF71QBfhl1CBXr3fXHRXhkVuLBY-6PcGYM1zPmcnZmbqRzxdMbeA$ For bibliography citations, please use BibTeX with: \bibliographystyle{spmpsci} SUBMISSIONS The submission Web page for LACompLing2021 is: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=lacompling2021__;!!IBzWLUs!FpU_vT_yoTaQ7yH8F2L4rgG_R1yF71QBfhl1CBXr3fXHRXhkVuLBY-6PcGYM1zPmcnZmbqTFUzNkvg$ PUBLICATIONS We will organize a post-conference, special volume after the symposium LACompLing2021, for publication of extended papers based on accepted abstracts with presentations at LACompLing2021. The submissions to the special volume have to be original, unpublished, and not concurrently submitted elsewhere. They will go through thorough peer reviews. ORGANIZATION of LACompLing2021 CHAIRS of LACompLing2021 Roussanka Loukanova, IMI, BAS, Sofia, Bulgaria and Stockholm University, Stockholm, Sweden Reinhard Muskens, ILLC, Universiteit van Amsterdam, Amsterdam, The Netherlands PROGRAM CHAIRS of LACompLing2021 Roussanka Loukanova, IMI, BAS, Sofia, Bulgaria and Stockholm University, Stockholm, Sweden Richard Moot, LIRMM-CNRS, Montpellier, France Christian Retor?, Universit? de Montpellier and LIRMM-CNRS, Montpellier, France ORGANISATION of LACompLing2021 at Stockholm University Peter LeFanu Lumsdaine, Stockholm University, Stockholm, Sweden (local organiser, publication chair) Axel Ljungsr?m, Stockholm University, Stockholm, Sweden (local organiser, publication associate) Roussanka Loukanova, IMI, BAS, Sofia, Bulgaria and Stockholm University, Stockholm, Sweden (chair) Contact LACompLing 2021 -------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From pangjun at gmail.com Mon Oct 4 03:49:45 2021 From: pangjun at gmail.com (Jun PANG) Date: Mon, 4 Oct 2021 09:49:45 +0200 Subject: [TYPES/announce] FM 2021 - Call for Participation Message-ID: [Please distribute, apologies for multiple postings.] FM 2021 is the 24th international symposium in a series organized by Institute of Software, Chinese Academy of Sciences, under the auspices of Formal Methods Europe (FME), held on-line during November 20-26, 2021. -- ABOUT FM FM 2021 is the 24th international symposium in a series organized by Formal Methods Europe (FME), an independent association whose aim is to stimulate the use of, and research on, formal methods for software development. FM 2021 will highlight the development and application of formal methods in a wide range of domains including software, cyber-physical systems and integrated computer-based systems. -- INVITED TALKS ? Mingsheng Ying (University of Technology Sydney, Australia) Model Checking for Verification of Quantum Circuits ? Paula Herber (University of M?nster, Germany) Combine Forces - How to Formally Verify Informally Defined Embedded Systems ? Clark Barrett (Stanford University, USA) Domain-Specific Reasoning with Satisfiability Modulo Theories ? Assia Mahboubi (Inria Nantes, France and Vrije Universiteit Amsterdam, Netherlands) Formal verification of computational mathematics -- CONTRIBUTED PAPERS ? A list of accepted papers can be found at https://urldefense.com/v3/__https://lcs.ios.ac.cn/fm2021/accepted-papers/__;!!IBzWLUs!AE7ei7Fz3oGfLPCtyvYmX6vlV-JrYp9lnl0ZPlK_Lx-c5eoywNnQJ1e3jRHSVWSxdnpQTq4ZK70Iqw$ . ? A preliminary program can be found at https://urldefense.com/v3/__https://lcs.ios.ac.cn/fm2021/main_program/__;!!IBzWLUs!AE7ei7Fz3oGfLPCtyvYmX6vlV-JrYp9lnl0ZPlK_Lx-c5eoywNnQJ1e3jRHSVWSxdnpQTq4wlmHYAQ$ . -- ASSOCIATED EVENTS The FM symposium also features the following associated events: ? Announcement of the new FME fellow ? Industry day (a list of accepted paper can be found at https://urldefense.com/v3/__https://lcs.ios.ac.cn/fm2021/i-day-accepted-papers/__;!!IBzWLUs!AE7ei7Fz3oGfLPCtyvYmX6vlV-JrYp9lnl0ZPlK_Lx-c5eoywNnQJ1e3jRHSVWSxdnpQTq50mC-ZnA$ , and a preliminary program can be found at https://urldefense.com/v3/__https://lcs.ios.ac.cn/fm2021/program/__;!!IBzWLUs!AE7ei7Fz3oGfLPCtyvYmX6vlV-JrYp9lnl0ZPlK_Lx-c5eoywNnQJ1e3jRHSVWSxdnpQTq6DIS4jDw$ ) ? Doctoral Symposium ? Journal First Track ? Six workshops and five tutorials (see https://urldefense.com/v3/__https://lcs.ios.ac.cn/fm2021/workshops-and-tutorials/__;!!IBzWLUs!AE7ei7Fz3oGfLPCtyvYmX6vlV-JrYp9lnl0ZPlK_Lx-c5eoywNnQJ1e3jRHSVWSxdnpQTq7Hr6k_IA$ ) Moreover, we also have the following collocated events: ? MEMOCODE 2021 - 19th ACM-IEEE International Conference on Formal Methods and Models for System Design (https://urldefense.com/v3/__https://lcs.ios.ac.cn/memocode21/__;!!IBzWLUs!AE7ei7Fz3oGfLPCtyvYmX6vlV-JrYp9lnl0ZPlK_Lx-c5eoywNnQJ1e3jRHSVWSxdnpQTq5YpdKwNg$ ) ? SETTA 2021 ? 7th Symposium on Dependable Software Engineering Theories, Tools and Applications (https://urldefense.com/v3/__https://lcs.ios.ac.cn/setta2021/__;!!IBzWLUs!AE7ei7Fz3oGfLPCtyvYmX6vlV-JrYp9lnl0ZPlK_Lx-c5eoywNnQJ1e3jRHSVWSxdnpQTq75wz-y1g$ ) ? VECoS 2021 - 15th International Conference on Verification and Evaluation of Computer and Communication Systems (https://urldefense.com/v3/__http://vecos-world.org/2021/__;!!IBzWLUs!AE7ei7Fz3oGfLPCtyvYmX6vlV-JrYp9lnl0ZPlK_Lx-c5eoywNnQJ1e3jRHSVWSxdnpQTq5aO7KzKA$ ) The full program of FM 2021 and co-located events can be found at https://urldefense.com/v3/__https://lcs.ios.ac.cn/fm2021/overall_program/__;!!IBzWLUs!AE7ei7Fz3oGfLPCtyvYmX6vlV-JrYp9lnl0ZPlK_Lx-c5eoywNnQJ1e3jRHSVWSxdnpQTq7CtqadWQ$ . -- REGISTRATION Registration fee is 30 EUR (220 Yuan RMB) for all events, and 10 EUR (75 Yuan RMB) for workshops and/or tutorials. Please visit https://urldefense.com/v3/__https://lcs.ios.ac.cn/fm2021/registration/__;!!IBzWLUs!AE7ei7Fz3oGfLPCtyvYmX6vlV-JrYp9lnl0ZPlK_Lx-c5eoywNnQJ1e3jRHSVWSxdnpQTq7xjMEvRw$ for registration. For more information, please visit the website of FM 2021 https://urldefense.com/v3/__https://lcs.ios.ac.cn/fm2021/__;!!IBzWLUs!AE7ei7Fz3oGfLPCtyvYmX6vlV-JrYp9lnl0ZPlK_Lx-c5eoywNnQJ1e3jRHSVWSxdnpQTq6BJw6uEg$ Please contact Dr. Bohua Zhan and Dr. Shuling Wang via fm2021 at ios.ac.cn if you have any questions. From tristanj at bc.edu Mon Oct 4 10:26:09 2021 From: tristanj at bc.edu (Jean-Baptiste Tristan) Date: Mon, 4 Oct 2021 10:26:09 -0400 Subject: [TYPES/announce] LAFI'22: Call for Extended Abstracts Message-ID: ===================================================================== Call for Extended Abstracts LAFI 2022 POPL 2022 workshop on Languages for Inference January 16, 2022 https://urldefense.com/v3/__https://popl22.sigplan.org/home/lafi-2022__;!!IBzWLUs!EblON11v6Mr_Vei-AMBXILrwoGO6ruiSlv34VHX8MrsrIH4QUItahBAnXFf32dbHLqsReIHcuJs-UA$ Submission deadline on October 15, 2021! ==================================================================== ***** Submission Summary ***** Deadline: October 15, 2021 (AoE) Link: https://urldefense.com/v3/__https://lafi22.hotcrp.com/__;!!IBzWLUs!EblON11v6Mr_Vei-AMBXILrwoGO6ruiSlv34VHX8MrsrIH4QUItahBAnXFf32dbHLqsReIFdF5Zxzg$ Format: extended abstract (2 pages + references) ***** Call for Extended Abstracts ***** Inference concerns re-calibrating program parameters based on observed data, and has gained wide traction in machine learning and data science. Inference can be driven by probabilistic analysis and simulation, and through back-propagation and differentiation. Languages for inference offer built-in support for expressing probabilistic models and inference methods as programs, to ease reasoning, use, and reuse. The recent rise of practical implementations as well as research activity in inference-based programming has renewed the need for semantics to help us share insights and innovations. This workshop aims to bring programming-language and machine-learning researchers together to advance all aspects of languages for inference. Topics include but are not limited to: - design of programming languages for inference and/or differentiable programming; - inference algorithms for probabilistic programming languages, including ones that incorporate automatic differentiation; - automatic differentiation algorithms for differentiable programming languages; - probabilistic generative modeling and inference; - variational and differential modeling and inference; - semantics (axiomatic, operational, denotational, games, etc) and types for inference and/or differentiable programming; - efficient and correct implementation; - and last but not least, applications of inference and/or differentiable programming. We expect this workshop to be informal, and our goal is to foster collaboration and establish common ground. Thus, the proceedings will not be a formal or archival publication, and we expect to spend only a portion of the workshop day on traditional research talks. Nevertheless, as a concrete basis for fruitful discussions, we call for extended abstracts describing specific and ideally ongoing work on probabilistic and differential programming languages, semantics, and systems. ***** Submission guidelines ***** Submission deadline on October 15, 2021 (AoE) Submission link: https://urldefense.com/v3/__https://lafi22.hotcrp.com/__;!!IBzWLUs!EblON11v6Mr_Vei-AMBXILrwoGO6ruiSlv34VHX8MrsrIH4QUItahBAnXFf32dbHLqsReIFdF5Zxzg$ Anonymous extended abstracts are up to 2 pages in PDF format, excluding references. In line with the SIGPLAN Republication Policy, inclusion of extended abstracts in the program is not intended to preclude later formal publication. -- Jean-Baptiste Tristan Associate Professor Computer Science Department Boston College Website -------------- next part -------------- An HTML attachment was scrubbed... URL: From kitwan.chui at informatics-europe.org Sun Oct 3 15:36:12 2021 From: kitwan.chui at informatics-europe.org (Kit Wan Chui) Date: Sun, 3 Oct 2021 21:36:12 +0200 Subject: [TYPES/announce] IE Webinar (Oct 8): Thriving as a doctoral student in informatics Message-ID: Dear colleagues, We cordially invite you to participate to our *next Informatics Europe webinar* on 8 October (Friday): *Thriving as a doctoral student in informatics** Date: 8 October 2021, 10:30-12:00 CET Facilitators: Prof. Dr. Geraldine Fitzpatrick, TU Wien, Austria Prof. Dr. Austen Rainer, Queen?s University Belfast, UK ----------------------------------------------------------------------------- Register for the free webinar: Webinar details: Informatics Europe wants to support and grow a thriving community of European PhD researchers and invites you to contribute to defining and growing this community. ?* Meet like-minded PhD students from across Europe ?* Network ?* Share challenges and experiences ?* Learn from each other ?* Influence Informatics Europe?s action in this area What are your challenges as a PhD student, especially in COVID times? What experiences can you share that would help others in a similar situation? What additional support would you find useful? Here are some examples of challenges PhD students face during their studies: ?* Doing the research itself (literature reviews, theory, methodology, ?? critical thinking), ?* Engaging with management (managing their time, managing their ?? supervisors), ?* Collaborating with others e.g., co-authorship, proper credit for ?? their contributions, ?* Engaging wider stakeholders (e.g., participation recruitment). ?* Looking after yourself, especially as a result of COVID In this webinar, we provide space for facilitated, small group discussion with feedback. The webinar is co-led by?Prof. Dr. Geraldine Fitzpatrick and?Prof. Dr. Austen Rainer: two experienced Informatics academicsas well as facilitators of Informatics Europe?s Academic Leadership Development Course. We look forward to meeting you at our webinar! Yours sincerely, Informatics Europe /*This webinar is part of the Informatics Europe webinar series offered by IE since September 2021. These live webinars are hosted by distinguished keynote speakers. They are free webinars, open to all who have registered for participation through our webpage . Recorded versions will also be available later on our YouTube channel . From amintimany at gmail.com Mon Oct 4 08:18:17 2021 From: amintimany at gmail.com (Amin Timany) Date: Mon, 4 Oct 2021 14:18:17 +0200 Subject: [TYPES/announce] CoqPL 2022: Call for Presentations Message-ID: <6416214C-5246-47B9-A68E-DBD208038D07@gmail.com> =================================================================== CoqPL 2022 8th International Workshop on Coq for Programming Languages -- January, 2022, co-located with POPL Philadelphia, Pennsylvania, United States CALL FOR PRESENTATIONS https://urldefense.com/v3/__https://popl22.sigplan.org/home/CoqPL-2022__;!!IBzWLUs!HYFSSQl8I2SwKAlLe2AXqtZ2Fbpz1VXoSNJUc4vcNLVl0E0_UdvP8XYs4_H1TLN6oKE5mIpEsJ4Upg$ =================================================================== Workshop Overview ----------------- The series of CoqPL workshops provide an opportunity for programming languages researchers and practitioners with an interest in Coq to meet and interact with one another and members from the core Coq development team. At the meeting, we will discuss upcoming new features, see talks and demonstrations of exciting current projects, solicit feedback for potential future changes to Coq itself, and generally work to strengthen the vibrant community around our favorite proof assistant. Topics in scope include: - Formalizations of PL research in Coq - General purpose libraries and tactic language extensions - Domain-specific libraries for programming language formalization and verification - IDEs, profilers, tracers, debuggers, and testing tools - Reports on ongoing proof efforts conducted via (or in the context of) the Coq proof assistant - Experience reports from Coq usage in educational or industrial contexts Workshop Format --------------- The workshop format will be driven by you, members of the community. We will solicit abstracts for talks and proposals for demonstrations and flesh out format details based on responses. We expect the final program to include experiment reports, panel discussions, and invited talks (details TBA). Talks will be selected according to relevance to the workshop, based on the submission of an extended abstract. To foster open discussion of cutting edge research which can later be published in full conference proceedings, we will not publish papers from the workshop. However, presentations may be recorded and the videos may be made publicly available. Submission Details ------------------ Submission page: https://urldefense.com/v3/__https://coqpl22.hotcrp.com/__;!!IBzWLUs!HYFSSQl8I2SwKAlLe2AXqtZ2Fbpz1VXoSNJUc4vcNLVl0E0_UdvP8XYs4_H1TLN6oKE5mIq58OXJBQ$ Important Dates: - Submission: Thursday, October, 21 2021. - Notification: Thursday, November 18, 2021. - Workshop: January, 2021 (the exact date to be determined by the POPL organizing committee). Submissions for talks and demonstrations should be described in an extended abstract, between 1 and 2 pages in length (excluding the bibliography). We suggest formatting the text using the two-column ACM SIGPLAN latex style (9pt font). Templates are available from the ACM SIGPLAN page: https://urldefense.com/v3/__http://www.sigplan.org/Resources/Author__;!!IBzWLUs!HYFSSQl8I2SwKAlLe2AXqtZ2Fbpz1VXoSNJUc4vcNLVl0E0_UdvP8XYs4_H1TLN6oKE5mIqVYHNXlQ$ . Invited Speaker --------------- - Cl?ment Pit-Claudel Program Committee ----------------- Chairs: - Benjamin Pierce, University of Pennsylvania, USA - Amin Timany, Aarhus University, Denmark Program Committee: - Abhishek Anand, Bedrock Systems, USA - Lourdes del Carmen Gonz?lez-Huesca, National Autonomous University of Mexico (UNAM), Mexico - Jason Gross, Massachusetts Institute of Technology (MIT), USA - Chung-Kil Hur, Seoul National University, South Korea - Leonidas Lampropoulos, University of Maryland, USA - Xavier Leroy, Coll?ge de France & INRIA, France - Enrico Tassi, INRIA, France Covid-19 and Possibility of Virtual Workshop ------------------------------------------------ CoqPL 2022 is a collocated with POPL 2022 and will follow the decision of the organizing committee of POPL 2022 on whether it is held physically, virtually, or a combination thereof. From tarmo at cs.ioc.ee Mon Oct 4 15:29:39 2021 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Mon, 4 Oct 2021 22:29:39 +0300 Subject: [TYPES/announce] ETAPS 2022 final call for papers Message-ID: <20211004222939.389a53d7@cs.ioc.ee> Paper submission deadline: 14 Oct 2021 23:59 AoE ****************************************************************** JOINT CALL FOR PAPERS 25th European Joint Conferences on Theory and Practice of Software ETAPS 2022 Munich, Germany, 2-7 April 2022 https://urldefense.com/v3/__https://etaps.org/2022__;!!IBzWLUs!A7WB2HlDaq4PpiGm1OO6yjaPoj1H5GQk4lCuIJSNAON6PblXwWlqvancTSuITsTkb2SbkTMduRrcTw$ ****************************************************************** -- ABOUT ETAPS -- ETAPS is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of four annual conferences, accompanied by satellite workshops. ETAPS 2022 is the twenty-fifth event in the series. -- MAIN CONFERENCES (4-7 April) -- * ESOP: European Symposium on Programming (PC chair: Ilya Sergey, Yale-NUS College and National University of Singapore, Singapore) * FASE: Fundamental Approaches to Software Engineering (PC chairs:Einar Broch Johnsen, University of Oslo, Norway, and Manuel Wimmer, Johannes Kepler Universit?t Linz, Austria) * FoSSaCS: Foundations of Software Science and Computation Structures (PC chairs: Patricia Bouyer, CNRS, LMF, France, and Lutz Schr?der, FAU Erlangen-N?rnberg, Germany) * TACAS: Tools and Algorithms for the Construction and Analysis of Systems (PC chairs: Dana Fisman, Ben-Gurion University of the Negev, Israel, and Grigore Rosu, University of Illinois at Urbana-Champaign, USA) TACAS '22 will host the 11th Competition on Software Verification (SV-COMP). -- INVITED SPEAKERS -- * Unifying speakers: Alexandra Silva (University College London, UK / Cornell University, USA) Tom?? Vojnar (Brno University of Technology, Czechia) * FoSSaCS invited speaker: Nathalie Bertrand (Inria Rennes, France) * TACAS invited speaker: Lenore Zuck (University of Illinois at Chicago, USA) * Tutorial speakers: Stacey Jeffery (CWI and QuSoft, The Netherlands) a further tutorial speaker tba -- IMPORTANT DATES * Paper submission (also, pre-paper-acceptance artifact registration (TACAS)): 14 October 2021 23:59 AoE * Pre-paper-acceptance artifact submission (TACAS): 4 November 2021 23:59 AoE * Rebuttal (ESOP, FoSSaCS and, partially, TACAS): 7 December 00:01 AoE - 9 December 2021 23:59 AoE * Paper notification: 23 December 2021 * Post-paper-acceptance artifact submission (ESOP, FASE, TACAS): 5 January 2022 23:59 AoE * Paper final versions: 26 January 2022 * Artifact notification: 16 February 2022 -- SUBMISSION INSTRUCTIONS -- The four main conferences of ETAPS 2022 solicit contributions of the following types. All page limits are given **excluding the bibliography**. * ESOP: regular research papers of max 25 pp * FASE: regular research papers and empirical evaluation papers of max 18 pp, new ideas and emerging results (NIER) papers of max 8 pp, tool demonstration papers of max 6 pp (+ mandatory appendix of max 6 pp), * FoSSaCS: regular research papers of max 18 pp * TACAS: regular research papers, case study papers and regular tool papers of max 16 pp, tool demonstration papers of max 6 pp For definitions of the different paper types and specific instructions, where they are present, see the webpages of the individual conferences. All accepted papers will appear in the proceedings and have presentations during the conference. A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. We plan ETAPS 2022 as a hybrid conference; remote attendance and presentation will be possible. Submitted papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere. In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is also forbidden. Submissions must follow the formatting guidelines of Springer's LNCS (use the llncs.cls class) and be submitted electronically in pdf through the Easychair author interface of the respective conference. Submissions not adhering to the specified format and length may be rejected immediately. ESOP and FASE will use **double-blind reviewing**. Authors are asked to omit their names and institutions; refer to prior work in the third person, just as prior work by others; not to include acknowledgements that might identify them. ESOP and FoSSaCS will use an **author rebuttal phase**. TACAS will use rebuttal for selected submissions (those in the gray zone). Artifact submission and evaluation Regular tool paper and tool demonstration paper submissions to TACAS must be accompanied by an artifact submitted shortly after the paper. The artifact will be evaluated and the outcome will be taken into account in the acceptance decision of the paper. For research paper and case study paper submissions, pre-paper-acceptance submission of an artifact is optional; if an artifact is submitted at this point, it will be handled like described above. Alternatively, authors of papers of these categories may submit an artifact for evaluation after the paper has been accepted. The outcome of the artifact evaluation will then not change the paper acceptance decision. ESOP and FASE will also have artifact evaluation, but participation in it is voluntary; the artifact submission deadline is after the paper notification deadline. The outcome will not alter the paper acceptance decision. For specific instructions regarding artifacts, see the webpages of the individual conferences. -- PUBLICATION The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of Springer's LNCS series. The proceedings volumes will appear in gold open access, so the published versions of all papers will be available for everyone to download from the publisher's website freely, from the date of online publication, perpetually. The copyright of the papers will remain with the authors. -- BEST PAPER AWARDS The strongest papers of the four conferences will be nominated for the ETAPS best paper awards of EAPLS, EASST and EATCS. The ETAPS test of time award recognizes outstanding papers published at ETAPS more than 10 years in the past. -- SATELLITE EVENTS (2-3 April) -- A number of satellite workshops and other events will take place before the main conferences: CMCS, COOP, HCVS, LiVe, MARS, MSFP, PLACES, QAVS, RRRR, Rust Workshop, SynCop, VerifyThis, VPT, WRLA Also in the satellite events program is a Mentoring Workshop. For closer information, check https://urldefense.com/v3/__https://etaps.org/2022/workshops__;!!IBzWLUs!A7WB2HlDaq4PpiGm1OO6yjaPoj1H5GQk4lCuIJSNAON6PblXwWlqvancTSuITsTkb2SbkTPK6ONFUQ$ . -- CITY AND HOST INSTITUTION -- Munich, Germany, is the capital and most populous city of Bavaria. Nowadays, the city is a global center of art, science, technology, finance, publishing, culture, innovation, education, business, and tourism. It is home to Ludwig Maximilian's University (LMU) and Technische Universit?t M?nchen (TUM), many scientific institutions, and world-class technology and science museums such as Deutsches Museum and BMW Museum. Iconic places to visit in Munich include the Munich Residenz, Marienplatz, the Old Town Hall, the famous Glockenspiel on the New Town Hall, the Frauenkirche, the English Garden, the Olympic Park and Nymphenburg Palace. The conference will be hosted by Technische Universit?t M?nchen. -- ORGANIZERS -- General chair: Jan K?et?nsk? (Technische Universit?t M?nchen, Germany) Workshops chair: Dirk Beyer (Ludwig-Maximilians Universit?t M?nchen, Germany) From mwwhalen at umn.edu Mon Oct 4 16:28:00 2021 From: mwwhalen at umn.edu (Michael Whalen) Date: Mon, 4 Oct 2021 15:28:00 -0500 Subject: [TYPES/announce] FMCAD 2021 2nd Call for Participation In-Reply-To: References: Message-ID: Apologies for multiple postings. The 21th International Conference on Formal Methods in Computer-Aided Design (FMCAD) will be held from October 19 to October 22, 2021. The conference will be held virtually. Registration is free, but obligatory to attend the conference: https://urldefense.com/v3/__https://fmcad.org/FMCAD21/registration/__;!!IBzWLUs!F5lMj8VnZ_llBX8LWX3DOLs6vT3Dm_WiDrwH_DePCcgr1oRrhoaXbFx-pSvk2yKYPLMb5ZcD7Ac6FA$ FMCAD 2021: CALL FOR PARTICIPATION International Conference on Formal Methods in Computer-Aided Design (FMCAD) https://urldefense.com/v3/__https://www.fmcad.org/FMCAD21__;!!IBzWLUs!F5lMj8VnZ_llBX8LWX3DOLs6vT3Dm_WiDrwH_DePCcgr1oRrhoaXbFx-pSvk2yKYPLMb5Ze8syecDg$ FMCAD Tutorial Day: October 19, 2021 FMCAD Regular Program: October 20-22, 2021 Co-Chairs: Ruzica Piskac and Michael Whalen CONFERENCE SCOPE FMCAD'21 is the 21st in a series of conferences on the theory and applications of formal methods in hardware and system verification. FMCAD provides a leading forum to researchers in academia and industry for presenting and discussing ground-breaking methods, technologies, theoretical results, and tools for reasoning formally about computing systems. FMCAD covers formal aspects of computer-aided system design including verification, specification, synthesis, and testing. TECHNICAL PROGRAM The program comprises presentations of 30 papers, 4 tutorials and 3 keynotes, a student forum, and a sponsors? night: https://urldefense.com/v3/__https://easychair.org/smart-program/FMCAD2021/__;!!IBzWLUs!F5lMj8VnZ_llBX8LWX3DOLs6vT3Dm_WiDrwH_DePCcgr1oRrhoaXbFx-pSvk2yKYPLMb5Zdo7h4Wyg$ Short presentations will be given on Zoom and longer versions of the talks will be made available for download. KEYNOTES Barbara Liskov ?From Viewstamped Replication to Blockchains? Seny Kamara ?Algorithms for the People? Peter Sewell ?Engineering with Full-scale Formal Architecture: Morello, CHERI, Armv8-A, and RISC-V? TUTORIALS Frits Vaandrager ?Active Automata Learning: from L* to L#? Viktor Kun?ak ?Stainless Verification System Tutorial? Rayna Dimitrova ?Reactive Synthesis Beyond Realizability? Matteo Maffei ?Formal Methods for the Security Analysis of Smart Contracts? SPONSORS Financial support: Amazon Web Services, Amazon Prime Video, Intel, Cadence, Centaur, Synopsys, Galois, Novi. Technical Co-Sponsor: IEEE Supported by the FMCAD Association (https://urldefense.com/v3/__https://fmcad.or.at__;!!IBzWLUs!F5lMj8VnZ_llBX8LWX3DOLs6vT3Dm_WiDrwH_DePCcgr1oRrhoaXbFx-pSvk2yKYPLMb5Zd4ZKR5TA$ ) -------------- next part -------------- An HTML attachment was scrubbed... URL: From jonathan.protzenko at gmail.com Tue Oct 5 16:44:58 2021 From: jonathan.protzenko at gmail.com (Jonathan Protzenko) Date: Tue, 5 Oct 2021 13:44:58 -0700 Subject: [TYPES/announce] Second and Final Call for Presentations: PriSC 2022 @ POPL 2022 Message-ID: All details are on the PriSC site . ================================================ Call for Presentations: PriSC 2022 @ POPL 2022 ================================================ The emerging field of secure compilation aims to preserve security properties of programs when they have been compiled to low-level languages such as assembly, where high-level abstractions don?t exist, and unsafe, unexpected interactions with libraries, other programs, the operating system and even the hardware are possible. For unsafe source languages like C, secure compilation requires careful handling of undefined source-language behavior (like buffer overflows and double frees). Formally, secure compilation aims to protect high-level language abstractions in compiled code, even against adversarial low-level contexts, thus enabling sound reasoning about security in the source language. A complementary goal is to keep the compiled code efficient, often leveraging new hardware security features and advances in compiler design. Other necessary components are identifying and formalizing properties that secure compilers must possess, devising efficient security mechanisms (both software and hardware), and developing effective verification and proof techniques. Research in the field thus puts together advances in compiler design, programming languages, systems security, verification, and computer architecture. 6th Workshop on Principles of Secure Compilation (PriSC 2022) ============================================================= The Workshop on Principles of Secure Compilation (PriSC) is a relatively new, informal 1-day workshop without any proceedings. The goal is to bring together researchers interested in secure compilation and to identify interesting research directions and open challenges. The 6th edition of PriSC will be held on January 22, together with the ACM SIGPLAN Symposium on Principles of Programming Languages (POPL), 2022. We hope to hold the workshop in person with for support for dial-in attendees. Keynote ======= This year's keynote will be "BPF and Spectre: Mitigating transient execution attacks", by Piotr Krysiuk (Symantec, Threat Hunter Team), Benedict Schl?ter (Ruhr University Bochum), Daniel Borkmann (Isovalent, co-maintainer eBPF). Important Dates =============== * Thu 28 Oct 2021: Submission Deadline * Thu 18 Nov 2021: Acceptance Notification * Sat 22 Jan 2022: Workshop Presentation Proposals and Attending the Workshop ================================================= Anyone interested in presenting at the workshop should submit an extended abstract (up to 2 pages, details below) covering past, ongoing, or future work. Any topic that could be of interest to secure compilation is in scope. Secure compilation should be interpreted very broadly to include any work in security, programming languages, architecture, systems or their combination that can be leveraged to preserve security properties of programs when they are compiled or to eliminate low-level vulnerabilities. Presentations that provide a useful outside view or challenge the community are also welcome. This includes presentations on new attack vectors such as microarchitectural side-channels, whose defenses could benefit from compiler techniques. Specific topics of interest include but are not limited to: * Attacker models for secure compiler chains. * Secure compiler properties: fully abstract compilation and similar properties, memory safety, control-flow integrity, preservation of safety, information flow and other (hyper-)properties against adversarial contexts, secure multi-language interoperability. * Secure interaction between different programming languages: foreign function interfaces, gradual types, securely combining different memory management strategies. * Enforcement mechanisms and low-level security primitives: static checking, program verification, typed assembly languages, reference monitoring, program rewriting, software-based isolation/hiding techniques (SFI, crypto-based, randomization-based, OS/hypervisor-based), security-oriented architectural features such as Intel?s SGX, MPX and MPK, capability machines, side-channel defenses, object capabilities. * Experimental evaluation and applications of secure compilers. * Proof methods relevant to compilation: (bi)simulation, logical relations, game semantics, trace semantics, multi-language semantics, embedded interpreters. * Formal verification of secure compilation chains (protection mechanisms, compilers, linkers, loaders), machine-checked proofs, translation validation, property-based testing. Guidelines for Submitting Extended Abstracts ============================================ Extended abstracts should be submitted in PDF format and not exceed 2 pages (references not including). They should be formatted in two-column layout, 10pt font, and be printable on A4 and US Letter sized paper. We recommend using the new acmart LaTeX style in sigplan mode. Submissions are not anonymous and should provide sufficient detail to be assessed by the program committee. Presentation at the workshop does not preclude publication elsewhere. Submission website: https://urldefense.com/v3/__https://prisc22.hotcrp.com/__;!!IBzWLUs!HrR2J0bNejBj52rX9pT3mF5H7lMeqTqgHIP10mKhdRM_szvd0cgg8xVkr8ZmupffLn2I58D4F7xpqA$ Program Committee ================= Owen Arden, UC Santa Cruz Arthur Azevedo de Amorim, Carnegie Mellon University Iulia Bastys, Chalmers University of Technology Roberto Blanco, Max Planck Institute for Security and Privacy Tegan Brennan, Stevens Institute of Technology Matteo Busi, Universit? di Pisa - Dipartimento di Informatica Sunjay Cauligi, University of California at San Diego Marco Guarnieri, IMDEA Software Institute (co-chair) Arma?l Gu?neau, Aarhus University Johannes Kinder, Bundeswehr University Munich Adrien Koutsos, INRIA Paris Elisavet Kozyri, Arctic University of Norway Scott Moore, Galois Toby Murray, University of Melbourne Andrew C. Myers, Cornell University David Pichardie, Facebook Jonathan Protzenko, Microsoft Research (co-chair) Christine Rizkallah, UNSW Sydney Zhong Shao, Yale University ?ric Tanter, University of Chile Danfeng Zhang, Pennsylvania State University Contact and More Information ============================ You can find more information on the workshop website: https://urldefense.com/v3/__https://popl22.sigplan.org/home/prisc-2022__;!!IBzWLUs!HrR2J0bNejBj52rX9pT3mF5H7lMeqTqgHIP10mKhdRM_szvd0cgg8xVkr8ZmupffLn2I58BqsSplFg$ For questions please contact the workshop chairs, Jonathan Protzenko and Marco Guarnieri . From jonathan.protzenko at gmail.com Tue Oct 5 16:50:00 2021 From: jonathan.protzenko at gmail.com (Jonathan Protzenko) Date: Tue, 5 Oct 2021 13:50:00 -0700 Subject: [TYPES/announce] Second and Final Call for Submissions: Programming Languages and the Law (ProLaLa) Message-ID: <11b9ce48-5146-831f-341d-0980ed411d5f@gmail.com> ----------------------------------------------------------------------- ?? ProLaLa 2022 -- 1st Workshop on Programming Languages and the Law ?????????????????????? Sunday Jan 16th, 2022 ???????????????????????? Philadelphia, PA ???????????????????? co-located with POPL 2022 ----------------------------------------------------------------------- ??????????????????? (please forward to anyone who might be interested!) We are pleased to announce ProLaLa'22, a new workshop concerned with the intersection of PL (Programming Languages) techniques and the law. We are particularly concerned with the following topics: - language design for legal matters; - static analysis of legal texts; - program synthesis and repair for legal software components; - formal modeling of legal semantics; - non-standard logics in support of legal reasoning; - program verification for legal expert systems. If you have explored any of these areas, we encourage you to submit a short abstract. We are hoping to solidify around this workshop what we believe is a nascent community. As such, the workshop will be informal, and we strongly encourage you to submit ongoing or already-published work in the form of a brief 3-page submission for a long talk, or a 1-page submission for a short talk. Full details: https://urldefense.com/v3/__https://popl22.sigplan.org/home/prolala-2022*Call-for-submissions__;Iw!!IBzWLUs!Bs2L-C1HnQl25pyaFABPiJRlp1aWnEPBJpgYX2zCQHvCufNASLOWadSEVvEjPR7OFUKQziP_JsqpUg$ ### Venue ProLaLa will be colocated with POPL'22. If POPL'22 goes virtual, we will be virtual too. If POPL'22 happens in-person, we will support hybrid (in-person and remote) participation. ### Submission details We accept two kinds of submissions. - Long talks: 3 pages excluding references - Short talks: 1 page excluding references No formatting requirements. We recommend using SIGPLAN's two-column LaTeX format if possible. Submission site: https://urldefense.com/v3/__https://prolala22.hotcrp.com/__;!!IBzWLUs!Bs2L-C1HnQl25pyaFABPiJRlp1aWnEPBJpgYX2zCQHvCufNASLOWadSEVvEjPR7OFUKQziP5BgVPIQ$ ### Important dates - Thu 28 Oct 2021: Submission deadline - Thu 11 Nov 2021: Notification of acceptance - Sun 16 Jan 2022: Workshop ## Program committee - Timos Antonopoulos, Yale University - Joaquin Arias, Universidad Polit?cnica de Madrid and IMDEA Software Institute, Spain - Shrutarshi Basu, Cornell University, USA - Nate Foster, Cornell University, USA - James Grimmelmann, Cornell University, USA - Sarah Lawsky (Co-Chair), Northwestern University, USA - Denis Merigoux, INRIA, France - Ruzica Piskac, Yale University, USA - Jonathan Protzenko (Co-Chair), Microsoft Research, USA - Giovanni Sartor, University of Bologna, Italy - Ken Satoh, National Institute of Informatics, Japan - Kanae Tsushima, National Institute of Informatics, Japan - Meng Weng Wong, Singapore Management University, Singapore From andreeac at comp.nus.edu.sg Wed Oct 6 03:54:55 2021 From: andreeac at comp.nus.edu.sg (Andreea Costea) Date: Wed, 06 Oct 2021 15:54:55 +0800 Subject: [TYPES/announce] OOPSLA 2022 Round 1 - final call for papers Message-ID: Round 1 paper submission deadline due on ** October 12th, 2021 AoE ** ======================================================================== PACMPL Issue OOPSLA 2022 Call for Papers OOPSLA 2022 will be held as part of The ACM Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH'22) November 14-19, 2022, Auckland, New Zealand https://urldefense.com/v3/__https://2022.splashcon.org/track/splash-2022-oopsla__;!!IBzWLUs!FniHoltYeU0tMN6vQYREw0xEAW34raM0JKRG990kUFfAAWY64B1uIUTJfyuC2xjG_3ncSsu6k9sd9Q$ ======================================================================== ### Important dates ROUND 1: Submission deadline: Tue Oct 12, 2021 Author response: Tue Nov 30 - Fri Dec 3 Early Notification: Thu Dec 16 Submission of Revisions: Fri Feb 11 Final Notification: Fri Feb 25 Camera ready: Fri Mar 11 ROUND 2: Submission deadline: Fri Apr 15, 2022 Author response: Sun Jun 12 - Wed Jun 15 Early Notification: Thu Jun 30 Submission of Revisions: Mon Aug 15 Final Notification: Thu Sep 1 Camera ready: Fri Sep 16 Authors of papers published in PACMPL(OOPSLA) will be invited to present their work at the SPLASH conference. In person attendance is not required, SPLASH will provide remote presentation options. ### Scope The OOPSLA issue of the Proceedings of the ACM on Programming Languages (PACMPL) welcomes papers focusing on all practical and theoretical investigations of programming languages, systems and environments. Papers may target any stage of software development, including requirements, modeling, prototyping, design, implementation, generation, analysis, verification, testing, evaluation, maintenance, and reuse of software systems. Contributions may include the development of new tools, techniques, principles, and evaluations. ### Review Process [new this year] PACMPL(OOPSLA) has two _rounds_ of reviewing. The final outcome of each round can be one of Accept, Revise or Reject. *Accept*: Accepted papers will appear at the next PACMPL(OOPSLA). *Revise*: Papers in this category are invited to submit a revision to the _next round_ of submissions with a specific set of expectations to be met. When authors resubmit, they should clearly explain how the revisions address the comments of the reviewers. The revised paper will be re-evaluated, and either accepted or rejected. Resubmitted papers will retain the same reviewers throughout the process. *Reject*: Rejected papers will not be included at the next PACMPL(OOPSLA). Papers in this category are not guaranteed a review if resubmitted less than one year from the date of original submission. A paper will be judged to be a _resubmission_ if it is substantially similar to the original submission. The judgment that a paper is a resubmission of the same work is at the discretion of the Chairs. Each _round_ of reviewing consists of two _phases_. The first phase evaluates the papers and results in an early notification of Reject, Revise, or Conditional Accept. During the first phase, authors will be able to read their reviews and respond to them. The second phase is restricted to conditionally accepted papers. Authors must make a set of mandatory revisions. The second phase assesses whether the required revisions have been addressed. The outcome can be Accept, Revise or Reject. ### Submissions Submitted papers must be at most **23 pages** in 10 point font. There is no page limit on references. No appendices are allowed on the main paper, instead authors can upload supplementary material with no page or content restrictions, but reviewers may choose to ignore it. Submissions must adhere to the "ACM Small" template available from [the ACM](https://urldefense.com/v3/__http://www.acm.org/publications/authors/submissions__;!!IBzWLUs!FniHoltYeU0tMN6vQYREw0xEAW34raM0JKRG990kUFfAAWY64B1uIUTJfyuC2xjG_3ncSstuai64OA$ ). Papers are expected to use author-year citations. Author-year citations may be used as either a noun phrase, such as "The lambda calculus was originally conceived by Church (1932)", or a parenthetic phase, such as "The lambda calculus (Church 1932) was intended as a foundation for mathematics". PACMPL uses double-blind reviewing. Authors' identities are only revealed if a paper is accepted. Papers must 1. omit author names and institutions, 2. use the third person when referencing your work, 3. anonymise supplementary material. Nothing should be done in the name of anonymity that weakens the submission; see the DBR FAQ. When in doubt, contact the Review Committee Chairs. Papers must describe unpublished work that is not currently submitted for publication elsewhere as described by [SIGPLAN's Republication Policy](https://urldefense.com/v3/__http://www.sigplan.org/Resources/Policies/Republication__;!!IBzWLUs!FniHoltYeU0tMN6vQYREw0xEAW34raM0JKRG990kUFfAAWY64B1uIUTJfyuC2xjG_3ncSstCe1txEA$ ). Submitters should also be aware of [ACM's Policy and Procedures on Plagiarism](https://urldefense.com/v3/__http://www.acm.org/publications/policies/plagiarism_policy__;!!IBzWLUs!FniHoltYeU0tMN6vQYREw0xEAW34raM0JKRG990kUFfAAWY64B1uIUTJfyuC2xjG_3ncSsu0WDpa9A$ ). Submissions are expected to comply with the [ACM Policies for Authorship](https://urldefense.com/v3/__https://www.acm.org/publications/authors/information-for-authors__;!!IBzWLUs!FniHoltYeU0tMN6vQYREw0xEAW34raM0JKRG990kUFfAAWY64B1uIUTJfyuC2xjG_3ncSsubtQ9mhQ$ ). ### Artifacts Authors should indicate with their initial submission if an artifact exists, describe its nature and limitations, and indicate if it will be submitted for evaluation. Accepted papers that fail to provide an artifact will be requested to explain the reason they cannot support replication. It is understood that some papers have no artifacts. ### Publication PACMPL is a Gold Open Access journal, all papers will be freely available to the public. Authors can voluntarily cover the article processing charge ($400), but payment is not required. The official publication date is the date the journal are made available in the ACM Digital Library. The journal issue and associated papers may be published up to two weeks prior to the first day of the conference. ### Review Committee Chairs: Amal Ahmed (Northeastern University) Jan Vitek (Northeastern University and Czech Technical University) ### Additional Information Consult FAQ in Call for Papers at: https://urldefense.com/v3/__https://2022.splashcon.org/track/splash-2022-oopsla__;!!IBzWLUs!FniHoltYeU0tMN6vQYREw0xEAW34raM0JKRG990kUFfAAWY64B1uIUTJfyuC2xjG_3ncSsu6k9sd9Q$ From jsiek at indiana.edu Tue Oct 5 09:47:51 2021 From: jsiek at indiana.edu (Siek, Jeremy) Date: Tue, 5 Oct 2021 13:47:51 +0000 Subject: [TYPES/announce] Final CFP: Workshop on Gradual Typing 2022 Message-ID: Second ACM SIGPLAN Workshop on Gradual Typing (WGT) to be held on January 16th, 2022 in Philadelphia co-hosted with POPL. Important dates --------------- * Submission deadline: Monday, October the 18th, 2021 * Notification: Sunday, November the 28th, 2021 * Workshop: Sunday, January the 16th, 2022 Description ----------- The ACM SIGPLAN Workshop on Gradual Typing is a venue for disseminating the latest results on the integration of compile-time and run-time checking of program invariants, such as the integration of static and dynamic type checking. The workshop serves as an incubator for ideas, open problems, and manuscripts: it is a place where the community can meet, discuss, and give each other constructive feedback. The workshop will encourage participation from researchers in both academia and industry, drawing people from the many active projects on both sides of the aisle. Criteria and proceedings ------------------------ We expect the workshop to be informal since its goals are to exchange information, foster collaboration, and establish common ground. This is why not only new results, but also unfinished work with stimulating ideas, or visionary work proposing new research tracks will be welcome. The Program Committee will thus prioritize novelty and timeliness over presentation quality. We also expect authors to use the workshop as a testbed for their work before submitting a polished version of it to mainstream ACM conferences. Thus, the proceedings will not be a formal or archival publication but they will be made available online right before the workshop. Submissions ----------- Submission site: https://urldefense.com/v3/__http://wgt22.hotcrp.com__;!!IBzWLUs!HqN0wNKF-xZr74__-lfFKI_39Xp2kMsnHPtEWnQR8-8DbM3Pm_wm2POAzi3GiN_IJxtcbnnzggDAVQ$ Authors are invited to submit unpublished manuscripts using the site above. Submissions must be in pdf and have no more than 25 pages of text, excluding bibliography, using the new ACM Proceedings format for PACMPL. However, we hope to receive also much shorter submissions typically of 5-10 pages. Why such a stark difference in lengths? We think that 5-10 pages are all you need to expose your unbaked topic or your brilliant idea you want present at the workshop, but we do not want authors of a polished work to be obliged to cut their article just for presenting their results at WGT. PACMPL templates for Microsoft Word and LaTeX can be found at the [SIGPLAN author information page](https://urldefense.com/v3/__http://www.sigplan.org/authorInformation.htm__;!!IBzWLUs!HqN0wNKF-xZr74__-lfFKI_39Xp2kMsnHPtEWnQR8-8DbM3Pm_wm2POAzi3GiN_IJxtcbnkudOtSVw$ ). In particular, authors using LaTeX should use the acmart-pacmpl-template.tex file (with the acmsmall option). Submitted papers must adhere to the [SIGPLAN Republication Policy](https://urldefense.com/v3/__http://www.sigplan.org/republicationpolicy.htm__;!!IBzWLUs!HqN0wNKF-xZr74__-lfFKI_39Xp2kMsnHPtEWnQR8-8DbM3Pm_wm2POAzi3GiN_IJxtcbnmxPhytHg$ ) and the [ACM Policy on Plagiarism](https://urldefense.com/v3/__https://www.acm.org/publications/policies/plagiarism-overview__;!!IBzWLUs!HqN0wNKF-xZr74__-lfFKI_39Xp2kMsnHPtEWnQR8-8DbM3Pm_wm2POAzi3GiN_IJxtcbnlQCiggXA$ ). Concurrent submissions to other conferences, workshops, journals, or similar forums of publication are not allowed. Program Committee ----------------- * Giuseppe Castagna (co-organizer, CNRS and Universit? de Paris, France) * Dominique Devriese (Vrije University Brussel, Belgium) * Jana Dunfield (Queen's University, Canada) * Atsushi Igarashi (Kyoto University, Japan) * Limin Jia (Carnegie Melon University, USA) * Andrew Kennedy (Facebook, UK) * Bruno Oliveira (University of Hong Kong, HK) * Cyrus Omar (University Michigan, USA) * Jeremy G. Siek (co-organizer, Indiana University, USA) * Peter Thiemann (University of Freiburg, Germany) * Mat?as Toro (University of Chile, Chile) * David Van Horn (University of Maryland, USA) -------------- next part -------------- An HTML attachment was scrubbed... URL: From balzers at cs.cmu.edu Tue Oct 5 22:32:01 2021 From: balzers at cs.cmu.edu (Stephanie Balzer) Date: Tue, 5 Oct 2021 22:32:01 -0400 Subject: [TYPES/announce] PLMW@POPL 2022: Call for Application Message-ID: CALL FOR APPLICATIONS (**DEADLINE: November 1 AoE**) ACM SIGPLAN Programming Languages Mentoring Workshop, Philadelphia, Pennsylvania Tuesday, January 18, 2022 PLMW is co-located with POPL 2022, which takes place ?in person? in Philadelphia. PLMW will feature lightweight options for ?remote participation? (details below). Web page: https://urldefense.com/v3/__https://popl22.sigplan.org/home/PLMW-2022__;!!IBzWLUs!FmCz4zv9min_Rkyytjt2SFBUKEl4fa7tvwU2qdhxNL47bFbAdKsLz2D_rXqJeI2uI4figIzkEPjv0g$ After the success of the first ten Programming Languages Mentoring Workshops at POPL 2012-2021, we are announcing the 11th SIGPLAN Programming Languages Mentoring Workshop (PLMW), co-located with the virtual POPL 2022 and organized by Stephanie Balzer, Paul Downen, Robbert Krebbers, and Christine Rizkallah. The purpose of this mentoring workshop is to encourage graduate students and senior undergraduate students to pursue careers in programming language research. This workshop will bring together world leaders in programming languages research and teaching from academia and industry to provide (a) technical sessions on cutting-edge PL research and (b) mentoring sessions on how to prepare for a research career. The workshop will help students imagine how they might contribute to our research community. We especially encourage women and underrepresented minority students, and people with disabilities to attend PLMW. This workshop is part of the activities surrounding POPL, the Symposium on Principles of Programming Languages, and takes place the day before the main conference. One goal of the workshop is to make the POPL conference more accessible to newcomers. We hope that participants will stay through the entire conference. Because physical travel to the workshop location this year may be more difficult for some, there is also an option to attend PLMW remotely. Remote participants of PLMW will be able to view online videos of the workshop talks, access the PLMW Slack channel, and sign up for virtual mentoring sessions with experienced researchers. A number of sponsors (listed below) have generously donated scholarship funds for qualified students to attend PLMW. These scholarships can cover expenses (airfare, hotel, and registration fees) for attendance at both the workshop and the POPL conference. Students attending this year will get one year free student membership of SIGPLAN, unless they prefer to opt out during their application. The workshop registration is open to all. Students with alternative sources of funding are welcome as well. APPLICATION for PLMW: The application can be accessed at the following URL: https://urldefense.com/v3/__https://forms.gle/tsQhsUyB2W4c6ps36__;!!IBzWLUs!FmCz4zv9min_Rkyytjt2SFBUKEl4fa7tvwU2qdhxNL47bFbAdKsLz2D_rXqJeI2uI4figIzfIv-w3g$ The deadline for full consideration of funding is Monday, November 1. Please note on the application form whether you intend to attend PLMW in-person, or remotely. Confirmed sponsors (so far): NSF ACM SIGPLAN Jane Street Certora Correct Computation -------------- next part -------------- An HTML attachment was scrubbed... URL: From ralf.kuesters at sec.uni-stuttgart.de Wed Oct 6 06:12:43 2021 From: ralf.kuesters at sec.uni-stuttgart.de (Ralf Kuesters) Date: Wed, 6 Oct 2021 12:12:43 +0200 Subject: [TYPES/announce] Postdoc Position in Formal Verification Message-ID: <00799145-128b-11bd-064d-138c73d67c9e@sec.uni-stuttgart.de> The Institute of Information Security at University of Stuttgart offers a fully-funded Postdoc position in formal verification The successful candidate is expected to work on tool-supported formal verification of security-critical systems and security protocols. The position is available immediately with an internationally competitive salary (German public salary scale TV-L E13 or TV-L E14, depending on the candidate's qualification, ranging from about 4.600 Euro to 6.200 Euro monthly gross salary). The appointment period follows the German Wissenschaftszeitvertragsgesetz (WissZeitVg), ranging from one year to up to six years. The Institute of Information Security offers a creative international environment for top-level international research in Germany's high-tech region. The successful candidate should have a Ph.D. (or should be very close to completion thereof) in Computer Science, Mathematics, Information Security, or a related field. We value strong analytical skills and - solid knowledge of logic, proofs and/or formal verification techniques (Theorem Proving, Type Checking, etc.), - solid programming experience. Knowledge in security is not required, but a plus. Knowledge of German is not required. The University of Stuttgart is an equal opportunity employer. Applications from women are strongly encouraged. Severely challenged persons will be given preference in case of equal qualifications. To apply, please send email with subject "Application: Postdoc Position Formal Verification" and a single PDF file containing the following documents to ralf.kuesters at sec.uni-stuttgart.de: * Cover letter (explaining your scientific background and your motivation to apply) * Curriculum Vitae * List of publications * Copies of transcripts and certificates (Bachelor, Master, PhD) * Names of at least two references The deadline for applications is October 31st, 2021. Late applications will be considered until the position is filled. See https://urldefense.com/v3/__https://sec.uni-stuttgart.de/__;!!IBzWLUs!Go5GoU6GW0_u-STe-GsXubd-ARSgxsdKHQlSHfAeOTwWGrUX-iBX4zVsts8ItYoc7loZnIPpW48uow$ for more information about the institute. See https://urldefense.com/v3/__https://www.sec.uni-stuttgart.de/institute/job-openings/__;!!IBzWLUs!Go5GoU6GW0_u-STe-GsXubd-ARSgxsdKHQlSHfAeOTwWGrUX-iBX4zVsts8ItYoc7loZnIN7yBIyHw$ for the official job announcement. For further information please contact: Prof. Dr. Ralf K?sters, ralf.kuesters at sec.uni-stuttgart.de. -- Prof. Dr. Ralf K?sters Institute of Information Security - SEC University of Stuttgart Universit?tsstra?e 38 D-70569 Stuttgart Germany https://urldefense.com/v3/__https://sec.uni-stuttgart.de__;!!IBzWLUs!Go5GoU6GW0_u-STe-GsXubd-ARSgxsdKHQlSHfAeOTwWGrUX-iBX4zVsts8ItYoc7loZnIP-YlExvA$ Phone: +49 (0) 711 685 88283 From dbz5017 at psu.edu Wed Oct 6 09:51:13 2021 From: dbz5017 at psu.edu (Zhang, Danfeng) Date: Wed, 6 Oct 2021 13:51:13 +0000 Subject: [TYPES/announce] CFP: Workshop on Programming Languages and Analysis for Security (PLAS 2021) Message-ID: -------------------------------------------------------------------------- PLAS 2021 Call for Papers 16th Workshop on Programming Languages and Analysis for Security (PLAS 2021) https://urldefense.com/v3/__https://plas21.software.imdea.org__;!!IBzWLUs!AmIX5jm3aEM8FzljTL7H7CILLSk2g2jt6fdStTREyUc0Dk2cW61Lwi2LYEeRIaRXFKSwz-sxsOj93Q$ Virtual Event December 7, 2021 -------------------------------------------------------------------------- Important Dates Paper submission: October 22, 2021 (AoE) Author notification: November 12, 2021 (AoE) Workshop date: December 7, 2021 -------------------------------------------------------------------------- PLAS provides a forum for exploring and evaluating the use of programming language and program analysis techniques for promoting security in the complete range of software systems, from compilers to machine-learned models and smart contracts. The workshop encourages proposals of new, speculative ideas, evaluations of new or known techniques in practical settings, and discussions of emerging threats and problems. We also host position papers that are radical, forward-looking, and lead to lively and insightful discussions influential to the future research at the intersection of programming languages and security. The scope of PLAS includes, but is not limited to: - Language-based techniques for detecting and eliminating side-channel vulnerabilities - Programming language techniques and verification applied to security in other domains (e.g. adversarial learning and smart contracts) - Software isolation techniques (e.g., SFI and sandboxing) and compiler-based hardening techniques (e.g, secure compilation). - Compiler-based security mechanisms (e.g. security type systems) or runtime-based security mechanisms (e.g. inline reference monitors) - Techniques for discovering and detecting security vulnerabilities, including program (binary) analysis and fuzzing- Automated introduction and/or verification of security enforcement mechanisms - Language-based verification of security properties in software, including verification of cryptographic protocols - Specifying and enforcing security policies for information flow and access control - Model-driven approaches to security - Security concerns for Web programming languages - Language design for security in new domains such as cloud computing and IoT - Applications, case studies, and implementations of these techniques -------------------------------------------------------------------------- Call for Papers We invite both short papers and long papers. For short papers, we especially encourage the submission of position papers that are likely to generate lively discussion as well as short papers covering ongoing and future work. - Short papers should be at most 2 pages long, plus as many pages as needed for references. Papers that present radical, open-ended and forward-looking ideas are particularly welcome in this category. Authors submitting papers in this category must prepend the phrase "Short Paper:" to the title of the submitted paper. - There is no page limit on long papers. Papers in this category are expected to have relatively mature content. Papers that present promising preliminary and exploratory work, or recently published work are particularly welcome in this category. Long papers may receive longer talk slots at the workshop than short papers, depending on the number of accepted submissions. *NEW THIS YEAR* The workshop has no published workshop proceedings and there is no restriction on paper format other than the page limits as stated above. Presenting a paper (either short or long) at the workshop should not preclude submission to or publication in other venues that are before, concurrent, or after the workshop. Papers presented at the workshop will be made available to workshop participants only. -------------------------------------------------------------------------- Program Committee Owen Arden (UC Santa Cruz) Aslan Askarov (Aarhus University) Stefano Calzavara (Universit? Ca? Foscari Venezia) Dana Drachsler Cohen (Technion) Klaus von Gleissenthal (Vrije Universiteit Amsterdam) Marco Guarnieri (IMDEA Software, Co-Chair) Andrew Hirsch (Max Planck Institute for Software Systems) Toby Murray (University of Melbourne) Joe Near (University of Vermont) Marco Patrignani (CISPA) Hern?n Ponce de Le?n (Bundeswehr University Munich) Jian Xiang (Harvard University) Danfeng Zhang (Penn State University, Co-Chair) -------------------------------------------------------------------------- From Sam.Lindley at ed.ac.uk Thu Oct 7 07:39:58 2021 From: Sam.Lindley at ed.ac.uk (Sam Lindley) Date: Thu, 7 Oct 2021 12:39:58 +0100 Subject: [TYPES/announce] post-doctoral research position - Effect Handler Oriented Programming - Edinburgh Message-ID: Hi, I have an opening for a post-doctoral research position at The University of Edinburgh on Effect Handler Oriented Programming (EHOP) funded by a UKRI Future Leaders Fellowship. Candidates should have a background in programming languages with experience of functional programming, formal semantics, and type theory. Some experience with effect handlers and algebraic effects is desirable, but not essential. The role will involve theory (e.g. developing and reasoning about novel effect type systems and algebraic theories) and practice (e.g. designing, implementing, and evaluating implementations and applications of effect handlers), and ample opportunity to engage with our project partners. The position is for three years starting in February 2022. The EHOP project: https://urldefense.com/v3/__https://effect-handlers.org/__;!!IBzWLUs!Dm1iM7rXJIJBqX3-JH6Wh-FEcOu_LoSe-hQMbFUkuDliNK_hfpgEud4SoZhct1hJnhJJCnmr9ZN2nA$ Job application details: https://urldefense.com/v3/__https://elxw.fa.em3.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1001/job/2087/__;!!IBzWLUs!Dm1iM7rXJIJBqX3-JH6Wh-FEcOu_LoSe-hQMbFUkuDliNK_hfpgEud4SoZhct1hJnhJJCnkafCpvmA$ If you are interested then feel free to contact me (application deadline: 1 November 2021). Sam The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. Is e buidheann carthannais a th? ann an Oilthigh Dh?n ?ideann, cl?raichte an Alba, ?ireamh cl?raidh SC005336. From adamc at csail.mit.edu Thu Oct 7 08:10:08 2021 From: adamc at csail.mit.edu (Adam Chlipala) Date: Thu, 7 Oct 2021 08:10:08 -0400 Subject: [TYPES/announce] Announcing the POPL 2022 virtual workshop Message-ID: POPL 2022 is planned to occur in-person, but there will be an associated virtual workshop on January 27th and 28th, 2022!? We are trying to maintain the momentum of inclusive virtual conferences while taking advantage of the opportunity (fingers crossed) for a strong in-person component.? The virtual conference will be focused solely on interactive activities, not talk-watching (as main-conference talk videos will be available publicly a few days prior), and, as virtualization chair, I'm writing to solicit your ideas on how to use the time. Please e-mail your ideas for scheduled activities to popl22-virtual at mit.edu.? You may propose activities you would run yourself, or you may suggest activities that would require other people you don't know very well, and we organizers can try to convince them to participate, if your idea is selected.? (E.g., feel free to suggest "interview with Elon Musk," and we can try to decide if that's appropriate and feasible. :]) Here are a few ideas of kinds of activities: - A panel bringing together experts on a popular topic, to answer live audience questions and discuss with each other - An "ask me anything" (AMA) session with a specific member of the POPL community - A particular format of social or networking event, maybe based on a specific game or different virtual-space service online - Tool demos and tutorials - Activities designed to further our community's strategy for mitigating climate change or improving diversity, equity, and inclusion We are especially interested in scheduling events across a wide range of time bands, to accommodate participants from many countries, so please include thoughts on timing in proposals.? We expect to provide a shared platform supporting standard video conferencing, from small groups up to hundreds of participants (most with video recording off), so there is no need to propose case-by-case solutions there (though there is room for a few sessions using fun alternative communication apps). Our expectation is that there will be some explicit registration process to join the workshop, but the fee will be no more than $10 per person.? We will also provide some kind of "bulletin board" where people can post their interest in smaller-group interactions (for instance, chats with the authors of particular POPL 2022 papers, or informal meetings with potential employers) and facilitate scheduling times to meet together on the shared workshop platform.? Other logistical details to follow. POPL 2022 Virtual Workshop selection committee, Rajeev Alur Adam Chlipala Youyou Cong Hongseok Yang Neringa Young -------------- next part -------------- An HTML attachment was scrubbed... URL: From d.pym at ucl.ac.uk Fri Oct 8 10:57:00 2021 From: d.pym at ucl.ac.uk (Pym, David) Date: Fri, 8 Oct 2021 14:57:00 +0000 Subject: [TYPES/announce] PhD position in Logic & Security at UCL, London Message-ID: <159327D5-5BC8-49DA-8DED-7116CA019782@ucl.ac.uk> [Apologies for cross-postings. Please share widely.] I am looking for a PhD student in logic, in the PPLV group (https://urldefense.com/v3/__http://pplv.cs.ucl.ac.uk/welcome/__;!!IBzWLUs!CsC34fefoIhsQh-xn7O_uYA1zN6P0fbOMn9Twlob-KKq7nf0mICJ6Na7UAiEZJb2le1n7qoddIkrgQ$ ) at UCL (https://urldefense.com/v3/__http://www.ucl.ac.uk__;!!IBzWLUs!CsC34fefoIhsQh-xn7O_uYA1zN6P0fbOMn9Twlob-KKq7nf0mICJ6Na7UAiEZJb2le1n7qpWI7KfmA$ ) in London. The project is to work on logic as basis for system modelling. Examples of questions to be addressed include: - Logical modelling of the structure of systems ecosystems, compositional structure, with particular reference substitution, and local reasoning (in the sense of Separation Logic and related systems). - Policy design for decentralized, distributed systems. - Logical modelling of agents? reasoning about decentralized, distributed systems. The logical systems of interest as a basis for this work are likely to include dynamic, epistemic, deontic, and doxastic approaches, with case studies in security and policy modelling. I would expect the project to require both theoretical work in logic and more applied work in modelling, with a particular focus on systems security models and security policy models. The PPLV group provides an outsanding environment in which to study logic and UCL?s information security group, the Science, Technology, Engineering and Public Policy Department, and the Security and Crime Science Department provide an excellemnt environment for studying security. We have excellent connections to logicians and security researchers across UCL, London, and the wider world. The studentship will be part of UCL?s Centre for Doctoral Training (CDT) in Cybersecurity: https://urldefense.com/v3/__https://www.ucl.ac.uk/cybersecurity-cdt/__;!!IBzWLUs!CsC34fefoIhsQh-xn7O_uYA1zN6P0fbOMn9Twlob-KKq7nf0mICJ6Na7UAiEZJb2le1n7qrZh0q1Uw$ and https://urldefense.com/v3/__https://www.ucl.ac.uk/cybersecurity-cdt/study-us/project-proposals__;!!IBzWLUs!CsC34fefoIhsQh-xn7O_uYA1zN6P0fbOMn9Twlob-KKq7nf0mICJ6Na7UAiEZJb2le1n7qo5tP00Gg$ , where advice on how to apply may be found. The CDT requires that all students engage in an advanced interdisciplinary programme in security during their first year. This programme provides an excellent context for students? specific research projects. Although most of the CDT?s funding is for UK nationals, international candidates can also be considered. Thank you, David ? Prof. David J. Pym Professor of Information, Logic, and Security Head of Programming Principles, Logic, and Verification University College London Honorary Research Fellow, Institute of Philosophy, University of London Director, UCL Centre for Doctoral Training in Cybersecurity Editor-in-Chief, OUP Journal of Cybersecurity d.pym at ucl.ac.uk https://urldefense.com/v3/__http://www.cs.ucl.ac.uk/people/D.Pym.html__;!!IBzWLUs!CsC34fefoIhsQh-xn7O_uYA1zN6P0fbOMn9Twlob-KKq7nf0mICJ6Na7UAiEZJb2le1n7qoyE63A4A$ https://urldefense.com/v3/__http://www.cs.ucl.ac.uk/staff/D.Pym/__;!!IBzWLUs!CsC34fefoIhsQh-xn7O_uYA1zN6P0fbOMn9Twlob-KKq7nf0mICJ6Na7UAiEZJb2le1n7qqPCIKcaQ$ Assistant: Julia Savage, j.savage at ucl.ac.uk, +44 (0)20 7679 0327 From julien.signoles at cea.fr Fri Oct 8 11:09:52 2021 From: julien.signoles at cea.fr (Julien Signoles) Date: Fri, 8 Oct 2021 17:09:52 +0200 Subject: [TYPES/announce] Multiple open positions (postdoc, PhD, intern) on runtime verification at CEA LIST, France Message-ID: <52320492-4538-be06-f701-2fa8d70241f1@cea.fr> Dear all, The Software Safety and Security Lab at CEA LIST (Universit? Paris-Saclay, France) is opening 2 postdoc, 1 PhD, and 1 internship positions in the area of runtime verification for code safety and security: - postdoc: Designing Compilation Techniques for Improving Efficiency of E-ACSL, a Runtime Assertion Checker for C Programs https://urldefense.com/v3/__https://julien-signoles.fr/positions/postdoc-eacsl.pdf__;!!IBzWLUs!B9GRrQR6wGNUJBXvjimIvEQZ9N34Cq_XoD5TebpFv3WY8wRpoT4tkJiDD9LJk1zMcpB7SpvatP9Vqg$ - postdoc: Control Flow Integrity for Remote Attestation https://urldefense.com/v3/__https://julien-signoles.fr/positions/postdoc-cfi.pdf__;!!IBzWLUs!B9GRrQR6wGNUJBXvjimIvEQZ9N34Cq_XoD5TebpFv3WY8wRpoT4tkJiDD9LJk1zMcpB7SpsYHpqk1Q$ - PhD: Outline Runtime Assertion Checking (possibly preceded by an internship on the same topic if needed) https://urldefense.com/v3/__https://julien-signoles.fr/positions/phd-outline-rac.pdf__;!!IBzWLUs!B9GRrQR6wGNUJBXvjimIvEQZ9N34Cq_XoD5TebpFv3WY8wRpoT4tkJiDD9LJk1zMcpB7Spv2nIknzQ$ - internship: C Function Synthesis from Axiomatic Definitions (in French, please ask for an English version) https://urldefense.com/v3/__https://julien-signoles.fr/positions/master_axiomatics.pdf__;!!IBzWLUs!B9GRrQR6wGNUJBXvjimIvEQZ9N34Cq_XoD5TebpFv3WY8wRpoT4tkJiDD9LJk1zMcpB7Spu2TQaAWA$ The candidates will: - solve challenging research problems; - implement their results in Frama-C, an industrial-strength open-source framework for analyses of C code; - evaluate their solutions on concrete benchmarks or/and use cases; - publish their results in international conferences and journals. Strong knowledge in at least one of the following areas is always appreciated: - programming: OCaml and C, semantics of programming languages, ... - formal verification: runtime verification, static analysis, ... - compilation: code generation, program transformation, type system, ... Interested applicants should send a CV and a motivation letter to Julien Signoles (julien dot signoles at cea dot fr) as soon as possible. Best regards, Julien Signoles -- Researcher-engineer | Scientific advisor CEA LIST, Software Safety and Security Lab | Department of Software and System Engineering Julien.Signoles at cea.fr |tel:(+33)1.69.08.00.18 From h.h.hansen at rug.nl Tue Oct 12 11:23:52 2021 From: h.h.hansen at rug.nl (Helle Hvid Hansen) Date: Tue, 12 Oct 2021 17:23:52 +0200 Subject: [TYPES/announce] Three PhD positions in Logic, Proof Theory and Coalgebra (Groningen) *29 Nov 2021 deadline* Message-ID: *********************************************************** * Three PhD positions in Logic, Proof Theory and Coalgebra * University of Groningen, Netherlands * Application deadline: 29 Nov 2021 / until filled *********************************************************** We invite excellent PhD candidates to join us at the Fundamental Computing group, Bernoulli Institute for Maths, CS and AI, University of Groningen. Founded in 1614, the University of Groningen is proud to number among the world?s top universities with a ?Top 100? ranking in the most recent ARWU Shanghai Ranking and the THE World University Rankings, among others. With the youngest population in the Netherlands (more than 20% international), Groningen is a lively, cosmopolitan city, as well as a very safe and eco-friendly city to live in, rated highly for quality of life, education, social care and healthcare. Three fully-funded 4-year PhD positions are available: * PhD Position in Non-Classical Logics through Proof Theory Supervisor: Revantha Ramanayake https://urldefense.com/v3/__https://www.rug.nl/about-ug/work-with-us/job-opportunities/?details=00347-02S0008PRP&cat=phd__;!!IBzWLUs!BurPY7B3IqRa-bpvTRgLYVlWH8nvo0FmMdPLkHhTwJ4Pm_fC_zUiqFEHFIwGXESXn5GI1fgInZsbYA$ * PhD Position in Logic, Coalgebra and Semantics of Computing Supervisor: Helle Hvid Hansen https://urldefense.com/v3/__https://www.rug.nl/about-ug/work-with-us/job-opportunities/?details=00347-02S0008PPP&cat=phd__;!!IBzWLUs!BurPY7B3IqRa-bpvTRgLYVlWH8nvo0FmMdPLkHhTwJ4Pm_fC_zUiqFEHFIwGXESXn5GI1fjBzfJB4w$ * PhD Position in Proof Theory of Modal Logics Supervisors: Helle Hvid Hansen and Revantha Ramanayake https://urldefense.com/v3/__https://www.rug.nl/about-ug/work-with-us/job-opportunities/?details=00347-02S0008PQP&cat=phd__;!!IBzWLUs!BurPY7B3IqRa-bpvTRgLYVlWH8nvo0FmMdPLkHhTwJ4Pm_fC_zUiqFEHFIwGXESXn5GI1fjT9lMoSQ$ Applications received *no later than 29 November 2021 (CET)* will receive full consideration but applications will be accepted until the positions are filled. Prospective candidates are encouraged to contact the respective supervisor to express their interest well in advance of the deadline. Best wishes, Helle and Revantha -- Helle Hvid Hansen Associate Professor Fundamental Computing group Bernoulli Institute for Maths, CS and AI University of Groningen From nclpltt at gmail.com Wed Oct 13 05:28:44 2021 From: nclpltt at gmail.com (Nicola Paoletti) Date: Wed, 13 Oct 2021 10:28:44 +0100 Subject: [TYPES/announce] ACM HSCC 2022 -- Last Call for Papers (deadline 29 October) Message-ID: ============================================================ ACM HSCC 2022 Call for Papers 25th ACM International Conference on Hybrid Systems: Computation and Control (HSCC 2022) Part of CPS-IoT Week 2022 May 4-6, 2022 Milan, Italy URL: https://urldefense.com/v3/__https://hscc.acm.org/2022/__;!!IBzWLUs!FiXxaj0qhud64X_VFaOWa1pTGfE7JUaGaLRHKMXroahvNZTKW3BDdP-c8r4Z6y0zHKXVtpXjGeLGlw$ ============================================================ Hybrid Systems: Computation and Control (HSCC) 2022 is the 25th in a series of conferences focusing on original research on concepts, tools, and techniques from computer science, control theory, and applied mathematics for the analysis and control of hybrid dynamical systems, with an emphasis on computational aspects. By drawing on strategies from computation and control, the hybrid systems field offers techniques that are applicable to both man-made cyber-physical systems (ranging from small robots to global infrastructure networks) and natural systems (ranging from biochemical networks to physiological models). Papers in the conference are expected to range over a wide spectrum of topics from theoretical results to practical considerations, and from academic research to industrial adoption. Topics of interest include, but are not limited to: - Mathematical foundations, computability and complexity - Analysis, verification, validation, and testing - Modeling paradigms and techniques - Design, synthesis, planning, and control - Programming and specification languages - Network science and network-based control - Security, privacy, and resilience for cyber-physical systems with focus on computation and control - Safe autonomy, Artificial intelligence and Machine learning in CPS - Software tools for the above topics - Applications and industrial case studies in: automotive, transportation, autonomous systems, avionics, energy and power, robotics, medical devices, manufacturing, systems and synthetic biology, models for the life sciences, and other related areas. Submission Guidelines ============================================================ HSCC invites submissions in two categories: (1) regular papers and (2) tool and case study papers. Submissions in *both* these categories can be either long (10 pages max, 9pt font, two-column ACM format) or short papers (6 pages max, 9pt font, two-column ACM format). We will employ a double-blind reviewing process and will have a rebuttal phase to provide authors with the opportunity to reply to the reviewers? concerns. Authors are asked to submit their paper using EasyChair: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=hscc2022__;!!IBzWLUs!FiXxaj0qhud64X_VFaOWa1pTGfE7JUaGaLRHKMXroahvNZTKW3BDdP-c8r4Z6y0zHKXVtpUJBnGw_g$ Important dates ============================================================ Submission deadline: *October 29, 2021 (AOE)* Tool/case study paper repeatability package submission deadline: November 1, 2021 (AOE) Rebuttal phase: December 15-17, 2021 Acceptance/rejection notifications: January 17, 2022 Posters/demos submission deadline: January 31, 2021 (AOE) Awards ============================================================ HSCC 2022 will confer four different awards: - *ACM SIGBED HSCC Best Paper Award* (all regular papers are eligible) - *HSCC Test-Of-Time Award* (call for nominations and guidelines TBA) - *Best Demo/Poster Award* - *Repeatability Evaluation Badge* Organization ============================================================ PC Chairs: Ezio Bartocci (TU Wien, Austria) Sylvie Putot (?cole Polytechnique, France) Repeatability Evaluation Chairs: Stanley Bak (Stony Brook University, USA) Aditya Zutshi (Galois Inc., USA) Publication Chair: Stefan Schupp (TU Wien, Austria) Publicity Chair: Nicola Paoletti (Royal Holloway, University of London, UK) Demo/Poster Chair: Chuchu Fan (MIT, USA) Awards Chair: Alessandro Abate (University of Oxford, UK) Steering Committee: Alessandro Abate (University of Oxford, UK) Thao Dang (Verimag, France) Martin Fr?nzle (Universit?t Oldenburg, Germany) Radu Grosu (TU Wien, Austria) Sayan Mitra (UIUC, USA) Paulo Tabuada (UCLA, USA) Claire Tomlin (University of California, Berkeley, USA) -- Nicola Paoletti Lecturer - Department of Computer Science - Royal Holloway, University of London Bedford building 2-25 https://urldefense.com/v3/__https://nicolapaoletti.com/__;!!IBzWLUs!FiXxaj0qhud64X_VFaOWa1pTGfE7JUaGaLRHKMXroahvNZTKW3BDdP-c8r4Z6y0zHKXVtpVTyKr5sw$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From wjb at williamjbowman.com Wed Oct 13 14:34:10 2021 From: wjb at williamjbowman.com (William J. Bowman) Date: Wed, 13 Oct 2021 11:34:10 -0700 Subject: [TYPES/announce] PLDI 2022 Second Call for Papers Message-ID: Please distribute widely. *Call for Papers* ==================== 2022 ACM Conference on Programming Language Design and Implementation (PLDI) Mon 20 - Fri 24 June 2022 San Diego, California, United States https://urldefense.com/v3/__https://pldi22.sigplan.org/track/pldi-2022-pldi*Call-for-Papers__;Iw!!IBzWLUs!EyUKXubukr-6zwgthHFFQl5JEQNp0RHillJIc7bfk6588ve5fu7yycfaDGjepLDJfygfVHc_aOQx7A$ PLDI is a premier forum for programming language research, broadly construed, including design, implementation, theory, applications, and performance. PLDI seeks outstanding research that extends and/or applies programming-language concepts to advance the field of computing. Novel system designs, thorough empirical work, well-motivated theoretical results, and new application areas are all welcome emphases in strong PLDI submissions. Reviewers will evaluate each contribution for its accuracy, significance, originality, and clarity. Submissions should be organized to communicate clearly to a broad programming-language audience as well as to experts on the paper?s topics. Papers should identify what has been accomplished and how it relates to previous work. Authors of empirical papers are encouraged to consider the seven categories of the SIGPLAN Empirical Evaluation Guidelines when preparing their submissions. (https://urldefense.com/v3/__http://www.sigplan.org/Resources/EmpiricalEvaluation/__;!!IBzWLUs!EyUKXubukr-6zwgthHFFQl5JEQNp0RHillJIc7bfk6588ve5fu7yycfaDGjepLDJfygfVHeWv3zWCA$ ) *Important Dates* =============== Fri 19 Nov 2021, Submission Deadline Mon 7 Feb - Wed 9 Feb 2022, Author Response Fri 25 Feb 2022, Author Notification *Author Instructions* ================== https://urldefense.com/v3/__https://pldi22.sigplan.org/track/pldi-2022-pldi*Call-for-Papers__;Iw!!IBzWLUs!EyUKXubukr-6zwgthHFFQl5JEQNp0RHillJIc7bfk6588ve5fu7yycfaDGjepLDJfygfVHc_aOQx7A$ Submission site: https://urldefense.com/v3/__https://pldi2022.hotcrp.com/__;!!IBzWLUs!EyUKXubukr-6zwgthHFFQl5JEQNp0RHillJIc7bfk6588ve5fu7yycfaDGjepLDJfygfVHfZw9KdBQ$ *Organizing Committee* ==================== General Chair: Ranjit Jhala, U. of California at San Diego Program Chair: Isil Dillig, U. of Texas at Austin Web Chair: Dan Barowy, Williams College Publicity Co-Chairs: William J. Bowman, U. of British Columbia Arjun Guha, Northeastern U. Sponsorship Co-Chairs: Ravi Chugh, U. of Chicago Sasa Misailovic, U. of Illinois at Urbana-Champaign Workshops Co-Chairs: Nadia Polikarpova, U. of California at San Diego Alexandra Silva, U. College London Student Research Competition Co-Chairs: Tyler Sorensen, U. of California at Santa Cruz Jubi Taneja, Microsoft Research Artifact Evaluation Co-Chairs: Niki Vazou, IMDEA Software Institute Xinyu Wang, U. of Michigan https://urldefense.com/v3/__https://pldi22.sigplan.org/committee/pldi-2022-organizing-committee__;!!IBzWLUs!EyUKXubukr-6zwgthHFFQl5JEQNp0RHillJIc7bfk6588ve5fu7yycfaDGjepLDJfygfVHenWD26Xw$ -- William J. Bowman From christine.tasson at lip6.fr Wed Oct 13 17:15:12 2021 From: christine.tasson at lip6.fr (Christine Tasson) Date: Wed, 13 Oct 2021 23:15:12 +0200 Subject: [TYPES/announce] LAFI'22: Submission deadline extended to October 20 Message-ID: ?===================================================================== ???????????????????? Call for Extended Abstracts ????????????????????????????? LAFI 2022 ???????????? POPL 2022 workshop on Languages for Inference ??????????????????????????? January 16, 2022 ????????????? https://urldefense.com/v3/__https://popl22.sigplan.org/home/lafi-2022__;!!IBzWLUs!CuKfW7dao6BlhsndqOP_LVILf6z2ut9NKVXtqvgh5SrMMCuFYuYOrPLzXcK7wB4YRFo9q7C29-iezQ$ ?????????????? Submission deadline on October 20, 2021 - EXTENDED ==================================================================== ***** Submission Summary ***** Deadline: October 20, 2021 (AoE) - EXTENDED Link: https://urldefense.com/v3/__https://lafi22.hotcrp.com/__;!!IBzWLUs!CuKfW7dao6BlhsndqOP_LVILf6z2ut9NKVXtqvgh5SrMMCuFYuYOrPLzXcK7wB4YRFo9q7CNXmldEQ$ Format: extended abstract (2 pages + references) ***** Call for Extended Abstracts ***** Inference concerns re-calibrating program parameters based on observed data, and has gained wide traction in machine learning and data science. Inference can be driven by probabilistic analysis and simulation, and through back-propagation and differentiation. Languages for inference offer built-in support for expressing probabilistic models and inference methods as programs, to ease reasoning, use, and reuse. The recent rise of practical implementations as well as research activity in inference-based programming has renewed the need for semantics to help us share insights and innovations. This workshop aims to bring programming-language and machine-learning researchers together to advance all aspects of languages for inference. Topics include but are not limited to: * design of programming languages for inference and/or differentiable ? programming; * inference algorithms for probabilistic programming languages, ? including ones that incorporate automatic differentiation; * automatic differentiation algorithms for differentiable programming ? languages; * probabilistic generative modeling and inference; * variational and differential modeling and inference; * semantics (axiomatic, operational, denotational, games, etc) and ? types for inference and/or differentiable programming; * efficient and correct implementation; * and last but not least, applications of inference and/or ? differentiable programming. We expect this workshop to be informal, and our goal is to foster collaboration and establish common ground. Thus, the proceedings will not be a formal or archival publication, and we expect to spend only a portion of the workshop day on traditional research talks. Nevertheless, as a concrete basis for fruitful discussions, we call for extended abstracts describing specific and ideally ongoing work on probabilistic and differential programming languages, semantics, and systems. ***** Submission guidelines ***** Submission deadline on October 20, 2021 (AoE) - EXTENDED Submission link: https://urldefense.com/v3/__https://lafi22.hotcrp.com/__;!!IBzWLUs!CuKfW7dao6BlhsndqOP_LVILf6z2ut9NKVXtqvgh5SrMMCuFYuYOrPLzXcK7wB4YRFo9q7CNXmldEQ$ Anonymous extended abstracts are up to 2 pages in PDF format, excluding references. In line with the SIGPLAN Republication Policy, inclusion of extended abstracts in the program is not intended to preclude later formal publication. From ezio.bartocci at tuwien.ac.at Thu Oct 14 04:22:09 2021 From: ezio.bartocci at tuwien.ac.at (Ezio Bartocci) Date: Thu, 14 Oct 2021 10:22:09 +0200 Subject: [TYPES/announce] =?utf-8?q?Marie_Sk=C5=82odowska-Curie_COFUND_do?= =?utf-8?q?ctoral_training_programme_-_LogiCS=40TUWien?= Message-ID: The novel interdisciplinary Marie Sk?odowska-Curie COFUND doctoral training programme LogiCS at TUWien - Logics for Computer Science https://urldefense.com/v3/__http://www.vcla.at/msca__;!!IBzWLUs!CHLnwsSKt1aWJYiKI8n6Qb9fKAUQZdTp-tpqDlvHJP4_O7jzHqM6lNbJNd1ACDMiFSiz_ghPdDb4cw$ co-funded by the European Commission, will offer 20 full-time PhD positions. The program is hosted by TU Wien, one of the most successful technical universities in Europe and the largest one in Austria. The Faculty of Informatics of TU Wien is a leading research and teaching institution which consistently ranks among the top 100 computer science faculties in the global Times Higher Education ranking. In the heart of Europe, Vienna has a distinguished history in mathematics, computer science, and logic research and offers one of the highest living standards in the world. The doctoral positions are open to international high-potential early-stage researchers working on Logical Methods in Computer Science and their applications, including: * Artificial Intelligence * Databases * Verification * Algorithms * Security * Cyber-Physical Systems The programme provides a 4-year long doctoral training for international PhD candidates within an English-language curriculum. LogiCS at TUWien will run for 60 months and foresees the recruitment of 20 PhD candidates. The PhD candidates will be supervised by: * Ezio Bartocci * Pavol Cerny * Agata Ciabattoni * Thomas Eiter * Robert Ganian * Georg Gottlob * Laura Kov?cs * Matteo Maffei * Magdalena Ortiz * Stefan Szeider * Georg Weissenbacher * Stefan Woltran * Florian Zuleger Two calls will accomplish the recruitment of the 20 positions. The first call is now open, with an application deadline of December 30, 2021. For details on how to apply, see https://urldefense.com/v3/__http://www.vcla.at/msca/apply__;!!IBzWLUs!CHLnwsSKt1aWJYiKI8n6Qb9fKAUQZdTp-tpqDlvHJP4_O7jzHqM6lNbJNd1ACDMiFSiz_gi38ifjPA$ or watch the video at https://urldefense.com/v3/__https://youtu.be/Aq0JGJ9eqzQ__;!!IBzWLUs!CHLnwsSKt1aWJYiKI8n6Qb9fKAUQZdTp-tpqDlvHJP4_O7jzHqM6lNbJNd1ACDMiFSiz_ghO_eD9vw$ . -- Univ.-Prof. Dr. Ezio Bartocci Full Professor of Formal Methods for Cyber-Physical Systems Engineering Faculty of Informatics, TU Wien Treitlstra?e 3, 1040 Vienna, Austria E-Mail: ezio.bartocci at tuwien.ac.at Phone: +43 (1) 58801 - 18226 Website: https://urldefense.com/v3/__http://www.eziobartocci.com__;!!IBzWLUs!CHLnwsSKt1aWJYiKI8n6Qb9fKAUQZdTp-tpqDlvHJP4_O7jzHqM6lNbJNd1ACDMiFSiz_gg2oF-LCQ$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From abraham at informatik.rwth-aachen.de Thu Oct 14 06:13:14 2021 From: abraham at informatik.rwth-aachen.de (Erika Abraham) Date: Thu, 14 Oct 2021 12:13:14 +0200 Subject: [TYPES/announce] CfP Software Verification and Testing Track at SAC 2022 In-Reply-To: References: Message-ID: <9038ef05-3ad5-6a23-2a6c-6ce47aee0e12@informatik.rwth-aachen.de> ???? 37th Annual ACM/SIGAPP Symposium on Applied Computing ?????????? Software Verification and Testing Track ???????????????????? Brno, Czech Republic ? ?? ?????????????????? April 25-29, 2022 ===== New deadline : October 24, 2021 ==== SAC 2022 website: https://urldefense.com/v3/__https://www.sigapp.org/sac/sac2022/__;!!IBzWLUs!GKbZcjePW9FPPLkUU6Ji5uDfrHHX4o6qKbLpBAuK5LCfXWP4w3ZITSO5_lTBRDATDck39ELtyzRNmw$ SAC-SVT 2022 website: https://urldefense.com/v3/__http://logimics.mics.centralesupelec.fr/en/SAC-SVT-2022__;!!IBzWLUs!GKbZcjePW9FPPLkUU6Ji5uDfrHHX4o6qKbLpBAuK5LCfXWP4w3ZITSO5_lTBRDATDck39EJTfLJaZQ$ ==== Important dates ==== *Oct 24,* 2021 - Submission of regular papers and SRC research abstracts Dec. 10, 2021 - Notification Dec. 21, 2021 - Camera-ready version Dec. 21, 2021 - Author registration due date ==== ACM Symposium on Applied Computing ==== The ACM Symposium on Applied Computing (SAC) has gathered scientists from different areas of computing over the last thirty years. The forum represents an opportunity to interact with different communities sharing an interest in applied computing. SAC 2022 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and will take place on April 25-29, 2022 in Brno, Czech Republic. ==== Software Verification and Testing Track (SVT) ==== The Software Verification and Testing track aims at contributing to the challenge of improving the usability of formal methods in software engineering. The track covers areas such as formal methods for verification and testing, based on theorem proving, model checking, static analysis, and run-time verification. We invite authors to submit new results in formal verification and testing, as well as development of technologies to improve the usability of formal methods in software engineering. Also are welcome detailed descriptions of applications of mechanical verification to large scale software. ==== Topics ==== Possible topics include, but are not limited to: * model checking * theorem proving * correct by construction development * model-based testing * software testing * symbolic execution * static and dynamic analysis * abstract interpretation * analysis methods for dependable systems * software certification and proof carrying code * fault diagnosis and debugging * verification and validation of large scale software systems * real world applications and case studies applying software testing ? and verification * benchmarks and data sets for software testing and verification ==== Submission Guidelines ==== Paper submissions must report on original, unpublished work. Submitted papers will undergo a double-blind review process.? Author(s) name(s) and address(es) must not appear in the body of the paper, and self- reference should be avoided and made in the third person. We welcome research papers and posters. Research papers should have at most 8 two-column pages in ACM format (further two pages, to a total of 10 pages, may be available at a charge). The length of a poster is limited to three pages (one extra page may be available at a charge). Please comply to this page limitation already at submission time. Furthermore, in the context of the Student Research Competition (SRC) Program to provide graduate students the opportunity to meet and exchange ideas with researchers and practitioners in their areas of interest, graduate students are invited to submit research abstracts (maximum of 4 pages in ACM camera-ready format) following the instructions published at the SAC 2022 website at https://urldefense.com/v3/__https://www.sigapp.org/sac/sac2022/authorkit.html__;!!IBzWLUs!GKbZcjePW9FPPLkUU6Ji5uDfrHHX4o6qKbLpBAuK5LCfXWP4w3ZITSO5_lTBRDATDck39ELFcJZQPg$ Submission of the same abstract to multiple tracks is not allowed. Accepted papers will be published in the ACM SAC 2022 proceedings in the ACM digital library. Paper registration is required, allowing the inclusion of the paper/poster in the conference proceedings. An author or a proxy attending SAC MUST present the paper. This is a requirement for the paper/poster to be included in the ACM digital library. No-show of registered papers and posters will result in excluding them from the ACM digital library. Detailed submission instructions are available on the SAC 2022 website: https://urldefense.com/v3/__http://logimics.mics.centralesupelec.fr/en/SAC-SVT-2022__;!!IBzWLUs!GKbZcjePW9FPPLkUU6Ji5uDfrHHX4o6qKbLpBAuK5LCfXWP4w3ZITSO5_lTBRDATDck39EJTfLJaZQ$ ==== Track Chairs ==== Erika Abraham, RWTH Aachen University, Germany Pascale Le Gall, CentraleSup?lec, Universit? Paris-Saclay, France From doc at evr.ist Sat Oct 16 07:52:17 2021 From: doc at evr.ist (Pierre-Evariste Dagand) Date: Sat, 16 Oct 2021 13:52:17 +0200 Subject: [TYPES/announce] 12-months software engineer position at IRIF (Paris, France) Message-ID: A software engineer position is available for the Praxis of Programming Languages project at the Institut de Recherche en Informatique Fondamentale (IRIF) of the Universit? de Paris (France). This software engineer position offers to assist the PPL research group in the development, maintenance and maturation of the research programming language prototypes developed in the p?le. More details online: https://urldefense.com/v3/__https://www.irif.fr/postes/admin*ingenieur_e_de_recherche__;Iw!!IBzWLUs!CNJbNp3OmLrN0cESdwRalmSkn1KhxUgwRpj9GwLxUFGIzoRdHhQWAKhi2n29YuGnlE2GNRCQhnRamg$ How to apply: ============ The position is available immediately and to be fulfilled before the end of December 2021. Candidates must have a Master degree in Computer Science or equivalent engineering degree. The candidate must send a resume to Pierre-?variste Dagand (dagand at irif.fr) -- Pierre From loris at cs.wisc.edu Sat Oct 16 16:45:44 2021 From: loris at cs.wisc.edu (Loris D'Antoni) Date: Sat, 16 Oct 2021 22:45:44 +0200 Subject: [TYPES/announce] POPL Calls for Tutorials/Workshops/Student Research Competition Message-ID: Please help us forward the following calls to the appropriate lists and groups. CALL FOR TUTORIALS (Deadline Nov 8th) Tutorials for POPL 2022 are solicited on any topic relevant to the POPL community. We are particularly encouraging submissions of introductory tutorials that make the research presented at POPL more accessible to the participants. https://urldefense.com/v3/__https://popl22.sigplan.org/track/POPL-2022-tutorialfest*Call-for-Tutorials__;Iw!!IBzWLUs!CyyKKEvYUsJJu99HdLGfHi5hjCCpmov3MhRMsqBsrhygs8sF9VMZDMFULLv-ixjeCLlloKDfh5Jaug$ CALL FOR VIRTUAL WORKSHOPS POPL 2022 is planned to occur in-person, but there will be an associated virtual workshop on January 27th and 28th, 2022! We are trying to maintain the momentum of inclusive virtual conferences while taking advantage of the opportunity (fingers crossed) for a strong in-person component. The virtual conference will be focused solely on interactive activities, not talk-watching (as main-conference talk videos will be available publicly a few days prior). The organizers would like to solicit your ideas on how to use the time. https://urldefense.com/v3/__https://popl22.sigplan.org/track/POPL-2022-virtual-workshop__;!!IBzWLUs!CyyKKEvYUsJJu99HdLGfHi5hjCCpmov3MhRMsqBsrhygs8sF9VMZDMFULLv-ixjeCLlloKBQ1AqgHw$ STUDENT RESEARCH COMPETITION (Deadline Nov 12) POPL 2022 will host an ACM Student Research Competition, where undergraduate and graduate students can present their original research before a panel of judges and conference attendees https://urldefense.com/v3/__https://popl22.sigplan.org/track/POPL-2022-student-research-competition__;!!IBzWLUs!CyyKKEvYUsJJu99HdLGfHi5hjCCpmov3MhRMsqBsrhygs8sF9VMZDMFULLv-ixjeCLlloKDCNCWU9w$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From maaike.annebeth at gmail.com Mon Oct 18 04:13:27 2021 From: maaike.annebeth at gmail.com (Maaike Zwart) Date: Mon, 18 Oct 2021 10:13:27 +0200 Subject: [TYPES/announce] SYCO 8 - 2nd Call for Papers Message-ID: -------------------------------------------------------------- CALL FOR PAPERS EIGHTH SYMPOSIUM ON COMPOSITIONAL STRUCTURES (SYCO 8) Tallinn University of Technology, Estonia 13-14 December 2021 Submission deadline: Monday 25 October 2021 AoE. https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/8/__;!!IBzWLUs!Ek0IGIxzYX5JYcsT9SPbec3OAfSvmCIH1ZangwAzUTt1_TeST1iNmoe3kIZbkbUeFlXT_eEgIKxZgg$ -------------------------------------------------------------- After a long break, SYCO is back! The Symposium on Compositional Structures (SYCO) is an interdisciplinary series of meetings aiming to support the growing community of researchers interested in the phenomenon of compositionality, from both applied and abstract perspectives, and in particular where category theory serves as a unifying common language. Previous SYCO events have been held at University of Birmingham, University of Strathclyde, University of Oxford, Chapman University, and University of Leicester. We welcome submissions from researchers across computer science, mathematics, physics, philosophy, and beyond, with the aim of fostering friendly discussion, disseminating new ideas, and spreading knowledge between fields. Submission is encouraged for both mature research and work in progress, and by both established academics and junior researchers, including students. -------------------------------------------------------------- RESTART OF SYCO The main aim of SYCO is to bring the community together and exchange ideas across interdisciplinary fields. In-person contact facilitates this in a way that online meetings cannot. This meant that unfortunately, SYCO 7, the previous edition of SYCO, had to be cancelled. To restart the series, SYCO 8 will take the following into account: - Submissions that were accepted for SYCO 7 can be resubmitted for SYCO 8, and will be given priority over other submissions. These submissions will be treated as being deferred from SYCO 7, see submission instructions below. - Authors that had a submission accepted for SYCO can also submit new material. These submissions will also be given priority over other submissions, if accepted through peer-review. SYCO 8 will be mainly an in-person event, and we expect that most speakers will be physically present. However, we do support a hybrid format, so if for some reason you cannot be present in person but would still like to present your work at SYCO, please contact the programme chair, Maaike Zwart (maaike.annebeth at gmail.com) -------------------------------------------------------------- TOPICS OF INTEREST While no list of topics could be exhaustive, SYCO welcomes submissions with a compositional focus related to any of the following areas, in particular from the perspective of category theory: - logical methods in computer science, including classical and quantum programming, type theory, concurrency, natural language processing and machine learning; - graphical calculi, including string diagrams, Petri nets and reaction networks; - languages and frameworks, including process algebras, proof nets, type theory and game semantics; - abstract algebra and pure category theory, including monoidal category theory, higher category theory, operads, polygraphs, and relationships to homotopy theory; - quantum algebra, including quantum computation and representation theory; - tools and techniques, including rewriting, formal proofs and proof assistants, and game theory; - industrial applications, including case studies and real-world problem descriptions. -------------------------------------------------------------- IMPORTANT DATES All deadlines are 23:59 Anywhere on Earth. Submission deadline: Monday 25 October 2021 Author notification: Wednesday 3 November 2021 Symposium dates: Monday 13 and Tuesday 14 December 2021 -------------------------------------------------------------- SUBMISSION INSTRUCTIONS Submissions are by EasyChair, via the SYCO 8 submission page: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=syco8__;!!IBzWLUs!Ek0IGIxzYX5JYcsT9SPbec3OAfSvmCIH1ZangwAzUTt1_TeST1iNmoe3kIZbkbUeFlXT_eH_R1KIGA$ Submission is easy, with no format requirements or page restrictions. The meeting does not have proceedings, so work can be submitted even if it has been submitted or published elsewhere. Think creatively: you could submit a recent paper, or notes on work in progress, or even a recent Masters or PhD thesis. In the event that more good-quality submissions are received than can be accommodated in the timetable, the programme committee may choose to *defer* some submissions to a future meeting, rather than reject them. Deferred submissions can be re-submitted to any future SYCO meeting, where they will not need peer review, and where they will be prioritised for inclusion in the programme. Meetings will be held sufficiently frequently to avoid a backlog of deferred papers. If you have a submission which was deferred from a previous SYCO meeting, it will not automatically be considered for SYCO 8; you still need to submit it again through EasyChair. When submitting, append the words "DEFERRED FROM SYCO X" to the title of your paper, replacing "X" with the appropriate meeting number. There is no need to attach any documents. -------------------------------------------------------------- PROGRAMME COMMITTEE Ross Duncan, University of Strathclyde Alexandre Goy, MICS, CentraleSup?lec Amar Hadzihasanovic, Tallinn University of Technology (local organiser) Jules Hedges, University of Strathclyde Chris Heunen, University of Edinburgh Aleks Kissinger, University of Oxford Jade Master, University of Strathclyde Dan Marsden, University of Oxford Hector Miller-Bakewell Samuel Mimram, ?cole Polytechnique Koko Muroya, Kyoto University Simona Paoli, University of Aberdeen Mehrnoosh Sadrzadeh, University College London Maru Sarazola, Johns Hopkins University Pawel Sobocinski, Tallinn University of Technology (local organiser) Jamie Vicary, University of Cambridge Maaike Zwart, IT University of Copenhagen (chair) -------------------------------------------------------------- STEERING COMMITTEE Ross Duncan, University of Strathclyde Chris Heunen, University of Edinburgh Dominic Horsman, University of Oxford Aleks Kissinger, University of Oxford Samuel Mimram, ?cole Polytechnique Simona Paoli, University of Aberdeen Mehrnoosh Sadrzadeh, University College London Pawel Sobocinski, Tallinn University of Technology Jamie Vicary, University of Cambridge -------------- next part -------------- An HTML attachment was scrubbed... URL: From kitwan.chui at informatics-europe.org Mon Oct 18 04:51:16 2021 From: kitwan.chui at informatics-europe.org (Kit Wan Chui) Date: Mon, 18 Oct 2021 10:51:16 +0200 Subject: [TYPES/announce] IE Webinar (Oct 21st): SMT Solving - Past, Present and Future In-Reply-To: <1694aaf2-d163-c6cc-2838-19eb3d35bdfd@informatics-europe.org> References: <1694aaf2-d163-c6cc-2838-19eb3d35bdfd@informatics-europe.org> Message-ID: <41eba052-8048-9360-1663-f5d15b6a4eda@informatics-europe.org> Dear colleagues, We cordially invite you to participate to our *next Informatics Europe webinar* on 21 October (Thursday): *SMT Solving: Past, Present and Future** Date: 21 October 2021, 5pm (CEST) Speaker: Prof. Dr. Erika Abraham, RWTH Aachen University, Germany ----------------------------------------------------------------------------- Register for the free webinar: Webinar abstract: Since the development of the first computer algebra systems in the '60s, automated decision procedures for checking the satisfiability of logical formulas gained more and more importance. Besides symbolic computation techniques, some major achievements were made in the '90s in the relatively young area of satisfiability checking, and resulted in powerful SAT and SAT-modulo-theories (SMT) solvers. Nowadays, these sophisticated tools are at the heart of many techniques for the analysis of programs and probabilistic, timed, hybrid and cyber-physical systems, for test-case generation, for solving large combinatorial problems and complex scheduling tasks, for product design optimisation, planning and controller synthesis, just to mention a few well-known areas. In this talk we give a historical overview of this development, describe shortly our own solver SMT-RAT, and discuss applications and some fascinating new developments for checking the satisfiability of real-arithmetic formulas. About the speaker: Erika Abraham graduated at the Christian-Albrechts-University Kiel (Germany), and received her PhD from the University of Leiden (The Netherlands) for her work on the development and application of deductive proof systems for concurrent programs. Then she moved to the Albert-Ludwigs-University Freiburg (Germany), where she started to work on the development and application of SAT and SMT solvers. Since 2008 she is professor at RWTH Aachen University (Germany), with main research focus on SMT solving for real and integer arithmetic, and formal methods for probabilistic and hybrid systems. We look forward to meeting you at the webinar this Thursday. Yours sincerely, Informatics Europe /*This webinar is part of the Informatics Europe webinar series offered by IE since September 2021. These live webinars are hosted by distinguished keynote speakers. They are free webinars, open to all who have registered for participation through our webpage . Recorded versions will also be available later on our YouTube channel . From lwittie at bucknell.edu Mon Oct 18 09:11:51 2021 From: lwittie at bucknell.edu (Lea Wittie) Date: Mon, 18 Oct 2021 09:11:51 -0400 Subject: [TYPES/announce] Bucknell University seeking tenure track faculty Message-ID: Bucknell Comp Sci is hiring tenure track faculty and especially looking for someone with expertise in programming languages. See our full ad at https://urldefense.com/v3/__https://jobs.bucknell.edu/en-us/job/496858/tenuretrack-faculty-computer-science__;!!IBzWLUs!FDvJ8MCq1z7Kp3copWk1V4ztuKWqecOUwROKSJTP3zotgksVclls_BeVMrcNx9evWwrg6tmTHspWkg$ "The Department of Computer Science at Bucknell University seeks applications for one or more open-rank tenure-track positions to begin in August 2022. Finalists for the positions who wish to be considered for tenure upon appointment will be asked to submit a complete tenure dossier. We seek applicants who demonstrate interest in reflexive, multicultural, and inclusive teaching practices and who commit to collaborating with departmental colleagues and students. The successful candidates will teach in one or more areas of our core CS curriculum. After their first year, the successful candidates will have opportunities to develop elective courses in their areas of expertise. Although candidates from all research areas are strongly encouraged to apply, we are particularly interested in those from areas that extend the range of expertise of our faculty, such as artificial intelligence, programming language design, and cybersecurity. The successful candidates will contribute to the teaching of programming language design, software engineering, and/or artificial intelligence. " Review of applications will begin on November 8 and continue until the position is filled. Questions should be directed to L. Felipe Perrone, Professor and Chair of Computer Science (perrone at bucknell.edu). Lea Wittie -- Prof. Lea Wittie Associate Professor, Department of Computer Science College of Engineering Bucknell University Pronouns: She, her, hers -------------- next part -------------- An HTML attachment was scrubbed... URL: From h.basold at liacs.leidenuniv.nl Tue Oct 19 15:00:33 2021 From: h.basold at liacs.leidenuniv.nl (Henning Basold) Date: Tue, 19 Oct 2021 21:00:33 +0200 Subject: [TYPES/announce] TYPES 2021 post-proceedings: Open call for papers Message-ID: <4f233aa4-918c-929e-a857-9e1ee826dfb6@liacs.leidenuniv.nl> Open call for papers for the Post-proceedings of the 27th International Conference on Types for Proofs and Programs TYPES 2021 TYPES is a major forum for the presentation of research on all aspects of type theory and its applications. TYPES 2021 was held 14-18 June 2021 virtually hosted by University Leiden, Netherlands. The post-proceedings volume will be published in LIPIcs, Leibniz International Proceedings in Informatics, an open-access series of conference proceedings (http://www.dagstuhl.de/en/publications/lipics). Submission to this post-proceedings volume is open to everyone, also to those who did not participate in the conference. We welcome high-quality descriptions of original work, as well as position papers, overview papers, and system descriptions. Submissions should be written in English, not overlapping with published or simultaneously submitted work to a journal or a conference with archival proceedings. The scope of the post-proceedings is the same as the scope of the conference: the theory and practice of type theory. In particular, we welcome submissions on the following topics: * Foundations of type theory and constructive mathematics; * Applications of type theory (e.g., linguistics or concurrency); * Dependently typed programming; * Industrial uses of type theory technology; * Meta-theoretic studies of type systems; * Proof assistants and proof technology; * Automation in computer-assisted reasoning; * Links between type theory and functional programming; * Formalising mathematics using type theory; * Homotopy type theory and univalent mathematics. IMPORTANT DATES * Abstract submission: 19 November 2021 (AoE) * Paper submission: 26 November 2021 (AoE) * Author notification: 25 March 2022 DETAILS * Papers have to be formatted with the current LIPIcs style and adhere to the style requirements of LIPIcs: http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ * The upper limit for the length of submissions is 20 pages, excluding title page and bibliography but including appendices. * The processing charge will kindly be sponsored by LIACS (Leiden Institute for Advanced Computer Science) for up to 20 publications, given that these publications do not exceed the page limit. See here for details about the processing charge: https://submission.dagstuhl.de/documentation/faq/11 * Papers have to be submitted as PDF through EasyChair: https://easychair.org/conferences/?conf=posttypes2021 * Authors have the option to attach to their submission a zip or tgz file containing code (formalised proofs or programs), but reviewers are not obliged to take the attachments into account and they will not be published. * In case of questions, e.g. on the page limit, contact one editors either directly or through . EDITORS - Henning Basold (https://liacs.leidenuniv.nl/~basoldh/), Leiden University, NL - Jesper Cockx (https://jesper.sikanda.be/), Technical University Delft, NL - Silvia Ghilezan (http://imft.ftn.uns.ac.rs/~silvia/), University of Novi Sad, RS -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_signature Type: application/pgp-signature Size: 665 bytes Desc: OpenPGP digital signature URL: From d.pym at ucl.ac.uk Wed Oct 20 04:33:10 2021 From: d.pym at ucl.ac.uk (Pym, David) Date: Wed, 20 Oct 2021 08:33:10 +0000 Subject: [TYPES/announce] Research Fellows in Logic at UCL, London Message-ID: Please note, with my apologies, an error in the information below: the closing date should read 31 October. Thank you to the many people who have pointed this out. [Apologies for cross-postings. Please share widely. Thank you.] I am looking for Research Fellows in Logic to join me in UCL?s PPLV group (https://urldefense.com/v3/__http://pplv.cs.ucl.ac.uk/welcome/__;!!IBzWLUs!GG2yIljBat3ZZi_fR9unrOYSnY__jhqSmcuPAe6QV2r8MmGk7y-vqNUVMcnGVxydU4NOMwBequukfA$ ) in London. I?m interested in the following topics: - Foundational work in classical, intuitionistic, modal, and substructural logic, with a particular interests in - proof-theoretic semantics, including primary and categorical approaches, and - foundational work in reductive logic and proof-search. - Applications of logical ideas to systems modelling. - The development of logical tools for systems modelling, including dynamic, epistemic, deontic, and doxastic approaches, with case studies in security and policy modelling. Posts are 12 months in the first instance with possible extensions subject to agreement. The posts are funded by UK EPSRC grants. Please note that the closing date is 15 October. Details, including salary, terms, and how to apply may be found at UCL?s jobs page: https://urldefense.com/v3/__https://atsv7.wcn.co.uk/search_engine/jobs.cgi__;!!IBzWLUs!GG2yIljBat3ZZi_fR9unrOYSnY__jhqSmcuPAe6QV2r8MmGk7y-vqNUVMcnGVxydU4NOMwAhZsxdqQ$ under Research Fellow/Senior Research Fellows in Logic, specifically https://urldefense.com/v3/__https://atsv7.wcn.co.uk/search_engine/jobs.cgi?SID=amNvZGU9MTg3OTAwMiZ2dF90ZW1wbGF0ZT05NjYmb3duZXI9NTA0MTE3OCZvd25lcnR5cGU9ZmFpciZicmFuZF9pZD0wJnZhY194dHJhNTA0MTE3OC41MF81MDQxMTc4PTkyNzg2JnZhY3R5cGU9MTI3NiZwb3N0aW5nX2NvZGU9MjI0__;!!IBzWLUs!GG2yIljBat3ZZi_fR9unrOYSnY__jhqSmcuPAe6QV2r8MmGk7y-vqNUVMcnGVxydU4NOMwBY8Gh_3Q$ For an informal discussion, please contact me at - d.pym at ucl.ac.uk - https://urldefense.com/v3/__http://www.cs.ucl.ac.uk/staff/D.Pym/__;!!IBzWLUs!GG2yIljBat3ZZi_fR9unrOYSnY__jhqSmcuPAe6QV2r8MmGk7y-vqNUVMcnGVxydU4NOMwC2uvUBQg$ Thank you, David ? Prof. David J. Pym Professor of Information, Logic, and Security Head of Programming Principles, Logic, and Verification University College London Honorary Research Fellow, Institute of Philosophy, University of London Director, UCL Centre for Doctoral Training in Cybersecurity Editor-in-Chief, OUP Journal of Cybersecurity d.pym at ucl.ac.uk https://urldefense.com/v3/__http://www.cs.ucl.ac.uk/people/D.Pym.html__;!!IBzWLUs!GG2yIljBat3ZZi_fR9unrOYSnY__jhqSmcuPAe6QV2r8MmGk7y-vqNUVMcnGVxydU4NOMwD5mL_vCA$ https://urldefense.com/v3/__http://www.cs.ucl.ac.uk/staff/D.Pym/__;!!IBzWLUs!GG2yIljBat3ZZi_fR9unrOYSnY__jhqSmcuPAe6QV2r8MmGk7y-vqNUVMcnGVxydU4NOMwC2uvUBQg$ Assistant: Julia Savage, j.savage at ucl.ac.uk, +44 (0)20 7679 0327 From havelund at gmail.com Thu Oct 21 12:09:52 2021 From: havelund at gmail.com (Klaus Havelund) Date: Thu, 21 Oct 2021 19:09:52 +0300 Subject: [TYPES/announce] NFM 2022 - SECOND CALL FOR PAPERS Message-ID: NFM 2022 - SECOND CALL FOR PAPERS The 14th NASA Formal Methods Symposium https://urldefense.com/v3/__https://nfm2022.caltech.edu__;!!IBzWLUs!AGtg9a47y7uh0Rw9nuTenrGZbEcrfkwn8oX3ltHE1EE3i-Y7hMj8w482jPTPe6V1kF-YSX5A5Ze1fg$ May 24-27, 2022 Pasadena, California, USA The symposium is planned to be held in person at California Institute of Technology, but potentially transitioning to fully virtual if the COVID situation persists. Virtual presentations will be possible even if the conference is held in-person. The symposium has NO registration fee for presenting and attending. IMPORTANT DATES - Abstract Submission: December 3, 2021 - Paper Submission: December 10, 2021 - Paper Notifications: February 4, 2022 - Camera-ready Papers: March 4, 2022 - Symposium: May 24-27, 2022 THEME OF SYMPOSIUM The widespread use and increasing complexity of mission-critical and safety-critical systems at NASA and in the aerospace industry requires advanced techniques that address these systems' specification, design, verification, validation, and certification requirements. The NASA Formal Methods Symposium (NFM) is a forum to foster collaboration between theoreticians and practitioners from NASA, academia, and industry. NFM's goals are to identify challenges and to provide solutions for achieving assurance for such critical systems. The focus of the symposium will be on formal/rigorous techniques for software assurance, including their theory, current capabilities and limitations, as well as their potential application to aerospace during all stages of the software life-cycle. The NASA Formal Methods Symposium is an annual event organized by the NASA Formal Methods (NFM) Research Group, composed of researchers spanning six NASA centers. The organization of NFM 2022 is being led by the Jet Propulsion Laboratory (JPL), located in Pasadena, California. TOPICS ON INTEREST Topics of interest include, but are not limited to, the following aspects of formal methods: Advances in formal methods - Interactive and automated theorem proving - SMT and SAT solving - Model checking - Static analysis - Runtime verification - Automated testing - Specification languages, textual and graphical - Refinement - Code synthesis - Design for verification and correct-by-design techniques - Requirements specification and analysis Integration of formal methods techniques - Integration of diverse formal methods techniques - Use of machine learning and probabilistic reasoning techniques in formal methods - Integration of formal methods into software engineering practices - Combination of formal methods with simulation and analysis techniques - Formal methods and fault tolerance, resilient computing, and self healing systems - Formal methods and graphical modeling languages such as SysML, UML, MATLAB/Simulink - Formal methods and autonomy, e.g., verification of systems and languages for planning and scheduling (PDDL, Plexil, etc.), self-sufficient systems, and fault-tolerant systems. Formal methods in practice - Experience reports of application of formal methods on real systems, such as autonomous systems, safety-critical systems, concurrent and distributed systems, cyber-physical, embedded, and hybrid systems, fault-detection, diagnostics, and prognostics systems, and human-machine interaction analysis. - Use of formal methods in systems engineering (including hardware components) - Use of formal methods in education - Reports on negative results in the development and the application for formal methods in practice. - Usability of formal method tools, and their infusion into industrial contexts. - Challenge problems for future reference by the formal methods community. The formulation of these papers can range from plain English description of a problem over formal specifications, to specific implementations in a programming language. NASA OPEN SOURCE Courageous authors, who want to delve in open source software being applied in real NASA missions, and find possible connections to and applications of Formal Methods, are invited to visit the open source repositories for the following two frameworks for programming flight software: - F? (https://urldefense.com/v3/__https://nasa.github.io/fprime/__;!!IBzWLUs!AGtg9a47y7uh0Rw9nuTenrGZbEcrfkwn8oX3ltHE1EE3i-Y7hMj8w482jPTPe6V1kF-YSX7gxsg0yQ$ ) - cFS (https://urldefense.com/v3/__https://cfs.gsfc.nasa.gov/__;!!IBzWLUs!AGtg9a47y7uh0Rw9nuTenrGZbEcrfkwn8oX3ltHE1EE3i-Y7hMj8w482jPTPe6V1kF-YSX66xFrtXQ$ ) SUBMISSIONS There are two categories of submissions: - Regular papers describing fully developed work and complete results (maximum 15 pages, excluding references); - Short papers on tools, experience reports, or work in progress with preliminary results (maximum 6 pages, excluding references). Additional appendices can be submitted as supplementary material for reviewing purposes. They will not be included in the proceedings. All papers must be in English and describe original work that has not been published. All submissions will be reviewed by at least three members of the Program Committee. Reviewing is Single-blind. We encourage authors to focus on readability of their submissions. Papers will appear in the Formal Methods subline of Springer's Lecture Notes in Computer Science (LNCS) and must use LNCS style formatting ( https://urldefense.com/v3/__https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines__;!!IBzWLUs!AGtg9a47y7uh0Rw9nuTenrGZbEcrfkwn8oX3ltHE1EE3i-Y7hMj8w482jPTPe6V1kF-YSX4KgMGWDQ$ ). Papers must be submitted in PDF format at the EasyChair submission site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=nfm2022__;!!IBzWLUs!AGtg9a47y7uh0Rw9nuTenrGZbEcrfkwn8oX3ltHE1EE3i-Y7hMj8w482jPTPe6V1kF-YSX4An-aWgA$ . Authors of selected best papers will be invited to submit an extended version to a special issue in Springer's Innovations in Systems and Software Engineering: A NASA Journal (https://urldefense.com/v3/__https://www.springer.com/journal/11334__;!!IBzWLUs!AGtg9a47y7uh0Rw9nuTenrGZbEcrfkwn8oX3ltHE1EE3i-Y7hMj8w482jPTPe6V1kF-YSX4gyX8SSA$ ). ARTIFACTS Authors are encouraged, but not strictly required, to submit artifacts that support the conclusions of their work (if allowed by their institutions). Artifacts may contain software, mechanized proofs, benchmarks, examples, case studies and data sets. Artifacts will be evaluated by the Program Committee together with the paper. ORGANIZERS PC chairs - Klaus Havelund, JPL, USA - Jyo Deshmukh, USC, USA - Ivan Perez, NIA, USA Application Advisors - Robert Bocchino, JPL, USA - John Day, JPL, USA - Maged Elasaar, JPL, USA - Amalaye Oyake, Blue Origin, USA - Nicolas Rouquette, JPL, USA - Vandi Verma, JPL, USA Application advisors advise the PC chairs to ensure a strong connection to the problems facing NASA. Local Organizer - Richard Murray, Caltech, USA Scientific Advisor - Mani Chandy, Caltech, USA Program Committee - Aaron Dutle, NASA, USA - Alessandro Cimatti, Fondazione Bruno Kessler, Italy - Anastasia Mavridou, SGT Inc. / NASA Ames Research Center, USA - Anne-Kathrin Schmuck, Max-Planck-Institute for Software Systems, Germany - Arie Gurfinkel, University of Waterloo, Canada - Bardh Hoxha, Toyota Research Institute North America, USA - Bernd Finkbeiner, CISPA Helmholtz Center for Information Security, Germany - Betty H.C. Cheng, Michigan State University, USA - Borzoo Bonakdarpour, Michigan State University, USA - Carolyn Talcott, SRI International, USA - Chuchu Fan, MIT, USA - Constance Heitmeyer, Naval Research Laboratory, USA - Corina Pasareanu, CMU, NASA, KBR, USA - Cristina Seceleanu, M?lardalen University, Sweden - Dejan Nickovic, Austrian Institute of Technology AIT, Austria - Dirk Beyer, LMU Munich, Germany - Doron Peled, Bar Ilan University, Israel - Erika Abraham, RWTH Aachen University, Germany - Ewen Denney, NASA, USA - Gerard Holzmann, Nimble Research, USA - Giles Reger, The University of Manchester, UK - Huafeng Yu, TOYOTA InfoTechnology Center USA, USA - Jean-Christophe Filliatre, CNRS, France - Johann Schumann, NASA, USA - John Day, Jet Propulsion Laboratory, USA - Julia Badger, NASA, USA - Julien Signoles, CEA LIST, France - Kerianne Hobbs, Air Force Research Laboratory, USA - Kristin Yvonne Rozier, Iowa State University, USA - Leonardo Mariani, University of Milano Bicocca, Italy - Lu Feng, University of Virginia, USA - Marcel Verhoef, European Space Agency, The Netherlands - Marie Farrell, Maynooth University, Ireland - Marieke Huisman, University of Twente, The Netherlands - Marielle Stoelinga, University of Twente, The Netherlands - Martin Feather, Jet Propulsion Laboratory, USA - Martin Leucker, University of Luebeck, Germany - Michael Lowry, NASA, USA - Misty Davies, NASA, USA - Natasha Neogi, NASA, USA - Nicolas Rouquette, Jet Propulsion Laboratory, USA - Nikos Arechiga, Toyota Research Institute, USA - Rajeev Joshi, Amazon Web Services, USA - Stanley Bak, Stony Brook University, USA - Sylvie Boldo, INRIA, France - Vandi Verma, NASA, USA - Willem Visser, Amazon Web Services, USA CONTACT Email: nfm2022 [at] easychair [dot] org -------------- next part -------------- An HTML attachment was scrubbed... URL: From sam.staton at cs.ox.ac.uk Fri Oct 22 08:39:17 2021 From: sam.staton at cs.ox.ac.uk (Sam Staton) Date: Fri, 22 Oct 2021 12:39:17 +0000 Subject: [TYPES/announce] LICS 2022 Call for Papers Message-ID: <9CF61807-4D76-47F6-BBE9-FAF0D736C3CA@cs.ox.ac.uk> CALL FOR PAPERS Thirty-Seventh Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS) August 2022 Part of Federated Logic Conference 2022 (Haifa) https://urldefense.com/v3/__https://lics.siglog.org/lics22__;!!IBzWLUs!GTx8Nuf9yezbGDWbNMDAMJceXHls_INeU7ibZHzgUBJGrsggzJsEfOj_x5SCXJj2NRA3-b236XHxNw$ https://urldefense.com/v3/__https://floc2022.org/__;!!IBzWLUs!GTx8Nuf9yezbGDWbNMDAMJceXHls_INeU7ibZHzgUBJGrsggzJsEfOj_x5SCXJj2NRA3-b2rJGDtzw$ SCOPE 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, foundations of probabilistic, real-time and hybrid systems, games and logic, higher-order logic, knowledge representation and reasoning, lambda and combinatory calculi, linear logic, logic programming, logical aspects of AI, 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, process calculi, programming language semantics, proof theory, reasoning about security and privacy, rewriting, type systems, type theory, and verification. COVID-19 etc.. For people who cannot travel to Israel, the possibility of remote participation will be ensured. 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: 17 January 2022 Full Papers Due: 21 January 2022 Author Feedback/Rebuttal Period: 10-13 March 2022 Author Notification: 14 April 2022 Conference: 2-5 August 2022 (tentative) FLOC: 31 July - 12 August 2022. Submission deadlines are firm; late submissions will not be considered. All submissions will be electronic via https://urldefense.com/v3/__https://www.easychair.org/conferences/?conf=lics2022__;!!IBzWLUs!GTx8Nuf9yezbGDWbNMDAMJceXHls_INeU7ibZHzgUBJGrsggzJsEfOj_x5SCXJj2NRA3-b20JZPWmA$ . 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. Latex style files and further submission information is at https://urldefense.com/v3/__https://lics.siglog.org/lics22/cfp.php__;!!IBzWLUs!GTx8Nuf9yezbGDWbNMDAMJceXHls_INeU7ibZHzgUBJGrsggzJsEfOj_x5SCXJj2NRA3-b2WOJ5hqg$ . LICS 2022 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. Please see the website for further details and requirements from the double-blind process. LICS DISTINGUISHED PAPERS (NEW) Around 10% of accepted LICS papers will be selected as distinguished papers. These are papers that, in the view of the LICS programme committee, make exceptionally strong contribution to the field and should be read by a broad audience due their relevance, originality, significance and clarity. 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. PUBLICATION The official publication date may differ from the first day of the conference. The official publication date may affect the deadline for any patent filings related to published work. We will clarify the official publication date in due course. From S.J.Thompson at kent.ac.uk Thu Oct 21 15:58:28 2021 From: S.J.Thompson at kent.ac.uk (Simon Thompson) Date: Thu, 21 Oct 2021 21:58:28 +0200 Subject: [TYPES/announce] Position: technical lead for certification, IO Message-ID: <3D0D1403-364C-4475-B212-F2712724F140@kent.ac.uk> IO Global is building an online store for distributed applications (dApps) on Cardano. The dApp store will give users the ability to download, evaluate, and review applications that have been built by the developer community. To give users and developers maximum assurance about the behaviour of dApps, the store will also certify dApp behaviour at three levels: automated testing (level 1), audit (level 2), and program verification (level 3). As Technical Lead for Certification, you will be responsible for delivery of all technical aspects of certification, initially by taking oversight of external providers, but in due course potentially also leading an internal engineering team. Working with the dApp store team, the product team, and UI/UX designers and researchers, you will devise and maintain a design, implementation, and delivery strategy for certification. Candidates will have an outstanding and sustained record of tech delivery or research, with particular experience in the technologies used in certification: automated and property-based testing, model checking, and verification. https://urldefense.com/v3/__https://apply.workable.com/io-global/j/BA6A22CB79/__;!!IBzWLUs!FpFkfWZ8EXCk8IJr1j-eFC7Fps403H9nrKIGEAzF9y2H6naNUHmt8rTQQpudpDEXtPFguO8lP6F1zw$ Simon Thompson Technical Director, dApp Platform IO -------------- next part -------------- An HTML attachment was scrubbed... URL: From Claude.Marche at inria.fr Fri Oct 22 10:42:39 2021 From: Claude.Marche at inria.fr (Claude Marche) Date: Fri, 22 Oct 2021 16:42:39 +0200 Subject: [TYPES/announce] Engineer positions for the ProofInUse consortium Message-ID: <04d8d068-1f1f-16db-136f-b73cb4ef2cd3@inria.fr> Temporary engineer positions at Inria are available for the ``ProofInUse'' consortium. == ProofInUse in short == The ProofInUse consortium is a laboratory for research and development in the domain of high-assurance software. It is joint between several academic and industrial partners. The general objective of ProofInUse is to provide software verification tools, based on mathematical proof, to industry users. The objective of ProofInUse is to significantly increase the capabilities and performances of verification environments proposed or internally used by the partners. Beyond a common interest in formal verification techniques, the members of ProofInUse share a common interest in the generic environment Why3 for deductive program verification, developed in the Toccata research group. In particular, ProofInUse aims at integration of verification techniques at the state-of-the-art of academic research, via the Why3 environment. See also https://urldefense.com/v3/__https://proofinuse.gitlabpages.inria.fr/__;!!IBzWLUs!Gg5Hxe62V8w5Z9IFAPtjfQLEmQBW4zoLmRlaelhbQlsG4veyjYnE9kix0LaY1sT16xPUh_vFrXbrIA$ == Expectations from the candidates == We expect some experience in the field of formal methods of software engineering, in a general sense. The typical candidate would be someone who recently defended a PhD in a related domain. Having a PhD is not a mandatory requirement though. The research part of the job is significant, the work being expected to lead to academic publications, as exemplified by the publications of the former engineers of ProofInUse (see https://urldefense.com/v3/__https://proofinuse.gitlabpages.inria.fr/dissemination.html__;!!IBzWLUs!Gg5Hxe62V8w5Z9IFAPtjfQLEmQBW4zoLmRlaelhbQlsG4veyjYnE9kix0LaY1sT16xPUh_t8n_4afg$ ). The development activities include a participation to the development of Why3, for which we are interested in candidates with experience in OCaml programming, or similar functional programming languages, and in the practice of shared development using git. Some skills in the use of a formal proof environment will be a plus. == How to apply The engineer positions should be filled as soon as possible. The primary site for the positions is https://urldefense.com/v3/__https://recrutement.inria.fr/public/classic/en/offres/2021-04144__;!!IBzWLUs!Gg5Hxe62V8w5Z9IFAPtjfQLEmQBW4zoLmRlaelhbQlsG4veyjYnE9kix0LaY1sT16xPUh_s9MXfM7Q$ where you can apply with a CV and a motivation letter. Do not hesitate to contact me directly (Claude.Marche at inria.fr) for more information on the positions. From bove at chalmers.se Fri Oct 22 12:04:27 2021 From: bove at chalmers.se (Ana Bove) Date: Fri, 22 Oct 2021 18:04:27 +0200 Subject: [TYPES/announce] PhD position in Type Theory at Chalmers/Gothenburg University (deadline 8 Nov) Message-ID: <9cd4eb4f-ae50-2eb1-6c85-75de6b92400d@chalmers.se> We are opening a PhD position in the Logic & Types unit of the Department of Computer Science and Engineering joint at Chalmers and Gothenburg University. Ad : Doctoral student in Logic and Types: Theory and implementation of dependent types URL: https://urldefense.com/v3/__https://bit.ly/3m0lmP6__;!!IBzWLUs!BekyGs8FqqaBuTTqIgsUp3Q_5tbUchy9dk9pFij5GA0o7Vxmzp_TwtXMvyAGjCMt13yb3-xoo2LEpg$ Apply until: 8 November 2021 This position is a great opportunity for you as a PhD student to develop your scientific and technical skills as part of a team of leading researchers in the area of dependent type theory and implementors of the Agda proof assistant. Logic & Types members: https://urldefense.com/v3/__https://www.chalmers.se/en/departments/cse/organisation/LT/Pages/Staff.aspx__;!!IBzWLUs!BekyGs8FqqaBuTTqIgsUp3Q_5tbUchy9dk9pFij5GA0o7Vxmzp_TwtXMvyAGjCMt13yb3-zEmvEnwA$ The project aims to advance type theory both theoretically and practically, in particular in the direction of modalities. You will be working on type theory from a mathematical perspective (type systems and their models), an algorithmic perspective (unification and type-checking), and a programming perspective (efficient implementation as part of the Agda proof assistant). The position is for 5 years and comes with full benefits (pension benefits, health insurance etc). (Sweden is a good country for PhD students!) For the full description, eligibility, documents required for the application, see https://urldefense.com/v3/__https://bit.ly/3m0lmP6__;!!IBzWLUs!BekyGs8FqqaBuTTqIgsUp3Q_5tbUchy9dk9pFij5GA0o7Vxmzp_TwtXMvyAGjCMt13yb3-xoo2LEpg$ Further questions can be directed to Andreas Abel . P.S.: Colleagues, please advertise this position to suitable candidates (e.g., your best students). From Martina.Seidl at jku.at Sat Oct 23 06:18:36 2021 From: Martina.Seidl at jku.at (Martina Seidl) Date: Sat, 23 Oct 2021 12:18:36 +0200 Subject: [TYPES/announce] Full Professorship for Formal Methods at JKU Linz References: <6173CE0A020000130005E782@s05gw02.im.jku.at> Message-ID: <6173E17C020000130005E7A1@s05gw02.im.jku.at> The Johannes Kepler University has an opening for a full professorship in Formal Methods. Application deadline: December 1, 2021 Further details: https://urldefense.com/v3/__https://www.jku.at/en/the-jku/work-at-the-jku/job-openings/professorship-positions/professor-for-formal-methods/__;!!IBzWLUs!BFZfAbC0Q-rcA_eTkNvmDDIKYQ2afCVQA9cbXcc-skO37Wl34WCB_716I-A2YKx7O3vDBF0FSWQDGg$ Please feel free to contact me for any questions! Sincerely, Martina Seidl -------------- next part -------------- An HTML attachment was scrubbed... URL: From nachumd at tauex.tau.ac.il Sat Oct 23 13:30:24 2021 From: nachumd at tauex.tau.ac.il (Nachum Dershowitz) Date: Sat, 23 Oct 2021 17:30:24 +0000 Subject: [TYPES/announce] Please post Message-ID: On Sunday, October 24, and Monday, October 25th, 9am - 2pm EDT (3-8pm CET), we will be hosting a (mainly) virtual symposium honoring the 100th year since the birth of the late Boris (Boaz) Trakhtenbrot. Speakers include: Samson Abramsky Sergei Artemov Mikolaj Bojanczyk Bruno Courcelle Zvi Galil Ir?ne Guessarian Yuri Gurevich Vladimir Lifschitz Irina Lomazova Johann Makowsky Wolfgang Reisig Jacques Sakarovitch Wolfgang Thomas Mark Trakhtenbrot Moshe Vardi For schedule and abstracts, see https://urldefense.com/v3/__https://www.cs.tau.ac.il/*nachumd/Boaz100.html__;fg!!IBzWLUs!D0IaIUyP3xXX5duPv9tLPaI-YD2jNiY9x6pn-mH45CALNZvoq3oFjDU_qcSOovztj4rAMjYTxbKgUQ$ The link to the zoom meeting is https://urldefense.com/v3/__https://tau-ac-il.zoom.us/j/83692612574?pwd=UmlEYXd0eFdpRHFMdGR6YzRONVdUZz09__;!!IBzWLUs!D0IaIUyP3xXX5duPv9tLPaI-YD2jNiY9x6pn-mH45CALNZvoq3oFjDU_qcSOovztj4rAMjaW8VYRHQ$ From ugo.dallago at unibo.it Sun Oct 24 15:22:43 2021 From: ugo.dallago at unibo.it (Ugo Dal Lago) Date: Sun, 24 Oct 2021 21:22:43 +0200 Subject: [TYPES/announce] Logic and Probabilistic Programming 2022 - Call for Participation Message-ID: <8F0CAE3E-DAB3-4FC5-837D-B0CE1DD061C6@unibo.it> Call for Participation LOGIC AND PROBABILISTIC PROGRAMMING as Part of LOGIC AND INTERACTIONS 2022 January 31, 2022 to February 4, 2022 CIRM, Luminy, Marseille, France https://urldefense.com/v3/__https://conferences.cirm-math.fr/2686.html__;!!IBzWLUs!H67UIdQUnGiBMUQQDSZCgRT-tIljoXa8d1zhmt3rjfF3tZK6rznc4_ASmjYuJoM41_Rfqh2-aGNIuQ$ Participation is free, and we expect to fund the accommodation of all participants requiring it, as well as providing a limited number of travel grants. See the "Funding" section below. Please pre-register early if you are interested in attending, as this will help us organize the event in the best conditions. A first round of travel grants will be attributed at the end of October. If you have any question regarding the event, feel free to email the organizers: li2022 at listes.math.cnrs.fr . Description =========== Probabilities play an increasing role in computer science. Important deterministically-intractable problems admit feasible approximate probabilistic solutions. Randomized algorithms are essential in distributed computing and numerical computing (Monte Carlo methods), not to mention the role of probabilistic methods in deep learning (stochastic gradient). Linear logic shows quite useful in this setting because some of the most basic notions of probability theory are linear: Markov chains or kernels, Bayesian networks etc. The general purpose of this week is not only to present the state of the art on the applications of proof theory, category theory and denotational semantics to the analysis of probabilistic programs and to the foundation of probabilistic formal methods for program and system verification, but also to stress the specificities of Bayesian programming and machine learning, in which programs represent statistical models. The program of the week is designed for conveying to the non-specialist a coherent picture of this exciting and very active research area. Tutorial Speakers ================= Semantics and Probabilistic Programming Rapha?lle Crubill? (https://urldefense.com/v3/__http://research.crubille.lautre.net/index.htm__;!!IBzWLUs!H67UIdQUnGiBMUQQDSZCgRT-tIljoXa8d1zhmt3rjfF3tZK6rznc4_ASmjYuJoM41_Rfqh0i725WRw$ ), CNRS, Marseille Ohad Kammar (https://urldefense.com/v3/__http://denotational.co.uk/__;!!IBzWLUs!H67UIdQUnGiBMUQQDSZCgRT-tIljoXa8d1zhmt3rjfF3tZK6rznc4_ASmjYuJoM41_Rfqh1szhUz5A$ ), The University of Edinburgh Bayesian and Differentiable Programming Languages Brooks Paige (https://urldefense.com/v3/__https://tbrx.github.io/__;!!IBzWLUs!H67UIdQUnGiBMUQQDSZCgRT-tIljoXa8d1zhmt3rjfF3tZK6rznc4_ASmjYuJoM41_Rfqh31sdfDmg$ ) , University College London Matthijs V?k?r (https://urldefense.com/v3/__https://www.uu.nl/medewerkers/MILVakar__;!!IBzWLUs!H67UIdQUnGiBMUQQDSZCgRT-tIljoXa8d1zhmt3rjfF3tZK6rznc4_ASmjYuJoM41_Rfqh0NJpK1vQ$ ) Utrecht University, Verification of Probabilistic Systems Marta Kwiatkowska (https://urldefense.com/v3/__https://www.cs.ox.ac.uk/people/marta.kwiatkowska/__;!!IBzWLUs!H67UIdQUnGiBMUQQDSZCgRT-tIljoXa8d1zhmt3rjfF3tZK6rznc4_ASmjYuJoM41_Rfqh246rDrwQ$ ), University of Oxford Invited Speakers ================ Claudia Faggian (https://urldefense.com/v3/__https://www.irif.fr/*5C*faggian/__;JX4!!IBzWLUs!H67UIdQUnGiBMUQQDSZCgRT-tIljoXa8d1zhmt3rjfF3tZK6rznc4_ASmjYuJoM41_Rfqh3slJuXxQ$ ), CNRS, Paris Cameron Freer (https://urldefense.com/v3/__https://cfreer.org/__;!!IBzWLUs!H67UIdQUnGiBMUQQDSZCgRT-tIljoXa8d1zhmt3rjfF3tZK6rznc4_ASmjYuJoM41_Rfqh3aExm0yg$ ), MIT Marco Gaboardi (https://urldefense.com/v3/__https://cs-people.bu.edu/gaboardi/__;!!IBzWLUs!H67UIdQUnGiBMUQQDSZCgRT-tIljoXa8d1zhmt3rjfF3tZK6rznc4_ASmjYuJoM41_Rfqh1h1VCGPw$ ), Boston University Annabelle McIver (https://urldefense.com/v3/__https://researchers.mq.edu.au/en/persons/annabelle-mciver__;!!IBzWLUs!H67UIdQUnGiBMUQQDSZCgRT-tIljoXa8d1zhmt3rjfF3tZK6rznc4_ASmjYuJoM41_Rfqh1s4jzJew$ ), Macquarie University Joost-Pieter Katoen (https://urldefense.com/v3/__https://www-i2.informatik.rwth-aachen.de/*5C*katoen/__;JX4!!IBzWLUs!H67UIdQUnGiBMUQQDSZCgRT-tIljoXa8d1zhmt3rjfF3tZK6rznc4_ASmjYuJoM41_Rfqh1GffCmWQ$ ), Aachen University Prakash Panangaden (https://urldefense.com/v3/__https://www.cs.mcgill.ca/*5C*prakash/__;JX4!!IBzWLUs!H67UIdQUnGiBMUQQDSZCgRT-tIljoXa8d1zhmt3rjfF3tZK6rznc4_ASmjYuJoM41_Rfqh0JcEKQ_A$ ), McGill University Jane Hilston (https://urldefense.com/v3/__https://homepages.inf.ed.ac.uk/jeh/__;!!IBzWLUs!H67UIdQUnGiBMUQQDSZCgRT-tIljoXa8d1zhmt3rjfF3tZK6rznc4_ASmjYuJoM41_Rfqh0p7NtgTQ$ ), University of Edinburgh Alexandra Silva (https://urldefense.com/v3/__https://alexandrasilva.org/*/main.html__;Iw!!IBzWLUs!H67UIdQUnGiBMUQQDSZCgRT-tIljoXa8d1zhmt3rjfF3tZK6rznc4_ASmjYuJoM41_Rfqh1m-mff9g$ ), Cornell University Michele Pagani (https://urldefense.com/v3/__https://www.irif.fr/*michele/__;fg!!IBzWLUs!H67UIdQUnGiBMUQQDSZCgRT-tIljoXa8d1zhmt3rjfF3tZK6rznc4_ASmjYuJoM41_Rfqh1aBkZSOQ$ ), Universit? de Paris Funding ======= We plan to fund the accommodation of any participant, within the limits of the capacity of the CIRM and of our budget. If you have available funding, allowing you to pay for your own accommodation, please let us know nonetheless: this will allow us to allocate more of our own funding to other participants. The details of your accommodation will be managed by the CIRM. We also plan to offer a limited number of travel grants, mainly targeted at young researchers (master or PhD students, postdocs): you can apply for such a grant in the pre-registration form. -------------- next part -------------- An HTML attachment was scrubbed... URL: From balzers at cs.cmu.edu Mon Oct 25 21:44:38 2021 From: balzers at cs.cmu.edu (Stephanie Balzer) Date: Mon, 25 Oct 2021 21:44:38 -0400 Subject: [TYPES/announce] PLMW@POPL 2022: 2nd Call for Application Message-ID: <42E4503E-95AA-4208-B1D3-644209FB06E6@cs.cmu.edu> SECOND CALL FOR APPLICATIONS (**DEADLINE: November 1 AoE**) ACM SIGPLAN Programming Languages Mentoring Workshop, Philadelphia, Pennsylvania Tuesday, January 18, 2022 PLMW is co-located with POPL 2022, which takes place ?in person? in Philadelphia. PLMW will feature lightweight options for ?remote participation? (details below). Web page: https://urldefense.com/v3/__https://popl22.sigplan.org/home/PLMW-2022__;!!IBzWLUs!G7frfLeUxVv0dTIngsHjCWMBjjYSX4RNqRS0gehi0cu5aH1YGbH_9GJ53_c0godFJFzudkmPRvzdDA$ After the success of the first ten Programming Languages Mentoring Workshops at POPL 2012-2021, we are announcing the 11th SIGPLAN Programming Languages Mentoring Workshop (PLMW), co-located with the virtual POPL 2022 and organized by Stephanie Balzer, Paul Downen, Robbert Krebbers, and Christine Rizkallah. The purpose of this mentoring workshop is to encourage graduate students and senior undergraduate students to pursue careers in programming language research. This workshop will bring together world leaders in programming languages research and teaching from academia and industry to provide (a) technical sessions on cutting-edge PL research and (b) mentoring sessions on how to prepare for a research career. The workshop will help students imagine how they might contribute to our research community. We especially encourage women and underrepresented minority students, and people with disabilities to attend PLMW. This workshop is part of the activities surrounding POPL, the Symposium on Principles of Programming Languages, and takes place the day before the main conference. One goal of the workshop is to make the POPL conference more accessible to newcomers. We hope that participants will stay through the entire conference. Because physical travel to the workshop location this year may be more difficult for some, there is also an option to attend PLMW remotely. Remote participants of PLMW will be able to view online videos of the workshop talks, access the PLMW Slack channel, and sign up for virtual mentoring sessions with experienced researchers. A number of sponsors (listed below) have generously donated scholarship funds for qualified students to attend PLMW. These scholarships can cover expenses (airfare, hotel, and registration fees) for attendance at both the workshop and the POPL conference. Students attending this year will get one year free student membership of SIGPLAN, unless they prefer to opt out during their application. The workshop registration is open to all. Students with alternative sources of funding are welcome as well. APPLICATION for PLMW: The application can be accessed at the following URL: https://urldefense.com/v3/__https://forms.gle/tsQhsUyB2W4c6ps36__;!!IBzWLUs!G7frfLeUxVv0dTIngsHjCWMBjjYSX4RNqRS0gehi0cu5aH1YGbH_9GJ53_c0godFJFzudklHqU0-Uw$ The deadline for full consideration of funding is Monday, November 1. Please note on the application form whether you intend to attend PLMW in-person, or remotely. Confirmed speakers (so far): Alexandra Silva (Cornell University) Ilya Sergey (National University of Singapore) Niko Matsakis (Amazon Web Services) Liam O?Connor (University of Edinburgh) Talia Ringer (University of Illinois at Urbana-Champaign) Confirmed sponsors (so far): NSF ACM SIGPLAN Jane Street Certora Correct Computation -------------- next part -------------- An HTML attachment was scrubbed... URL: From Luigia.Petre at abo.fi Tue Oct 26 05:18:08 2021 From: Luigia.Petre at abo.fi (Luigia Petre) Date: Tue, 26 Oct 2021 09:18:08 +0000 Subject: [TYPES/announce] Ran Ettinger's tutorial on using Dafny to teach: FME Teaching Committee's Tutorial Series, October edition Message-ID: <73e1624191494fee97618c4257fd7341@abo.fi> Dear all, We are now at the second tutorial in the Tutorial Series of the FME Teaching Committee. The idea is to increase the awareness and sharing of tools and techniques used for teaching formal methods. The tutorials are held online via zoom. We record (whenever the speaker agrees) these presentations and collect them on the FME Teaching Committee website: https://urldefense.com/v3/__https://fme-teaching.github.io/2021/08/24/tutorial-series-of-the-fme-teaching-committee/__;!!IBzWLUs!EEVrPDipM4YWuZrVSX9T6ngh3xN28jjubCFg6D2AwySMOjVb5ONnQjZEefmsCs6_QElhR3l16ZPFaQ$ . [https://urldefense.com/v3/__https://fme-teaching.github.io/2021/08/24/tutorial-series-of-the-fme-teaching-committee/featured.png__;!!IBzWLUs!EEVrPDipM4YWuZrVSX9T6ngh3xN28jjubCFg6D2AwySMOjVb5ONnQjZEefmsCs6_QElhR3nu5jfuNw$ ] Tutorial Series of the FME Teaching Committee | Formal Methods Teaching Committee fme-teaching.github.io Schedule for FMTea tutorials In the FME Teaching Committee, we are launching a new tutorial series, planned to be held monthly. We aim to increase the awareness and sharing of tools and techniques used for teaching formal methods. The tutorial will be held online via zoom. We will record (whenever the speaker agrees) these presentations and collect them on the FME Teaching Committee website. Below you?ll find the list of speakers who agreed to share their FM teaching insight. We are very happy to announce our second speaker in the series: Dr Ran Ettinger (Ben-Gurion University, Israel, https://urldefense.com/v3/__https://www.cs.bgu.ac.il/*ranger/__;fg!!IBzWLUs!EEVrPDipM4YWuZrVSX9T6ngh3xN28jjubCFg6D2AwySMOjVb5ONnQjZEefmsCs6_QElhR3kHV2LULA$ ). Ran's lecture is entitled Teaching Cantor?s theorem, a pumping lemma, and the derivation of a heapsort algorithm using Dafny This tutorial will take place this week on Friday (October 29), at 3pm CET. The zoom coordinates are below. The online event is planned to take about one hour, give or take. Everyone welcome!! With best regards, Luigia Petre on behalf of the FME Teaching Committee PS: The recording of Sandrine's lecture last month is already in the webpage https://urldefense.com/v3/__https://fme-teaching.github.io/2021/08/24/tutorial-series-of-the-fme-teaching-committee/__;!!IBzWLUs!EEVrPDipM4YWuZrVSX9T6ngh3xN28jjubCFg6D2AwySMOjVb5ONnQjZEefmsCs6_QElhR3l16ZPFaQ$ , where Ran's will also appear soon. Luigia Petre is inviting you to a scheduled Zoom meeting. Topic: FMTea Tutorial Series Time: This is a recurring meeting Meet anytime Join Zoom Meeting https://urldefense.com/v3/__https://aboakademi.zoom.us/j/64254430116__;!!IBzWLUs!EEVrPDipM4YWuZrVSX9T6ngh3xN28jjubCFg6D2AwySMOjVb5ONnQjZEefmsCs6_QElhR3nhNqFcEg$ Meeting ID: 642 5443 0116 Join by SIP 64254430116 at 109.105.112.236 64254430116 at 109.105.112.235 Join by H.323 109.105.112.236 109.105.112.235 Meeting ID: 642 5443 0116 __ Luigia Petre, Docent, PhD Faculty of Science and Engineering ?bo Akademi University, Finland https://urldefense.com/v3/__http://www.users.abo.fi/lpetre__;!!IBzWLUs!EEVrPDipM4YWuZrVSX9T6ngh3xN28jjubCFg6D2AwySMOjVb5ONnQjZEefmsCs6_QElhR3n9QEJWmg$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From alexandra.traxler at tuwien.ac.at Thu Oct 28 09:02:43 2021 From: alexandra.traxler at tuwien.ac.at (Traxler, Alexandra) Date: Thu, 28 Oct 2021 13:02:43 +0000 Subject: [TYPES/announce] =?windows-1252?q?Call_for_Applications=3A_Helmu?= =?windows-1252?q?t_Veith_Stipend_for_Female_Master=92s_Students_in_Comput?= =?windows-1252?q?er_Science=5FDL=3A_November_30?= Message-ID: Grant: Helmut Veith Stipend for Female Master?s Students in Computer Science - Scholarship for women in mathematics/computer science ? Annual Deadline: November 30 The Vienna Center for Logic and Algorithms (VCLA) invites applications for the Helmut Veith Stipend from motivated and outstanding female master's students who plan to pursue one of the programs in Computer Science at TU Wien taught in English in one of the following semesters: - winter semester 2021/2022 - summer semester 2022 ------------------------------------------------------------- HELMUT VEITH STIPEND ------------------------------------------------------------- The Helmut Veith Stipend is awarded annually to exceptionally talented and motivated female students in the field of computer science who pursue (or plan to pursue) one of the master's programs in Computer Science at TU Wien taught in English and have (or have the interest to develop) a solid mathematical and technical background in at least one of the areas in which Austrian scientist Helmut Veith worked. The Helmut Veith Stipend is dedicated to the memory of Helmut Veith (1971-2016), an outstanding computer scientist who worked in the fields of logic in computer science, computer-aided verification, software engineering, and computer security. The Helmut Veith Stipend's fund is set up by the TU Wien (Vienna University of Technology), the Wolfgang Pauli Institute, and the colleagues and friends of the late Prof. Veith. ------------------------------------------------------------- Award ------------------------------------------------------------- Students who are awarded the Helmut Veith Stipend receive: -EUR 6000 annually for a duration of up to two years. -Waiver of all tuition fees at TU Wien. ------------------------------------------------------------- Eligibility ------------------------------------------------------------- 1. Applicants must be eligible for admission to one of the master's programs in computer science at TU Wien that are taught in English. In 2021/2022 those are: ? Logic and Computation ? Business Informatics ? Computer Engineering ? Data Science ? Media and Human-Centered Computing 2. While applications for funding can be filed before or in parallel with the admissions process, the funding will only be awarded to applicants who have been unconditionally admitted to the master's program. An application for funding does not replace the admissions process; neither does a conditional offer of funding entitle the applicant to study at TU Wien. 3. Female students who meet the following conditions are eligible to apply for the stipend: ? Bachelor's degree in Computer Science or Mathematics (Bologna first cycle) or equivalent degree ? Extensive mathematical and technical knowledge and interest in (at least one of) Helmut Veith's areas of research: -Logic in Computer Science -Formal Methods and Verification -Foundations of Artificial Intelligence -Algorithms and Complexity Theory -Computer Security ? Proficiency in English ------------------------------------------------------------- Conditions ------------------------------------------------------------- ? Recipients of funding must be committed to demonstrating good progress during their studies, i.e.: -obtain at least 25 ECTS credits from the respective master's curriculum per term on average since the beginning of their master's studies (the deadlines are April 30 for the winter term and November 30 for the summer term), and -achieve a grade average of at most 1.5. ? Recipients of funding have to reside in Austria during term time for the duration of their studies. Exceptions and temporary interruptions of the stay during term time (e.g., for internships or research visits) are subject to approval. ? The stipend is provided for the duration of the master's program (subject to the conditions listed above), for up to 2 years. ------------------------------------------------------------- Application Process ------------------------------------------------------------- Students are required to submit the following documents: ? Cover Letter, describing the type of funding the student is applying for, and all other aspects the student deems relevant for the application ? Curriculum Vitae ? Motivation Letter, describing why the student wants to study in the program Logic and Computation, why funding is necessary, and with which groups of the faculty the student would be interested to work with during their master's thesis and why. ? Reports on university examinations (transcripts) ? Diplomas and/or certificates (first degree, bachelor degree, or higher). If the final academic certificate is not yet available at the time of the application deadline, a preliminary certificate (indicating the type of degree and the expected graduation date) signed and stamped by the degree-awarding university must be provided. ? Contact details of two referees (for letters of recommendation) ? English language certificate (TOEFL or similar) ? Copy of passport A certified translation needs to be provided for documents that are not in German or English. Your application must be submitted electronically to master at logic-cs.at with the subject "Application" as a single PDF document. The name of the PDF file needs to be "document.pdf" ------------------------------------------------------------- Application Deadline ------------------------------------------------------------- The annual deadline for applications is November 30. ------------------------------------------------------------- Questions? ------------------------------------------------------------- Further Information on the Stipend: https://urldefense.com/v3/__http://www.vcla.at/helmut-veith-stipend__;!!IBzWLUs!FySwgXbGca3nwMWiy-YQL00axVgnIWPIxpVMn8uZW_JTiSTEHkeBWndUcbSV8maM_1kQXe_hxsnpZQ$ Please do not hesitate to contact master at logic-cs.at -------------- next part -------------- An HTML attachment was scrubbed... URL: From elenam at morris.umn.edu Thu Oct 28 09:44:18 2021 From: elenam at morris.umn.edu (Elena Machkasova) Date: Thu, 28 Oct 2021 08:44:18 -0500 Subject: [TYPES/announce] Trends in Functional Programming in Education 2022 call for submissions Message-ID: TFPIE 2022 Call for papers https://urldefense.com/v3/__https://wiki.tfpie.science.ru.nl/TFPIE2022__;!!IBzWLUs!B0AdXf1Ov6I2E6Ab3naT27xR7W0yqKxiw0APCP9nwE-Li5QIFTNZOMdTm1cGjcpGu9xzGYXkmkNHsQ$ (February 11th 2022, Krakow, Poland co-located with TFP 2022 and Lambda Days) TFPIE 2022 welcomes submissions describing techniques used in the classroom, tools used in and/or developed for the classroom and any creative use of functional programming (FP) to aid education in or outside Computer Science. Topics of interest include, but are not limited to: FP and beginning CS students FP and Computational Thinking FP and Artificial Intelligence FP in Robotics FP and Music Advanced FP for undergraduates FP in graduate education Engaging students in research using FP FP in Programming Languages FP in the high school curriculum FP as a stepping stone to other CS topics FP and Philosophy The pedagogy of teaching FP FP and e-learning: MOOCs, automated assessment etc. Best Lectures - more details below In addition to papers, we are requesting best lecture presentations. What's your best lecture topic in an FP related course? Do you have a fun way to present FP concepts to novices or perhaps an especially interesting presentation of a difficult topic? In either case, please consider sharing it. Best lecture topics will be selected for presentation based on a short abstract describing the lecture and its interest to TFPIE attendees. The length of the presentation should be comparable to that of a paper. In addition, the speaker can provide commentary on effectiveness or student feedback. Submissions Potential presenters are invited to submit an extended abstract (4-6 pages) or a draft paper (up to 20 pages) in EPTCS style. The authors of accepted presentations will have their preprints and their slides made available on the workshop's website. Papers and abstracts can be submitted via easychair at the following link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=tfpie2022__;!!IBzWLUs!B0AdXf1Ov6I2E6Ab3naT27xR7W0yqKxiw0APCP9nwE-Li5QIFTNZOMdTm1cGjcpGu9xzGYWEimDz3A$ After the workshop, presenters are invited to submit (a revised version of) their article for the formal review. The PC will select the best articles for publication in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and extended abstracts will not be formally reviewed by the PC. Important Dates: Submission deadline: January 5th 2022, Anywhere on Earth. Notification: January 10th 2022 (Note: earlier submissions will receive earlier response) TFPIE Registration Deadline: TBA Workshop: February 11th 2022 Submission for formal review: April 15th 2022, Anywhere on Earth. Notification of full article: June 1st 2022 Camera ready: July 1st 2022 Program Committee: Peter Achten, Radboud University, Netherlands Stephen Chang, University of Massachusetts Boston, USA John Hughes, Chalmers University of Technology, Sweden Elena Machkasova (Chair) - University of Minnesota Morris, USA Kristina Sojakova - INRIA, Paris, France Melinda T?th, E?tv?s Lor?nd University, Budapest, Hungary Registration information: This year TFPIE takes place on the second day of the Lambda Days, concurrent with TFP. Participants will need to register for the Lambda Days. Please note that TFP and TFPIE have in-person attendance only. For registration fee, the deadlines, and the link to register see the Lambda Days web site: https://urldefense.com/v3/__https://www.lambdadays.org/lambdadays2022__;!!IBzWLUs!B0AdXf1Ov6I2E6Ab3naT27xR7W0yqKxiw0APCP9nwE-Li5QIFTNZOMdTm1cGjcpGu9xzGYVXZ8ZAOQ$ Registration and attendance are mandatory for at least one author of every paper that is presented at the workshop. Presenters will have their registration fee waived. Only papers that have been presented at TFPIE may be submitted to the post-reviewing process. -- Dr. Elena Machkasova Associate Professor of Computer Science Division of Science and Mathematics University of Minnesota, Morris Office: Sci 2325 (320) 589-6308 https://urldefense.com/v3/__http://cda.morris.umn.edu/*elenam/__;fg!!IBzWLUs!B0AdXf1Ov6I2E6Ab3naT27xR7W0yqKxiw0APCP9nwE-Li5QIFTNZOMdTm1cGjcpGu9xzGYVQLMz-Vg$ Pronouns: she/her/hers or any other -------------- next part -------------- An HTML attachment was scrubbed... URL: From a.hartmanns at utwente.nl Fri Oct 29 03:00:40 2021 From: a.hartmanns at utwente.nl (Hartmanns, Arnd (UT-EEMCS)) Date: Fri, 29 Oct 2021 07:00:40 +0000 Subject: [TYPES/announce] FormaliSE 2022 @ ICSE: Call for Papers Message-ID: Call for Papers: FormaliSE 2022 10th International Conference on Formal Methods in Software Engineering May 22-23, co-located event of ICSE 2022, Pittsburgh, PA https://urldefense.com/v3/__http://www.formalise.org/__;!!IBzWLUs!EJflI-sj3Y8xxbe0nKZVF0jo5b7MVDFya19V7nALWnk4WAtsY5uteEG67iriF1wDxCz18-PxGNjzXA$ Overview -------- The software industry needs tools and methods to deliver high-quality software. Much progress has been achieved from the early days of software development; still, nowadays, even considering the state of the art of the technologies used, the success of software projects is often not guaranteed. Many of the approaches used for developing large, complex software systems are still not able to ensure the correct behavior ? and the general quality ? of the delivered product, despite the efforts of the (often very qualified and skilled) software engineers involved. This is where formal methods can play a significant role. Indeed, they have been developed to provide the means for greater precision and thoroughness in modeling, reasoning about, validating, and documenting the various aspects of software systems during their development. When carefully applied, formal methods can aid all aspects of software creation: user requirement formulation, design, implementation, verification/testing, and the creation of documentation. After decades of research though, and despite significant advancement, formal methods are still not widely used in industrial software development. We believe that closer integration of formal methods in software engineering can help increase the quality of software applications, and at the same time highlight the benefits of formal methods in terms also of the generated return on investment (ROI). The main objective of the conference is to foster the integration between the formal methods and the software engineering communities, to strengthen the ? still too weak ? links between them, and to stimulate researchers to share ideas, techniques, and results, with the ultimate goal to propose novel solutions to the fraught problem of improving the quality of software systems. Originally a successful satellite workshop of ICSE, since 2018 FormaliSE is organised as a conference co-located with ICSE. FormaliSE 2022 will take place on May 22-23, 2022 in Pittsburgh, PA (or online). Topics of interest ------------------ Areas of interest include but are not limited to: - approaches, methods and tools for verification and validation; - correctness-by-construction approaches for software and systems engineering; - application of formal methods to specific domains, e.g., autonomous, cyber-physical, intelligent, and IoT systems; - formal methods for AI-based systems (FM4AI), and AI applied in formal method approaches (AI4FM); - scalability of formal methods applications; - integration of formal methods within the software development lifecycle (e.g., change management, continuous integration and deployment); - requirements formalization and formal specification; - model-based software engineering approaches; - analysis of performance and other non-functional properties based on formal approaches; - formal methods in a certification context; - formal approaches for safety and security; - usability of formal methods; - guidelines to use formal methods in practice; - case studies developed/analyzed with formal approaches; - experience reports on the application of formal methods to real-world problems. Submission types ---------------- We invite you to submit: - Full research papers that describe authors? original research work and results. We encourage authors to include validation with respect to a case study in the recommended themes. We welcome research papers focusing on tools and tool development. - Case study papers that identify lessons learned, validate theoretical results (such as scalability of methods), or provide specific motivation for further research and development. - Research ideas: FormaliSE encourages the submission of new research ideas in order to stimulate discussions at the conference. Artifact Evaluation (NEW) ------------------------- Reproducibility of experimental results is crucial to foster an atmosphere of trustworthy, open, and reusable research. To improve and reward reproducibility, FormaliSE 2022 for the first time includes a dedicated Artifact Evaluation (AE) procedure. An artifact is any additional material (software, data sets, machine-checkable proofs, etc.) that substantiates the claims made in the paper and ideally makes them fully reproducible. Submission of an artifact is optional but encouraged for all papers where it can support the results presented in the paper. Artifacts will be reviewed concurrently with the paper reviewing process, and the results of the evaluation may be taken into consideration for the corresponding paper acceptance decision. Accepted papers with a successfully evaluated artifact will receive a badge to be shown on the published paper's title page. All papers with an evaluated and publicly archived artifact with a DOI may be allowed one extra page in the camera-ready version to describe the artifact. Submission guidelines --------------------- FormaliSE 2022 will implement the following **light-weight double-blind policy**: Authors of research papers must omit their names and institutions from the title page, refer to their other work in the third person, and omit acknowledgements that could reveal their identity or affiliation. The purpose is to avoid any bias based on authors? identity characteristics, such as gender, seniority, or nationality, in the review process. Our goal is to facilitate an unbiased approach to reviewing by supporting reviewers? access to works that do not carry obvious references to the authors? identities. As mentioned above, this is a light-weight double-blind process. *Anonymization should not be a heavy burden for authors and should not make papers weaker or more difficult to review.* Advertising the paper on alternate forums (e.g., via a personal web-page, preprint archive, email, talks, discussions with colleagues) is permitted, and authors will not be penalized for such advertisement. **Full papers are expected to be up to 10 pages long including all text, figures, tables and appendices, but excluding the references.** (Shorter papers are acceptable). However, we would like to avoid that the authors waste time fitting their papers into that limit at the expense of presentation clarity: *paper lengths slightly exceeding the stated limit will be tolerated provided that the presentation is of high quality*, which will be left at the appreciation of the reviewers. **Research ideas papers are expected to be 4 pages plus up to 1 additional page of references**, with the same guiding principle as for the regular papers above. All submissions must be in English and in PDF format. All submissions must conform to the ACM formatting guidelines. Formatting instructions are available at https://urldefense.com/v3/__https://www.acm.org/publications/proceedings-template__;!!IBzWLUs!EJflI-sj3Y8xxbe0nKZVF0jo5b7MVDFya19V7nALWnk4WAtsY5uteEG67iriF1wDxCz18-Ocaa5MmA$ for both LaTeX and Word users. LaTeX users must use the provided acmart.cls and ACM-Reference-Format.bst without modification, enable the conference format in the preamble of the document (i.e., \documentclass[sigconf,review]{acmart}), and use the ACM reference format for the bibliography (i.e., \bibliographystyle{ACM-Reference-Format}). The review option adds line numbers, thereby allowing referees to refer to specific lines in their comments. Papers submitted to FormaliSE 2022 must not have been published elsewhere and must not be under review or submitted for review elsewhere whilst under consideration for FormaliSE 2022. Submissions to FormaliSE 2022 that meet the above requirements can be made via EasyChair . Artifact submissions are not subject to the double-blind submission requirement since it is in most cases infeasible to properly anonymize an artifact. Note that the paper corresponding to an artifact must still follow the double-blind submissions requirements described above. Artifacts will be handled by a separate Artifact Evaluation Committee, and the Artifact Evaluation process will be set up such that the anonymization of the corresponding papers will not be compromised. Detailed guidelines for preparation and submission of artifacts will be specified on a dedicated web page reachable via https://urldefense.com/v3/__http://www.formalise.org/__;!!IBzWLUs!EJflI-sj3Y8xxbe0nKZVF0jo5b7MVDFya19V7nALWnk4WAtsY5uteEG67iriF1wDxCz18-PxGNjzXA$ . Selection procedure ------------------- Each paper will be reviewed by at least three program committee members. Papers will be judged on the basis of their clarity, relevance, originality, and contribution to the field. FormaliSE 2022 will implement **a light-weight rebuttal scheme**: if all the reviewers of a given submission agree that a clarification from the authors regarding a specific question could move a borderline paper into the acceptable range, the chairs will ask that question to the authors by e-mail and post their reply on EasyChair for the benefit of the reviewers. The goal of such light-weight rebuttals is to eliminate ?coin-toss? decisions on borderline papers. Hence, it will clearly concern only a minority of submissions and most of the authors should not expect to receive such questions. However, *we would ask the corresponding authors of all submissions to make sure that they are available to answer a question by email if the necessity were to arise*. Artifacts will be assessed with respect to their consistency with the results presented in the paper, their completeness, and their documentation and ease of use. The Artifact Evaluation will include an initial check for technical issues; authors of artifacts may be contacted by e-mail within the first two weeks after artifact submission to help resolve any technical problems that prevent the evaluation of an artifact if necessary. Publication ----------- All accepted publications are published as part of the ICSE 2022 Proceedings in the ACM and IEEE Digital Libraries. At least one author of each accepted paper is required to attend the conference ? physically or, if the circumstances warrant so, virtually ? and present the paper in person. Otherwise, the paper will be removed from the proceedings. Important dates --------------- ===================== =========== ==== Abstracts due: 13 January 2022 Submissions due: 20 January 2022 Artifacts due: 27 January 2022 Notifications: 04 March 2022 (to be confirmed) Camera ready copies: 18 March 2022 (to be confirmed) FormaliSE conference: 22-23 May 2022 ===================== =========== ==== Organization ------------ General Chairs ~~~~~~~~~~~~~~ - Stefania Gnesi (Istituto di Scienza e Tecnologie dell'Informazione, Italy) - Nico Plat (Thanos, The Netherlands) Program Chairs ~~~~~~~~~~~~~~ - Ina Schaefer (TU Braunschweig, Germany) - Arnd Hartmanns (University of Twente, The Netherlands) Artifact Evaluation Chair ~~~~~~~~~~~~~~~~~~~~~~~~~ - Carlos E. Budde (Universit? degli Studi di Trento, Italy) Social Media Chair ~~~~~~~~~~~~~~~~~~ - Claudio Menghi (McMaster University, Canada) Program committee ~~~~~~~~~~~~~~~~~ - Toshiaki Aoki (Japan Advanced Institute of Science and Technology, Japan) - Kyungmin Bae (Pohang University of Science and Technology, South Korea) - Simon Bliudze (INRIA Lille, France) - Rab?a Ameur Boulifa (T?l?com Paris, France) - Christiano Braga (Universidade Federal Fluminense, Brazil) - Ana Cavalcanti (University of York, UK) - Nancy Day (University of Waterloo, Canada) - Carlo Furia (Universit? della Svizzera italiana, Switzerland) - Ebru Aydin Gol (Middle East Technical University, Turkey) - Roberta Gori (Universit? di Pisa, Italy) - Laura R. Humphrey (Air Force Research Laboratory, USA) - Marie-Christine Jakobs (Technische Universit?t Darmstadt, Germany) - Sebastian Junges (Radboud Universiteit, The Netherlands) - Wanwei Liu (National University of Defense Technology, China) - Malte Lochau (Universit?t Siegen, Germany) - Ant?nia Lopes (Universidade de Lisboa, Portugal) - Mieke Massink (Istituto di Scienza e Tecnologie dell'Informazione, Italy) - Anastasia Mavridou (NASA Ames Research Center, USA) - Hern?n Melgratti (Universidad de Buenos Aires, Argentina) - Alex Potanin (Victoria University of Wellington, New Zealand) - Gwen Sala?n (Universit? Grenoble Alpes, France) - Sean Sedwards (University of Waterloo, Canada) - Laura Semini (Universit? di Pisa, Italy) - Silvia Lizeth Tapia Tarifa (Universitetet i Oslo, Norway) - Maurice ter Beek (Istituto di Scienza e Tecnologie dell'Informazione, Italy) - Andrea Turrini (Institute of Software, Chinese Academy of Sciences, China) - Marcel Verhoef (European Space Agency, The Netherlands) - Heike Wehrheim (Universit?t Paderborn, Germany) From carsten at dcs.bbk.ac.uk Fri Oct 29 05:11:01 2021 From: carsten at dcs.bbk.ac.uk (Carsten Fuhs) Date: Fri, 29 Oct 2021 10:11:01 +0100 Subject: [TYPES/announce] FSCD 2023: Call for Location Message-ID: <551f774f-54fb-a20e-0e0b-9db3abd6f518@dcs.bbk.ac.uk> (Apologies for multiple copies of this announcement. Please circulate.) --------------- Call for Location for FSCD 2023 The FSCD conference covers all aspects of Formal Structures for Computation and Deduction from theoretical foundations to applications. The annual FSCD conference comprises the main conference and a considerable number of affiliated workshops (expectedly, more than ten). We invite proposals for locations to host the 8th FSCD International Conference to be held during the summer of 2023. Previous (and upcoming) FSCD meetings include: FSCD 2016 in Porto (Portugal); FSCD 2017 in Oxford (UK) co-located with ICFP 2017; FSCD 2018 in Oxford (UK) as part of FLoC 2018; FSCD 2019 in Dortmund (Germany); FSCD 2020 in Paris (France) co-located with IJCAR 2020; FSCD 2021 in Buenos Aires (Argentina); FSCD 2022 in Haifa (Israel) as part of FLoC 2022. The deadline for proposals is *** 22nd January 2022 ***. Proposals should be sent to the FSCD Steering Committee Chair (see contact information below). We encourage proposers to register their intention informally as soon as possible. The proposals will be put forward to the FSCD mailing list for an indicative vote (the results of which will not be made public), after which the final decision about hosting and organising of FSCD 2023 will be taken by the SC. Proposals should address the following points: * FSCD Conference Chair (complete name and current position), host institution, FSCD Local Committee (complete names and current positions), availability of student-volunteers. * National, regional, and local government and industry support, both organizational and financial. * Accessibility to the location (i.e., transportation) and attractiveness of the proposed site. Accessibility can include both information about local transportation and travel information to the location (flight and/or train connections), as well as estimated costs. * Appropriateness of the proposed dates (including consideration of holidays/other events during the period), hotel prices, and access to dormitory facilities for students. * Estimated costs on registration for the conference and workshops, both for regular and student participants. * Conference and exhibit facilities for the anticipated number of registrants (typically around 200). For example: number, capacity and audiovisual equipment of meeting rooms; a large plenary session room that can hold all the registrants; enough rooms for parallel sessions/workshops/tutorials; internet connectivity and workstations for demos/competitions; catering services; and presence of professional staff. * Residence accommodations and food services in a range of price categories and close to the conference venue, for example, number and cost range of hotels, and availability and cost of dormitory rooms (e.g., at local universities) and kind of services they offer. * Other relevant information, which can include information about leisure activities and attractiveness of the location (e.g., cultural and historical aspects, touristic activities, etc...). Contact information: Herman Geuvers herman at cs.ru.nl FSCD SC Chair From jonathan.protzenko at gmail.com Fri Oct 29 21:38:34 2021 From: jonathan.protzenko at gmail.com (Jonathan Protzenko) Date: Fri, 29 Oct 2021 20:38:34 -0500 Subject: [TYPES/announce] Deadline Extension! Call for Presentations: PriSC 2022 @ POPL 2022 Message-ID: Update: the deadline has been extended to Mon Nov 8th. Please submit! All details are on the PriSC site . ================================================ Call for Presentations: PriSC 2022 @ POPL 2022 ================================================ The emerging field of secure compilation aims to preserve security properties of programs when they have been compiled to low-level languages such as assembly, where high-level abstractions don?t exist, and unsafe, unexpected interactions with libraries, other programs, the operating system and even the hardware are possible. For unsafe source languages like C, secure compilation requires careful handling of undefined source-language behavior (like buffer overflows and double frees). Formally, secure compilation aims to protect high-level language abstractions in compiled code, even against adversarial low-level contexts, thus enabling sound reasoning about security in the source language. A complementary goal is to keep the compiled code efficient, often leveraging new hardware security features and advances in compiler design. Other necessary components are identifying and formalizing properties that secure compilers must possess, devising efficient security mechanisms (both software and hardware), and developing effective verification and proof techniques. Research in the field thus puts together advances in compiler design, programming languages, systems security, verification, and computer architecture. 6th Workshop on Principles of Secure Compilation (PriSC 2022) ============================================================= The Workshop on Principles of Secure Compilation (PriSC) is a relatively new, informal 1-day workshop without any proceedings. The goal is to bring together researchers interested in secure compilation and to identify interesting research directions and open challenges. The 6th edition of PriSC will be held on January 22, together with the ACM SIGPLAN Symposium on Principles of Programming Languages (POPL), 2022. We hope to hold the workshop in person with for support for dial-in attendees. Keynote ======= This year's keynote will be "BPF and Spectre: Mitigating transient execution attacks", by Piotr Krysiuk (Symantec, Threat Hunter Team), Benedict Schl?ter (Ruhr University Bochum), Daniel Borkmann (Isovalent, co-maintainer eBPF). Important Dates =============== * Mon 8 Nov 2021: Submission Deadline * Sat 22 Jan 2022: Workshop Presentation Proposals and Attending the Workshop ================================================= Anyone interested in presenting at the workshop should submit an extended abstract (up to 2 pages, details below) covering past, ongoing, or future work. Any topic that could be of interest to secure compilation is in scope. Secure compilation should be interpreted very broadly to include any work in security, programming languages, architecture, systems or their combination that can be leveraged to preserve security properties of programs when they are compiled or to eliminate low-level vulnerabilities. Presentations that provide a useful outside view or challenge the community are also welcome. This includes presentations on new attack vectors such as microarchitectural side-channels, whose defenses could benefit from compiler techniques. Specific topics of interest include but are not limited to: * Attacker models for secure compiler chains. * Secure compiler properties: fully abstract compilation and similar properties, memory safety, control-flow integrity, preservation of safety, information flow and other (hyper-)properties against adversarial contexts, secure multi-language interoperability. * Secure interaction between different programming languages: foreign function interfaces, gradual types, securely combining different memory management strategies. * Enforcement mechanisms and low-level security primitives: static checking, program verification, typed assembly languages, reference monitoring, program rewriting, software-based isolation/hiding techniques (SFI, crypto-based, randomization-based, OS/hypervisor-based), security-oriented architectural features such as Intel?s SGX, MPX and MPK, capability machines, side-channel defenses, object capabilities. * Experimental evaluation and applications of secure compilers. * Proof methods relevant to compilation: (bi)simulation, logical relations, game semantics, trace semantics, multi-language semantics, embedded interpreters. * Formal verification of secure compilation chains (protection mechanisms, compilers, linkers, loaders), machine-checked proofs, translation validation, property-based testing. Guidelines for Submitting Extended Abstracts ============================================ Extended abstracts should be submitted in PDF format and not exceed 2 pages (references not including). They should be formatted in two-column layout, 10pt font, and be printable on A4 and US Letter sized paper. We recommend using the new acmart LaTeX style in sigplan mode. Submissions are not anonymous and should provide sufficient detail to be assessed by the program committee. Presentation at the workshop does not preclude publication elsewhere. Submission website: https://urldefense.com/v3/__https://prisc22.hotcrp.com/__;!!IBzWLUs!CX-gDnyHyiVAcnvJpJ8a3FpPLOmtpqFRW3MckezRsVV09yCI5RNaEgeOOwfZ-AXmcEG3RIVm2Kos2w$ Program Committee ================= Owen Arden, UC Santa Cruz Arthur Azevedo de Amorim, Carnegie Mellon University Iulia Bastys, Chalmers University of Technology Roberto Blanco, Max Planck Institute for Security and Privacy Tegan Brennan, Stevens Institute of Technology Matteo Busi, Universit? di Pisa - Dipartimento di Informatica Sunjay Cauligi, University of California at San Diego Marco Guarnieri, IMDEA Software Institute (co-chair) Arma?l Gu?neau, Aarhus University Johannes Kinder, Bundeswehr University Munich Adrien Koutsos, INRIA Paris Elisavet Kozyri, Arctic University of Norway Scott Moore, Galois Toby Murray, University of Melbourne Andrew C. Myers, Cornell University David Pichardie, Facebook Jonathan Protzenko, Microsoft Research (co-chair) Christine Rizkallah, UNSW Sydney Zhong Shao, Yale University ?ric Tanter, University of Chile Danfeng Zhang, Pennsylvania State University Contact and More Information ============================ You can find more information on the workshop website: https://urldefense.com/v3/__https://popl22.sigplan.org/home/prisc-2022__;!!IBzWLUs!CX-gDnyHyiVAcnvJpJ8a3FpPLOmtpqFRW3MckezRsVV09yCI5RNaEgeOOwfZ-AXmcEG3RIXQoZw61g$ For questions please contact the workshop chairs, Jonathan Protzenko and Marco Guarnieri . From hugo.jonker at ou.nl Fri Oct 29 10:20:06 2021 From: hugo.jonker at ou.nl (Hugo) Date: Fri, 29 Oct 2021 16:20:06 +0200 Subject: [TYPES/announce] 2 assistant professor positions (OU Netherlands) Message-ID: <5672e227-79b3-c74f-cbf0-9de4db65108f@ou.nl> Dear colleagues, The CS department of the OU has two open positions for assistant professors. We're looking for academics with a passion for teaching. One position concerns a more generic profile, the other is focused on AI: - https://urldefense.com/v3/__https://www.academictransfer.com/nl/305867/universitair-docent-informatica/__;!!IBzWLUs!HaEABZDxQJ19aKgAOfE8JAcNLGYmlnc4S9Ak5FAk7lCK7_lTBKYf0PhhgylCdtF6Nj3PRJvNhrf97Q$ - https://urldefense.com/v3/__https://www.academictransfer.com/nl/305874/assistant-professor-artificial-intelligence/__;!!IBzWLUs!HaEABZDxQJ19aKgAOfE8JAcNLGYmlnc4S9Ak5FAk7lCK7_lTBKYf0PhhgylCdtF6Nj3PRJv-CKgZ9A$ We appreciate you forwarding this to potential candidates; I'm happy to answer informal queries, should you have any. Kind regards, Hugo. -- dr. ir. Hugo Jonker Open Universiteit Valkenburgerweg 177 6419 AT Heerlen Netherlands phone: +31 45 576 2143 From helloqirun at gmail.com Sun Oct 31 12:43:13 2021 From: helloqirun at gmail.com (Qirun Zhang) Date: Sun, 31 Oct 2021 12:43:13 -0400 Subject: [TYPES/announce] Faculty Position at Georgia Tech Message-ID: We are hiring in the general PLSE area this year. Please feel free to reach out to me if you have any questions. Thanks. The School of Computer Science at the Georgia Institute of Technology (Georgia Tech) invites applications for several tenure track faculty positions at all ranks. We seek candidates in all areas that complement and enhance our current research strengths, and are especially interested this year in candidates whose research focus is in the broad areas of theoretical computer science, machine learning, computer architecture, and software engineering. Applicants must show evidence of outstanding academic credentials and stellar potential in their field of study, a sincere commitment to teaching, a proclivity to engage in substantive interdisciplinary and collaborative research locally or globally, and an interest in fostering a diverse, equitable, and inclusive academic community. Georgia Tech is an equal education/employment opportunity institution dedicated to building a diverse community. We strongly encourage applications from women, underrepresented groups, individuals with disabilities, and veterans. Georgia Tech has policies to promote a healthy work-life balance and is aware that attracting faculty may require meeting the needs of two careers. The School of Computer Science, one of four schools in the top-ten ranked College of Computing, focuses on research that makes computing and communication smart, fast, reliable, and secure, with research groups in computer architecture, databases, machine learning, networking, programming languages compilers, software engineering, systems, and theory. Faculty from our school are leaders in a variety of Georgia Tech initiatives, including the Algorithms and Randomness Center (ARC), the Center for Machine Learning (ML at GT), the Center for Research into Novel Computing Hierarchies (CRNCH), and the Institute for Data Engineering and Science (IDEaS). Successful applicants will also have opportunities, where appropriate, for joint or shared academic appointments with the newly formed School of Cybersecurity and Privacy within the College of Computing and collaborative research that spans disciplinary boundaries at Georgia Tech. Georgia Tech is a top-ranked public research university situated in the heart of Atlanta, a diverse and vibrant city with multiple universities. Midtown Atlanta, where Georgia Tech?s 370+ acre campus is located, has been recognized as one of the 2016 Great Neighborhoods by the American Planning Association due to its liveliness, walkability, and many great cultural and economic strengths. The Institute is a member of the University System of Georgia, the Georgia Research Alliance, and the Association of American Universities. Georgia Tech prides itself on its culture of collaboration, technology resources, high-quality student body, and its commitment to diversity, equity, and inclusion. Applications will be considered until open positions are filled. *For full consideration, applicants are encouraged to submit their applications by December 15, 2021, at this link here: * https://urldefense.com/v3/__https://academicjobsonline.org/ajo/jobs/19994__;!!IBzWLUs!Aa1BZdeU1EOPGG88H3QveM93reLCpctRv0Oek7c8pnpWZ5MMTCUVO5VJKOujtxjS96mcAQVNjlXJNQ$ . Your full application should include a cover letter, research statement, teaching statement, diversity and inclusivity statement, curriculum vitae, and the contact information of at least three references. We ask that applicants clearly indicate their research area(s) and focus in their cover letters. Georgia Tech provides equal opportunity to all faculty, staff, students, and all other members of the Georgia Tech community, including applicants for admission and/or employment, contractors, volunteers, and participants in institutional programs, activities, or services. Georgia Tech complies with all applicable laws and regulations governing equal opportunity in the workplace and in educational activities. Georgia Tech prohibits discrimination, including discriminatory harassment, on the basis of race, ethnicity, ancestry, color, religion, sex (including pregnancy), sexual orientation, gender identity, national origin, age, disability, genetics, or veteran status in its programs, activities, employment, and admissions. This prohibition applies to faculty, staff, students, and all other members of the Georgia Tech community, including affiliates, invitees, and guests. Best, Qirun Zhang Assistant Professor School of Computer Science College of Computing Georgia Institute of Technology https://urldefense.com/v3/__https://www.cc.gatech.edu/*qrzhang/__;fg!!IBzWLUs!Aa1BZdeU1EOPGG88H3QveM93reLCpctRv0Oek7c8pnpWZ5MMTCUVO5VJKOujtxjS96mcAQUvrMlz6Q$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From rl.stpuu at gmail.com Sun Oct 31 15:35:48 2021 From: rl.stpuu at gmail.com (Roussanka Loukanova) Date: Sun, 31 Oct 2021 20:35:48 +0100 Subject: [TYPES/announce] CfP extended deadline: LACompLing2021 / Logic and Algorithms in Computational Linguistics 2021, MALIN, Montpellier Message-ID: CALL FOR PAPERS extended deadline Symposium Logic and Algorithms in Computational Linguistics 2021 (LACompLing2021) 13 - 17 December 2021, online https://urldefense.com/v3/__https://staff.math.su.se/rloukanova/LACompLing2021-web/__;!!IBzWLUs!FAYlaPYbf02XBmnPeQ3Oz-ksYRMxEkvLLWUdaesGmW9nopVIjmrWaSK8gpRUaV_9dNRVfb0HhsTwzQ$ LACompLing2021 is part of the week Mathematical Linguistics (MALIN) 2021, Universit? de Montpellier (UM), Montpellier, France, 13 - 17 December 2021, Online DESCRIPTION of LACompLing Computational linguistics studies natural language in its various manifestations from a computational point of view, both on the theoretical level (modeling grammar modules dealing with natural language form and meaning, and the relation between these two) and on the practical level (developing applications for language and speech technology). Right from the start in the 1950s, there have been strong links with computer science, logic, and many areas of mathematics - one can think of Chomsky's contributions to the theory of formal languages and automata, or Lambek's logical modeling of natural language syntax. The symposium assesses the place of logic, mathematics, and computer science in present day computational linguistics. It intends to be a forum for presenting new results as well as work in progress. SCOPE of LACompLing The symposium focuses mainly on logical approaches to computational processing of natural language, and on the applicability of methods and techniques from the study of artificial languages (programming/logic) in computational linguistics. We invite participation and submissions from other relevant approaches too, especially if they can inspire new work and approaches. The topics of LACompLing2021 include, but are not limited to: - Computational theories of human language - Computational syntax - Computational semantics - Computational syntax-semantics interface - Interfaces between morphology, lexicon, syntax, semantics, speech, text, pragmatics - Computational grammar - Logic and reasoning systems for linguistics - Type theories for linguistics - Models of computation and algorithms for linguistics - Computational approaches of computational linguistics for domain specific areas - Language processing - Parsing algorithms - Generation of language from semantic representations - Large-scale grammars of natural languages - Multilingual processing - Computational theories and systems of reasoning in natural language - Data science in language processing - Machine learning of language - Interdisciplinary methods - Integration of formal, computational, model theoretic, graphical, diagrammatic, statistical, and other related methods - Logic for information extraction or expression in written and / or spoken language - Language theories based on biological fundamentals of information and languages - Computational neuroscience of language LACompLing2021 is especially interested in topics on the interconnections between Logic, Language, and Argumentation, e.g.: - Formal languages of reasoning and argumentation - Algorithms related to natural language of argumentation - theories, implementations, applications - Formal models of argumentations - Logic of preferences - Beliefs, attitudes, persuasions - theories and applications IMPORTANT DATES Extended Submission and Notification Submission: 14 November 2021 (was 30 October 2021) Notification: 21 November 2021 (was 6 November 2021) Final submissions: TBA ?? LACompLing2021: 13 - 17 December 2021 SUBMISSION INSTRUCTIONS We welcome submissions of abstracts of presentations of original work. The intended papers should not be submitted concurrently to another conference or conference event and should not have been published or submitted for publication consideration elsewhere. NOTE: We will not accept submissions that are on work submitted to another event at MALIN 2021, concurrently during the submission to LACompLing2021. - Submission of abstracts of presentations: limited to 1 page, including the title, other heading material, about half of a page text, and references - Authors can submit more than one abstract. Invited speakers can submit invited and contributed abstracts - The camera-ready submissions may require all the necessary typesetting sources, which are not in the standard LaTeX distribution Typesetting Instructions For LaTeX, authors are required to use Springer LNCS package. Styles and templates can be downloaded from Springer, for LaTeX (recommended!) and Microsoft Word: https://urldefense.com/v3/__https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines__;!!IBzWLUs!FAYlaPYbf02XBmnPeQ3Oz-ksYRMxEkvLLWUdaesGmW9nopVIjmrWaSK8gpRUaV_9dNRVfb0Y2YpFgQ$ For bibliography citations, please use BibTeX with: \bibliographystyle{spmpsci} SUBMISSIONS The submission Web page for LACompLing2021 is: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=lacompling2021__;!!IBzWLUs!FAYlaPYbf02XBmnPeQ3Oz-ksYRMxEkvLLWUdaesGmW9nopVIjmrWaSK8gpRUaV_9dNRVfb0ULRbuqA$ PUBLICATIONS We will organize a post-conference, special volume after the symposium LACompLing2021, for publication of extended papers based on accepted abstracts with presentations at LACompLing2021. The submissions to the special volume have to be original, unpublished, and not concurrently submitted elsewhere. They will go through thorough peer reviews. ORGANIZATION of LACompLing2021 CHAIRS of LACompLing2021 Roussanka Loukanova, IMI, BAS, Sofia, Bulgaria and Stockholm University, Stockholm, Sweden Reinhard Muskens, ILLC, Universiteit van Amsterdam, Amsterdam, The Netherlands PROGRAM CHAIRS of LACompLing2021 Roussanka Loukanova, IMI, BAS, Sofia, Bulgaria and Stockholm University, Stockholm, Sweden Richard Moot, LIRMM-CNRS, Montpellier, France Christian Retor?, Universit? de Montpellier and LIRMM-CNRS, Montpellier, France ORGANISATION of LACompLing2021 at Stockholm University Peter LeFanu Lumsdaine, Stockholm University, Stockholm, Sweden (local organiser, publication chair) Axel Ljungstr?m, Stockholm University, Stockholm, Sweden (local organiser, publication associate) Roussanka Loukanova, IMI, BAS, Sofia, Bulgaria and Stockholm University, Stockholm, Sweden (chair) Contact LACompLing 2021 -------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From Graham.Hutton at nottingham.ac.uk Mon Nov 1 08:18:54 2021 From: Graham.Hutton at nottingham.ac.uk (Graham Hutton) Date: Mon, 1 Nov 2021 12:18:54 +0000 Subject: [TYPES/announce] Journal of Functional Programming - Call For PhD Abstracts Message-ID: Dear all, If you or one of your students recently completed a PhD in the area of functional programming, please submit the dissertation abstract for publication in JFP: simple process, no refereeing, open access, 200 published to date, deadline 30th November 2021. Please share! Best wishes, Graham Hutton ============================================================ CALL FOR PHD ABSTRACTS Journal of Functional Programming Deadline: 30th November 2021 https://urldefense.com/v3/__http://tinyurl.com/jfp-phd-abstracts__;!!IBzWLUs!FLTZX4BH88CBmJOfCGgaxPehxmsW2LAM7RZI_Figi9GtlXZEj5PBNDnHc1-X_v_c61LHt_W0G2-vSw$ ============================================================ PREAMBLE: Many students complete PhDs in functional programming each year. As a service to the community, twice per year the Journal of Functional Programming publishes the abstracts from PhD dissertations completed during the previous year. The abstracts are made freely available on the JFP website, i.e. not behind any paywall. They do not require any transfer of copyright, merely a license from the author. A dissertation is eligible for inclusion if parts of it have or could have appeared in JFP, that is, if it is in the general area of functional programming. The abstracts are not reviewed. Please submit dissertation abstracts according to the instructions below. We welcome submissions from both the PhD student and PhD advisor/supervisor although we encourage them to coordinate. ============================================================ SUBMISSION: Please submit the following information to Graham Hutton by 30th November 2021. o Dissertation title: (including any subtitle) o Student: (full name) o Awarding institution: (full name and country) o Date of PhD award: (month and year; depending on the institution, this may be the date of the viva, corrections being approved, graduation ceremony, or otherwise) o Advisor/supervisor: (full names) o Dissertation URL: (please provide a permanently accessible link to the dissertation if you have one, such as to an institutional repository or other public archive; links to personal web pages should be considered a last resort) o Dissertation abstract: (plain text, maximum 350 words; you may use \emph{...} for emphasis, but we prefer no other markup or formatting; if your original abstract exceeds the word limit, please submit an abridged version within the limit) Please do not submit a copy of the dissertation itself, as this is not required. JFP reserves the right to decline to publish abstracts that are not deemed appropriate. ============================================================ PHD ABSTRACT EDITOR: Graham Hutton School of Computer Science University of Nottingham Nottingham NG8 1BB United Kingdom ============================================================ This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law. From A.Lisitsa at liverpool.ac.uk Tue Nov 2 07:39:09 2021 From: A.Lisitsa at liverpool.ac.uk (Lisitsa, Alexei) Date: Tue, 2 Nov 2021 11:39:09 +0000 Subject: [TYPES/announce] First CFP VPT 2022 Tenth International Workshop on Verification and Program Transformation Message-ID: <38fd95eb4e37410cbba62d4495a62dc3@liverpool.ac.uk> *************************************************************** FIRST CALL FOR PAPERS Tenth International Workshop on Verification and Program Transformation April 2nd, 2022, M?nchen, Germany https://urldefense.com/v3/__http://refal.botik.ru/vpt/vpt2022__;!!IBzWLUs!FxrRvWbqICDSbW5z4tkke1Ocsju8jYJxHXr6zlkYWwKzL5N5Tz_bp7C1IrEcJFQkapekmN8AtejRBQ$ Co-Located with the 25th European joint Conference on Theory and Practice of Software (ETAPS 2022) *************************************************************** VPT-2022 Invited Speakers: Elvira Albert, Complutense University of Madrid, Spain https://urldefense.com/v3/__http://costa.fdi.ucm.es/*elvira/__;fg!!IBzWLUs!FxrRvWbqICDSbW5z4tkke1Ocsju8jYJxHXr6zlkYWwKzL5N5Tz_bp7C1IrEcJFQkapekmN_56pq_bA$ ... TBA *************************************************************** The Tenth International Workshop on Verification and Program Transformation (VPT 2022) aims to bring together researchers working in the areas of Program Verification and Program Transformation. The previous workshops in this series were: VPT 2013, Saint Petersburg, Russia VPT 2014, Vienna, Austria VPT 2015, London, UK VPT 2016, Eindhoven, The Netherlands VPT 2017, Uppsala, Sweden MARS/VPT 2018, Thessaloniki, Greece VPT 2019, Genova, Italy VPT 2020, Dublin, Ireland (online) VPT 2021, Luxembourg, Luxembourg (online) The workshop solicits research, position, application, and system description papers with a special emphasis on case studies, demonstrating viability of the interactions between the research fields of program transformation and program verification in a broad sense. Also papers in related areas, such as program testing and program synthesis are welcomed. Topics of interest include, but are not limited to: * Verification by Program Transformation * Verification Techniques in Program Transformation and Synthesis * Verification and Certification of Programs Transformations * Program Analysis and Transformation * Program Testing and Transformation * Verifiable Computing and Program Transformation * Case studies *Important Dates* * January 10th, 2022: Abstract submission deadline * January 17th, 2022: Regular paper submission deadline * January 31st, 2022: Extended abstracts and presentation-only papers submission deadline * February 14th, 2022: Acceptance notification * February 28th, 2022: Camera ready version (for the informal pre-proceedings) * April 2nd, 2022: Workshop * May 16th, 2022: Revised paper submission for the formal proceedings in EPTCS deadline *Submission Guidelines* Authors should submit an electronic copy of the paper in PDF, formatted in the Electronic Proceedings in Theoretical Computer Science LaTeX Style (https://urldefense.com/v3/__http://style.eptcs.org/__;!!IBzWLUs!FxrRvWbqICDSbW5z4tkke1Ocsju8jYJxHXr6zlkYWwKzL5N5Tz_bp7C1IrEcJFQkapekmN_-gkJ4Aw$ ), via the Easychair submission website for VPT 2022: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=vpt2022__;!!IBzWLUs!FxrRvWbqICDSbW5z4tkke1Ocsju8jYJxHXr6zlkYWwKzL5N5Tz_bp7C1IrEcJFQkapekmN80lhHSmA$ Regular papers must describe original work that has not been published, or currently submitted, to a journal, conference, or workshop with refereed proceedings. Also papers that already appeared in unpublished or informally published workshop proceedings may be submitted. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email; abstract; and three to four keywords that will be used to assist the PC in selecting appropriate reviewers for the paper. Page numbers should appear on the manuscript to help the reviewers in writing their report. Regular paper submissions should not exceed 15 pages including references but excluding well-marked appendices not intended for publication. Reviewers are not required to read the appendices, and thus papers should be intelligible without them. *Proceedings* Revised versions of all the accepted papers and accepted extended abstracts, taking into account the feedback received at the workshop, will be published in a volume of the Electronic Proceedings in Theoretical Computer Science (EPTCS) series after the workshop. If the workshop attracts sufficiently many high quality papers, a special issue of a journal on the topic of the workshop will be considered. The special issue will be open to high quality papers accepted for presentation in previous editions of the workshop. Program Committee: Grigory Fedyukovich, Princeton University, USA John P. Gallagher, Roskilde University, Denmark Geoff W. Hamilton, Dublin City University, Republic of Ireland (Chair) Michael Hanus, University of Kiel, Germany Marie-Christine Jakobs, Ludwig-Maximilians-Universitat, Munchen, Germany Alexei Lisitsa, The University of Liverpool, UK Andrei P. Nemytykh, Program Systems Institute of RAS, Russia Maurizio Proietti, IASI-CNR, Rome, Italy Gabriel Radanne, IRIF, Inria, Paris, France Philipp R?mmer, Uppsala University, Sweden Germ?n Vidal, Technical University of Val?ncia, Spain Organisers: Alexei Lisitsa (The University of Liverpool, UK) Andrei P. Nemytykh (Program Systems Institute of RAS, Russia) Contacts E-mail: Geoff Hamilton, geoffrey.hamilton at dcu.ie Alexei Lisitsa, a.lisitsa at csc.liv.ac.uk Andrei P. Nemytykh, nemytykh at math.botik.ru Web: https://urldefense.com/v3/__http://refal.botik.ru/vpt/vpt2022/__;!!IBzWLUs!FxrRvWbqICDSbW5z4tkke1Ocsju8jYJxHXr6zlkYWwKzL5N5Tz_bp7C1IrEcJFQkapekmN98xcTThQ$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From manuel.hermenegildo at imdea.org Tue Nov 2 15:17:26 2021 From: manuel.hermenegildo at imdea.org (Manuel Hermenegildo) Date: Tue, 2 Nov 2021 20:17:26 +0100 Subject: [TYPES/announce] Tenure-track Faculty Positions at the IMDEA Software Institute Message-ID: <24961.36550.874976.59530@gazelle.local> TENURE-TRACK FACULTY POSITIONS AT THE IMDEA SOFTWARE INSTITUTE The IMDEA Software Institute invites applications for tenure-track (Assistant Professor) faculty positions. We are primarily interested in recruiting excellent candidates in the areas of: Systems in general, including Distributed Systems, Embedded Systems, Databases, IoT and Edge Computing, etc.; Privacy; Machine Learning; Cyber-Physical Systems; and Software Engineering. Exceptional candidates in other topics within the general research areas of the Institute will also be considered. Tenured-level (Associate and Full Professor) applications are also welcome. The primary mission of the IMDEA Software Institute is to perform research of excellence at the highest international level in software development technologies. It is one of the highest-ranked institutions worldwide in its main topic areas. * Selection Process The main selection criteria are the candidate's demonstrated ability and commitment to research, the match of interests with the Institute's mission, and how the candidate complements areas of established strengths of the Institute. All positions require a doctoral degree in Computer Science or a closely related area, earned by the expected start date. Candidates for tenure-track positions will have shown exceptional promise in research and will have displayed an ability to work independently as well as collaboratively. Candidates for tenured positions must have an outstanding research record, recognized international stature, and demonstrated leadership abilities. Experience in graduate student supervision is also valued at this level. Applications should be completed using the application form at: https://urldefense.com/v3/__https://careers.software.imdea.org/__;!!IBzWLUs!HqPvovNVylpUdgyz1MmkGWmjhn9GACCKo57kpnnWLGrkiIe_IZg6YxoH796dWHYXm1_Zg0Vnt5SPgA$ Please select the reference "2021-10-faculty-call" at the beginning of the form. For full consideration, complete applications must be received by December 20, 2021, although applications will continue to be accepted until the positions are filled. * Working at the IMDEA Software Institute The Institute is located in the vibrant area of Madrid, Spain. It offers an ideal working environment, combining the best aspects of a research center and a university department. Its researchers can focus on developing new ideas and projects, in collaboration with world-leading, international faculty, post-docs, and students. Researchers also have the opportunity (but no obligation) to teach university courses. The Institute offers institutional funding and also encourages its members to participate in national and international research projects. The working language at the Institute is English. Salaries at the Institute are internationally competitive and established on an individual basis. They include social security provisions in accordance with existing national Spanish legislation, and in particular access to an excellent public health care system. Further information about the Institute's current faculty and research can be found at https://urldefense.com/v3/__http://www.software.imdea.org__;!!IBzWLUs!HqPvovNVylpUdgyz1MmkGWmjhn9GACCKo57kpnnWLGrkiIe_IZg6YxoH796dWHYXm1_Zg0XiMZCCQg$ . The IMDEA Software Institute is an Equal Opportunity Employer and strongly encourages applications from a diverse and international community and underrepresented groups. The Institute complies with the European Charter for Researchers. From patrick.baillot at univ-lille.fr Wed Nov 3 15:54:26 2021 From: patrick.baillot at univ-lille.fr (Patrick Baillot) Date: Wed, 3 Nov 2021 20:54:26 +0100 (CET) Subject: [TYPES/announce] webinar by Martin Avanzini as part of SCOT seminar: On Continuation-Passing Transformations and Expected Cost Analysis : Nov 9th 2021, 3pm-4pm (CET) Message-ID: <1620896197.10749910.1635969266699.JavaMail.zimbra@univ-lille.fr> Dear colleagues, The next talk of the Semantic and Formal Approaches to Complexity (SCOT) webinar will be given by Martin Avanzini. Abstract and practical informations are given below. You are welcome to attend it on Zoom. To obtain the connexion informations and/or be informed of future talks, please subscribe to the mailing list (for that send an email with subject "subscribe scot_webinar" and empty body to sympa at groupes.renater.fr). Tuesday November 9th 2021, 3pm-4pm (CET). Martin Avanzini (Inria Sophia-Antipolis). Title: On Continuation-Passing Transformations and Expected Cost Analysis - the room will open at 2:45pm (CET). You can come with your coffee for a chat! - the talk will start at 3:00 pm. Abstract: In this talk I will present recent joint work with Ugo Dal Lago and Gilles Barthe, which is concerned with a novel methodology for the cost analysis of randomized higher-order programs, i.e., programs which can sample values from chosen distributions during execution, and at the same time are capable of treating functions as first-class citizens. The evaluation of such a program results in a distribution of values, and has an expected cost, namely the average cost the program experiences along its execution. The way we tackle such an expected cost analysis is reminiscent of the seminal work of Rosendahl (1989), and lies in turning the program at hand into a second one, which is structurally quite similar but computes the cost of execution in addition. This turns an intensional property, namely the cost of execution, into an extensional one. A crucial aspect of this program transformation is that probabilistic effects are eliminated along the way, thereby enabling classical reasoning tools for non-probabilistic programs in our context. As one such tool we propose a slight variation of a standard higher-order logic, dubbed EHOL, which we also use to study some classical examples from probability theory. For the seminar: Isabel Oitavem, Patrick Baillot, Ugo Dal Lago ------------------------ Seminar web page: https://urldefense.com/v3/__http://www.cs.unibo.it/*dallago/SCOSEM/__;fg!!IBzWLUs!DvCcv9xBlTNQDMTDnBnfuQYSIT2PKXmhE8cOyFWYey0MSJu1z2FuTi1GHAna8Zdoe4JePztdSF0wyQ$ The list's homepage: https://urldefense.com/v3/__https://groupes.renater.fr/sympa/info/scot_webinar__;!!IBzWLUs!DvCcv9xBlTNQDMTDnBnfuQYSIT2PKXmhE8cOyFWYey0MSJu1z2FuTi1GHAna8Zdoe4JePzuEyIZDzQ$ General information about mailing lists: https://urldefense.com/v3/__https://groupes.renater.fr/sympa/help/introduction__;!!IBzWLUs!DvCcv9xBlTNQDMTDnBnfuQYSIT2PKXmhE8cOyFWYey0MSJu1z2FuTi1GHAna8Zdoe4JePzuhkLhmtA$ To unsubscribe from this list: send an email with subject "unsubscribe scot_webinar" and empty body to sympa at groupes.renater.fr If you wish to subscribe: same procedure with subject "subscribe scot_webinar" From harley.eades at gmail.com Thu Nov 4 10:20:54 2021 From: harley.eades at gmail.com (Harley D. Eades III) Date: Thu, 4 Nov 2021 10:20:54 -0400 Subject: [TYPES/announce] Seminar talk on Tight Polynomial Worst-Case Bounds for Loop Programs Message-ID: On Friday, Nov. 5, 2021 between 1pm and 2pm EDT (5pm - 6pm UTC), Dr. Geoff Hamilton will be giving a presentation as part of the CS Colloquium Series at Augusta University. Presentation details can be found here: https://urldefense.com/v3/__https://the-au-forml-lab.github.io/colloquium_talks/Hamilton.html__;!!IBzWLUs!C053zbUwTBFMb3A0lguaMw-WaMbVg8pDG6_PdBOuL89TBSyj41x8XJAaMM6Sr08ZWbrrr20ktPHRFQ$ These talks are open to the general public via Zoom and Youtube. I'll be live streaming it on Youtube. If you are interested in attending the Zoom meeting please RSVP with me before the talk. Note that this semester we are using a new Zoom account and so the access link is different from past semesters so please RSVP. Questions will be taken from those on Zoom and YouTube. If you care to watch via YouTube, please use the following link: https://urldefense.com/v3/__https://youtu.be/l8NT3ReVUu4__;!!IBzWLUs!C053zbUwTBFMb3A0lguaMw-WaMbVg8pDG6_PdBOuL89TBSyj41x8XJAaMM6Sr08ZWbrrr22n_DQBlg$ Feel free to share this message with everyone you know. I hope all of you, your family and friends are doing well! Best, Harley -------------- next part -------------- An HTML attachment was scrubbed... URL: From marta.kwiatkowska at cs.ox.ac.uk Thu Nov 4 14:18:30 2021 From: marta.kwiatkowska at cs.ox.ac.uk (Marta Kwiatkowska) Date: Thu, 4 Nov 2021 18:18:30 +0000 Subject: [TYPES/announce] Associate Professorship (or Professorship) in Automated Verification at Oxford In-Reply-To: <05011664-24dd-1f05-675c-725284fa2377@cs.ox.ac.uk> References: <05011664-24dd-1f05-675c-725284fa2377@cs.ox.ac.uk> Message-ID: Associate Professorship/Professorship in Automated Verification *with a tutorial fellowship at Trinity College* *UNIVERSITY of OXFORD* https://urldefense.com/v3/__http://www.cs.ox.ac.uk/news/1976-full.html__;!!IBzWLUs!BuQm4Z1VBz3RyxyVsFbPyGsywGAo20sz3eM0JiQCNLtUx7-XWE1JO-b7IjzQ5zArxpGETWBW5ZDNrQ$ Applications are invited for the post of Associate Professor (or Professor) of Automated Verification in the Department of Computer Science and Trinity College, to start before October 2022. The successful candidate will also be appointed as a Fellow and Tutor in Computer Science at Trinity College, and will be responsible for the organisation and teaching of their subject within the College. You will be a member of both the University and the College community, part of a lively and intellectually stimulating research community with access to the excellent research facilities which Oxford offers. You will have a role to play in the running of the College as a member of the Governing Body and a trustee of the College as a charity. The Department of Computer Science is a vibrant and growing academic department, which has a research profile across the entire spectrum of contemporary computer science.? You will be expected to engage in independent and original research aligned with the Automated Verification research theme, to secure funding and engage in the management of research projects and disseminate research of the highest international standard through publications, conferences and seminars.? You will also contribute to teaching on the Department?s highly successful undergraduate and graduate programmes. You will hold a doctoral degree in Computer Science (or cognate discipline), have the ability to teach across a range of Computer Science subjects, and will also have a proven research record of high quality at international level, and experience of research collaborations at both national and international level. *We are a Stonewall Top 100 Employer, Living Wage and Mindful Employer, holding an Athena Swan Bronze Award, HR excellence in Research and Race Equality Charter Bronze Award.* Demonstrating a commitment to provide equality of opportunity, we would particularly welcome applications from women and black and minority ethnic applicants who are currently under-represented within the Computer Science Department. *All applicants will be judged on merit, according to the selection criteria.* Our staff and students come from all over the world and we proudly promote a friendly and inclusive culture. Diversity is positively encouraged, through diversity groups and champions, for example https://urldefense.com/v3/__http://www.cs.ox.ac.uk/aboutus/women-cs-oxford/index.html__;!!IBzWLUs!BuQm4Z1VBz3RyxyVsFbPyGsywGAo20sz3eM0JiQCNLtUx7-XWE1JO-b7IjzQ5zArxpGETWBzKO9YuQ$ , as well as a number of family-friendly policies, such as the right to apply for flexible working, support for staff returning from periods of extended absence, to apply for funding from the carer?s fund. We are committed to ensuring an inclusive interview process and will reimburse up to ?250 towards any additional care costs (for a dependent child or adult) incurred as a result of attending an interview for this position, which may not be applicable if the interviews are held remotely. *The closing date for applications is 12 noon on 21 January 2022.** * *Interviews are expected to be held on 4 March 2022.* Further particulars are available from: https://urldefense.com/v3/__http://www.cs.ox.ac.uk/news/1976-full.html__;!!IBzWLUs!BuQm4Z1VBz3RyxyVsFbPyGsywGAo20sz3eM0JiQCNLtUx7-XWE1JO-b7IjzQ5zArxpGETWBW5ZDNrQ$ https://urldefense.com/v3/__http://www.cs.ox.ac.uk/files/12971/153743*20-*20Job*20Description*20and*20Selection*20Criteria.pdf__;JSUlJSUl!!IBzWLUs!BuQm4Z1VBz3RyxyVsFbPyGsywGAo20sz3eM0JiQCNLtUx7-XWE1JO-b7IjzQ5zArxpGETWD_pF6o4A$ -- Professor Marta Kwiatkowska FRS Associate Head of MPLS Division Fellow of Trinity College Department of Computer Science University of Oxford Wolfson Building, Parks Road Oxford, OX1 3QD Tel: +44 (0)1865 283509 Email:Marta.Kwiatkowska at cs.ox.ac.uk URL:https://urldefense.com/v3/__http://www.cs.ox.ac.uk/people/marta.kwiatkowska/__;!!IBzWLUs!BuQm4Z1VBz3RyxyVsFbPyGsywGAo20sz3eM0JiQCNLtUx7-XWE1JO-b7IjzQ5zArxpGETWCNa6mi7Q$ PA and Project Officer: Anita Hancox Email:anita.hancox at cs.ox.ac.uk, Tel: +44 (0)1865 610754 -------------- next part -------------- An HTML attachment was scrubbed... URL: From lammich at in.tum.de Fri Nov 5 08:39:22 2021 From: lammich at in.tum.de (Peter Lammich) Date: Fri, 05 Nov 2021 13:39:22 +0100 Subject: [TYPES/announce] VerifyThis 2022 --- Call for Problems Message-ID: <97fc9fad947623e4ab198b75eeee9b9cf08d352c.camel@in.tum.de> VerifyThis 2022: Call for Problems apologies for multiple postings. VerifyThis is a series of program verification competitions, which has taken place annually since 2011 (with the exception of 2020). Previous competitions in the series have been held at FoVeOOS 2011, FM 2012, Dagstuhl (April 2014), and ETAPS 2015?2021. To extend the problem pool and tend better to the needs of the participants, we are soliciting verification problems for the competition: A problem should contain an informal statement of the algorithm to be implemented (optionally with complete or partial pseudo code) and the requirement(s) to be verified.A problem should be suitable for a 60?90 minute time slot.Submission of reference solutions is strongly encouraged.Problems with an inherent language- or tool-specific bias should be clearly identified as such.Problems that contain several subproblems or other means of difficulty scaling are especially welcome.The organizers reserve the right (but no obligation) to use the problems in the competition, either as submitted or with modifications.Submissions from (potential) competition participants are allowed.Problems from previous competitions can be seen at the archive. Please send submissions via email to verifythis at googlegroups.com by January 31, 2022. The most suitable submission for competition will receive a prize. -------------- next part -------------- An HTML attachment was scrubbed... URL: From maaike.annebeth at gmail.com Mon Nov 8 04:43:19 2021 From: maaike.annebeth at gmail.com (Maaike Zwart) Date: Mon, 8 Nov 2021 10:43:19 +0100 Subject: [TYPES/announce] SYCO 8 - Call for Participation Message-ID: -------------------------------------------------------- CALL FOR PARTICIPATION EIGHTH SYMPOSIUM ON COMPOSITIONAL STRUCTURES (SYCO 8) Tallinn University of Technology, Estonia 13-14 December 2021 Registration deadline: 6 December 2021 (AoE) https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/8/__;!!IBzWLUs!BVohDgoWGzYuiOxY-CJhmCgOvEVqGKBZgbHTUZ6xHqLY73GWSAxz20zANAgNx_ZubP7KrSfV6q4c5w$ -------------------------------------------------------- The Symposium on Compositional Structures (SYCO) is an interdisciplinary series of meetings aiming to support the growing community of researchers interested in the phenomenon of compositionality, from both applied and abstract perspectives, and in particular where category theory serves as a unifying common language. Previous SYCO events have been held at University of Birmingham, University of Strathclyde, University of Oxford, Chapman University, and University of Leicester. SYCO 8 will be held at Tallinn University of Technology, replacing the cancelled SYCO 7. The programme consists of 2 invited talks and 16 contributed talks. -------------------------------------------------------- INVITED TALKS * John van de Wetering (Radboud University Nijmegen) Title TBA * Christine Tasson (Sorbonne Universit?) Title TBA -------------------------------------------------------- CONTRIBUTED TALKS * Stefan Zetzsche, Gerco van Heerdt, Matteo Sammartino and Alexandra Silva - Canonical automata via distributive law homomorphisms * Simon Henry and Nicholas Meadows - Higher Theories and Monads * Paulina Goedicke and Jamie Vicary - A Category Theoretical Description of Block Designs and Quantum Designs * Vincent Wang-Mascianica and Bob Coecke - Talking Space: Inference from spatial linguistic meanings * Lukas Heidemann - Frames in pretriangulated dg-categories * Elena Di Lavore, Wilmer Leal and Valeria de Paiva - Dialectica Petri nets * George Kaye, Dan Ghica and David Sprunger - Normalisation by evaluation for digital circuits * Guillaume Boisseau and Robin Piedeleu - Graphical Piecewise-Linear Algebra * Liliane-Joy Dandy, Emmanuel Jeandel and Vladimir Zamdzhiev - Qimaera: Type-safe (Variational) Quantum Programming in Idris * Matt Wilson and Augustin Vanrietvelde - Composable constraints * Davide Trotta, Matteo Spadetto and Valeria de Paiva - Dialectica Logical Principles * Simon Fortier-Garceau - Interventions and Counterfactuals for Categorical Models of Causality * Vikraman Choudhury - Weighted sets and modalities * Elena Di Lavore and Pawel Sobocinski - Monoidal width * Dylan McDermott and Alan Mycroft - On the relation between call-by-value and call-by-name * Olivier Peltre - Homological algebra for message-passing algorithms -------------------------------------------------------- REGISTRATION Registration is open until the 6th of December, 2021. Please register via this online form: https://urldefense.com/v3/__https://docs.google.com/forms/d/e/1FAIpQLSfAgcQnimYJPM2msBraTU_0k-8zAqwwalYzpSgVtfKgfjkptA/viewform__;!!IBzWLUs!BVohDgoWGzYuiOxY-CJhmCgOvEVqGKBZgbHTUZ6xHqLY73GWSAxz20zANAgNx_ZubP7KrSdod8NZvA$ Registration is free. More details are available on the conference website: https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/8/__;!!IBzWLUs!BVohDgoWGzYuiOxY-CJhmCgOvEVqGKBZgbHTUZ6xHqLY73GWSAxz20zANAgNx_ZubP7KrSfV6q4c5w$ -------------------------------------------------------- COVID-19 SITUATION IN ESTONIA In the last weeks, there has been a concerning rise in the number of COVID-19 cases and hospitalisations in Estonia. A considerable majority of serious cases concern the unvaccinated, and so far the government of Estonia has not introduced major restrictions on those who can prove recovery and/or vaccination with an EU-approved vaccine. In light of that, at the moment we are carrying on with the event in a hybrid form, as planned, and inviting those who are willing, and have proof of recovery and/or vaccination, to participate in person. At the moment, for the UK, EU, and Schengen countries, proof of vaccination or recovery, and the filling of a passenger locator form, is sufficient to avoid self-isolation on arrival to Estonia. Please consult the government web page for the latest regulations: https://urldefense.com/v3/__https://vm.ee/en/information-countries-and-self-isolation-requirements-passengers__;!!IBzWLUs!BVohDgoWGzYuiOxY-CJhmCgOvEVqGKBZgbHTUZ6xHqLY73GWSAxz20zANAgNx_ZubP7KrSeG361lXw$ In the unlikely event of new restrictions that make it impossible to hold the event as planned, we will send out an update on mailing lists and on the SYCO 8 website no later than the beginning of December. -------------------------------------------------------- PROGRAMME COMMITTEE Ross Duncan, University of Strathclyde Alexandre Goy, MICS, CentraleSup?lec Amar Hadzihasanovic, Tallinn University of Technology (local organiser) Jules Hedges, University of Strathclyde Chris Heunen, University of Edinburgh Aleks Kissinger, University of Oxford Jade Master, University of Strathclyde Dan Marsden, University of Oxford Hector Miller-Bakewell Samuel Mimram, ?cole Polytechnique Koko Muroya, Kyoto University Simona Paoli, University of Aberdeen Mehrnoosh Sadrzadeh, University College London Maru Sarazola, Johns Hopkins University Pawel Sobocinski, Tallinn University of Technology (local organiser) Christina Vasilakopoulou, University of Patras Jamie Vicary, University of Cambridge Maaike Zwart, IT University of Copenhagen (chair) -------------------------------------------------------------- STEERING COMMITTEE Ross Duncan, University of Strathclyde Chris Heunen, University of Edinburgh Dominic Horsman, University of Grenoble Aleks Kissinger, University of Oxford Samuel Mimram, ?cole Polytechnique Simona Paoli, University of Aberdeen Mehrnoosh Sadrzadeh, University College London Pawel Sobocinski, Tallinn University of Technology Jamie Vicary, University of Cambridge -------------- next part -------------- An HTML attachment was scrubbed... URL: From Neil.JR.Ross at Dal.Ca Mon Nov 8 15:12:41 2021 From: Neil.JR.Ross at Dal.Ca (Julien Ross) Date: Mon, 8 Nov 2021 20:12:41 +0000 Subject: [TYPES/announce] Postdoc in quantum computation at Dalhousie Message-ID: Dear colleagues, We are looking for a postdoctoral researcher in quantum computation to join the Department of Mathematics and Statistics at Dalhousie University. Our department has expertise in quantum programming languages and the theory of quantum circuits, with an emphasis on the use of mathematical techniques coming from algebra, logic, number theory, and category theory. Familiarity with one or more of these areas would be an asset. The position is initially for 1 year, and can be extended for an additional year. The salary is CAD $50,000 per year plus benefits. The application deadline is December 31, 2021, but applications may be considered until the position is filled. An application package should consist of a cover letter, a curriculum vitae (including a complete list of publications), a research statement, and two letters of recommendations. Application packages and any inquiries about the positions should be sent to neil.jr.ross at dal.ca and peter.selinger at dal.ca Dalhousie University is committed to fostering a collegial culture grounded in diversity and inclusiveness. The university encourages applications from Aboriginal people, persons with a disability, racially visible persons, women, persons of minority sexual orientations and gender identities, and all candidates who would contribute to the diversity of our community. Best, Julien -------------- next part -------------- An HTML attachment was scrubbed... URL: From alexey.gotsman at imdea.org Tue Nov 9 04:35:47 2021 From: alexey.gotsman at imdea.org (Alexey Gotsman) Date: Tue, 9 Nov 2021 10:35:47 +0100 Subject: [TYPES/announce] Postdoc position in distributed computing at the IMDEA Software Institute Message-ID: Applications are invited for a postdoc position at the IMDEA Software Institute in Madrid, Spain. The successful candidate will work under the supervision of Alexey Gotsman (https://urldefense.com/v3/__https://software.imdea.org/*gotsman/__;fg!!IBzWLUs!FJLHfUxN51laoXQiqq-QhAhDmnBJIj0hzQBw9R8QsnzIKzbhyt_IeWDpvsBYPfa3cjR0s_7Ty7ptNA$ ), with research topics determined based on the common interests of the candidate and the supervisor. Possible areas include blockchains and distributed transaction processing. This covers algorithms, correctness proofs and system engineering. Candidates should have, or expect shortly to obtain, a PhD in Computer Science, with expertise in distributed computing theory, distributed systems or formal methods. The position is initially for one year, with possibilities for extension. The starting date is negotiable. The position is based in Madrid, Spain, where the IMDEA Software Institute is situated. The institute provides for travel expenses and an internationally competitive salary. The working language at the institute is English. Applicants interested in the position should submit their application at https://urldefense.com/v3/__https://careers.software.imdea.org/using__;!!IBzWLUs!FJLHfUxN51laoXQiqq-QhAhDmnBJIj0hzQBw9R8QsnzIKzbhyt_IeWDpvsBYPfa3cjR0s_6IkkGLyQ$ reference code 2021-11-postdoc-distributed. The deadline for applications is January 9th, 2022. For enquiries about the position please contact Alexey Gotsman (https://urldefense.com/v3/__https://software.imdea.org/*gotsman/__;fg!!IBzWLUs!FJLHfUxN51laoXQiqq-QhAhDmnBJIj0hzQBw9R8QsnzIKzbhyt_IeWDpvsBYPfa3cjR0s_7Ty7ptNA$ ). From christine.tasson at lip6.fr Tue Nov 9 05:18:24 2021 From: christine.tasson at lip6.fr (Christine Tasson) Date: Tue, 9 Nov 2021 11:18:24 +0100 Subject: [TYPES/announce] =?utf-8?q?PhD_openings_in_Programming_Language_?= =?utf-8?q?at_Sorbonne_Universit=C3=A9=2C_Paris?= Message-ID: <28d809d6-3887-b6d3-9daa-cac0cd7e0bbc@lip6.fr> We are opening a PhD position in collaboration between the LiP6 lab at Sorbonne Universit?, Paris and the Renault Software labs based in Toulouse. The PhD will start in the first semester of 2022 and the position is for 3 years. The job will be mainly in Paris, Campus Jussieu with some visit at Renault in Toulouse. == Objectives The project aims at designing the prototype of a Domain Specific Language based on functional reactive programming and used to model automotive systems. The language will be compiled to high insurance programming languages such as SCADE and to interoperable language such as Kotlin. == Expectations from the candidates We expect some experience in the field of formal methods of software engineering, in a general sense. The typical candidate would be someone who graduated im Computer Science with a curriculum in Programming Languages (compilation, functional programming or reactive programming, practice of shared development). == How to apply The PhD position should be filled as soon as possible and before June 2022. The first step to apply is to contact Christine Tasson and Sebastien Tasson , joining a detailed CV and a motivation letter. From kallas at seas.upenn.edu Tue Nov 9 12:08:32 2021 From: kallas at seas.upenn.edu (Konstantinos Kallas) Date: Tue, 9 Nov 2021 12:08:32 -0500 Subject: [TYPES/announce] POPL 2022 CALL FOR STUDENT VOLUNTEERS Message-ID: ## POPL 2022 CALL FOR STUDENT VOLUNTEERS POPL is a leading forum for the discussion of all aspects of programming languages and programming systems, from theoretical to experimental aspects. In order to smoothly run the conference and associated workshops and tutorials, we need student volunteers to help out on the practical aspect of the organization. All the events associated with POPL ?22 will take place from Sun 16 to Sat 22 January 2022 in Philadelphia, Pennsylvania, USA. The student volunteer program is a chance for students from around the world to participate in the conferences whilst assisting us in preparing and running the events. In return, volunteers are granted free registration to the conferences, tutorials, workshops, and panel, and a ticket for the banquet. As a POPL 2022 Student Volunteer, you will interact closely with researchers, academics and practitioners from various disciplines and meet other students from around the world. Job assignments for student volunteers include but are not restricted to: assisting with technical sessions, workshops, tutorials and panels, checking badges at doors, operating the information desk, providing information about the conference to attendees, helping with traffic flow, and general assistance to keep the conferences running smoothly. To be considered as a Student Volunteer for POPL, please fill in the application form: https://urldefense.com/v3/__https://forms.gle/wSJJWdwYAm125Qw67__;!!IBzWLUs!HE8XA5j4Zec6qfvhbFTsbSdGyHeM5fQtiKHwX0_NXX_EpGvB4MVpjGGYWRSk_nR2diTE_1TiphBGCQ$ There are two rounds of calls: - deadline for first round: Nov 24rd, 2021 AoE (notification: Dec 3) - deadline for second round: Dec 13th, 2021 AoE (notification: Dec 17) Positive notifications given in the first round are firm, and the second round is only for spots not filled by the first round. If you have any questions feel free to contact Aaron Weiss (aweiss at hey.com) or Konstantinos Kallas (kallas at seas.upenn.edu). -------------- next part -------------- An HTML attachment was scrubbed... URL: From afelty at uottawa.ca Tue Nov 9 21:01:10 2021 From: afelty at uottawa.ca (Amy Felty) Date: Wed, 10 Nov 2021 02:01:10 +0000 Subject: [TYPES/announce] Faculty positions at University of Ottawa Message-ID: <426E7459-323D-4361-9595-1FD93C7AB656@uottawa.ca> The University of Ottawa invites applications for one Tier 2 Canada Research Chair (CRC) in Cybersecurity. The selected candidate will hold tenure-track faculty positions in the Faculty of Engineering and will be expected to establish a strong, externally funded, and collaborative research program, in the broadly defined area of cybersecurity that will complement the existing expertise of the School of Electrical Engineering and Computer Science. The candidate will be a member of the School and will contribute to teaching and service in the School. The candidate will work in either hardware or software areas of cybersecurity with potential emphasis on issues such as tamper-resistant hardware, side-channel resistant algorithms, secure storage devices, power analysis, secure algorithms and software-based techniques for Cybersecurity. Shaping the Digital World is one of the four pillars of the University?s Strategic Research Plan. Cybersecurity is a key component of the Faculty of Engineering?s Technology for the Digital Transformation of Society research axis. This position will participate in the establishment of a Cyber Hub at the University of Ottawa with the goal of becoming a globally recognized university in cybersecurity and cybersafety research and education by 2025. Application deadline is December 22. [English version]: Tier 2 Canada Research Chair in Cybersecurity [French version]: Chaire de recherche du Canada de niveau 2 en cybers?curit? The Department of Mathematics and Statistics of the University of Ottawa invites applications to fill at least one tenure-track position in Quantum Information or Artificial Intelligence at the Assistant or Associate Professor level, to begin July 1, 2022. We welcome candidates in the research areas of Quantum Information (QI) or Artificial Intelligence (AI). Emphasis will be given to candidates with demonstrated attention to mathematical aspects of QI or AI. Application deadline is December 1. [English and French versions]: https://urldefense.com/v3/__https://www.mathjobs.org/jobs/list/18914__;!!IBzWLUs!CNrdW5-6z0dcI3JXy_wWFGbaxxEq4A_KGqDcdamDhb-lZ29dkDOk4s-yYVq_E1nEejAmpunhR-QQqQ$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From harley.eades at gmail.com Wed Nov 10 09:49:23 2021 From: harley.eades at gmail.com (Harley D. Eades III) Date: Wed, 10 Nov 2021 09:49:23 -0500 Subject: [TYPES/announce] Seminar talk on Integrating Usability into Programming Language Design Message-ID: On Friday, Nov. 12, 2021 between 1pm and 2pm EST (6pm - 7pm UTC), Dr. Jonathan Aldrich will be giving a presentation as part of the CS Colloquium Series at Augusta University. Presentation details can be found here: https://urldefense.com/v3/__https://the-au-forml-lab.github.io/colloquium_talks/Aldrich.html__;!!IBzWLUs!AMcZeBB1Cnlu9o4rusDMISPs6DvNFd20830xNpJpqIvlPFEMUIzEc2I2XvHF4wTc9j-CFxuBX1Fi-Q$ Jonathan will be telling us about his super interesting work to "integrate interdisciplinary methods, including qualitative and quantitative user studies, into the language design process." This is something that is long over do, and I'm excited to see what this looks like. These talks are open to the general public via Zoom and Youtube. I'll be live streaming it on Youtube. If you are interested in attending the Zoom meeting please RSVP with me before the talk. Note that this semester we are using a new Zoom account and so the access link is different from past semesters so please RSVP. Questions will be taken from those on Zoom and YouTube. If you care to watch via YouTube, please use the following link: https://urldefense.com/v3/__https://youtu.be/38qBwZGUMMs__;!!IBzWLUs!AMcZeBB1Cnlu9o4rusDMISPs6DvNFd20830xNpJpqIvlPFEMUIzEc2I2XvHF4wTc9j-CFxvf2HS_8A$ Feel free to share this message with everyone you know. I hope all of you, your family and friends are doing well! Best, Harley -------------- next part -------------- An HTML attachment was scrubbed... URL: From ndanner at wesleyan.edu Thu Nov 11 11:47:22 2021 From: ndanner at wesleyan.edu (Norman Danner) Date: Thu, 11 Nov 2021 11:47:22 -0500 Subject: [TYPES/announce] Tenure-track assistant professorship at Wesleyan University Message-ID: <9044607.2C25zkMZAn@laika> The Department of Mathematics and Computer Science at Wesleyan University invites applications for a tenure track assistant professorship in Computer Science to begin in Fall 2022. Candidates must have a Ph.D. in Computer Science or a related field in hand by the time of appointment to be hired as an Assistant Professor; a successful candidate may be hired as an Instructor if the candidate does not have a Ph.D. in hand at the time of appointment, but will complete the Ph.D. in Computer Science or a related field within one year of hire. We encourage candidates in all areas of Computer Science to apply, including those who deepen or broaden our existing research strengths, and especially encourage candidates who can contribute to the diversity (broadly conceived) of the department. Theory, programming languages, algorithms, network science, networking, and privacy and security are well-represented in the department. Duties include conducting an independent program of research, teaching, advising and mentoring students, and participating in faculty governance at the departmental and university level. Tenure track faculty in Computer Science at Wesleyan teach three courses per year. Wesleyan values both research and teaching highly and has a strong and diverse student body. Applications must include a cover letter, curriculum vitae, research statement, and teaching statement. Applicants must also have three letters of recommendation, at least one of which discusses teaching, submitted by the recommenders at the AcademicJobsOnline.org website. In the cover letter, applicants should describe how they will embrace the college's commitment to fostering an inclusive community, as well as their experience working with individuals from historically marginalized or underserved groups. Applications must be submitted online through https://urldefense.com/v3/__https://academicjobsonline.org/ajo/jobs/19001__;!!IBzWLUs!GBm8Gqpf5Df0UkEKd_GxodtLjXNkH36WMuwNgo3fi6_OqGlK7UcBZlW_FtLC1EZ_c7vQwfhTyshyHQ$ . We will begin reviewing applications on Dec. 1, 2021. Other correspondence regarding this position may be sent to ndanner at wesleyan.edu. -- Norman Danner - ndanner at wesleyan.edu - https://urldefense.com/v3/__http://ndanner.web.wesleyan.edu__;!!IBzWLUs!GBm8Gqpf5Df0UkEKd_GxodtLjXNkH36WMuwNgo3fi6_OqGlK7UcBZlW_FtLC1EZ_c7vQwfj8QAz_Qg$ Department of Mathematics and Computer Science - Wesleyan University From havelund at gmail.com Sun Nov 14 19:42:44 2021 From: havelund at gmail.com (Klaus Havelund) Date: Sun, 14 Nov 2021 16:42:44 -0800 Subject: [TYPES/announce] NFM 2022 - THIRD CALL FOR PAPERS Message-ID: NFM 2022 - THIRD CALL FOR PAPERS The 14th NASA Formal Methods Symposium https://urldefense.com/v3/__https://nfm2022.caltech.edu__;!!IBzWLUs!GiFwYqdW37lVE0-ldLCUrqXcyB8IBNrlUqFj0hBM6Bpa96ZriFcwqA0Yqq3SqBF8rGltcd8CiKsp7A$ May 24-27, 2022 Pasadena, California, USA The symposium is planned to be held in person at California Institute of Technology, but potentially transitioning to fully virtual if the COVID situation persists. Virtual presentations will be possible even if the conference is held in-person. The symposium has NO registration fee for presenting and attending. IMPORTANT DATES - Abstract Submission: December 3, 2021 - Paper Submission: December 10, 2021 - Paper Notifications: February 4, 2022 - Camera-ready Papers: March 4, 2022 - Symposium: May 24-27, 2022 THEME OF SYMPOSIUM The widespread use and increasing complexity of mission-critical and safety-critical systems at NASA and in the aerospace industry requires advanced techniques that address these systems' specification, design, verification, validation, and certification requirements. The NASA Formal Methods Symposium (NFM) is a forum to foster collaboration between theoreticians and practitioners from NASA, academia, and industry. NFM's goals are to identify challenges and to provide solutions for achieving assurance for such critical systems. The focus of the symposium will be on formal/rigorous techniques for software assurance, including their theory, current capabilities and limitations, as well as their potential application to aerospace during all stages of the software life-cycle. The NASA Formal Methods Symposium is an annual event organized by the NASA Formal Methods (NFM) Research Group, composed of researchers spanning six NASA centers. The organization of NFM 2022 is being led by the Jet Propulsion Laboratory (JPL), located in Pasadena, California. TOPICS ON INTEREST Topics of interest include, but are not limited to, the following aspects of formal methods: Advances in formal methods - Interactive and automated theorem proving - SMT and SAT solving - Model checking - Static analysis - Runtime verification - Automated testing - Specification languages, textual and graphical - Refinement - Code synthesis - Design for verification and correct-by-design techniques - Requirements specification and analysis Integration of formal methods techniques - Integration of diverse formal methods techniques - Use of machine learning and probabilistic reasoning techniques in formal methods - Integration of formal methods into software engineering practices - Combination of formal methods with simulation and analysis techniques - Formal methods and fault tolerance, resilient computing, and self healing systems - Formal methods and graphical modeling languages such as SysML, UML, MATLAB/Simulink - Formal methods and autonomy, e.g., verification of systems and languages for planning and scheduling (PDDL, Plexil, etc.), self-sufficient systems, and fault-tolerant systems. Formal methods in practice - Experience reports of application of formal methods on real systems, such as autonomous systems, safety-critical systems, concurrent and distributed systems, cyber-physical, embedded, and hybrid systems, fault-detection, diagnostics, and prognostics systems, and human-machine interaction analysis. - Use of formal methods in systems engineering (including hardware components) - Use of formal methods in education - Reports on negative results in the development and the application for formal methods in practice. - Usability of formal method tools, and their infusion into industrial contexts. - Challenge problems for future reference by the formal methods community. The formulation of these papers can range from plain English description of a problem over formal specifications, to specific implementations in a programming language. NASA OPEN SOURCE Courageous authors, who want to delve in open source software being applied in real NASA missions, and find possible connections to and applications of Formal Methods, are invited to visit the open source repositories for the following two frameworks for programming flight software: - F? (https://urldefense.com/v3/__https://nasa.github.io/fprime/__;!!IBzWLUs!GiFwYqdW37lVE0-ldLCUrqXcyB8IBNrlUqFj0hBM6Bpa96ZriFcwqA0Yqq3SqBF8rGltcd8UqkCPLA$ ) - cFS (https://urldefense.com/v3/__https://cfs.gsfc.nasa.gov/__;!!IBzWLUs!GiFwYqdW37lVE0-ldLCUrqXcyB8IBNrlUqFj0hBM6Bpa96ZriFcwqA0Yqq3SqBF8rGltcd_ge4aY_g$ ) SUBMISSIONS There are two categories of submissions: - Regular papers describing fully developed work and complete results (maximum 15 pages, excluding references); - Short papers on tools, experience reports, or work in progress with preliminary results (maximum 6 pages, excluding references). Additional appendices can be submitted as supplementary material for reviewing purposes. They will not be included in the proceedings. All papers must be in English and describe original work that has not been published. All submissions will be reviewed by at least three members of the Program Committee. Reviewing is Single-blind. We encourage authors to focus on readability of their submissions. Papers will appear in the Formal Methods subline of Springer's Lecture Notes in Computer Science (LNCS) and must use LNCS style formatting ( https://urldefense.com/v3/__https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines__;!!IBzWLUs!GiFwYqdW37lVE0-ldLCUrqXcyB8IBNrlUqFj0hBM6Bpa96ZriFcwqA0Yqq3SqBF8rGltcd84hCeB4A$ ). Papers must be submitted in PDF format at the EasyChair submission site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=nfm2022__;!!IBzWLUs!GiFwYqdW37lVE0-ldLCUrqXcyB8IBNrlUqFj0hBM6Bpa96ZriFcwqA0Yqq3SqBF8rGltcd-JuqknGw$ . Authors of selected best papers will be invited to submit an extended version to a special issue in Springer's Innovations in Systems and Software Engineering: A NASA Journal (https://urldefense.com/v3/__https://www.springer.com/journal/11334__;!!IBzWLUs!GiFwYqdW37lVE0-ldLCUrqXcyB8IBNrlUqFj0hBM6Bpa96ZriFcwqA0Yqq3SqBF8rGltcd-RrUGmCQ$ ). ARTIFACTS Authors are encouraged, but not strictly required, to submit artifacts that support the conclusions of their work (if allowed by their institutions). Artifacts may contain software, mechanized proofs, benchmarks, examples, case studies and data sets. Artifacts will be evaluated by the Program Committee together with the paper. ORGANIZERS PC chairs - Klaus Havelund, JPL, USA - Jyo Deshmukh, USC, USA - Ivan Perez, NIA, USA Application Advisors - Robert Bocchino, JPL, USA - John Day, JPL, USA - Maged Elasaar, JPL, USA - Amalaye Oyake, Blue Origin, USA - Nicolas Rouquette, JPL, USA - Vandi Verma, JPL, USA Application advisors advise the PC chairs to ensure a strong connection to the problems facing NASA. Local Organizer - Richard Murray, Caltech, USA Scientific Advisor - Mani Chandy, Caltech, USA Program Committee - Aaron Dutle, NASA, USA - Alessandro Cimatti, Fondazione Bruno Kessler, Italy - Anastasia Mavridou, SGT Inc. / NASA Ames Research Center, USA - Anne-Kathrin Schmuck, Max-Planck-Institute for Software Systems, Germany - Arie Gurfinkel, University of Waterloo, Canada - Bardh Hoxha, Toyota Research Institute North America, USA - Bernd Finkbeiner, CISPA Helmholtz Center for Information Security, Germany - Betty H.C. Cheng, Michigan State University, USA - Borzoo Bonakdarpour, Michigan State University, USA - Carolyn Talcott, SRI International, USA - Chuchu Fan, MIT, USA - Constance Heitmeyer, Naval Research Laboratory, USA - Corina Pasareanu, CMU, NASA, KBR, USA - Cristina Seceleanu, M?lardalen University, Sweden - Dejan Nickovic, Austrian Institute of Technology AIT, Austria - Dirk Beyer, LMU Munich, Germany - Doron Peled, Bar Ilan University, Israel - Erika Abraham, RWTH Aachen University, Germany - Ewen Denney, NASA, USA - Gerard Holzmann, Nimble Research, USA - Giles Reger, The University of Manchester, UK - Huafeng Yu, TOYOTA InfoTechnology Center USA, USA - Jean-Christophe Filliatre, CNRS, France - Johann Schumann, NASA, USA - John Day, Jet Propulsion Laboratory, USA - Julia Badger, NASA, USA - Julien Signoles, CEA LIST, France - Kerianne Hobbs, Air Force Research Laboratory, USA - Kristin Yvonne Rozier, Iowa State University, USA - Leonardo Mariani, University of Milano Bicocca, Italy - Lu Feng, University of Virginia, USA - Marcel Verhoef, European Space Agency, The Netherlands - Marie Farrell, Maynooth University, Ireland - Marieke Huisman, University of Twente, The Netherlands - Marielle Stoelinga, University of Twente, The Netherlands - Martin Feather, Jet Propulsion Laboratory, USA - Martin Leucker, University of Luebeck, Germany - Michael Lowry, NASA, USA - Misty Davies, NASA, USA - Natasha Neogi, NASA, USA - Nicolas Rouquette, Jet Propulsion Laboratory, USA - Nikos Arechiga, Toyota Research Institute, USA - Rajeev Joshi, Amazon Web Services, USA - Stanley Bak, Stony Brook University, USA - Sylvie Boldo, INRIA, France - Vandi Verma, NASA, USA - Willem Visser, Amazon Web Services, USA CONTACT Email: nfm2022 [at] easychair [dot] org -------------- next part -------------- An HTML attachment was scrubbed... URL: From patrick.baillot at univ-lille.fr Mon Nov 15 03:29:25 2021 From: patrick.baillot at univ-lille.fr (Patrick Baillot) Date: Mon, 15 Nov 2021 09:29:25 +0100 (CET) Subject: [TYPES/announce] First CFP Logic and Complexity (LCC 2022) workshop Message-ID: <1332050293.21463255.1636964965144.JavaMail.zimbra@univ-lille.fr> ================================================================= First Call for Contributions LCC 2022 22nd International Workshop on Logic and Computational Complexity February 20, 2022, Online Collocated with CSL 2022 https://urldefense.com/v3/__http://www.cs.swansea.ac.uk/lcc/__;!!IBzWLUs!CcZMd1Il2UAQnt3zbkY7sxgcGCBwt-cWJsjcCcZft_UtZZjQw7tMwKwH_tCLylfgxXBvB-H9Z8HOng$ ================================================================= LCC meetings are aimed at the foundational interconnections between logic and computational complexity, as present, for example, in implicit computational complexity (descriptive and type-theoretic methods); deductive formalisms as they relate to complexity (e.g. ramification, weak comprehension, bounded arithmetic, linear logic and resource logics); complexity aspects of finite model theory and databases; complexity-mindful program derivation and verification; computational complexity at higher type; and proof complexity. The program will consist of invited lectures as well as contributed talks selected by the Program Committee. IMPORTANT DATES: * submission December 12, 2021 * notification January 3, 2022 * workshop February 20, 2022 SUBMISSION: Submissions must be in English and in the form of an abstract of about 3-4 pages. All submissions should be submitted through Easychair at: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=lcc22__;!!IBzWLUs!CcZMd1Il2UAQnt3zbkY7sxgcGCBwt-cWJsjcCcZft_UtZZjQw7tMwKwH_tCLylfgxXBvB-HR4HFe_g$ We also welcome submissions of abstracts based on work submitted or published elsewhere, provided that all pertinent information is disclosed at submission time. There will be no formal reviewing as is usually understood in peer-reviewed conferences with published proceedings. The program committee checks relevance and may provide additional feedback. PROGRAM COMMITTEE: Patrick Baillot (CNRS, University of Lille, France, co-chair) Meghyn Bienvenu (CNRS, University of Bordeaux, France) Juha Kontinen (University of Helsinki, Finland, co-chair) Cynthia Kop (Radboud University Nijmegen, The Netherlands) Barnaby Martin (Durhan University, UK) Nicole Schweikardt (Humboldt-University Berlin, Germany) CONTACT: To contact the workshop organizers, please send e-mail to lcc22 at easychair.org From dilian at kth.se Mon Nov 15 05:00:24 2021 From: dilian at kth.se (Dilian Gurov) Date: Mon, 15 Nov 2021 11:00:24 +0100 Subject: [TYPES/announce] PhD Position in Deductive Verification of Safety-Critical Software In-Reply-To: <715f68e0-f4d3-b026-1c4e-d8e6139dd447@kth.se> References: <715f68e0-f4d3-b026-1c4e-d8e6139dd447@kth.se> Message-ID: <041a72d6-b545-dae9-805c-af99880586fb@kth.se> The Theoretical Computer Science Group at KTH Royal Institute of Technology invites applications for a PhD position in Computer Science focusing on Deductive Verification of Safety-Critical Embedded Software. The doctoral position is within a collaboration project between KTH and Scania, and addresses the need for functional safety of embedded vehicle software. The project relies on formal verification techniques, such as deductive software verification and model checking. The two main problems that the project aims to solve are the problem of connecting, in a formal way, requirements at different systems levels, and the problem of automating the verification process. The first problem will be addressed by the development of a formal framework and tool for hierarchical software architecture modelling that encompasses the given requirements. The second problem will be addressed by the development of automated techniques and tools that read architectural specifications and, from these, automatically generate models and logical specifications for back-end verification tools. This is a five-year full-time employed position involving 20% teaching. We are looking for strong candidates with background in Computer Science, ideally in Formal Methods based on Mathematical Logic and Programming Language Semantics. Industrial experience, especially with embedded safety-critical software, would be an advantage. See https://urldefense.com/v3/__https://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:441687/type:job/where:4/apply:1__;!!IBzWLUs!CaZK8Iz_OTSw7EBWjoHj3qF1c8MpRo4eGrCUiu7xB-HqCGMKsspD8BMzXZW3uoqpFXHMPqSGMXWcXw$ for the full announcement with more information and instructions on how to apply. The application deadline is December 6, 2021. Informal enquiries may be sent to dilian at kth.se. Dilian Gurov, Associate Professor School of Electrical Engineering and Computer Science KTH Royal Institute of Technology https://urldefense.com/v3/__https://www.csc.kth.se/*dilian/__;fg!!IBzWLUs!CaZK8Iz_OTSw7EBWjoHj3qF1c8MpRo4eGrCUiu7xB-HqCGMKsspD8BMzXZW3uoqpFXHMPqRvjKiF8w$ From igarashi at kuis.kyoto-u.ac.jp Wed Nov 17 08:10:24 2021 From: igarashi at kuis.kyoto-u.ac.jp (Atsushi Igarashi) Date: Wed, 17 Nov 2021 22:10:24 +0900 Subject: [TYPES/announce] Extended deadline: FLOPS 2022, 16th International Symposium on Functional and Logic Programming Message-ID: <864k8bhqrj.wl-igarashi@kuis.kyoto-u.ac.jp> * The deadline has been extended to December. * Best papers will be invited to an SCP special issue. ============================================================================ Call For Papers FLOPS 2022: 16th International Symposium on Functional and Logic Programming ============================================================================ In-Cooperation with ACM SIGPLAN May 10-12, 2022, Kyoto, Japan https://urldefense.com/v3/__https://conf.researchr.org/home/flops-2022__;!!IBzWLUs!BFuy2vHGYkm3z1Cj5js4_OzS0WVF_BZLQ5Xv0cIKzajogpNLcuM5jL6mCyq-JoYpXycGWoY6vU74gA$ Writing down detailed computational steps is not the only way of programming. The alternative, being used increasingly in practice, is to start by writing down the desired properties of the result. The computational steps are then (semi-)automatically derived from these higher-level specifications. Examples of this declarative style include functional and logic programming, program transformation and re-writing, and extracting programs from proofs of their correctness. FLOPS aims to bring together practitioners, researchers and implementors of the declarative programming, to discuss mutually interesting results and common problems: theoretical advances, their implementations in language systems and tools, and applications of these systems in practice. The scope includes all aspects of the design, semantics, theory, applications, implementations, and teaching of declarative programming. FLOPS specifically aims to promote cross-fertilization between theory and practice and among different styles of declarative programming. *** Scope *** FLOPS solicits original papers in all areas of declarative programming: * functional, logic, functional-logic programming, rewriting systems, formal methods and model checking, program transformations and program refinements, developing programs with the help of theorem provers or SAT/SMT solvers, verifying properties of programs using declarative programming techniques; * foundations, language design, implementation issues (compilation techniques, memory management, run-time systems, etc.), applications and case studies. FLOPS promotes cross-fertilization among different styles of declarative programming. Therefore, research papers must be written to be understandable by the wide audience of declarative programmers and researchers. In particular, each submission should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant for its area, and comparing it with previous work. Submission of system descriptions and declarative pearls are especially encouraged. *** Submission *** Submissions should fall into one of the following categories: * Regular research papers: they should describe new results and will be judged on originality, correctness, and significance. * System descriptions: they should describe a working system and will be judged on originality, usefulness, and design. * Declarative pearls: new and excellent declarative programs or theories with illustrative applications. System descriptions and declarative pearls must be explicitly marked as such in the title. Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. See also ACM SIGPLAN Republication Policy, as explained at https://urldefense.com/v3/__http://www.sigplan.org/Resources/Policies/Republication__;!!IBzWLUs!BFuy2vHGYkm3z1Cj5js4_OzS0WVF_BZLQ5Xv0cIKzajogpNLcuM5jL6mCyq-JoYpXycGWoa2L8oEeA$ . Submissions must be written in English and can be up to 15 pages excluding references, though system descriptions and pearls are typically shorter. The formatting has to conform to Springer's guidelines. Regular research papers should be supported by proofs and/or experimental results. In case of lack of space, this supporting information should be made accessible otherwise (e.g., a link to an anonymized web page or an appendix, which does not count towards the page limit). However, it is the responsibility of the authors to guarantee that their paper can be understood and appreciated without referring to this supporting information; reviewers may simply choose not to look at it when writing their review. FLOPS 2022 will employ a double-blind reviewing process. To facilitate this, submitted papers 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 reviewers come to a judgement 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 the paper more difficult (e.g., important background references should not be omitted or anonymized). In addition, 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. Papers should be submitted electronically at https://urldefense.com/v3/__https://easychair.org/conferences/?conf=flops2022__;!!IBzWLUs!BFuy2vHGYkm3z1Cj5js4_OzS0WVF_BZLQ5Xv0cIKzajogpNLcuM5jL6mCyq-JoYpXycGWoaJ1RdRsw$ Springer Guidelines https://urldefense.com/v3/__https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines__;!!IBzWLUs!BFuy2vHGYkm3z1Cj5js4_OzS0WVF_BZLQ5Xv0cIKzajogpNLcuM5jL6mCyq-JoYpXycGWob9aHc2ug$ *** Proceedings *** The proceedings will be published by Springer International Publishing in the Lecture Notes in Computer Science (LNCS) series (https://urldefense.com/v3/__http://www.springer.com/lncs__;!!IBzWLUs!BFuy2vHGYkm3z1Cj5js4_OzS0WVF_BZLQ5Xv0cIKzajogpNLcuM5jL6mCyq-JoYpXycGWoaTOWN1Pg$ ). Post-proceedings: The authors of 4-7 best papers will be invited to submit an extended version of their FLOPS paper to a special issue which will appear in the journal Science of Computer Programming (SCP). *** Important Dates *** Abstract submission: December 8, 2021 (AoE) Paper submission: December 12, 2021 (AoE) Notification: January 28, 2022 Camera ready due: February 20, 2022 Symposium: May 10-12, 2022 *** Program Comittee *** Andreas Abel Gothenburg University, Sweden Elvira Albert Universidad Complutense de Madrid Nada Amin Harvard Universuty, USA Davide Ancona Univ. Genova, Italy William Byrd University of Alabama, USA Matteo Cimini UMass Lowell, USA Youyou Cong Tokyo Institute of Technology, Japan Robert Gl?ck University of Copenhagen, Denmark Makoto Hamana Gunma University, Japan Michael Hanus Kiel University (co-chair) Zhenjiang Hu Peking University, China Atsushi Igarashi Kyoto University, Japan (co-chair) Ekaterina Komendantskaya Heriot-Watt University, UK Shin-Cheng Mu Academia Sinica, Taiwan Koko Muroya Kyoto University, Japan Klaus Ostermann University of Tuebingen, Germany Ricardo Rocha University of Porto, Portugal Tom Schrijvers KU Leuven, Belgium Harald Sondergaard University of Melbourne, Australia Hiroshi Unno University of Tsukuba, Japan Niki Vazou IMDEA, Spain Janis Voigtlaender University of Duisburg-Essen, Germany Nicolas Wu Imperial College, UK Ningning Xie University of Hong Kong, China Jeremy Yallop University of Cambridge, UK Neng-Fa Zhou City University of New York, USA *** Organizers *** Michael Hanus Kiel University, Germany (PC Co-Chair) Atsushi Igarashi Kyoto University, Japan (PC Co-Chair, General Chair) Keigo Imai Gifu University, Japan (Local Co-Chair) Taro Sekiyama National Institute of Informatics, Japan (Local Co-Chair) *** Contact Address *** flops2022 _AT_ easychair.org From s-dgq at thorsten-wissmann.de Mon Nov 15 15:32:18 2021 From: s-dgq at thorsten-wissmann.de (Thorsten Wissmann) Date: Mon, 15 Nov 2021 21:32:18 +0100 Subject: [TYPES/announce] CMCS 2022: First Call for Papers Message-ID: <20211115203218.GA29594@dobby> First Call for Papers The 16th IFIP WG 1.3 International Workshop on Coalgebraic Methods in Computer Science (CMCS'22) Munich, Germany, 2-3 April 2022 (co-located with ETAPS 2022) https://urldefense.com/v3/__http://www.coalg.org/cmcs22__;!!IBzWLUs!CAFh497Sm1c8tn8gsKt3hGn5ohDIIYvY2iPU98Ev8nTtUdXI1jZdZuDe_D01qkjQ3R_AIqEwb5rZtA$ Objectives and scope -------------------- Established in 1998, the CMCS workshops aim to bring together researchers with a common interest in the theory of coalgebras, their logics, and their applications. As the workshop series strives to maintain breadth in its scope, areas of interest include neighbouring fields as well. Topics of interest are the theory and applications of coalgebra and coinductive reasoning in all research areas of Computer Science, including (but not limited to) the following: - set-theoretic and categorical foundations of coalgebra; - algebra & coalgebra, (co)monads, and distributive laws; - (modal) logic; - automata theory and formal languages; - coinductive definitions and proof principles (including "up-to" techniques) - semantic models of computation (for programming languages, dynamical systems, term rewriting, etc.) - functional, objected-oriented, concurrent, and constraint programming; - type theory (notably behavioural typing); - formal verification and specification; - control theory (notably discrete events and hybrid systems); - quantum computing; - game theory; - implementation, tools, and proof assistants Venue and event --------------- CMCS'22 will be held in Munich, Germany, co-located with ETAPS 2022 on 2-3 April 2022. Important dates (tentative) --------------------------- Abstract regular papers 24 January 2022 Submission regular papers 27 January 2022 Notification regular papers 28 February 2022 Camera-ready copy 14 March 2022 Submission short contributions 2 March 2022 Notification short contributions 8 March 2022 Programme committee ------------------- Adriana Balan, University Politehnica of Bucharest, Romania Henning Basold, Leiden University, The Netherlands Marta Bilkova, Czech Academy of Sciences, Czech Republic Fredrik Dahlqvist, Queen Mary University London, United Kingdom Fredrik Nordvall Forsberg, University of Strathclyde, United Kingdom Richard Garner, Macquarie University, Australia Jeremy Gibbons, University of Oxford, United Kingdom Helle Hvid Hansen (co-chair), University of Groningen, The Netherlands Ichiro Hasuo, National Institute of Informatics, Japan Tobias Kapp?, University of Amsterdam, The Netherlands Dexter Kozen, Cornell University, USA Clemens Kupke, University of Strathclyde, United Kingdom Alexander Kurz, Chapman University, USA Barbara K?nig, University of Duisburg-Essen, Germany Marina Lenisa, University of Udine, Italy Davide Sangiorgi, University of Bologna, Italy Lutz Schr?der, University of Erlangen-Nuremberg, Germany David Spivak, Massachusetts Institute of Technology, USA Tarmo Uustalu, Reykjavik University, Iceland Thorsten Wi?mann, Radboud University, The Netherlands Fabio Zanasi (co-chair), University College London, United Kingdom Maaike Zwart, ITU Copenhagen, Denmark PC co-chairs -------------- Helle Hvid Hansen, University of Groningen, The Netherlands Fabio Zanasi, University College London, United Kingdom Publicity chair --------------- Thorsten Wi?mann, Radboud University, The Netherlands Steering committee ------------------ Filippo Bonchi, University of Pisa, Italy Marcello Bonsangue, Leiden University, The Netherlands Corina Cirstea, University of Southampton, United Kingdom Ichiro Hasuo, National Institute of Informatics, Japan Bart Jacobs, Radboud University Nijmegen, The Netherlands Bartek Klin, University of Oxford, United Kingdom Alexander Kurz, University of Leicester, United Kingdom Marina Lenisa, University of Udine, Italy Stefan Milius (chair), University of Erlangen-Nuremberg, Germany Lawrence Moss, Indiana University, USA Daniela Petrisan, University Paris Diderot, France Jurriaan Rot, Radboud University, The Netherlands Dirk Pattinson, Australian National University, Australia Lutz Schr?der, University of Erlangen-Nuremberg, Germany Alexandra Silva, Cornell University, USA Submission guidelines --------------------- We solicit two types of contributions: regular papers and short contributions. Regular papers must be original, unpublished, and not submitted for publication elsewhere. Regular papers should be max 18 pages long in Springer LNCS style, excluding references and an appendix of up to 5 pages. Note that reviewers are not obliged to read the appendix, and the merits of the paper should be clear from the main text. Short contributions may describe work in progress, or summarise work submitted to a conference or workshop elsewhere. They should be no more than two pages including references. Regular papers and short contributions should be submitted electronically as a PDF file via the Easychair system at https://urldefense.com/v3/__http://www.easychair.org/conferences/?conf=cmcs2022__;!!IBzWLUs!CAFh497Sm1c8tn8gsKt3hGn5ohDIIYvY2iPU98Ev8nTtUdXI1jZdZuDe_D01qkjQ3R_AIqHYbfQKdQ$ The proceedings of CMCS 2022 will include all accepted regular papers and will be published post-conference as a Springer volume in the IFIP-LNCS series (pending approval). Accepted short contributions will be bundled in a technical report. From Gorel.Hedin at cs.lth.se Fri Nov 19 04:23:34 2021 From: Gorel.Hedin at cs.lth.se (=?utf-8?Q?G=C3=B6rel_Hedin?=) Date: Fri, 19 Nov 2021 10:23:34 +0100 Subject: [TYPES/announce] Dahl-Nygaard Prizes 2022: nominations due Message-ID: ============================================================================ Dahl-Nygaard Prizes 2022: nominations due ============================================================================ In 2004, AITO established an annual prize in the name of the Ole-Johan Dahl and Kristen Nygaard to honour their pioneering work on object-orientation. Now is the time to nominate deserving candidates for the Dahl-Nygaard prizes 2022. The deadline for nomination is *** December 15, 2021 ***, and the nomination process requires only that you fill out this simple form: https://urldefense.com/v3/__https://forms.gle/n6RLKKebMeF6ihXX9__;!!IBzWLUs!GfVSiGZez4AmLlRk7ZUW6Yx8xtvByVi9RcU3utJZEbVehd3dno_EV2vgkmIn-C6MmQl_pvJspTlMag$ For more information (statutes, previous recipients etc.), see https://urldefense.com/v3/__http://www.aito.org/Dahl-Nygaard/__;!!IBzWLUs!GfVSiGZez4AmLlRk7ZUW6Yx8xtvByVi9RcU3utJZEbVehd3dno_EV2vgkmIn-C6MmQl_pvL7ikFzow$ If you have any questions, please contact the Chair: G?rel Hedin gorel.hedin at cs.lth.se =================================== G?rel Hedin Department of Computer Science Lund University Lund, SWEDEN email: gorel.hedin at cs.lth.se =================================== From h.basold at liacs.leidenuniv.nl Fri Nov 19 17:02:45 2021 From: h.basold at liacs.leidenuniv.nl (Henning Basold) Date: Fri, 19 Nov 2021 23:02:45 +0100 Subject: [TYPES/announce] TYPES 2021 post-proceedings: Second call for papers (Deadline extension) Message-ID: Open call for papers for the Post-proceedings of the 27th International Conference on Types for Proofs and Programs TYPES 2021 TYPES is a major forum for the presentation of research on all aspects of type theory and its applications. TYPES 2021 was held 14-18 June 2021 virtually hosted by University Leiden, Netherlands. The post-proceedings volume will be published in LIPIcs, Leibniz International Proceedings in Informatics, an open-access series of conference proceedings (http://www.dagstuhl.de/en/publications/lipics). Submission to this post-proceedings volume is open to everyone, also to those who did not participate in the conference. We welcome high-quality descriptions of original work, as well as position papers, overview papers, and system descriptions. Submissions should be written in English, not overlapping with published or simultaneously submitted work to a journal or a conference with archival proceedings. The scope of the post-proceedings is the same as the scope of the conference: the theory and practice of type theory. In particular, we welcome submissions on the following topics: * Foundations of type theory and constructive mathematics; * Applications of type theory (e.g., linguistics or concurrency); * Dependently typed programming; * Industrial uses of type theory technology; * Meta-theoretic studies of type systems; * Proof assistants and proof technology; * Automation in computer-assisted reasoning; * Links between type theory and functional programming; * Formalising mathematics using type theory; * Homotopy type theory and univalent mathematics. IMPORTANT DATES (Updated!) * Abstract submission: 22 November 2021 (AoE) * Paper submission: 10 December 2021 (AoE) * Author notification: 25 March 2022 DETAILS * Papers have to be formatted with the current LIPIcs style and adhere to the style requirements of LIPIcs: https://submission.dagstuhl.de/series/details/5#author * The upper limit for the length of submissions is 20 pages, excluding title page and bibliography but including appendices. * The processing charge will kindly be sponsored by LIACS (Leiden Institute for Advanced Computer Science) for up to 20 publications, given that these publications do not exceed the page limit. See here for details about the processing charge: https://submission.dagstuhl.de/documentation/faq/11 * Papers have to be submitted as PDF through EasyChair: https://easychair.org/conferences/?conf=posttypes2021 * Authors have the option to attach to their submission a zip or tgz file containing code (formalised proofs or programs), but reviewers are not obliged to take the attachments into account and they will not be published. * In case of questions, e.g. on the page limit, contact one editors either directly or through . EDITORS - Henning Basold (https://liacs.leidenuniv.nl/~basoldh/), Leiden University, NL - Jesper Cockx (https://jesper.sikanda.be/), Technical University Delft, NL - Silvia Ghilezan (http://imft.ftn.uns.ac.rs/~silvia/), University of Novi Sad, RS -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_signature Type: application/pgp-signature Size: 665 bytes Desc: OpenPGP digital signature URL: From patrick.baillot at univ-lille.fr Mon Nov 22 08:04:56 2021 From: patrick.baillot at univ-lille.fr (Patrick Baillot) Date: Mon, 22 Nov 2021 14:04:56 +0100 (CET) Subject: [TYPES/announce] postdoc position in Lille (France) on type systems and logical methods Message-ID: <1032119294.4347038.1637586296660.JavaMail.zimbra@univ-lille.fr> Applications are invited for a postdoc position at the University of Lille, France. The successful candidate will work under the supervision of Patrick Baillot, on research topics related to type systems and logical methods in one of the following areas (non exclusive list): timing analysis for sequential, parallel or concurrent systems ; privacy properties of programs (sensitivity, differential privacy?) ; typing methods for synchronous languages (e.g. static analysis for clock assignment). Candidates should have, or expect shortly to obtain, a PhD in Computer Science, with expertise in programming languages, logic or formal methods. The position is for one year. The starting date would be at the beginning of 2022 but is negociable. There is no teaching load. Knowledge of French is not required. The candidate will join the SyCoMoRES team (https://urldefense.com/v3/__https://www.cristal.univ-lille.fr/en/teams/sycomores/?force_lang=true__;!!IBzWLUs!F-NQSW8QIIvOoBOvgM0TAKrSixOOksZrCRmqvMQ5sJ1Ez_u_CxbUhSs0brVMpgvO8RZtbPQyth0LcA$ ), within the CRIStAL research center (https://urldefense.com/v3/__https://www.cristal.univ-lille.fr/en/__;!!IBzWLUs!F-NQSW8QIIvOoBOvgM0TAKrSixOOksZrCRmqvMQ5sJ1Ez_u_CxbUhSs0brVMpgvO8RZtbPQIu1IuCw$ ). The position is funded by I-site Universit? Lille Nord-Europe. If you are interested please contact me as soon as possible, with a brief outline of your academic background and research interests. As a second step, a complete application will consist of + a cover letter; + a detailed CV including a list of publications and a summary of research; + contact information for two or three academic references; This application should be sent by email to patrick.baillot at univ-lille.fr . The review of applications will begin on December 6 and continue until the position is filled. Patrick Baillot (https://urldefense.com/v3/__https://pro.univ-lille.fr/patrick-baillot/__;!!IBzWLUs!F-NQSW8QIIvOoBOvgM0TAKrSixOOksZrCRmqvMQ5sJ1Ez_u_CxbUhSs0brVMpgvO8RZtbPQc0FGwiw$ ) From jeremy.gibbons at cs.ox.ac.uk Wed Nov 24 10:49:30 2021 From: jeremy.gibbons at cs.ox.ac.uk (Jeremy Gibbons) Date: Wed, 24 Nov 2021 15:49:30 +0000 Subject: [TYPES/announce] MSFP 2022 - First Call for Papers Message-ID: Ninth Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING Saturday 2nd April 2022, Munich, Germany A satellite workshop of ETAPS 2022 https://urldefense.com/v3/__https://msfp-workshop.github.io/msfp2022/__;!!IBzWLUs!EB680-NoWsQNw556S3UoP0VhCLNUFlULBRdsM0pjxq1Db63RpG7IM1jwzv0ndpqL7z70li4tj5yCrA$ ** Deadline: 16 December (abstract), 23 December (paper) ** The ninth workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Where would Haskell be without monads? Functional reactive programming without temporal logic? Call-by-push-value without adjunctions? The list goes on. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006, affiliated with MPC 2006 and AMAST 2006. The second MSFP workshop was held in Reykjavik, Iceland as part of ICALP 2008. The third MSFP workshop was held in Baltimore, USA, as part of ICFP 2010. The fourth workshop was held in Tallinn, Estonia, as part of ETAPS 2012. The fifth workshop was held in Grenoble, France, as part of ETAPS 2014. The sixth MSFP Workshop was held in April 2016, in Eindhoven, Netherlands, as part of ETAPS 2016. The seventh MSFP Workshop was held in July 2018, in Oxford, UK, as part of FLoC 2018. The eighth MSFP Workshop was held virtually in August 2020, originally planned as part of ETAPS 2020. Important Dates: ================ Abstract deadline: 16 December (Thursday) Paper deadline: 23 December (Thursday) Notification: 27 January (Thursday) Final version: 24 February (Thursday) Workshop: 2 April(Saturday ) Invited Speakers: ================= Valeria de Paiva - Topos Institute, USA Programme Committee: ==================== Nuria Brede - University of Potsdam, Germany Jacques Carette - McMaster University, Canada Youyou Cong - Tokyo Institute of Technology, Japan Philippa Cowderoy Jan de Muijnck-Hughes - University of Glasgow, UK Harley Eades III - Augusta University, USA Jeremy Gibbons - University of Oxford, UK (co-chair) Jules Hedges - University of Stratchclyde, UK Shin-Ya Katsumata - National Institute of Informatics, Japan Max New - University of Michigan, USA (co-chair) Maciej Pir?g - University of Wroc?aw, Poland Artjoms Sinkarovs - Heriot-Watt University, UK Submission: =========== Submissions are welcomed on, but by no means restricted to, topics such as: structured effectful computation structured recursion structured corecursion structured tree and graph operations structured syntax with variable binding structured datatype-genericity structured search structured representations of functions structured quantum computation structure directed optimizations structured types structure derived from programs and data Please contact the programme chairs Jeremy Gibbons (jeremy.gibbons at cs.ox.ac.uk ) and Max New (maxsnew at umich.edu ) if you have any questions about the scope of the workshop. We accept two categories of submission: full papers of no more than 15 pages that will appear in the proceedings, and extended abstracts of no more than 2 pages that we will post on the website, but which do not constitute formal publications and will not appear in the proceedings. References and appendices are not included in page limits. Appendices may not be read by reviewers. Submissions must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Accepted papers must be presented at the workshop by one of the authors. The proceedings will be published under the auspices of EPTCS with a Creative Commons license. A short abstract should be submitted a week in advance of the paper deadline (for both full paper and extended abstract submissions). We are using EasyChair to manage submissions. To submit a paper, use this link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=msfp2022__;!!IBzWLUs!EB680-NoWsQNw556S3UoP0VhCLNUFlULBRdsM0pjxq1Db63RpG7IM1jwzv0ndpqL7z70li4LV7GBtg$ Jeremy.Gibbons at cs.ox.ac.uk Oxford University Department of Computer Science, Wolfson Building, Parks Road, Oxford OX1 3QD, UK. +44 1865 283521 https://urldefense.com/v3/__http://www.cs.ox.ac.uk/people/jeremy.gibbons/__;!!IBzWLUs!EB680-NoWsQNw556S3UoP0VhCLNUFlULBRdsM0pjxq1Db63RpG7IM1jwzv0ndpqL7z70li5NcMWNIw$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From cmezzina at gmail.com Wed Nov 24 11:39:08 2021 From: cmezzina at gmail.com (Claudio Mezzina) Date: Wed, 24 Nov 2021 17:39:08 +0100 Subject: [TYPES/announce] RC2022: First Call for Papers In-Reply-To: References: Message-ID: 1st Call for Papers *Notification Date CORRECTION* 14th Conference on Reversible Computation (RC 2022) https://urldefense.com/v3/__https://reversible-computation-2022.github.io/__;!!IBzWLUs!GjCqXYtb1LfyTJGqvbUWLfAbkPvWuOq2xdHVMBV2fku76yqkFlSyWgR3bqqJXSBdVvyhfMHQWGw8_g$ July 5th-6th, 2022, Urbino, Italy Abstract Submission: Mon, February 7th, 2022 Submission Deadline: Mon, February 21st, 2022 ======================================================================= Reversible computation has a growing number of promising application areas such as low power design, coding/decoding, debugging, testing and verification, database recovery, discrete event simulation, reversible algorithms, reversible specification formalisms, reversible programming languages, process algebras, and the modeling of biochemical systems. Furthermore, reversible logic provides a basis for quantum computation with its applications, for example, in cryptography and in the development of highly efficient algorithms. First reversible circuits and quantum circuits have been implemented and are seen as promising alternatives to conventional CMOS technology. The conference will bring together researchers from computer science, mathematics, and physics to discuss new developments and directions for future research in Reversible Computation. This includes applications of reversibility in quantum computation. Research papers, tutorials, tool demonstrations, and work-in-progress reports are within the scope of the conference. Invited talks by leading international experts will complete the program. Contributions on all areas of Reversible Computation are welcome, including---but not limited to---the following topics: * Applications * Architectures * Algorithms * Bidirectional transformations * Circuit Design * Debugging * Fault Tolerance and Error Correction * Hardware * Information Theory * Physical Realizations * Programming Languages * Quantum Computation * Software * Synthesis * Theoretical Results * Testing * Verification ===== Important Dates ===== - Abstract Submission: Sun, February 7th, 2022 - Submission Deadline: Sun, February 21st, 2022 - Notification to Authors: Sat, April 4th, 2022 - Final Version: Sat, April 25th, 2022 - Conference: Tue-Wed, July 5th-6th, 2022 ===== Invited speakers ===== TBA ===== Paper submission ===== Interested researchers are invited to submit - full research papers (16 pages maximum), - tutorials (16 pages maximum), as well as - work-in-progress or tool demonstration papers (6 pages maximum) in Springer LNCS format. Additional material intended for reviewers but not for publication in the final version---for example, details of proofs---may be placed in a clearly marked appendix that is not included in the page limit. Reviewers are at liberty to ignore appendices and papers must be understandable without them. Contributions must be written in English and report on original, unpublished work, not submitted for publication elsewhere. Submissions not adhering to the specified constraints may be rejected without review. Each paper will undergo a peer review of at least 3 anonymous reviewers. All accepted papers will be included in the conference proceedings. Papers can be submitted electronically in PDF via the RC 2022 interface of the EasyChair system: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=rc2022__;!!IBzWLUs!GjCqXYtb1LfyTJGqvbUWLfAbkPvWuOq2xdHVMBV2fku76yqkFlSyWgR3bqqJXSBdVvyhfMEmlwV0OQ$ ===== Organizers ===== * Program co-chairs Claudio Antares Mezzina University of Urbino, Italy Krzysztof Podlaski niversity of ??d?, Poland ===== Program Committee ===== TDB Il giorno mer 24 nov 2021 alle ore 10:20 Claudio Mezzina ha scritto: > 1st Call for Papers > > 14th Conference on Reversible Computation (RC 2022) > > https://urldefense.com/v3/__https://reversible-computation-2022.github.io/__;!!IBzWLUs!GjCqXYtb1LfyTJGqvbUWLfAbkPvWuOq2xdHVMBV2fku76yqkFlSyWgR3bqqJXSBdVvyhfMHQWGw8_g$ > > July 5th-6th, 2022, Urbino, Italy > Abstract Submission: Mon, February 7th, 2022 > Submission Deadline: Mon, February 21st, 2022 > > ======================================================================= > > Reversible computation has a growing number of promising application areas > such as low power design, coding/decoding, debugging, testing and > verification, database recovery, discrete event simulation, reversible > algorithms, reversible specification formalisms, reversible programming > languages, process algebras, and the modeling of biochemical systems. > Furthermore, reversible logic provides a basis for quantum computation with > its applications, for example, in cryptography and in the development of > highly efficient algorithms. First reversible circuits and quantum circuits > have been implemented and are seen as promising alternatives to > conventional CMOS technology. > > The conference will bring together researchers from computer science, > mathematics, and physics to discuss new developments and directions for > future research in Reversible Computation. This includes applications of > reversibility in quantum computation. Research papers, tutorials, tool > demonstrations, and work-in-progress reports are within the scope of the > conference. Invited talks by leading international experts will complete > the program. > > Contributions on all areas of Reversible Computation are welcome, > including---but not limited to---the following topics: > > * Applications > * Architectures > * Algorithms > * Bidirectional transformations > * Circuit Design > * Debugging > * Fault Tolerance and Error Correction > * Hardware > * Information Theory > * Physical Realizations > * Programming Languages > * Quantum Computation > * Software > * Synthesis > * Theoretical Results > * Testing > * Verification > > ===== Important Dates ===== > > - Abstract Submission: Sun, February 7th, 2022 > > - Submission Deadline: Sun, February 21st, 2022 > > - Notification to Authors: Sat, March 4th, 2022 > > - Final Version: Sat, April 25th, 2022 > > - Conference: Tue-Wed, July 5th-6th, 2022 > > ===== Invited speakers ===== > > TBA > > ===== Paper submission ===== > > Interested researchers are invited to submit > > - full research papers (16 pages maximum), > - tutorials (16 pages maximum), as well as > - work-in-progress or tool demonstration papers (6 pages maximum) > > in Springer LNCS format. Additional material intended for reviewers but > not for publication in the final version---for example, details of > proofs---may be placed in a clearly marked appendix that is not included in > the page limit. Reviewers are at liberty to ignore appendices and papers > must be understandable without them. Contributions must be written in > English and report on original, unpublished work, not submitted for > publication elsewhere. Submissions not adhering to the specified > constraints may be rejected without review. Each paper will undergo a peer > review of at least 3 anonymous reviewers. All accepted papers will be > included in the conference proceedings. Papers can be submitted > electronically in PDF via the RC 2022 interface of the EasyChair system: > > https://urldefense.com/v3/__https://easychair.org/conferences/?conf=rc2022__;!!IBzWLUs!GjCqXYtb1LfyTJGqvbUWLfAbkPvWuOq2xdHVMBV2fku76yqkFlSyWgR3bqqJXSBdVvyhfMEmlwV0OQ$ > > ===== Organizers ===== > > * Program co-chairs > > Claudio Antares Mezzina > University of Urbino, Italy > > Krzysztof Podlaski > niversity of ??d?, Poland > > > ===== Program Committee ===== > TDB > -------------- next part -------------- An HTML attachment was scrubbed... URL: From esparza at in.tum.de Thu Nov 25 02:46:58 2021 From: esparza at in.tum.de (Javier Esparza) Date: Thu, 25 Nov 2021 08:46:58 +0100 Subject: [TYPES/announce] CONCUR 2022: first call for papers Message-ID: <128af151aa54fe30b4c106a3a819bf25@in.tum.de> CONCUR 2022: first call for papers ============================== September 13-16, 2022 at the University of Warsaw, Poland Website: https://urldefense.com/v3/__https://concur2022.mimuw.edu.pl/__;!!IBzWLUs!A_gPsAIOvl5v0VoO60Ipi2i7l0fz0O5rwqgTLAuvS_cEulhbseUOczgwA_uRZSnH63I3wmCH3ZdGDg$ Co-located with QEST, FORMATS, FMICS (under the joint name CONFEST) The purpose of CONCUR 2022, the 33rd 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. IMPORTANT NOTE CONCERNING THE COVID-19 PANDEMIC CONCUR 2022 is planned as a physical, in-person event, with certain support for remote presence, both for speakers and for other participants who are unable or unwilling to come. Depending on the pandemic situation, we may have to make a decision whether to cancel the physical component of the event or not. This should be definitely decided by the end of June 2022. INVITED SPEAKERS Wojciech Czerwi?ski, University of Warsaw, Poland Philippa Gardner, Imperial College London, UK Rupak Majumdar, Max Planck Institute for Software Systems, Germany Sergio Rajsbaum, Universidad Nacional Autonoma de Mexico, Mexico CO-LOCATED CONFERENCES 19th International Conference on Quantitative Evaluation of SysTems (QEST 2022) 20th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2022) 27th International Conference on Formal Methods for Industrial Critical Systems (FMICS 2022) Website: https://urldefense.com/v3/__https://concur2022.mimuw.edu.pl/__;!!IBzWLUs!A_gPsAIOvl5v0VoO60Ipi2i7l0fz0O5rwqgTLAuvS_cEulhbseUOczgwA_uRZSnH63I3wmCH3ZdGDg$ IMPORTANT DATES (all dates are AoE) Abstract Submission: April 18, 2022 Paper Submission: April 25, 2022 Author Response: June 6-8, 2022 Notification: June 25, 2022 Camera Ready: July 9, 2022 Conference(s): September 13-16, 2022 Workshops: September 12 and 17, 2022 PAPER SUBMISSION CONCUR 2022 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. The CONCUR 2022 proceedings will be published by LIPIcs. Papers must be submitted electronically as PDF files via EasyChair: https://urldefense.com/v3/__https://easychair.org/conferences?conf=concur2022__;!!IBzWLUs!A_gPsAIOvl5v0VoO60Ipi2i7l0fz0O5rwqgTLAuvS_cEulhbseUOczgwA_uRZSnH63I3wmASVAG_Kg$ Papers must not exceed 14 pages (excluding references and clearly marked appendices) using the LIPIcs style. 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. AWARDS In 2022, CONCUR Test-of-Time and best paper awards will be given for the third time. The winners will be announced at the conference. ORGANIZATION COMMITTEE Lorenzo Clemente (workshop chair) Piotrek Hofman Bartek Klin S?awek Lasota Radek Pi?rkowski (webmaster) PROGRAM COMMITTEE C. Aiswarya, Chennai Mathematical Institute, India S. Akshay, IIT Bombay, India Shaull Almagor, Technion, Israel Nathalie Bertrand, INRIA, France Ilaria Castellani, INRIA, France Constantin Enea, IRIF, Universit? de Paris, France Bernd Finkbeiner, CISPA Helmholtz Center for Information Security, Germany Blaise Genest, CNRS, France Rob van Glabbeek, CSIRO, Sydney, Australia Daniele Gorla, University of Rome La Sapienza, Italy Jean Goubault-Larrecq, ENS Paris-Saclay, France Ichiro Hasuo, National Institute of Informatics, Japan Marcin Jurdzinski, The University of Warwick, UK Stefan Kiefer, University of Oxford, UK Bartek Klin, University of Oxford, UK (co-chair) Barbara K?nig, University of Duisburg-Essen, Germany S?awomir Lasota, University of Warsaw, Poland (co-chair) Martin Leucker, University of L?beck, Germany Bas Luttik, Eindhoven University of Technology, The Netherlands P. Madhusudan, University of Illinois at Urbana-Champaign, US Hernan Melgratti, Universidad de Buenos Aires, Argentina Anca Muscholl, Bordeaux University, France (co-chair) Jan Otop, University of Wroc?aw, Poland Joel Ouaknine, Max Planck Institute for Software Systems, Germany Jean-Fran?ois Raskin, Universit? libre de Bruxelles, Belgium Grigore Rosu, University of Illinois at Urbana-Champaign, US Jurriaan Rot, Radboud University, The Netherlands Davide Sangiorgi, University of Bologna, Italy Alexandra Silva, University College London, UK and Cornell University, US Pawe? Soboci?ski, Tallinn University of Technology, Estonia Ana Sokolova, University of Salzburg, Austria Alwen Tiu, The Australian National University, Australia Frits Vaandrager, Radboud University, The Netherlands Nobuko Yoshida, Imperial College London, UK Lijun Zhang, Chinese Academy of Sciences, China STEERING COMMITTEE Javier Esparza, TU M?nchen, Germany (chair) Pedro D?Argenio, National University of Cordoba, Argentina Wan Fokkink, Vrije Universiteit Amsterdam, The Netherlands Joost-Pieter Katoen, RWTH, Germany Catuscia Palamidessi, INRIA and Ecole Polytechnique, France Davide Sangiorgi, University of Bologna, Italy Jiri Srba, Aalborg University, Denmark -- Prof. Javier Esparza Faculty of Computer Science Technical University of Munich Boltzmannstr. 3, 85748 Garching From ralf.kuesters at sec.uni-stuttgart.de Thu Nov 25 12:20:20 2021 From: ralf.kuesters at sec.uni-stuttgart.de (Ralf Kuesters) Date: Thu, 25 Nov 2021 18:20:20 +0100 Subject: [TYPES/announce] Postdoc and PhD Positions in Formal Verification, University of Stuttgart, Germany Message-ID: The Institute of Information Security at University of Stuttgart offers fully-funded Postdoc and PhD positions in formal verification. Successful candidates are expected to carry out research on tool-supported formal verification methods for security-critical systems and security protocols in our new REPROSEC initiative (https://urldefense.com/v3/__https://reprosec.org/__;!!IBzWLUs!Fc7vmmR7YaZkgwYbe-vQa2le2Vs3ovRzwFO5LWpHUB2jPr_xZQ7Ne8BIW5oBzWAV9AEK7WVa3vUEGg$ ). See, e.g., our work at ACM CCS 2021 and EuroS&P 2021 on DY*. The positions are available immediately with an internationally competitive salary (German public salary scale TV-L E13 or TV-L E14, depending on the candidate's qualification, ranging from about 4.000 Euro to 6.200 Euro monthly gross salary). The employment periods are between one and six years, following the German Wissenschaftszeitvertragsgesetz (WissZeitVg). The Institute of Information Security offers a creative international environment for top-level international research in Germany's high-tech region. You should have a Master's degree or a Ph.D. (or should be very close to completion thereof) in Computer Science, Mathematics, Cyber Security, or a related field. We value excellent analytical skills and - solid knowledge of logic, proofs and/or formal verification techniques (Theorem Proving, Type Checking, etc.), and - solid programming experience. Knowledge in cryptography/security is not required, but a plus. Knowledge of German is not required. The University of Stuttgart is an equal opportunity employer. Applications from women are strongly encouraged. Severely challenged persons will be given preference in case of equal qualifications. To apply, please send email with subject "Application: PhD/Postdoc Position in Formal Verification" and a single PDF file containing the following documents to ralf.kuesters at sec.uni-stuttgart.de: * Cover letter (explaining your scientific background and your motivation to apply) * Curriculum Vitae * List of publications, if applicable * Copies of transcripts and certificates (Bachelor, Master, and if applicable, PhD) * Names of at least two references The deadline for applications is December 12th, 2021. Late applications will be considered until the positions are filled. See https://urldefense.com/v3/__https://sec.uni-stuttgart.de/__;!!IBzWLUs!Fc7vmmR7YaZkgwYbe-vQa2le2Vs3ovRzwFO5LWpHUB2jPr_xZQ7Ne8BIW5oBzWAV9AEK7WUbb0Jrkw$ for more information about the institute. See https://urldefense.com/v3/__https://www.sec.uni-stuttgart.de/institute/job-openings/__;!!IBzWLUs!Fc7vmmR7YaZkgwYbe-vQa2le2Vs3ovRzwFO5LWpHUB2jPr_xZQ7Ne8BIW5oBzWAV9AEK7WUSA5JYJw$ for the official job announcement. For further information please contact: Prof. Dr. Ralf K?sters, ralf.kuesters at sec.uni-stuttgart.de. From clementelorenzo at gmail.com Fri Nov 26 06:27:02 2021 From: clementelorenzo at gmail.com (Lorenzo Clemente) Date: Fri, 26 Nov 2021 12:27:02 +0100 Subject: [TYPES/announce] * CONFEST 2022 * -- Call for Workshop Proposals Message-ID: * CONFEST 2022 * -- Call for Workshop Proposals September 12 - September 17 2022, Warsaw, Poland (https://urldefense.com/v3/__https://confest2022.mimuw.edu.pl/__;!!IBzWLUs!DnpsuJixYv1poV0pjEL8eeetkeJ5s1HEiidyIGURdeMNnd0i1-lO_7NLeD_dOQaLzV8yue0OKulv3A$ ) CONFEST is the umbrella conference comprising the joint international 2022 meetings: - CONCUR (33st International Conference on Concurrency Theory), - QEST (19th International Conference on Quantitative Evaluation of SysTems), - FORMATS (20th International Conference on Formal Modeling and Analysis of Timed Systems), and - FMICS (27th International Conference on Formal Methods for Industrial Critical Systems). Researchers and practitioners are invited to submit proposals for ONE DAY workshops on topics related to theory, formal modeling, verification, performance evaluation and engineering of concurrent, timed, industrial, and other systems. Typically, CONFEST workshops feature a number of invited speakers and a number of contributed presentations. The workshops will take place one day before (12 September) and one day after (17 September) the main conferences. The purpose of the workshops is to provide participants with a friendly, stimulating, and interactive atmosphere for - presenting novel ideas, - discussing their applications, - encouraging cross-fertilization between industry and academia, and - fostering opportunities for young and prospective researchers. The conferences and workshops of CONFEST?22 are currently planned as physical, in-person events with support for remote presence for speakers and for other participants. Depending on the pandemic situation, we will make a decision whether to cancel the physical component of CONFEST or not by the end of June 2022. Workshop proposals should include: - The name and the preferred date of the proposed workshop. - The names and contact information (web page, email address) of the organisers. - A short scientific summary and justification of the proposed topic for the CONFEST community (500 words max). - A discussion of the proposed format and agenda. - If applicable, a description of past versions of the workshop, including dates, organizers, submission and acceptance counts, and attendance. - Procedures for selecting papers and participants. - The publication plan (only invited speakers, no published proceedings, pre-/post-proceedings published with EPTCS/ENTCS/...). - Potentially invited speakers. - Tentative schedule for paper submission and notification of acceptance. The main responsibility for organizing the workshop goes to the workshop organizer(s), including: - workshop publicity (possibly including call for papers, submission and review process) - scheduling of workshop activities in collaboration with the CONFEST workshop chair. Proposals should be sent to Lorenzo Clemente (workshop chair): clementelorenzo at gmail.com IMPORTANT DATES (all dates are AoE) - Submission deadline February 28, 2022 - Notification March 15, 2022 - Program of the workshops ready: July 29, 2022 - Workshops: September 12, 17 2022 - CONFEST conferences: September 13-16, 2022 The CONFEST 2022 workshop chair, Lorenzo Clemente https://urldefense.com/v3/__https://www.mimuw.edu.pl/*lclemente/__;fg!!IBzWLUs!DnpsuJixYv1poV0pjEL8eeetkeJ5s1HEiidyIGURdeMNnd0i1-lO_7NLeD_dOQaLzV8yue22jmSlZw$ University of Warsaw, Poland -------------- next part -------------- An HTML attachment was scrubbed... URL: From georg.weissenbacher at tuwien.ac.at Fri Nov 26 07:18:20 2021 From: georg.weissenbacher at tuwien.ac.at (Georg Weissenbacher) Date: Fri, 26 Nov 2021 13:18:20 +0100 Subject: [TYPES/announce] Postdoc position: Automated Reasoning and Proof Certificates (part-time) Message-ID: This is an announcement of a part-time postdoc position at TU Wien (Vienna, Austria). The Research Unit Formal Methods in Systems Engineering at TU Wien is looking for a postdoctoral researcher and offers a position for 6 years (for 20 hours/week). The expected starting date is January 2022. Tasks: + Independent teaching or participation in teaching and supervision of students + Project work and leadership of project groups + Publishing activities + Participation in and organization of scientific events + Participation in organizational and administrative tasks of the research division and the faculty Your profile: + Completed doctoral studies in a relevant field (e.g., automated reasoning) + Research experience in the area automated propositional reasoning and checking of proof certificates; in-depth knowledge of the subject area propositional reasoning (CDCL), checking of propositional proof certificates (DRAT, DPR, DSR), and Craig Interpolation + Deep interest in scientific problems and the motivation for independent and goal-oriented research + The ability to develop methods, concepts, as well as their realization and evaluation and the willingness to contribute in scientific projects + Experience in national and international research cooperation as well as in project management and presentations + Experience in teaching and publication activities as well as interest and enthusiasm in research and work/support with students + Organizational and analytical skills as well as a structured way of working + Excellent command of the English language and very good communicative skills and team competences + Very good skills in English communication and writing. Knowledge of German (level B2) or willingness to learn it in the first year. More details and the application form can be found on https://urldefense.com/v3/__https://jobs.tuwien.ac.at/Job/168937__;!!IBzWLUs!GnI7CRlER0RPBnSdLfkSIqfhSQ5CewoYzU0VV4JeSzZe9zbLONKX5-1Aq3VFv7ae33NrqL_onkI4LA$ From saurabh_t at daiict.ac.in Fri Nov 26 23:58:32 2021 From: saurabh_t at daiict.ac.in (Saurabh Tiwari) Date: Sat, 27 Nov 2021 10:28:32 +0530 Subject: [TYPES/announce] Call for Participation: 2nd Natural Language Processing Advancements for Software Engineering (NLPaSE) @ 28th APSEC 2021 Message-ID: Hi, You are invited to participate in NLPaSE 2021 workshop co-located with the 28th APSEC 2021 conference (6-8 December, Taiwan). The workshop will be held VIRTUALLY on 6th December 2021. *Time:* 6th December 2021, 1.30 PM to 05:30 PM (Time Zone: UTC+8, Taipei Time) *Website:* https://urldefense.com/v3/__https://sites.google.com/view/nlpase2021/__;!!IBzWLUs!BZRLtjWLCr2e-nkcmDFZwsfEb0rzotbniHVciv6R5X-wp4Ph-z4gHDYIQ_9Ru-9H_Juha1ANzNsTBg$ NLPaSE aims to identify the areas where NLP was applied (limitation, challenges), can be applied (possible directions), and bring out the researchers/industry practitioners in a platform to interact, share their experiences and collaborate. We look forward to your participation in NLPaSE 2021. *NLPaSE 2021 Program:* *#1: Keynote Talk: Ambiguity in Requirements Documents and Elicitation Interviews: NLP Techniques and Beyond* *Alessio Ferrari is a Research Scientist at CNR-ISTI (Consiglio Nazionale delle Ricerche-Istituto di Scienza e Tecnologia dell'Informazione "A. Faedo", Pisa, Italy - https://urldefense.com/v3/__http://www.isti.cnr.it__;!!IBzWLUs!BZRLtjWLCr2e-nkcmDFZwsfEb0rzotbniHVciv6R5X-wp4Ph-z4gHDYIQ_9Ru-9H_Juha1BkXMb78g$ ). His fields of expertise and interest include applications of natural language processing (NLP) techniques to requirements engineering (RE); user and customer interviews in RE; RE education and training; empirical formal methods and empirical software engineering. He is a part of the EU DESIRA project on sustainability, and the EU 4SECURail project on formal methods for railways. He has recently been WP leader of the European Project ASTRail, funded by the Shift2Rail Programme, and participated in other EU projects, such as Learn PAd, about business process models applied to public administration procedures.* #2: 3 Paper presentations #3: 01 Tutorial session #4: Open discussions The detailed program can be found here: https://urldefense.com/v3/__https://sites.google.com/view/nlpase2021/nlpase21-program?authuser=0__;!!IBzWLUs!BZRLtjWLCr2e-nkcmDFZwsfEb0rzotbniHVciv6R5X-wp4Ph-z4gHDYIQ_9Ru-9H_Juha1BblMIBow$ NLPaSE 2020 workshop will be run using the MicroSoft teams. Please register for participation (see APSEC 2021 #registration) guideline. https://urldefense.com/v3/__https://apsec2021.seat.org.tw/*register__;Iw!!IBzWLUs!BZRLtjWLCr2e-nkcmDFZwsfEb0rzotbniHVciv6R5X-wp4Ph-z4gHDYIQ_9Ru-9H_Juha1Dlg6JWiw$ Looking forward to your participation. -- Dr. Saurabh Tiwari Assistant Professor, DA-IICT Gandhinagar, India Visiting Faculty, IIIT Vadodara, India Contact: +91-79-68261618 (O) https://urldefense.com/v3/__https://sites.google.com/view/saurabhtiwari__;!!IBzWLUs!BZRLtjWLCr2e-nkcmDFZwsfEb0rzotbniHVciv6R5X-wp4Ph-z4gHDYIQ_9Ru-9H_Juha1BtjzjKKQ$ *"Creating New Knowledge"* -------------- next part -------------- An HTML attachment was scrubbed... URL: From gtan at cse.psu.edu Sun Nov 28 12:40:12 2021 From: gtan at cse.psu.edu (Gang (Gary) Tan) Date: Sun, 28 Nov 2021 12:40:12 -0500 Subject: [TYPES/announce] CFP: LangSec 2022 (affiliated with IEEE S&P) due on Jan 15th, 2022 Message-ID: <2616dbc1-afdf-ee06-d9c4-873c7de73df9@cse.psu.edu> Call for Papers 8th Workshop on Language-Theoretic Security (LangSec) Affiliated with 43rd IEEE Symposium on Security and Privacy (Oakland) May 26th, 2022 The Language-Theoretic Security (LangSec) workshop solicits contributions of research papers, work-in-progress reports, and panels related to the growing area of language-theoretic security. Submission Guidelines: see https://urldefense.com/v3/__http://langsec.org/spw22/__;!!IBzWLUs!EIRRfItFUkEDEGLhS0iQLK4A7MFrcgi_ctbdqI5wDZpC2438l6pEeeCYKCJ-6LeExKEE-9S_HGghFg$ Submission link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=langsec2022__;!!IBzWLUs!EIRRfItFUkEDEGLhS0iQLK4A7MFrcgi_ctbdqI5wDZpC2438l6pEeeCYKCJ-6LeExKEE-9RQoVidng$ Important Dates: Research paper submissions due: January 15 2022, AOE Work-in-progress reports and panels submissions due: ? February 1 2022, AOE Notification to authors: February 15 2022 Topics: LangSec posits that the only path to trustworthy computer software that takes untrusted inputs is treating all valid or expected inputs as a formal language, and the respective input-handling routine as a parser for that language. The parsing must be feasible, and the parser must match the language in required computation power and convert the input for the consumption of subsequent computation. The 8th installation of the workshop will continue the tradition and further focus on research that apply the language-theoretic perspective to policy mechanisms, such as treating policy formulation and enforcement as language definition and language recognition problems. The following is a non-exhaustive list of topics that are of relevance to LangSec: * formalization of vulnerabilities and exploits in terms of language ? theory * inference of formal language specifications of data from samples * generation of secure parsers from formal language specifications * complexity hierarchy of verifying parser implementations * science of protocol design: layering, fragmentation and re-assembly, ? extensibility, etc. * architectural constructs for enforcing limits on computational ? complexity * empirical data on programming language features/programming styles ? that affect bug introduction rates (e.g., syntactic redundancy) * systems architectures and designs based on LangSec principles * computer languages, file formats, and network protocols built on ? LangSec principles * re-engineering efforts of existing languages, formats, and protocols ? to reduce computational power Chairs PC co-chair: Gang Tan (Pennsylvania State University) PC co-chair: Sergey Bratus (Dartmouth College) Contact: All questions about submissions should be emailed to the PC chairs: Gang Tan (gtan at psu.edu) and Sergey Bratus (sergey at cs.dartmouth.edu) -- Gang (Gary) Tan Professor, Penn State CSE and ICDS W358 Westgate Building https://urldefense.com/v3/__http://www.cse.psu.edu/*gxt29__;fg!!IBzWLUs!EIRRfItFUkEDEGLhS0iQLK4A7MFrcgi_ctbdqI5wDZpC2438l6pEeeCYKCJ-6LeExKEE-9TviV_S5Q$ Tel:814-8657364 -------------- next part -------------- An HTML attachment was scrubbed... URL: From niki.vazou at imdea.org Mon Nov 29 10:21:30 2021 From: niki.vazou at imdea.org (Niki Vazou) Date: Mon, 29 Nov 2021 16:21:30 +0100 Subject: [TYPES/announce] PLDI'22 Artifact Evaluation Committee Nominations Message-ID: We are looking for motivated students and researchers to be members of the PLDI 2022 Artifact Evaluation Committee (AEC). This year, we are accepting (self-)nominations for the AEC. The artifact evaluation process aims to promote, share and catalog the research artifacts of papers accepted to the PLDI research track. The self-nomination form is available at: https://forms.gle/pJJfStLXJwaqJmtm6 You can also nominate other people (e.g., students, colleagues) at: https://forms.gle/nDtW7wtpkGvU8MQBA The instructions for committee members are available here: https://pldi22.sigplan.org/track/pldi-2022-PLDI-Research-Artifacts#Info-for-Reviewers As a committee member, your primary responsibilities would be to review the artifacts submitted corresponding to the already accepted papers in the main research track. In particular, you may have to run the associated tool, check whether the results in the main paper can be reproduced, and inspect the data. PLDI will use a three-phase artifact evaluation review process. We expect the bulk of the review work to take place between March 8 and March 25. Each artifact will take about 8h to review, and reviewers will be assigned 3 to 4 reviews. Come join us in improving the quality of research in our field! Xinyu Wang and Niki Vazou -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 4409 bytes Desc: not available URL: From alastair.donaldson at imperial.ac.uk Mon Nov 29 16:12:41 2021 From: alastair.donaldson at imperial.ac.uk (Donaldson, Alastair F) Date: Mon, 29 Nov 2021 21:12:41 +0000 Subject: [TYPES/announce] Research Associate position in Randomized Testing at Imperial College London Message-ID: Dear all John Wickerson and I are looking to hire a Postdoctoral Research Associate to work on next-generation techniques for randomized testing (which could include testing of aspects of programming language implementations). The post is for two years, and full details can be found here. Details of some of the exciting range of technical questions that could be investigated as part of the postdoc are also pasted below. The closing date is 9th December. Do feel free to contact me in advance if you are considering applying and have questions. And I'd be grateful if you could pass this on to interested candidates. Many thanks Ally Donaldson Randomized testing, or fuzzing, can be effective at finding defects and vulnerabilities in systems. It works by running a system over and over again, using randomly generated or randomly mutated inputs. Traditional fuzzing, popularised by tools such as American Fuzzy Lop and libFuzzer, focusses on finding vulnerabilities by running a system on inputs that have been malformed via small mutations. In many ways this is great: the tools can be applied to a wide class of applications because their mutations (such as flipping bits) can be applied regardless of data format, and the malformed inputs that they create do a good job of finding exploitable vulnerabilities in the front-end of a system. However, these techniques have limited ability to find functional defects, where the system does the wrong thing without necessarily crashing. In this project we are interested in stretching fuzzing techniques so that they can be used to check both deeper functional properties of systems as well as non-functional properties such as performance. The position offers an exciting opportunity for conducting internationally leading and impactful research work that pushes the boundaries of randomized testing. The Research Associate will be responsible for investigating topics such as whether fuzzing can be applied to find performance bugs in systems, whether functional fuzzing can be applied in novel domains, whether there is scope for generalising and automating the process of fuzzer creation, and whether functional fuzzers could benefit from, or contribute to, efforts in formal verification and symbolic execution. There is a lot of scope for flexibility, but example research questions that could be investigated during the project include: * Can we apply functional fuzzing to a larger class of domains? This could involve conducting a number of case studies of building domain-specific fuzzers for a variety of domains, such as video processing tools, ASIC synthesis tools, and web browsers. * Can we use fuzzing to identify performance defects - e.g. inputs that cause the system under test to behave in a particularly unresponsive manner - or violations of other non-functional properties? Despite a focus on non-functional properties, functional fuzzing would be essential here in order to explore realistic scenarios. * Can we automate the process of deriving a domain-specific fuzzer? Many aspects of writing a fuzzing tool are repetitive, but there is much ?devil in the detail? due to specifics of the input format. Could we design an elegant representation for specifying these details, from which the more mundane parts of a fuzzing tool could be generated? * When a formal specification for a system under test is available, e.g. thanks to a formal verification effort, can this be leveraged as a starting point for a functional fuzzer? * Can a domain-specific fuzzer be used to create interesting seed inputs that can be used to guide symbolic execution? * Can functional fuzzing be useful in application domains where the notion of ?correct? is not well defined, such as machine learning and computer vision? -------------- next part -------------- An HTML attachment was scrubbed... URL: From alexandra.traxler at tuwien.ac.at Mon Nov 29 03:48:26 2021 From: alexandra.traxler at tuwien.ac.at (Traxler, Alexandra) Date: Mon, 29 Nov 2021 08:48:26 +0000 Subject: [TYPES/announce] University Assistant (Post-Doc) Position at TU Wien, 20 hours/week Message-ID: <2e6f7133df8c421695ea13138625e907@tuwien.ac.at> The Research Unit Formal Methods in Systems Engineering at the Institute of Logic and Computation of TU Wien, is offering a position as university assistant (post-doc) for 6 years for 20 hours/week. Expected start: January 2022. Tasks: * Research experience in the area automated propositional reasoning and checking of proof certificates * Deep interest in scientific problems and the motivation for independent and goal-oriented research * Independent teaching or participation in teaching and supervision of students * Project work and leadership of project groups * Publishing activities * The ability to develop methods, concepts, as well as their realization and evaluation and the willingness to contribute in scientific projects * Participation in and organization of scientific events * Supervision of students * Participation in organizational and administrative tasks of the research division and the faculty Your profile: * Completed doctoral studies in a relevant area * Sound knowledge of scientific work * In-depth knowledge of the subject area propositional reasoning (CDCL), checking of propositional proof certificates (DRAT, DPR, DSR), and Craig Interpolation * Experience in national and international research cooperation as well as in project management and presentations * Interdisciplinary work * Experience in teaching and publication activities as well as interest and enthusiasm in research and work/support with students * Organizational and analytical skills as well as a structured way of working * Excellent command of the English language and very good communicative skills and team competences * Very good skills in English communication and writing. Knowledge of German (level B2) or willingness to learn it in the first year We offer: * Continuing personal and professional education and flexible working hours * Central location of workplace with very good accessibility * A creative environment in one of the most liveable cities in the world * Additional benefits for employees can be found at the following link: Fringe-Benefit Catalogue of TU Wien Entry level salary is determined by the pay grade B1 of the Austrian collective agreement for university staff. This is a minimum of currently EUR 1,973.00/month gross, 14 times/year for 20 hours/week. Relevant working experiences may increase the monthly income. We look forward to receiving your application until 16.12.2021: https://urldefense.com/v3/__https://jobs.tuwien.ac.at/Job/168937__;!!IBzWLUs!DDWDb8RTxzhsMzutHPNY3EQPKBKpTO7fcyEXQUgS6nlOUTneoL9eUaZkSFkKCc1mz6tFypyj4zdwgA$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From havelund at gmail.com Tue Nov 30 11:53:56 2021 From: havelund at gmail.com (Klaus Havelund) Date: Tue, 30 Nov 2021 08:53:56 -0800 Subject: [TYPES/announce] NFM 2022 - call for papers - DEADLINE EXTENSION! Message-ID: NFM 2022 - FOURTH CALL FOR PAPERS The 14th NASA Formal Methods Symposiumhttps://nfm2022.caltech.edu May 24-27, 2022 Pasadena, California, USA *** EXTENDED SUBMISSION DEADLINE: January 10, 2022 *** The symposium is planned to be held in person at California Institute of Technology, but potentially transitioning to fully virtual if the COVID situation persists. Virtual presentations will be possible even if the conference is held in-person. The symposium has NO registration fee for presenting and attending. IMPORTANT DATES - Abstract Submission: January 3, 2021 *** extended *** - Paper Submission: January 10, 2021 *** extended *** - Paper Notifications: February 28, 2022 - Camera-ready Papers: March 28, 2022 - Symposium: May 24-27, 2022 THEME OF SYMPOSIUM The widespread use and increasing complexity of mission-critical and safety-critical systems at NASA and in the aerospace industry requires advanced techniques that address these systems' specification, design, verification, validation, and certification requirements. The NASA Formal Methods Symposium (NFM) is a forum to foster collaboration between theoreticians and practitioners from NASA, academia, and industry. NFM's goals are to identify challenges and to provide solutions for achieving assurance for such critical systems. The focus of the symposium will be on formal/rigorous techniques for software assurance, including their theory, current capabilities and limitations, as well as their potential application to aerospace during all stages of the software life-cycle. The NASA Formal Methods Symposium is an annual event organized by the NASA Formal Methods (NFM) Research Group, composed of researchers spanning six NASA centers. The organization of NFM 2022 is being led by the Jet Propulsion Laboratory (JPL), located in Pasadena, California. TOPICS ON INTEREST Topics of interest include, but are not limited to, the following aspects of formal methods: Advances in formal methods - Interactive and automated theorem proving - SMT and SAT solving - Model checking - Static analysis - Runtime verification - Automated testing - Specification languages, textual and graphical - Refinement - Code synthesis - Design for verification and correct-by-design techniques - Requirements specification and analysis Integration of formal methods techniques - Integration of diverse formal methods techniques - Use of machine learning and probabilistic reasoning techniques in formal methods - Integration of formal methods into software engineering practices??????? - Combination of formal methods with simulation and analysis techniques - Formal methods and fault tolerance, resilient computing, and self healing systems - Formal methods and graphical modeling languages such as SysML, UML, MATLAB/Simulink - Formal methods and autonomy, e.g., verification of systems and languages for planning and scheduling (PDDL, Plexil, etc.), self-sufficient systems, and fault-tolerant systems. Formal methods in practice - Experience reports of application of formal methods on real systems, such as autonomous systems, safety-critical systems, concurrent and distributed systems, cyber-physical, embedded, and hybrid systems, fault-detection, diagnostics, and prognostics systems, and human-machine interaction analysis. - Use of formal methods in systems engineering (including hardware components) - Use of formal methods in education - Reports on negative results in the development and the application for formal methods in practice. - Usability of formal method tools, and their infusion into industrial contexts. - Challenge problems for future reference by the formal methods community. The formulation of these papers can range from plain English description of a problem over formal specifications, to specific implementations in a programming language. NASA OPEN SOURCE Courageous authors, who want to delve in open source software being applied in real NASA missions, and find possible connections to and applications of Formal Methods, are invited to visit the open source repositories for the following two frameworks for programming flight software: - F???????? (https://urldefense.com/v3/__https://nasa.github.io/fprime/__;!!IBzWLUs!EdLe1L1bvKTJyz_J3OudwgQ1ee_Oami3y1MfnJAX8K2OsJeTb7S5FWFpqsK_65Iam3paujY6mIzQ_A$ ) - cFS (https://urldefense.com/v3/__https://cfs.gsfc.nasa.gov/__;!!IBzWLUs!EdLe1L1bvKTJyz_J3OudwgQ1ee_Oami3y1MfnJAX8K2OsJeTb7S5FWFpqsK_65Iam3paujYyDEVuAw$ ) SUBMISSIONS There are two categories of submissions: - Regular papers describing fully developed work and complete results (maximum 15 pages, excluding references); - Short papers on tools, experience reports, or work in progress with preliminary results (maximum 6 pages, excluding references). Additional appendices can be submitted as supplementary material for reviewing purposes. They will not be included in the proceedings. All papers must be in English and describe original work that has not been published. All submissions will be reviewed by at least three members of the Program Committee. Reviewing is Single-blind. We encourage authors to focus on readability of their submissions. Papers will appear in the Formal Methods subline of Springer's Lecture Notes in Computer Science (LNCS) and must use LNCS style formatting (https://urldefense.com/v3/__https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines__;!!IBzWLUs!EdLe1L1bvKTJyz_J3OudwgQ1ee_Oami3y1MfnJAX8K2OsJeTb7S5FWFpqsK_65Iam3paujbLT2CyNA$ ). Papers must be submitted in PDF format at the EasyChair submission site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=nfm2022__;!!IBzWLUs!EdLe1L1bvKTJyz_J3OudwgQ1ee_Oami3y1MfnJAX8K2OsJeTb7S5FWFpqsK_65Iam3paujbrdFOIJg$ . Authors of selected best papers will be invited to submit an extended version to a special issue in Springer's Innovations in Systems and Software Engineering: A NASA Journal (https://urldefense.com/v3/__https://www.springer.com/journal/11334__;!!IBzWLUs!EdLe1L1bvKTJyz_J3OudwgQ1ee_Oami3y1MfnJAX8K2OsJeTb7S5FWFpqsK_65Iam3paujYfX3ZINA$ ). ARTIFACTS Authors are encouraged, but not strictly required, to submit artifacts that support the conclusions of their work (if allowed by their institutions). Artifacts may contain software, mechanized proofs, benchmarks, examples, case studies and data sets. Artifacts will be evaluated by the Program Committee together with the paper. ORGANIZERS PC chairs - Klaus Havelund, JPL, USA - Jyo Deshmukh, USC, USA - Ivan Perez, NIA, USA Application Advisors - Robert Bocchino, JPL, USA - John Day, JPL, USA - Maged Elasaar, JPL, USA - Amalaye Oyake, Blue Origin, USA - Nicolas Rouquette, JPL, USA - Vandi Verma, JPL, USA Application advisors advise the PC chairs to ensure a strong connection to the problems facing NASA. Local Organizer - Richard Murray, Caltech, USA Scientific Advisor - Mani Chandy, Caltech, USA Program Committee - Aaron Dutle, NASA, USA - Alessandro Cimatti, Fondazione Bruno Kessler, Italy - Anastasia Mavridou, SGT Inc. / NASA Ames Research Center, USA - Anne-Kathrin Schmuck, Max-Planck-Institute for Software Systems, Germany - Arie Gurfinkel, University of Waterloo, Canada - Bardh Hoxha, Toyota Research Institute North America, USA - Bernd Finkbeiner, CISPA Helmholtz Center for Information Security, Germany - Betty H.C. Cheng, Michigan State University, USA - Borzoo Bonakdarpour, Michigan State University, USA - Carolyn Talcott, SRI International, USA - Chuchu Fan, MIT, USA - Constance Heitmeyer, Naval Research Laboratory, USA - Corina Pasareanu, CMU, NASA, KBR, USA - Cristina Seceleanu, M????lardalen University, Sweden - Dejan Nickovic, Austrian Institute of Technology AIT, Austria - Dirk Beyer, LMU Munich, Germany - Doron Peled, Bar Ilan University, Israel - Erika Abraham, RWTH Aachen University, Germany - Ewen Denney, NASA, USA - Gerard Holzmann, Nimble Research, USA - Giles Reger, The University of Manchester, UK - Huafeng Yu, TOYOTA InfoTechnology Center USA, USA - Jean-Christophe Filliatre, CNRS, France - Johann Schumann, NASA, USA - John Day, Jet Propulsion Laboratory, USA - Julia Badger, NASA, USA - Julien Signoles, CEA LIST, France - Kerianne Hobbs, Air Force Research Laboratory, USA - Kristin Yvonne Rozier, Iowa State University, USA - Leonardo Mariani, University of Milano Bicocca, Italy - Lu Feng, University of Virginia, USA - Marcel Verhoef, European Space Agency, The Netherlands - Marie Farrell, Maynooth University, Ireland - Marieke Huisman, University of Twente, The Netherlands - Marielle Stoelinga, University of Twente, The Netherlands - Martin Feather, Jet Propulsion Laboratory, USA - Martin Leucker, University of Luebeck, Germany - Michael Lowry, NASA, USA - Misty Davies, NASA, USA - Natasha Neogi, NASA, USA - Nicolas Rouquette, Jet Propulsion Laboratory, USA - Nikos Arechiga, Toyota Research Institute, USA - Rajeev Joshi, Amazon Web Services, USA - Stanley Bak, Stony Brook University, USA - Sylvie Boldo, INRIA, France - Vandi Verma, NASA, USA - Willem Visser, Amazon Web Services, USA CONTACT Email: nfm2022 [at] easychair [dot] org -------------- next part -------------- An HTML attachment was scrubbed... URL: From yoni206 at gmail.com Wed Dec 1 02:55:19 2021 From: yoni206 at gmail.com (Yoni) Date: Wed, 1 Dec 2021 09:55:19 +0200 Subject: [TYPES/announce] PhD and Postdoc Positions in Automated Reasoning at Bar-Ilan University Message-ID: Formal Methods and Automated Reasoning Department of Computer Science, Bar-Ilan University Israel Postdoctoral and PhD Positions This is a call for interest for PhD and postdoctoral research at Yoni Zohar?s group in Bar-Ilan University. The positions will focus on Satisfiability Modulo Theories (SMT) methods for verification of smart contracts, as well as for bit-precise reasoning. The work will be done in collaboration with the University of Iowa and Stanford University. Qualifications: The ideal applicants would have: * strong programming skills * a strong publication record in formal methods * experience in conducting practical or theoretical research in automated reasoning Interested applicants should send their CV, including a list of publications, in PDF to yoni.zohar at biu.ac.il together with the names of at least two references. Starting date is planned for 2022. -------------- next part -------------- An HTML attachment was scrubbed... URL: From loris at cs.wisc.edu Wed Dec 1 04:15:38 2021 From: loris at cs.wisc.edu (Loris D'Antoni) Date: Wed, 1 Dec 2021 10:15:38 +0100 Subject: [TYPES/announce] Call for Participation: POPL'22 Message-ID: Call for Participation: POPL'22 January16--22, 2022, Philadelphia Registration now open: early registration deadline: January 3 ! POPL'22 --- 49th ACM Symposium on Principles of Programming Languages, will be held in Philadelphia, USA, from January 16 to January 22, 2022. The annual POPL meeting is a forum for the discussion of all aspects of programming languages and programming systems. The symposium is sponsored by ACM SIGPLAN, in cooperation with ACM SIGACT and ACM SIGLOG. This year's program consists of 68 research papers on topics ranging from formal frameworks to experience reports. The registration is now open, see POPL'22 website for details. Location: POPL?22 will be held in person in Philadelphia from Sunday, January 16 to Saturday, January 22, 2022. The conference will be held in Westin Philadelphia in the beautiful neighborhood of Rittenhouse Square in Center City which is within walking distance to many of the tourist attractions in Philadelphia. Keynotes: POPL'22 will feature keynote lectures by Alfred V. Aho (Columbia University, co-winner of the 2021 ACM A.M. Turing Award) Alexandra Silva (Cornell University) Armando Solar-Lezama (MIT) Tutorials: TutorialFest at POPL will host the following tutorials this year: "Formal Methods and Deep Learning" by Matthew Mirman and Gagandeep Singh "Program Analysis via Graph Reachability: Past, Present, and Future" by Qirun Zhang and Thomas Reps "Meta-programming and proving with MetaCoq" by Matthieu Sozeau, Yannick Forster, and Meven Lennon-Bertrand Mentoring: POPL'22 will include the following events for helping attendees with research and career opportunities in programming languages: Programming Languages and Mentoring Workshop (PLMW) Junior Faculty Mentoring Breakfast Mentoring Breakfast for Graduating PhDs and Postdocs Diversity, Equity, and Inclusion: POPL is committed to welcoming and fostering participation by diverse members of PL community. DEI events at POPL'22 include Women at POPL Lunch LGBTQ+ at POPL Lunch ShutdownPL Session with a special keynote by Dr. Brittany Johnson Co-located meetings: Certified Programs and Proofs (CPP) 2022 24th International Symposium on Practical Aspects of Declarative Languages (PADL) 2022 23rd International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI) 2022 Co-located workshops: Eighth International Workshop on Coq for Programming Languages (CoqPL) Seventh International Workshop on Languages for Inference (LAFI) ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) Workshop on Principles of Secure Compilation (PriSC) Programming Languages and the Law (ProLaLa) First Workshop on the Implementation of Type Systems (WITS) Virtual participation: We are looking forward to welcome POPL community for an in-person meeting. Talks will be live-streamed and arrangements will be made for authors who need to give their talks remotely. There will be a separate virtual workshop on January 27?28, 2022, to give all in the POPL community an opportunity to interact with one another. COVID policy: Attendance at POPL'22 requires a proof of COVID vaccination. Precise details---consistent with city, state, and federal regulations, will be posted on POPL website soon. Organizing Committee: Rajeev Alur (General Chair) Hongseok Yang (PC Chair) Nate Foster (Industrial Relations) Loris D'Antoni (Publicity) Ruzica Piskac and Ilya Sergey (Workshops) Jeehong Kang and Azalea Raad (Student Research Competition) Pavel Panchekha and Mukund Raghothaman (Artifact Evaluation) Amin Timany and Yuepeng Wang (Web) Konstantinos Kallas and Aaron Weiss (Student Volunteer) Adam Chlipala and Youyou Cong (Virtualization) Jennifer Paykin (Accessibility, Diversity, and Inclusion) Industry Sponsors: POPL'22 gratefully acknowledges financial support from industry sponsors: Platinum: Epic Games, Meta, Microsoft, Tezos Gold: Amazon, Jane Street Silver: JetBrains Bronze: Certora, Informal Systems, Google Early stage: AkitaSoftware, Correct Computation, OctoML -------------- next part -------------- An HTML attachment was scrubbed... URL: From shibashis.guha at gmail.com Wed Dec 1 05:20:06 2021 From: shibashis.guha at gmail.com (Shibashis Guha) Date: Wed, 1 Dec 2021 15:50:06 +0530 Subject: [TYPES/announce] iVerif (FSTTCS Pre-Conference Workshop) Call for participation: December 14 Message-ID: Apologies for multiple copies of this email; please re-distribute as you see fit. Call for Participation iVerif Workshop on Artificial Intelligence and Verification https://urldefense.com/v3/__https://www.tifr.res.in/*shibashis.guha/iVerif__;fg!!IBzWLUs!E0lOQDNLbwasZ491E6K86D5BtzE_59XmckKY3YTScNLtgiOhoVoATSDVm9kU0xrbWqx-Jn7pyxyigQ$ December 14, 2021, Online (pre-FSTTCS workshop) Recently, efficient artificial intelligence techniques are increasingly applied to problems which are (theoretically) hard or even undecidable, while usually no formal correctness guarantees are given. These shortcomings raise the following question: Can AI borrow from the verification techniques where correctness is of paramount importance, and thus provide correctness guarantees? On the other hand, verification algorithms often suffer from scalability issues while providing correctness. This raises the following question: Can we leverage machine learning techniques to implement better, more efficient verification tools? The iVerif workshop aims at bringing together researchers working on different aspects of AI for verification, the verification of AI-enabled systems, and safe AI, amongst others. Invited lectures: Dana Fisman Jan K?et?nsk? Pavithra Prabhakar Ashutosh Trivedi The workshop will also consist of short invited student presentations as well as a panel discussion (panelists: Supratik Chakraborty (Chair), Nils Jansen, Jan K?et?nsk?, Pavithra Prabhakar, and Ashutosh Trivedi). Full program with talk abstracts: https://urldefense.com/v3/__https://www.tifr.res.in/*shibashis.guha/iVerif/__;fg!!IBzWLUs!E0lOQDNLbwasZ491E6K86D5BtzE_59XmckKY3YTScNLtgiOhoVoATSDVm9kU0xrbWqx-Jn5Rcs-DVw$ Registration is free but mandatory. https://urldefense.com/v3/__https://www.tifr.res.in/*shibashis.guha/iVerif/*participate__;fiM!!IBzWLUs!E0lOQDNLbwasZ491E6K86D5BtzE_59XmckKY3YTScNLtgiOhoVoATSDVm9kU0xrbWqx-Jn4Q109Eyg$ Organisers: Shibashis Guha Guillermo A. P?rez -------------- next part -------------- An HTML attachment was scrubbed... URL: From christophe.chareton at gmail.com Wed Dec 1 09:53:10 2021 From: christophe.chareton at gmail.com (christophe chareton) Date: Wed, 1 Dec 2021 15:53:10 +0100 Subject: [TYPES/announce] =?utf-8?q?Postdoc_position_in_quantum_formal_ve?= =?utf-8?q?rification_=40_Universit=C3=A9_Paris-Saclay=2C_CEA_List?= =?utf-8?q?=2C_France?= Message-ID: The emerging quantum software group @ CEA List, Universit? Paris-Saclay, offers a two years fully-funded postdoctoral position at the crossroad of quantum programming, program analysis and formal methods. === OUR GROUP We are an emerging group in formal verification and static analysis of quantum programs, integrated in the Software Safety Laboratory of CEA List, Universit? Paris-Saclay. Our long term goal is to design and develop formal techniques and tools enabling productive and certified quantum programming. Especially, we develop Qbricks [1], a proof of concept environment for formally verified quantum programming language. See our website at https://urldefense.com/v3/__https://qbricks.github.io/__;!!IBzWLUs!DTmRMuyfh6ehH9DSFJaqLMIs4YlesQRyI8Q8dkpjvQlB5Tx-NTs4Fg265PDuyMEj-jAvzHF-RqvC7g$ for additional information. === ABOUT THE POSTDOC POSITION Adapting the best practice for classical computing formal verification -- deductive verification, first order logic reasoning--, our recent development of Qbricks enables formal specification -- circuit well-formedness, functional behavior, complexity -- and verification for quantum programming with ideal qubits. The goal of this post- doctoral position is to extend this practice to quantum compilation and physical qubits implementations. Possibilities include, among others, error correction mechanisms in certified quantum code, together with specifications and reasoning technique for certifying its reliability, automatized certified optimizer for quantum circuits, hardware agnostic assembly language together with its compiler, qubit mapping, etc Keywords: quantum programming, compilation, optimization, formal verification, deductive verification === HOW TO APPLY Applications should be sent to christophe.char... at cea.fr as soon as possible (first come, first served) and by early February 2021 at the latest. Candidates should send a CV, a cover letter, a transcript of all their university results, as well as contact information of two references. The position is expected to start in May 2021. Advisors: Christophe Chareton (CEA), S?bastien Bardin (CEA) Contact: christophe.chareton at cea.fr, sebastien.bardin at cea.fr [1] C. Chareton, S. Bardin, F. Bobot, V. Perrelle, and B. Valiron. An Automated Deductive Verification Framework for Circuit-building Quantum Programs. ESOP 2021. -------------- next part -------------- An HTML attachment was scrubbed... URL: From Graham.Hutton at nottingham.ac.uk Thu Dec 2 03:47:12 2021 From: Graham.Hutton at nottingham.ac.uk (Graham Hutton) Date: Thu, 2 Dec 2021 08:47:12 +0000 Subject: [TYPES/announce] 10 PhD studentships in Nottingham Message-ID: <1E5CC6E0-9CD8-451D-AA81-C6401EED18C1@nottingham.ac.uk> Dear all, The School of Computer Science at the University of Nottingham in the UK is seeking applications for 10 fully-funded PhD studentships: https://urldefense.com/v3/__https://tinyurl.com/ten-phd-2021__;!!IBzWLUs!FPOJPjJY-7d-34zMA-4YhOgqorzvT_AbWrXzdkPjIAiUkOZ-QohwBW0cNhyD1RPGceGhtUYVWb8WSA$ Applicants in the area of the Functional Programming Lab (tinyurl.com/fp-notts) are strongly encouraged! If you are interested in applying, please contact a potential supervisor as soon as possible; the application deadline is 13th Feb: Thorsten Altenkirch - constructive logic, proof assistants, homotopy type theory, category theory, lambda calculus. Graham Hutton - functional programming, haskell, category theory, program verification, program calculation. Nicolai Kraus - homotopy type theory, higher category theory, constructive mathematics, and related topics. The studentships are open to applicants of any nationality. Best wishes, Graham Hutton +-----------------------------------------------------------+ 10 Fully-Funded PhD Studentships School of Computer Science University of Nottingham, UK tinyurl.com/ten-phd-2021 Applications are invited from international and home students for 10 fully-funded PhD studentships offered by the School of Computer Science, starting on 1st October 2022. The topics for the studentships are open, but should relate to interests of one of the School's research groups: Computational Optimisation and Learning; Computer Vision; Cyber Security; Functional Programming; Intelligent Modelling and Analysis; Mixed Reality; Uncertainty in Data and Decision Making. The studentships are fully-funded for 3.5 years and include a stipend of ?15,009 per year and tuition fees. Applicants are normally expected to have a first class bachelors or masters degree in Computer Science or another relevant area, and must obtain the support of a potential supervisor in the School prior to submitting their application. If you are interested in applying, please contact a potential supervisor as soon as possible, and at least two weeks prior to the closing date. If the supervisor wishes to support your application, they will direct you to make an official application through the MyNottingham system. Closing date for applications: Sunday 13th February 2022. +-----------------------------------------------------------+ This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law. From Gethin.Norman at glasgow.ac.uk Thu Dec 2 05:36:43 2021 From: Gethin.Norman at glasgow.ac.uk (Gethin Norman) Date: Thu, 2 Dec 2021 10:36:43 +0000 Subject: [TYPES/announce] FORMATS 2022: first call for papers Message-ID: <266C22BF-5B73-45AE-B138-3C09BD492359@glasgow.ac.uk> FORMATS 2022: FIRST CALL FOR PAPERS 20th International Conference on Formal Modeling and Analysis of Timed Systems https://urldefense.com/v3/__https://conferences.ncl.ac.uk/formats2022/__;!!IBzWLUs!BOHDApCNnQCOFEiQZ7lgTzcsyd6Ga9ps_1WJzpfji_AcrOivq0VZ-TKJIgc7Yim4EW5Im6bW4GMx6Q$ 12-17 September 2022, Warsaw, Poland co-located with CONCUR, FMICS and QEST as part of CONFEST 2022 SCOPE & TOPICS FORMATS (International Conference on Formal Modeling and Analysis of Timed Systems) is an annual conference which aims to promote the study of fundamental and practical aspects of timed systems, and to bring together researchers from different disciplines that share interests in the modelling, design and analysis of timed computational systems. The conference aims to attract researchers interested in real-time issues in hardware design, performance analysis, real-time software, scheduling, semantics and verification of real-timed, hybrid and probabilistic systems. Typical topics include (but are not limited to): ? Foundations and Semantics: Theoretical foundations of timed systems, languages and models (e.g., timed automata, timed Petri nets, hybrid automata, timed process algebra, max-plus algebra, probabilistic models). ? Methods and Tools: Techniques, algorithms, data structures, and software tools for analyzing timed systems and resolving temporal constraints (e.g., scheduling, worst-case execution time analysis,optimization, model checking, testing, constraint solving). ? Applications: Adaptation and specialization of timing technology in application domains in which timing plays an important role (e.g., real-time software, hardware circuits, scheduling in manufacturing and telecommunication, robotics). New for this year, FORMATS will incorporate a special track on: ? Learning-based and data-driven systems: We particularly encourage papers that exploit synergies between the formal analysis of timed systems and data-driven techniques (such as reinforcement learning or deep learning), or which target application domains where learning is important (such as robotics or autonomous systems). PAPER SUBMISSION FORMATS 2022 solicits high-quality papers reporting research results, experience reports and/or tools related to the topics mentioned above. Submitted papers must contain original, unpublished contributions, not submitted for publication elsewhere. The papers should be submitted electronically in PDF, following the Springer LNCS style guidelines. Two categories of papers are invited: ? Regular papers, which should not exceed 15 pages in length ? Short papers, which should not exceed 7 pages in length Both page limits exclude references, which are not limited in length. If necessary, the paper may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. Each paper will undergo a thorough review process. Papers should be submitted electronically via the EasyChair online submission system: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=formats2022__;!!IBzWLUs!BOHDApCNnQCOFEiQZ7lgTzcsyd6Ga9ps_1WJzpfji_AcrOivq0VZ-TKJIgc7Yim4EW5Im6btbrXVaQ$ ARTIFACT EVALUATION This year, FORMATS is encouraging authors to submit artifacts where appropriate, for example to demonstrate how to reproduce experimental data in a research paper or to examine the usability and applicability of a software tool. Artifacts will be submitted and evaluated only for papers accepted for publication. These will be evaluated by the Artifact Evaluation Committee and those that are accepted will receive a repeatability badge to be displayed on the first page of the published version. PUBLICATION AND BEST PAPER AWARD The proceedings of FORMATS 2022 will be published by Springer in the Lecture Notes in Computer Science series. The best paper of the conference will be awarded the Oded Maler Award in Timed Systems. IMPORTANT DATES ? Abstract submission: 19 April 2022 ? Paper submission: 22 April 2022 ? Acceptance notification: 17 June 2022 ? Artifact submission deadline: 24 June 2022 ? Camera-ready copy deadline: 15 July 2022 ? Conference: 12-17 September 2022 CONFEST 2022, which includes FORMATS 2022, is currently planned as a physical, in-person event with support for remote presence for speakers and participants. Depending on the pandemic situation, a decision whether to cancel the physical component of CONFEST or not will be made by the end of June 2022. ??For any questions, feel free to contact the program chairs Sergiy Bogomolov (sergiy.bogomolov at ncl.ac.uk) and David Parker (d.a.parker at cs.bham.ac.uk). ORGANISATION Program Chairs ? Sergiy Bogomolov (UK) ? David Parker (UK) Artifact Evaluation Chairs ? Akshay Rajhans (USA) ? Paolo Zuliani (UK) Publicity Chair ? Gethin Norman (UK) Special Track Chair ? Alessandro Abate (UK) Program Committee ? Alessandro Abate (UK) ? Parosh Aziz Abdulla (Sweden) ? Erika Abraham (Germany) ? Bernhard Aichernig (Austria) ? Nicolas Basset (France) ? Nathalie Bertrand (France) ? Sergiy Bogomolov (co-chair, UK) ? Lei Bu (China) ? Milan Ceska (Czech Republic) ? Thao Dang (France) ? Catalin Dima (France) ? Rayna Dimitrova (Germany) ? Mirco Giacobbe (UK) ? Radu Grosu (Austria) ? Arnd Hartmanns (The Netherlands) ? Hsi-Ming Ho (UK) ? Peter Gj?l Jensen (Denmark) ? Taylor Johnson (USA) ? Sebastian Junges (Netherlands) ? Joost-Pieter Katoen (Germany) ? Sophia Knight (USA) ? Matthieu Martel (France) ? Gethin Norman (UK) ? Miroslav Pajic (USA) ? David Parker (co-chair, UK) ? Igor Potapov (UK) ? Christian Schilling (Denmark) ? Ana Sokolova (Austria) ? Sadegh Soudjani (UK) ? Stavros Tripakis (USA) ? Jana Tumova (Sweden) ? Naijun Zhan (China) Steering Committee ? Rajeev Alur (USA) ? Eugene Asarin (France) ? Martin Fr?nzle (chair, Germany) ? Thomas A. Henzinger (Austria) ? Joost-Pieter Katoen (Germany) ? Kim G. Larsen (Denmark) ? Oded Maler (founding chair, France) (1957-2018) ? Pavithra Prabhakar (USA) ? Mari?lle Stoelinga (The Netherlands) ? Wang Yi (Sweden) From ucacsam at ucl.ac.uk Thu Dec 2 06:38:39 2021 From: ucacsam at ucl.ac.uk (Matteo Sammartino) Date: Thu, 2 Dec 2021 11:38:39 +0000 Subject: [TYPES/announce] Postdoc Position on Verification of Concurrent Systems via Model Learning, Royal Holloway University of London -- Application deadline 9 Jan 2022 Message-ID: - Application deadline: Midnight, 9 Jan 2022 - Starting date: As soon as possible - Salary: ?35,931-?37,979 - Duration: until February 2023 Applications are invited for the post of Post-Doctoral Research Assistant in the Computer Science Department at Royal Holloway, University of London. Successful applicants will be working on the EPSRC-funded "Verification of Hardware Concurrency via Model Learning" (CLeVer) project (EP/S028641/1), led by Alexandra Silva (UCL/Cornell) and Matteo Sammartino (Royal Holloway University of London). This is a joint research effort involving Royal Holloway University of London, University College London, and ARM, world-leading designer of multi-core chips. For an informal discussion about the post, please contact Dr. Matteo Sammartino on matteo.sammartino at rhul.ac.uk. # Project Description Digital devices increasingly rely on multi-threaded computation, with sophisticated concurrent behaviour becoming prevalent at any scale. As the complexity of these systems increases, there is a pressing need to automate the assessment of their correctness, especially with respect to concurrency-related aspects. Formal verification provides highly effective techniques to assess the correctness of systems. However, formal models are usually built by humans, and as such can be error-prone and inaccurate. The CLeVer project aims to: - develop a novel verification framework that relies on learning techniques to automatically build and verify models of concurrency, with a particular focus on multi-core systems. - apply the framework to real-world verification tasks, in collaboration with ARM. # The ideal candidate We are looking for candidates with a PhD in one of the following areas: model-based testing and verification, formal methods for concurrency, automated analysis of hardware systems. Experience in multiple areas will be valued. Candidates ideally should also have strong programming skills. # Where to apply https://urldefense.com/v3/__https://jobs.royalholloway.ac.uk/0721-259-R-R__;!!IBzWLUs!GBUI4ogBjKihbUy7Zjvs5uy-jYLfnkDBmHoLxe66Aocp0u-vNUn0dwNvEzw0ElB4e1xgKh3NbHDrlQ$ From maaike.annebeth at gmail.com Thu Dec 2 10:16:04 2021 From: maaike.annebeth at gmail.com (Maaike Zwart) Date: Thu, 2 Dec 2021 16:16:04 +0100 Subject: [TYPES/announce] SYCO 8 - Final Call for Participation Message-ID: -------------------------------------------------------- CALL FOR PARTICIPATION EIGHTH SYMPOSIUM ON COMPOSITIONAL STRUCTURES (SYCO 8) In person at Tallinn University of Technology, Estonia Also online. 13-14 December 2021 Registration deadline: 6 December 2021 (AoE) Please register even when attending online. https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/8/__;!!IBzWLUs!ArC6yKd-bKyeUi1kcUpC3hzY15fYQ2sZFTtyVy8rgf9wF4RSimzNhzMrdvWnME0Jr3HvNlXOq3bg8g$ -------------------------------------------------------- The Symposium on Compositional Structures (SYCO) is an interdisciplinary series of meetings aiming to support the growing community of researchers interested in the phenomenon of compositionality, from both applied and abstract perspectives, and in particular where category theory serves as a unifying common language. Previous SYCO events have been held at University of Birmingham, University of Strathclyde, University of Oxford, Chapman University, and University of Leicester. SYCO 8 will be held both at Tallinn University of Technology and online, replacing the cancelled SYCO 7. The programme consists of 2 invited talks and 16 contributed talks. -------------------------------------------------------- INVITED TALKS * John van de Wetering (Radboud University Nijmegen) * - Categorical approaches to reconstructing quantum theory* * Christine Tasson (Sorbonne Universit?) * - A multicategorical approach to mixed linear-non-linear substitution* -------------------------------------------------------- CONTRIBUTED TALKS Full schedule available at https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/8/__;!!IBzWLUs!ArC6yKd-bKyeUi1kcUpC3hzY15fYQ2sZFTtyVy8rgf9wF4RSimzNhzMrdvWnME0Jr3HvNlXOq3bg8g$ * Stefan Zetzsche, Gerco van Heerdt, Matteo Sammartino and Alexandra Silva - Canonical automata via distributive law homomorphisms * Simon Henry and Nicholas Meadows - Higher Theories and Monads * Paulina Goedicke and Jamie Vicary - A Category Theoretical Description of Block Designs and Quantum Designs * Vincent Wang-Mascianica and Bob Coecke - Talking Space: Inference from spatial linguistic meanings * Lukas Heidemann - Frames in pretriangulated dg-categories * Elena Di Lavore, Wilmer Leal and Valeria de Paiva - Dialectica Petri nets * George Kaye, Dan Ghica and David Sprunger - Normalisation by evaluation for digital circuits * Guillaume Boisseau and Robin Piedeleu - Graphical Piecewise-Linear Algebra * Liliane-Joy Dandy, Emmanuel Jeandel and Vladimir Zamdzhiev - Qimaera: Type-safe (Variational) Quantum Programming in Idris * Matt Wilson and Augustin Vanrietvelde - Composable constraints * Davide Trotta, Matteo Spadetto and Valeria de Paiva - Dialectica Logical Principles * Simon Fortier-Garceau - Interventions and Counterfactuals for Categorical Models of Causality * Vikraman Choudhury - Weighted sets and modalities * Elena Di Lavore and Pawel Sobocinski - Monoidal width * Dylan McDermott and Alan Mycroft - On the relation between call-by-value and call-by-name * Olivier Peltre - Homological algebra for message-passing algorithms -------------------------------------------------------- REGISTRATION Registration is open until the 6th of December, 2021. You can register for either the in person meeting or for the online event. Please register via: https://urldefense.com/v3/__https://docs.google.com/forms/d/e/1FAIpQLSfAgcQnimYJPM2msBraTU_0k-8zAqwwalYzpSgVtfKgfjkptA/viewform__;!!IBzWLUs!ArC6yKd-bKyeUi1kcUpC3hzY15fYQ2sZFTtyVy8rgf9wF4RSimzNhzMrdvWnME0Jr3HvNlXG0LtoQw$ Registration is free. More details are available on the conference website: https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/8/__;!!IBzWLUs!ArC6yKd-bKyeUi1kcUpC3hzY15fYQ2sZFTtyVy8rgf9wF4RSimzNhzMrdvWnME0Jr3HvNlXOq3bg8g$ -------------------------------------------------------- COVID-19 SITUATION IN ESTONIA The number of covid cases in Estonia is sharply declining, so we feel confident to go ahead with SYCO 8. We are aware of the new Omicron variant, but according to the WHO there is as yet insufficient data to draw any conclusions about its effect on the vaccinated population. We are therefore carrying on with the event in a hybrid form, as planned. We invite those who are willing, and have proof of recovery and/or vaccination, to participate in person. However, each country is imposing its own new travel restrictions. So please check your own country's regulations before booking. At the moment, for the UK, EU, and Schengen countries, proof of vaccination or recovery, and filling out a passenger locator form, is sufficient to enter Estonia. You do not need to get tested or isolate if you fulfill these requirements. Please consult the government web page for the latest regulations: https://urldefense.com/v3/__https://vm.ee/en/information-countries-and-self-isolation-requirements-passengers__;!!IBzWLUs!ArC6yKd-bKyeUi1kcUpC3hzY15fYQ2sZFTtyVy8rgf9wF4RSimzNhzMrdvWnME0Jr3HvNlVV-30-dQ$ -------------------------------------------------------- PROGRAMME COMMITTEE Ross Duncan, University of Strathclyde Alexandre Goy, MICS, CentraleSup?lec Amar Hadzihasanovic, Tallinn University of Technology (local organiser) Jules Hedges, University of Strathclyde Chris Heunen, University of Edinburgh Aleks Kissinger, University of Oxford Jade Master, University of Strathclyde Dan Marsden, University of Oxford Hector Miller-Bakewell Samuel Mimram, ?cole Polytechnique Koko Muroya, Kyoto University Simona Paoli, University of Aberdeen Mehrnoosh Sadrzadeh, University College London Maru Sarazola, Johns Hopkins University Pawel Sobocinski, Tallinn University of Technology (local organiser) Christina Vasilakopoulou, University of Patras Jamie Vicary, University of Cambridge Maaike Zwart, IT University of Copenhagen (chair) -------------------------------------------------------------- STEERING COMMITTEE Ross Duncan, University of Strathclyde Chris Heunen, University of Edinburgh Dominic Horsman, University of Grenoble Aleks Kissinger, University of Oxford Samuel Mimram, ?cole Polytechnique Simona Paoli, University of Aberdeen Mehrnoosh Sadrzadeh, University College London Pawel Sobocinski, Tallinn University of Technology Jamie Vicary, University of Cambridge -------------- next part -------------- An HTML attachment was scrubbed... URL: From elenam at morris.umn.edu Thu Dec 2 12:37:18 2021 From: elenam at morris.umn.edu (Elena Machkasova) Date: Thu, 2 Dec 2021 11:37:18 -0600 Subject: [TYPES/announce] Trends in Functional Programming in Education 2022 2nd call for submissions Message-ID: TFPIE 2022 Call for papers https://urldefense.com/v3/__https://wiki.tfpie.science.ru.nl/TFPIE2022__;!!IBzWLUs!BYmwZCLf-1RFj5FszHBdMbOI1_Aia-K2TLzu4h1_rcF5_lVrgWdfq9KwBt-AoywPYNWSIbBk-Qk-zA$ (February 11th 2022, Krakow, Poland co-located with TFP 2022 and Lambda Days) TFPIE 2022 welcomes submissions describing techniques used in the classroom, tools used in and/or developed for the classroom and any creative use of functional programming (FP) to aid education in or outside Computer Science. Topics of interest include, but are not limited to: FP and beginning CS students FP and Computational Thinking FP and Artificial Intelligence FP in Robotics FP and Music Advanced FP for undergraduates FP in graduate education Engaging students in research using FP FP in Programming Languages FP in the high school curriculum FP as a stepping stone to other CS topics FP and Philosophy The pedagogy of teaching FP FP and e-learning: MOOCs, automated assessment etc. Best Lectures - more details below In addition to papers, we are requesting best lecture presentations. What's your best lecture topic in an FP related course? Do you have a fun way to present FP concepts to novices or perhaps an especially interesting presentation of a difficult topic? In either case, please consider sharing it. Best lecture topics will be selected for presentation based on a short abstract describing the lecture and its interest to TFPIE attendees. The length of the presentation should be comparable to that of a paper. In addition, the speaker can provide commentary on effectiveness or student feedback. Submissions Potential presenters are invited to submit an extended abstract (4-6 pages) or a draft paper (up to 20 pages) in EPTCS style. The authors of accepted presentations will have their preprints and their slides made available on the workshop's website. Papers and abstracts can be submitted via easychair at the following link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=tfpie2022__;!!IBzWLUs!BYmwZCLf-1RFj5FszHBdMbOI1_Aia-K2TLzu4h1_rcF5_lVrgWdfq9KwBt-AoywPYNWSIbDqFeHlwA$ After the workshop, presenters are invited to submit (a revised version of) their article for the formal review. The PC will select the best articles for publication in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and extended abstracts will not be formally reviewed by the PC. Important Dates Submission deadline: January 5th 2022, Anywhere on Earth. Notification: January 10th 2022 (Note: earlier submissions will receive earlier response) TFPIE Registration Deadline: TBA Workshop: February 11th 2022 Submission for formal review: April 15th 2022, Anywhere on Earth. Notification of full article: June 1st 2022 Camera ready: July 1st 2022 Program Committee Peter Achten, Radboud University, Netherlands Stephen Chang, University of Massachusetts Boston, USA John Hughes, Chalmers University of Technology, Sweden Elena Machkasova (Chair) - University of Minnesota Morris, USA Kristina Sojakova - INRIA, Paris, France Melinda T?th, E?tv?s Lor?nd University, Budapest, Hungary Keynote speaker Our keynote talk is "The perfect Functional Programming course" by Peter Achten. Registration information This year TFPIE takes place on the second day of the Lambda Days, concurrent with TFP. Participants will need to register for the Lambda Days. Please note that TFP and TFPIE have in-person attendance only. For registration fee, the deadlines, and the link to register see the Lambda Days web site: https://urldefense.com/v3/__https://www.lambdadays.org/lambdadays2022__;!!IBzWLUs!BYmwZCLf-1RFj5FszHBdMbOI1_Aia-K2TLzu4h1_rcF5_lVrgWdfq9KwBt-AoywPYNWSIbD2d23HAA$ Registration and attendance are mandatory for at least one author of every paper that is presented at the workshop. Presenters will have their registration fee waived. Only papers that have been presented at TFPIE may be submitted to the post-reviewing process. Best regards, Elena Machkasova, -- Dr. Elena Machkasova Associate Professor of Computer Science Division of Science and Mathematics University of Minnesota, Morris Office: Sci 2325 (320) 589-6308 https://urldefense.com/v3/__http://cda.morris.umn.edu/*elenam/__;fg!!IBzWLUs!BYmwZCLf-1RFj5FszHBdMbOI1_Aia-K2TLzu4h1_rcF5_lVrgWdfq9KwBt-AoywPYNWSIbCtBmO_mA$ Pronouns: she/her/hers or any other -------------- next part -------------- An HTML attachment was scrubbed... URL: From bove at chalmers.se Fri Dec 3 10:05:57 2021 From: bove at chalmers.se (Ana Bove) Date: Fri, 3 Dec 2021 16:05:57 +0100 Subject: [TYPES/announce] 1+2 Assistant positions at Chalmers on ICT and Basic Science Message-ID: Dear All, Chalmers has now opened 11 tenured Assistant professor positions among them * *one* in *ICT* area: https://urldefense.com/v3/__https://www.chalmers.se/en/about-chalmers/Working-at-Chalmers/Vacancies/Pages/default.aspx?rmpage=job&rmjob=9987__;!!IBzWLUs!Ed7dp1ZoB0rwnIeO_-3iUF-bR3RRiHeXf4cDQ4yU7np06eS35XHdek4p88WeChrRkol8ap4M7k8HaQ$ * *two* in *Basic science*: https://urldefense.com/v3/__https://www.chalmers.se/en/about-chalmers/Working-at-Chalmers/Vacancies/Pages/default.aspx?rmpage=job&rmjob=9989__;!!IBzWLUs!Ed7dp1ZoB0rwnIeO_-3iUF-bR3RRiHeXf4cDQ4yU7np06eS35XHdek4p88WeChrRkol8ap5LuI--pg$ The positions comes with a starting package, you can read more about this and other conditions in the links above. We encourage all strong candidates to apply, in particular women and other minorities. Please distribute this information to those you think could fit the profile. Thanks -- -- Ana Bove, Docent email: bove(at)chalmers.se Phone: (46)(31)7721020 https://urldefense.com/v3/__http://www.cse.chalmers.se/*bove__;fg!!IBzWLUs!Ed7dp1ZoB0rwnIeO_-3iUF-bR3RRiHeXf4cDQ4yU7np06eS35XHdek4p88WeChrRkol8ap6E6nJfbA$ Department of Computer Science and Engineering Chalmers Univ. of Technology and Univ. of Gothenburg -------------- next part -------------- An HTML attachment was scrubbed... URL: From alexis.saurin at irif.fr Fri Dec 3 11:27:23 2021 From: alexis.saurin at irif.fr (Alexis Saurin IRIF) Date: Fri, 3 Dec 2021 17:27:23 +0100 Subject: [TYPES/announce] Post-doc position in RECIPROG project (located in Lyon, Nantes or Paris) Message-ID: This is an announcement for a postdoctoral position funded by the ANR ReCiProg - Reasoning on Circular proofs for Programming. *We seek candidates holding a PhD in Computer Science or Mathematics, and with expertise in one or several of the following areas:* - Proof theory - Curry-Howard correspondence - Logics with fixed points - Coinductive reasoning - Proof assistants - Type theory - Category theory - Automated deduction In relation with the above topics, an experience in one or several of the following topics will be particularly appreciated: fixed-points and circular proofs, the Coq proof assistant, inductive and coinductive types, guarded recursion, coalgebras, inductive and coinductive theorem proving. *The successful candidate will be employed in one of the following French research lab, depending on her/his specific profile:*- LIP (Plume Team), Lyon (local coordinator: Denis Kuperberg) - LS2N (Gallinette Team), Nantes (local coordinator: Guilhem Jaber) - IRIF (PPS & Picube Team), Paris (local coordinator: Alexis Saurin) *Application process:* - Deadline for applications is on January 5th 2022, for a starting date in the first trimester of 2022, to be negotiated. - Candidates can send their application to Alexis Saurin (alexis dot saurin at irif dot fr) with a subject containing ?[RECIPROG post-doc application]?. - The application should contain a CV, a brief research statement (1-2 pages) & at least two contacts of reference persons (or reference letters if available). - The salary will depend on the successful candidate's prior research experience with a guaranteed minimum of 2300 EUR/month before taxes. *Project summary* RECIPROG is an ANR collaborative project (aka. PRC) starting in the fall 2021-2022 and running till the end of 2025. ReCiProg aims at extending the proofs-as-programs correspondence (aka Curry-Howard correspondence) to recursive programs and circular proofs for logics and type systems using induction and coinduction. The project will contribute both to the necessary theoretical foundations of circular proofs and to the software development allowing to enhance the use of coinductive types and coinductive reasoning in the Coq proof assistant. *More informations* - More informations can be found on the project webpage: https://urldefense.com/v3/__https://www.irif.fr/reciprog/index__;!!IBzWLUs!AJp3qP_SE47hlGSIYHOuEO7FkD-aGIJN2mM06YjRWoAzRNNywXErBF8wyEaJGzAsDAKxAGHj884HuQ$ and https://urldefense.com/v3/__https://www.irif.fr/reciprog/post-doc-offer-dec2021__;!!IBzWLUs!AJp3qP_SE47hlGSIYHOuEO7FkD-aGIJN2mM06YjRWoAzRNNywXErBF8wyEaJGzAsDAKxAGGyk0r_6g$ - RECIPROG ANR project will open further positions in the coming two years, including two more postdoctoral positions in the above teams, and a PhD position in LIRICA Team, LIS, Marseille. - Interested candidates may contact the project coordinator (Alexis Saurin) as well as the local coordinators (Guilhem Jaber, Denis Kuperberg, Luigi Santocanale & Alexis Saurin). -- Alexis Saurin IRIF - CNRS, Universit? de Paris & INRIA -------------- next part -------------- An HTML attachment was scrubbed... URL: From peter.mueller at inf.ethz.ch Fri Dec 3 15:24:47 2021 From: peter.mueller at inf.ethz.ch (Mueller Peter) Date: Fri, 3 Dec 2021 20:24:47 +0000 Subject: [TYPES/announce] Rust Verification Workshop at ETAPS 2022: Call for Talk and Demo Proposals Message-ID: <9b13446ae1474bc3ba2b645cc1826039@inf.ethz.ch> Call for Talk, Demo, and Challenge Proposals 2nd Rust Verification Workshop Co-located with ETAPS 2022 Munich Sunday, April 03, 2022 https://urldefense.com/v3/__https://sites.google.com/view/rustverify2022/home__;!!IBzWLUs!G4xwjmn6v93mHpZ6Tt37BnYL14gdxWDDKZgSwlO-9Sfrs9hqogM9RNBGcF9FAYII5X9yrr7wYQZqUg$ Rust is a new programming language for writing performant code with strong type and memory safety guarantees. It is now considered a serious alternative to C and C++ for systems programming, because it provides high-level abstractions but without the cost of garbage collection. Given the growing popularity of Rust, and given that bugs in systems programs can be costly, there is growing interest in the program verification community for building program verifiers for Rust. In this workshop, we aim to bring together language designers, application developers and formal verification tool builders, to exchange ideas and build collaborations around developing verified Rust programs. The goal of this workshop is to bring researchers from a variety of different backgrounds and perspectives together to exchange new and exciting ideas concerning the verification of Rust programs and exploring avenues for collaboration. We want the workshop to be as informal and interactive as possible. The program will thus involve a combination of invited talks, contributed talks about work in progress, tool demos, and open discussion sessions. There will be no published proceedings, but participants will be invited to submit working documents, talk slides, etc. to be posted on this website. Call for Talk and Demo Proposals --------------------------------------------- We solicit proposals for contributed talks and tool demos. Proposals should be at most 2 pages, in either plain text or PDF format, and should specify how long a talk/demo the speaker wishes to give. By default, contributed talks will be 30 minutes long, but proposals for shorter or longer talks will also be considered. We are interested in talks/demos on all topics related to the verification of Rust programs (including, for instance, program specification, deductive verification, model checking, symbolic execution, runtime monitoring, the semantics and formalization of Rust, and tool support). Talks about work in progress as well as proposals for challenge problems in Rust are particularly encouraged. Please submit by email to peter.mueller at inf.ethz.ch. Important Dates --------------------- Deadline for talk/demo proposals: January 14, 2022 (Friday) Notification of acceptance: February 07, 2022 (Monday) Workshop: April 03, 2022 (Sunday) Organizers ---------------- Rajeev Joshi, Amazon Web Services > Nicholas Matsakis, Mozilla > Peter M?ller, ETH Zurich -------------- next part -------------- An HTML attachment was scrubbed... URL: From ruy at cin.ufpe.br Thu Dec 2 15:30:32 2021 From: ruy at cin.ufpe.br (Ruy Jose Guerra Barretto de Queiroz) Date: Thu, 2 Dec 2021 17:30:32 -0300 Subject: [TYPES/announce] 28th WoLLIC 2022 - First Call for Papers In-Reply-To: References: Message-ID: [Please distribute. Apologies for multiple postings] CALL FOR PAPERS WoLLIC 2022 28th Workshop on Logic, Language, Information and Computation September 20 to 23, 2022 Ia?i, Romania ORGANISATION Faculty of Computer Science, Alexandru Ioan Cuza University, Romania 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-eighth WoLLIC will be held at the Faculty of Computer Science, Alexandru Ioan Cuza University, Ia?i, Romania, September 20 to 23, 2022. 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) (tbc), and the Sociedade Brasileira de L?gica (SBL). ABOUT THE LOCATION Ia?i https://urldefense.com/v3/__https://www.uaic.ro/en/iasi-2/__;!!IBzWLUs!CAFHPJ4OsfRI4PeatmrB_3l3RB5urET0fPIYJwxioMAhMjRnse7neOa3jU8YdbJrms4beLXhKsY3cQ$ 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, programming and Artificial Intelligence (AI); novel computation models and paradigms; broad notions of proof and belief; proof mining, type theory, effective learnability and explainable AI; 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; 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 author's instructions at https://urldefense.com/v3/__http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0__;!!IBzWLUs!CAFHPJ4OsfRI4PeatmrB_3l3RB5urET0fPIYJwxioMAhMjRnse7neOa3jU8YdbJrms4beLUjjWnquw$ ). 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 2022 EasyChair website https://urldefense.com/v3/__https://easychair.org/conferences/?conf=wollic2022__;!!IBzWLUs!CAFHPJ4OsfRI4PeatmrB_3l3RB5urET0fPIYJwxioMAhMjRnse7neOa3jU8YdbJrms4beLV23WQVAA$ . PROCEEDINGS The proceedings of WoLLIC 2022, 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 2022 issue of a scientific journal (to be confirmed). INVITED SPEAKERS (tba) IMPORTANT DATES April 30, 2022: Abstract deadline May 7, 2022: Full paper deadline June 15, 2022: Author notification June 26, 2022: Final version deadline (firm) PROGRAMME COMMITTEE Agata Ciabattoni (Technische Universit?t Wien) (Co-Chair) Diana Costa (University of Lisbon) Hans van Ditmarsch (Open University of the Netherlands) Roman Kuznets (Technische Universit?t Wien) Jo?o Marcos (Univ Federal do Rio Grande do Norte) Larry Moss (Indiana University Bloomington) Valeria de Paiva (Topos Institute and PUC-Rio) Elaine Pimentel (Univ Federal do Rio Grande do Norte) (Co-Chair) Revantha Ramanayake (University of Groningen) Mehrnoosh Sadrzadeh (University College London) Alexandra Silva (Cornell University) Alex Simpson (University of Ljubljana) Sonja Smets (University of Amsterdam) Alwen Tiu (The Australian National University) Leon van der Torre (University of Luxembourg) Andrea Aler Tubella (Ume? University) Andres Villaveces (Universidad Nacional de Colombia) Renata Wassermann (Universidade de S?o Paulo) (MORE TBC) STEERING COMMITTEE Samson Abramsky, Anuj Dawar, Juliette Kennedy, Ulrich Kohlenbach, Daniel Leivant, Leonid Libkin, Lawrence Moss, Luke Ong, Valeria de Paiva, Ruy de Queiroz, Alexandra Silva, Renata Wassermann. ADVISORY COMMITTEE Johan van Benthem, Joe Halpern, Wilfrid Hodges, Angus Macintyre, Hiroakira Ono, Jouko V??n?nen. ORGANISING COMMITTEE ?tefan Ciob?c? (Alexandru Ioan Cuza Univ) (Co-Chair) (more to be announced) 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) (tbc) European Association for Theoretical Computer Science (EATCS) (tbc) Sociedade Brasileira de L?gica (SBL) (tbc) 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 who is considered a father of modern differential geometry. "Taking the Long View: The Life of Shiing-shen Chern" (George Scisery, 2011) examines the life of a remarkable mathematician whose formidable mathematical contributions were matched by an approach and vision that helped build bridges between China and the West. The biographical documentary follows Shiing-shen Chern (1911-2004) through many of the most dramatic events of the 20th century, portraying a man who dedicated his life to pure mathematics with the style of a classical Chinese sage. (zalafilms.com) FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee. WEB PAGE https://urldefense.com/v3/__http://wollic.org/wollic2022/__;!!IBzWLUs!CAFHPJ4OsfRI4PeatmrB_3l3RB5urET0fPIYJwxioMAhMjRnse7neOa3jU8YdbJrms4beLVKL9NH-g$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From nevrenato at gmail.com Sat Dec 4 13:34:56 2021 From: nevrenato at gmail.com (Renato Neves) Date: Sat, 04 Dec 2021 18:34:56 +0000 Subject: [TYPES/announce] PhD position on Quantitative Semantics at INESC-TEC and University of Minho. Message-ID: <8735n8xlhi.fsf@gmail.com> We [2] have available a PhD studentship on the topic of quantitative semantics for hybrid programming [1]. The position will involve (extensions of) lambda-calculus and category theory. We will also work with bits and pieces of topology and probability theory. But don't worry if you're unfamiliar with some of these topics -- most important is that you're eager to learn! * Starting date The starting date is preferably 1st April 2022. * Context This position is part of a broader research project that involves several researchers across different institutions in the north of Portugal. The overarching goal is to establish mathematical foundations for a discipline of hybrid programming capable of handling noise and uncertainty in a principled, rigorous way. In case you're not familiar with the concept, a hybrid program combines classical program constructs with differential equations to model, among other things, interactions between digital devices and physical processes (such as velocity, movement, and energy). Examples of hybrid programs can be found in [1,6] and in my webpage. * How to apply Please send me an email no later than 22nd December 2021 with the following two items: + a cover letter; + a detailed CV. In the meanwhile if you have any questions about the position, including living in Portugal, please do not hesitate to contact me! Btw, Portugal is known as one of the safest countries in the world [3]; has lots of sunshine, pristine beaches, and great food [4,5]. -- Renato Neves https://urldefense.com/v3/__https://di.uminho.pt/*nevrenato/__;fg!!IBzWLUs!DwzSdBgWyL3DakNQC6nj4Sr6ErwVwyxpG9WQD-3ZGA9xWd_Ah5ITPYvlLBlQBmOiLNfPUoePyUtCwQ$ References: [1] Sergey Goncharov, Renato Neves, and Jos? Proen?a. "Implementing hybrid semantics: From functional to imperative." International Colloquium on Theoretical Aspects of Computing. Springer, Cham, 2020. (https://urldefense.com/v3/__https://arxiv.org/abs/2009.14322__;!!IBzWLUs!DwzSdBgWyL3DakNQC6nj4Sr6ErwVwyxpG9WQD-3ZGA9xWd_Ah5ITPYvlLBlQBmOiLNfPUodtOv9pZQ$ ) [2] https://urldefense.com/v3/__https://www.inesctec.pt/en__;!!IBzWLUs!DwzSdBgWyL3DakNQC6nj4Sr6ErwVwyxpG9WQD-3ZGA9xWd_Ah5ITPYvlLBlQBmOiLNfPUofdguBAAA$ [3] https://urldefense.com/v3/__https://en.wikipedia.org/wiki/Global_Peace_Index*Global_Peace_Index_2021_ranking__;Iw!!IBzWLUs!DwzSdBgWyL3DakNQC6nj4Sr6ErwVwyxpG9WQD-3ZGA9xWd_Ah5ITPYvlLBlQBmOiLNfPUofGxl6yIQ$ [4] https://urldefense.com/v3/__https://www.youtube.com/watch?v=akcDhdxSsCM__;!!IBzWLUs!DwzSdBgWyL3DakNQC6nj4Sr6ErwVwyxpG9WQD-3ZGA9xWd_Ah5ITPYvlLBlQBmOiLNfPUocNCe-zMw$ [5] https://urldefense.com/v3/__https://edition.cnn.com/travel/article/portugal-food/index.html__;!!IBzWLUs!DwzSdBgWyL3DakNQC6nj4Sr6ErwVwyxpG9WQD-3ZGA9xWd_Ah5ITPYvlLBlQBmOiLNfPUoeD-zU1iw$ [6] https://urldefense.com/v3/__http://arcatools.org/assets/lince.html*fulllince__;Iw!!IBzWLUs!DwzSdBgWyL3DakNQC6nj4Sr6ErwVwyxpG9WQD-3ZGA9xWd_Ah5ITPYvlLBlQBmOiLNfPUof5js1O2A$ From cmezzina at gmail.com Sat Dec 4 05:46:38 2021 From: cmezzina at gmail.com (Claudio Mezzina) Date: Sat, 4 Dec 2021 11:46:38 +0100 Subject: [TYPES/announce] RC2022 call for papers Message-ID: 14th Conference on Reversible Computation (RC 2022) https://urldefense.com/v3/__https://reversible-computation-2022.github.io/__;!!IBzWLUs!Av1pAE__QGG3DHR9ZjQUqkdBXBhQlrCzxwA7fpwbtlP40HemH4Nfmh-ypQZUSeKne5y2mdMSEkUqTA$ July 5th-6th, 2022, Urbino, Italy Abstract Submission: Mon, February 7th, 2022 Submission Deadline: Mon, February 21st, 2022 ======================================================================= Reversible computation has a growing number of promising application areas such as low power design, coding/decoding, debugging, testing and verification, database recovery, discrete event simulation, reversible algorithms, reversible specification formalisms, reversible programming languages, process algebras, and the modeling of biochemical systems. Furthermore, reversible logic provides a basis for quantum computation with its applications, for example, in cryptography and in the development of highly efficient algorithms. First reversible circuits and quantum circuits have been implemented and are seen as promising alternatives to conventional CMOS technology. The conference will bring together researchers from computer science, mathematics, and physics to discuss new developments and directions for future research in Reversible Computation. This includes applications of reversibility in quantum computation. Research papers, tutorials, tool demonstrations, and work-in-progress reports are within the scope of the conference. Invited talks by leading international experts will complete the program. Contributions on all areas of Reversible Computation are welcome, including---but not limited to---the following topics: * Applications * Architectures * Algorithms * Bidirectional transformations * Circuit Design * Debugging * Fault Tolerance and Error Correction * Hardware * Information Theory * Physical Realizations * Programming Languages * Quantum Computation * Software * Synthesis * Theoretical Results * Testing * Verification ===== Important Dates ===== - Abstract Submission: Mon, February 7th, 2022 - Submission Deadline: Mon, February 21st, 2022 - Notification to Authors: Mon, April 4th, 2022 - Final Version: Mon, April 25th, 2022 - Conference: Tue-Wed, July 5th-6th, 2022 ===== Invited speakers ===== TBA ===== Paper submission ===== Interested researchers are invited to submit - full research papers (16 pages maximum), - tutorials (16 pages maximum), as well as - work-in-progress or tool demonstration papers (6 pages maximum) in Springer LNCS format. Additional material intended for reviewers but not for publication in the final version---for example, details of proofs---may be placed in a clearly marked appendix that is not included in the page limit. Reviewers are at liberty to ignore appendices and papers must be understandable without them. Contributions must be written in English and report on original, unpublished work, not submitted for publication elsewhere. Submissions not adhering to the specified constraints may be rejected without review. Each paper will undergo a peer review of at least 3 anonymous reviewers. All accepted papers will be included in the conference proceedings. Papers can be submitted electronically in PDF via the RC 2022 interface of the EasyChair system: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=rc2022__;!!IBzWLUs!Av1pAE__QGG3DHR9ZjQUqkdBXBhQlrCzxwA7fpwbtlP40HemH4Nfmh-ypQZUSeKne5y2mdOkXexQGg$ SPECIAL ISSUE Selected papers will be invited to a special issue on the Journal of Logical and Algebraic Methods in Programming ===== Organizers ===== * Program co-chairs Claudio Antares Mezzina University of Urbino, Italy Krzysztof Podlaski University of ??d?, Poland ===== Program Committee ===== Cl?ment Aubert (Augusta University, US) Kamila Barylska (Nicolaus Copernicus University, Poland) Robert Gl?ck (University of Copenhagen, Denmark) Ivan Lanese (University of Bologna/INRIA, Italy) Hernan Melgratti (ICC - Universidad de Buenos Aires / Conicet, Argentina) Keisuke Nakano (Tohoku University, Japan) Alexandru Paler (Aalto University, Finland) Iain Phillips (Imperial College, UK) G. Michele Pinna (University of Cagliari, Italy) Neil (Julien) Ross (Dalhousie University, Canada) Bruno Schmitt (EPFL, Switzerland) Harun Siljak (Trinity College Dublin, Ireland) Yasuhiro Takahashi (NTT Communication Science Laboratories, Japan) Irek Ulidowski (University of Leicester, UK) Beno?t Valiron (LRI - CentraleSupelec, Univ. Paris Saclay) Robert Wille (Johannes Kepler University Linz, Austria) Shigeru Yamashita (Ritsumeikan University, Japan) Shoji Yuen (Nagoya University, Japan) -------------- next part -------------- An HTML attachment was scrubbed... URL: From marta.kwiatkowska at cs.ox.ac.uk Sat Dec 4 06:10:01 2021 From: marta.kwiatkowska at cs.ox.ac.uk (Marta Kwiatkowska) Date: Sat, 4 Dec 2021 11:10:01 +0000 Subject: [TYPES/announce] Junior Research Fellowship in Engineering Science or Computer Science at Trinity College Oxford In-Reply-To: <48e3e554-c655-5acd-2a9e-0ad399a59126@cs.ox.ac.uk> References: <48e3e554-c655-5acd-2a9e-0ad399a59126@cs.ox.ac.uk> Message-ID: <1c7e3dcd-afb0-a6fd-a8a6-b793131c204b@cs.ox.ac.uk> *Junior Research Fellowship in Engineering Science or Computer Science* Starting salary: *?34,304 p.a.* (point 30 on the HE single pay spine), rising to points 31 and 32 in years 2 and 3 of the appointment. Applications are invited for a stipendiary Junior Research Fellowship (JRF) in Engineering Science or Computer Science, tenable for a fixed term of three years from the 1st October 2022. The objectives of the College in making this appointment are to support outstanding early career academics in their first independent work, to develop and strengthen the research environment of the College, and to contribute to the goal of maintaining the University of Oxford as a leading centre for research. The Fellowship is open to researchers who: * have recently been awarded a doctorate or who are very close to submission of their doctoral thesis. Applicants awarded a PhD following viva voce examination held prior to 1st October 2020 will not be considered unless there are specific extenuating circumstances, such as an interruption to their academic career due to parental leave or sickness. * have not held a comparable career development appointment at Oxford or another university. A comparable appointment is deemed to be a salaried, research-only appointment for the purposes of self-directed research. Applications should be sent by email to the Academic Administrator (academic.administrator at trinity.ox.ac.uk) by 12 noon (UK time) on *28th January 2022*. Further particulars, selection criteria, and information on how to apply for this post can be found here: https://urldefense.com/v3/__https://www.trinity.ox.ac.uk/sites/default/files/inline-files/Junior*20Research*20Fellowship*20in*20Engineering*20Science*20or*20Computer*20Science*202022*20further*20particulars_1.pdf__;JSUlJSUlJSUlJSU!!IBzWLUs!Gom4XKIoaSmtdVIqZd4PhPMkLu77OT1R1wKkiI77oH_HgAxwb1vuUoHNfrIJ1f_lrSSF_yb6cOJgMw$ Trinity College is committed to Equal Opportunities and welcomes applications from all sections of the community.? We therefore ask that all applicants return the Equal Opportunities form as part of the selection process. -- Professor Marta Kwiatkowska FRS Associate Head of MPLS Division Fellow of Trinity College Department of Computer Science University of Oxford Wolfson Building, Parks Road Oxford, OX1 3QD Tel: +44 (0)1865 283509 Email:Marta.Kwiatkowska at cs.ox.ac.uk URL:https://urldefense.com/v3/__http://www.cs.ox.ac.uk/people/marta.kwiatkowska/__;!!IBzWLUs!Gom4XKIoaSmtdVIqZd4PhPMkLu77OT1R1wKkiI77oH_HgAxwb1vuUoHNfrIJ1f_lrSSF_ya1J1gQtw$ PA and Project Officer: Anita Hancox Email:anita.hancox at cs.ox.ac.uk, Tel: +44 (0)1865 610754 -------------- next part -------------- An HTML attachment was scrubbed... URL: From dbz5017 at psu.edu Mon Dec 6 09:29:10 2021 From: dbz5017 at psu.edu (Zhang, Danfeng) Date: Mon, 6 Dec 2021 14:29:10 +0000 Subject: [TYPES/announce] PLAS 2021 Call for Participation Message-ID: <3FA7CB2F-69F3-4791-A5F5-4F4036D67674@psu.edu> -------------------------------------------------------------------------- PLAS 2021 Call for Participation 16th Workshop on Programming Languages and Analysis for Security (PLAS 2021) https://urldefense.com/v3/__https://plas21.software.imdea.org__;!!IBzWLUs!DK8DxvATiCrRjxULjlERrojG7_XqR7FG-BPuceL6YKPYBvOmlJjb3pj79cLBzoJhn3zjXBdCH_EGCQ$ Virtual Event December 7, 2021 -------------------------------------------------------------------------- PLAS 2021 will be held online on December 7. Participation will be free without any preregistration. PLAS provides a forum for exploring and evaluating the use of programming language and program analysis techniques for promoting security in the complete range of software systems, from compilers to machine-learned models and smart contracts. The workshop encourages proposals of new, speculative ideas, evaluations of new or known techniques in practical settings, and discussions of emerging threats and problems. We also host position papers that are radical, forward-looking, and lead to lively and insightful discussions influential to the future research at the intersection of programming languages and security. The program of PLAS 2021 will include the following talks: (Invited Talk) Deian Stefan - Look Ma no Hands, or How to Make Software Sandboxing Practical Xaver Fabian, Koby Wu Chan, Marco Patrignani - Short paper: Formal verification of Spectres combination Farzaneh Derakhshan, Stephanie Balzer, Limin Jia - Short Paper: Noninterference For Session-Typed Processes Aslan Askarov - Short paper: are fine-grained and coarse-grained dynamic information flow control always equally expressive? McKenna McCall, Abhishek Bichhawat, Limin Jia - Short Paper: Compositional Information Flow Monitoring for Reactive Programs Priyanka Mondal, Maximilian Algehed, Owen Arden - Applying consensus and replication securely with FLAQR Angel Luis Scull Pupo, Jens Nicolay, Elisa Gonzalez Boix - Short paper: A Datalog-based security monitoring language Please find more information at https://urldefense.com/v3/__https://plas21.software.imdea.org__;!!IBzWLUs!DK8DxvATiCrRjxULjlERrojG7_XqR7FG-BPuceL6YKPYBvOmlJjb3pj79cLBzoJhn3zjXBdCH_EGCQ$ . The links for attending the workshop: ZOOM: https://urldefense.com/v3/__https://psu.zoom.us/j/92497369062?pwd=M2FKSlBTOEY2Rnc4ajFOdndNZ21sUT09__;!!IBzWLUs!DK8DxvATiCrRjxULjlERrojG7_XqR7FG-BPuceL6YKPYBvOmlJjb3pj79cLBzoJhn3zjXBdL_Hc70w$ Slack: https://urldefense.com/v3/__https://join.slack.com/t/plas2021/shared_invite/zt-zrd5b5tf-NqoK*t6vf*sGWQVBiX4Siw__;fn4!!IBzWLUs!DK8DxvATiCrRjxULjlERrojG7_XqR7FG-BPuceL6YKPYBvOmlJjb3pj79cLBzoJhn3zjXBfSW57-Wg$ -------------------------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From amoeller at cs.au.dk Tue Dec 7 02:13:01 2021 From: amoeller at cs.au.dk (=?iso-8859-1?Q?Anders_M=F8ller?=) Date: Tue, 7 Dec 2021 07:13:01 +0000 Subject: [TYPES/announce] Assistant/associate professor positions at Aarhus University, Denmark Message-ID: The Department of Computer Science at Aarhus University (https://urldefense.com/v3/__http://cs.au.dk/__;!!IBzWLUs!DCJgH6RvJ7hq63xF6QbvLEKQGb4qmgx1ZByqz0iXjv77McSm_acibSBWQbsPVB1IvYBrLAZxWTJ7og$ ) is looking for excellent and visionary tenure track Assistant Professors or Associate Professors to push the frontiers of Computer Science research. Aarhus University - an international top-100 University - has made an ambitious strategic investment in a recruitment plan to radically expand the Department of Computer Science. Applicants within all areas of computer science are welcome, including Programming Languages, Software Engineering, Logic and Semantics. The application deadline is January 11th 2022. Additional details and instructions on how to apply are found at https://urldefense.com/v3/__https://www.au.dk/om/stillinger/job/aarhus-university-is-hiring-assistant-and-associate-professors-to-contribute-to-the-future-of-the-department-of-computer-science-1__;!!IBzWLUs!DCJgH6RvJ7hq63xF6QbvLEKQGb4qmgx1ZByqz0iXjv77McSm_acibSBWQbsPVB1IvYBrLAbX6Sjseg$ From tolmach at pdx.edu Tue Dec 7 20:39:51 2021 From: tolmach at pdx.edu (Andrew Tolmach) Date: Tue, 7 Dec 2021 17:39:51 -0800 Subject: [TYPES/announce] Faculty positions at Portland State University Message-ID: <9F7695B1-D86B-4203-9AB9-C3B686CC0652@pdx.edu> Candidates in the areas of programming languages or formal methods are enthusiastically encouraged to apply for the following positions: POSITION ANNOUNCEMENT Assistant Professor of Computer Science Portland State University The Department of Computer Science at Portland State University invites applications for four tenure-track Assistant Professor positions. In addition to several other fields, we are particularly interested in candidates with backgrounds in programming languages and/or formal methods. The expected start date is September 2022, but earlier or later dates can be negotiated. Review of applications has begun and will continue until the positions are filled. For more details, please visit https://urldefense.com/v3/__https://www.pdx.edu/computer-science/open-faculty-positions__;!!IBzWLUs!GOiMHTSd22Xc3fJqxg9TqHnnZCKqpzhLDVgs4d71XVbwNiFeknap_WRT91mfnFciRMq1NDESRutbxA$ . From Luigia.Petre at abo.fi Wed Dec 8 03:39:35 2021 From: Luigia.Petre at abo.fi (Luigia Petre) Date: Wed, 8 Dec 2021 08:39:35 +0000 Subject: [TYPES/announce] Teaching tutorial this Friday Dec 10, at 9 am CET: Software Verification with Whiley, David Pearce In-Reply-To: References: Message-ID: Dear all, In the FME Teaching Committee series of tutorials, we continue on Friday, December 3rd, with Assoc. Prof. David Pearce, who will present his experiences of teaching software verification with Whiley. Please note the special time (9am CET) - David lives in New Zealand and is 12h ahead of CET, so for him the talk is at 9 pm. Here is the info in our webpages: https://urldefense.com/v3/__https://fme-teaching.github.io/2021/08/24/tutorial-series-of-the-fme-teaching-committee/__;!!IBzWLUs!FAdtrRwUsWPFlMluFB_woOYw0-ZSiN-FKhvkIZcKtovLib-bhM0A03rxmD5OFUU2WME53Ray-0HnbQ$ And here is the zoom link: https://urldefense.com/v3/__https://aboakademi.zoom.us/j/64254430116__;!!IBzWLUs!FAdtrRwUsWPFlMluFB_woOYw0-ZSiN-FKhvkIZcKtovLib-bhM0A03rxmD5OFUU2WME53RbwnFJgWA$ Everyone welcome! Kind regards, Luigia Petre (on behalf of the FME Teaching Committee) -------------- next part -------------- An HTML attachment was scrubbed... URL: From icfp.publicity at googlemail.com Wed Dec 8 15:01:38 2021 From: icfp.publicity at googlemail.com (Ilya Sergey) Date: Thu, 09 Dec 2021 04:01:38 +0800 Subject: [TYPES/announce] Call for Workshop Proposals: ICFP 2022 Message-ID: <61b10f229e395_15adc3fdd9842ffd05867f@ilya-work-macbook.mail> CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS ICFP 2022 27th ACM SIGPLAN International Conference on Functional Programming September 11 - 16, 2022 Ljubljana, Slovenia https://urldefense.com/v3/__https://icfp22.sigplan.org/__;!!IBzWLUs!GXvmHB8zn_c38SroNRTtWD_4wnd_tupEbyso8hRyJETdW-gKXa3ghHzTquyiMhnrd1VXfsBoUwSbPw$ The 27th ACM SIGPLAN International Conference on Functional Programming will be held in Ljubljana, Slovenia on September 11 - 16, 2022, with the option of virtual participation. ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. Proposals are invited for workshops (and other co-located events, such as symposiums) to be affiliated with ICFP 2022 and sponsored by SIGPLAN. These events should be less formal and more focused than ICFP itself, include sessions that enable interaction among the attendees, and foster the exchange of new ideas. The preference is for one-day events, but other schedules can also be considered. The workshops are scheduled to occur on September 11th (the day before ICFP) and September 15-16th (the two days after ICFP). ---------------------------------------------------------------------- Submission details Deadline for submission: December 24, 2021 Notification of acceptance: January 10, 2022 Prospective organizers of workshops or other co-located events are invited to submit a completed workshop proposal form in plain text format to the ICFP 2022 workshop co-chairs (Arthur Azevedo de Amorim and Zoe Paraskevopoulou) via email to icfp-workshops-2022 at googlegroups.com by December 24, 2021. (For proposals of co-located events other than workshops, please fill in the workshop proposal form and just leave blank any sections that do not apply.) Please note that this is a firm deadline. Organizers will be notified if their event proposal is accepted by January 10, 2022, and if successful, depending on the event, they will be asked to produce a final report after the event has taken place that is suitable for publication in SIGPLAN Notices. The proposal form is available at: https://urldefense.com/v3/__http://www.icfpconference.org/icfp2022-files/icfp22-workshops-form.txt__;!!IBzWLUs!GXvmHB8zn_c38SroNRTtWD_4wnd_tupEbyso8hRyJETdW-gKXa3ghHzTquyiMhnrd1VXfsDzl_Jsyw$ Further information about SIGPLAN sponsorship is available at: https://urldefense.com/v3/__http://www.sigplan.org/Resources/Proposals/Sponsored/__;!!IBzWLUs!GXvmHB8zn_c38SroNRTtWD_4wnd_tupEbyso8hRyJETdW-gKXa3ghHzTquyiMhnrd1VXfsCz172bYA$ ---------------------------------------------------------------------- Selection committee The proposals will be evaluated by a committee comprising the following members of the ICFP 2022 organizing committee, together with the members of the SIGPLAN executive committee. Workshop Co-Chair: Arthur Azevedo de Amorim (Boston University) Workshop Co-Chair: Zoe Paraskevopoulou (Northeastern University) General Chair: Andrej Bauer (University of Ljubljana) Program Chair: Zena Ariola (University of Oregon) ---------------------------------------------------------------------- Further information Any queries should be addressed to the workshop co-chairs (Arthur Azevedo de Amorim and Zoe Paraskevopoulou), via email to icfp-workshops-2022 at googlegroups.com. From wjb at williamjbowman.com Wed Dec 8 18:44:15 2021 From: wjb at williamjbowman.com (William J. Bowman (PLDI'22 Publicity Chair)) Date: Wed, 8 Dec 2021 15:44:15 -0800 Subject: [TYPES/announce] PLDI 2022 Call for (Self-) Nomiation to Artifact Evaluation Committee Message-ID: Please distribute widely: We are looking for motivated students and researchers to be members of the PLDI 2022 Artifact Evaluation Committee (AEC). This year, we are accepting (self-)nominations for the AEC. The artifact evaluation process aims to promote, share and catalog the research artifacts of papers accepted to the PLDI research track. The self-nomination form is available at: https://urldefense.com/v3/__https://forms.gle/UbLPDdFE4WCohQr28__;!!IBzWLUs!DKuTtzFFuGA6JwNaNkLUhaDP3eA9HBINL55kLzlED4XRkpgmdAyQICeCwfvBOA05D7R5xObJlz6S4w$ You can also nominate other people (e.g., students, colleagues) at: https://urldefense.com/v3/__https://forms.gle/nDtW7wtpkGvU8MQBA__;!!IBzWLUs!DKuTtzFFuGA6JwNaNkLUhaDP3eA9HBINL55kLzlED4XRkpgmdAyQICeCwfvBOA05D7R5xOYsoBPd9A$ The instructions for committee members are available here: https://urldefense.com/v3/__https://pldi22.sigplan.org/track/pldi-2022-PLDI-Research-Artifacts*Info-for-Reviewers__;Iw!!IBzWLUs!DKuTtzFFuGA6JwNaNkLUhaDP3eA9HBINL55kLzlED4XRkpgmdAyQICeCwfvBOA05D7R5xOZDdAT58Q$ As a committee member, your primary responsibilities would be to review the artifacts submitted corresponding to the already accepted papers in the main research track. In particular, you may have to run the associated tool, check whether the results in the main paper can be reproduced, and inspect the data. PLDI will use a three-phase artifact evaluation review process. We expect the bulk of the review work to take place between March 8 and March 25. Each artifact will take about 8h to review, and reviewers will be assigned 3 to 4 reviews. Come join us in improving the quality of research in our field! AEC Chairs: - Xinyu Wang, IMDEA Software Institute (Spain) - Niki Vazou, University of Michigan (U.S.) From Coen.De.Roover at vub.be Thu Dec 9 07:13:08 2021 From: Coen.De.Roover at vub.be (Coen DE ROOVER) Date: Thu, 9 Dec 2021 12:13:08 +0000 Subject: [TYPES/announce] Call for ECOOP 2022 Workshop Proposals Message-ID: <6E24C22D-1DD3-4AE5-A61D-A4FF5B03EE29@vub.be> The 2022 edition of the ECOOP conference (https://urldefense.com/v3/__https://2022.ecoop.org__;!!IBzWLUs!GMvNf8BQ0LV2AFGrBjIGyDKRJw1cjkEzwqOpU1iDS0yJWR82g-49TlE4gs-g7_ssDAThVecTL0Ce-A$ ), taking place from June 6th till June 10th 2022 in Berlin, intends to host a diverse offering of workshops bringing together academics, industrial researchers, and practitioners to exchange new ideas, problems, and experiences. Its workshop chairs are reviewing submitted workshop proposals on a rolling basis until **January 15th**. Submission link: https://urldefense.com/v3/__https://forms.gle/VeT2CkcVPv6LhM5E8__;!!IBzWLUs!GMvNf8BQ0LV2AFGrBjIGyDKRJw1cjkEzwqOpU1iDS0yJWR82g-49TlE4gs-g7_ssDAThVeflxcI__A$ We hope that ECOOP and its co-located workshops will form the ideal occasion to meet each other in person again. Topics for workshops may include, but are not limited to, the theory, design, implementation, optimization, testing, and analysis of programs and programming languages. In particular, while the OO in ECOOP has traditionally stood for ?object-oriented?, these days the scope of ECOOP is much broader and encompasses the Programming Languages field as a whole. To submit a proposal for an ECOOP workshop, please complete the online application form linked to below. After submitting, you will receive an automated email confirmation of your submission and, within four weeks, a formal response notifying you if the workshop has been accepted for ECOOP. Proposals will be reviewed on a rolling basis until January 15th, 2022. Submission link: https://urldefense.com/v3/__https://forms.gle/VeT2CkcVPv6LhM5E8__;!!IBzWLUs!GMvNf8BQ0LV2AFGrBjIGyDKRJw1cjkEzwqOpU1iDS0yJWR82g-49TlE4gs-g7_ssDAThVeflxcI__A$ Each workshop must conform to the following schedule constraints: (1) The workshop?s website must be live within two weeks of notification of the workshop?s acceptance and include relevant information about any call for papers. (2) Final notification dates for paper acceptance to workshops must be at least 3 days before the early registration period ends. For more information, see https://urldefense.com/v3/__https://2022.ecoop.org/track/ecoop-2022-workshops__;!!IBzWLUs!GMvNf8BQ0LV2AFGrBjIGyDKRJw1cjkEzwqOpU1iDS0yJWR82g-49TlE4gs-g7_ssDAThVecQaZ3_bw$ Please contact the workshop co-chairs, Coen De Roover (https://urldefense.com/v3/__http://soft.vub.ac.be/*cderoove/__;fg!!IBzWLUs!GMvNf8BQ0LV2AFGrBjIGyDKRJw1cjkEzwqOpU1iDS0yJWR82g-49TlE4gs-g7_ssDAThVefXEwFoIw$ ) and Guido Salvaneschi (https://urldefense.com/v3/__https://programming-group.com/members/salvaneschi__;!!IBzWLUs!GMvNf8BQ0LV2AFGrBjIGyDKRJw1cjkEzwqOpU1iDS0yJWR82g-49TlE4gs-g7_ssDAThVecmiT_FvA$ ), in case you have any questions. From stevez at seas.upenn.edu Thu Dec 9 08:35:19 2021 From: stevez at seas.upenn.edu (Steve Zdancewic) Date: Thu, 9 Dec 2021 08:35:19 -0500 Subject: [TYPES/announce] Certified Programs and Proofs (CPP) 2022: Call for Participation Message-ID: <1264de38-faed-2eff-df99-ae9a40fb4614@seas.upenn.edu> * *** Call for Participation *** *** Certified Programs and Proofs (CPP 2022) *** ?- Early registration deadline: 3 January 2022 ?- Getting a visa: https://urldefense.com/v3/__https://popl22.sigplan.org/attending/visa-information__;!!IBzWLUs!D0XGUKCX04CswEGpccoiwb65G4jkdtejdhdkeb_SGfdyytHMzu7jsr1Jze8yR31FNcL2UdRkcEPNjw$ ?- Registration: https://urldefense.com/v3/__https://popl22.sigplan.org/attending/registration__;!!IBzWLUs!D0XGUKCX04CswEGpccoiwb65G4jkdtejdhdkeb_SGfdyytHMzu7jsr1Jze8yR31FNcL2UdRgGTvNEQ$ ?- Further reduced student participation fee: see below ?- Accommodation: https://urldefense.com/v3/__https://popl22.sigplan.org/venue/POPL-2022-venue__;!!IBzWLUs!D0XGUKCX04CswEGpccoiwb65G4jkdtejdhdkeb_SGfdyytHMzu7jsr1Jze8yR31FNcL2UdSLS20qzQ$ 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 2022 (https://urldefense.com/v3/__https://popl22.sigplan.org/home/CPP-2022__;!!IBzWLUs!D0XGUKCX04CswEGpccoiwb65G4jkdtejdhdkeb_SGfdyytHMzu7jsr1Jze8yR31FNcL2UdTCMueCXw$ ) will be held on 17-18 January 2022 and will be co-located with POPL 2022. CPP 2022 is sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG, and supported by a diverse set of industrial sponsors. Similarly to other events collocated with POPL 2022, CPP will take place as an in-person event at the Westin Philadelphia (99 South 17th Street at Liberty Place, 19103 Philadelphia), and will require attendees to provide proof of vaccination (details will be available soon). Authors who are unable to attend CPP in person will be able to present remotely. All talks will be recorded, and all recordings will be available either as a livestream or soon afterwards. For more information about this edition and the CPP series, please visit https://urldefense.com/v3/__https://popl22.sigplan.org/home/CPP-2022__;!!IBzWLUs!D0XGUKCX04CswEGpccoiwb65G4jkdtejdhdkeb_SGfdyytHMzu7jsr1Jze8yR31FNcL2UdTCMueCXw$ ### Invited talks * June Andronick (UNSW Sydney). The seL4 verification: the art and craft of proof and the reality of commercial support * Andrew W. Appel (Princeton). Coq?s vibrant ecosystem for verification engineering * Cesar Munoz (Currently at AWS, Formerly at NASA, USA). Structural Embeddings Revisited ### Accepted papers The list of accepted papers is available at https://urldefense.com/v3/__https://popl22.sigplan.org/home/CPP-2022*event-overview__;Iw!!IBzWLUs!D0XGUKCX04CswEGpccoiwb65G4jkdtejdhdkeb_SGfdyytHMzu7jsr1Jze8yR31FNcL2UdTXsE14vQ$ ### Subsidized student registration To facilitate in-person participation of undergraduate and graduate students who require financial assistance, CPP 2022 offers the opportunity to register at a special reduced rate, determined on a case-by-case basis, and implemented using a special-purpose registration code on POPL's registration website. Students wishing to apply for such support may do so by sending mail to the CPP conference co-chairs (Beringer and Krebbers, see below for their email) preferably by December 24, 2021, with a brief description of their situation. Notifications will be sent out at most one week later; hence, students who cannot be supported will still have the opportunity to register at the publicly available reduced rate, which is available until January 3rd. Applications arriving after December 24th will be considered only in exceptional cases. Students who already receive registration support for PLMW or are supported by SIGPLAN PAC are not eligible. CPP's student support is made possible by to our generous industrial supporters: https://urldefense.com/v3/__https://popl22.sigplan.org/home/CPP-2022__;!!IBzWLUs!D0XGUKCX04CswEGpccoiwb65G4jkdtejdhdkeb_SGfdyytHMzu7jsr1Jze8yR31FNcL2UdTCMueCXw$ ### Contact For any questions please contact the chairs: Andrei Popescu (PC co-chair) Steve Zdancewic (PC co-chair) Lennart Beringer (conference co-chair) Robbert Krebbers (conference co-chair) * -------------- next part -------------- An HTML attachment was scrubbed... URL: From goubault at lix.polytechnique.fr Fri Dec 10 08:10:29 2021 From: goubault at lix.polytechnique.fr (Eric Goubault) Date: Fri, 10 Dec 2021 14:10:29 +0100 Subject: [TYPES/announce] Call for contributions - 11th Conference on Geometric and Topological Methods in Computer Science Message-ID: <73B06452-2ECD-4D97-A1FC-43A19CF43E99@lix.polytechnique.fr> CALL FOR CONTRIBUTIONS 11th International Conference on Geometric and Topological Methods in Computer Science GETCO 2022 30 May to 3 June 2022, Paris, France https://urldefense.com/v3/__http://www.lix.polytechnique.fr/*smimram/getco22/__;fg!!IBzWLUs!ApY3m9z9ZqHAHcljQgYQR_B2MaXQPa5f70flIopfHbBFteBHYQev91S4W2Y5cufDSKdUZU1BL1Ecng$ The Geometric and Topological Methods in Computer Science (GETCO) conference series focus on applications of algebraic topology in computer science with special emphasis in concurrency, distributed computing, networking and other situations related to systems of sequential computers that communicate with each other. It is aimed at mathematicians and computer scientists working in or interested in these subjects, including researchers and graduate students. The aim of the conference is to exchange ideas and to initiate or expand research collaborations. Special emphasis will be on - directed topology, concurrency and distributed computing - geometric aspects of logics, higher categories and rewriting - dynamical/hybrid/control systems and robotics - topological persistence theory We are calling for presentations of original, unfinished, already published, or otherwise interesting work within the topics of the GETCO conferences. The submission can be in the form of a poster, an abstract, a paper submitted to or published at another conference, etc. GETCO will have no formal proceedings, but should be followed by a special issue dedicated to selected papers from the conference. # IMPORTANT DATES - Submission: 15 March 2022 - Notification: 15 April 2022 # INVITED SPEAKERS TBC # HISTORY The first GETCO conference was held in Aalborg in 1999. Applications of algebraic topology in concurrency was a new subject, fostered by seminal papers such as those by Vaughn Pratt in ACM POPL 1991 and Eric Goubault at CONCUR 1992 and CONCUR 1993, on the formal methods side, and the ACM STOC 1993 papers by Herlihy-Shavit and Saks-Zaharoglou, on the distributed computing side; brought to attention in the Workshop on New Connections between Mathematics and Computer Science, organized by Jeremy Gunawardena in Cambridge in 1995. The following seven GETCO workshops were held as satellites to CONCUR or DISC, the main conferences on concurrency and distributed computing. The 2nd was held at Penn State University, in 2000, then in Aalborg in 2001, Toulouse 2002, Marseille 2003, Amsterdam 2004, San Francisco 2005, and Bonn 2006. The 2010 workshop had a broader scope and included further applications of algebraic topology including robotics and shape analysis. GETCO was back in Aalborg for its 9th edition in 2015, expanding to topics such as data analysis. By then, an ESF network ACAT, Applied and Computational Algebraic Topology, had been established, and two books had been published, Distributed Computing Through Combinatorial Topology and Directed Algebraic Topology and Concurrency; some of many indications that applications of algebraic topology to concurrent systems is now a mature subject, widespread and with impact in many fields. The 10th edition, which took place in Oaxaca, Mexico in 2018, expanded further to neuroscience and learning applications. The 11th edition was originally planned in 2020 in Palaiseau, but had to be delayed due to the pandemia. # SUBMISSION INSTRUCTIONS Please submit your contribution at https://urldefense.com/v3/__https://easychair.org/conferences/?conf=getco2022__;!!IBzWLUs!ApY3m9z9ZqHAHcljQgYQR_B2MaXQPa5f70flIopfHbBFteBHYQev91S4W2Y5cufDSKdUZU0hILdgSg$ by 15 March 2022. There is no imposed format for the submissions. ## SCIENTIFIC COMMITTEE - Ulrich Fahrenberg, EPITA, France - Lisbeth Fajstrup, Aalborg University, Denmark - Eric Goubault, ?cole polytechnique, France - Samuel Mimram, ?cole polytechnique, France - Marian Mrozek, Jagiellonian University, Poland - Steve Oudot, ?cole polytechnique, France - Sergio Rajsbaum, Universidad Nacional Autonoma de Mexico - Martin Raussen, Aalborg University, Denmark ## ORGANIZING COMMITTEE - Cameron Calk - Eric Goubault - Roman Kniazev - Samuel Mimram -------------- next part -------------- An HTML attachment was scrubbed... URL: From wies at cs.nyu.edu Fri Dec 10 10:50:28 2021 From: wies at cs.nyu.edu (Thomas Wies) Date: Fri, 10 Dec 2021 10:50:28 -0500 Subject: [TYPES/announce] VMCAI 2022 Student Fellowships Message-ID: ----------------------------------- Call for Applications VMCAI 2022 Student Fellowships ----------------------------------- Important Dates --------------- Application deadline: December 24, 2021 Notification: December 27, 2021 Conference: January 16-18, 2022 Application Form ---------------- Objectives ---------- VMCAI provides a forum for researchers from the communities of Verification, Model Checking, and Abstract Interpretation, facilitating interaction, cross-fertilization, and advancement of hybrid methods that combine these and related areas. VMCAI 2022 will be the 23rd edition in the series. The conference will be co-located with POPL 2022 in Philadelphia, PA and take place January 16-18, 2022. For more information about the conference, please visit: https://urldefense.com/v3/__https://popl22.sigplan.org/home/VMCAI-2022__;!!IBzWLUs!EbhU3rpQrSkDrzM-lrEBFMt8u4Ql7E6_yBazkQp4wonFG9MyceLdAuT32xFZdLagwiwqCVGoU9lj1Q$ We have some funds from the National Science Foundation to provide travel grants of up to $1,000 (USD) for student attendees of VMCAI 2022 that are studying at a US university. Funds can be requested to cover transportation, lodging, and registration fees (meals will not be funded). The application deadline is December 24, 2021, and recipients will be notified by December 27. Funds will be provided after the conference, upon submission of receipts and a short report detailing the student's experience at and benefit from VMCAI 2022 (these reports will be used to compile a final report to our sponsors). Applications must be received by the deadline via the following web form: https://urldefense.com/v3/__https://forms.gle/wCViJGtVJJKkJKPX8__;!!IBzWLUs!EbhU3rpQrSkDrzM-lrEBFMt8u4Ql7E6_yBazkQp4wonFG9MyceLdAuT32xFZdLagwiwqCVGGN5OWjw$ Thomas Wies (VMCAI 2022 Program Co-Chair) From Simon.Gay at glasgow.ac.uk Mon Dec 13 04:12:27 2021 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Mon, 13 Dec 2021 09:12:27 +0000 Subject: [TYPES/announce] Post-doc position in PL at University of Glasgow, Scotland Message-ID: University of Glasgow College of Science and Engineering School of Computing Science Research Assistant / Associate Ref: 074049 Grade 6/7: ?29,614 - ?33,309 / ?36,382 - ?40,927 per annum We have a position for a research assistant / associate in the theory, design and implementation of programming languages. This position is associated with the EPSRC-funded project "STARDUST: Session Types for Reliable Distributed Systems". The project is funded until 30th September 2024 and the position is available from 1st May 2022. *Project Description* Distributed software systems are an essential part of the infrastructure of modern society. Such systems typically comprise diverse software components deployed across networks of hosts. Ensuring their reliability is challenging, as software components must correctly communicate and synchronise with each other, and any of the hardware or software components may fail. Failure and service "outage" is extremely costly, with worldwide financial losses due to software failures in 2017 estimated at US$1.7tn, up from US$1.1tn in 2016. Failures can occur at all levels of the system stack: hardware, operating systems, networks, software, and users. Here we focus on using advanced programming language technologies to enable the software level to handle failures that arise from any level of the stack. Our aim is to provide software-level reliability for distributed systems by combining fault prevention with fault tolerance. The key objective is to combine the communication-structuring mechanism of session types with the scalability and fault-tolerance of actor-based software architectures. The result will be a well-founded theory of reliable actor programming, supported by a collection of libraries and tools, and validated on a range of case studies. Key aims are to deliver tools that provide lightweight support for developers ? e.g. warning of potential issues ? and to allow developers to continue to use established idioms. By doing so we aim to deliver a step change in the engineering of reliable distributed software systems. The project is a collaboration between the University of Glasgow (Professor Simon Gay and Professor Phil Trinder), Imperial College London (Professor Nobuko Yoshida) and the University of Kent (Professor Simon Thompson and Dr Laura Bocchi). The industrial partners are Actyx AG, Erlang Solutions Ltd, Quviq AB and Tata Consultancy Services. *Principal Duties* The successful candidates will be responsible for conducting research into the theory and practice of session types for actor languages, and for evaluating programming language designs and implementations in relation to realistic case studies provided by the industrial collaborators. You should have, or be close to completion of, a PhD in a relevant area, or have comparable experience; an awarded PhD or equivalent experience is necessary for appointment at Grade 7. You should have a track record of publication and communication of research results, strong programming and software engineering skills, and a strong background in programming languages, including type systems and implementation. It is desirable also to have one or more of the following: a combination of theoretical and practical skills; knowledge of the theory or practice of concurrent and distributed systems; knowledge of the theory or practice of actor-based languages; knowledge of the theory of session types. We seek applicants at an international level of excellence. The School of Computing Science at the University of Glasgow has an international research reputation, and Glasgow, Scotland's largest city, offers an outstanding range of cultural resources and a high quality of life. It is the University of Glasgow?s mission to foster an inclusive climate, which ensures equality in our working, learning, research and teaching environment. We strongly endorse the principles of Athena SWAN, including a supportive and flexible working environment, with commitment from all levels of the organisation in promoting gender equity. Information about the Programming Language research theme at the University of Glasgow: https://urldefense.com/v3/__https://www.gla.ac.uk/schools/computing/research/researchthemes/pl-theme/__;!!IBzWLUs!B-BdiIRqF-DoPBSKQ-jjcD3RGvFSx63pifNxg5ezRtTWMBfbTvG62N52OFbkZfTrznKNKP8E5IYvJw$ *Coronavirus / COVID-19* Considering the current travel restrictions, interviews will be held remotely if necessary. We will also be flexible about the starting date and working practices. *Further information* For informal enquiries or further information about the project, please contact Professor Simon Gay or Professor Phil Trinder . *Application details* Glasgow University online application system: https://urldefense.com/v3/__https://my.corehr.com/pls/uogrecruit/erq_search_version_4.search_form__;!!IBzWLUs!B-BdiIRqF-DoPBSKQ-jjcD3RGvFSx63pifNxg5ezRtTWMBfbTvG62N52OFbkZfTrznKNKP_y0UDFxg$ (enter reference 074049) Closing date: 14th January 2022 The University of Glasgow, charity number SC004401. From rl.stpuu at gmail.com Mon Dec 13 06:15:11 2021 From: rl.stpuu at gmail.com (Roussanka Loukanova) Date: Mon, 13 Dec 2021 12:15:11 +0100 Subject: [TYPES/announce] CfParticipation LACompLing2021 / Logic and Algorithms in Computational Linguistics 2021, MALIN, Montpellier Message-ID: Call for Participation Symposium Logic and Algorithms in Computational Linguistics 2021 (LACompLing2021) 15 - 17 December 2021, Online https://urldefense.com/v3/__https://staff.math.su.se/rloukanova/LACompLing2021-web/__;!!IBzWLUs!GWVnrU2571ngRJh92GvFL7DD9IsD5GtBioBxbNK8Bgp2tqR5slJqQreEyCla8fbGl2UY9qolAEWHjg$ Online streaming by CNRS, Montpellier, France https://urldefense.com/v3/__https://malin2021.sciencesconf.org__;!!IBzWLUs!GWVnrU2571ngRJh92GvFL7DD9IsD5GtBioBxbNK8Bgp2tqR5slJqQreEyCla8fbGl2UY9qot88S6Mg$ LACompLing2021 is part of the week Mathematical Linguistics (MALIN) 2021, Universit? de Montpellier, LIRMM, CNRS, Montpellier, France 13--17 December 2021, Online ==== PROGRAM WEDNESDAY DECEMBER 15 / Wed 15 Dec 09:00-9::40 Wed 15 Dec Stefan M?ller (Humboldt-Universit?t zu Berlin, Germany) The CoreGram Project: Deriving Crosslinguisitc Generalizations with HPSG Grammars of Multiple Languages (Invited Talk) 9:40-10:20 Wed 15 Dec Lars Hellan (Norwegian University of Science and Technology, Norway) A Unified Valence Resource (Invited Talk) 10:20-10:40 Break 10:40-11:00 Wed 15 Dec Luuk Suurmeijer (Heinrich Heine University D?sseldorf), Noortje Venhuizen (Saarland University) and Harm Brouwer (Saarland University, Germany) Compositionality in Distributional Formal Semantics 11:00-12:00 Wed 15 Dec Michael Moortgat (Utrecht University, Netherlands) Dependency Relations, Modalities and the Syntax-Semantics Interface (Keynote Talk) 12:00-13:30 Lunch break 13:30-14:10 Wed 15 Dec Stepan Kuznetsov (Steklov Mathematical Institute, RAS, Russia) Complexity of the Lambek Calculus and Its Extensions (Invited Talk) 14:10-14:30 Wed 15 Dec Renhao Pei (Utrecht University, Netherlands) Generating Pragmatically Appropriate Sentences from Propositional Logic: the Case of Conditional and Biconditional 14:30-15:30 Wed 15 Dec Christian Retor? (Universit? de Montpellier and LIRMM-CNRS, France) Inferentialism and Natural Language Semantics, with a Focus on Quantifiers (Keynote Talk) 15:30-15:50 Break 15:50-16:30 Wed 15 Dec Denis Bechet (LS2N - University of Nantes, France) and Annie Foret (IRISA, University of Rennes 1, France) Categorial Dependency Grammars: Analysis and Learning (Invited Talk) 16:30-17:30 Wed 15 Dec Tracy King (Adobe, United States) White Roses, Red Backgrounds: Bringing Structured Representations to Search (Keynote Talk) THURSDAY DECEMBER 16 / Thu 16 Dec 09:00-09:20 Thu 16 Dec Hitomi Yanaka (The University of Tokyo, Japan) Towards Compositional Semantics and Inference System for Telicity 09:20-09:40 Thu 16 Dec Daisuke Bekki, Ribeka Tanaka and Yuta Takahashi (Ochanomizu University, Japan) Integrating Deep Neural Network with Dependent Type Semantics 09:40-10:20 Thu 16 Dec Zhaohui Luo (Dept of Computer Science, Royal Holloway, Univ of London, United Kingdom) Universes in Type-Theoretical Semantics (Invited Talk) 10:20-10:40 Break 10:40-11:20 Thu 16 Dec Kristina Liefke (Ruhr University Bochum, Germany) Meaning-Driven Combinatorial Restrictions and 'imagine *whether' (Invited Talk) 11:20-12:00 Thu 16 Dec Alexey Stukachev (Sobolev Institute of Mathematics, Novosibirsk State University, Russia) Generalized Computability and Effective Model Theory in Mathematical Linguistics (Invited Talk) 12:00-13:30 Lunch break 13:30-14:30 Thu 16 Dec Richard Moot, (Universit? de Montpellier and LIRMM-CNRS, Montpellier, France Graph Rewriting as a Universal Proof Theory for Modern Type-Logical Grammars (Keynote Talk) 14:30-15:30 Thu 16 Dec Randy Harris (University of Waterloo, Canada) Rhetorical Figures as Algorithms (Keynote Address) FRIDAY DECEMBER 17 / Fri 17 Dec 09:00-10:00 Fri 17 Dec Aarne Ranta (University of Gothenburg, Sweden) Abstract Wikipedia and Vastly Multilingual Natural Language Generation (Keynote Talk) 10:00-10:20 Fri 17 Dec Inari Listenmaa (Singapore Management University, Singapore), Martin Strecker (Singapore Management University, Singapore) and Warrick Macmillan (University of Gothenburg, Sweden) Natural Language Generation and Processing for the Legal Domain 10:20-10:40 Break 10:40-11:20 Fri 17 Dec Bjoern Jespersen (Utrecht University, Netherlands) Impossibilities without Impossibilia (Invited Talk) 11:20-12:00 Fri 17 Dec Marie Duzi (VSB-Technical University of Ostrava, Czechia) Questions and Answers on Dynamic Activities of Agents (Invited Talk) 12:00-13:30 Lunch break 13:30-13:50 Fri 17 Dec Symon Jory Stevensguille (The Ohio State University, United States) Decomposing Events into GOLOG 13:50-15:30 Fri 17 Dec Lasha Abzianidze (Utrecht University, Netherlands) How to Train a Theorem Prover for Natural Language Inference (Invited Talk) 15:30-16:00 Break 16:00-17:00 Fri 17 Dec Larry Moss (Indiana University Mathematics Department, United States) Monotonicity in Natural Language Inference: Theory and Practice (Keynote Talk LACL / LACompLing2021) ==== -------------- next part -------------- An HTML attachment was scrubbed... URL: From Simon.Gay at glasgow.ac.uk Mon Dec 13 07:28:10 2021 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Mon, 13 Dec 2021 12:28:10 +0000 Subject: [TYPES/announce] Post-doc position in PL at University of Glasgow, Scotland In-Reply-To: References: Message-ID: I'm sorry, the link to the advert and job application system should be: https://urldefense.com/v3/__https://my.corehr.com/pls/uogrecruit/erq_jobspec_version_4.jobspec?p_id=074049__;!!IBzWLUs!EA9riUAPC26JMnMljKkcqIGGp1S_froitFvaxNRG7aGpGIllGceEQPGUnJDvmXU0xBoJLoTt31uCcw$ Simon Gay On 13/12/2021 09:12, Simon Gay wrote: > > University of Glasgow > College of Science and Engineering > School of Computing Science > > Research Assistant / Associate > Ref:???? 074049 > Grade 6/7: ?29,614 - ?33,309 / ?36,382 - ?40,927 per annum > > We have a position for a research assistant / associate in the theory, > design and implementation of programming languages. This position is > associated with the EPSRC-funded project "STARDUST: Session Types for > Reliable Distributed Systems". > > The project is funded until 30th September 2024 and the position is > available from 1st May 2022. > > > *Project Description* > > Distributed software systems are an essential part of the infrastructure > of modern society. Such systems typically comprise diverse software > components deployed across networks of hosts. Ensuring their reliability > is challenging, as software components must correctly communicate and > synchronise with each other, and any of the hardware or software > components may fail. Failure and service "outage" is extremely costly, > with worldwide financial losses due to software failures in 2017 > estimated at US$1.7tn, up from US$1.1tn in 2016. > > Failures can occur at all levels of the system stack: hardware, > operating systems, networks, software, and users. Here we focus on using > advanced programming language technologies to enable the software level > to handle failures that arise from any level of the stack. Our aim is to > provide software-level reliability for distributed systems by combining > fault prevention with fault tolerance. The key objective is to combine > the communication-structuring mechanism of session types with the > scalability and fault-tolerance of actor-based software architectures. > > The result will be a well-founded theory of reliable actor programming, > supported by a collection of libraries and tools, and validated on a > range of case studies. Key aims are to deliver tools that provide > lightweight support for developers ? e.g. warning of potential issues ? > and to allow developers to continue to use established idioms. By doing > so we aim to deliver a step change in the engineering of reliable > distributed software systems. > > The project is a collaboration between the University of Glasgow > (Professor Simon Gay and Professor Phil Trinder), Imperial College > London (Professor Nobuko Yoshida) and the University of Kent (Professor > Simon Thompson and Dr Laura Bocchi). The industrial partners are Actyx > AG, Erlang Solutions Ltd, Quviq AB and Tata Consultancy Services. > > > *Principal Duties* > > The successful candidates will be responsible for conducting research > into the theory and practice of session types for actor languages, and > for evaluating programming language designs and implementations in > relation to realistic case studies provided by the industrial > collaborators. > > You should have, or be close to completion of, a PhD in a relevant area, > or have comparable experience; an awarded PhD or equivalent experience > is necessary for appointment at Grade 7. You should have a track record > of publication and communication of research results, strong programming > and software engineering skills, and a strong background in programming > languages, including type systems and implementation. It is desirable > also to have one or more of the following: a combination of theoretical > and practical skills; knowledge of the theory or practice of concurrent > and distributed systems; knowledge of the theory or practice of > actor-based languages; > knowledge of the theory of session types. > > We seek applicants at an international level of excellence. The School > of Computing Science at the University of Glasgow has an international > research reputation, and Glasgow, Scotland's largest city, offers an > outstanding range of cultural resources and a high quality of life. > > It is the University of Glasgow?s mission to foster an inclusive > climate, which ensures equality in our working, learning, research and > teaching environment. > > We strongly endorse the principles of Athena SWAN, including a > supportive and flexible working environment, with commitment from all > levels of the organisation in promoting gender equity. > > Information about the Programming Language research theme at the > University of Glasgow: > > https://urldefense.com/v3/__https://www.gla.ac.uk/schools/computing/research/researchthemes/pl-theme/__;!!IBzWLUs!EA9riUAPC26JMnMljKkcqIGGp1S_froitFvaxNRG7aGpGIllGceEQPGUnJDvmXU0xBoJLoSglFCL9A$ > > > *Coronavirus / COVID-19* > > Considering the current travel restrictions, interviews will be held > remotely if necessary. We will also be flexible about the starting date > and working practices. > > > *Further information* > > For informal enquiries or further information about the project, > please contact Professor Simon Gay or > Professor Phil Trinder . > > > *Application details* > > Glasgow University online application system: > > https://urldefense.com/v3/__https://my.corehr.com/pls/uogrecruit/erq_search_version_4.search_form__;!!IBzWLUs!EA9riUAPC26JMnMljKkcqIGGp1S_froitFvaxNRG7aGpGIllGceEQPGUnJDvmXU0xBoJLoSJMEsYCQ$ > (enter reference 074049) > > Closing date: 14th January 2022 > > > The University of Glasgow, charity number SC004401. > -- *************************************** Professor Simon Gay Head of the School of Computing Science University of Glasgow https://urldefense.com/v3/__http://www.dcs.gla.ac.uk/*simon__;fg!!IBzWLUs!EA9riUAPC26JMnMljKkcqIGGp1S_froitFvaxNRG7aGpGIllGceEQPGUnJDvmXU0xBoJLoSWSuDRuQ$ *************************************** From simone.martini at unibo.it Mon Dec 13 09:11:23 2021 From: simone.martini at unibo.it (Simone Martini) Date: Mon, 13 Dec 2021 14:11:23 +0000 Subject: [TYPES/announce] CfA: History and Philosophy of Programming Message-ID: <442EBCD0-7CB0-407E-9112-B502516040A1@unibo.it> *HaPoP 2022* First call for Abstracts Papers on types in programming and in programming languages will be welcome ======================== /Fifth Symposium on the History and Philosophy of Programming (hybrid)/ 13 June 2022, Lille, France Maison Europ?enne des Sciences de l'Homme et de la Soci?t? website: https://urldefense.com/v3/__https://www.shift-society.org/hapop5/__;!!IBzWLUs!HIRTWXbB7m5yjboHEGCBZ1SmHtS1aCq7brG3nIeeLe4oZMDOhaoPkT7DhDbf7_AWa0YQs1WSfpyT7g$ Co-located with the final conference of the ANR-funded PROGRAMme project, 14-15 June 2022 (more details to follow soon). In a society where computers have become ubiquitous, it is necessary to develop a deeper understanding of the nature of computer programs, not just from the technical viewpoint, but from a broader historical and philosophical perspective. A historical awareness of the evolution of programming not only helps to clarify the complex structure of computing, but it also provides an insight in what programming was, is and could be in the future. Philosophy, on the other hand, helps to tackle fundamental questions about the nature of programs, programming languages and programming as a discipline. HaPoP 2022 is the fifth edition of the Symposium on the History and Philosophy of Programming, organised by HaPoC, Commission on the History and Philosophy of Computing (https://urldefense.com/v3/__http://www.hapoc.org__;!!IBzWLUs!HIRTWXbB7m5yjboHEGCBZ1SmHtS1aCq7brG3nIeeLe4oZMDOhaoPkT7DhDbf7_AWa0YQs1XaxkcSpg$ ) as a hybrid event. As in the previous editions, we are convinced that an interdisciplinary approach is necessary for understanding programming with its multifaceted nature. As such, we welcome participation by researchers and practitioners coming from a diversity of backgrounds, including historians, philosophers, artists, computer scientists and professional software developers. WHAT IS A COMPUTER PROGRAM? This edition of the symposium will be co-located with the final conference of the ANR-funded PROGRAMme project which poses the basic question ?What is a computer program?? This seemingly simple question has no simple answer today, but the responses one gives to it affect very real problems: who is responsible if a given piece of software fails; whether a program is correct or not; or whether copyright or patent law applies to programs. The project is anchored in the conviction that a new kind of foundational research is needed. The broad range of scientific and societal problems related to computing cannot be addressed by any single discipline. The question ?What is a program??, is a call for deeper critical thinking about the nature of programs that is both foundational, in the sense that it goes beyond specific problems, but also accessible, in the sense that it should be open to anyone who is willing to make an effort in understanding this basic technique from a broader horizon. In order to initiate new collaborations that critically reflect on the nature of programs and engage a broader community with the above issues, HaPoP 2022 is particularly looking for talk proposals that relate to the question ?What is a computer program?? and offer a novel reflection from a variety of perspectives, including historical, practice-based, philosophical, logical, etc. SELECTED TOPICS OF INTEREST FOR THE SYMPOSIUM Possible and in no way exclusive questions of relevance to this symposium are: - What is a computer program? - Are we getting better at writing programs that solve the given problem? Is programming a specialist discipline, or will everyone in the future be a programmer? - What are the different scientific paradigms and research programmes developed through the history of computer programming? - What is a correct program? - Is a program a text? - Is it possible to eliminate errors from computer programs? - How did the notion of a program change throughout the history? - How are programs and abstractions born, used and understood? - What was and is the relationship between hardware and software developments? - How did theoretical computer science (lambda-calculus, logics, category theory) influence the development of programming languages and vice versa? - What are the novel and most interesting approaches to the design of programs? - What is the nature of the relationship between algorithms and programs? - What legal and socio-economical issues are involved in the creation, patenting and free-distribution of programs? - How do we understand the multi-faceted nature of programs combining syntax, semantics and physical implementation? - How is programming to be taught? PROGRAM COMMITTEE AND REGISTRATION HaPoP5 co-chairs are Liesbeth De Mol and Tomas Petricek. If you have any questions regarding suitability of a topic or format of the extended abstract, please contact Liesbeth at liesbeth.de-mol at univ-lille.fr or Tomas at tomas at tomasp.net. For quick questions, you can also use @tomaspetricek on Twitter. - Arnaud Bailly, Aleryo - Martin Carl?, Ionean University, Corfu - Liesbeth De Mol (co-chair), CNRS, UMR 8163 STL, Universit? de Lille - Andrea Magnorsky, Independent - Ursula Martin, University of Oxford - Baptiste M?l?s, CNRS, UMR 7117 Archives Henri-Poincar? - Tomas Petricek (co-chair), University of Kent - Mark Priestley, National Museum of Computing, Bletchley - Giuseppe Primiero, University of Milan Information about registration and travel grants will be announced soon. Please check our webpage https://urldefense.com/v3/__https://www.shift-society.org/hapop5/__;!!IBzWLUs!HIRTWXbB7m5yjboHEGCBZ1SmHtS1aCq7brG3nIeeLe4oZMDOhaoPkT7DhDbf7_AWa0YQs1WSfpyT7g$ regularly for updates. We will be also sharing updates via the HaPoC Comission web page (register to get updates via email) and on Twitter at @HaPoComputing. DATES, FORMAT AND SUBMISSION We cordially invite anyone working in a field relevant to the main topic to submit *a short abstract* (at most 200 words) together with *an extended abstract* (at most 1000 words with references included) through Easychair: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=hapop50__;!!IBzWLUs!HIRTWXbB7m5yjboHEGCBZ1SmHtS1aCq7brG3nIeeLe4oZMDOhaoPkT7DhDbf7_AWa0YQs1Vo_-2IMA$ . Accepted papers will be given a 30 minute presentation slot including discussion. As with the previous editions, we also intend to submit a proposal for a special issue of a suitable journal for publication of full papers based on the symposium presentations. /Important dates/ Submission deadline: 18 March 2022 Author notification: 15 April 2022 HaPoP symposium: 13 June 2022 /Important links/ Submission web site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=hapop50__;!!IBzWLUs!HIRTWXbB7m5yjboHEGCBZ1SmHtS1aCq7brG3nIeeLe4oZMDOhaoPkT7DhDbf7_AWa0YQs1Vo_-2IMA$ Financial support: Coming soon Registraton site: Coming soon SUPPORT The symposium is supported by: - ANR (https://urldefense.com/v3/__https://anr.fr/__;!!IBzWLUs!HIRTWXbB7m5yjboHEGCBZ1SmHtS1aCq7brG3nIeeLe4oZMDOhaoPkT7DhDbf7_AWa0YQs1W7IENd5w$ ) - UMR 8162 Savoirs, Textes, Langage, Universit? de Lille (https://urldefense.com/v3/__https://stl.univ-lille.fr/__;!!IBzWLUs!HIRTWXbB7m5yjboHEGCBZ1SmHtS1aCq7brG3nIeeLe4oZMDOhaoPkT7DhDbf7_AWa0YQs1Vc7Rkz2g$ ) - HAPOC (https://urldefense.com/v3/__http://www.hapoc.org__;!!IBzWLUs!HIRTWXbB7m5yjboHEGCBZ1SmHtS1aCq7brG3nIeeLe4oZMDOhaoPkT7DhDbf7_AWa0YQs1XaxkcSpg$ ) From breandan.considine at gmail.com Mon Dec 13 21:29:00 2021 From: breandan.considine at gmail.com (Breandan Considine) Date: Mon, 13 Dec 2021 21:29:00 -0500 Subject: [TYPES/announce] AIPLANS Workshop at NeurIPS 2021 Tomorrow Message-ID: Dear Colleagues, On behalf of the organizers and program committee for the first annual workshop on Advances in Programming Languages and Neurosymbolic Systems , I am cordially inviting you to attend our workshop tomorrow, Tuesday, December 14th, from 6:45am-5:15pm EST. AIPLANS will feature research at the forefront of machine learning, mechanized reasoning and programming languages. In addition to an exciting lineup of invited talks , we have arranged to host a live poster session for our contributed papers on the GatherTown platform, where authors and audience members may interact virtually. You are more than welcome to attend this event, which is scheduled to occur from 12-1:30pm and 5-6pm EST. Please feel free to bring your own refreshments! Should you wish to attend AIPLANS, you must first sign up on the NeurIPS website . Once you have created an account, please send us an email and AIPLANS would be happy to provide a complimentary registration from our remaining pool of tickets on a first-come-first-serve basis. Together with your support, we look forward to putting on an engaging and thought-provoking program tomorrow. We are eager to welcome you virtually and look forward to your questions and participation. Should you have any questions, please do not hesitate to reach out! Best regards, Breandan Considine On behalf of the AIPLANS Organizers: Disha Shrivastava, David Yu-Tung Hui, Chin-Wei Huang and Shawn Tan -------------- next part -------------- An HTML attachment was scrubbed... URL: From ornela.dardha at gmail.com Tue Dec 14 07:15:25 2021 From: ornela.dardha at gmail.com (Ornela Dardha) Date: Tue, 14 Dec 2021 12:15:25 +0000 Subject: [TYPES/announce] PhD positions in PL at University of Glasgow: application deadline 31st January 2022 Message-ID: The School of Computing Science at the University of Glasgow is offering studentships to support PhD research for students starting in 2022. Up to 13 studentships (of different types) are being offered. Check details here https://urldefense.com/v3/__https://www.gla.ac.uk/schools/computing/postgraduateresearch/prospectivestudents/studentshipinformation/__;!!IBzWLUs!HzQXWl4zF3GLobvdGJGfDnd4CjzQzXKig10SPORA0ColW6GNdMkjD_3DA71K0B3zy4Skh40RDLR7_Q$ Whilst the above funding is open to students in all areas of computing science, applications in the area of programming languages, from foundations, to design and implementation, teaching etc. are most welcome. Available supervisors in this area at the School are listed in the PL theme website https://urldefense.com/v3/__https://www.gla.ac.uk/schools/computing/research/researchthemes/pl-theme/__;!!IBzWLUs!HzQXWl4zF3GLobvdGJGfDnd4CjzQzXKig10SPORA0ColW6GNdMkjD_3DA71K0B3zy4Skh41279cRJQ$ . Do not hesitate to contact the relevant potential supervisor from the members? list, if you want to discuss possible projects. Students can apply for admission to PhD study at any time, but to be considered for the studentships we are offering at this round, we must receive your application by 31 January 2022. For more information about how to apply, see https://urldefense.com/v3/__https://www.gla.ac.uk/schools/computing/postgraduateresearch/prospectivestudents/__;!!IBzWLUs!HzQXWl4zF3GLobvdGJGfDnd4CjzQzXKig10SPORA0ColW6GNdMkjD_3DA71K0B3zy4Skh41GgH1aZg$ . This web page includes information about the research proposal, which is required as part of your application. Applicants are strongly encouraged to contact a potential supervisor and discuss an application before the submission deadline. -------------- next part -------------- An HTML attachment was scrubbed... URL: From james.cheney at gmail.com Tue Dec 14 09:57:06 2021 From: james.cheney at gmail.com (James Cheney) Date: Tue, 14 Dec 2021 14:57:06 +0000 Subject: [TYPES/announce] Call for Participation: 24th International Symposium on Practical Aspects of Declarative Languages (PADL 2022) Message-ID: === Call for Participation === 24th International Symposium on Practical Aspects of Declarative Languages (PADL 2022) Philadelphia, Pennsylvania, United States 17-18th January 2022 https://urldefense.com/v3/__https://popl22.sigplan.org/home/PADL-2022__;!!IBzWLUs!Hjx7VD4dcgmg1EIIe2pqzahuW6H8OxSwMe5YYel-wMDT-OKN9Vw3d2adIEOKGHILJeUpp0nZ1QRinA$ Co-located with POPL 2022 == Venue and Conference Format == PADL 2022 is co-located with POPL 2022, which will be held in-person in Philadelphia at the Westin Philadelphia ( https://urldefense.com/v3/__https://www.marriott.com/hotels/travel/phlwi-the-westin-philadelphia__;!!IBzWLUs!Hjx7VD4dcgmg1EIIe2pqzahuW6H8OxSwMe5YYel-wMDT-OKN9Vw3d2adIEOKGHILJeUpp0nSbk4KKQ$ ). Authors that are unable to be at PADL in person can give their talk remotely. All talks will be recorded, and all recordings will be available either as a livestream or soon afterwards. For more details visit the POPL 2022 website: https://urldefense.com/v3/__https://popl22.sigplan.org/__;!!IBzWLUs!Hjx7VD4dcgmg1EIIe2pqzahuW6H8OxSwMe5YYel-wMDT-OKN9Vw3d2adIEOKGHILJeUpp0lgjpbVSg$ == Program == Conference program can be found at: https://urldefense.com/v3/__https://popl22.sigplan.org/home/PADL-2022*program__;Iw!!IBzWLUs!Hjx7VD4dcgmg1EIIe2pqzahuW6H8OxSwMe5YYel-wMDT-OKN9Vw3d2adIEOKGHILJeUpp0nSmxaTwQ$ == Invited Talks== PADL 2022 features two invited talks: ?People, Ideas, and the Path Ahead? by Marcello Balduccini (https://urldefense.com/v3/__https://www.sju.edu/faculty/marcello-balduccini/__;!!IBzWLUs!Hjx7VD4dcgmg1EIIe2pqzahuW6H8OxSwMe5YYel-wMDT-OKN9Vw3d2adIEOKGHILJeUpp0k5SKgEQA$ ) ?Declarative Programming and Education? by Shriram Krishnamurthi (https://urldefense.com/v3/__https://cs.brown.edu/*sk/__;fg!!IBzWLUs!Hjx7VD4dcgmg1EIIe2pqzahuW6H8OxSwMe5YYel-wMDT-OKN9Vw3d2adIEOKGHILJeUpp0n4b0vLfQ$ ) == Registration == Registration is open at: https://urldefense.com/v3/__https://popl22.sigplan.org/attending/registration__;!!IBzWLUs!Hjx7VD4dcgmg1EIIe2pqzahuW6H8OxSwMe5YYel-wMDT-OKN9Vw3d2adIEOKGHILJeUpp0k_HAMqAA$ The early registration deadline is January 3. At least one author of each accepted paper must get registered. == Conference Description == Declarative languages comprise several well-established classes of formalisms, namely, functional, logic, and constraint programming. Such formalisms enjoy both sound theoretical bases and the availability of attractive frameworks for application development. Indeed, they have been already successfully applied to many different real-world situations, ranging from database management to active networks to software engineering to decision support systems. New developments in theory and implementation fostered applications in new areas. At the same time, applications of declarative languages to novel and challenging problems raise many interesting research issues, including designing for scalability, language extensions for application deployment, and programming environments. Thus, applications drive the progress in the theory and implementation of declarative systems, and benefit from this progress as well. PADL is a well-established forum for researchers and practitioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative programming, including functional and logic programming, database and constraint programming, and theorem proving. == Program Chairs == - James Cheney, University of Edinburgh - Simona Perri, University of Calabria == Program Committee == Andres L?h, WellTyped Chiaki Sakama, Wakayama University Daniela Inclezan, Miami University Ekaterina Komendantskaya, Heriot-Watt University Esra Erdem, Sabanci University Francesco Calimeri, University of Calabria Jan Christiansen, Flensburg University of Applied Sciences Konstantin Schekotihin, University of Klagenfurt Lionel Parreaux, Hong Kong University of Science and Technology Lukasz Ziarek, University at Buffalo, United States Marco Maratea, University of Genova Marina De Vos, University of Bath Martin Erwig, Oregon State University Martin Gebser, University of Klagenfurt Michael Greenberg, Stevens Institute of Technology Paul Tarau, University of North Texas Pavan Kumar Chittimalli, TCS Research, India Pedro Cabalar, University of Corunna Roly Perera, The Alan Turing Institute Tomas Petricek, University of Kent Torsten Grust, University of T?bingen Tran Cao Son, New Mexico State University Yukiyoshi Kameyama, University of Tsukuba -------------- next part -------------- An HTML attachment was scrubbed... URL: From a.hartmanns at utwente.nl Tue Dec 14 16:28:16 2021 From: a.hartmanns at utwente.nl (Hartmanns, Arnd (UT-EEMCS)) Date: Tue, 14 Dec 2021 21:28:16 +0000 Subject: [TYPES/announce] RRRR 2022 Call for Submissions Message-ID: <1d47aff6bbbb4505a77a2313bbe2ff12@utwente.nl> Call for Submissions: RRRR 2022 1st Workshop on Reproducibility and Replication of Research Results April 2, 2022, as a satellite event of ETAPS 2022 in Munich, Germany https://urldefense.com/v3/__https://qcomp.org/rrrr/2022/__;!!IBzWLUs!HOVMTENMFF8vQqMH4iqzpurOd4ZDxagh_J7AtSPfb9p-KsXSpZL8qsNg54hqa2WSVZ8u7EV36ke5sQ$ RRRR provides a forum to present novel approaches to foster reproducibility of research results, and replication studies of existing work, in the broad area of formal methods research. Its goal is to spread the word on best practices, and reward the work invested in replicating results. Where reproducible research can be independently confirmed by third parties using artifacts provided by the original authors, replicating a result means to independently obtain it using new measurements, data, or implementations. RRRR will improve the knowledge transfer between the many separate initiatives ? like artifact evaluations and tool competitions ? that today support reproducibility, and provide a venue to formally publish replication studies, recognising their immense benefit to the scientific community and the hard work involved. SUBMISSIONS Submissions should be related to research in the broad area of formal methods that would be in scope for one of the ETAPS conferences in principle. Submissions will be handled via EasyChair. All accepted submissions will be collected in informal pre-proceedings. Submissions are encouraged in, but not limited to, two main topics: * Reproducibility: Presentations of novel developments in, or retrospective studies on, reproducibility initiatives. * Replication: Reports on successful or failed attempts at replicating other authors' earlier research results. RRRR accepts two types of submissions: * Extended abstracts (around 2 pages in LNCS style including references): These may cover work in progress, or summarise work recently published elsewhere. * Short papers (around 6 pages in LNCS style plus references): These should describe finished, not-yet-published work. Short papers will undergo a full reviewing process by at least three PC members. We encourage, but do not require, short papers to be accompanied by an artifact for reproduction. Authors of accepted submissions will present their work at the workshop, with equal treatment of extended abstracts and short papers. We encourage demonstrations to be integrated in presentations, in particular for replication studies. SPECIAL ISSUE IN STTT Authors of accepted short papers will be invited to submit an extended version to a special issue in the International Journal on Software Tools for Technology Transfer (STTT). We expect these extended versions to be accompanied by an artifact for reproduction that will be permanently archived with a DOI upon publication of the journal paper. TIMELINE * February 1: Submission deadline for short papers * February 15: Submission deadline for extended abstracts * March 1: Acceptance notification * March 10: Final versions for informal pre-proceedings * April 2: Workshop day All dates are in 2022 and all deadlines are "anywhere on Earth" (UTC-12). The organisers would appreciate an early informal indication, via email, of the intention to submit to RRRR 2022. ORGANISERS * Dirk Beyer (Ludwig-Maximilians-Universit?t M?nchen, Germany) * Arnd Hartmanns (University of Twente, The Netherlands) From A.Das at bham.ac.uk Wed Dec 15 11:31:06 2021 From: A.Das at bham.ac.uk (A.Das at bham.ac.uk) Date: Wed, 15 Dec 2021 16:31:06 +0000 Subject: [TYPES/announce] Postdoc in Proof Theory - University of Birmingham, UK Message-ID: <39c4aed6dac447aa768dd37d67118ea5223cfde2.camel@bham.ac.uk> Research Fellow in Proof Theory - University of Birmingham, UK. The School of Computer Science at the University of Birmingham is seeking to appoint a Research Fellow (postdoc) in Proof Theory, for a duration of 2 years. The Theory group at the University of Birmingham is one of the leading groups in logical foundations of computer science, with expertise not only in Proof Theory but also related areas such as Type Theory, Category Theory and Mathematical Logic: This position is funded by a UKRI Future Leaders Fellowship "StrIP: Structure vs Invariants in Proofs", led by Dr Anupam Das. The project aims to develop the theory of 'cyclic proofs' and their connections to automata theory. The principal responsibility of the fellow will be to conduct research, both collaboratively with Dr Das and other researchers at Birmingham, and independently. The fellow will also be supported in career development and encouraged to pursue independent opportunities. Qualifications and expertise You will have (or be close to completing) a PhD in Logic (computer science, mathematics or philosophy), or equivalent qualifications. You will have an excellent research record, with expertise in some of the following areas: * Proof theory (in particular, deep inference or cyclic proofs). * Automata theory (in particular, infinite word and tree automata). * Mathematical logic (in particular, fragments of arithmetic or set theory). Application Informal inquiries prior to application are encouraged and should be directed to Dr Anupam Das . You may find further details on the position and instructions for applying here: Practical information Starting salary range: ?31,406 - ?40,927 (potentially progressing to ?43,434). Application deadline: 9 January 2022. Starting date: flexible, ideally before May 2022. Duration: 2 years. From famontesi at gmail.com Wed Dec 15 13:50:15 2021 From: famontesi at gmail.com (Fabrizio Montesi) Date: Wed, 15 Dec 2021 19:50:15 +0100 Subject: [TYPES/announce] Assistant Professor (Tenure-track) Positions in Artificial Intelligence, Cybersecurity, and Programming Languages at the University of Southern Denmark Message-ID: The Section of Artificial Intelligence, Cybersecurity, and Programming Languages at the Department of Mathematics and Computer Science at the University of Southern Denmark (main campus, Odense) invites applications for tenure-track assistant professor positions in Computer Science. Application deadline: 15 February 2022. Link to the call: https://urldefense.com/v3/__https://www.sdu.dk/da/service/ledige_stillinger/1180362?sc_lang=en__;!!IBzWLUs!H8pnMJIj8KGuN-jxPKsVsASRBWXQ1DEkRep00AN7TTSniDDH4zzZYAlje_bNpqee--v9AifT5kZHuA$ The University of Southern Denmark wishes its staff to reflect the diversity of society and thus welcomes applications from all qualified candidates regardless of personal background. -------------- next part -------------- An HTML attachment was scrubbed... URL: From brucker at spamfence.net Wed Dec 15 05:36:39 2021 From: brucker at spamfence.net (Achim D. Brucker) Date: Wed, 15 Dec 2021 10:36:39 +0000 Subject: [TYPES/announce] Fully (UK Home) Funded PhD Positions in the Safety and Security of Advanced Systems Group (Exeter, UK, Deadline 2021-01-24) Message-ID: Several fully funded PhD scholarships for UK applicants are available in the Security and Trust of Advanced Systems Group [1] (Prof. Achim Brucker [2] and Dr. Diego Marmsoler [3]) at the Department of Computer Science of the University of Exeter, UK [4]. We are looking for enthusiastic and outstanding Computer Science or Mathematics students with a strong background in at least one of the following topics: * safety or security of (software) systems, * formal modelling or formal reasoning/verification, * program analysis or program verification, * language-based security * semantics of programming languages, * theorem proving, model checking, * cryptographic protocols, * distributed systems (e.g., blockchain), * specification-based testing, and * design and implementation of security architectures. This award provides annual funding to cover UK tuition fees and a tax-free stipend. For students who pay UK tuition fees the award will cover the tuition fees in full, plus at least ?15,009 per year tax-free stipend. The studentship will be awarded on the basis of merit for 3.5 years of full-time study. Interested candidates should contact the potential supervisors Prof. Achim Brucker (a.brucker at exeter.ac.uk) or Dr. Diego Marmsoler (d.marmsoler at exeter.ac.uk) to discuss their application. For more details, please consult the official advertisements: * Compositional Verification of Smart Contracts in Isabelle: https://urldefense.com/v3/__https://www.exeter.ac.uk/study/funding/award/?id=4326__;!!IBzWLUs!DCJjVU_lAfZllxW9EZZWF5gvTzKYO-Ca9_NhpZzGDzY5ridnQWwlOtaqRVyStf0Bvzhpp_04dK0qbA$ * Formal Verification for Safety- or Security-Critical Systems: https://urldefense.com/v3/__https://www.exeter.ac.uk/study/funding/award/?id=4328__;!!IBzWLUs!DCJjVU_lAfZllxW9EZZWF5gvTzKYO-Ca9_NhpZzGDzY5ridnQWwlOtaqRVyStf0Bvzhpp_0OTJW9ig$ * Software Engineering for Security- or Safety-Critical Systems: https://urldefense.com/v3/__https://www.exeter.ac.uk/study/funding/award/?id=4329__;!!IBzWLUs!DCJjVU_lAfZllxW9EZZWF5gvTzKYO-Ca9_NhpZzGDzY5ridnQWwlOtaqRVyStf0Bvzhpp_2ByIElKA$ * Open Call: https://urldefense.com/v3/__https://www.exeter.ac.uk/study/funding/award/?id=4343__;!!IBzWLUs!DCJjVU_lAfZllxW9EZZWF5gvTzKYO-Ca9_NhpZzGDzY5ridnQWwlOtaqRVyStf0Bvzhpp_2RUEtKaQ$ The closing date for applications is midnight on the 24th of January 2022. Best, Achim and Diego [1] https://urldefense.com/v3/__http://emps.exeter.ac.uk/computer-science/research/cyber-security/__;!!IBzWLUs!DCJjVU_lAfZllxW9EZZWF5gvTzKYO-Ca9_NhpZzGDzY5ridnQWwlOtaqRVyStf0Bvzhpp_14cBhVWA$ [2] https://urldefense.com/v3/__https://www.brucker.ch/__;!!IBzWLUs!DCJjVU_lAfZllxW9EZZWF5gvTzKYO-Ca9_NhpZzGDzY5ridnQWwlOtaqRVyStf0Bvzhpp_3R9JLxlA$ [3] https://urldefense.com/v3/__https://marmsoler.com/__;!!IBzWLUs!DCJjVU_lAfZllxW9EZZWF5gvTzKYO-Ca9_NhpZzGDzY5ridnQWwlOtaqRVyStf0Bvzhpp_1aeEQaDw$ [4] https://urldefense.com/v3/__http://emps.exeter.ac.uk/computer-science/__;!!IBzWLUs!DCJjVU_lAfZllxW9EZZWF5gvTzKYO-Ca9_NhpZzGDzY5ridnQWwlOtaqRVyStf0Bvzhpp_1vmf_fQQ$ -- Prof. Achim Brucker | Chair in Cybersecurity & Head of Group | University of Exeter https://urldefense.com/v3/__https://www.brucker.ch__;!!IBzWLUs!DCJjVU_lAfZllxW9EZZWF5gvTzKYO-Ca9_NhpZzGDzY5ridnQWwlOtaqRVyStf0Bvzhpp_0tG2yYGQ$ | https://urldefense.com/v3/__https://logicalhacking.com/blog__;!!IBzWLUs!DCJjVU_lAfZllxW9EZZWF5gvTzKYO-Ca9_NhpZzGDzY5ridnQWwlOtaqRVyStf0Bvzhpp_3dyOULiA$ @adbrucker | @logicalhacking From caterina.urban at ens.fr Fri Dec 17 07:44:44 2021 From: caterina.urban at ens.fr (Caterina Urban) Date: Fri, 17 Dec 2021 13:44:44 +0100 Subject: [TYPES/announce] ETAPS Doctoral Dissertation Award - Call for Nominations Message-ID: <229CD022-BDBC-4D7E-BFAD-B89DA409F0D3@ens.fr> ETAPS Doctoral Dissertation Award ================================= The European Joint Conferences on Theory and Practice of Software Association has established a Doctoral Dissertation Award to promote and recognize outstanding dissertations in the research areas covered by the four main ETAPS conferences (ESOP, FASE, FoSSaCS, and TACAS). Doctoral dissertations are evaluated with respect to originality, relevance, and impact to the field, as well as the degree of reproducibility (where this applies). The award winner will receive a monetary prize and will be recognized at the ETAPS Banquet. Eligibility ----------- Eligible for the award is any PhD student whose doctoral dissertation is in the scope of the ETAPS conferences and who completed their doctoral degree at a European academic institution in the period from January 1st, 2021 to December 31st, 2021. Nominations ----------- Award candidates should be nominated by their supervisor. Members of the Award Committee are not allowed to nominate their own PhD students for the award. Nominations consist of a single PDF file (extension .pdf) containing: * name and email address of the candidate * a short curriculum vitae of the candidate * name and email address of the supervisor * an endorsement letter from the supervisor * the final version of the doctoral dissertation * institution and department that has awarded the doctorate * a document certifying that the doctoral degree was successfully completed within the eligibility period * a report from at least one examiner of the dissertation who is not affiliated with the candidate's institution * (optional) extra endorsement letters All documents must be written in English. Nominations are welcome regardless of whether results that are part of the dissertation have been published at ETAPS. Nominations should be submitted via EasyChair: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=etapsdda2022__;!!IBzWLUs!EOGY0-AcUZeY6QfXrtDghflXohdwB_KlyQG2b8QOsArqn8vcf9M0MPewRr1pWbQh-eZf7r6j86wcZg$ The deadline for nominations is January 7th, 2022. Award Committee --------------- Caterina Urban (chair) Nobuko Yoshida (representing ESOP) Mari?lle Stoelinga (representing FASE) Andrew Pitts (representing FoSSaCS) Holger Hermanns (representing TACAS) Marieke Huisman Ralf Jung Contact ------- All questions about submissions should be emailed to the chair of the award committee, Caterina Urban . From alex.kavvos at bristol.ac.uk Sat Dec 18 06:03:09 2021 From: alex.kavvos at bristol.ac.uk (Alex Kavvos) Date: Sat, 18 Dec 2021 11:03:09 +0000 Subject: [TYPES/announce] PhD positions in PL at the University of Bristol Message-ID: Dear all The Programming Languages group at the University of Bristol is now inviting PhD applications for the academic year starting in 2022. Funding for these positions is allocated on a competitive basis across Engineering. Applicants with UK residence are eligible, but around 30% will be allocated to outstanding international applicants. Deadline: 11 January 2022. Please contact us ASAP at pl-lab at bristol.ac.uk to express interest and/or ask questions. The members of the PL group are: - Alex Kavvos (semantics, type theory, category theory) - Cristina David (program synthesis, verification, decision procedures) - Fran?ois Dupressoir (machine-checked cryptographic proofs) - Steven Ramsay (program analysis, automated reasoning, verification) - Meng Wang (functional programming, software engineering) More information about the group can be found on our webpage: https://urldefense.com/v3/__https://bristolpl.github.io__;!!IBzWLUs!Bi2RtMygs_pMEPGezP3kiijP67py1Do3zkv1ykufTu3qCbmom6Tn9qKwghAiTLVdLOuz_kuTce787Q$ Please find a list of papers that demonstrates the breadth of research conducted by the group at the end of this posting. Best wishes Alex PS. The following papers indicate the type of PL research conducted at Bristol: - Yamaguchi et al. (2022). Synbit: Synthesizing Bidirectional Programs using Unidirectional Sketches. To appear at OOPSLA 2021. - Perera et al. (2022). Linked visualisations via Galois dependencies. To appear at POPL 2022. - Xie et al. (2022). Staging with Class. To appear at POPL 2022. - Qian Z et al. (2021). Client-Server Sessions in Linear Logic. ICFP 2021. 10.1145/3473567 - Jones E & Ramsay S. (2021). Intensional Refinement Datatypes. POPL 2021. 10.1145/3445980 - Gratzer D et al. (2020). Multimodal Dependent Type Theory. LICS 2020. 10.1145/3373718.3394736 - Matsuda K & Wang M. (2020). Sparcl: A Language for Partially-Invertible Computation. ICFP 2020. 10.1145/3409000 - Zhang J et al. (2019). A Study of Bug Resolution Characteristics in Popular Programming Languages. IEEE Transactions on Software Engineering. 10.1109/TSE.2019.2961897 - Abate A et al. (2019). Automated Formal Synthesis of Provably Safe Digital Controllers for Continuous Plants. Acta Informatica, vol 57. 10.1007/s00236-019-00359-1 - Almeida et al. (2019). Machine-Checked Proofs for Cryptographic Standards: Indifferentiability of Sponge and Secure High-Assurance Implementations of SHA-3. CCS 2019. 10.1145/3319535.336321 ... Alex Kavvos ... Lecturer in Programming Languages ... University of Bristol, United Kingdom ...?https://urldefense.com/v3/__https://www.lambdabetaeta.eu__;!!IBzWLUs!Bi2RtMygs_pMEPGezP3kiijP67py1Do3zkv1ykufTu3qCbmom6Tn9qKwghAiTLVdLOuz_ktVeKw3mQ$ From maurizio.proietti at iasi.cnr.it Sat Dec 18 08:47:09 2021 From: maurizio.proietti at iasi.cnr.it (Maurizio Proietti) Date: Sat, 18 Dec 2021 14:47:09 +0100 Subject: [TYPES/announce] HCVS 2022 - First Call for Papers Message-ID: 9th Workshop on Horn Clauses for Verification and Synthesis (HCVS) Co-located with ETAPS 2022 3rd April 2022 - Munich, Germany https://urldefense.com/v3/__https://www.sci.unich.it/hcvs22/__;!!IBzWLUs!GP9R67D3vS8ylLy7w6obEsef320ATUR7jJeRTVnJoHenqKRqKon-NbopzsrAfvwDJHlxMbzX82Fyug$ Invited speakers: TBA Important dates: - Paper submission deadline: Jan 31, 2022 - Paper notification: Feb 28, 2022 - Workshop: Apr 3, 2022 Many Program Verification and Synthesis problems of interest can be modeled directly using Horn clauses and many recent advances in the CLP and CAV communities have centered around efficiently solving problems presented as Horn clauses. This series of workshops aims to bring together researchers working in the communities of Constraint/Logic Programming (e.g., ICLP and CP), Program Verification (e.g., CAV, TACAS, and VMCAI), and Automated Deduction (e.g., CADE, IJCAR), on the topic of Horn clause based analysis, verification, and synthesis. Horn clauses for verification and synthesis have been advocated by these communities in different times and from different perspectives and HCVS is organized to stimulate interaction and a fruitful exchange and integration of experiences. The workshop follows previous meetings: HCVS 2021 in Luxembourg, Luxembourg (ETAPS 2021), HCVS 2020 in Dublin, Ireland (ETAPS 2020), HCVS 2019 in Prague, Czech Republic (ETAPS 2019), HCVS 2018 in Oxford, UK (CAV, ICLP and IJCAR at FLoC 2018), HCVS 2017 in Gothenburg, Sweden (CADE 2017), HCVS 2016 in Eindhoven, The Netherlands (ETAPS 2016), HCVS 2015 in San Francisco, CA, USA (CAV 2015), and HCVS 2014 in Vienna, Austria (VSL). Topics of interest include, but are not limited to the use of Horn clauses, constraints, and related formalisms in the following areas: -Analysis and verification of programs and systems of various kinds (e.g., imperative, object-oriented, functional, logic, higher-order, concurrent, transition systems, petri-nets, smart contracts) -Program synthesis -Program testing -Program transformation -Constraint solving -Type systems -Machine learning and automated reasoning -CHC encoding of analysis and verification problems -Resource analysis -Case studies and tools -Challenging problems We solicit regular papers describing theory and implementation of Horn-clause based analysis and tool descriptions. We also solicit extended abstracts describing work-in-progress, as well as presentations covering previously published results and posters that are of interest to the workshop. CHC Competition: HCVS 2022 will host the 5th competition on constraint Horn clauses (CHC-COMP https://urldefense.com/v3/__https://chc-comp.github.io/__;!!IBzWLUs!GP9R67D3vS8ylLy7w6obEsef320ATUR7jJeRTVnJoHenqKRqKon-NbopzsrAfvwDJHlxMbzAnaWdmQ$ ), which will compare state-of-the-art tools for CHC solving for performance and effectiveness on a set of publicly available benchmarks. A report on the 5th CHC-COMP will be part of the workshop's proceedings. The report also contains tool descriptions of the participating solvers. Program Chairs: Temesghen Kahsai, Amazon, USA Maurizio Proietti, IASI-CNR, Italy Program Committee: Elvira Albert, Complutense University of Madrid, Spain Emanuele De Angelis, IASI-CNR, Italy Grigory Fedyukovich, Florida State University, USA Fabio Fioravanti, University of Chieti-Pescara, Italy Arie Gurfinkel, University of Waterloo, Canada Bishoksan Kafle, IMDEA Software Institute, Spain Naoki Kobayashi, University of Tokyo, Japan Ekaterina Komendantskaya, Heriot-Watt University, UK Annie Liu, Stony Brook University, USA Dale Miller, Inria Saclay & LIX, France Jorge A. Navas, SRI, USA Saswat Padhi, Amazon, USA Philipp Ruemmer, Uppsala University, Sweden Mattias Ulbrich, Karlsruhe Institute of Technology, Germany Submission has to be done in one of the following formats: -Regular papers (up to 12 pages plus bibliography in EPTCS (https://urldefense.com/v3/__http://www.eptcs.org/__;!!IBzWLUs!GP9R67D3vS8ylLy7w6obEsef320ATUR7jJeRTVnJoHenqKRqKon-NbopzsrAfvwDJHlxMbyAN-aS8Q$ ) format), which should present previously unpublished work (completed or in progress), including descriptions of research, tools, and applications. -Tool papers (up to 4 pages in EPTCS format), including the papers written by the CHC-COMP participants, which can outline the theoretical framework, the architecture, the usage, and experiments of the tool. -Extended abstracts (up to 3 pages in EPTCS format), which describe work in progress or aim to initiate discussions. - **Presentation-only papers**, i.e., papers already submitted or presented at a conference or another workshop. Such papers can be submitted in any format, and will not be included in the workshop post-proceedings. -Posters that are of interest to the workshop All submitted papers will be refereed by the program committee and will be selected for inclusion in accordance with the referee reports. Accepted regular papers and extended abstracts will be published electronically as a volume in the Electronic Proceedings in Theoretical Computer Science (EPTCS) series, see https://urldefense.com/v3/__http://www.eptcs.org/__;!!IBzWLUs!GP9R67D3vS8ylLy7w6obEsef320ATUR7jJeRTVnJoHenqKRqKon-NbopzsrAfvwDJHlxMbyAN-aS8Q$ (provided that enough regular papers are accepted). The publication of a paper is not intended to preclude later publication. Full versions of extended abstracts published in EPTCS, or substantial revisions, may later be published elsewhere. Papers must be submitted through the EasyChair system using the web page: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=hcvs2022__;!!IBzWLUs!GP9R67D3vS8ylLy7w6obEsef320ATUR7jJeRTVnJoHenqKRqKon-NbopzsrAfvwDJHlxMbw5BK853g$ -- Maurizio Proietti IASI-CNR Via dei Taurini 19, 00185 Roma, Italy Phone: +39 0649937114 Fax: +39 06 4993 7106, +39 06 4993 7137 maurizio.proietti at iasi.cnr.it https://urldefense.com/v3/__http://www.iasi.cnr.it/*proietti__;fg!!IBzWLUs!GP9R67D3vS8ylLy7w6obEsef320ATUR7jJeRTVnJoHenqKRqKon-NbopzsrAfvwDJHlxMbyKF-m8cw$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From yegor256 at gmail.com Sun Dec 19 11:23:35 2021 From: yegor256 at gmail.com (Yegor Bugayenko) Date: Sun, 19 Dec 2021 19:23:35 +0300 Subject: [TYPES/announce] CFP extended: 2nd Intl Conf on Code Quality (ICCQ) in-coop with SIGPLAN/SIGSOFT and IEEE Message-ID: ---------------------------------------------------------------------- ICCQ 2022 2nd International Conference on Code Quality April 23, 2022 Innopolis, Kazan, Russia (mostly online) https://urldefense.com/v3/__https://www.iccq.ru/2022.html__;!!IBzWLUs!HZjEON19FavTacJ1tDnmbTHR00D4AOml8HtVx_ZZhXnaOUnr6mNeSXC-no6ZElPLrWTNqO-FTmlbJw$ ---------------------------------------------------------------------- In cooperation with ACM SIGPLAN, ACM SIGSOFT, and IEEE Computer Society. We believe that the quality of the source code that millions of programmers write every day could be much higher than it is now. We believe that the contribution computer science can make to improve this situation is greatly undervalued. We aim to solve this problem by gathering together cutting-edge researchers and letting them share their most recent ideas on static analysis, program verification, bug detection, and software maintenance. Due to the COVID-19 situation, the conference will be held in semi-online mode: speakers will be allowed to present their work remotely over Zoom. IMPORTANT DATES Paper/abstract submission: 31 Dec 2021 (anywhere on Earth) Author notification: 1 Mar 2022 Camera-ready submissions: 25 Mar 2022 Conference: 23 Mar 2022 KEYNOTE SPEECH Charles Zhang, HKSUT STEERING COMMITTEE Hou Rui, Director of Huawei MRC Alexander Tormasov, Rector of Innopolis University PROGRAM COMMITTEE Giancarlo Succi, Innopolis University (Chair) Karim Ali, University of Alberta Luciano Baresi, Politecnico di Milano Carl Friedrich Bolz-Tereick, Heinrich-Heine-Universit?t D?sseldorf William J. Bowman, University of British Columbia Laura M. Castro, Universidade da Coru?a Shigeru Chiba, University of Tokyo Tim Felgentreff, Oracle Labs Christian Hammer, University of Passau Mats Heimdahl, University of Minnesota Robert Hirschfeld, University of Potsdam Alexandra Jimborean, Uppsala University David H. Lorenz, Open University of Israel Hidehiko Masuhara, Tokyo Institute of Technology Hausi A. M?ller, University of Victoria Yongjun Park, Hanyang University Gennady Pekhimenko, University of Toronto Veselin Raychev, ETH Tiark Rompf, Purdue University Yulei Sui, University of Technology Sydney Will Tracz, IFIP Jurgen Vinju, Eindhoven University of Technology Laurie Williams, North Carolina State University Tuba Yavuz, University of Florida PUBLICATIONS Papers will be published in the Proceedings of ICCQ, will appear in IEEE Xplore, and will be indexed by Web of Science, Scopus, Google Scholar, DBLP, and others. We consider the following criteria when evaluating papers. Novelty: The paper presents new ideas and results and places them appropriately within the context established by previous research. Importance: The paper contributes to the advancement of knowledge in the field. We also welcome papers that diverge from the dominant trajectory of the field. Evidence: The paper presents sufficient evidence supporting its claims, such as proofs, implemented systems, experimental results, statistical analyses, case studies, and anecdotes. Clarity: The paper presents its contributions, methodology, and results clearly. Papers will be reviewed by three PC members using a double-blind review process. Submissions must be in PDF, printable in black and white on US Letter sized paper. All submissions must adhere to the ACM Small template (sigplan, two columns, 11pt font size). Submitted papers must be at least 4 and at most 16 pages long, including bibliographical references and appendices. Please, submit via EasyChair: https://urldefense.com/v3/__https://easychair.org/cfp/ICCQ22__;!!IBzWLUs!HZjEON19FavTacJ1tDnmbTHR00D4AOml8HtVx_ZZhXnaOUnr6mNeSXC-no6ZElPLrWTNqO9BscLiaQ$ SPONSORS ICCQ is sponsored by Innopolis University, Yandex, Huawei, Higher School of Economics, Bauman MSTU, BNP Paribas, and others. QUESTIONS? If any questions, please email to team at iccq.ru -------------- next part -------------- An HTML attachment was scrubbed... URL: From u.berger at swansea.ac.uk Mon Dec 20 04:24:11 2021 From: u.berger at swansea.ac.uk (Ulrich Berger) Date: Mon, 20 Dec 2021 09:24:11 +0000 Subject: [TYPES/announce] CiE 2022: Second CfP Message-ID: ================================ CiE 2022: SECOND CALL FOR PAPERS ================================ Computability in Europe 2022: Revolutions and revelations in computability **CiE 2022 is planned as an on-site conference with online elements** Swansea, Wales, United Kingdom July 11-15, 2022 https://urldefense.com/v3/__https://cs.swansea.ac.uk/cie2022/__;!!IBzWLUs!Eopp5NHCqhmZlLRvdEUmlrfasVIRGRZ24Or8-nhmSs-tOlbENuQUn-CnC8MNKlGR56XKM1jhKDj1zQ$ Submission link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=cie2022__;!!IBzWLUs!Eopp5NHCqhmZlLRvdEUmlrfasVIRGRZ24Or8-nhmSs-tOlbENuQUn-CnC8MNKlGR56XKM1gKVazKtQ$ IMPORTANT DATES: ================ Deadline for article registration (abstract submission): January 14, 2022 (AOE) Deadline for article submission: January 28, 2022 (AOE) Notification of acceptance: April 11, 2022 Final versions due: April 25, 2022 Deadline for informal presentations submission: May 1, 2022 (The notifications of acceptance for informal presentations will be sent a few days after submission.) Early registration before: May 15, 2022. CiE 2022 is the 18th conference organized by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010), Sofia (2011), Cambridge (2012), Milan (2013), Budapest (2014), Bucharest (2015), Paris (2016), Turku (2017), Kiel (2018), Durham (2019), Salerno (2020, virtually), and Ghent (2021, virtually). TUTORIAL SPEAKERS: ================== - Noam Greenberg (Victoria University of Wellington) ? Karoliina Lehtinen (LIS, Aix-Marseille University) INVITED SPEAKERS: ================= ? Erika ?brah?m (RWTH Aachen University) ? Thierry Coquand (University of Gothenburg) ? Liesbeth de Mol (Universit? de Lille) ? Damir Dzhafarov (University of Connecticut) - Harvey Friedman (The Ohio State University) ? Svetlana Selivanova (Korea Advanced Institute of Science and Technology - KAIST) SPECIAL SESSIONS: ================= ? At the intersection of computability and other areas of mathematics, organised by Denis Hirschfeldt (University of Chicago) and Karen Lange (Wellesley College) Speakers: Meng-Che Ho (California State University, Northridge) Alexandra Shlapentokh (Eastern Carolina University) Elvira Mayordomo (Universidad de Zaragoza) Kumaraswamy (Vela) Velupillai (University of Trento) - Computability theory of blockchain technology, organised by Arnold Beckmann (Swansea University) and Anton Setzer (Swansea University) Speakers: Eli Ben-Sasson (StarkWare) Maurice Herlihy (Brown University, Providence) Philip Wadler (University of Edinburgh) There will also be a panel discussion with the speakers of this special session. ? Computing Language: Love Letters, Large Models and NLP, organised by Liesbeth de Mol (Universit? de Lille) and Giuseppe Primiero (University of Milan) for the Council of the HaPoC Commission Speakers: Troy Astarte (Swansea University) Jacqueline Leon (Universit? de Paris et Universit? de de la Sorbonne Nouvelle) Mael Pegny (Universit?t T?bingen) Jacopo Tagliabue (COVEO) - Computing with bio-molecules, organised by J?r?me Durand-Lose (Universit? d'Orleans) and Claudio Zandron (University of Milan Bicocca) Speakers: Giuditta Franco (University of Verona) Maria Dolores Jimenez-Lopez (University of Tarragona) Nicolas Schabanel (CNRS - LIP, ?cole Normale Sup?rieure de Lyon) Petr Sosik (Silesian University of Opava) - Constructive and reverse mathematics, organised by Samuele Maschio (Universita di Padova) and Takako Nemoto (Hiroshima Institute of Technology) Speakers: Makoto Fujiwara (LMU Munich) Takayuki Kihara (Nagoya University) Robert Lubarsky (Florida Atlantic University) Huishan Wu (BLCU Beijing) - Reachability problems, organised by Paul Bell (Liverpool John Moores University) and Igor Potapov (University of Liverpool) Speakers: Kitty Meeks (University of Glasgow) Olivier Bournez (?cole Polytechnique de Paris) V?ronique Bruy?re (Universit? de Mons) James Worrell (University of Oxford) CONTRIBUTED PAPERS: =================== Contributed papers will be selected from submissions received by the PROGRAM COMMITTEE consisting of: Marcella Anselmo (University of Salerno) Ver?nica Becher (University of Buenos Aires) Ulrich Berger (Swansea University, co-chair) Katie Brodhead (Florida State University) Laura Crosilla (University of Oslo) Joel Day (Loughborough University) Gianluca Della Vedova (University of Milan) Leah Epstein (University of Haifa) Maribel Fernandez (King's College London) Ekaterina Fokina (TU Wien) Johanna Franklin (Hofstra University, co-chair) Lorenzo Galeotti (Amsterdam University College) Sandra Kiefer (RWTH Aachen University) Susana Ladra (University of Coruna) Maria Emilia Maietti (University of Padova) Florin Manea (University of Goettingen) Klaus Meer (Brandenburg University of Technology Cottbus) Dale Miller (LIX Polytechnique) Russell Miller (Queens College CUNY) Arno Pauly (Swansea University) Nadia Pisanti (University of Pisa) Solon Pissis (CWI Amsterdam) Giuseppe Primiero (University of Milan) Ramyaa Ramyaa (New Mexico Tech) Monika Seisenberger (Swansea University) Anton Setzer (Swansea University) Alexandra Shlapentokh (East Carolina University) Reed Solomon (University of Connecticut) Mariya Soskova (University of Wisconsin?Madison) Peter Van Emde Boas (University of Amsterdam) Andreas Weiermann (Ghent University) Andreas Wichert (University of Lisbon) The CiE conferences serve as an interdisciplinary forum for research in all aspects of computability, foundations of computer science, logic, and theoretical computer science, as well as the interplay of these areas with practical issues in computer science and with other disciplines such as biology, mathematics, philosophy, or physics. THE PROGRAM COMMITTEE cordially invites all researchers, European and non-European, to submit their papers in all areas related to the above for presentation at the conference and inclusion in the proceedings of CiE 2022 at https://urldefense.com/v3/__https://easychair.org/conferences/?conf=cie2022__;!!IBzWLUs!Eopp5NHCqhmZlLRvdEUmlrfasVIRGRZ24Or8-nhmSs-tOlbENuQUn-CnC8MNKlGR56XKM1gKVazKtQ$ Papers must be submitted in PDF format, using the LNCS style (available at https://urldefense.com/v3/__https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines__;!!IBzWLUs!Eopp5NHCqhmZlLRvdEUmlrfasVIRGRZ24Or8-nhmSs-tOlbENuQUn-CnC8MNKlGR56XKM1i3F2zb5Q$ and also on Overleaf https://urldefense.com/v3/__https://www.overleaf.com/latex/templates/springer-lecture-notes-in-computer-science/kzwwpvhwnvfj*.WsdHOy5uZpg__;Iw!!IBzWLUs!Eopp5NHCqhmZlLRvdEUmlrfasVIRGRZ24Or8-nhmSs-tOlbENuQUn-CnC8MNKlGR56XKM1hGnxVwvg$ ) and must not exceed a maximum of 12 pages, including references but excluding a possible appendix in which one can include proofs and other additional material. Papers building bridges between different parts of the research community are particularly welcome. Submission link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=cie2022__;!!IBzWLUs!Eopp5NHCqhmZlLRvdEUmlrfasVIRGRZ24Or8-nhmSs-tOlbENuQUn-CnC8MNKlGR56XKM1gKVazKtQ$ See https://urldefense.com/v3/__https://cs.swansea.ac.uk/cie2022/submission__;!!IBzWLUs!Eopp5NHCqhmZlLRvdEUmlrfasVIRGRZ24Or8-nhmSs-tOlbENuQUn-CnC8MNKlGR56XKM1hrNXfhwQ$ for further information. The CONFERENCE PROCEEDINGS will be published by LNCS, Springer-Verlag, in the ARCoSS (Advanced Research in Computing and Software Science) subline. INFORMAL PRESENTATIONS: ======================= Continuing the tradition of past CiE conferences, we invite researchers to present informal presentations of their recent work. A proposal for an informal presentation must be submitted via EasyChair (https://urldefense.com/v3/__https://easychair.org/conferences/?conf=cie2022__;!!IBzWLUs!Eopp5NHCqhmZlLRvdEUmlrfasVIRGRZ24Or8-nhmSs-tOlbENuQUn-CnC8MNKlGR56XKM1gKVazKtQ$ ), using the LNCS style file (available at https://urldefense.com/v3/__https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines__;!!IBzWLUs!Eopp5NHCqhmZlLRvdEUmlrfasVIRGRZ24Or8-nhmSs-tOlbENuQUn-CnC8MNKlGR56XKM1i3F2zb5Q$ ), and be 1 page long; a brief description of the results suffices and an abstract is not required. Informal presentations will not be published in the LNCS conference proceedings. Results presented as informal presentations at CiE 2022 may appear or may have appeared in other conferences with formal proceedings and/or in journals. The deadline for the submission of abstracts for informal presentations is May 1, 2022. WOMEN IN COMPUTABILITY: ======================= We are very happy to announce that within the framework of the Women in Computability program, we are able to offer some grants for junior women researchers who want to participate in CiE 2022. Applications for this grant should be sent to Liesbeth de Mol, liesbeth.demol at univ-lille3.fr, before May 15, 2022 and include a short cv (at most 2 pages) and contact information for an academic reference. Preference will be given to junior women researchers who are presenting a paper (including informal presentations) at CiE 2022. Association CiE: https://urldefense.com/v3/__https://www.acie.eu/__;!!IBzWLUs!Eopp5NHCqhmZlLRvdEUmlrfasVIRGRZ24Or8-nhmSs-tOlbENuQUn-CnC8MNKlGR56XKM1gyuiBDRA$ CiE Conference Series: https://urldefense.com/v3/__https://www.acie.eu/cie-conference-series/__;!!IBzWLUs!Eopp5NHCqhmZlLRvdEUmlrfasVIRGRZ24Or8-nhmSs-tOlbENuQUn-CnC8MNKlGR56XKM1hhdDL7Jw$ HOSTED BY: ========== School of Mathematics and Computer Science at the Computational Foundry, Bay Campus, Swansea University, Crymlyn Burrows, Skewen, Swansea SA1 8EN, United Kingdom This conference is in cooperation with the Association for Women in Mathematics and supports the Welcoming Environment Statement. SPONSORS: ========= We are grateful for support from the Institute for Coding in Wales, the London Mathematical Society, and Springer-Verlag. ORGANIZING COMMITTEE: ====================== Troy Astarte (Swansea University) Arnold Beckmann (Swansea University) Ulrich Berger (Swansea University) Tonicha Crook (Swansea University) Faron Moller (Swansea University) Bertie Mueller (Swansea University) Eike Neumann (Swansea University) Arno Pauly (Swansea University, chair) Olga Petrovska (Swansea University) Pierre Pradic (Swansea University) Markus Roggenbach (Swansea University) Monika Seisenberger (Swansea University) Anton Setzer (Swansea University) John Tucker (Swansea University) For questions, please contact the organisers at cie2022swansea at gmail.com. -------------- next part -------------- An HTML attachment was scrubbed... URL: From quentin.stievenart at gmail.com Mon Dec 20 04:27:38 2021 From: quentin.stievenart at gmail.com (Quentin Stievenart) Date: Mon, 20 Dec 2021 10:27:38 +0100 Subject: [TYPES/announce] CfP ProWeb 2022: Programming Technology for the Future Web Message-ID: ProWeb 2022: 6th International Workshop on Programming Technology for the Future Web https://urldefense.com/v3/__https://2022.programming-conference.org/track/proweb-2022-papers__;!!IBzWLUs!HmqsYJYXDznReZsbtAFkFebx5rExpyRyvs96lEzjos_2GrgoNFg_mLUAgcpTuLSir0j7-sGhJhwCEA$ Co-located with the ?Programming? conference March 21st - 25th ================ Full-fledged web applications have become ubiquitous on desktop and mobile devices alike. Whereas ?responsive? web applications already offered a more desktop-like experience, there is an increasing demand for ?rich? web applications (RIAs) that offer collaborative and even off-line functionality: Google Docs being the prototypical example. Long gone are the days that web servers merely had to answer incoming HTTP requests with a block of static HTML. Today?s servers react to a continuous stream of events coming from JavaScript applications that have been pushed to clients. As a result, application logic and data are increasingly distributed and traditional dichotomies such as ?client vs. server? and ?offline vs. online? are fading. ** Call for Contributions ** The ProWeb22 workshop is a forum for researchers and practitioners to share and discuss new technology for programming these and future evolutions of the web. We welcome submissions introducing programming technology (i.e., frameworks, libraries, programming languages, program analyses, and development tools) and formalisms for implementing web applications and for maintaining their quality, as well as experience reports about their usage. Relevant topics include, but are not limited to: * Applications of AI to web software development: code models, code prediction, change impact analysis, automated testing * Web App Quality: static and dynamic program analyses, metrics, development tools, automated testing, contract systems, type systems, migration from legacy architectures, web service APIs, API conformance checking * Designing for and hosting novel languages on the web: compilation to JavaScript, WebAssembly * Multi-tier (or tierless) programming: new languages and runtimes, tier-splitting compilers, type systems * Principles and practice of Web UI programming: data binding, reactive programming, virtual DOM * Data sharing, replication, and consistency: cloud types, CRDTs, eventual consistency, offline storage, peer-to-peer communication * Security on the new web: security policies, policy enforcement, membranes, vulnerability detection, dynamic patching * Surveys and case studies using state-of-the-art web technology (e.g., WebAssembly, WebSockets, Web Storage, Service Workers, WebRTC, Angular.js, React and React Native, TypeScript, Proxies, PureScript, ClojureScript, Amber Smalltalk, Scala.js) * Ideas on and experience reports about: how to reconcile the need for quality with the need for agility on the web, how to master and combine the myriad of tier-specific technologies required to develop a web application * Position papers on what the future of the web will look like This year, we are accepting three types of submission: * **Full papers, position papers, and experience reports**: 6-page papers describing novel research, which, when accepted, will be included in the ACM Digital Library. * **Demo papers**: 4-page papers illustrating demonstrations of tools and prototypes. * **Presentation abstracts**: 2-page extended abstracts. Presentation abstracts will not be included in the ACM Digital Library but will be included in an informal pre-proceedings on the website. We very much welcome presentation abstracts about work already published elsewhere, or giving an overview of an existing system, and the format is designed not to preclude future publication. Submissions should be in ACM SIGPLAN two-column format (see https://urldefense.com/v3/__https://www.sigplan.org/Resources/Author/__;!!IBzWLUs!HmqsYJYXDznReZsbtAFkFebx5rExpyRyvs96lEzjos_2GrgoNFg_mLUAgcpTuLSir0j7-sERXKsULQ$ ). References are not counted in the page limits. If you have any questions or wonder whether your submission is in scope, please do not hesitate to contact the organizers. More information: https://urldefense.com/v3/__https://2022.programming-conference.org/track/proweb-2022-papers__;!!IBzWLUs!HmqsYJYXDznReZsbtAFkFebx5rExpyRyvs96lEzjos_2GrgoNFg_mLUAgcpTuLSir0j7-sGhJhwCEA$ ** Important dates (AoE) ** - Submission deadline: 1st February 2022 - Author notification: 1st March 2022 - Camera-ready version: 1st May 2022 ** Organizers ** - Quentin Sti?venart, Vrije Universiteit Brussel (VUB), Belgium ( quentin.stievenart at gmail.com) ** Program Committee ** TBD -------------- next part -------------- An HTML attachment was scrubbed... URL: From m.huisman at utwente.nl Mon Dec 20 06:10:17 2021 From: m.huisman at utwente.nl (Huisman, Marieke (UT-EEMCS)) Date: Mon, 20 Dec 2021 11:10:17 +0000 Subject: [TYPES/announce] First call for papers: FMICS 2022: Formal Methods for Industrial Critical Systems Message-ID: <591CF409-E97D-494B-B22B-014AF7BB2424@utwente.nl> Call for Papers FMICS 2022: Formal Methods for Industrial Critical Systems The aim of the FMICS conference series is to provide a forum for researchers who are interested in the development and application of formal methods in industry. FMICS brings together scientists and engineers who are active in the area of formal methods and interested in exchanging their experiences in the industrial usage of these methods. The FMICS conference series also strives to promote research and development for the improvement of formal methods and tools for industrial applications. FMICS (https://urldefense.com/v3/__http://fmics.inria.fr__;!!IBzWLUs!DcV-1Gdc-_uL0htIwKWbkUG6K1wos3DenUhjdWjRU0PthYtulmvK84MXVRFy5bXnSBufTVcM6aZGkQ$ ) is the ERCIM Working Group conference on Formal Methods for Industrial Critical Systems. FMICS is the key conference in the intersection of industrial applications and Formal Methods. This year's conference is the 27th in the series. FMICS will be held as part of CONFEST 2022 (https://urldefense.com/v3/__https://confest2022.mimuw.edu.pl/__;!!IBzWLUs!DcV-1Gdc-_uL0htIwKWbkUG6K1wos3DenUhjdWjRU0PthYtulmvK84MXVRFy5bXnSBufTVf8AR7IjA$ ). Topics Topics of interest include (but are not limited to): * Case studies and experience reports on industrial applications of formal methods, focusing on lessons learned or identification of new research directions. * Methods, techniques and tools to support automated analysis, certification, debugging, descriptions, learning, optimisation and transformation of complex, distributed, real-time, embedded, mobile and autonomous systems. * Verification and validation methods (model checking, theorem proving, SAT/SMT constraint solving, abstract interpretation, etc.) that address shortcomings of existing methods with respect to their industrial applicability (e.g., scalability and usability issues). * Impact of the adoption of formal methods on the development process and associated costs. Application of formal methods in standardisation and industrial forums. New this year! Special track papers on Formal Methods for Responsible AI We invite submissions in topics related to the use of formal methods for responsible AI, addressing challenges such as: * How can formal verification and analysis be used to make AI more trustworthy? * What kind of properties need to be guaranteed to make AI trustworthy? * And are existing formal analysis techniques powerful enough to provide the necessary guarantees for trustworthy AI? For this occasion, the Program Committee has been enlarged with people that have expertise on the use of formal methods for AI. Formatting instructions and the review procedure are the same as the ones for regular papers. However, the authors will need to specifically indicate their interest in the special track during the submission. Papers accepted for the special track will be included in a special session at FMICS 2021 along with a panel on this topic, while they will be published in the conference proceedings together with papers accepted for the regular track. Submission and Publication We welcome contributions of different categories: * Regular papers, regular tool papers, case study papers and experience reports that describe original research work and results. Length: 15 pages, excluding references. * Short papers that describe work-in-progress, or positions on the future of formal methods. Length: 6 pages, excluding references. * Short tool papers that describe software artefacts. Length: 6 pages, excluding references. Submitted papers must not have previously appeared in a journal or conference with published proceedings and must not be concurrently submitted to any other peer-reviewed workshop, symposium, conference or journal. Any partial overlap with any such published or concurrently submitted paper must be clearly indicated. Submissions should clearly motivate relevance to industrial application. Case-study papers and experience reports should identify lessons learned, validate theoretical results (such as scalability of methods) or provide specific motivation for further research and development. Submissions should be formatted according to the LNCS style (Springer). All submissions will be reviewed by the Programme Committee members who will make a selection among the submissions based on the novelty, soundness and applicability of the presented ideas and results. Papers must be written in English and should be submitted as Portable Document Format (PDF) files using the EasyChair submission site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=fmics2022__;!!IBzWLUs!DcV-1Gdc-_uL0htIwKWbkUG6K1wos3DenUhjdWjRU0PthYtulmvK84MXVRFy5bXnSBufTVfNO85MjA$ The conference proceedings will be published by Springer in the LNCS series. Authors should consult Springer?s authors guidelines and use their proceedings templates, either for LaTeX or for Word, for the preparation of their papers. Springer encourages authors to include their ORCIDs in their papers. In addition, the corresponding author of each accepted paper, acting on behalf of all of the authors of that paper, must complete and sign a Consent-to-Publish form. The corresponding author signing the copyright form should match the corresponding author marked on the paper. Once the files have been sent to Springer, changes relating to the authorship of the papers cannot be made. At least one author of each accepted paper is expected to present the paper at the conference as a registered participant. We will present an FMICS 2022 Best Paper Award selected by the Program Committee, sponsored by Springer. The Program Committee of FMICS 2022 will also invite a selection of accepted papers and tools to submit extended versions to a special issue of Science of Computer Programming (SCP). Concerning the COVID-19 Pandemic Given the ongoing pandemic situation, the CONFEST 2022 organizers have the following plan: * The conferences will be advertised as physical, in-person events. * We will provide support for remote presence, both for speakers and for other participants who are unable or unwilling to come. * We will not require any explanation from registered participants as to why they do not wish to come in person. Depending on the pandemic situation, we may have to make a decision whether to cancel the physical component of the event or not. This decision will be made by the end of June 2022 based on a quick survey of the authors of accepted papers, asking them whether they are willing to come. Important Dates * Abstract submission: May 5, 2022 * Paper submission: May 12, 2022 (23:59:59 AoE) * Author notification: June 24, 2022 * Camera-ready version: July 5, 2022 * Conference: September 14-16, 2022 PC Chairs * Jan Friso Groote, Eindhoven University of Technology, Netherlands * Marieke Huisman, University of Twente, Netherlands Keynote * Sven Schewe, University of Liverpool PC members * ??Erika Abraham, RWTH Aachen University, DE * Maurice ter Beek, ISTI-CNR, IT * Simon Bliudze, INRIA, FR * Rafael C. Cardoso, University of Manchester, UK * Milan Ceska, Brno University of Technology, CZ * Hubert Garavel, INRIA, FR * Jan Friso Groote, Eindhoven University of Technology, NL (co-chair) * Ernst Moritz Hahn, University of Twente, NL * Paula Herber, University of M?nster, DE * Marieke Huisman, University of Twente, NL (co-chair) * Peter H?fner, Australian National University, AU * Nikolai Kosmatov, CEA List, FR * Alfons Laarman, Leiden University, NL * Peter Gorm Larsen, Aarhus University, DK * Istvan Majzik, Budapest University of Technology and Economics, HU * Rosemary Monahan, Maynooth University, IE * Thomas Neele, Eindhoven University of Technology, NL * Wytse Oortwijn, TNO, NL * Pawe? Parys, University of Warsaw, PO * Wojciech Penczek, Institute of Computer Science of PAS, PO * Jaco van de Pol, Aarhus University, DK * Marco Roveri, DISI, IT * Kristin Yvonne Rozier, Iowa State University, US * Cristina Seceleanu, M?lardalen University, SE * Martina Seidl, Johannes Kepler University Linz, AU * Jiri Srba, Aalborg University, DK * Alexander J. Summers, University of British Columbia, US * Ashutosh Trivedi, University of Colorado Boulder, US * Elena Troubitsyna, KTH, SE * Nina Yevtushenko, Tomsk State University, RU * Naijun Zhan, Institute of Software, Chinese Academy of Sciences, CH Steering Committee * Maurice ter Beek, ISTI-CNR, IT * Alessandro Fantechi, University of Florence, IT * Hubert Garavel, INRIA, FR * Tiziana Margaria, Univ. of Limerick and LERO, IE * Radu Mateescu, INRIA, FR * Jaco van de Pol, Aarhus University, DK -------------- next part -------------- An HTML attachment was scrubbed... URL: From p.gardner at imperial.ac.uk Mon Dec 20 15:03:35 2021 From: p.gardner at imperial.ac.uk (Gardner, Philippa A) Date: Mon, 20 Dec 2021 20:03:35 +0000 Subject: [TYPES/announce] Permanent academic positions, Imperial College London Message-ID: Hello all, We have our usual yearly round of general lectureship (assistant professor) positions at the Department of Computing at Imperial: deadline **4th January**. We have four positions; the added flexibility of many positions usually helps the PL/analysis subjects. In addition, we have 13 (!) lectureship positions which have just been advertised at the recently created Imperial-X, deadline **17th January and 28th February** (I do not understand the two deadlines, I would aim for the first if you can to dovetail with the other Department positions). The purpose of Imperial-X is to create new ways of working between academia and industry, across Departments, with inevitably a focus on AI. We count as AI (!), in that there is the virtual SaSSy Initiative on the safety and security of our modern software systems, underpinned by rigorous design, specification, testing and verification. This is happening very quickly. If anyone wishes to find out more about the SaSSy Initiative, please contact me or any of the SaSSy academics. Even if you are not so interested in Imperial-X but are interested in a more traditional position, please look at the SaSSy initiative as it lists in one place the awesome academics that we have at Imperial, working on AL/PL/analysis/security, spanning theory and practice, with substantial connections to industry. Best wishes, Philippa -------------- next part -------------- An HTML attachment was scrubbed... URL: From F.Vaandrager at cs.ru.nl Tue Dec 21 02:54:36 2021 From: F.Vaandrager at cs.ru.nl (Frits Vaandrager) Date: Tue, 21 Dec 2021 08:54:36 +0100 Subject: [TYPES/announce] Assistant Professor of Software Technology (tenure track) at Radboud University Message-ID: Assistant Professor of Software Technology (tenure track) Employment: 0.8 - 1.0 FTE Faculty of Science, Radboud University, Nijmegen, The Netherlands Application deadline: 20 January 2022 To strengthen and expand the research of the Software Science (SWS https://urldefense.com/v3/__https://www.sws.cs.ru.nl/__;!!IBzWLUs!Ctp-a1YNu1DPuzxrCZ-uKDa9FO1CzOCdiC7BKIwzRwhplM1sNYA3oYm-47ZA8ggLwgL3QeRRr5gGWA$ ) group, we seek a Tenure-track Assistant Professor of Software Technology who will focus on applications and transfer of academic results to industry/society. You will have the opportunity to develop your own research line in the context of the SWS group's future activities. You will be expected to supervise a number of PhD candidates and to teach Bachelor's degree courses in Computer Science (e.g. Software Engineering and New Devices Lab) and Master's degree courses in Software Science. You will also actively contribute to the supervision of Bachelor's and Master's projects and will be involved in organisational tasks within the institute. All teaching is in English. The position is available in the Software Science (SWS https://urldefense.com/v3/__https://www.sws.cs.ru.nl/__;!!IBzWLUs!Ctp-a1YNu1DPuzxrCZ-uKDa9FO1CzOCdiC7BKIwzRwhplM1sNYA3oYm-47ZA8ggLwgL3QeRRr5gGWA$ ) group of the Institute for Computing and Information Sciences (iCIS https://urldefense.com/v3/__https://www.ru.nl/icis/__;!!IBzWLUs!Ctp-a1YNu1DPuzxrCZ-uKDa9FO1CzOCdiC7BKIwzRwhplM1sNYA3oYm-47ZA8ggLwgL3QeTWssoNzA$ ) at Radboud University. The mission of the SWS group is to conduct world-leading research on the use of models for design and analysis of software.? The group is well-known for work on model-based software engineering, model learning, model-based testing, model checking, combining formal verification and machine learning, functional programming and HPC/array computing, proof assistants, and mathematical foundations. We find it important (and inspiring!) to cover the full spectrum from theory to applications in a single research group. Through collaboration with stakeholders from industry and society, we obtain a better understanding of when and how software science can help to solve real-world problems. Thus we have joint projects with, for instance, Canon Production Printing, ASML, Alfa Laval, Philips Healthcare, Google, Intel, the Netherlands Defence Academy (NLDA), and our spin-off TOP Software Technology. For questions about the position, please contact Prof. Frits Vaandrager, F.Vaandrager at cs.ru.nl. Head of Department of Software Science Practical information and applications: https://urldefense.com/v3/__https://www.ru.nl/werken-bij/vacature/details-vacature/?recid=1180004__;!!IBzWLUs!Ctp-a1YNu1DPuzxrCZ-uKDa9FO1CzOCdiC7BKIwzRwhplM1sNYA3oYm-47ZA8ggLwgL3QeS7XKgJsw$ From giorgio.audrito at unito.it Tue Dec 21 04:09:00 2021 From: giorgio.audrito at unito.it (Giorgio Audrito) Date: Tue, 21 Dec 2021 10:09:00 +0100 Subject: [TYPES/announce] DisCoTec 2022: FINAL CALL for Workshops and Tutorial [deadline today] In-Reply-To: References: Message-ID: ***************************************************************************** First Call for Satellite Events Proposals: Workshops and Tutorials 17th International Federated Conference on Distributed Computing Techniques DisCoTec 2022 Lucca, Italy, 13-17 June 2022 https://urldefense.com/v3/__https://www.discotec.org/2022__;!!IBzWLUs!DIbh5yc8Q75RwBMWUuu0p66ViczBaearQmE2I7aUFCPlEYkp-ZqxL-EViR1r5-8v8ABMlrr_6kxcEA$ ***************************************************************************** DisCoTec 2022 is one of the major events sponsored by the International Federation for Information Processing (IFIP) and the European Association for Programming Languages and Systems (EAPLS). It gathers conferences and workshops that cover a broad spectrum of distributed computing subjects ? from theoretical foundations and formal description techniques, testing and verification methods, to language design and system implementation approaches. Pre-conference workshops and tutorials will take place on Monday, June 13, 2022, and post-conference workshops on Friday, June 17, 2022. Submissions of workshop proposals must reach the workshop chairs by December 21, 2021. * Workshops * The DisCoTec 2022 organising committee solicits proposals for workshops to provide a vivid and open forum for discussions among active researchers on topics related to the distributed computing field. The aim is to facilitate the exchange of ideas and experiences via presentations of preliminary research results and ongoing works, as well as presentations of research work to a focussed audience. A workshop associated with DisCoTec 2022 can be one-day or half-day in length. Workshop registration will be done together with the main conferences, allowing workshop-only registrations as well. A workshop proposal must include the following information: - name of the workshop - contact information of the Workshop Chair(s) - brief description of the aim and scope of the workshop (max. 500 words) - tentative Program and Organization Committees, if available - number of (expected) submissions and/or attendees - history of the workshop, if any, including the numbers of submissions, accepted papers, and attendees of the last edition - any other relevant information (e.g., invited speakers, panels) Important dates (for all workshops): - December 21, 2021: Workshop proposal submission deadline - December 27, 2021: Notification of accepted workshop proposals - Mid April 2022: Workshop paper submission deadline - Mid May 2022: Notification of accepted workshop papers - June 13 and 17, 2022: Workshops The submission and notification deadlines of the workshops are at the discretion of the individual workshop chairs. However, the notification must be no later than the early registration deadline for DisCoTec 2022 (to be announced). Workshop proposals can be submitted to the Workshop Chair via the following form: https://urldefense.com/v3/__https://forms.gle/TDAfKLT7q6rHvveM7__;!!IBzWLUs!DIbh5yc8Q75RwBMWUuu0p66ViczBaearQmE2I7aUFCPlEYkp-ZqxL-EViR1r5-8v8ABMlrr2PO5fxQ$ * Tutorials * The DisCoTec 2022 organising committee encourages proposals for tutorials to complement the program of the main conferences and co-located workshops. The scope of a tutorial should focus on emerging topics and aspects of the distributed computing field, ranging from new practical techniques and technologies to lessons learnt from projects and industry experiences. No marketing or product-specific tutorials will be accepted. A tutorial associated with DisCoTec 2022 can be short (1 session lasting up to 1.5 hours) or long (2 sessions lasting up to 3 hours in total). Tutorials will be included in both full and workshop-only registrations. A tutorial proposal must include the following information: - title of the tutorial - contact information and short bio of the tutorial speaker(s) - brief description of the aim and scope of the tutorial (max. 500 words) - brief discussion about why the tutorial topic is relevant to the DisCoTec community (max. 200 words) - intended audience (academics, students, practitioners, etc.) - any prior experience for the speaker(s) giving this or related tutorial Important dates (for all tutorials): - February 28, 2022: Tutorial proposal submission deadline - March 07, 2022: Notification of accepted workshop proposals - June 13, 2022: Tutorials Tutorial proposals can be submitted to the Workshops and Tutorials Chair via the following form: https://urldefense.com/v3/__https://forms.gle/U8Ki5rQEYZJCjB7C8__;!!IBzWLUs!DIbh5yc8Q75RwBMWUuu0p66ViczBaearQmE2I7aUFCPlEYkp-ZqxL-EViR1r5-8v8ABMlrqgyehyjA$ * Proposal Evaluation Criteria * - Interest and relevance for the DisCoTec community - Impact of the topic - The novelty with respect to other workshops and tutorials - Experience of the proposer(s) - Quality of the proposal * DisCoTec 2022 Workshops and Tutorials Chair * Francesco Tiezzi (University of Florence, IT) * COVID-19 pandemic * DisCoTec 2022 is planned as a physical, in-person event, with certain support for remote presence, both for speakers and for other participants who are unable or unwilling to come. Depending on the pandemic situation, we may have to make a decision whether to cancel the physical component of the event or not. * Further Information * For further information please contact the Workshops and Tutorials Chair at . To receive live, up-to-date information, follow us on Twitter @DisCoTecConf. -------------- next part -------------- An HTML attachment was scrubbed... URL: From havelund at gmail.com Tue Dec 21 10:59:08 2021 From: havelund at gmail.com (Klaus Havelund) Date: Tue, 21 Dec 2021 07:59:08 -0800 Subject: [TYPES/announce] NFM 2022 - FINAL CALL FOR PAPERS Message-ID: NFM 2022 ? FINAL CALL FOR PAPERS The 14th NASA Formal Methods Symposium https://urldefense.com/v3/__https://nfm2022.caltech.edu__;!!IBzWLUs!FS-IzUOJyKQyoKx034C9mMvu2Z7A18z9MLlB2RljVDaCDjfbbCThPjDOJiv4W5nqt9oeHy5CWamKZw$ May 24-27, 2022 Pasadena, California, USA *** EXTENDED SUBMISSION DEADLINE: January 10, 2022 *** The symposium is planned to be held in person at California Institute of Technology, but potentially transitioning to fully virtual if the COVID situation persists. Virtual presentations will be possible even if the conference is held in-person. The symposium has NO registration fee for presenting and attending. IMPORTANT DATES - Abstract Submission: January 3, 2022 *** extended *** - Paper Submission: January 10, 2022 *** extended *** - Paper Notifications: February 28, 2022 - Camera-ready Papers: March 28, 2022 - Symposium: May 24-27, 2022 THEME OF SYMPOSIUM The widespread use and increasing complexity of mission-critical and safety-critical systems at NASA and in the aerospace industry requires advanced techniques that address these systems' specification, design, verification, validation, and certification requirements. The NASA Formal Methods Symposium (NFM) is a forum to foster collaboration between theoreticians and practitioners from NASA, academia, and industry. NFM's goals are to identify challenges and to provide solutions for achieving assurance for such critical systems. The focus of the symposium will be on formal/rigorous techniques for software assurance, including their theory, current capabilities and limitations, as well as their potential application to aerospace during all stages of the software life-cycle. The NASA Formal Methods Symposium is an annual event organized by the NASA Formal Methods (NFM) Research Group, composed of researchers spanning six NASA centers. The organization of NFM 2022 is being led by the Jet Propulsion Laboratory (JPL), located in Pasadena, California. INVITED TALKS AND TUTORIALS - Dines Bjoerner, Technical University of Denmark, Denmark - Edwin Brady, University of St. Andrews, UK - Steve Chien, NASA Jet Propulsion Laboratory, USA - Ankush Desai, Amazon Web Services, USA - Daniel Jackson, MIT, USA - Julia Lawall, INTIA Paris, France - Anastasia Mavridou, KBR Inc / NASA Ames Research Center, USA - Leonardo De Moura, Microsoft Research, USA - Sriram Sankaranarayanan, University of Colorado Boulder, USA - Alex Summers, University of British Columbia, Canada - Emina Torlak, University of Washington, USA TOPICS ON INTEREST Topics of interest include, but are not limited to, the following aspects of formal methods: Advances in formal methods - Interactive and automated theorem proving - SMT and SAT solving - Model checking - Static analysis - Runtime verification - Automated testing - Specification languages, textual and graphical - Refinement - Code synthesis - Design for verification and correct-by-design techniques - Requirements specification and analysis Integration of formal methods techniques - Integration of diverse formal methods techniques - Use of machine learning and probabilistic reasoning techniques in formal methods - Integration of formal methods into software engineering practices. - Combination of formal methods with simulation and analysis techniques - Formal methods and fault tolerance, resilient computing, and self healing systems - Formal methods and graphical modeling languages such as SysML, UML, MATLAB/Simulink - Formal methods and autonomy, e.g., verification of systems and languages for planning and scheduling (PDDL, Plexil, etc.), self-sufficient systems, and fault-tolerant systems. Formal methods in practice - Experience reports of application of formal methods on real systems, such as autonomous systems, safety-critical systems, concurrent and distributed systems, cyber-physical, embedded, and hybrid systems, fault-detection, diagnostics, and prognostics systems, and human-machine interaction analysis. - Use of formal methods in systems engineering (including hardware components) - Use of formal methods in education - Reports on negative results in the development and the application for formal methods in practice. - Usability of formal method tools, and their infusion into industrial contexts. - Challenge problems for future reference by the formal methods community. The formulation of these papers can range from plain English description of a problem over formal specifications, to specific implementations in a programming language. NASA OPEN SOURCE Courageous authors, who want to delve in open source software being applied in real NASA missions, and find possible connections to and applications of Formal Methods, are invited to visit the open source repositories for the following two frameworks for programming flight software: - F' (https://urldefense.com/v3/__https://nasa.github.io/fprime/__;!!IBzWLUs!FS-IzUOJyKQyoKx034C9mMvu2Z7A18z9MLlB2RljVDaCDjfbbCThPjDOJiv4W5nqt9oeHy5NY3o17w$ ) - cFS (https://urldefense.com/v3/__https://cfs.gsfc.nasa.gov/__;!!IBzWLUs!FS-IzUOJyKQyoKx034C9mMvu2Z7A18z9MLlB2RljVDaCDjfbbCThPjDOJiv4W5nqt9oeHy5c9zZftA$ ) SUBMISSIONS There are two categories of submissions: - Regular papers describing fully developed work and complete results (maximum 15 pages, excluding references); - Short papers on tools, experience reports, or work in progress with preliminary results (maximum 6 pages, excluding references). Additional appendices can be submitted as supplementary material for reviewing purposes. They will not be included in the proceedings. All papers must be in English and describe original work that has not been published. All submissions will be reviewed by at least three members of the Program Committee. Reviewing is Single-blind. We encourage authors to focus on readability of their submissions. Papers will appear in the Formal Methods subline of Springer's Lecture Notes in Computer Science (LNCS) and must use LNCS style formatting ( https://urldefense.com/v3/__https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines__;!!IBzWLUs!FS-IzUOJyKQyoKx034C9mMvu2Z7A18z9MLlB2RljVDaCDjfbbCThPjDOJiv4W5nqt9oeHy7KaQN6GQ$ ). Papers must be submitted in PDF format at the EasyChair submission site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=nfm2022__;!!IBzWLUs!FS-IzUOJyKQyoKx034C9mMvu2Z7A18z9MLlB2RljVDaCDjfbbCThPjDOJiv4W5nqt9oeHy4_TxMytw$ . Authors of selected best papers will be invited to submit an extended version to a special issue in Springer's Innovations in Systems and Software Engineering: A NASA Journal (https://urldefense.com/v3/__https://www.springer.com/journal/11334__;!!IBzWLUs!FS-IzUOJyKQyoKx034C9mMvu2Z7A18z9MLlB2RljVDaCDjfbbCThPjDOJiv4W5nqt9oeHy7118kR1g$ ). ARTIFACTS Authors are encouraged, but not strictly required, to submit artifacts that support the conclusions of their work (if allowed by their institutions). Artifacts may contain software, mechanized proofs, benchmarks, examples, case studies and data sets. Artifacts will be evaluated by the Program Committee together with the paper. ORGANIZERS PC chairs - Klaus Havelund, JPL, USA - Jyo Deshmukh, USC, USA - Ivan Perez, NIA, USA Application Advisors - Robert Bocchino, JPL, USA - John Day, JPL, USA - Maged Elasaar, JPL, USA - Amalaye Oyake, Blue Origin, USA - Nicolas Rouquette, JPL, USA - Vandi Verma, JPL, USA Application advisors advise the PC chairs to ensure a strong connection to the problems facing NASA. Local Organizer - Richard Murray, Caltech, USA Scientific Advisor - Mani Chandy, Caltech, USA Program Committee - Aaron Dutle, NASA, USA - Alessandro Cimatti, Fondazione Bruno Kessler, Italy - Anastasia Mavridou, SGT Inc. / NASA Ames Research Center, USA - Anne-Kathrin Schmuck, Max-Planck-Institute for Software Systems, Germany - Arie Gurfinkel, University of Waterloo, Canada - Bardh Hoxha, Toyota Research Institute North America, USA - Bernd Finkbeiner, CISPA Helmholtz Center for Information Security, Germany - Betty H.C. Cheng, Michigan State University, USA - Borzoo Bonakdarpour, Michigan State University, USA - Carolyn Talcott, SRI International, USA - Chuchu Fan, MIT, USA - Constance Heitmeyer, Naval Research Laboratory, USA - Corina Pasareanu, CMU, NASA, KBR, USA - Cristina Seceleanu, M?lardalen University, Sweden - Dejan Nickovic, Austrian Institute of Technology AIT, Austria - Dirk Beyer, LMU Munich, Germany - Doron Peled, Bar Ilan University, Israel - Erika Abraham, RWTH Aachen University, Germany - Ewen Denney, NASA, USA - Gerard Holzmann, Nimble Research, USA - Giles Reger, The University of Manchester, UK - Huafeng Yu, TOYOTA InfoTechnology Center USA, USA - Jean-Christophe Filliatre, CNRS, France - Johann Schumann, NASA, USA - John Day, Jet Propulsion Laboratory, USA - Julia Badger, NASA, USA - Julien Signoles, CEA LIST, France - Kerianne Hobbs, Air Force Research Laboratory, USA - Kristin Yvonne Rozier, Iowa State University, USA - Leonardo Mariani, University of Milano Bicocca, Italy - Lu Feng, University of Virginia, USA - Marcel Verhoef, European Space Agency, The Netherlands - Marie Farrell, Maynooth University, Ireland - Marieke Huisman, University of Twente, The Netherlands - Marielle Stoelinga, University of Twente, The Netherlands - Martin Feather, Jet Propulsion Laboratory, USA - Martin Leucker, University of Luebeck, Germany - Michael Lowry, NASA, USA - Misty Davies, NASA, USA - Natasha Neogi, NASA, USA - Nicolas Rouquette, Jet Propulsion Laboratory, USA - Nikos Arechiga, Toyota Research Institute, USA - Rajeev Joshi, Amazon Web Services, USA - Stanley Bak, Stony Brook University, USA - Sylvie Boldo, INRIA, France - Vandi Verma, NASA, USA - Willem Visser, Amazon Web Services, USA CONTACT Email: nfm2022 [at] easychair [dot] org -------------- next part -------------- An HTML attachment was scrubbed... URL: From vmvasconcelos at fc.ul.pt Wed Dec 22 04:45:47 2021 From: vmvasconcelos at fc.ul.pt (Vasco Thudichum Vasconcelos) Date: Wed, 22 Dec 2021 09:45:47 +0000 Subject: [TYPES/announce] Postdoc position at the University of Lisbon Message-ID: <8F1484AC-4182-49C7-8DA9-9CF52D389218@ciencias.ulisboa.pt> University of Lisbon -- One Post Doctoral Research Fellowship We are looking to fill one post-doctoral research fellowship in the area of programming languages, type systems and logics. The position is funded by the research project "SafeSessions - Safe Concurrent Programming with Session Types", https://urldefense.com/v3/__https://www.lasige.pt/project/safesessions/__;!!IBzWLUs!A2S_14d2AW5szG565PdsS_-WGxz9tgiyFXWyJtiRYtTTta3AONbI602l85wghr-phhaVjb_UCBGYxw$ . We seek applicants with strong interest in some of the following topics: programming language design and implementation, logics and types, concurrency and distribution. Applicants should hold a PhD degree in Computer Science or related area. The position is funded by the Foundation for Science and Technology for an initial period of 12 months, renewable until the end of the project (February 29, 2024 or six months thereafter). Applications are open until February 15, 2022. The complete offer description can be found at https://urldefense.com/v3/__https://www.euraxess.pt/jobs/721789__;!!IBzWLUs!A2S_14d2AW5szG565PdsS_-WGxz9tgiyFXWyJtiRYtTTta3AONbI602l85wghr-phhaVjb8bu0XBiQ$ . Further information can be obtained from lasige-candidaturas at listas.di.ciencias.ulisboa.pt. Applicants are encouraged to contact Professor Vasco T. Vasconcelos directly. About the University of Lisbon and the LASIGE research lab The University of Lisbon (ULisboa) is the largest university in Portugal and a leading one within wider Europe. Comprising eighteen faculties, ULisboa offers 400 degree programmes at undergraduate and postgraduate level. Each year it accepts more than 5,000 international students ? around 10% of its total cohort ? who represent 100 different countries. ULisboa leads the main international rankings, is amongst the 200 best universities worldwide according to the 2019 Shanghai Ranking. LASIGE, https://urldefense.com/v3/__https://www.lasige.pt__;!!IBzWLUs!A2S_14d2AW5szG565PdsS_-WGxz9tgiyFXWyJtiRYtTTta3AONbI602l85wghr-phhaVjb-lI63vlA$ , is a research unit at ULisboa evaluated as Excellent by the Portuguese Science Agency (FCT) in 2018, with a perfect score of 15 points. LASIGE closely mentors more than 100 young researchers (at masters, doctoral, and post-doctoral level), continually stimulating excellence in research. LASIGE members teach MSc and PhD level courses in Computer Science and Engineering (CSE) at ULisboa, regularly publish in top venues, and enjoy top-notch bibliometric indices. LASIGE runs a large number of international projects, boasts three spin-offs, and multiple technology transfers. The high-level research conducted at LASIGE, the scientific background and international projection of its group leaders, the academic and industrial network to which it belongs, and the experience in advanced training of its members makes LASIGE the perfect research unit to work as a postdoc. If this was not enough, the city of Lisbon offers history and culture, shopping, restaurants, nearby beaches and a vibrant nightlife. From sebastien.bardin at cea.fr Wed Dec 22 09:37:37 2021 From: sebastien.bardin at cea.fr (=?Windows-1252?Q?BARDIN_S=E9bastien?=) Date: Wed, 22 Dec 2021 14:37:37 +0000 Subject: [TYPES/announce] =?windows-1252?q?PhD_and_postdoc_positions_at_U?= =?windows-1252?q?niversit=E9_Paris-Saclay=2C_CEA_List_institute=2C_France?= =?windows-1252?q?=2C_in_Advanced_Program_Analysis_for_Software_Security?= Message-ID: The BINSEC team (https://urldefense.com/v3/__https://binsec.github.io/__;!!IBzWLUs!CMjGi_C3VMplAl-GA7VN6dpwnuOZ_yM50eEvYtbVWyfoMzjZT5W4UVs-D_tugvcwHig_JyaX2NKdpg$ ) opens two PhD and one postdoc positions to work with Micha?l Marcozzi and S?bastien Bardin on automatic detection and prevention advanced software vunerabilities. . Start: as soon as possible in 2022. Duration: 3 years (PhD), 2 years (postdoc). . Keywords: binary-level security, program analysis, formal methods, symbolic execution, static analysis, fuzzing, speculation https://urldefense.com/v3/__https://binsec.github.io/jobs/2021/12/03/phd-postdoc-offer.html__;!!IBzWLUs!CMjGi_C3VMplAl-GA7VN6dpwnuOZ_yM50eEvYtbVWyfoMzjZT5W4UVs-D_tugvcwHig_Jya5MmGAnw$ == ABOUT US OUR TEAM - The BINary-level SECurity research group (BINSEC) is a dynamic team of 9 junior and 4 senior researchers. The group has frequent publications in top-tier security, formal methods and software engineering conferences. We work in close collaboration with other French and international research teams, industrial partners and national agencies. The team is part of Universit? Paris-Saclay, the world?s 13th and European Union?s 1st university, according to the Shanghai ARWU Ranking in 2021. OUR WORK - The team has high-level expertise in several binary code analysis approaches, namely symbolic execution, abstract interpretation and fuzzing. We apply these techniques to improve software security at the binary level, covering notably vulnerability detection, code (de)obfuscation and formal verification. See our website at https://urldefense.com/v3/__https://binsec.github.io/__;!!IBzWLUs!CMjGi_C3VMplAl-GA7VN6dpwnuOZ_yM50eEvYtbVWyfoMzjZT5W4UVs-D_tugvcwHig_JyaX2NKdpg$ for additional information. == JOB OFFERS * a Ph.D position (3 years) in complex software vulnerability detection through greybox and hybrid fuzzing * a Ph.D position (3 years) in formal verification of security properties against micro-architectural attacks * a postdoc position (2 years) in software vulnerability detection in IoT systems through static analysis, fuzzing, symbolic execution and/or machine learning Under the supervision of our senior researchers, you will be expected to solve research problems, implement your solutions into evaluated prototypes, publish at top conferences and journals, mentor students and broadly participate in the scientific life of the team. All positions comprises both theoretical work and coding. You will be able to dedicate a small fraction of your time to teaching if you want so. Our former team members have been able to secure stimulating positions in academia or industry and we will support you in advancing your career. == APPLICATION Candidates should send a CV, a cover letter, and other information (see the link below) to binsec-jobs at saxifrage.saclay.cea.fr as soon as possible (and at the latest by January 2022). Applications will be reviewed immediately as they arrive (first come, first served). The positions are expected to start as soon as possible in 2022 (upon completion of all administrative requirements). https://urldefense.com/v3/__https://binsec.github.io/jobs/2021/12/03/phd-postdoc-offer.html__;!!IBzWLUs!CMjGi_C3VMplAl-GA7VN6dpwnuOZ_yM50eEvYtbVWyfoMzjZT5W4UVs-D_tugvcwHig_Jya5MmGAnw$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From michael at greenberg.science Wed Dec 22 09:41:38 2021 From: michael at greenberg.science (Michael Greenberg) Date: Wed, 22 Dec 2021 09:41:38 -0500 Subject: [TYPES/announce] PhD positions at Stevens in PL and Systems Message-ID: The Cypress group at Stevens is recruiting PhD students. With eight research faculty, we do a broad range of theoretical and practical work. Eric Koskinen, Dave Naumann, and I will be particularly of interest to the TYPES crowd, but people like Tegan Brennan, Georgios Portokalidis, and Jun Xu work on adjacent PL/SE/security/systems topics. https://urldefense.com/v3/__https://www.cs.stevens.edu/cypress/people/__;!!IBzWLUs!BFwPKYyax6Ai8OJEM4UazeUOF_lVKWwm_2NBJLa2ljqjPG0O0Q6C5twd-zRIbNk7x0VQe5U3ZU8zIw$ https://urldefense.com/v3/__http://www.weaselhat.com/2021/09/17/im-looking-for-phd-students/__;!!IBzWLUs!BFwPKYyax6Ai8OJEM4UazeUOF_lVKWwm_2NBJLa2ljqjPG0O0Q6C5twd-zRIbNk7x0VQe5VP3mxvBA$ Stevens is in Hoboken, NJ, directly across the Hudson from New York City. Applications are reviewed on a rolling basis. https://urldefense.com/v3/__https://gradadmissions.stevens.edu/apply/__;!!IBzWLUs!BFwPKYyax6Ai8OJEM4UazeUOF_lVKWwm_2NBJLa2ljqjPG0O0Q6C5twd-zRIbNk7x0VQe5XpEB-9QQ$ GRE/GMAT can be waived---contact me for more information. From jonathan.brachthaeuser at uni-tuebingen.de Wed Dec 22 10:16:05 2021 From: jonathan.brachthaeuser at uni-tuebingen.de (=?utf-8?Q?Jonathan_Brachth=C3=A4user?=) Date: Wed, 22 Dec 2021 16:16:05 +0100 Subject: [TYPES/announce] =?utf-8?q?Fully_funded_PhD_position_on_the_inte?= =?utf-8?q?rsection_of_PL_and_SE_at_University_of_T=C3=BCbingen=2C_Germany?= Message-ID: <52086E09-410E-48DA-9ECF-C7FFC018018B@uni-tuebingen.de> Are you interested in working at the intersection of programming languages and software engineering? In T?bingen, we are offering a fully funded PhD position for 3 years. Application deadline is Jan. 31st, 2022. We will be working on topics, such as: - type- and effect system ergonomics - algebraic effects and handlers - VMs and just-in-time compilation of algebraic effects - efficient compilation of control effects - and many more ... Full details on the position can be found in the offering: https://urldefense.com/v3/__https://uni-tuebingen.de/universitaet/stellenangebote/newsfullview-stellenangebote/article/phd-position-m-f-d-e-13-tv-l-100/__;!!IBzWLUs!Bnj82HOB7iDP5Kcz6eLH05V29owXR0fMbX5XHd0NkQdLYXdS46OoqgREweC3FUA2U1gvNGekvsO30Q$ We are looking forward to your applications! If you have any questions, feel free to contact me. All the best and a nice holiday season, Jonathan --- Jun. Prof. Dr. Jonathan Immanuel Brachth?user Eberhard Karls University of T?bingen Wilhelm-Schickard Institute (WSI) Software Engineering Sand 13 ? 72076 T?bingen ? Germany E-Mail: jonathan.brachthaeuser at uni-tuebingen.de Web: https://urldefense.com/v3/__https://se.informatik.uni-tuebingen.de__;!!IBzWLUs!Bnj82HOB7iDP5Kcz6eLH05V29owXR0fMbX5XHd0NkQdLYXdS46OoqgREweC3FUA2U1gvNGfakAMqhA$ Tel. +49 - (0) 70 71 - 29 - 75 491 From kmbae at postech.ac.kr Wed Dec 22 11:33:17 2021 From: kmbae at postech.ac.kr (Kyungmin Bae) Date: Thu, 23 Dec 2021 01:33:17 +0900 Subject: [TYPES/announce] Deadline extension: WRLA 2022 -- 14th Int'l Workshop on Rewriting Logic and its Applications Message-ID: --------------------------------------------------------------------------- Call for Papers WRLA 2022 14th International Workshop on Rewriting Logic and its Applications An ETAPS 2022 satellite event, Munich, Germany, April 2-3, 2022 --------------------------------------------------------------------------- IMPORTANT DATES Abstract submission deadline: Jan 4, 2022 (AoE) (extended!) Paper submission deadline: Jan 11, 2022 (AoE) (extended!) Notification: Feb 8, 2022 Conference: April 2-3, 2022 INVITED SPEAKERS Sebastian M?dersheim Technical University of Denmark, Denmark Gwen Sala?n University Grenoble Alpes, France AIMS AND SCOPE Rewriting is a natural model of computation and an expressive semantic framework for concurrency, parallelism, communication, and interaction. It can be used for specifying a wide range of systems and languages in various application domains. It also has good properties as a metalogical framework for representing logics. Several successful languages based on rewriting (ASF+SDF, CafeOBJ, ELAN, Maude) have been designed and implemented. The aim of WRLA is to bring together researchers with a common interest in rewriting and its applications, and to give them the opportunity to present their recent work, discuss future research directions, and exchange ideas. The topics of the workshop include, but are not limited to: A. Foundations and models of rewriting and rewriting logic * termination, confluence, coherence, and complexity * unification, generalization, narrowing, and partial evaluation * constrained rewriting and symbolic algebra * graph rewriting, tree automata, and rewriting strategies * rewriting-based calculi and explicit substitutions B. Rewriting as a logical and semantic framework * uses of rewriting as a logical framework, including deduction modulo * uses of rewriting as a semantic framework for programming languages * rewriting semantics of concurrency models and distributed systems * rewriting semantics of real-time, hybrid, and probabilistic systems * uses of rewriting for compilation and language transformation C. Rewriting languages * rewriting-based declarative languages * type systems for rewriting * implementation techniques * tools supporting rewriting languages D. Verification techniques * confluence, termination, coherence, and sufficient completeness * temporal, modal, and reachability logics for rewrite theories * model checking techniques for rewrite theories * rewriting-based theorem proving * rewriting-based constraint solving and satisfiability * rewriting-semantics-based verification and analysis of programs E. Applications * applications in logic, mathematics, physics, chemistry, and biology * security specification and verification * applications to distributed, network, mobile, and cloud computing * applications to cyber-physical and intelligent systems * applications to model-based software engineering * applications to engineering and planning. PAPER SUBMISSION We solicit submissions of regular papers, tool papers, and work-in-progress papers. Regular papers must contain original contributions, be clearly written, and include appropriate references and comparison with related work. Tool papers have to present a new tool, a new tool component, or novel extensions to an existing tool. Work-in-progress papers present early-stage work or other types of innovative or thought-provoking work. All submissions must be original, unpublished, and not submitted simultaneously for publication elsewhere. Papers must be formatted according to the guidelines for Springer LNCS papers and should not exceed 15 pages (excluding references). Paper submission is done via EasyChair at https://urldefense.com/v3/__https://easychair.org/conferences/?conf=wrla2022__;!!IBzWLUs!EKTxJXFFMm5DXx1bn59lD2EQSoxWqrMlW0_5H4VULHktur6wSBFKsJl4Z5Ms5_2GJdbkuOZUI6g0ZQ$ . PUBLICATION All accepted papers will be presented at the workshop and included in the pre-proceedings, which will be available during the workshop. Following the tradition of the last editions, regular, tool, and invited papers will be published as a volume in Springer's Lecture Notes in Computer Science (LNCS) series to be distributed after the workshop. The authors of a subset of accepted papers will be invited to submit extended versions of their papers to a special issue of the Journal of Logical and Algebraic Methods in Programming (JLAMP). BEST PAPER AWARD The program committee will consider a best paper award (a diploma and 500 euro) for a paper in which at least one author is a junior researcher (a PhD student or the PhD defense was less than two years ago). The PC chair may require the other authors to declare that at least 50% of the contribution was made by the junior researcher. PROGRAM COMMITTEE Erika Abraham RWTH Aachen University, Germany Mar?a Alpuente Universitat Polit?cnica de Val?ncia, Spain Kyungmin Bae (chair) POSTECH, Korea Roberto Bruni Universit? di Pisa, Italy Francisco Dur?n Universidad de M?laga, Spain Santiago Escobar Universitat Polit?cnica de Val?ncia, Spain Maribel Fern?ndez King's College London, United Kingdom Mark Hills East Carolina University, USA Nao Hirokawa JAIST, Japan Alexander Knapp University Augsburg, Germany Temur Kutsia Johannes Kepler University Linz, Austria Alberto Lluch-Lafuente Technical University of Denmark, Denmark Dorel Lucanu Alexandru Ioan Cuza University, Romania Salvador Lucas Universitat Polit?cnica de Val?ncia, Spain Narciso Mart?-Oliet Universidad Complutense de Madrid, Spain Jos? Meseguer University of Illinois at Urbana-Champaign, USA Aart Middeldorp University of Innsbruck, Austria Vivek Nigam Federal University of Para?ba, Brazil Kazuhiro Ogata JAIST, Japan Peter ?lveczky University of Oslo, Norway Adri?n Riesco Universidad Complutense de Madrid, Spain Christophe Ringeissen INRIA, France Camilo Rocha Pontificia Universidad Javeriana, Colombia Vlad Rusu INRIA Lille, France Traian-Florin Serbanuta University of Bucharest, Romania Carolyn Talcott SRI International, USA CONTACT INFORMATION For more information, please contact the organizer kmbae at postech.ac.kr or visit the workshop web page https://urldefense.com/v3/__http://sv.postech.ac.kr/wrla2022__;!!IBzWLUs!EKTxJXFFMm5DXx1bn59lD2EQSoxWqrMlW0_5H4VULHktur6wSBFKsJl4Z5Ms5_2GJdbkuOYAE2uNLw$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From ricardo.h.medel at gmail.com Wed Dec 22 11:54:12 2021 From: ricardo.h.medel at gmail.com (Ricardo Medel) Date: Wed, 22 Dec 2021 13:54:12 -0300 Subject: [TYPES/announce] PhD positions at Stevens in PL and Systems In-Reply-To: References: Message-ID: I got my PhD at Stevens in the 2000's. It's a great small university in a nice city (close to the Big One!) and a great place for working on programming languages, with a relevant community around (great universities & companies very close by), so I recommend it if you are interested. Ricardo Medel linkedin.ricardomedel El mi?, 22 dic 2021 a las 12:04, Michael Greenberg () escribi?: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > The Cypress group at Stevens is recruiting PhD students. With eight > research faculty, we do a broad range of theoretical and practical > work. Eric Koskinen, Dave Naumann, and I will be particularly of > interest to the TYPES crowd, but people like Tegan Brennan, Georgios > Portokalidis, and Jun Xu work on adjacent PL/SE/security/systems > topics. > > > https://urldefense.com/v3/__https://www.cs.stevens.edu/cypress/people/__;!!IBzWLUs!BFwPKYyax6Ai8OJEM4UazeUOF_lVKWwm_2NBJLa2ljqjPG0O0Q6C5twd-zRIbNk7x0VQe5U3ZU8zIw$ > > > https://urldefense.com/v3/__http://www.weaselhat.com/2021/09/17/im-looking-for-phd-students/__;!!IBzWLUs!BFwPKYyax6Ai8OJEM4UazeUOF_lVKWwm_2NBJLa2ljqjPG0O0Q6C5twd-zRIbNk7x0VQe5VP3mxvBA$ > > Stevens is in Hoboken, NJ, directly across the Hudson from New York > City. > > Applications are reviewed on a rolling > basis. > https://urldefense.com/v3/__https://gradadmissions.stevens.edu/apply/__;!!IBzWLUs!BFwPKYyax6Ai8OJEM4UazeUOF_lVKWwm_2NBJLa2ljqjPG0O0Q6C5twd-zRIbNk7x0VQe5XpEB-9QQ$ > GRE/GMAT can be > waived---contact me for more information. > -------------- next part -------------- An HTML attachment was scrubbed... URL: From giorgio.audrito at unito.it Thu Dec 23 13:09:57 2021 From: giorgio.audrito at unito.it (Giorgio Audrito) Date: Thu, 23 Dec 2021 19:09:57 +0100 Subject: [TYPES/announce] COORDINATION 2022 Call For Papers Message-ID: =================================================================== FIRST CALL FOR PAPERS COORDINATION 2022 24th International Conference on Coordination Models and Languages 13-17 June 2022, Lucca, Italy https://urldefense.com/v3/__https://www.discotec.org/2022/coordination__;!!IBzWLUs!AOW50-BvONT91MOPywDfDJz3RsNKLaaxP8JLGJyMiCanyNpOCVgl_RszQM-Wt8GCohhddftgiydVxg$ COORDINATION 2022 is one of the three conferences of DisCoTec 2022 https://urldefense.com/v3/__https://www.discotec.org/2022/__;!!IBzWLUs!AOW50-BvONT91MOPywDfDJz3RsNKLaaxP8JLGJyMiCanyNpOCVgl_RszQM-Wt8GCohhddfuwDiHghA$ =================================================================== === COVID-19 === COORDINATION 2022 is planned as a physical, in-person event, with certain support for remote presence, both for speakers and for other participants who are unable or unwilling to come. Depending on the pandemic situation, we may have to make a decision whether to cancel the physical component of the event or not. === Scope === Modern information systems rely increasingly on combining concurrent, distributed, mobile, adaptive, reconfigurable and heterogeneous components. New models, architectures, languages and verification techniques are necessary to cope with the complexity induced by the demands of today?s software development. Coordination languages have emerged as a successful approach, in that they provide abstractions that cleanly separate behaviour from communication, therefore increasing modularity, simplifying reasoning, and ultimately enhancing software development. Building on the success of the previous editions, this conference provides a well-established forum for the growing community of researchers interested in models, languages, architectures, and implementation techniques for coordination. === Main topics === Topics of interest encompass all areas of coordination, including (but not limited to) coordination related aspects of: - Theoretical models and foundations for coordination: component composition, concurrency, mobility, dynamic, spatial and probabilistic aspects of coordination, logic, emergent behaviour, types, semantics; - Specification, refinement, and analysis of architectures: patterns and styles, verification of functional and non-functional properties, including performance and security aspects; - Dynamic software architectures: distributed mobile code, configuration, reconfiguration, networked computing, parallel, high-performance and cloud computing; - Nature- and bio-inspired approaches to coordination; - Coordination of multi-agent and collective systems: models, languages, infrastructures, self-adaptation, self-organisation, distributed solving, collective intelligence and emerging behaviour; - Coordination and modern distributed computing: web services, peer-to-peer networks, grid computing, context-awareness, ubiquitous computing, mobile computing; - Coordination platforms for infrastructures of emergent new application domains like IoT, fog- and edge-computing; - Cybersecurity aspects of coordinated systems, coordinated approaches to cybersecurity; - Programming methodologies, languages, middleware, tools, and environments for the development and verification of coordinated applications; - Tools, languages and methodologies for secure coordination; - Industrial relevance of coordination and software architectures: programming in the large, domain-specific software architectures and coordination models, case studies; - Interdisciplinary aspects of coordination; - Industry-led efforts in coordination and case studies. === Special topic === We seek contributions that enable the cross-fertilisation with other research communities in computer science or in other engineering or scientific disciplines. Depending on the quality of the contributions, we plan to have a dedicated session in the program, possibly together with a panel discussion. - Microservices (in collaboration with the Microservices Community) The microservices architectural style is a recent paradigm that pushes the ideas of service-oriented computing to the extreme. In this style, applications are compositions of microservices: loosely-coupled entities that can be executed independently. A microservice should be small enough to be easily managed, modified, and if needed removed and rewritten from scratch. The aim is to obtain high flexibility, reconfigurability, and scalability, thanks also to the exploitation of container technologies (such as Docker). In this setting, coordination is essential: an application works only if the microservices coordinate well with each other, in order to reach their common goal. Establishing coordination techniques for obtaining the desired behaviour out of a system of microservices is therefore of the utmost importance. Contacts: Ivan Lanese and Fabrizio Montesi === Tool papers === We welcome tool papers that describe experience reports, technological artefacts and innovative prototypes (including engines, APIs, etc.), for coordinating, modelling, analysing, simulating or testing systems, as well as educational tools in the scope of the research topics of COORDINATION. In addition, we welcome submissions promoting the integration of existing tools relevant to the community. Submissions to the tool track must include (in addition to the paper) a link to a demo video that previews the potential tool presentation at the conference. === Submissions === = Important dates = - Abstract submission: January 28, 2022 - Paper submission: February 4, 2022 - Paper notification: March 25, 2022 - Artefact submission: April 6, 2022 - Artefact notification: April 24, 2022 - Camera-ready: April 24, 2022 - DisCoTec conference: June 13-18, 2022 Deadlines expire at 23:59 anywhere on earth on the dates displayed above. = Submission site = https://urldefense.com/v3/__https://easychair.org/conferences/?conf=coordination2022__;!!IBzWLUs!AOW50-BvONT91MOPywDfDJz3RsNKLaaxP8JLGJyMiCanyNpOCVgl_RszQM-Wt8GCohhddfuWwV1RqQ$ = Publication = Authors are invited to submit papers electronically in PostScript or PDF using a two-phase online submission process. Registration of the paper information and abstract (max. 250 words) must be completed according to the above DisCoTec submission dates and submissions are handled through the EasyChair conference management system, accessible from the above submission site. Contributions must be written in English and report on original, unpublished work not submitted for publication elsewhere (cf. IFIP?s Author Code of Conduct, see https://urldefense.com/v3/__http://www.ifip.org/__;!!IBzWLUs!AOW50-BvONT91MOPywDfDJz3RsNKLaaxP8JLGJyMiCanyNpOCVgl_RszQM-Wt8GCohhddftvHN0G8w$ under Publications/Links). The submissions must not exceed the total page number limit (see below) prepared using Springer?s LNCS style. Submissions not adhering to the above specified constraints may be rejected without review. NOTE: a lightweight rebuttal will be introduced during the reviewing phase, allowing reviewers to ask for a quick rebuttal in case of a clearly identifiable issue that seems decisive for the review outcome and which can likely be quickly clarified by the authors. The rebuttal is only used when such questions arise, so not necessarily for all papers. Submission categories: - Regular long papers (7-15 pages, not counting references): describing thorough and complete research results and experience reports. - Regular short papers (4-6 pages, not counting references): describing research in progress or opinion papers on the past of COORDINATION research, on the current state of the art, or on prospects for the years to come. - Short tool papers (4-6 pages, not counting references): describing technological artefacts in the scope of the research topics of COORDINATION. Short tool papers are not required to provide an account of theoretical foundations and are not required to present the design and implementation concerns. They should provide a clear account of the tool?s functionality and discuss the tool?s practical capabilities. The paper must contain a link to a publicly downloadable MPEG-4 demo video of at most 10 minutes length. - Long tool papers (7-15 pages, not counting references): describing technological artefacts in the scope of the research topics of COORDINATION. A full-length tool paper should provide a brief account of the theoretical foundations (including relevant citations), present the design and implementation concerns (possibly including software architecture and core data structures), provide a clear account of the tool?s functionality, discuss the tool?s practical capabilities (possibly with reference to the type and size of problems it can handle), and (when applicable) report on realistic case studies (possibly providing a rigorous experimental evaluation). Papers that present extensions to existing tools should clearly describe the improvements or extensions with respect to previously published versions of the tool (possibly providing data on enhancements in terms of resources and capabilities). The paper must contain a link to a publicly downloadable MPEG-4 demo video of at most 10 minutes length. - Survey papers (16-25 pages, not counting references): describing important results and success stories that originated in the context of COORDINATION. ATTENTION: if you believe that your submission is related to the special topic Microservices, then please indicate Microservices as the first of the Author keywords in the online submission system. The conference proceedings, formed by accepted submissions from any category, will be published by Springer in the LNCS series. = Special Issues = Following the tradition of previous editions of COORDINATION, depending on the quality and number of the submissions, we will organise special issues of selected papers in reputable journals like the journal of Science of Computer Programming for tool papers and the journal of Logical Methods in Computer Science for the remaining categories. === EAPLS Artefact Badging === To improve and reward reproducibility and to give more visibility and credit to the effort of tool developers in our community, authors of accepted (regular and tool, short and long) papers will be invited to submit publicly available (using permanent repositories such as Software Heritage, Zenodo, etc.) artefacts associated with their paper for evaluation, and based on the result of the evaluation they may be awarded one or more badges. See https://urldefense.com/v3/__https://eapls.org/pages/artifact_badges/__;!!IBzWLUs!AOW50-BvONT91MOPywDfDJz3RsNKLaaxP8JLGJyMiCanyNpOCVgl_RszQM-Wt8GCohhddfvj2pf9DQ$ for details. Artefact submission is optional and the result of the artefact evaluation will not alter the paper's acceptance decision. Detailed guidelines for the preparation and submission of the artefacts will be made available on the COORDINATION website. === Keynote speaker === to be announced === Organisation === = General Chair = - Rocco De Nicola (IMT School for Advanced Studies, Lucca, Italy = PC Chairs = - Maurice H. ter Beek (ISTI-CNR, Pisa, Italy) - Marjan Sirjani (M?lardalen University, Sweden) = Tool track chair = - Ferruccio Damiani (University of Torino, Italy) = Publicity chair = - Giorgio Audrito (University of Torino, Italy) = Program Committee = - Erika ?brah?m (RWTH Aachen University, Germany) - Davide Basile (ISTI-CNR, Italy) - Simon Bliudze (INRIA, France) - Marcello Bonsangue (Leiden University, The Netherlands) - Ornela Dardha (University of Glasgow, UK) - Patricia Derler (National Instruments, USA) - Adrian Francalanza (University of Malta, Malta) - Vashti Galpin (University of Edinburgh, UK) - Fatemeh Ghassemi (University of Tehran, Iran) - Einar Broch Johnsen (University of Oslo, Norway) - Christine Julien (University of Texas at Austin, USA) - Narges Khakpour (Linnaeus University, Sweden) - eva K?hn (Vienna University of Technology, Austria) - Ivan Lanese (University of Bologna, Italy) - Alberto Lluch Lafuente (Technical University of Denmark, Denmark) - Michele Loreti (University of Camerino, Italy) - Mieke Massink (ISTI-CNR, Italy) - Hern?n Melgratti (University of Buenos Aires, Argentina) - Fabrizio Montesi (University of Southern Denmark, Denmark) - Jos? Proen?a (Polytechnic Institute of Porto, Portugal) - Rosario Pugliese (University of Florence, Italy) - Cristina Seceleanu (M?lardalen University, Sweden) - Meng Sun (Peking University, China) - Carolyn Talcott (SRI International, USA) - Hugo Torres Vieira (Evidence Srl, Italy) - Emilio Tuosto (Gran Sasso Science Institute, Italy) - Mirko Viroli (University of Bologna, Italy) = Artefact Evaluation Committee = * Gianluca Aguzzi (University of Bologna, Italy) * Giorgio Audrito (University of Torino, Italy) * Roberto Casadei (University of Bologna, Italy) * Guillermina Cledou (University of Minho, Portugal) * Giovanni Fabbretti (INRIA, France) * Fabrizio Fornari (University of Camerino, Italy) * Danilo Pianini (University of Bologna, Italy) * Lorenzo Rossi (University of Camerino, Italy) * Larisa Safina (INRIA, France) * Alceste Scalas (Technical University of Denmark, Denmark) = Local Organisation = - Letterio Galletta (IMT School for Advanced Studies, Lucca, Italy) ? chair - Marinella Petrocchi (IIT-CNR, Pisa, Italy) - Simone Soderi (IMT School for Advanced Studies, Lucca, Italy) - Francesco Tiezzi (University of Florence, Italy) - workshops and tutorials chair -------------- next part -------------- An HTML attachment was scrubbed... URL: From A.Lisitsa at liverpool.ac.uk Fri Dec 24 05:13:52 2021 From: A.Lisitsa at liverpool.ac.uk (Lisitsa, Alexei) Date: Fri, 24 Dec 2021 10:13:52 +0000 Subject: [TYPES/announce] 2nd CFP VPT 2022 Tenth International Workshop on Verification and Program Transformation, ETAPS 2022 Message-ID: *************************************************************** SECOND CALL FOR PAPERS Tenth International Workshop on Verification and Program Transformation April 2nd, 2022, M?nchen, Germany https://urldefense.com/v3/__http://refal.botik.ru/vpt/vpt2022__;!!IBzWLUs!FlcIugzv99oFeRfzKZ6yCTHk5mOLG0_HFo6yqRd2CQe_L0lHCz3l66h4wHYProyhwNekXcOMxKkNWw$ Co-Located with the 25th European joint Conference on Theory and Practice of Software (ETAPS 2022) *************************************************************** VPT-2022 Invited Speakers: Elvira Albert, Complutense University of Madrid, Spain Robert Gl?ck, University of Copenhagen, Denmark *************************************************************** The Tenth International Workshop on Verification and Program Transformation (VPT 2022) aims to bring together researchers working in the areas of Program Verification and Program Transformation. The previous workshops in this series were: VPT 2013, Saint Petersburg, Russia VPT 2014, Vienna, Austria VPT 2015, London, UK VPT 2016, Eindhoven, The Netherlands VPT 2017, Uppsala, Sweden MARS/VPT 2018, Thessaloniki, Greece VPT 2019, Genova, Italy VPT 2020, Dublin, Ireland VPT 2021, Luxembourg, Luxembourg The workshop solicits research, position, application, and system description papers with a special emphasis on case studies, demonstrating viability of the interactions between the research fields of program transformation and program verification in a broad sense. Also papers in related areas, such as program testing and program synthesis are welcomed. Topics of interest include, but are not limited to: * Verification by Program Transformation * Verification Techniques in Program Transformation and Synthesis * Verification and Certification of Programs Transformations * Program Analysis and Transformation * Program Testing and Transformation * Verifiable Computing and Program Transformation * Case studies *Important Dates* * January 10th, 2022: Abstract submission deadline * January 17th, 2022: Regular paper submission deadline * January 31st, 2022: Extended abstracts and presentation-only papers submission deadline * February 14th, 2022: Acceptance notification * February 28th, 2022: Camera ready version (for the informal pre-proceedings) * April 2nd, 2022: Workshop * May 16th, 2022: Revised paper submission for the formal proceedings in EPTCS deadline *Submission Guidelines* Authors should submit an electronic copy of the paper in PDF, formatted in the Electronic Proceedings in Theoretical Computer Science LaTeX Style (https://urldefense.com/v3/__http://style.eptcs.org/__;!!IBzWLUs!FlcIugzv99oFeRfzKZ6yCTHk5mOLG0_HFo6yqRd2CQe_L0lHCz3l66h4wHYProyhwNekXcPy5TmOGA$ ), via the Easychair submission website for VPT 2022: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=vpt2022__;!!IBzWLUs!FlcIugzv99oFeRfzKZ6yCTHk5mOLG0_HFo6yqRd2CQe_L0lHCz3l66h4wHYProyhwNekXcN0FKt3nw$ Regular papers must describe original work that has not been published, or currently submitted, to a journal, conference, or workshop with refereed proceedings. Also papers that already appeared in unpublished or informally published workshop proceedings may be submitted. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email; abstract; and three to four keywords that will be used to assist the PC in selecting appropriate reviewers for the paper. Page numbers should appear on the manuscript to help the reviewers in writing their report. Regular paper submissions should not exceed 15 pages including references but excluding well-marked appendices not intended for publication. Reviewers are not required to read the appendices, and thus papers should be intelligible without them. *Proceedings* Revised versions of all the accepted papers and accepted extended abstracts, taking into account the feedback received at the workshop, will be published in a volume of the Electronic Proceedings in Theoretical Computer Science (EPTCS) series after the workshop. If the workshop attracts sufficiently many high quality papers, a special issue of a journal on the topic of the workshop will be considered. The special issue will be open to high quality papers accepted for presentation in previous editions of the workshop. Program Committee: Grigory Fedyukovich, Princeton University, USA John P. Gallagher, Roskilde University, Denmark Geoff W. Hamilton, Dublin City University, Republic of Ireland (Chair) Michael Hanus, University of Kiel, Germany Marie-Christine Jakobs, Ludwig-Maximilians-Universitat, Munchen, Germany Alexei Lisitsa, The University of Liverpool, UK Andrei P. Nemytykh, Program Systems Institute of RAS, Russia Maurizio Proietti, IASI-CNR, Rome, Italy Gabriel Radanne, IRIF, Inria, Paris, France Philipp R?mmer, Uppsala University, Sweden Germ?n Vidal, Technical University of Val?ncia, Spain Organisers: Alexei Lisitsa (The University of Liverpool, UK) Andrei P. Nemytykh (Program Systems Institute of RAS, Russia) Contacts E-mail: Geoff Hamilton, geoffrey.hamilton at dcu.ie Alexei Lisitsa, a.lisitsa at csc.liv.ac.uk Andrei P. Nemytykh, nemytykh at math.botik.ru Web: https://urldefense.com/v3/__http://refal.botik.ru/vpt/vpt2022/__;!!IBzWLUs!FlcIugzv99oFeRfzKZ6yCTHk5mOLG0_HFo6yqRd2CQe_L0lHCz3l66h4wHYProyhwNekXcNJdUGLEw$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From vmvasconcelos at fc.ul.pt Mon Dec 27 06:44:33 2021 From: vmvasconcelos at fc.ul.pt (Vasco Thudichum Vasconcelos) Date: Mon, 27 Dec 2021 11:44:33 +0000 Subject: [TYPES/announce] Two PhD positions at the university of Lisbon Message-ID: <97375DED-87C8-4E40-9781-C811B04F5A35@ciencias.ulisboa.pt> We are looking to fill two PhD positions at the University of Lisbon from early 2022. Several research areas are available; relevant to Types and Programming Languages is the area of Reliable Software Systems, https://urldefense.com/v3/__https://www.lasige.pt/research-line/reliable-software-systems__;!!IBzWLUs!AJkq5gLz76owJ-bjNgrMk2pghTQxnRdDvsadfPIK7TzhXlv_PUQMCb3wYa0MrDFMjz6nG2CNdcIzyA$ . The positions are associated with LASIGE (https://urldefense.com/v3/__https://www.lasige.pt__;!!IBzWLUs!AJkq5gLz76owJ-bjNgrMk2pghTQxnRdDvsadfPIK7TzhXlv_PUQMCb3wYa0MrDFMjz6nG2CyMWBPag$ ), a research unit at the Faculty of Sciences, University of Lisbon. LASIGE was evaluated as excellent in the last nationwide evaluation process. The position is funded by the Foundation for Science and Technology for a period of up to four years, includes the tuition fee and financial support for activities related to the prosecution of the degree. Requirements. Applicants should hold an MSc degree (5 years, 300 ECTS) in Computer Science or in a related area. Applications are open until January 10, 2022. Further information at https://urldefense.com/v3/__https://www.euraxess.pt/jobs/722827__;!!IBzWLUs!AJkq5gLz76owJ-bjNgrMk2pghTQxnRdDvsadfPIK7TzhXlv_PUQMCb3wYa0MrDFMjz6nG2CM1fDuAQ$ , from lasige at ciencias.ulisboa.pt or from any of the researchers at LASIGE (https://urldefense.com/v3/__https://www.lasige.pt/integrated-researchers__;!!IBzWLUs!AJkq5gLz76owJ-bjNgrMk2pghTQxnRdDvsadfPIK7TzhXlv_PUQMCb3wYa0MrDFMjz6nG2A46Q9KlQ$ ). From wies at cs.nyu.edu Mon Dec 27 11:01:31 2021 From: wies at cs.nyu.edu (Thomas Wies) Date: Mon, 27 Dec 2021 11:01:31 -0500 Subject: [TYPES/announce] VMCAI 2022 - Call for Participation Message-ID: <2cf8daa4-1d5d-f65d-6ef5-5d6c1b204bf8@cs.nyu.edu> [Apologies for multiple copies of this announcement] ******************************************************************************* CALL FOR PARTICIPATION 23rd International Conference on Verification, Model Checking, and Abstract Interpretation VMCAI 2022 January 16-18, 2022 https://urldefense.com/v3/__https://popl22.sigplan.org/home/VMCAI-2022__;!!IBzWLUs!FJJtaz2vawVuORoTuu0HFCuclSXyIaCf3aOIshE4qIvmh4DEYOcFccZ4SciZG5kSP-TwDujm4LCXww$ ******************************************************************************* *Call for Participation* VMCAI 2022 is the 23rd International Conference on Verification, Model Checking, and Abstract Interpretation. The conference is co-located with POPL 2022 and will be held on January 16-18, 2022 in Philadelphia, PA, USA. Virtual participation is also possible. VMCAI provides a forum for researchers from the communities of Verification, Model Checking, and Abstract Interpretation, facilitating interaction, cross-fertilization, and advancement of hybrid methods that combine these and related areas. *Invited Speakers* Isil Dillig, UT Austin - Simplifying Concurrent Programming via Synchronization Synthesis Javier Esparza, TU Munich - Back to the Future: A Fresh Look at Linear Temporal Logic Thomas A. Henzinger, IST Austria - Sequential Information Flow *Program* The program of VMCAI 2022 consists of 23 refereed research papers, tool papers and case studies, and can be found at https://urldefense.com/v3/__https://popl22.sigplan.org/home/VMCAI-2022*program__;Iw!!IBzWLUs!FJJtaz2vawVuORoTuu0HFCuclSXyIaCf3aOIshE4qIvmh4DEYOcFccZ4SciZG5kSP-TwDugFA27Jmw$ *Registration* Registration is through POPL's registration web-page, as part of POPL's co-events, and provides a choice between an in-person (regular/student) registration fee and a discounted virtual registration fee. To attend in person, choose the "in-person POPL" option from the main registration page, which later will prompt you to select the specific meetings you want to attend, including VMCAI 2022. To participate remotely, choose the "Virtual POPL" option which is common to all POPL-week events. Note that in both cases, you will automatically get all the benefits of the "Virtual POPL" option, namely, remote access to all POPL-week events as well as the POPL Virtual Workshop. If you are already registered, and wish to either update your information or switch between the in-person and virtual options, use the "Update Information" option. Early registration closes on January 3rd. https://urldefense.com/v3/__https://regmaster.com/2022conf/POPL22/register.php__;!!IBzWLUs!FJJtaz2vawVuORoTuu0HFCuclSXyIaCf3aOIshE4qIvmh4DEYOcFccZ4SciZG5kSP-TwDuhjOxPwJQ$ More information is available on the conference webpage: https://urldefense.com/v3/__https://popl22.sigplan.org/home/VMCAI-2022__;!!IBzWLUs!FJJtaz2vawVuORoTuu0HFCuclSXyIaCf3aOIshE4qIvmh4DEYOcFccZ4SciZG5kSP-TwDujm4LCXww$ *Organizing Committee* Bernd Finkbeiner, Program Co-Chair Thomas Wies, Program Co-Chair Mark Santolucito, Artifact Evaluation Chair Ruzica Piskac, Publicity Chair From elaine.pimentel at gmail.com Mon Dec 27 12:46:11 2021 From: elaine.pimentel at gmail.com (Elaine Pimentel) Date: Mon, 27 Dec 2021 18:46:11 +0100 Subject: [TYPES/announce] The Meaning of Proofs, 14 Jan 2022 (WLD event, virtual) Message-ID: ================================== The Meaning of Proofs World Logic Day Celebration at UCL 14 January 2022 13:00 (UTC) ================================== "The Meaning of Proofs" is a one day online meeting organised by the Programming Principles, Logic and Verification group at UCL. As part of the celebrations of UNESCO?s World Logic Day 2022, we propose a foundational discussion about logic, validity and proof systems, with a main focus on proof-theoretic semantics. The live meeting will take place online (via Zoom) on Friday, 14 January 2022, 13:00 UTC. The event consists of 20 min keynote talks, followed by a discussion. The speakers are: - Peter Schroeder-Heister (Universit?t T?bingen) - Dag Prawitz (Stockholm University) - Luiz Carlos Pereira (PUC-Rio and UERJ) - Tor Sandqvist (Royal Institute of Technology) - Sara Ayhan (Ruhr University Bochum) - Thomas Piecha (Universit?t T?bingen) - Edmond Robinson (University of London) The registration is free of charge and everybody is welcome. For registration, contact information and other details, please visit our page: https://urldefense.com/v3/__https://sites.google.com/view/wdl-ucl2022/home__;!!IBzWLUs!Glyy521aPfx4iuAZUyY5SwDFKLscGFCDdwbyTkiiqNM1ZjhO0RxGBhgakp7w3WZpBBlCdD0YgaVUDw$ Organizers: David Pym and Elaine Pimentel (UCL) -------------- next part -------------- An HTML attachment was scrubbed... URL: From botocudo at gmail.com Mon Dec 27 13:25:52 2021 From: botocudo at gmail.com (Joao Marcos) Date: Mon, 27 Dec 2021 15:25:52 -0300 Subject: [TYPES/announce] CFP: ThEdu'2022 Message-ID: [with apologies for cross-posting] ThEdu'22 11th International Workshop on Theorem-Proving Components for Educational Software Technion, Israel Institute of Technology Haifa, Israel, August 11, 2022 a satellite of FLoC 2022 Conference website https://urldefense.com/v3/__https://www.uc.pt/en/congressos/thedu/ThEdu22__;!!IBzWLUs!HXE6xm-Q5UffKbBe2DJ019fLniDFfFDeyYyzrIqHqxXt8YV9nvi8PiT4TwMiAxYISk7wAAXp9Jbm5g$ Submission link https://urldefense.com/v3/__https://easychair.org/conferences/?conf=thedu22__;!!IBzWLUs!HXE6xm-Q5UffKbBe2DJ019fLniDFfFDeyYyzrIqHqxXt8YV9nvi8PiT4TwMiAxYISk7wAAUhlI-Vkg$ Submission deadline May 9, 2022 From elenam at morris.umn.edu Mon Dec 27 10:00:29 2021 From: elenam at morris.umn.edu (Elena Machkasova) Date: Mon, 27 Dec 2021 10:00:29 -0500 Subject: [TYPES/announce] Trends in Functional Programming in Education 2022 3rd (last) call for submissions Message-ID: TFPIE 2022 Call for papers https://urldefense.com/v3/__https://wiki.tfpie.science.ru.nl/TFPIE2022__;!!IBzWLUs!BVpepQAHwKUg3bjB6JdxcBN6RyBaCw7sYEqFgM2hgrH5h2Z0oQ_kq82b6H7j02-7-JJiI37l3FNolw$ (February 11th 2022, Krakow, Poland co-located with TFP 2022 and Lambda Days) TFPIE 2022 welcomes submissions describing techniques used in the classroom, tools used in and/or developed for the classroom and any creative use of functional programming (FP) to aid education in or outside Computer Science. Topics of interest include, but are not limited to: FP and beginning CS students FP and Computational Thinking FP and Artificial Intelligence FP in Robotics FP and Music Advanced FP for undergraduates FP in graduate education Engaging students in research using FP FP in Programming Languages FP in the high school curriculum FP as a stepping stone to other CS topics FP and Philosophy The pedagogy of teaching FP FP and e-learning: MOOCs, automated assessment etc. Best Lectures - more details below In addition to papers, we are requesting best lecture presentations. What's your best lecture topic in an FP related course? Do you have a fun way to present FP concepts to novices or perhaps an especially interesting presentation of a difficult topic? In either case, please consider sharing it. Best lecture topics will be selected for presentation based on a short abstract describing the lecture and its interest to TFPIE attendees. The length of the presentation should be comparable to that of a paper. In addition, the speaker can provide commentary on effectiveness or student feedback. Submissions Potential presenters are invited to submit an extended abstract (4-6 pages) or a draft paper (up to 20 pages) in EPTCS style. The authors of accepted presentations will have their preprints and their slides made available on the workshop's website. Papers and abstracts can be submitted via easychair at the following link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=tfpie2022__;!!IBzWLUs!BVpepQAHwKUg3bjB6JdxcBN6RyBaCw7sYEqFgM2hgrH5h2Z0oQ_kq82b6H7j02-7-JJiI34EWYvIQw$ After the workshop, presenters are invited to submit (a revised version of) their article for the formal review. The PC will select the best articles for publication in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and extended abstracts will not be formally reviewed by the PC. Important Dates Submission deadline: January 5th 2022, Anywhere on Earth. Notification: January 10th 2022 (Note: earlier submissions will receive earlier response) TFPIE Registration Deadline: February 2nd 2022 Workshop: February 11th 2022 Submission for formal review: April 15th 2022, Anywhere on Earth. Notification of full article: June 1st 2022 Camera ready: July 1st 2022 Program Committee Peter Achten, Radboud University, Netherlands Stephen Chang, University of Massachusetts Boston, USA John Hughes, Chalmers University of Technology, Sweden Elena Machkasova (Chair) - University of Minnesota Morris, USA Kristina Sojakova - INRIA, Paris, France Melinda T?th, E?tv?s Lor?nd University, Budapest, Hungary Keynote speaker Our keynote talk is "The Perfect Functional Programming Course" by Peter Achten. Registration information This year TFPIE takes place on the second day of the Lambda Days, concurrent with TFP. Participants will need to register for the Lambda Days. Please note that TFP and TFPIE have in-person attendance only. For registration fee, the deadlines, and the link to register see the Lambda Days web site: https://urldefense.com/v3/__https://www.lambdadays.org/lambdadays2022__;!!IBzWLUs!BVpepQAHwKUg3bjB6JdxcBN6RyBaCw7sYEqFgM2hgrH5h2Z0oQ_kq82b6H7j02-7-JJiI37eN4WSTw$ Registration and attendance are mandatory for at least one author of every paper that is presented at the workshop. Presenters will have their registration fee waived. Only papers that have been presented at TFPIE may be submitted to the post-reviewing process. Best regards, Elena Machkasova -- Dr. Elena Machkasova Associate Professor of Computer Science Division of Science and Mathematics University of Minnesota, Morris Office: Sci 2325 (320) 589-6308 https://urldefense.com/v3/__http://cda.morris.umn.edu/*elenam/__;fg!!IBzWLUs!BVpepQAHwKUg3bjB6JdxcBN6RyBaCw7sYEqFgM2hgrH5h2Z0oQ_kq82b6H7j02-7-JJiI35yDOWk2Q$ Pronouns: she/her/hers or any other -------------- next part -------------- An HTML attachment was scrubbed... URL: From ross.horne at uni.lu Mon Dec 27 06:31:45 2021 From: ross.horne at uni.lu (Ross James HORNE) Date: Mon, 27 Dec 2021 11:31:45 +0000 Subject: [TYPES/announce] PhD studentship, Luxembourg, Security and Formal Methods Message-ID: Dear colleague, We are seeking candidates for a PhD position at University of Luxembourg in the SaToSS (Software and Trust of Software Systems) group led by Prof Sjouke Mauw in the area of formal methods for security. Please see here the description and link for applications marked "PhD Studentship 2": https://urldefense.com/v3/__https://satoss.uni.lu/vacancies/__;!!IBzWLUs!Futnb8Jjzm96LK-vbEV0JyHeQtfiGg7ZUETdLZaBcfqlEt9zz-v22_-bTUCdhSQ3nhUdqup-VUGsAQ$ We encourage applicants with a background in types systems, logic, formal methods, as well as those enthusiastic about security and privacy. Informal enquiries may be directed to the email addresses below, but the application must be online via the following link. https://urldefense.com/v3/__https://recruitment.uni.lu/en/details.html?id=QMUFK026203F3VBQB7V7VV4S8&nPostingID=67638&nPostingTargetID=97599&mask=karriereseiten&lg=UK__;!!IBzWLUs!Futnb8Jjzm96LK-vbEV0JyHeQtfiGg7ZUETdLZaBcfqlEt9zz-v22_-bTUCdhSQ3nhUdquqRO-4OGA$ The candidate's letter of motivation, must be relevant to research in the SaToSS group: (See: https://urldefense.com/v3/__https://satoss.uni.lu/publications/__;!!IBzWLUs!Futnb8Jjzm96LK-vbEV0JyHeQtfiGg7ZUETdLZaBcfqlEt9zz-v22_-bTUCdhSQ3nhUdqupladCUvA$ ). The topic described is a suggestion. Yours sincerely, Prof. Sjouke Mauw sjouke.mauw at uni.lu Dr. Ross Horne ross.horne at uni.lu Dr. Xihui Chen xihui.chen at uni.lu ========Description of PhD position===================== The University of Luxembourg invites applications to the following vacancy in the Department of Computer Science (https://urldefense.com/v3/__http://dcs.uni.lu__;!!IBzWLUs!Futnb8Jjzm96LK-vbEV0JyHeQtfiGg7ZUETdLZaBcfqlEt9zz-v22_-bTUCdhSQ3nhUdquokOp9noA$ ) within its Faculty of Science, Technology and Medicine: https://urldefense.com/v3/__https://satoss.uni.lu/vacancies/__;!!IBzWLUs!Futnb8Jjzm96LK-vbEV0JyHeQtfiGg7ZUETdLZaBcfqlEt9zz-v22_-bTUCdhSQ3nhUdqup-VUGsAQ$ Doctoral candidate (PhD student) in Computer Science (m/f) ? Initial 36 months fixed-term contract, renewable for up to 48 months depending on thesis progress evaluation ? Full-time employment (40h/week) ? Student and employee status ? Start date: as soon as possible ? Topics in security, privacy and formal methods Your Role The candidate?s tasks include: ? Assistance with teaching classes in security ? Conducting research publishable in reputable international venues ? Writing of progress reports and presentations towards thesis ? Work constructively towards goals set by supervisors The candidate should be prepared to engage in the project ``Semi-Controlled Distributed Account Management?? described below. The project is within the Security and Trust of Software System (SaToSS) research group led by Prof Sjouke Mauw. Description of proposed PhD thesis topic: The use of a password manager is a current best practice that many users and organisations follow. Password managers facilitate the generation and maintenance of unique, complex and random passwords and thus help prevent account compromise due to weak or reused passwords. However, with the rising number of apps, online accounts, smart devices and authentication methods, we are facing many new threats that are not related to passwords. For example, we must now also worry about misconfigured apps, third-party access permissions to accounts, vulnerabilities of devices, and security incidents at service providers. Moreover, our apps, accounts, and devices are interconnected: An email app on a smartphone provides access to the email account to anyone who can unlock the smartphone. If, say, the smartphone user?s groceries account supports password resetting by email, then the user?s groceries account, too, can be accessed by anyone who can unlock the smartphone. There are many other such connections due to multi-factor, single sign-on, and other authentication methods. We refer to this collection of apps, devices, accounts, and authentication methods as an account ecosystem. The interconnected nature of items in an account ecosystem means that for any security incident involving one item, there are potential ramifications for every other item in an account ecosystem. In our user study of 20 young to middle aged adults, they reported on average 43 items in their account ecosystems that were in active use. The complexity of account ecosystems is expected to further increase significantly with new services, such as Open Banking, connecting our existing accounts with new third-party account services, and new items, such as wearable devices, smart home appliances, car infotainment systems connecting to our existing devices such as smartphones, home routers, and introducing new apps and cloud services to control them. Yet, there is no tool that helps managing our account ecosystems and no simple way to assess the risks to the integrity and availability of items in our account ecosystem. Indeed, it is precisely the lack of such a tool at the larger scale of an organisation?s account ecosystem that leaves many institutions blind to the possible attack paths that ransomware attacks have exploited. Objectives In this proposed PhD thesis topic, we aim to develop the first account ecosystem management and security analysis tool. To achieve this, we must solve foundational research questions and develop efficient algorithms as outlined below. The developed algorithms will be implemented into a fully functional prototype. Your Profile The candidate must have a master degree and outstanding qualifications in computer science, mathematics or a related discipline. The candidate should have excellent spoken and written communication skills. The candidate should be prepared to integrate into the SaToSS research group, led by Prof. Sjouke Mauw, which maintains excellent communication between all members. We offer ? A large and dynamic research group with an exciting international environment ? Training in scientific and transferable skills; participation in schools, conferences and workshops. ? The University of Luxembourg offers highly competitive salaries and is an equal opportunity employer Further Information Applications ?written in English? should be submitted online and include: ? Detailed curriculum vitae, including your contact address, work experience and publications ? Letter of motivation. *This is essential and must clearly state how the experience and interests of the candidate are related to the PhD topic advertised. Generic applications that are not tailored to the group and topic will not be considered* ? Degree certificates and transcript of all grades from university-level courses taken ? Contact information for 2-3 referees Deadline for application: Early submission is highly encouraged as the applications are processed in order of reception. Only formal applications via the link provided will be considered. https://urldefense.com/v3/__https://recruitment.uni.lu/en/details.html?id=QMUFK026203F3VBQB7V7VV4S8&nPostingID=67638&nPostingTargetID=97599&mask=karriereseiten&lg=UK__;!!IBzWLUs!Futnb8Jjzm96LK-vbEV0JyHeQtfiGg7ZUETdLZaBcfqlEt9zz-v22_-bTUCdhSQ3nhUdquqRO-4OGA$ However, we encourage applicants to contact members research group with questions about possible research topics. -------------- next part -------------- An HTML attachment was scrubbed... URL: From giorgio.audrito at unito.it Mon Dec 27 11:56:02 2021 From: giorgio.audrito at unito.it (Giorgio Audrito) Date: Mon, 27 Dec 2021 17:56:02 +0100 Subject: [TYPES/announce] CFP: FORTE 2022 (Abstract Deadline: January 28, Submission Deadline: February 4) In-Reply-To: References: Message-ID: ======================================================= First Call for Papers 42nd International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE 2022) 13-17 June 2022, Lucca, Italy ======================================================= *COVID-19* FORTE 2022 is planned as a physical, in-person event, with certain support for remote presence, both for speakers and for other participants who are unable or unwilling to come. Depending on the pandemic situation, we may have to make a decision whether to cancel the physical component of the event or not. *Scope* FORTE 2022 is a forum for fundamental research on theory, models, tools, and applications for distributed systems. The conference solicits original contributions that advance the science and technology for distributed systems, with special interest in: ? Component- and model-based design ? Cyber-physical systems, autonomous systems, and AI-enabled systems design and trustworthiness ? Object technology, modularity, software adaptation ? Self-stabilization and self-healing/organizing ? Software quality, reliability, availability, and safety ? Security, privacy, and trust in distributed and/or communicating systems ? Service-oriented, ubiquitous, and cloud computing systems ? Verification, validation, formal analysis, and testing of the above. Aligned with the above, FORTE covers *models and formal specification, testing* and *verification methods* for distributed computing. Application domains are multiple, and include all kinds of application-level distributed systems, telecommunication services, Internet, embedded and real-time systems, as well as networking and communication security and reliability. Contributions that *combine theory and practice* and that exploit formal methods and theoretical foundations to present novel solutions to problems arising from the development of distributed systems are very much encouraged. *Main Topics of Interest* Topics of interest include but are not limited to: - *Languages and semantic foundations* New modeling and language concepts for distribution and concurrency; semantics for different types of languages, including programming languages, modeling languages, and domain-specific languages; real-time and probability aspects - *Rigorous analysis techniques *Design, specification, analysis, verification, validation, testing and runtime verification of various types of distributed systems, including communications and network protocols, service-oriented systems, adaptive distributed systems, cyber-physical systems and sensor networks - *Foundations of security *New principles for qualitative and quantitative security analysis of distributed systems, including formal models based on probabilistic concepts - *Applications of formal methods *Applying formal methods and techniques for studying quality, reliability, availability, and safety of distributed systems - *Practical experience with formal methods *Industrial applications, case studies and software tools for applying formal methods and description techniques to the development and analysis of real distributed systems - *Emerging challenges and hot topics in distributed systems* (broadly construed) Formal specification, verification and analysis of emerging systems and applications, such as, for instance, software-defined networks, distributed ledgers, smart contracts, and blockchain technologies. *Submission, Publication, and Special Issue* *Submission dates* ? Abstract submission: January 28, 2022 ? Paper submission: February 4, 2022 ? Paper notification: March 25, 2022 ? Camera-ready: April 24, 2022 ? DisCoTec conference: June 13-17, 2022 *Submission Guidelines* Contributions must be written in English according to one of the three categories described below. Apart from journal-first papers, all papers should report on original, unpublished work, not submitted for publication elsewhere (cf. IFIP codes of conduct , under Links). Submissions must be prepared as a PDF using Springer?s LNCS style. Submissions not adhering to the specified constraints of their respective category may be rejected without review. *Submission Categories* FORTE accepts contributions in three categories: *full papers*, *short papers*, and *journal-first papers*. These categories and their associated criteria are described in detail below. Notice that *short* and *journal-first* papers must be explicitly marked as such in the submission?s title. 1. *Full papers* (page limit: up to 15 pages + 2 pages references) A full paper submission describes thorough and complete research results in the scope of the conference. 2. *Short papers* (page limit: up to 6 pages + 2 pages references) Short paper submissions must be marked as such in the submission?s title. A short paper submission can be one of the following: - *Rough diamonds*: Extended abstracts presenting innovative and promising ideas, possibly in an early form and without supporting evidence. - *Tool (demonstration) papers*: Extended abstracts describing (or demonstrating) new tools (or tool components) that implement (or build upon) theoretical foundations. - *Position papers*: Extended abstracts describing (i) calls to action, or (ii) substantiated reflections on current and/or future research perspectives related to FORTE. 3. *?Journal-first? papers* (page limit: up to 4 pages, including references) This category aims at including published journal papers in the FORTE 2022 program. The objective is to offer FORTE attendees a richer program and further opportunities for interaction. Authors of published papers in high-quality journals can submit a proposal to present their journal paper in FORTE. The journal paper must adhere to the following four criteria: ? It should be clearly in the scope of the conference. ? It should be recent: only journal papers available after January 1, 2020 (online or paper) can be presented. ? It reports new research results that significantly extend prior work. As such, the journal paper does not simply extend prior work with material presented for completeness only (such as omitted proofs, algorithms, minor enhancements, or empirical results). ? It has not been presented at, and is not under consideration for, journal-first programs of other similar conferences or workshops. A journal-first submission is a concise but compelling summary of the published journal paper, which makes it clear why a related presentation would enrich the program of FORTE. Journal-first submissions must be marked as such in the submission?s title, and must explicitly include pointers to the journal publication (such as a DOI) but also to related conference and workshop papers, as appropriate. They will be judged on the basis of the above criteria, but also considering relevance and the potential of enriching and complementing the conference program. *Publication* All accepted papers, including short papers and journal-first submissions, will be published in the FORTE 2022 formal proceedings, which will appear in Springer?s LNCS-IFIP volume series. As such, they will be accessible free of charge from the IFIP Digital Library (https://urldefense.com/v3/__https://dl.ifip.org/__;!!IBzWLUs!Ft0KXitnndXmC36qOWARf-Wb52ztgY6HFAJtYVUVMelvNIZbpeL66A4Muy5Sqcu0Xw0HBvqG66xM2g$ ) after a 3 years embargo. *Special Issue* Selected papers will be invited to a special issue of Logical Methods in Computer Science . *Submission Link* https://urldefense.com/v3/__https://easychair.org/conferences/?conf=forte2022__;!!IBzWLUs!Ft0KXitnndXmC36qOWARf-Wb52ztgY6HFAJtYVUVMelvNIZbpeL66A4Muy5Sqcu0Xw0HBvrdfyJ84g$ *Committee members and contacts* *Program committee chairs* ? Mohammad Mousavi, King?s College London, UK ? Anna Philippou, University of Cyprus, Cyprus *Program committee members* ? ?tienne Andr?, Universit? de Lorraine, CNRS, Inria, France ? Nathalie Bertrand, INRIA Rennes Bretagne-Atlantique, France ? Georgiana Caltais, University of Konstanz, Germany ? Yu-Fang Chen, Academia Sinica, China ? Louise Dennis, University of Manchester, UK ? Adrian Francalanza, University of Malta, Malta ? Hubert Garavel, Inria, France ? Fatemeh Ghassemi, University of Tehran, Iran ? Ebru Ayd?n G?l, Middle East Technical University, Turkey ? ?kos Hajdu, Budapest University of Technology and Economics, Hungary ? Arnd Hartmanns, University of Twente, The Netherlands ? Marieke Huisman, University of Twente, The Netherlands ? Peter H?fner, Australian National University, Australia ? Wen Kokke, University of Edinburgh, Scotland, UK ? Barbara K?nig, University of Duisburg-Essen, Germany ? Annabelle McIver, Macquarie University, Australia ? Massimo Merro, University of Verona, Italy ? Claudio Mezzina, Universit? di Urbino, Italy ? Catuscia Palamidessi, ?cole Polytechnique, France ? Kirstin Peters, TU Darmstadt, Germany ? Sanjiva Prasad, Indian Institute of Technology Delhi, India ? Ant?nio Ravara, Universidade Nova de Lisboa, Portugal ? Ana Sokolova, University of Salzburg, Austria ? Mahsa Varshosaz, IT University of Copenhagen, Denmark ? Mahesh Viswanathan, University of Illinois, USA ? Tim Willemse, Eindhoven University of Technology, The Netherlands ? Ingrid Chieh Yu, University of Oslo, Norway *Steering committee* ? Ahmed Bouajjani (University Paris Diderot, France) ? Christel Baier (University Dresden, Germany) ? Lu?s Caires (Universidade Nova de Lisboa, Portugal) ? Alexey Gotsman (IMDEA Software Institute, Spain) ? Einar Broch Johnsen (University of Oslo, Norway) ? Ivan Lanese (University of Bologna/INRIA, Italy - chair) ? Jorge A. P?rez (University of Groningen, The Netherlands) ? Kirstin Peters (Technical University of Darmstadt, Germany) ? Alexandra Silva (University College London, UK) ? Ana Sokolova (University of Salzburg, Austria) ? Jean-Bernard Stefani (INRIA, France) ? Nobuko Yoshida (Imperial College London, UK) ? Heike Wehrheim (Paderborn University, Germany) ? Tim Willemse (Eindhoven University of Technology, The Netherlands) *More Information* For additional information, please contact the Program Committee Co-chairs at: forte2022 at easychair.org -------------- next part -------------- An HTML attachment was scrubbed... URL: