From caterina.urban at ens.fr Sat Jan 1 11:30:30 2022 From: caterina.urban at ens.fr (Caterina Urban) Date: Sat, 1 Jan 2022 17:30:30 +0100 Subject: [TYPES/announce] ETAPS Doctoral Dissertation Award --- Last Call for Nominations, Jan 7th Message-ID: <62AD3AA5-B1F5-4085-BF5A-820C2D5BF9AA@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!BHQ-FrLeIIYR67CedqIitY0tH_0ZBwBu504zvLu5v2ndDy6Nhztqd8R2Fqg_jtSA3W7MkKOHhE3EIQ$ 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 cong at c.titech.ac.jp Sun Jan 2 20:00:00 2022 From: cong at c.titech.ac.jp (Youyou Cong) Date: Mon, 3 Jan 2022 10:00:00 +0900 Subject: [TYPES/announce] PEPM 2022 - Call for Participation Message-ID: -- CALL FOR PARTICIPATION -- ACM SIGPLAN Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM) 2022 =============================================================================== * Website : https://urldefense.com/v3/__https://popl22.sigplan.org/home/pepm-2022__;!!IBzWLUs!BuJnqrY0LE_MXPkXbOTffuZ6JKLI8IOzS97dy-h2wbGGmCeA5S2bDzEFeEHOTMvb5cHP6w_yrJkPlg$ * Time : 17th--18th January 2022 * Place : Online (co-located with POPL 2022, with no physical component) PEPM brings together researchers in partial evaluation, program manipulation, and related areas. This year, we are announcing "PEPM 30", a project aiming at preserving and celebrating the history of PEPM. To this effect, the program includes five invited talks by the key contributors of the PEPM community. We will have a PEPM 30+ History Celebration Day at PEPM 2023. Invited Talks: * Andrei Klimov "Why are partial evaluation and supercompilation still not widely used in practice? Reflections in light of Russian work on metacomputation." * Y. Annie Liu "From meta frameworks and transformations to distributed computing and more" * Frank Pfenning "Modal Logics and Types: Looking Back and Looking Forward" * Naoki Kobayashi "On Type-Based Techniques for Program Manipulation" * Peter Sestoft "A partial history of partial evaluation" Please find the full program at: https://urldefense.com/v3/__https://popl22.sigplan.org/home/pepm-2022*program__;Iw!!IBzWLUs!BuJnqrY0LE_MXPkXbOTffuZ6JKLI8IOzS97dy-h2wbGGmCeA5S2bDzEFeEHOTMvb5cHP6w_l7mRfxg$ and register yourself at: https://urldefense.com/v3/__https://regmaster.com/2022conf/POPL22/register.php__;!!IBzWLUs!BuJnqrY0LE_MXPkXbOTffuZ6JKLI8IOzS97dy-h2wbGGmCeA5S2bDzEFeEHOTMvb5cHP6w8XBLfD9g$ Note that early registration closes on January 3rd. We look forward to seeing you at the workshop! Zena M. Ariola (Program Co-Chair) Youyou Cong (Program Co-Chair) -------------- next part -------------- An HTML attachment was scrubbed... URL: From kaposi.ambrus at gmail.com Mon Jan 3 10:19:35 2022 From: kaposi.ambrus at gmail.com (Ambrus Kaposi) Date: Mon, 3 Jan 2022 16:19:35 +0100 Subject: [TYPES/announce] Call for STSMs, deadline 16 January 2022 In-Reply-To: References: Message-ID: COST Action CA20111 EuroProofNet Open call for Short-Term Scientific Missions (STSMs) Dear EuroProofNet COST Action participants, The next deadline is: * 16 January 2022, for STSMs during the period February - October 2022 (there will be more opportunities to apply, see https://urldefense.com/v3/__https://europroofnet.github.io/grants__;!!IBzWLUs!FebMGCm0WnH50kj1H0CVFVVLx0VD5TA9Ut0aYsL-v2HI0k_5v7KgeCcX-ZUUji8txxWJ8S93THyGbg$ ) A Short-Term Scientific Mission (STSM) is a research visit of an individual researcher from a country participating in the Action in a different country also participating in the Action. We encourage STSMs, as they are an effective way of starting and maintaining collaborations. Proposals are made through the e-COST system ( https://urldefense.com/v3/__https://e-services.cost.eu/stsm__;!!IBzWLUs!FebMGCm0WnH50kj1H0CVFVVLx0VD5TA9Ut0aYsL-v2HI0k_5v7KgeCcX-ZUUji8txxWJ8S89mgqr5Q$ ). The coordinators for STSMs are Danijela Simic (University of Belgrade, Serbia) and Ambrus Kaposi (E?tv?s Lor?nd University, Hungary). The procedure for proposing an STSM is described in Annex 2 of the Annotated Rules ( https://urldefense.com/v3/__https://www.cost.eu/uploads/2021/10/COST-094-21-Annotated-Rules-for-COST-Actions-Level-C-2021-11-01-1.pdf__;!!IBzWLUs!FebMGCm0WnH50kj1H0CVFVVLx0VD5TA9Ut0aYsL-v2HI0k_5v7KgeCcX-ZUUji8txxWJ8S-RTHvsoA$ ). The main points about STSMs are: * An STSM must be between two different countries which are participating in the Action. * The typical duration is one or two weeks. We favor short missions so that more people can get funded. * The financial contribution for an STSM is a fixed grant based on the applicant's budget request and the evaluation of the application by the STSM assessment committee. The grant will not necessarily cover all costs of the visit. The grant only covers travel and subsistence and is transferred after the STSM has taken place. * Recommended grants: - up to EUR 120 for daily allowance (depending on the location) - up to EUR 400 for travel. - the total may not exceed EUR 4000 (this is a hard limit) * As part of the application form submitted through e-COST, the goals of the mission have to be described including how it contributes to the objectives of the Action (see https://urldefense.com/v3/__https://www.cost.eu/actions/CA20111__;!!IBzWLUs!FebMGCm0WnH50kj1H0CVFVVLx0VD5TA9Ut0aYsL-v2HI0k_5v7KgeCcX-ZUUji8txxWJ8S9O1JG9Jg$ ), which working group(s) it contributes to, and a confirmation from the host that he or she will receive the applicant. * Proposals should be submitted by the deadlines. * STSMs must end before the end of October. The criteria according to which funding will be decided are in order: * importance with regard to the research coordination objectives * inclusiveness target countries * age * gender * team with low resources * balance over the action life time between people, teams, countries and working groups. Within 15 days of the end of the STSM, a short scientific report must be submitted through the e-cost system along with the Host?s approval of the report. Regards, Danijela Simic and Ambrus Kaposi EuroProofNet STSM Coordinators -------------- next part -------------- An HTML attachment was scrubbed... URL: From jana at cs.queensu.ca Wed Jan 5 13:35:35 2022 From: jana at cs.queensu.ca (Jana Dunfield) Date: Wed, 5 Jan 2022 13:35:35 -0500 Subject: [TYPES/announce] MSc and PhD positions at Queen's University Message-ID: My group at Queen's University has funding for MSc and/or PhD positions, to start September 2022.? Our research focus is type systems.? Current research directions include polarized liquid types and modal gradual typing.? Our papers can be found via https://urldefense.com/v3/__https://research.cs.queensu.ca/home/jana/by-date.html__;!!IBzWLUs!G_mAnSdrRygMdBps1cjeg-9UcwCRpQKMeCPI6feaI3FkheBC0ujyNUTXnMKw1AxxVZY5cqm558fpDQ$ . Kingston is a small city on Lake Ontario, about halfway between Toronto and Montreal.? In less pandemic-stricken times, it was a popular tourist destination. All applications are welcome, including applications from members of historically excluded groups. The official application process is described at https://urldefense.com/v3/__https://www.cs.queensu.ca/apply/graduate.php__;!!IBzWLUs!G_mAnSdrRygMdBps1cjeg-9UcwCRpQKMeCPI6feaI3FkheBC0ujyNUTXnMKw1AxxVZY5cqnxfZ_aRw$ Our graduate programs have some peculiarities, perhaps especially for those accustomed to US graduate programs: ? - MSc and PhD students are admitted direct-to-supervisor.? In effect, you need to convince a faculty member (me) to provide funding. ? - Our PhD program requires you to have a master's degree.? If you don't have a master's degree, you can apply to the research-based MSc program. ? - The website mentions an "Honours Bachelor degree".? This is a local term for a 4-year bachelor's degree.? It does not mean you need to have taken special "honors" versions of classes, etc. ? - It is easier to fund students who are Canadian citizens or permanent residents.? However, it is not impossible to fund non-Canadians. Feel free to contact me at jana at cs.queensu.ca, even if you think you will miss our published deadline of 15 January 2022. -Jana -- Jana Dunfield (she/her) Assistant Professor, School of Computing Queen's University at Kingston research.cs.queensu.ca/~jana From elaine.pimentel at gmail.com Thu Jan 6 03:59:45 2022 From: elaine.pimentel at gmail.com (Elaine Pimentel) Date: Thu, 6 Jan 2022 08:59:45 +0000 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!EIZgn2-nsKaDxZKAmV4bVdZfpi7tpSrkco3TrzHiq8YBNRVuTMR-0vwwOJ058Ec4jXGO7hptzp7gzQ$ Organizers: David Pym and Elaine Pimentel (UCL) -------------- next part -------------- An HTML attachment was scrubbed... URL: From cmezzina at gmail.com Fri Jan 7 05:51:21 2022 From: cmezzina at gmail.com (Claudio Mezzina) Date: Fri, 7 Jan 2022 11:51:21 +0100 Subject: [TYPES/announce] RC2022 2nd call for papers Message-ID: ======================================================================= 2nd Call for Papers 14th Conference on Reversible Computation (RC 2022) https://urldefense.com/v3/__https://reversible-computation-2022.github.io/__;!!IBzWLUs!CHBQ6xnkCQqQVkrug5J1WldWtVj9AG9vZTNHBmD7ylLDuSDNBEYb9Pyaa9weTxyMHwBITGjpKGzmoA$ July 5th-6th, 2022, Urbino, Italy Abstract Submission: Mon, February 7th, 2022 Submission Deadline: Mon, February 21st, 2022 ======================================================================= ++++++++++ COVID-19 RC 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 cancel the physical event and adopt a fully remote solution ++++++++++ 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 ===== - Robert O'Callahan (rr debugger developer - Mozilla Foundation/Pernosco) - TBD ===== 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!CHBQ6xnkCQqQVkrug5J1WldWtVj9AG9vZTNHBmD7ylLDuSDNBEYb9Pyaa9weTxyMHwBITGh8bfXIVA$ SPECIAL ISSUE Selected papers will be invited to a special issue on the Journal of Logical and Algebraic Methods ===== 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 madeira at ua.pt Fri Jan 7 06:23:05 2022 From: madeira at ua.pt (Alexandre Madeira) Date: Fri, 7 Jan 2022 11:23:05 +0000 Subject: [TYPES/announce] WADT'22 1st cfp Message-ID: <571DA27C-1C19-459D-8A02-0474A75F6B79@ua.pt> =================================================================================== WADT'22 - 26th International Workshop on Algebraic Development Techniques 2022 ** First call for papers ** https://urldefense.com/v3/__http://wadt2022.web.ua.pt__;!!IBzWLUs!FsgMAFhrEHGH6Lzk74FDiTeFXtq1SZS9L-vsblaCZO1q7E-94oJQ9O_7ankWhFL-LD73WIDE2_G1Bg$ Aveiro, 28-30 June, 2022 =================================================================================== ** Aims and Scope ** The algebraic approach to system specification encompasses many aspects of the formal design of software systems. Originally born as a formal method for reasoning about abstract data types, it now covers new specification frameworks and programming paradigms (such as object-oriented, aspect oriented, agent-oriented, logic and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed and mobile systems). The workshop will provide an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends. In 2020 WADT features additionally two special thematic tracks: one in *Algebra for timed and hybrid systems* and another in *Algebraic approaches to quantum computation*. ** Main track ** Typical, but not exclusive topics of interest for the main track are: - Foundations of algebraic specification - Other approaches to formal specification, including process calculi and models of concurrent and distributed systems - Specification languages, methods, and environments - Semantics of conceptual modelling methods and techniques - Integration of formal specification techniques - Formal testing and quality assurance, validation, and verification ** Algebra for timed and hybrid systems ** Track Chair: Renato Neves (UM, PT) The track 'Algebra for timed and hybrid systems' seeks algebraic contributions towards a better understanding of timed and hybrid systems, including their design and verification. A non-exhaustive list of topics includes: - (co)algebraic syntax and semantics, - observational notions of equivalence, - equational reasoning and variants thereof, - distributed and/or concurrent computing; - modal and temporal logic, - (co)algebraic verification tools, - experience reports on the use of (co)algebraic tools. ** Algebraic approaches to quantum computation ** Track Chair: Rui Soares Barbosa (INL, PT) This track seeks contributions on algebraic methods in the context of quantum computing, broadly understood, ranging from foundations to applications and tools. A non-exhaustive list of topics includes: - foundational structures for quantum computing - quantum calculi and logics - quantum programming languages - algebraic and categorical semantics for quantum computing - algebraic approaches to verification of quantum programs - rewriting and automated reasoning with applications to quantum compilation and optimisation - tool support - application of quantum algebra to quantum computing and beyond ** Invited Speakers (to be completed)** - Jos? Meseguer University of Illinois at Urbana-Champaign, US - Peter Selinger Dalhousie University, Canada ** Workshop format and location ** WADT'22 is planned to be realized in a family-owned guesthouse with panoramic views to lagoon Pateira de Fermentelos, 20 minutes from the centre of Aveiro. Information about accommodation will be available in https://urldefense.com/v3/__http://wadt2022.web.ua.pt__;!!IBzWLUs!FsgMAFhrEHGH6Lzk74FDiTeFXtq1SZS9L-vsblaCZO1q7E-94oJQ9O_7ankWhFL-LD73WIDE2_G1Bg$ . Being planned as a physical, in-person event, due the COVID19 current situation, we will provide certain support for remote presence, both for speakers and for other participants who are unable or unwilling to come, depending on the pandemic situation. ** Submissions and Publications ** Presentations will be selected on the basis of submitted abstracts. The abstracts must be up to two pages long including references. If a longer version of the contribution is available, it can be made accessible on the web and referenced in the abstract. The abstracts have to be submitted electronically via the EasyChair link https://urldefense.com/v3/__https://easychair.org/conferences/?conf=wadt2022__;!!IBzWLUs!FsgMAFhrEHGH6Lzk74FDiTeFXtq1SZS9L-vsblaCZO1q7E-94oJQ9O_7ankWhFL-LD73WIB5n9oqMQ$ . WADT 2022 is organised by IFIP WG 1.03. As an IFIP event, post-proceedings will be published by Springer in the LNCS series (requested). The deadline for the submission of full papers to be considered in this volume, to be announced during the workshop, are expected to the end of September 2022. ** Important dates ** April 1 Contributed Abstracts April 17 Notifications about the contributed talks TBA: full papers, for the post-proceeding volume ** Organisation ** * Steering Committee * Andrea Corradini (IT) Jos? Fiadeiro (UK) Rolf Hennicker (GE) Alexander Knapp (GE) Hans-J?rg Kreowski (GE) Till Mossakowski (GE) Fernando Orejas (SP) Leila Ribeiro (BR) Markus Roggenbach (UK) Grigore Ro?u (US) * Program Committee (to be completed) * Erika Abraham (RWTH Aachen, NL) Luis S. Barbosa (U. Minho, PT) Rui S. Barbosa (INL, PT) [Track Chair] Carlos Caleiro (U. Lisboa, PT) Andrea Corradini (U. Pisa, IT) Jos? Luiz Fiadeiro (U. Dundee, UK) Ichiro Hasuo (National Institute of Informatics, JP) Rolf Hennicker (LMU, DE) Marieke Huisman (U. Twente, NL) Martti Karvonen (U. Ottawa, CN) Aleks Kissinger (U. Oxford, UK) Alexander Knapp (U. Augsburg, DE) Alexandre Madeira (U. Aveiro, PT) [Co-chair] Manuel A. Martins (U. Aveiro, PT) [Co-chair] Narciso Marti-Oliet (U. Complutense de Madrid, SP) Dominique Mery (LORIA, FR) Till Mossakowski (U. Magdeburg, DE) Renato Neves (U. Minho, PT) [Track Chair] Peter ?lveczky (U. Oslo, NR) Fernando Orejas (U. Polit?cnica Catalunya, SP) Markus Roggenbach (Swansea University, UK) Georg Struth (U. Sheffield, UK) Ionut Tutu (Simion Stoilow Institute of Mathematics, RO) Beno?t Valiron (Univ. Paris Saclay, FR) Vladimir Zamdzhiev (Inria, FR) ** Contacts ** For any information, please contact us to wadt2022 at easychair.org ------------------------------------------------------- Alexandre Madeira https://urldefense.com/v3/__http://sweet.ua.pt/madeira/__;!!IBzWLUs!FsgMAFhrEHGH6Lzk74FDiTeFXtq1SZS9L-vsblaCZO1q7E-94oJQ9O_7ankWhFL-LD73WIC6_OLHwg$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From amintimany at gmail.com Sat Jan 8 09:48:49 2022 From: amintimany at gmail.com (Amin Timany) Date: Sat, 8 Jan 2022 15:48:49 +0100 Subject: [TYPES/announce] CoqPL 2022: Call for Participation Message-ID: =================================================================== CoqPL 2022 8th International Workshop on Coq for Programming Languages -- January, 2022, co-located with POPL Philadelphia, Pennsylvania, United States CALL FOR PARTICIPATION https://urldefense.com/v3/__https://popl22.sigplan.org/home/CoqPL-2022__;!!IBzWLUs!EMf4C-bxdtX1G9xysxedscdXtAprwRHFRSIj8Ct7EFp7565rfKtidDaJ5e2LXC_VF13RCrAu_2et1Q$ =================================================================== The CoqPL'22 program is now available online: https://urldefense.com/v3/__https://popl22.sigplan.org/home/CoqPL-2022*program__;Iw!!IBzWLUs!EMf4C-bxdtX1G9xysxedscdXtAprwRHFRSIj8Ct7EFp7565rfKtidDaJ5e2LXC_VF13RCrAJNzrpVw$ This year's edition of CoqPL will consist of six contributed talks, two invited talks, and a session with the Coq development team. 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. Invited Events --------------- - Coq meets literate programming: tools for documenting, preserving, and sharing mechanized proofs: Cl?ment Pit-Claudel - Verifying Concurrent, Crash-Safe Systems with Perennial: Joseph Tassarotti - Session with the Coq development team: Matthieu Sozeau Contributed Talks ----------------- - A Visual Ltac Debugger in CoqIDE: Jim Fehrle - Scrap your boilerplate definitions in 10 lines of Ltac!: Qianchuan Ye and Benjamin Delaware - Tealeaves: Categorical structures for syntax: Lawrence Dunn, Steve Zdancewic, Val Tannen - Towards a Formalization of Nominal Sets in Coq: Fabr?cio S. Paranhos, Daniel Ventura - A Verified Pipeline from a Specification Language to Optimized, Safe Rust: Rasmus Holdsbjerg-Larsen, Bas Spitters, Mikkel Milo - A Case for Lightweight Interfaces in Coq: David Swasey, Paolo G. Giarrusso, Gregory Malecha Hybrid workshop due to Covid-19 ------------------------------------------------ CoqPL 2022 is collocated with POPL 2022 and will follow the guidelines set by the organizing committee of POPL 2022. POPL organizers have decided to hold POPL and its collocated as hybrid events making both in-person and virtual participation options available to all participants. (It is possible that these events would change to fully virtual events if many participants decide to convert their participation from in-person to virtual.) For more information see POPL's website: https://urldefense.com/v3/__https://popl22.sigplan.org/__;!!IBzWLUs!EMf4C-bxdtX1G9xysxedscdXtAprwRHFRSIj8Ct7EFp7565rfKtidDaJ5e2LXC_VF13RCrCpMppSmA$ . -------------- next part -------------- An HTML attachment was scrubbed... URL: From freek at cs.ru.nl Mon Jan 10 05:18:59 2022 From: freek at cs.ru.nl (Freek Wiedijk) Date: Mon, 10 Jan 2022 11:18:59 +0100 Subject: [TYPES/announce] Fully funded PhD position on formalization of mathematics at Radboud University Nijmegen Message-ID: <20220110101859.omhh7tfrkszqwzrh@xb27-stretch.fritz.box> Dear all, We are looking for a PhD student with a master in mathematics or equivalent, who wants to write his/her/their PhD thesis on formalization of mathematics. In particular this is about a formalization project related to Fermat's Last Theorem. See https://urldefense.com/v3/__https://www.cs.ru.nl/*freek/fltfps/__;fg!!IBzWLUs!ErCcdTahPPBh3kOc5nDzWF5Fw5k1Wo2mP0OYIUPeBoCX7c5VzgWJkqUTVx1dUbRzosH9qwDTNhvN4g$ for more details about the position. If you are interested, or know someone who might be interested, we would very much like to hear from you. Freek From ruy at cin.ufpe.br Fri Jan 7 08:19:05 2022 From: ruy at cin.ufpe.br (Ruy Jose Guerra Barretto de Queiroz) Date: Fri, 7 Jan 2022 10:19:05 -0300 Subject: [TYPES/announce] 28th WoLLIC 2022 - 2nd 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 European Association for Computer Science Logic (EACSL), the Interest Group in Pure and Applied Logics (IGPL), the The Association for Logic, Language and Information (FoLLI), the Association for Symbolic Logic (ASL) (tbc), 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!CajSDU-REac6o8ipDPQfHQ3qBnY7H0xmiO1lboDuaN13GyvS2Yt8uKY8uzoxub1HvqM3OyraEl-eNw$ 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!CajSDU-REac6o8ipDPQfHQ3qBnY7H0xmiO1lboDuaN13GyvS2Yt8uKY8uzoxub1HvqM3Oyr79FJhGw$ ). 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!CajSDU-REac6o8ipDPQfHQ3qBnY7H0xmiO1lboDuaN13GyvS2Yt8uKY8uzoxub1HvqM3Oyoe28G-cg$ . 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 Mathematical Structures in Computer Science (MSCS). 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) PROGRAM COMMITTEE Arthur Azevedo de Amorim (Boston University) Agata Ciabattoni (Technische Universit?t Wien) (Co-Chair) Diana Costa (University of Lisbon) Denisa Diaconescu (University of Bucharest) Hans van Ditmarsch (Open University of the Netherlands) Rajeev Gor? (The Australian National University) 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 (University College London) (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) 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) Anjolina G. de Oliveira (Univ Federal de Pernambuco, Brasil) Ruy de Queiroz (Univ Federal de Pernambuco, Brasil) (co-chair) SCIENTIFIC SPONSORSHIP European Association for Computer Science Logic (EACSL) 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) 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/__https://wollic2022.github.io/__;!!IBzWLUs!CajSDU-REac6o8ipDPQfHQ3qBnY7H0xmiO1lboDuaN13GyvS2Yt8uKY8uzoxub1HvqM3OyrolO9s9w$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From u.berger at swansea.ac.uk Mon Jan 10 07:01:47 2022 From: u.berger at swansea.ac.uk (Ulrich Berger) Date: Mon, 10 Jan 2022 12:01:47 +0000 Subject: [TYPES/announce] CiE 2022: Third CfP (extended deadline) Message-ID: ================================ CiE 2022: THIRD 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!AxtrbGGz0RLuI6eAgPDM92gN902BbIIGePT1y2QV9NlW7Xip2L_bGKy8drZVjuTJH7ysRnOHFxWjmw$ Submission link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=cie2022__;!!IBzWLUs!AxtrbGGz0RLuI6eAgPDM92gN902BbIIGePT1y2QV9NlW7Xip2L_bGKy8drZVjuTJH7ysRnNcL-T6aQ$ IMPORTANT DATES: ================ Deadline for article registration (abstract submission, extended): January 28, 2022 (AOE) Deadline for article submission (extended): February 4, 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) 4th speaker tba - 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) Mael Pegny (Universit?t T?bingen) Jacopo Tagliabue (COVEO) 4th speaker tba - 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!AxtrbGGz0RLuI6eAgPDM92gN902BbIIGePT1y2QV9NlW7Xip2L_bGKy8drZVjuTJH7ysRnNcL-T6aQ$ 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!AxtrbGGz0RLuI6eAgPDM92gN902BbIIGePT1y2QV9NlW7Xip2L_bGKy8drZVjuTJH7ysRnOJyUbEJQ$ and also on Overleaf https://urldefense.com/v3/__https://www.overleaf.com/latex/templates/springer-lecture-notes-in-computer-science/kzwwpvhwnvfj*.WsdHOy5uZpg__;Iw!!IBzWLUs!AxtrbGGz0RLuI6eAgPDM92gN902BbIIGePT1y2QV9NlW7Xip2L_bGKy8drZVjuTJH7ysRnPcvA_kTg$ ) 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!AxtrbGGz0RLuI6eAgPDM92gN902BbIIGePT1y2QV9NlW7Xip2L_bGKy8drZVjuTJH7ysRnNcL-T6aQ$ See https://urldefense.com/v3/__https://cs.swansea.ac.uk/cie2022/submission__;!!IBzWLUs!AxtrbGGz0RLuI6eAgPDM92gN902BbIIGePT1y2QV9NlW7Xip2L_bGKy8drZVjuTJH7ysRnMOrvyUJA$ 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!AxtrbGGz0RLuI6eAgPDM92gN902BbIIGePT1y2QV9NlW7Xip2L_bGKy8drZVjuTJH7ysRnNcL-T6aQ$ ), using the LNCS style file (available at https://urldefense.com/v3/__https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines__;!!IBzWLUs!AxtrbGGz0RLuI6eAgPDM92gN902BbIIGePT1y2QV9NlW7Xip2L_bGKy8drZVjuTJH7ysRnOJyUbEJQ$ ), 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!AxtrbGGz0RLuI6eAgPDM92gN902BbIIGePT1y2QV9NlW7Xip2L_bGKy8drZVjuTJH7ysRnMxahO3Cg$ CiE Conference Series: https://urldefense.com/v3/__https://www.acie.eu/cie-conference-series/__;!!IBzWLUs!AxtrbGGz0RLuI6eAgPDM92gN902BbIIGePT1y2QV9NlW7Xip2L_bGKy8drZVjuTJH7ysRnMn1Yz16Q$ 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 florin.manea at informatik.uni-goettingen.de Mon Jan 10 07:02:19 2022 From: florin.manea at informatik.uni-goettingen.de (Manea, Florin) Date: Mon, 10 Jan 2022 12:02:19 +0000 Subject: [TYPES/announce] CSL 2022 - Call for participation Message-ID: <93088b9696c9453ea0a14a86bc267514@informatik.uni-goettingen.de> ===================================== Call for Participation (CSL'22) ===================================== News: Online conference; Registration is open; List of accepted papers; Ackermann awards. ===================================== Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL), see https://urldefense.com/v3/__https://www.eacsl.org/__;!!IBzWLUs!G355Aa9JgwKhhWBogL5sLb31gxIrSSj53tUjI-Sw19xVp5Eywp5IyPRNKmGLg1hyEu9cjP5sDPjcdQ$ . 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, online. The conference is hosted by the University of G?ttingen. More details, including the schedule, will be announced soon on the website: https://urldefense.com/v3/__http://csl2022.uni-goettingen.de/__;!!IBzWLUs!G355Aa9JgwKhhWBogL5sLb31gxIrSSj53tUjI-Sw19xVp5Eywp5IyPRNKmGLg1hyEu9cjP428PsdRA$ 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) Accepted papers: ----------------- The Program Committee selected 35 accepted papers for presentation at CSL 2022. Their titles and authors can be seen here: https://urldefense.com/v3/__http://csl2022.uni-goettingen.de/*acceptedpaper__;Iw!!IBzWLUs!G355Aa9JgwKhhWBogL5sLb31gxIrSSj53tUjI-Sw19xVp5Eywp5IyPRNKmGLg1hyEu9cjP54Y1ct5Q$ Registration: -------------- To register for CSL 2022, please fill in the registration form at: https://urldefense.com/v3/__https://events.gwdg.de/event/95/__;!!IBzWLUs!G355Aa9JgwKhhWBogL5sLb31gxIrSSj53tUjI-Sw19xVp5Eywp5IyPRNKmGLg1hyEu9cjP6kNqClww$ The participation fee for CSL 2022 is as follows: - members of EACSL (2022): free - students: 5 Euro - members of EATCS or ACM SIGLOG (2022): 15 Euro - regular: 20 Euro This fee covers participation in CSL 2022 and includes membership of EACSL for 2022 (https://urldefense.com/v3/__https://www.eacsl.org/membership/__;!!IBzWLUs!G355Aa9JgwKhhWBogL5sLb31gxIrSSj53tUjI-Sw19xVp5Eywp5IyPRNKmGLg1hyEu9cjP6S50CJ4Q$ ). This fee has to be paid directly to the EACSL, as indicated in the registration process, and is processed by the EACSL. There is no participation fee for the collocated workshops (see below), and they can be attended without paying the CSL registration fee, but the CSL-registration form should still be filled. These participation fees are made possible only due to the generous financial support by the German Research Foundation (DFG) and the University of G?ttingen. Important dates: ----------------- Speaker registration deadline: January 31st, 2022. At least one author of every contributed paper must register as a speaker. Non-speaker registration deadline: February 6th, 2022. All participants must register. 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. The Helena-Rasiowa-Award will be announced during the conference. Read more about the contribution of Helena Rasiowa to logic and computer science, and their interplay, here: https://urldefense.com/v3/__https://www.eacsl.org/?page_id=1104__;!!IBzWLUs!G355Aa9JgwKhhWBogL5sLb31gxIrSSj53tUjI-Sw19xVp5Eywp5IyPRNKmGLg1hyEu9cjP6XyC7T4w$ Ackermann Award 2021: ---------------------- The Ackermann Award is the EACSL Outstanding Dissertation Award for Logic in Computer Science. The award for 2021 will be presented during CSL 2022. The Ackermann Award 2021 is given to two PhD theses (in alphabetic order): Marie Fortin for her thesis "Expressivity of first-order logic, star-free propositional dynamic logic and communicating automata" defended at ENS Paris-Saclay, (France) in 2020. Supervisors: Paul Gastin and Benedikt Bollig and Sandra Kiefer for her thesis "Power and Limits of the Weisfeiler-Leman Algorithm" defended at RWTH Aachen, (Germany) in 2020. Examiners: Martin Grohe, Pascal Schweitzer, Neil Immerman 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://urldefense.com/v3/__https://www.cs.swansea.ac.uk/lcc/__;!!IBzWLUs!G355Aa9JgwKhhWBogL5sLb31gxIrSSj53tUjI-Sw19xVp5Eywp5IyPRNKmGLg1hyEu9cjP5q8EICNQ$ . 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://urldefense.com/v3/__https://lmw.mpi-sws.org/csl/__;!!IBzWLUs!G355Aa9JgwKhhWBogL5sLb31gxIrSSj53tUjI-Sw19xVp5Eywp5IyPRNKmGLg1hyEu9cjP5N88rZbw$ Contact: --------- Please send all questions about submissions to the PC co-chairs and main organizers: csl2022 at easychair.org From s-dgq at thorsten-wissmann.de Mon Jan 10 06:16:02 2022 From: s-dgq at thorsten-wissmann.de (Thorsten Wissmann) Date: Mon, 10 Jan 2022 12:16:02 +0100 Subject: [TYPES/announce] CMCS 2022: Second Call for Papers Message-ID: <20220110111602.GA11067@dobby> Second 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!GfgtiyyQNhYCPIK5kuu_gB1PGk4ogZoDo7TiRK7SbakSso42iTof4Q_jXXNxEv8pQrCWjt-kvge0dA$ *Updated info: Speakers, Important Dates and Submission Instructions*. 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. Keynote speaker --------------- Ana Sokolova, University of Salzburg, Austria Invited speakers ---------------- Renato Neves, University of Minho, Portugal Sam Staton, University of Oxford, United Kingdom Invited tutorial speakers ------------------------- There will be a special session on Data Languages with invited tutorials by: S?awomir Lasota, University of Warsaw, Poland Mahsa Shirmohammadi, CNRS & University of Paris, France Important dates --------------------------- Abstract regular papers 24 January 2022 Submission regular papers 27 January 2022 Notification regular papers 25 February 2022 Camera-ready copy 18 March 2022 Submission short contributions 20 February 2022 (tentative) Notification short contributions 25 February 2022 (tentative) 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, Chapman University, United States 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. A clearly-marked appendix containing technical proofs can be added, but this will not be published in the proceedings. Note that the 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!GfgtiyyQNhYCPIK5kuu_gB1PGk4ogZoDo7TiRK7SbakSso42iTof4Q_jXXNxEv8pQrCWjt-U8Y2zYA$ 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. Accepted short contributions will be bundled in a technical report. From hanielbbarbosa at gmail.com Mon Jan 10 16:38:34 2022 From: hanielbbarbosa at gmail.com (Haniel Barbosa) Date: Mon, 10 Jan 2022 18:38:34 -0300 Subject: [TYPES/announce] SC-square Workshop 2022: First Call for Papers Message-ID: <87fspvw9sf.fsf@gmail.com> [Apologies for multiple copies] ========================================= Call for Papers: SC-square Workshop 2022 ========================================= 7th International Workshop on Satisfiability Checking and Symbolic Computation Fri. 12 August 2022, Haifa, Israel. The 7th SC-Square Workshop is a minisymposium at: 11th International Joint Conference on Automated Reasoning - IJCAR 2022, as part of FLOC 2022, Haifa, Israel, 7--12 August 2022. Main conference website: https://urldefense.com/v3/__https://easychair.org/smart-program/IJCAR2022/__;!!IBzWLUs!BNwzg-nImsm_E79WxQm7ULKR1idLwCYyUkhFpqF_eF_vcyRpZqWFnT7NpB8yUTgBIJblRlWtDeDiRQ$ SC-Square Workshop website: https://urldefense.com/v3/__http://www.sc-square.org/CSA/workshop7.html__;!!IBzWLUs!BNwzg-nImsm_E79WxQm7ULKR1idLwCYyUkhFpqF_eF_vcyRpZqWFnT7NpB8yUTgBIJblRlXJkVluYg$ === Key Dates === Submission deadline Tue. 10 May 2022 Notification Wed. 15 Jun 2022 Final version Fri. 1 Jul 2022 Workshop date Fri. 12 Aug 2022 === Scope === Symbolic Computation is concerned with the efficient algorithmic determination of exact solutions to complicated mathematical problems. Satisfiability Checking has recently started to tackle similar problems but with different algorithmic and technological solutions. The two communities share many central interests, but researchers from these two communities rarely interact. Also, the lack of common or compatible interfaces for tools is an obstacle to their fruitful combination. Bridges between the communities in the form of common platforms and road-maps are necessary to initiate an exchange, and to support and direct their interaction. The aim of this workshop is to provide an opportunity to discuss, share knowledge and experience across both communities. === Submitting to the Workshop === The workshop is open for submission and participation to everyone interested in the topics, whether or not they were members or associates of the (now finished) H2020 FETOPEN CSA project "SC-Square". The topics of interest include but are not limited to: - Satisfiability Checking for Symbolic Computation - Symbolic Computation for Satisfiability Checking - Applications relying on both Symbolic Computation and Satisfiability Checking - Combination of Symbolic Computation and Satisfiability Checking tools - Decision procedures and their embedding into SMT solvers and computer algebra systems ==== Submission guidelines ==== Submissions should be in English, formatted in Springer LNCS style and submitted via EasyChair using this link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=7thscsquareworkshop__;!!IBzWLUs!BNwzg-nImsm_E79WxQm7ULKR1idLwCYyUkhFpqF_eF_vcyRpZqWFnT7NpB8yUTgBIJblRlWyIIg4rw$ We invite three types of submissions: (1) NORMAL PAPERS, describing research not published or submitted elsewhere (with a limit of 15 pages). (2) EXTENDED ABSTRACTS, may be position papers, description of research prospects, challenges, projects, ongoing works, or applications relevant to SC-square (with a limit of 8 pages). (3) POSTERS To receive the appropriate level of peer review, please declare your category of your submission by prefixing the title on the EasyChair form with "NP", "EA" or "PO" accordingly. For consistency, all submissions must use the LNCS style. The style files are here: https://urldefense.com/v3/__ftp://ftp.springernature.com/cs-proceeding/llncs/llncs2e.zip__;!!IBzWLUs!BNwzg-nImsm_E79WxQm7ULKR1idLwCYyUkhFpqF_eF_vcyRpZqWFnT7NpB8yUTgBIJblRlXbBtOVwg$ We plan to publish the proceedings of the workshop digital form, hosted with CEUR-WS (see https://urldefense.com/v3/__http://ceur-ws.org/__;!!IBzWLUs!BNwzg-nImsm_E79WxQm7ULKR1idLwCYyUkhFpqF_eF_vcyRpZqWFnT7NpB8yUTgBIJblRlWkHCePIA$ ). Authors may opt out of this, should they prefer to publish the material elsewhere. People from industry and business are warmly invited to submit papers to describe their problems, challenges, goals, and expectations for the SC-square community. === Workshop Co-Chairs === Haniel Barbosa (Universidade Federal de Minas Gerais, Brazil) Ali K. Uncu (University of Bath, U.K.) === Program Committee === Erika Abraham (RWTH Aachen University) Martin Brain (University of Oxford) Curtis Bright (University of Waterloo) Christopher (Brown United States Naval Academy) James H. Davenport (University of Bath) Matthew England (Coventry University) Madalina Erascu (Institute e-Austria Timisoara, West University of Timisoara) Alberto Griggio (Fondazione Bruno Kessler) Dejan Jovanovi? (Amazon Web Services) Manuel Kauers (Johannes Kepler University Linz) Daniela Kaufmann (Johannes Kepler University Linz) Ilias Kotsireas (Wilfrid Laurier University, Maplesoft) Laura Kovacs (Vienna University of Technology) Gereon Kremer (Stanford University) Robert Lewis (Brown University) Veronika Pillwein (RISC Johannes Kepler University Linz) Hamid Rahkooy (Max-Planck Institute for Informatics) Amir Hosein Sadeghimanesh (Coventry University) === Earlier Workshops in the series === This is the 7th workshop in the series (originally created by the H2020 FETOPEN CSA Project "SC-Square"): (1) the First SC2 Workshop took place in Timisoara, Romania in 2016; (2) the Second SC2 Workshop took place in Kaiserslautern, Germany in 2017; (3) the Third SC2 Workshop took place in Oxford, UK in 2018; (4) the Fourth SC2 Workshop took place in Bern, Switzerland in 2019; (5) the Fifth SC2 Workshop was held virtially, originally to be in Paris, France in 2020; (6) the Sixth SC2 Workshop was held virtually, originally to be in College Station, U.S.A. in 2021. See SC-Square main website: https://urldefense.com/v3/__http://www.sc-square.org/__;!!IBzWLUs!BNwzg-nImsm_E79WxQm7ULKR1idLwCYyUkhFpqF_eF_vcyRpZqWFnT7NpB8yUTgBIJblRlWcvTYRqQ$ From P.Achten at cs.ru.nl Tue Jan 11 12:17:11 2022 From: P.Achten at cs.ru.nl (Peter Achten) Date: Tue, 11 Jan 2022 18:17:11 +0100 Subject: [TYPES/announce] [TFP'22] second call for papers: Trends in Functional Programming 2022 moved to March 17-18 online (together with TFPiE) Message-ID: ============== TFP 2022 =================== == MOVING TO ONLINE SYMPOSIUM, NEW DATES == =========================================== 23rd Symposium on Trends in Functional Programming 17-18 March, 2022 Online event https://urldefense.com/v3/__https://trendsfp.github.io/index.html__;!!IBzWLUs!FYuKjQMpWcU1xSh53KA3Lj13TBDXtb_cLOmNSUUrRnFCeA1aBbvAceCQEZJPA6xXvMx8XKuG4kk7qw$ Due the pandemic, we have had to make TFP virtual this year. As a result, we've decided to push back the deadlines and conference date by a few weeks. In particular, the pre-symposium deadline for submitting the first version of your paper is now just after the ICFP deadline. == Important Dates == Submission deadline for draft papers??????????????? Monday 7th March, 2022 Notification for draft submissions????????????????? Friday 11th March, 2022 Symposium dates???????????????????????????????????? Thursday 17th - Friday 18th March, 2022 Submission deadline for post-symposium reviewing??? Wednesday 6th April, 2022 Notification for post-symposium submissions???????? Friday 27th 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. == 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!FYuKjQMpWcU1xSh53KA3Lj13TBDXtb_cLOmNSUUrRnFCeA1aBbvAceCQEZJPA6xXvMx8XKtyQ1NOLA$ Authors of papers have the choice of having their contributions formally reviewed either before or after the Symposium. == Post-symposium formal review process == 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 == Guillaume Allais??????????????? University of St Andrews Jos? Manuel Calder?n Trilla???? Galois, Inc. Stephen Chang?????????????????? University of Massachusetts Boston Matthew Flatt?????????????????? University of Utah Jeremy Gibbons????????????????? University of Oxford Zhenjiang Hu??????????????????? Peking University Mauro Jaskelioff??????????????? CIFASIS / Universidad Nacional de Rosario Moa Johansson?????????????????? Chalmers University of Technology Shin-ya Katsumata?????????????? National Institute of Informatics Oleg Kiselyov?????????????????? Tohoku University Bas Lijnse????????????????????? Netherlands Defence Academy / Radboud University Nijmegen Kazutaka Matsuda??????????????? Tohoku University Nico Naus?????????????????????? Virginia Tech Christine Rizkallah???????????? University of New South Wales Alejandro Serrano?????????????? 47 Degrees Amir Shaikhha?????????????????? Ecole Polytechnique F?d?rale de Lausanne Aaron Stump???????????????????? University of Iowa Wouter Swierstra (Co-chair)???? Utrecht University Baltasar Tranc?n Y Widemann???? Semantics GmbH Nicolas Wu (Co-chair)?????????? Imperial College London Ningning Xie??????????????????? University of Hong Kong From bove at chalmers.se Wed Jan 12 06:25:12 2022 From: bove at chalmers.se (Ana Bove) Date: Wed, 12 Jan 2022 12:25:12 +0100 Subject: [TYPES/announce] 3 Assistant professors positions at Chalmers on ICT and Basic Science Message-ID: <1a013b7a-6009-0749-d4c1-15a8f242dc22@chalmers.se> Dear All, Chalmers University of Technology in Gothenburg, Sweden, is recruiting 11 highly motivated Assistant Professors across broad research fields (one in ICT and 2 in Basic Science ) to join our quest for a sustainable future! We seek creative individualswho want to develop as independent research leaders and have a genuine interest in teaching and collaborating. We encourage interested candidates to submit an application with a research plan describing how to *Change the world your way*. The offer includes: * A four-year tenure-track position at Chalmers University of Technology * A generous start up package * A leadership programme * A relocation package Find more information about this unique opportunity at https://urldefense.com/v3/__https://assistant-professor-positions.chalmers.se/__;!!IBzWLUs!Hnk4vZJYrzB2-ZluZwxx79Y5Zhc3bnMwtDyfgKBU1u3dmu7mJqDPt4aftMV0FIRecp_V14k0eFii0A$ . Applications are accepted until *31 January 2022*. Please help us spread the word! 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!Hnk4vZJYrzB2-ZluZwxx79Y5Zhc3bnMwtDyfgKBU1u3dmu7mJqDPt4aftMV0FIRecp_V14l1Bc6g0g$ Department of Computer Science and Engineering Chalmers Univ. of Technology and Univ. of Gothenburg -------------- next part -------------- An HTML attachment was scrubbed... URL: From C.Kop at cs.ru.nl Wed Jan 12 09:09:12 2022 From: C.Kop at cs.ru.nl (Cynthia Kop) Date: Wed, 12 Jan 2022 15:09:12 +0100 Subject: [TYPES/announce] WST 2022 - Call for Papers Message-ID: <3394fe95-c124-b2a4-f883-49dadfcb21eb@cs.ru.nl> ====================================================================== ????????????????????? WST 2022 - Call for Papers ????????????? 18th International Workshop on Termination ?????????????????? https://urldefense.com/v3/__https://sws.cs.ru.nl/WST2022__;!!IBzWLUs!BRVBwZbVBkbIlX5-u4iqCREKxyvItC_GJEqtaGDweh1Qlj1-lT9zwcB2lN0ADzf8kYIrMDn7oSDs8w$ ????????????????? August 11-12, 2022, Haifa, Israel ??????????????? Co-located with IJCAR-11 at FLoC 2022 ====================================================================== 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 3, 2022 ? * notification:???????? June 8, 2022 ? * final version due:??? June 22, 2022 ? * workshop:???????????? August 11-12, 2022 INVITED SPEAKERS: ? TBA TOPICS: The 18th 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 analysis 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, probabilistic ??? programs, 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://urldefense.com/v3/__https://easychair.org/conferences/?conf=wst22__;!!IBzWLUs!BRVBwZbVBkbIlX5-u4iqCREKxyvItC_GJEqtaGDweh1Qlj1-lT9zwcB2lN0ADzf8kYIrMDlkgy7--Q$ Please, use LaTeX and the LIPIcs style file https://urldefense.com/v3/__https://submission.dagstuhl.de/styles/download-tag/lipics/v2021.1.2/authors/tgz__;!!IBzWLUs!BRVBwZbVBkbIlX5-u4iqCREKxyvItC_GJEqtaGDweh1Qlj1-lT9zwcB2lN0ADzf8kYIrMDlCIhCPeA$ to prepare your submission. PROGRAM COMMITTEE: ? * Jose Divas?n - U. de La Rioja ? * Florian Frohn - AbsInt GmbH ? * Jera Hensel - RWTH Aachen ? * Dieter Hofbauer - ASW Saarland ? * Sebastiaan Joosten - Dartmouth College ? * Cynthia Kop (chair) - Radboud U. Nijmegen ? * Akihisa Yamada - AIST, Japan ? * Hans Zantema - Eindhoven U. of Technology From kmbae at postech.ac.kr Wed Jan 12 11:14:35 2022 From: kmbae at postech.ac.kr (Kyungmin Bae) Date: Thu, 13 Jan 2022 01:14:35 +0900 Subject: [TYPES/announce] Final CFP: 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 Paper submission deadline: Jan 16, 2022 (AoE) (extended!) Notification: Feb 14, 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!B5i9wZub9oGbF3kj-rMDZ9qIjgDk7c0xfwG7-5RsYVj-qb4WKsrrPlu3J0w0bUt-40OYcfwdGsRspg$ . 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. INVITED SPEAKERS Sebastian M?dersheim Technical University of Denmark, Denmark Gwen Sala?n University Grenoble Alpes, France 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!B5i9wZub9oGbF3kj-rMDZ9qIjgDk7c0xfwG7-5RsYVj-qb4WKsrrPlu3J0w0bUt-40OYcfzQQLdRvg$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From gtan at cse.psu.edu Thu Jan 13 09:44:44 2022 From: gtan at cse.psu.edu (Gang (Gary) Tan) Date: Thu, 13 Jan 2022 09:44:44 -0500 Subject: [TYPES/announce] (Deadline extended to Feb 7th, 2022) LangSec 2022, affiliated with IEEE S&P Message-ID: We are extending the LangSec 2022 deadline to Feb 7th, 2022; we hope to see your submission this year! Apologies for multiple postings. 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!DOlkoY5jWMp9SEdrC3ExgtCK_0xuFb5AQjITpz4Fh0OHIpe88cQtF_FHx77dt0VRS9QcfY1-D4Vypg$ Submission link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=langsec2022__;!!IBzWLUs!DOlkoY5jWMp9SEdrC3ExgtCK_0xuFb5AQjITpz4Fh0OHIpe88cQtF_FHx77dt0VRS9QcfY3-_2JX8w$ Important Dates: Research paper submissions due: Feb 7th 2022, AOE Work-in-progress reports and panels submissions due: ? Feb 7th 2022, AOE Notification to authors: Feb 28th 2022 Camera ready: March 17th 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 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 https://urldefense.com/v3/__http://www.cse.psu.edu/*gxt29__;fg!!IBzWLUs!DOlkoY5jWMp9SEdrC3ExgtCK_0xuFb5AQjITpz4Fh0OHIpe88cQtF_FHx77dt0VRS9QcfY3ejQz_DA$ Tel:814-8657364 -------------- next part -------------- An HTML attachment was scrubbed... URL: From m.seisenberger at swansea.ac.uk Fri Jan 14 05:59:17 2022 From: m.seisenberger at swansea.ac.uk (Monika Seisenberger) Date: Fri, 14 Jan 2022 10:59:17 +0000 Subject: [TYPES/announce] Cfp: Continuity, Computability, Constructivity: From Logic to Algorithms Postproceedings Message-ID: Continuity, Computability, Constructivity: >From Logic to Algorithms 2021, Postproceedings In honour of Ulrich Berger Call for Submissions After another year of successful work in the EU-MSCA-RISE project "Computing with Infinite Data" (CID) and an excellent CCC Workshop in Birmingham, we are planning to publish a collection of papers relevant to the CCC meeting, to the project, and to the subject in general, as a Special Issue in THEORETICAL COMPUTER SCIENCE. The volume will be dedicated to Ulrich Berger's 65th Birthday. The issue will reflect progress made on CCC topics and related areas, and is not restricted to work in the CID project or presented at the Workshop. Submissions are welcome from all scientists on topics in the entire spectrum from logic to algorithms including, but not limited to: * Exact real number computation, * Correctness of algorithms on infinite data types, * Computable analysis, * Complexity of real numbers, real-valued functions, etc. * Effective descriptive set theory, * Constructive topological foundations, * Scott's domain theory, * Constructive analysis, * Category-theoretic approaches to computation on infinite data, * Weihrauch degrees, * Randomness and computable measure theory, * Other related areas. EDITORS: Achim Jung (Birmingham) Monika Seisenberger (Swansea) DEADLINE FOR SUBMISSIONS: 1 May 2022. If you are interested to contribute, please send a tentative title and abstract to the editors by the end of 31 January 2022. Submissions will be reviewed according to the usual high standards of TCS. -------------- next part -------------- An HTML attachment was scrubbed... URL: From elenam at morris.umn.edu Fri Jan 14 09:03:21 2022 From: elenam at morris.umn.edu (Elena Machkasova) Date: Fri, 14 Jan 2022 09:03:21 -0500 Subject: [TYPES/announce] TFPIE 2022: moving to online and extension to Feb 7th Message-ID: Due to rescheduling of the Lambda Days because of COVID, TFPIE, together with TFP, will be held virtually on March 16th 2022, together with TFP which will be held on March 17-18. There is an optional opportunity to present at the Lambda Days July 28-29 2022 in addition to the virtual presentation in March. Updated TFPIE 2022 Call for papers: https://urldefense.com/v3/__https://wiki.tfpie.science.ru.nl/TFPIE2022__;!!IBzWLUs!GsPAmk9L_qb_BQnLzog_lpF2eyyARKHXnDFy6zAuBXw0ykc_Evf9QA5IE_rYsw4qndj1uMzYztgxFw$ The submission deadline is extended to February 7th 2022. 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!GsPAmk9L_qb_BQnLzog_lpF2eyyARKHXnDFy6zAuBXw0ykc_Evf9QA5IE_rYsw4qndj1uMwmhssOug$ 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 (updated) Submission deadline: *February 7th* 2022, Anywhere on Earth. Notification: *February 11th* 2022 (Note: earlier submissions will receive earlier response) TFPIE Registration Deadline: TBA Workshop: *March 16* 2022 Submission for formal review: *April 29th* 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: TFPIE will take place virtually on March 16 2022, together with TFP which will be held on March 17-18. Registration information will be announced shortly. There is no registration fee. Registration and online attendance are mandatory for at least one author of every paper that is presented at the workshop. 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!GsPAmk9L_qb_BQnLzog_lpF2eyyARKHXnDFy6zAuBXw0ykc_Evf9QA5IE_rYsw4qndj1uMyusnpXcA$ Pronouns: she/her/hers or any other -------------- next part -------------- An HTML attachment was scrubbed... URL: From Julien.Lange at rhul.ac.uk Fri Jan 14 05:54:57 2022 From: Julien.Lange at rhul.ac.uk (Lange, Julien) Date: Fri, 14 Jan 2022 10:54:57 +0000 Subject: [TYPES/announce] Multiple permanent lecturer (assistant prof) posts at Royal Holloway Message-ID: <6570821D-2D93-4534-95CD-E24E48C65D10@rhul.ac.uk> Dear all, We are looking for new academics in the broad area of software engineering at Royal Holloway. Deadline is 31st Jan. Feel free to get in touch with me for any informal queries. > https://urldefense.com/v3/__https://jobs.royalholloway.ac.uk/vacancy.aspx?ref=1221-504__;!!IBzWLUs!D5JuDPYLeBKqD6lDM7Qnj5i6hKPzfIVadhkNowKv-7AKF3pPwLpn0BLYo9W12ns773fp0Irt27673Q$ Webpage of the Centre for Programming Languages and Systems: > https://urldefense.com/v3/__https://www.royalholloway.ac.uk/research-and-teaching/departments-and-schools/computer-science/research/our-research-centres/cpls/__;!!IBzWLUs!D5JuDPYLeBKqD6lDM7Qnj5i6hKPzfIVadhkNowKv-7AKF3pPwLpn0BLYo9W12ns773fp0IoZFX9XeA$ Regards, Julien. ?????????????????? The Department of Computer Science at Royal Holloway is looking to appoint multiple academic members of staff 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 typically in the top 10 in the UK for graduate prospects (e.g., Guardian 2022). Our software engineering teaching has been hailed as a ?best practice? example of computer science education by BCS, The Chartered Institute for IT. Over the past seven years, we have undertaken an ambitious plan of expansion: eighteen new academic members of staff were appointed, new undergraduate and integrated-masters programmes were created, and multiple new postgraduate-taught programmes were launched. We have strong research groups in the broad areas of Intelligent Systems, Machine Learning, Algorithms and Complexity, and Programming Languages and Systems, as well as good connections with the Information Security Group. We are involved in multiple inter/multidisciplinary activities, from electrical engineering to psychology and social sciences. Our research strength generates significant interest and collaborative opportunity from universities and third stream partners. Royal Holloway also recently launched a research catalyst ?Transformative Digital Technologies, Security and Society,? which we aim to contribute to. We are now recruiting academic members of staff who can complement or strengthen our existing research and further support our teaching. We particularly welcome applications from researchers with industrial experience and expertise in software engineering and large-scale systems. We also welcome exceptional candidates from all disciplines in Computer Science. The successful candidate will help us seek and seize opportunities for research funding and industrial engagement, and supervise student projects emphasizing industry best-practice. They will hold a PhD or equivalent, and will have a proven research record 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 April 2022 or as soon as possible thereafter. The post is based in Egham, Surrey, within commuting distance from London, Europe?s most dynamic technology hub. In return we offer a highly competitive rewards and benefits package including: ? Generous annual leave entitlement ? Training and Development opportunities ? Pension Scheme with generous employer contribution ? Various schemes including Cycle to Work, Season Ticket Loans and help with the cost of Eyesight testing. ? Free parking For further details of the Department see royalholloway.ac.uk/computerscience or contact the Head of Department at Magnus.Wahlstrom at rhul.ac.uk. For further details on the Royal Holloway research catalysts see intranet.royalholloway.ac.uk/staff/research/research-2021/research-catalysts.aspx. To view further details of this post and to apply please visit https://urldefense.com/v3/__https://jobs.royalholloway.ac.uk__;!!IBzWLUs!D5JuDPYLeBKqD6lDM7Qnj5i6hKPzfIVadhkNowKv-7AKF3pPwLpn0BLYo9W12ns773fp0IqrCei-Nw$ . For queries on the application process the Human Resources Department can be contacted by email at: recruitment at rhul.ac.uk Please quote the reference: 1221-504 Closing Date: Midnight, 31st January 2022 Interview Date: W/C 21st February 2022 -- Julien Lange This email, its contents and any attachments are intended solely for the addressee and may contain confidential information. In certain circumstances, it may also be subject to legal privilege. Any unauthorised use, disclosure, or copying is not permitted. If you have received this email in error, please notify us and immediately and permanently delete it. Any views or opinions expressed in personal emails are solely those of the author and do not necessarily represent those of Royal Holloway, University of London. It is your responsibility to ensure that this email and any attachments are virus free. From ryukilon at gmail.com Fri Jan 14 09:48:00 2022 From: ryukilon at gmail.com (Taro Sekiyama) Date: Fri, 14 Jan 2022 23:48:00 +0900 Subject: [TYPES/announce] Postdoc positions on Formal Verification for Zero-Trust IoT Systems at Kyoto University and National Institute of Informatics (NII), Japan Message-ID: <652319d3-7b1d-e155-b4f5-eaeec6a6cf7f@gmail.com> [Please distribute, apologies for multiple postings.] Dear All, We are seeking a few postdoc researchers, who works for a project ?Zero-Trust IoT Systems by Collaboration of Formal Verification and System Software? by Japan Science and Technology Agency. We'd be grateful if you could spread the word to interested candidates. * Project Description The project aims at the construction of formally verified secure IoT systems that follow the concept of ?zero trust architecture?, dubbed ZT-IoT systems. It consists of four research teams and two teams, led by Atsushi Igarashi, Kyoto University, Japan and Taro Sekiyama, National Institute of Informatics, Japan (NII) are investigating applications of formal verification or programming language techniques to the construction of secure IoT systems. The main research topic of Igarashi?s team is centered around the design and theory of security policy engines for ZT-IoT systems, inclucing the design of a language to describe security policies and policy enforcement algorithms and the techniques for verifying policy enforcement algorithms against given security policies. Other team members are Kohei Suenaga and Masaki Waga at Kyoto University. The main research topic of Sekiyama?s team is centered around techniques for monitoring and intervention for ZT-IoT systems. Other team members include Ichiro Hasuo and Shin-ya Katsumata at NII. Although the two teams are based in different places, we collaborate closely with each other. The appointment can start as early as April 2022 (the starting date is negotiable). The contract will initially run until the end of March 2023, with the possibility of annual renewal until the end of the project, which is March 2027 at maximum. Salary will be about 360,000?550,000 JPY/month. Applicants should have a Ph.D in computer science or related fields, and have a strong background in formal verification and/or programming language theory. Due to the project?s nature, they are required to have strong interests in applying theory to practice; they should also be (self-)motivated, dedicated, and able to work both independently and collaboratively. Strong communication skills in oral and written English are required. * Workplace Members of Igarashi?s team will work at Kyoto University, Kyoto, Japan and members of Sekiyama?s team will work at NII, Tokyo, Japan. (Living costs in Japan are not very high nowadays. An estimate is found here https://urldefense.com/v3/__https://www.internations.org/go/moving-to-japan/living/the-cost-of-living-in-japan*:*:text=A*20single*20person*20living*20in,will*20see*20that*20number*20tripled__;I34lJSUlJSUlJQ!!IBzWLUs!Gnsm1byNvZF0P1BlNRwU7GGAQScWB27opusBpiWPfAaYVKwjlVfkFFPDlMKMy4y9v8XwtnJmXw8HBA$ and we find rent can be cheaper than the cited amount.) * Applications and inquiries Inquiries can be sent to application-zt-iot [at] fos.kuis.kyoto-u.ac.jp, with the subject CREST Job Inquiry. Feel free to ask us any questions on relevance, topics, compensation, etc. We will reply when we see enough relevance. Applications should be made electronically via the following JREC-IN Portal web sites. NII: https://urldefense.com/v3/__https://jrecin.jst.go.jp/seek/SeekJorDetail?fn=3&ln=1&id=D122010021&ln_jor=1__;!!IBzWLUs!Gnsm1byNvZF0P1BlNRwU7GGAQScWB27opusBpiWPfAaYVKwjlVfkFFPDlMKMy4y9v8XwtnJutt-z8w$ Kyoto: https://urldefense.com/v3/__https://jrecin.jst.go.jp/seek/SeekJorDetail?fn=3&ln=1&id=D121122219&ln_jor=1__;!!IBzWLUs!Gnsm1byNvZF0P1BlNRwU7GGAQScWB27opusBpiWPfAaYVKwjlVfkFFPDlMKMy4y9v8XwtnJCae5dKw$ Please upload a pdf including - your brief CV, - short description of research interests (can be very informal and short), - the list of papers (a dblp or Google scholar link will do, for example), - a couple of representative papers (in pdf), and - (preferably) the contact of two references. We will contact you for further material and interview, provided that we find sufficient relevance in your application. Starting dates are negotiable. The positions will remain open until filled. Best, Taro. From clemens.grabmayer at gssi.it Fri Jan 14 14:17:25 2022 From: clemens.grabmayer at gssi.it (Clemens Grabmayer) Date: Fri, 14 Jan 2022 20:17:25 +0100 Subject: [TYPES/announce] TERMGRAPH 2022 Workshop: First Call for Papers Message-ID: ======================================================================== First Call for Papers TERMGRAPH 2022 Twelfth International Workshop on Computing with Terms and Graphs https://urldefense.com/v3/__http://termgraph.org.uk/2022__;!!IBzWLUs!EwL3QUiDCYbnE1vXDS9CwhlIm22M0XYV28aagjylN5-iiiBvotTPRcJMUoLWA_KqFMtrxZMX3k8lTg$ Technion, Haifa, Israel Monday, 1st August 2022 *) A Workshop that is part of FLoC 2022 ======================================================================== *) preliminary, due to room capacity decisions the FLoC organizers can reschedule to Sunday, 31st July 2022 (decision on 15 June 2022) Graphs and graph transformation systems are used in many areas within Computer Science: to represent data structures and algorithms, to define computation models, as a general modeling tool to study complex systems, etc. Topics of interest for TERMGRAPH encompass all aspects of term-/graph rewriting (term-graph and graph rewriting), and applications of graph transformations in programming, automated reasoning and symbolic computation, including: * Theory of first-order and higher-order term graph rewriting * Graph rewriting in lambda calculus (sharing graphs, optimality) * Term-/graph based models of computation * Graph grammars * Term-/graph based languages and modelling frameworks * Term-/graph rewriting tools: -- system descriptions and case studies * Applications of term-/graph rewriting in, and term-/graph rewriting aspects of: -- semantics and implementation of programming languages -- compiler construction -- interaction nets and proof nets -- software engineering -- automated reasoning and symbolic computation -- functional and logic programming -- pattern recognition -- bioinformatics The aim of this workshop is to bring together researchers working in these different domains, to foster their interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in this area. Submissions and Publication: ---------------------------- We invite submissions of extended abstracts of at most 8 pages typeset in EPTCS (Electronic Proceedings in Theoretical Computer Science) style. This may include, concerning any of the topics above: -- original work, -- tutorials, -- work in progress, -- system descriptions of term-/graph rewriting tools. Extended abstracts have to be submitted no later than 10 May 2022 (AoE) electronically (pdf) via the EasyChair submission site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=termgraph2022__;!!IBzWLUs!EwL3QUiDCYbnE1vXDS9CwhlIm22M0XYV28aagjylN5-iiiBvotTPRcJMUoLWA_KqFMtrxZNoWmqRcQ$ Papers will be judged on relevance, originality, correctness, and usefulness. Preliminary proceedings will be available for the workshop. After the workshop, authors will be invited to submit a longer version of their work (a 15-pages paper) for the publication of the Workshop Post-Proceedings in EPTCS. These submissions will undergo a second round of refereeing with: submission deadline in the mid of October 2022, notification in December 2022, publication in February or March 2023. Important Dates: ---------------- Submission deadline: 10 May 2022 Notification: 7 June 2022 Program publication: 15 June 2022 PreProceedings version due: 21 June 2022 Workshop: 1 August 2022 (see proviso (*) above) Programme Committee: -------------------- Sandra Alves, Universidade do Porto, Portugal Martin Avanzini, INRIA Sophia Antipolis - M?diterran?e, France Patrick Bahr, IT University Copenhagen, Copenhagen, Denmark Thierry Boy de la Tour, CNRS, France Clemens Grabmayer (chair), Gran Sasso Science Institute, Italy Wolfram Kahl, McMaster University, Canada Ian Mackie, LIX, France Koko Muroya, Kyoto University, Japan Femke van Raamsdonk, Vrije Universiteit Amsterdam, The Netherlands Adrian Rutle, Western Norway University, Norway Kazunori Ueda, Waseda University, Japan Contact: -------- Clemens Grabmayer clemens.grabmayer at gssi.it ======================================================================== From maurizio.proietti at iasi.cnr.it Sat Jan 15 10:31:49 2022 From: maurizio.proietti at iasi.cnr.it (Maurizio Proietti) Date: Sat, 15 Jan 2022 16:31:49 +0100 Subject: [TYPES/announce] HCVS 2022 - Second Call for Papers In-Reply-To: References: 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!GwMeNMuE8-3XbfvyI3plRg4KI0vZ8fsEFBYfk8I2hixC67XizVFJNceeGXfPHYt168WrvIiIYdTu6g$ 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!GwMeNMuE8-3XbfvyI3plRg4KI0vZ8fsEFBYfk8I2hixC67XizVFJNceeGXfPHYt168WrvIiFmkbCMQ$ ), 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!GwMeNMuE8-3XbfvyI3plRg4KI0vZ8fsEFBYfk8I2hixC67XizVFJNceeGXfPHYt168WrvIiCEzTPQA$ ) 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!GwMeNMuE8-3XbfvyI3plRg4KI0vZ8fsEFBYfk8I2hixC67XizVFJNceeGXfPHYt168WrvIiCEzTPQA$ (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!GwMeNMuE8-3XbfvyI3plRg4KI0vZ8fsEFBYfk8I2hixC67XizVFJNceeGXfPHYt168WrvIi1kaXUVw$ -- 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!GwMeNMuE8-3XbfvyI3plRg4KI0vZ8fsEFBYfk8I2hixC67XizVFJNceeGXfPHYt168WrvIhY7HDcxQ$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From alwen.tiu at gmail.com Sun Jan 16 19:18:28 2022 From: alwen.tiu at gmail.com (Alwen Tiu) Date: Mon, 17 Jan 2022 11:18:28 +1100 Subject: [TYPES/announce] Multiple Research Fellow positions at the Australian National University Message-ID: [Apologies for multiple postings] Dear Colleagues, we have multiple Research Fellow positions at the School of Computing, the Australian National University; see below for details. Please feel free to forward this to those interested. Regards, -Alwen Research Fellow (multiple positions) School of Computing, the Australian National University. Salary package: Level B, A$99,809 ? A$113,165 per annum plus 17% superannuation Term: Fixed Term (2-3 years)] Postdoctoral Research Position - opportunity to build own research agenda - embedded in diverse team - several positions available, depending on the knowledge and interest of the applicant The Research Fellow will develop foundations and tools for specifying and verifying software, with a particular emphasis on applications in the areas of concurrency, programming languages, and security. Foundations should be based on sound mathematical frameworks, e.g., process algebra or operational semantics. Tool support can range from frameworks within interactive proof assistants via the use of off-the-shelf model checkers to code generation. The Postdoctoral Fellow should apply the developed theory to real-world case studies, such as compiler verification, or the analysis of protocols in terms of correctness or security. The successful candidate is encouraged to develop new and innovative research directions in their specified scientific impact domain, including relevant collaborations. Please see jobs.anu.edu.au/cw/en/job/543320 for more details. Review of your application is guaranteed if your application is received by *31 January 2022.* The search will continue until the positions are filled, or until *30 June 2022*, whichever comes first. -------------- next part -------------- An HTML attachment was scrubbed... URL: From giorgio.audrito at unito.it Mon Jan 17 07:37:59 2022 From: giorgio.audrito at unito.it (Giorgio Audrito) Date: Mon, 17 Jan 2022 13:37:59 +0100 Subject: [TYPES/announce] DisCoTec 2022: second call for Workshops Message-ID: ***************************************************************************** Call for Workshops (second round) 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!D3kNrfGP8Xgu3ec1SBMnrO-NlCkJcGGvp553wnYoaGZ8Edgd_98qMoUtBJZieSmYUVNU8kVEkMOwfQ$ ***************************************************************************** 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. **** Second round submissions of workshop proposals must reach the workshop chairs by January 24, 2022 **** 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): - January 24, 2022: Workshop proposal submission deadline (second round) - January 26, 2022: 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!D3kNrfGP8Xgu3ec1SBMnrO-NlCkJcGGvp553wnYoaGZ8Edgd_98qMoUtBJZieSmYUVNU8kUzcVtREw$ * 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 carsten at dcs.bbk.ac.uk Tue Jan 18 15:24:23 2022 From: carsten at dcs.bbk.ac.uk (Carsten Fuhs) Date: Tue, 18 Jan 2022 20:24:23 +0000 Subject: [TYPES/announce] FSCD 2022: Second Call for Papers Message-ID: (Apologies for multiple copies of this announcement. Please circulate.) ======================================================================= Updated information on: invited speakers, affiliated workshops ======================================================================= 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!DsvqS1EUSyluTtSTQE3fW6DZZlsEkzyF9woy40nh-1EtaPcM1WUYOXwkVeQFa-UNnCS8ogCHpdSPOQ$ 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 INVITED SPEAKERS ---------------- - Cynthia Kop, Radboud University Nijmegen (FSCD Invited Speaker) - Alwen Tiu, The Australian National University (FSCD Invited Speaker) - Orna Kupferman, Hebrew University (FLoC Plenary Speaker) - Catuscia Palamidessi, INRIA Saclay and LIX (FLoC Keynote Speaker) AFFILIATED WORKSHOPS -------------------- - IFIP-WG1.6: Annual Meeting of the IFIP Working Group 1.6 on Term Rewriting (July 31, only invited talks) - HoTT/UF: 7th Workshop on Homotopy Type Theory/Univalent Foundations (July 31-August 1) - IWC: 11th International Workshop on Confluence (August 1) - LFMTP: International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (August 1) - Linearity-TLLA: 3rd Joint International Workshop (July 31-August 1) - TERMGRAPH: 12th International Workshop on Computing with Terms and Graphs (August 1) - WiL: 6th Workshop on Women in Logic (July 31) - WPTE: 9th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (July 31) OVERVIEW -------- FSCD (https://urldefense.com/v3/__http://fscd-conference.org/__;!!IBzWLUs!DsvqS1EUSyluTtSTQE3fW6DZZlsEkzyF9woy40nh-1EtaPcM1WUYOXwkVeQFa-UNnCS8ogC0iF0iRA$ ) 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!DsvqS1EUSyluTtSTQE3fW6DZZlsEkzyF9woy40nh-1EtaPcM1WUYOXwkVeQFa-UNnCS8ogDrMQv2zQ$ Submissions must be formatted using the LIPIcs style files (https://urldefense.com/v3/__https://submission.dagstuhl.de/series/details/5*author__;Iw!!IBzWLUs!DsvqS1EUSyluTtSTQE3fW6DZZlsEkzyF9woy40nh-1EtaPcM1WUYOXwkVeQFa-UNnCS8ogAUMobc4g$ ). 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 frederic.blanqui at inria.fr Thu Jan 20 03:18:23 2022 From: frederic.blanqui at inria.fr (=?UTF-8?B?RnLDqWTDqXJpYyBCbGFucXVp?=) Date: Thu, 20 Jan 2022 09:18:23 +0100 Subject: [TYPES/announce] Release of Lambdapi 2.1.0 Message-ID: <532cff54-19c7-8694-fa80-8769ab28dad9@inria.fr> Dear all, I am pleased to announce the release 2.1.0 of Lambdapi on opam. See https://urldefense.com/v3/__https://github.com/Deducteam/lambdapi__;!!IBzWLUs!C_FSrZaalBb1YXVLqfNi3ykjifj5e9dlYpv4MKNHsgK0XFAiZtm7RR6PaftOcQ-QUG_2KjOhiRVp8A$ for more details and https://urldefense.com/v3/__https://lambdapi.readthedocs.io/__;!!IBzWLUs!C_FSrZaalBb1YXVLqfNi3ykjifj5e9dlYpv4MKNHsgK0XFAiZtm7RR6PaftOcQ-QUG_2KjPxUYuk5Q$ for its user manual. Lambdapi is a proof assistant for the ??-calculus modulo rewriting. Lambdapi provides a rich type system with dependent types. In Lambdapi, one can define both type and function symbols by using rewriting rules (oriented equations). The declaration of symbols and rewriting rules is separated so that one can easily define inductive-recursive types for instance. Rewrite rules can be exported to the TRS and XTC formats for checking confluence and termination with external tools. A symbol can be declared associative and commutative. Lambdapi supports unicode symbols and infix operators. Lambdapi does not come with a pre-defined logic. It is a powerful logical framework in which one can easily define its own logic and build and check proofs in this logic. There exist .lp files defining first or higher-order logic and complex type systems like in Coq or Agda. Lambdapi provides a basic module and package system, interactive modes for proving both unification goals and typing goals, and tactics for solving them step by step. In particular, a rewrite tactic like in SSReflect, and a why3 tactic for calling external automated provers through the Why3 platform. Lambdapi is mostly compatible with Dedukti: it can read .dk files and convert .lp files to .dk files. Dedukti is just a type checker and has no features such as implicit arguments, etc. Hence, Lambdapi can be used as a higher-level intermediate language to translate proofs from a given proof system to Dedukti. Best regards, Fr?d?ric. -------------- next part -------------- An HTML attachment was scrubbed... URL: From rumi.neykova at gmail.com Thu Jan 20 07:00:51 2022 From: rumi.neykova at gmail.com (Rumyana Neykova) Date: Thu, 20 Jan 2022 12:00:51 +0000 Subject: [TYPES/announce] PLACES 2022 - Call for Papers Message-ID: # PLACES 2022 - Call for Papers The 13th edition of PLACES (Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software) will be co-located with ETAPS 2022 in Munich, Germany on 3rd April 2022. ------------------------------------------------------------------------------------ https://urldefense.com/v3/__https://places-workshop.github.io/__;!!IBzWLUs!CfDgi0XoXmSSz4egt_eDM7SgXT3oSdSht0oIDBbHaOt71q_lE98uAZxBjpdHE7Vb_VxP34Q_BJKzzw$ ------------------------------------------------------------------------------------ For over a decade, PLACES has been a popular forum for researchers from different fields to exchange new ideas about challenges to modern and future programming, where concurrency and distribution are the norm rather than a marginal concern. ## Submissions Guidelines Submissions are invited in the general area of programming language approaches to concurrency, communication, and distribution, ranging from foundational issues, through language implementations, to applications and case studies. Submissions will be peer-reviewed by a minimum of three reviewers, with the aim of allocating at least one expert reviewer. Papers are reviewed based on their novelty, clarity, and technical soundness. Submissions must not be submitted elsewhere and must be formatted in EPTCS format, containing a maximum of 8 pages (with no restriction on bibliography or appendices, which the reviewers need not read). The proceedings of PLACES 2022 will be published as a volume of EPTCS. Submission site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=places22__;!!IBzWLUs!CfDgi0XoXmSSz4egt_eDM7SgXT3oSdSht0oIDBbHaOt71q_lE98uAZxBjpdHE7Vb_VxP34QXXvpM6g$ ## Special Issues Authors of selected papers from PLACES 2022 will be invited to submit extended versions of their workshop papers to a special issue to Information and Computation and/or JLAMP. ## Key dates * Submission deadline: 4th February 2022 (AoE) * Author notification: 28th February 2022 * Camera ready: 11th March 2022 * Workshop: 3rd April 2022 * ETAPS: 2nd-7th April 2022 ## Topics Relevant topics include, but are not limited to: * Design and implementation of programming languages with first class concurrency and communication primitives * Models for concurrent and distributed systems, such as process algebra and automata, and their mechanisation in proof assistants * Behavioural types, including session types * Concurrent data types, objects and actors * Verification and program analysis methods for safe and secure concurrent and distributed software * Interface and contract languages for communication and distribution * Applications to microservices, sensor networks, scientific computing, HPC, blockchains, robotics * Concurrency and communication in event processing and business process management ## Chairs * Marco Carbone, IT-University of Denmark * Rumyana Neykova, Brunel University London ## Programme Committee * Ilaria Castellani, INRIA Sophia Antipolis M?diterran?e * Tiago Cogumbreiro, University of Massachusetts Boston, USA * Farzaneh Derakhshan, Carnegie Mellon University, USA * Silvia Ghilezan, University of Novi Sad, Serbia * Jonas Hinrichsen, Aarhus University, Denmark * Keigo Imai, Gifu University, Japan * Roland Kuhn, Actyx * Julien Lange, Royal Holloway University of London, UK * Jorge A. P?rez, University of Groningen, Netherlands * Kirstin Peters, Technische Universit?t Darmstadt, Germany * Antonio Ravara, New University of Lisbon, Portugal * Peter Thiemann, University of Freiburg, Germany * Uma Zalakain, University of Glasgow, UK ## Organising committee * Simon Gay, University of Glasgow * Luca Padovani, University of Torino * Vasco T. Vasconcelos, Universidade de Lisboa * Nobuko Yoshida, Imperial College London We hope you will submit and join us for another successful edition of PLACES! -- Best Regards, Rumyana Neykova & Marco Carbone -------------- next part -------------- An HTML attachment was scrubbed... URL: From andrzej.murawski at cs.ox.ac.uk Sun Jan 23 10:28:55 2022 From: andrzej.murawski at cs.ox.ac.uk (Andrzej Murawski) Date: Sun, 23 Jan 2022 15:28:55 +0000 Subject: [TYPES/announce] 2022 Alonzo Church Award: Call for Nominations Message-ID: <9B96CA49-A134-4C84-BCA1-6BA10CE17013@cs.ox.ac.uk> CALL FOR NOMINATIONS The 2022 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 Goedel 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://urldefense.com/v3/__https://siglog.org/alonzo-church-award/__;!!IBzWLUs!BKVEikj1gREQPOI3SP8qLTLMeqRWrglkQtq8WUBUViwBxgrN-CpN-CGciTtTTdnV1OS4__mNJ8uIIA$ , https://urldefense.com/v3/__https://www.eatcs.org/index.php/church-award/__;!!IBzWLUs!BKVEikj1gREQPOI3SP8qLTLMeqRWrglkQtq8WUBUViwBxgrN-CpN-CGciTtTTdnV1OS4__lErkY7ww$ , and https://urldefense.com/v3/__https://www.eacsl.org/alonzo-church-award/__;!!IBzWLUs!BKVEikj1gREQPOI3SP8qLTLMeqRWrglkQtq8WUBUViwBxgrN-CpN-CGciTtTTdnV1OS4__niSKTAWg$ . The 2021 Alonzo Church Award was given jointly to Georg Gottlob, Christoph Koch, Reinhard Pichler, Luc Segoufin and Klaus U. Schulz for their ground-breaking work on logic-based web-data extraction, and querying tree-structured data. 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 2022 award, the cut-off date is January 1, 1997. 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 Goedel 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 2022 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 rjagadee at depaul.edu by April 2, 2022. PRESENTATION OF THE AWARD The 2022 award will be presented at the Federated Logic Conference 2022, which is scheduled to take place in Haifa, Israel in July/August 2022. 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 2022 Alonzo Church Award Committee consists of the following five members: Thomas Colcombet, Mariangiola Dezani, Javier Esparza, Radha Jagadeesan (chair), and Igor Walukiewicz. -------------- next part -------------- An HTML attachment was scrubbed... URL: From laura.titolo at nianet.org Fri Jan 21 11:19:27 2022 From: laura.titolo at nianet.org (Titolo, Laura) Date: Fri, 21 Jan 2022 16:19:27 +0000 Subject: [TYPES/announce] First call for papers SOAP 2022 Message-ID: =============================================================== ? ? ? ? The 11th ACM SIGPLAN International Workshop ? ? on the State of the Art in Program Analysis (SOAP) ? ? ? ? ? ? ? ? ? ? ? Call for Papers ? ? ? ? ? ? ? ? ? ? June 2022 ? ? ? ? ? ? ?https://urldefense.com/v3/__https://pldi22.sigplan.org/home/SOAP-2022__;!!IBzWLUs!Gl-Qbh0p2cMcJ58xN79UfkkXDnktzApzCOuGmWiYFUOUt3vtxpPxuzS5lSQwxsaKILY5Siqh7RAuXA$ ? ? ? ? ? ? ? ? ? Co-located with PLDI 2022 =============================================================== 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 2022 aims to bring together the members of the program analysis community to share new developments and shape new innovations in program analysis. For SOAP 2022, 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. Important Dates ================ 8 March 2022: Submission deadline 21 April 2022: Author notification 5 May 2022: Camera ready deadline June 2022: Workshop Submission Details ================== Submissions should be 4 to 6 pages long 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 https://urldefense.com/v3/__https://www.sigplan.org/Resources/Author/__;!!IBzWLUs!Gl-Qbh0p2cMcJ58xN79UfkkXDnktzApzCOuGmWiYFUOUt3vtxpPxuzS5lSQwxsaKILY5Siow5pcncA$ . The preprint template should be set to use 10pt font and ?numbers? to ensure numerical style citations, that is: \documentclass[10pt, numbers]{sigplanconf}. Papers must be submitted in PDF format at the EasyChair submission site: https://urldefense.com/v3/__https://easychair.org/my/conference?conf=soap2022__;!!IBzWLUs!Gl-Qbh0p2cMcJ58xN79UfkkXDnktzApzCOuGmWiYFUOUt3vtxpPxuzS5lSQwxsaKILY5SipC945zvw$ . More Information ================ For additional information, please visit the website, follow @SOAP_Workshop on Twitter, or contact the chairs Laure Gonnord and Laura Titolo at? soap2022 at easychair.org. From s-dgq at thorsten-wissmann.de Fri Jan 21 11:40:37 2022 From: s-dgq at thorsten-wissmann.de (Thorsten Wissmann) Date: Fri, 21 Jan 2022 17:40:37 +0100 Subject: [TYPES/announce] CMCS 2022: Final Call for Papers Message-ID: <20220121164037.GA2548@dobby> Final 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!C7i6NKTQ0hS_Bv1ouug3VdTEqILx94PLVTP3FFC85tqMi4-x3IMq7Nb9KZNKlo5lCwlFT2lpcONN-g$ *Updates wrt Second CfP: Venue and event, Important Dates*. 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. We aim for an event with maximal on-site participation, but a hybrid format will be provided if necessary. In particular, speakers will be able to present virtually if an on-site presentation is not possible due to Covid restrictions. Keynote speaker --------------- Ana Sokolova, University of Salzburg, Austria Invited speakers ---------------- Renato Neves, University of Minho, Portugal Sam Staton, University of Oxford, United Kingdom Invited tutorial speakers ------------------------- There will be a special session on Data Languages with invited tutorials by: S?awomir Lasota, University of Warsaw, Poland Mahsa Shirmohammadi, CNRS & University of Paris, France Important dates --------------------------- Abstract regular papers 24 January 2022 Submission regular papers 27 January 2022 Notification regular papers 28 February 2022 Camera-ready copy 18 March 2022 Submission short contributions 3 March 2022 Notification short contributions 9 March 2022 (We have been informed that ETAPS workshop registration fees will be constant across all registration deadlines.) 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, Chapman University, United States 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. A clearly-marked appendix containing technical proofs can be added, but this will not be published in the proceedings. Note that the 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!C7i6NKTQ0hS_Bv1ouug3VdTEqILx94PLVTP3FFC85tqMi4-x3IMq7Nb9KZNKlo5lCwlFT2k7W-8otQ$ 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. Accepted short contributions will be bundled in a technical report. From tobias.kappe at gmail.com Sun Jan 23 11:34:33 2022 From: tobias.kappe at gmail.com (=?UTF-8?Q?Tobias_Kapp=C3=A9?=) Date: Sun, 23 Jan 2022 17:34:33 +0100 Subject: [TYPES/announce] Learning and Automata (LearnAut) 2022 -- ICALP 2022 Workshop Message-ID: Learning and Automata (LearnAut) -- ICALP 2022 workshop July 4th - Paris, France and virtually Website: https://urldefense.com/v3/__https://learnaut22.github.io__;!!IBzWLUs!GDMrgPGGFRjPChNMsHB5nknthYpsSDVfsqu5kId-tlN48fqK4tFBINCVrHIq6ZMzVag1J90ettvLCQ$ Learning models defining recursive computations, like automata and formal grammars, are the core of the field called Grammatical Inference (GI). The expressive power of these models and the complexity of the associated computational problems are major research topics within mathematical logic and computer science. Historically, there has been little interaction between the GI and ICALP communities, though recently some important results started to bridge the gap between both worlds, including applications of learning to formal verification and model checking, and (co-)algebraic formulations of automata and grammar learning algorithms. The goal of this workshop is to bring together experts on logic who could benefit from grammatical inference tools, and researchers in grammatical inference who could find in logic and verification new fruitful applications for their methods. We invite submissions of recent work, including preliminary research, related to the theme of the workshop. The Program Committee will select a subset of the abstracts for oral presentation. At least one author of each accepted abstract is expected to represent it at the workshop (in person, or virtually). Note that accepted papers will be made available on the workshop website but will not be part of formal proceedings (i.e., LearnAut is a non-archival workshop). Topics of interest include (but are not limited to): - Computational complexity of learning problems involving automata and formal languages. - Algorithms and frameworks for learning models representing language classes inside and outside the Chomsky hierarchy, including tree and graph grammars. - Learning problems involving models with additional structure, including numeric weights, inputs/outputs such as transducers, register automata, timed automata, Markov reward and decision processes, and semi-hidden Markov models. - Logical and relational aspects of learning and grammatical inference. - Theoretical studies of learnable classes of languages/representations. - Relations between automata or any other models from language theory and deep learning models for sequential data. - Active learning of finite state machines and formal languages. - Methods for estimating probability distributions over strings, trees, graphs, or any data used as input for symbolic models. - Applications of learning to formal verification and (statistical) model checking. - Metrics and other error measures between automata or formal languages. ** Invited speakers ** Jeffrey Heinz (Stony Brook University) Ariadna Quattoni (Universitat Polit?cnica de Catalunya) ** Submission instructions ** Submissions in the form of extended abstracts must be at most 8 single-column pages long at most (plus at most four for bibliography and possible appendixes) and must be submitted in the JMLR/PMLR format. The LaTeX style file is available here: https://urldefense.com/v3/__https://ctan.org/tex-archive/macros/latex/contrib/jmlr__;!!IBzWLUs!GDMrgPGGFRjPChNMsHB5nknthYpsSDVfsqu5kId-tlN48fqK4tFBINCVrHIq6ZMzVag1J91Brtbzig$ We do accept submissions of work recently published or currently under review. - Submission url: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=learnaut2022__;!!IBzWLUs!GDMrgPGGFRjPChNMsHB5nknthYpsSDVfsqu5kId-tlN48fqK4tFBINCVrHIq6ZMzVag1J91AVfyQjQ$ - Submission deadline: March 31st - Notification of acceptance: April 30th - Early registration: TBD ** Program Committee ** TBD ** Organizers ** Remi Eyraud (University of Saint-?tienne) Tobias Kapp? (ILLC, University of Amsterdam) Guillaume Rabusseau (Mila & DIRO, Universit? de Montr?al) Matteo Sammartino (Royal Holloway, University of London & University College London) -------------- next part -------------- An HTML attachment was scrubbed... URL: From l.oconnor at ed.ac.uk Mon Jan 24 13:00:55 2022 From: l.oconnor at ed.ac.uk (Liam O'CONNOR) Date: Mon, 24 Jan 2022 18:00:55 +0000 Subject: [TYPES/announce] Fully-funded PhD studentship at Edinburgh Message-ID: I have a funded PhD studentship available (at LFCS, Uni of Edinburgh) to anyone with a good proposal related to PL/FM. In particular I'm hoping to work with someone on my Quickstrom project (a property-based testing tool based on Linear Temporal Logic). More details here: https://urldefense.com/v3/__http://liamoc.net/work_with_me.html__;!!IBzWLUs!E1GQLOUROiFFzfiEBQnyUc1LXXM3FOcciQEF-XBgbUlkuMCUbJEP7wj4i6zx2lw4zj80ZyzMJt-7VA$ Please contact me if interested, or forward this message to anyone who might be. With best wishes, Liam 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 adamc at csail.mit.edu Mon Jan 24 13:26:11 2022 From: adamc at csail.mit.edu (Adam Chlipala) Date: Mon, 24 Jan 2022 13:26:11 -0500 Subject: [TYPES/announce] POPL 2022 Virtual Workshop this week Message-ID: <885363a8-5b40-b00a-b5f0-02501d024507@csail.mit.edu> The in-person POPL 2022 conference week just wrapped up, but its separate virtual supplement is about to begin!? We are planning two days of high-interaction online events, scheduled to be accessible across time zones.? Please consider attending, regardless of whether you participated in last week's hybrid events.? We have a number of plenary sessions and networking opportunities planned; see below for details. Check out the web site for the virtual workshop: https://urldefense.com/v3/__https://popl22.sigplan.org/track/POPL-2022-virtual-workshop__;!!IBzWLUs!Hk1Guf8dMsuaTHILbmOx7EqT-JU4lvnxBatu6nZy0xII84MBbsLma3qr1uQPFsToQlmbpOn96iq-xw$ There are two ways to participate.? The less-interactive way is to watch a YouTube stream, which will be embedded in the page above, closer to the event.? The second way is to register for POPL and join in the Airmeet virtual-conference software: https://urldefense.com/v3/__https://regmaster.com/2022conf/POPL22/register.php__;!!IBzWLUs!Hk1Guf8dMsuaTHILbmOx7EqT-JU4lvnxBatu6nZy0xII84MBbsLma3qr1uQPFsToQlmbpOn4mRIbhA$ Registrations from hybrid POPL Week also grant access to the virtual workshop, using the same Airmeet software.? Those who want the full virtual-workshop experience but didn't register for hybrid POPL Week can still register at the relatively low virtual-only rate. What's happening at the virtual workshop? Hang out in the Lounge section of Airmeet, to video-chat with authors of POPL Week papers or discuss whatever's on your mind. Join a speed-networking session to be randomly matched with others on complementary sides of four divides: POPL sponsor companies chatting with job seekers, faculty chatting with prospective faculty and PhD students, mentors chatting with junior-faculty mentees, and mentors chatting with senior-PhD-student and postdoc mentees.? If a short conversation reveals that an even longer conversation is called for, use Airmeet's "private meetings" feature to schedule something that becomes integrated into your personal view of the workshop schedule (or use your own out-of-band mechanism, of course). Then there are the plenary sessions, designed to be interactive, with speakers taking live questions and adjusting demos accordingly. In our first keynote, Lukasz Kaiser from OpenAI will present their Codex system, including an interactive demo and Q&A. This is the programming-by-machine-learning system that has so many people excited lately! Our second keynote is from Andreas Rossberg , who is a lead designer of the formal semantics for WebAssembly , in addition to playing other key roles in the design and support of that language, meant to be the ideal cross-platform compiler target for the web and more. He will tell us about the social and technical sides of that effort. If you haven?t already, you might want to consider targeting WebAssembly from your next research compiler! In our first tutorial, Hakjoo Oh will teach us how to bring machine-learning tools into program-analysis research. Our second tutorial is Rustan Leino showing off some of the more advanced features of his Dafny verification tool. Our first panel is on /the future of proof assistants for programming languages and math/, featuring Kevin Buzzard , Favonia , Zhong Shao , and Nicolas Tabareau . Our second panel, on /the future of concurrency and parallelism/, features Stephanie Balzer , Jeehoon Kang , Keshav Pingali , and Ilya Sergey . -------------- next part -------------- An HTML attachment was scrubbed... URL: From nclpltt at gmail.com Wed Jan 26 12:03:23 2022 From: nclpltt at gmail.com (Nicola Paoletti) Date: Wed, 26 Jan 2022 17:03:23 +0000 Subject: [TYPES/announce] ACM HSCC 2022 -- Call for Posters and Demos (deadline 14 February) Message-ID: ============================================================ ACM HSCC 2022 Call for Posters and Demos 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!GmK762NBnW_LFBoRjTluvHPB611dEJKl5v7jWvU1D-IaA-0igyDpsuwrLRwVcuJckVBv5aEUWTOtGw$ ============================================================ # Scope of HSCC 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). The conference covers a wide spectrum of topics from theoretical results to practical considerations, and from academic research to industrial adoption. # Posters and Demos Posters presented at the conference will provide an opportunity for conference attendees to interact with researchers in an informal setting. Posters may be about already accepted papers, ongoing research projects, discussions on new problem statements, or preview of late-breaking results. Demos will give the audience a closer look at tools and techniques, and offer an interactive experience with the demonstrated entities. The selection criteria for acceptance will be: novelty, technical merit, relevance to HSCC and, especially for demos, details on the presentation. If desired and not previously published, abstracts up to 2 page in length describing the poster or demo **will be included for publication in the electronic proceedings of HSCC**. These sessions are an excellent way to exchange ideas and for presenters to obtain feedback from the attendees. **A Best Poster/Demo prize will be awarded and announced during the conference and on the website.** **Deadline: 14 February AOE** See https://urldefense.com/v3/__https://hscc.acm.org/2022/call-for-posters-and-demos/__;!!IBzWLUs!GmK762NBnW_LFBoRjTluvHPB611dEJKl5v7jWvU1D-IaA-0igyDpsuwrLRwVcuJckVBv5aETQZ8X-Q$ for more information and submission instructions. -- Nicola Paoletti Lecturer - Department of Computer Science - Royal Holloway, University of London Bedford building 2-25 https://urldefense.com/v3/__https://nicolapaoletti.com/__;!!IBzWLUs!GmK762NBnW_LFBoRjTluvHPB611dEJKl5v7jWvU1D-IaA-0igyDpsuwrLRwVcuJckVBv5aFOGuVsbQ$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From smuller2 at iit.edu Thu Jan 27 11:25:30 2022 From: smuller2 at iit.edu (Stefan Muller) Date: Thu, 27 Jan 2022 11:25:30 -0500 Subject: [TYPES/announce] Funded PhD positions available at Illinois Tech Message-ID: <06e992ed-cb9f-349b-7549-755160375d7c@iit.edu> I'm looking for PhD students to join me on one of several projects relating to programming languages, analysis tools and type systems for parallel, concurrent and high-performance computing. Projects my group is actively involved in include: - Performance analysis and optimization for CUDA kernels - Static analysis techniques to aid in heterogeneous computing frameworks for AI-enabled science - Static analysis of the parallel dependency structure of code in order to aid reasoning and optimization I'm also open to new projects along these general lines, according to the interest and experience of students. I am looking for candidates with experience in type systems and some experience (or interest to learn) in parallel, concurrent or high-performance computing. Additional skills such as compiler building or use of proof assistants could be helpful on certain projects. Illinois Tech is located a few minutes from downtown Chicago in the historic, diverse Bronzeville neighborhood and the location provides opportunities for connections with the community, including local high schools. Our high-performance computing group is among the top in the country and frequently collaborates with Argonne National Labs, just outside Chicago. Overall, this is an exciting place to be! The application is here: https://urldefense.com/v3/__https://www.iit.edu/admissions-aid/apply__;!!IBzWLUs!B2_0c-kPBuBiII5kJapTsnbFFu4jz2XvDKqHbzQkthOI3ELGF98KtM3R62T7xo2r0lMJYhuoFGNQRw$ . The official deadline is Jan. 31, but applications will be considered after that and the application is quite straightforward. If you're interested, do drop me an email since the applications all go into the same pool and I wouldn't want to miss any. Let me know if you'd like more information, or see my website: https://urldefense.com/v3/__http://cs.iit.edu/*smuller/__;fg!!IBzWLUs!B2_0c-kPBuBiII5kJapTsnbFFu4jz2XvDKqHbzQkthOI3ELGF98KtM3R62T7xo2r0lMJYhufLsMROg$ Stefan -- Stefan Muller Gladwin Development Chair Assistant Professor Computer Science Department Illinois Institute of Technology From s-dgq at thorsten-wissmann.de Tue Jan 25 16:40:13 2022 From: s-dgq at thorsten-wissmann.de (Thorsten Wissmann) Date: Tue, 25 Jan 2022 22:40:13 +0100 Subject: [TYPES/announce] CMCS 2022: Deadline extension Message-ID: <20220125214013.GA25040@dobby> Call for Papers **Deadline Extension** 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!AsSXWYWFrN-QHYii2o_A7voPXPB2SEvIU1Jb4jOn07Inv9b0pOuvp0F0lQbHxu2mK8-DD8dDIy8saw$ *Updates wrt Final CfP: Important Dates*. 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. We aim for an event with maximal on-site participation, but a hybrid format will be provided if necessary. In particular, speakers will be able to present virtually if an on-site presentation is not possible due to Covid restrictions. Keynote speaker --------------- Ana Sokolova, University of Salzburg, Austria Invited speakers ---------------- Renato Neves, University of Minho, Portugal Sam Staton, University of Oxford, United Kingdom Invited tutorial speakers ------------------------- There will be a special session on Data Languages with invited tutorials by: S?awomir Lasota, University of Warsaw, Poland Mahsa Shirmohammadi, CNRS & University of Paris, France Important dates (NEW) ------------------------------------------------- Abstract regular papers 31 January 2022 (new) Submission regular papers 3 February 2022 (new) Notification regular papers 7 March 2022 (new) Camera-ready copy 25 March 2022 (new) Submission short contributions 3 March 2022 Notification short contributions 9 March 2022 All dates are inclusive and Anywhere on Earth (AoE). (We have been informed that ETAPS workshop registration fees will be constant across all registration deadlines.) 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, Chapman University, United States 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. A clearly-marked appendix containing technical proofs can be added, but this will not be published in the proceedings. Note that the 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!AsSXWYWFrN-QHYii2o_A7voPXPB2SEvIU1Jb4jOn07Inv9b0pOuvp0F0lQbHxu2mK8-DD8fJMWN1ZA$ 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. Accepted short contributions will be bundled in a technical report. From wjb at williamjbowman.com Thu Jan 27 18:47:35 2022 From: wjb at williamjbowman.com (PLDI Publicity Chair) Date: Thu, 27 Jan 2022 15:47:35 -0800 Subject: [TYPES/announce] PLDI SRC 2022 -- Call for Submissions Message-ID: Please distribute widely: # Call for Student Research Competition Submissions https://urldefense.com/v3/__https://pldi22.sigplan.org/track/pldi-2022-SRC__;!!IBzWLUs!GW84t_BhxW8CSQ9FoRYrzDsHwbCVjn4G9AUxhv6Riv6xCX3lKR2ALn8mxHEei3umcFq3WdVxHQaGkg$ The Student Research Competition (SRC) at PLDI allows students to present their research and get feedback from prominent members of the programming language research community. It?s an opportunity for students to network, practice presentation skills, and showcase their work. PLDI invites students (both at the graduate and undergraduate level) to submit their research. We acknowledge that the past several years have been difficult for conference organization. As a community, we have worked together to implement various options for remote accessibility. We have found different formats have had different positive and negative components. For fully virtual conferences, we have missed seeing our friends and colleagues in person; on the other hand, for virtual conferences, we have enjoyed seeing more participation globally. However, many have found that a hybrid format inhibits engagement from all participants (remote and in-person). The Student Research Competition (SRC) at PLDI 2022 aims to incorporate the positive components (increased accessibility) while mitigating the negative components (limited engagement). To that end, we are excited to pilot a **two-track PLDI SRC** this year. # Two-Track SRC Model This model comprises of two pools of submissions: (1) students who present their work primarily in-person, and (2) students who present their work primarily virtually. To aid with planning, students should select one of the tracks at submission time; however, due to the volatility of public health guidelines/restrictions, this year, students will be able to change their track after the submission. Our hope is that the virtual track will allow more students to participate, regardless of travel restrictions or monetary constraints. However, we will note that virtual participants may have limited access to the rest of the conference depending on how the different programs are offered (e.g., if they are streamed or not). Thus, in-person attendees will likely be able to engage with the wider conference, and attendees, more fully. *Note that the selection criterion of the Student Research Competition is not dependent on the mode of presentation. All students will be evaluated according to the same criteria.*** # Submission The main body of the submission is a title and extended abstract consisting of 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 PLDI 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. The final submission must also include the student author?s name, email address, institutional affiliation, research advisor?s name(s), ACM student member number, category (undergraduate or graduate), and mode of presentation (in-person or virtual). We recommend including all this information in the standard author contact information region. Submissions must be original research that is not already published at PLDI 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. The extended abstract must not exceed 1000 words and must not be longer than 2 pages. Reference lists do not count towards these limits. Please use the ACM Conference Proceedings Template found here https://urldefense.com/v3/__https://www.overleaf.com/read/yggzbgjwjntv__;!!IBzWLUs!GW84t_BhxW8CSQ9FoRYrzDsHwbCVjn4G9AUxhv6Riv6xCX3lKR2ALn8mxHEei3umcFq3WdXRGeDwbA$ with line numbers turned on. When you?re ready, submit your extended abstract at the submission site: https://urldefense.com/v3/__https://pldi22src.hotcrp.com__;!!IBzWLUs!GW84t_BhxW8CSQ9FoRYrzDsHwbCVjn4G9AUxhv6Riv6xCX3lKR2ALn8mxHEei3umcFq3WdUla7QQcQ$ . Should you have any questions on if your work is a good fit for the SRC track, please reach out to the SRC Co-Chairs. # Presentation and Attendance Students accepted to the SRC based on their extended abstracts will proceed to the Poster (pre-Finale) Round. For the Poster Round, students must submit: - a research poster to present at PLDI, - a 5-minutes pre-recorded talk In the two-track SRC model, the in-person track will be formatted as a traditional SRC: there will be an in-person poster session for three hours, in which PLDI attendees and in-person judges can walk around and interact with the students. The virtual track will be held in a virtual space that will be available to all PLDI attendees. In addition, we will have a pool of virtual judges that will walk around and interact with the virtual students. For some cross-over, we will organize for a TV in the in-person session, which will rotate through the virtual posters. The top three undergraduate participants and the top three graduate participants (selected across both the virtual and in-person tracks) will proceed to the Final Presentation Round. The final round of SRC will be conducted in a conference room where in-person finalists will first present (streamed over Zoom), and virtual finalists will present via Zoom. Both the virtual and in-person judges/attendees will get a chance to ask questions during the Q&A session after each talk. # Participation The Student Research Competition (SRC) at PLDI has always strived to improve engagement and accessibility to students around the world. To this aim, we will provide the opportunity for a round of asynchronous peer-review discussions amongst the SRC participants. The peer-review process is an opportunity for the SRC speakers to share their feedback, ask questions to their fellow peers, and help them make improvements for the poster and presentation round. This is also an opportunity for in-person and virtual speakers to engage prior to the SRC poster round. We hope to utilize our experiences over the last two years to enable sufficient engagement in both tracks. We will work to provide tooling support, organization, and publicity to ensure all participants have a positive experience. Good luck, and we hope to see you in June! From m.sadrzadeh at ucl.ac.uk Fri Jan 28 04:39:43 2022 From: m.sadrzadeh at ucl.ac.uk (Sadrzadeh, Mehrnoosh) Date: Fri, 28 Jan 2022 09:39:43 +0000 Subject: [TYPES/announce] Beth Outstanding Dissertation Prize 2022: First Call for Nominations Message-ID: First Call for Nominations: E. W. Beth Outstanding Dissertation Prize 2022 Since 1998, 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 (https://urldefense.com/v3/__http://www.folli.info/?page_id=74__;!!IBzWLUs!BjMR6N_QpngBxvD0uBW__BnvDgMabGFiO7mypREtsP9lIi-_NbwRwLZ54eb9hGFMJZSfK8c6qlqrJg$ ), with financial support of the E.W. Beth Foundation (https://urldefense.com/v3/__https://www.knaw.nl/en/awards/funds/evert-willem-beth-stichting/evert-willem-beth-foundation__;!!IBzWLUs!BjMR6N_QpngBxvD0uBW__BnvDgMabGFiO7mypREtsP9lIi-_NbwRwLZ54eb9hGFMJZSfK8eXWOEOLA$ ). Nominations are now invited for outstanding dissertations in these areas resulting in a Ph.D. degree awarded in 2021. The deadline for nominations is the 15th of April 2022. Qualifications: - A Ph.D. dissertation on a related topic is eligible for the Beth Dissertation Prize 2022, if the degree was awarded between January 1st and December 31st, 2021. - 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 outstanding dissertations on topics in the broad remit of ESSLLI, in logic, language, information and computation. Interdisciplinary dissertations with results impacting various of these research areas in their investigations are especially solicited. - If a nominated dissertation has originally been written in a language other than English, its file 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 2023. The English translation must in such cases be submitted before the deadline of the call for nominations in 2023. 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 a single nomination file in zip format: - 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://urldefense.com/v3/__https://easychair.org/conferences/?conf=bodp2022__;!!IBzWLUs!BjMR6N_QpngBxvD0uBW__BnvDgMabGFiO7mypREtsP9lIi-_NbwRwLZ54eb9hGFMJZSfK8c7rTxFxQ$ . 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 33rd ESSLLI summer school, in Galway, August 8-19, 2021. Beth dissertation prize committee 2022: 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) Christoph Haase (University of Oxford) Reinhard Muskens (University of Amsterdam) Francesca Poggiolesi (CNRS, IHPST, University of Paris 1) Mehrnoosh Sadrzadeh (University College London, chair) Ana Sokolova (University of Salzburg) Mark Steedman (University of Edinburgh) Carla Umbach (University of Koeln) 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 Radu.Iosif at univ-grenoble-alpes.fr Fri Jan 28 13:18:37 2022 From: Radu.Iosif at univ-grenoble-alpes.fr (Radu Iosif) Date: Fri, 28 Jan 2022 19:18:37 +0100 Subject: [TYPES/announce] Workshop on Advances in Separation Logics (ASL 2022 @ FLOC 2022) Message-ID: Workshop on Advances in Separation Logics (ASL 2022), Haifa, Israel, July 31st 2022 https://urldefense.com/v3/__https://asl-workshop.github.io/asl22/__;!!IBzWLUs!AJdIt5iRSo3ldngiNxmLyUr_vR4UJb6j39KU2NqiANpSj9IXQtqqPLat2ZRtHbT9BdKn_3_ti0NgZg$ The past two decades have witnessed important progress in static analysis and verification of code with low-level pointer and heap manipulations, mainly due to the development of Separation Logic (SL). SL is a resource logic, a dialect of the logic of Bunched Implications (BI) designed to describe models of the heap memory and the mutations that occur in the heap as the result of low-level pointer updates. The success of SL in program analysis is due to the support for local reasoning, namely the ability of describing only the resource(s) being modified, instead of the entire state of the system. This enables the design of compositional analyses that synthesize specifications of the behavior of small parts of the program before combining such local specifications into global verification conditions. Another interesting line of work consists in finding alternatives to the underlying semantic domain of SL, namely heaps with aggregative composition, in order to address other fields incomputing, such as self-adapting distributed networks, blockchain and population protocols, social networks or biological systems. We consider submissions on topics including: * decision procedures for SL and other resource logics, * computational complexity of decision problems such as satisfiability, entailment and abduction for SL and other resource logics, * axiomatisations and proof systems for automated or interactive theorem proving for SL and other resource logics, * verification conditions for real-life interprocedural and concurrent programs, using SL and other resource logics, * alternative semantics and computation models based on the notion of resource, * application of separation and resource logics to different fields, such as sociology and biology. ASL 2022 is a workshop affiliated to IJCAR 2022 at FLOC 2022. Keynote Speakers * Philippa Gardner, Imperial College London * Ralf Jung, MIT CSAIL Important Dates * Papers due: May 10, 2022 (AoE) * Authors notification: June 15, 2022 (AoE) * Workshop: July 31, 2022 Program Committee Nadia Polikarpova (UCSD, San Diego, USA) James Brotherston (UCL, London, UK) Qinxiang Cao (Shanghai Jiaotong University) Dan Frumin (University of Groningen, The Netherlands) Lennart Beringer (Princeton University, USA) Arthur Chargu?raud (INRIA Strasbourg, France) Radu Iosif (Verimag, CNRS, Univ. Grenoble Alpes, France) Le Quang Loc (UCL, London, UK) Alessio Mansutti (University of Oxford, UK) Christoph Matheja (DTU, Lyngby, Denmark) Daniel M?ry (University of Loraine, France) Koji Nakazawa (Nagoya University, Japan) Nicolas Peltier (LIG, CNRS, Grenoble, France) Adam Rogalewicz (Brno University of Technology, Czech Republic) Mihaela Sighireanu (LMF, ENS Paris-Saclay, France) Florian Zuleger (Vienna University of Technology, Austria) Organizing committee Radu Iosif (Verimag, CNRS, Univ. Grenoble Alpes, France) Nikos Gorogiannis (Facebook, UCL, London, UK) Robbert Krebbers (Radboud Univ. Nijmegen, The Netherlands) Mihaela Sighireanu (LMF, ENS Paris-Saclay, France) Makoto Tatsuta (NII, Tokyo, Japan) Thomas Noll (RWTH, Aachen, Germany) From maurizio.proietti at iasi.cnr.it Sun Jan 30 15:51:42 2022 From: maurizio.proietti at iasi.cnr.it (Maurizio Proietti) Date: Sun, 30 Jan 2022 21:51:42 +0100 Subject: [TYPES/announce] HCVS 2022 - Final Call for Papers (Deadline extended 13th February) In-Reply-To: References: Message-ID: Call for Papers (Extended Deadlines) 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!Ed5a9VPJ9Rs6sL9ryYDJeV3Zgn5l-NhR7KuVVRqrAUZF-cOuIz7dfsRaZ46y7RW5OZnghuKmT3tJ_Q$ Invited speakers: Aws Albarghouti, University of Wisconsin, USA Bruno Blanchet, INRIA, Paris, France Important dates: - Paper submission deadline: Feb 13, 2022 (Extended) - Paper notification: March 3, 2022 (Extended) - 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 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 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!Ed5a9VPJ9Rs6sL9ryYDJeV3Zgn5l-NhR7KuVVRqrAUZF-cOuIz7dfsRaZ46y7RW5OZnghuKB_heU3g$ ), 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!Ed5a9VPJ9Rs6sL9ryYDJeV3Zgn5l-NhR7KuVVRqrAUZF-cOuIz7dfsRaZ46y7RW5OZnghuKxVgkKEQ$ ) 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!Ed5a9VPJ9Rs6sL9ryYDJeV3Zgn5l-NhR7KuVVRqrAUZF-cOuIz7dfsRaZ46y7RW5OZnghuKxVgkKEQ$ (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!Ed5a9VPJ9Rs6sL9ryYDJeV3Zgn5l-NhR7KuVVRqrAUZF-cOuIz7dfsRaZ46y7RW5OZnghuKSRGKvgQ$ -- 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!Ed5a9VPJ9Rs6sL9ryYDJeV3Zgn5l-NhR7KuVVRqrAUZF-cOuIz7dfsRaZ46y7RW5OZnghuKvh3j-sw$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From cmezzina at gmail.com Mon Jan 31 12:12:30 2022 From: cmezzina at gmail.com (Claudio Mezzina) Date: Mon, 31 Jan 2022 18:12:30 +0100 Subject: [TYPES/announce] RC2022 final call for papers Message-ID: ======================================================================= Final Call for Papers 14th Conference on Reversible Computation (RC 2022) https://urldefense.com/v3/__https://reversible-computation-2022.github.io/__;!!IBzWLUs!Ghp-cJnOKbDutg1esxRpDLaLWVGZQsfqXmKibuoHb6q-9x9R8WJK_5X8HsnE7SeORV3QT0Akcj_upA$ July 5th-6th, 2022, Urbino, Italy Abstract Submission: Mon, February 7th, 2022 Submission Deadline: Mon, February 21st, 2022 ======================================================================= ++++++++++ COVID-19 RC 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 cancel the physical event and adopt a fully remote solution ++++++++++ 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 ===== - Robert O'Callahan (rr debugger developer - Mozilla Foundation/Pernosco) - Vincent van Wingerden (Quantum Computing - Microsoft) ===== 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!Ghp-cJnOKbDutg1esxRpDLaLWVGZQsfqXmKibuoHb6q-9x9R8WJK_5X8HsnE7SeORV3QT0BuzM4cpg$ SPECIAL ISSUE Selected papers will be invited to a special issue on the Journal of Logical and Algebraic Methods ===== 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 serge.autexier at dfki.de Mon Jan 31 14:59:55 2022 From: serge.autexier at dfki.de (Serge Autexier) Date: Mon, 31 Jan 2022 20:59:55 +0100 (CET) Subject: [TYPES/announce] CICM 2022, 15th Conference on Intelligent Comouter Matehmatics 2022, First Call for Papers, May 9th, 2022, abstract submissions Deadline Message-ID: <20220131195955.A765E4322E2B@gigondas.localdomain> Call for Papers formal papers - informal papers - doctoral programme 15th Conference on Intelligent Computer Mathematics - CICM 2022 - September 19-23, 2022 Tbilisi, Georgia https://urldefense.com/v3/__http://www.cicm-conference.org/2022__;!!IBzWLUs!GvQYlIgCGWmx9BWZzyglKfpmnnsDk73DV2Xe9bm1UKHGpuq2s7Z6Iux_QBrwRF7j6uNPvN-XZU1Nfg$ ---------------------------------------------------------------------- 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 2022 Invited Speakers: TBA CICM 2022 Programme committee: see https://urldefense.com/v3/__https://www.cicm-conference.org/2022/cicm.php?event=&menu=pc__;!!IBzWLUs!GvQYlIgCGWmx9BWZzyglKfpmnnsDk73DV2Xe9bm1UKHGpuq2s7Z6Iux_QBrwRF7j6uNPvN8_WqAWlw$ CICM 2022 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 LNAI: * 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: May 9. - Full paper deadline: May 13 - Reviews sent to authors: June 19 - Rebuttals due: June 23 - Notification of acceptance: July 4 - Camera-ready copies due: July 18 - Conference: September 19-23, 2022 Informal submissions and doctoral programme - Submission deadline: July 15 - Notification of acceptance: July 29 All submissions should be made via EasyChair at https://urldefense.com/v3/__https://easychair.org/conferences/?conf=cicm2022__;!!IBzWLUs!GvQYlIgCGWmx9BWZzyglKfpmnnsDk73DV2Xe9bm1UKHGpuq2s7Z6Iux_QBrwRF7j6uNPvN9EafHaZQ$ As in previous years, the CICM 2022 proceedings will be published in the LNAI subseries of Springer LNCS. For the LNCS style files, see: https://urldefense.com/v3/__https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines__;!!IBzWLUs!GvQYlIgCGWmx9BWZzyglKfpmnnsDk73DV2Xe9bm1UKHGpuq2s7Z6Iux_QBrwRF7j6uNPvN-ZjbPwdQ$ From Simon.Gay at glasgow.ac.uk Fri Jan 28 08:22:04 2022 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Fri, 28 Jan 2022 13:22:04 +0000 Subject: [TYPES/announce] Research Post in Session Types for Erlang at University of Glasgow, UK Message-ID: <0f8fbf4f-70a4-1627-8348-a6376c50e687@glasgow.ac.uk> An opportunity to do research into developing session types and associated tools for Erlang as part of the STARDUST project: https://urldefense.com/v3/__https://epsrc-stardust.github.io/__;!!IBzWLUs!Fu1fb2pbqH8MvM1tgijq0XWGbKGCyJv-14oSkFa9qmfxv8TGYg6vWLJijHCYTooNdZTlmXArtI4PqA$ Full details below, Simon Gay ===================================================== University of Glasgow College of Science and Engineering School of Computing Science Research Assistant / Associate Ref: 077847 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!Fu1fb2pbqH8MvM1tgijq0XWGbKGCyJv-14oSkFa9qmfxv8TGYg6vWLJijHCYTooNdZTlmXDshwkHRg$ *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_jobspec_version_4.jobspec?p_id=077847__;!!IBzWLUs!Fu1fb2pbqH8MvM1tgijq0XWGbKGCyJv-14oSkFa9qmfxv8TGYg6vWLJijHCYTooNdZTlmXA_0WOplg$ Also: https://urldefense.com/v3/__https://www.jobs.ac.uk/job/CMS487/research-assistant-associate__;!!IBzWLUs!Fu1fb2pbqH8MvM1tgijq0XWGbKGCyJv-14oSkFa9qmfxv8TGYg6vWLJijHCYTooNdZTlmXAnrVf1PQ$ Closing date: 15th March 2022 The University of Glasgow, charity number SC004401. From pierre-marie.pedrot at inria.fr Fri Jan 28 08:32:54 2022 From: pierre-marie.pedrot at inria.fr (=?UTF-8?Q?Pierre-Marie_P=c3=a9drot?=) Date: Fri, 28 Jan 2022 14:32:54 +0100 Subject: [TYPES/announce] TYPES 2022 -- Second call for contributions Message-ID: <3a6f0384-257b-0fce-a4aa-abe84afd9084@inria.fr> SECOND CALL FOR CONTRIBUTIONS 28th International Conference on Types for Proofs and Programs, TYPES 2022 and EuroProofNet Cost Action CA20111 meeting Nantes, France, 20-25 June 2022 https://types22.inria.fr 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; * 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; * formalizing mathematics using type theory. 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. The EuroProofNet Cost Action CA20111 focuses on the same research topics as TYPES and partially sponsors the TYPES Conference. INVITED SPEAKERS: Youyou Cong (Tokyo Institute of Technology) Ekaterina Komendantskaya (Heriot-Watt University) Sam Lindley (University of Edinburgh) Leonardo de Moura (Microsoft Research) CONTRIBUTED TALKS: We solicit contributed talks. Selection of those will be based on extended abstracts/short papers of 2 pp (not including bibliography) formatted with easychair.cls. The submission site is https://easychair.org/conferences/?conf=types2022 IMPORTANT DATES: * submission of 2 pp abstract: 9 March 2022 * notification of acceptance/rejection: 20 April 2022 * camera-ready version of abstract: 15 May 2022 Camera-ready versions of the accepted contributions will be published in an informal book of abstracts for distribution at the workshop. POST-PROCEEDINGS 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 submission deadline for the post-proceedings: September 2022. PROGRAM COMMITTEE Sandra Alves (University of Porto) Carlo Angiuli (Carnegie Mellon University) Stephanie Balzer (Carnegie Mellon University) Lars Birkedal (Aarhus University) Fr?d?ric Blanqui (INRIA) Sandrine Blazy (Universit? de Rennes 1 - IRISA) Thierry Coquand (University of Technology) Andrej Dudenhefner (Saarland University) Jacques Garrigue (Nagoya University) Delia Kesner (Universit? de Paris) (PC Co-Chair) Marina Lenisa (Universit? di Udine) Paul Blain Levy (University of Birmingham) Sara Negri (Universit? degli Studi di Genova) Pierre-Marie P?drot (INRIA) (PC Co-Chair) Luca Padovani (Universit? di Torino) Zoe Paraskevopoulou (Northeastern University) Brigitte Pientka (McGill University) Matija Pretnar (University of Ljubljana) Talia Ringer (University of Washington) Kathrin Stark (Princeton University) Pawe? Urzyczyn (University of Warsaw) Lionel Vaux (Universit? d?Aix-Marseille) Niki Vazou (IMDEA Software) TYPES STEERING COMMITTEE Andreas Abel (Gothenburg University) Sandra Alves (University of Porto) (Secretary) Henning Basold (Leiden University) (SC chair) Fr?d?ric Blanqui (INRIA) Ugo de'Liguoro (Universit? di Torino) Matthieu Sozeau (INRIA & Universit? de Nantes) 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. 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), Virtual (2021). CONTACT Email: types2022 at easychair.org Organisers: Assia Mahboubi (INRIA & Universit? de Nantes) Matthieu Sozeau (INRIA & Universit? de Nantes) Nicolas Tabareau (INRIA & Universit? de Nantes) -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_signature Type: application/pgp-signature Size: 840 bytes Desc: OpenPGP digital signature URL: From rumi.neykova at gmail.com Fri Jan 28 10:12:50 2022 From: rumi.neykova at gmail.com (Rumyana Neykova) Date: Fri, 28 Jan 2022 15:12:50 +0000 Subject: [TYPES/announce] PLACES 2022 -- FINAL Call for Papers (deadline 4 February '22) Message-ID: # PLACES 2022 - FINAL Call for Papers The 13th edition of PLACES (Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software) will be co-located with ETAPS 2022 in Munich, Germany on 3rd April 2022. ------------------------------------------------------------------------------------ https://urldefense.com/v3/__https://places-workshop.github.io/__;!!IBzWLUs!C0WwVp07MiT1fcLcmTavoDHnRkFQWDrsrkZvfLHkIkWT3ag_uSi2JHGQd18q6uMFEXji416C5UoMlg$ ------------------------------------------------------------------------------------ For over a decade, PLACES has been a popular forum for researchers from different fields to exchange new ideas about challenges to modern and future programming, where concurrency and distribution are the norm rather than a marginal concern. ## Submissions Guidelines Submissions are invited in the general area of programming language approaches to concurrency, communication, and distribution, ranging from foundational issues, through language implementations, to applications and case studies. Submissions will be peer-reviewed by a minimum of three reviewers, with the aim of allocating at least one expert reviewer. Papers are reviewed based on their novelty, clarity, and technical soundness. Submissions must not be submitted elsewhere and must be formatted in EPTCS format, containing a maximum of 8 pages (with no restriction on bibliography or appendices, which the reviewers need not read). The proceedings of PLACES 2022 will be published as a volume of EPTCS. Submission site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=places22__;!!IBzWLUs!C0WwVp07MiT1fcLcmTavoDHnRkFQWDrsrkZvfLHkIkWT3ag_uSi2JHGQd18q6uMFEXji414v624oDw$ ## Special Issues Authors of selected papers from PLACES 2022 will be invited to submit extended versions of their workshop papers to a special issue to Information and Computation and/or JLAMP. ## Key dates * Submission deadline: 4th February 2022 (AoE) * Author notification: 28th February 2022 * Camera ready: 11th March 2022 * Workshop: 3rd April 2022 * ETAPS: 2nd-7th April 2022 ## Topics Relevant topics include, but are not limited to: * Design and implementation of programming languages with first class concurrency and communication primitives * Models for concurrent and distributed systems, such as process algebra and automata, and their mechanisation in proof assistants * Behavioural types, including session types * Concurrent data types, objects and actors * Verification and program analysis methods for safe and secure concurrent and distributed software * Interface and contract languages for communication and distribution * Applications to microservices, sensor networks, scientific computing, HPC, blockchains, robotics * Concurrency and communication in event processing and business process management ## Chairs * Marco Carbone, IT-University of Denmark * Rumyana Neykova, Brunel University London ## Programme Committee * Ilaria Castellani, INRIA Sophia Antipolis M?diterran?e * Tiago Cogumbreiro, University of Massachusetts Boston, USA * Farzaneh Derakhshan, Carnegie Mellon University, USA * Silvia Ghilezan, University of Novi Sad, Serbia * Jonas Hinrichsen, Aarhus University, Denmark * Keigo Imai, Gifu University, Japan * Roland Kuhn, Actyx * Julien Lange, Royal Holloway University of London, UK * Jorge A. P?rez, University of Groningen, Netherlands * Kirstin Peters, Technische Universit?t Darmstadt, Germany * Antonio Ravara, New University of Lisbon, Portugal * Peter Thiemann, University of Freiburg, Germany * Uma Zalakain, University of Glasgow, UK ## Organising committee * Simon Gay, University of Glasgow * Luca Padovani, University of Torino * Vasco T. Vasconcelos, Universidade de Lisboa * Nobuko Yoshida, Imperial College London We hope you will submit and join us for another successful edition of PLACES! Best Regards, Rumyana Neykova & Marco Carbone -------------- next part -------------- An HTML attachment was scrubbed... URL: From giorgio.audrito at unito.it Mon Jan 31 07:57:25 2022 From: giorgio.audrito at unito.it (Giorgio Audrito) Date: Mon, 31 Jan 2022 13:57:25 +0100 Subject: [TYPES/announce] DisCoTec final CFP [extended deadline] Message-ID: [apologies for multiple copies, please forward it to interested parties] =================================================================== JOINT CALL FOR PAPERS [EXTENDED DEADLINE] DISCOTEC 2022 17th International Federated Conference on Distributed Computing Techniques 13-17 June 2022, Lucca, Italy https://urldefense.com/v3/__https://www.discotec.org/2022__;!!IBzWLUs!CMFnOjEDkokx-WdavMVWf-7OMJiVMat9AbNreTWrOozaIPM1DZp-jPguKNHjO_fh6Az89jZ-QhjA8A$ =================================================================== 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. === COVID-19 === 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. === Main Conferences === COORDINATION https://urldefense.com/v3/__https://www.discotec.org/2022/coordination__;!!IBzWLUs!CMFnOjEDkokx-WdavMVWf-7OMJiVMat9AbNreTWrOozaIPM1DZp-jPguKNHjO_fh6Az89jbBZsTYBg$ 24rd International Conference on Coordination Models and Languages PC Chairs: Maurice ter Beek (ISTI-CNR, Pisa, Italy) and Marjan Sirjani (M?lardalen University, Sweden) DAIS https://urldefense.com/v3/__https://www.discotec.org/2022/dais__;!!IBzWLUs!CMFnOjEDkokx-WdavMVWf-7OMJiVMat9AbNreTWrOozaIPM1DZp-jPguKNHjO_fh6Az89jZ7Z83BWw$ 22st International Conference on Distributed Applications and Interoperable Systems PC Chairs: David Eyers (University of Otago, NZ) and Spyros Voulgaris (Athens University of Economics and Business, GR) FORTE https://urldefense.com/v3/__https://www.discotec.org/2022/forte__;!!IBzWLUs!CMFnOjEDkokx-WdavMVWf-7OMJiVMat9AbNreTWrOozaIPM1DZp-jPguKNHjO_fh6Az89jbCUc17vg$ 42st International Conference on Formal Techniques for Distributed Objects, Components and Systems PC Chairs: Mohammad Mousavi (King?s College London, UK) and Anna Philippou (University of Cyprus, Cyprus) === Important Dates (for all main conferences) === - Abstract submission: February 11, 2022 [extended] - Paper submission: February 18, 2022 [extended] - Paper notification: March 25, 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. The deadlines are STRICT: there will be no further extensions. === Satellite Events === We invite the community to submit proposals for tutorials on topics related to the distributed computing field. Important dates for all tutorials: Tutorial proposal submission deadline: February 28, 2022 Notification of accepted workshop proposals: March 07, 2022 Tutorials: June 13, 2022 === Submission Categories === COORDINATION - Regular long papers (7-15 pages) - Regular short papers (4-6 pages) - Long tool papers (7-15 pages) - Short tool papers (4-6 pages) - Survey papers (16-25 pages) References do not count towards the page limit. DAIS - Full research papers (max 15 pages) - Full practical experience reports (max 15 pages) - Work-in-progress papers (max 6 pages) References have a separate page limit of 2 pages. FORTE - Full papers (max 15 pages + 2 pages references) - Short papers (max 6 pages + 2 pages references) - ?Journal First? papers (max 4 pages, including references) === Proceedings === The proceedings of the conferences are published in LNCS-IFIP volumes. These shall be open access from the IFIP digital library after a 3-year embargo. === Organising Committee === - Rocco De Nicola (IMT School for Advanced Studies, IT ? General Chair) - Letterio Galletta (IMT School for Advanced Studies, IT ? Chair of the Local Organizing Committee) - Marinella Petrocchi (IIT-CNR, IT) - Simone Soderi (IMT School for Advanced Studies, IT) - Francesco Tiezzi (University of Florence, IT ? Workshops and Tutorials Chair) - Giorgio Audrito (University of Torino, IT ? Publicity chair) === 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) === Advisory Board === - Alain Girault (INRIA Grenoble, FR) - Uwe Nestmann (TU Berlin, DE) - Michele Loreti (University of Camerino, IT) - Jim Dowling (RISE & KTH, SE) - Marjan Sirjani (University of Malarden, SE) - Frank de Boer (Centrum Wiskunde & Informatica (CWI), NL) - Farhad Arbab (Centrum Wiskunde & Informatica (CWI), NL) - Lea Kutvonen (University of Helsinki, FI) - John Derrick (University of Sheffield, UK) - Pascal Felber (University of Neuch?tel, CH) - Kostas Magoutis (ICS-FORTH, GR) - Rui Oliveira (University of Minho, PT) - Jean-Bernard Stefani (INRIA Grenoble, FR) -------------- next part -------------- An HTML attachment was scrubbed... URL: From julien.signoles at cea.fr Tue Feb 1 03:46:32 2022 From: julien.signoles at cea.fr (Julien Signoles) Date: Tue, 1 Feb 2022 09:46:32 +0100 Subject: [TYPES/announce] =?utf-8?q?2_postdoc_positions_on_Runtime_Verifi?= =?utf-8?q?cation_at_CEA_LIST=2C_Universit=C3=A9_Paris-Saclay=2C_France?= Message-ID: Dear all, The Software Safety and Security Lab at CEA LIST, Universit? Paris-Saclay, France has 2 open postdoc positions in the area of runtime verification for code safety and security: - Designing Compilation Techniques for Improving Efficiency of E-ACSL, a Runtime Assertion Checker for C Programs https://urldefense.com/v3/__http://julien-signoles.fr/positions/postdoc-eacsl.pdf__;!!IBzWLUs!Huy_IUWSONYnwldsbG_YJfsmLHiqVh3kTxPbcR-BK9bISdfcMmFrgDii3SqZD2vRtS0zMsSsD3is-A$ - Control Flow Integrity for Remote Attestation https://urldefense.com/v3/__http://julien-signoles.fr/positions/postdoc-cfi.pdf__;!!IBzWLUs!Huy_IUWSONYnwldsbG_YJfsmLHiqVh3kTxPbcR-BK9bISdfcMmFrgDii3SqZD2vRtS0zMsSM4eD4KA$ The postdoc researchers 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 welcome: - programming ??? * OCaml and C ??? * formal semantics - formal verification ??? * runtime verification, static analysis, formal specification languages, ... - 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). 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 kutsia at risc.jku.at Mon Jan 31 05:16:56 2022 From: kutsia at risc.jku.at (Temur Kutsia) Date: Mon, 31 Jan 2022 11:16:56 +0100 Subject: [TYPES/announce] CfP: AMAI Special Issue on Symbolic Computation in Software Science Message-ID: <81caafdb-8c88-135e-4cff-930c2d4587ac@risc.jku.at> Call for submissions Annals of Mathematics and Artificial Intelligence Special Issue on on Symbolic Computation in Software Science -- In the Era of Computational and Artificial Intelligence https://urldefense.com/v3/__https://www.risc.jku.at/people/tkutsia/organization/amai-scss.html__;!!IBzWLUs!C7qGk5SZA6IcgOwLbSxEUgRZjAnapHD_4-Lcaw9q41WLjTr2adLhDnsNxkcwF3sVndCj5iKQUD8dKA$ ------------------------------------------------------------------ SCOPE -------- In 2020, Annals of Mathematics and Artificial Intelligence (AMAI) celebrated its 30th anniversary. Over the years, the journal has promoted better understanding of the application of quantitative, combinatorial, logical, algebraic and algorithmic methods to artificial intelligence areas as diverse as decision support, automated deduction, reasoning, knowledge-based systems, machine learning, computer vision, robotics and planning. AMAI special issues are intended to be collections of original research papers reflecting the intersection of mathematics and a focussed discipline demonstrating how each has contributed greatly to the other. A further goal of the journal is to close the gaps between the fields even further. Papers should report on current research in the appropriate areas, as well as more retrospective papers in which progress has been ongoing over a period of time. The purpose of this special issue of AMAI is to promote research on theoretical and practical aspects of symbolic computation in software science, combined with recent artificial intelligence techniques. 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 special issue is related to the topics of the The 9th International Symposium on Symbolic Computation in Software Science - SCSS 2021. Participants of the symposium, as well as other authors are invited to submit contributions. TOPICS ------------------- This special issue focuses on advanced results on the topics that include, but are not limited to, the following: - software science-relevant applications of * automated reasoning, knowledge reasoning, common-sense reasoning, reasoning in science * combinations of linguistic/learning-based and semantic/reasoning methods * algebras, co-algebras, categories, proof theory, model theory * artificial intelligence and machine learning methods - algorithm (program) analysis, synthesis, verification - extraction of specifications from algorithms (programs) - algorithm (program) transformation - formal methods for network and system security - programming models - formalization and computerization of knowledge; large-scale computer understanding of mathematics and science - alignment and joint processing of formal, semi-formal, and informal libraries - 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 - computational origami SUBMISSION ----------- This special issue welcomes original high-quality contributions that have been neither published in nor simultaneously submitted to any journals or refereed conferences. Submissions will be peer-reviewed using the standard refereeing procedure of the Annals of Mathematics and Artificial Intelligence. Submitted papers must be in English, prepared in LaTeX according to the guidelines of the journal: https://urldefense.com/v3/__https://www.springer.com/journal/10472/submission-guidelines__;!!IBzWLUs!C7qGk5SZA6IcgOwLbSxEUgRZjAnapHD_4-Lcaw9q41WLjTr2adLhDnsNxkcwF3sVndCj5iKvEnbecQ$ . PDF versions of papers should be uploaded at the submission page https://urldefense.com/v3/__https://www.editorialmanager.com/amai__;!!IBzWLUs!C7qGk5SZA6IcgOwLbSxEUgRZjAnapHD_4-Lcaw9q41WLjTr2adLhDnsNxkcwF3sVndCj5iIz8k5g8g$ by May 23, 2022. Please choose S710: SCSS - Symbolic Computation in Software Science when you will be selecting the article type. GUEST EDITORS -------------------- Adel Bouhoula (Arabian Gulf University, Bahrain) Bruno Buchberger (RISC, Johannes Kepler University Linz, Austria) Tetsuo Ida (University of Tsukuba, Japan) Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) From florin.manea at informatik.uni-goettingen.de Tue Feb 1 04:15:37 2022 From: florin.manea at informatik.uni-goettingen.de (Manea, Florin) Date: Tue, 1 Feb 2022 09:15:37 +0000 Subject: [TYPES/announce] CSL 2022: 2nd Call for Participation Message-ID: <6fbcb62007674735bc68a159804fc447@informatik.uni-goettingen.de> ===================================== Call for Participation (CSL'22) ===================================== News: Registration is open; Schedule. ===================================== Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL), see https://urldefense.com/v3/__https://www.eacsl.org/__;!!IBzWLUs!C8_6lYYgkkTbr53ZsRfR-EzX1Ipnvxd_GIE3U8x1gT3O2DUT1zUUDk9S2z3iydmNqV_o26AYcILveA$ . 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, online. The conference is hosted by the University of G?ttingen. More details, including the schedule, will be announced soon on the website: https://urldefense.com/v3/__http://csl2022.uni-goettingen.de/__;!!IBzWLUs!C8_6lYYgkkTbr53ZsRfR-EzX1Ipnvxd_GIE3U8x1gT3O2DUT1zUUDk9S2z3iydmNqV_o26CCgRIVPQ$ 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) Accepted papers: ----------------- The Program Committee selected 35 accepted papers for presentation at CSL 2022. Their titles and authors can be seen here: https://urldefense.com/v3/__http://csl2022.uni-goettingen.de/*acceptedpaper__;Iw!!IBzWLUs!C8_6lYYgkkTbr53ZsRfR-EzX1Ipnvxd_GIE3U8x1gT3O2DUT1zUUDk9S2z3iydmNqV_o26Bwg-dukg$ Schedule: ----------------- https://urldefense.com/v3/__http://csl2022.uni-goettingen.de/*schedule__;Iw!!IBzWLUs!C8_6lYYgkkTbr53ZsRfR-EzX1Ipnvxd_GIE3U8x1gT3O2DUT1zUUDk9S2z3iydmNqV_o26DAPRStSQ$ Registration: -------------- To register for CSL 2022, please fill in the registration form at: https://urldefense.com/v3/__https://events.gwdg.de/event/95/__;!!IBzWLUs!C8_6lYYgkkTbr53ZsRfR-EzX1Ipnvxd_GIE3U8x1gT3O2DUT1zUUDk9S2z3iydmNqV_o26C0kz7WEw$ The participation fee for CSL 2022 is as follows: - members of EACSL (2022): free - students: 5 Euro - members of EATCS or ACM SIGLOG (2022): 15 Euro - regular: 20 Euro This fee covers participation in CSL 2022 and includes membership of EACSL for 2022 (https://urldefense.com/v3/__https://www.eacsl.org/membership/__;!!IBzWLUs!C8_6lYYgkkTbr53ZsRfR-EzX1Ipnvxd_GIE3U8x1gT3O2DUT1zUUDk9S2z3iydmNqV_o26B9h-NkFg$ ). This fee has to be paid directly to the EACSL, as indicated in the registration process, and is processed by the EACSL. There is no participation fee for the collocated workshops (see below), and they can be attended without paying the CSL registration fee, but the CSL-registration form should still be filled. These participation fees are made possible only due to the generous financial support by the German Research Foundation (DFG) and the University of G?ttingen. Important dates: ----------------- Non-speaker registration deadline: February 6th, 2022. All participants must register. 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. The Helena-Rasiowa-Award will be announced during the conference. Read more about the contribution of Helena Rasiowa to logic and computer science, and their interplay, here: https://urldefense.com/v3/__https://www.eacsl.org/?page_id=1104__;!!IBzWLUs!C8_6lYYgkkTbr53ZsRfR-EzX1Ipnvxd_GIE3U8x1gT3O2DUT1zUUDk9S2z3iydmNqV_o26AMGIoQkQ$ Ackermann Award 2021: ---------------------- The Ackermann Award is the EACSL Outstanding Dissertation Award for Logic in Computer Science. The award for 2021 will be presented during CSL 2022. The Ackermann Award 2021 is given to two PhD theses (in alphabetic order): Marie Fortin for her thesis "Expressivity of first-order logic, star-free propositional dynamic logic and communicating automata" defended at ENS Paris-Saclay, (France) in 2020. Supervisors: Paul Gastin and Benedikt Bollig and Sandra Kiefer for her thesis "Power and Limits of the Weisfeiler-Leman Algorithm" defended at RWTH Aachen, (Germany) in 2020. Examiners: Martin Grohe, Pascal Schweitzer, Neil Immerman 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://urldefense.com/v3/__https://www.cs.swansea.ac.uk/lcc/__;!!IBzWLUs!C8_6lYYgkkTbr53ZsRfR-EzX1Ipnvxd_GIE3U8x1gT3O2DUT1zUUDk9S2z3iydmNqV_o26BirR2ypA$ . 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://urldefense.com/v3/__https://lmw.mpi-sws.org/csl/__;!!IBzWLUs!C8_6lYYgkkTbr53ZsRfR-EzX1Ipnvxd_GIE3U8x1gT3O2DUT1zUUDk9S2z3iydmNqV_o26Df1KGYxA$ Contact: --------- Please send all questions about submissions to the PC co-chairs and main organizers: csl2022 at easychair.org From kyrozier at iastate.edu Tue Feb 1 14:50:33 2022 From: kyrozier at iastate.edu (Kristin Yvonne Rozier) Date: Tue, 1 Feb 2022 13:50:33 -0600 Subject: [TYPES/announce] Call for Model-Checking Community Feedback Message-ID: <99f85f91-51d3-3791-56ca-4c1724943e30@iastate.edu> *** Apologies for multiple postings ********************************************************************* ?????? Webinar & Call for Model-Checking Community Feedback "Developing an Open-Source, State-of-the-Art Symbolic Model-Checking ??????? Framework for the Model-Checking Research Community" https://urldefense.com/v3/__https://modelchecker.temporallogic.org__;!!IBzWLUs!F_lEA0ENqxxd-vkyRmKq_iBKoFjNLx-vT0yDLsGsAk4d6dzw0JxOXoVbe_iRkk1FTI2z_JB_NCckTg$ ********************************************************************* Research Goal: --------------- This is an NSF (U.S. National Science Foundation)-funded effort to develop an open-source, state-of-the-art symbolic model-checking framework for the international model-checking research community. Our goal is to fill the current gap in model checking research platforms: building a freely-available, open-source, scalable model checking infrastructure that accepts expressive models and efficiently interfaces with the currently-maintained state-of-the-art back-end algorithms to provide an extensible research and verification tool. We will create a community resource with a well-documented intermediate representation to enable extensibility, and a web portal, facilitating new modeling languages and back-end algorithmic advances. To add new modeling languages or algorithms, researchers need only to develop a translator to/from the new intermediate language, and will then be able to integrate each advance with the full state-of-the-art in model checking. Project Status: ---------------- We have developed a candidate intermediate representation for symbolic model checking and revised it via feedback from a Technical Advisory Board. We are now ready for wider community feedback to fuel our next round of revisions and developments. Visit our project website for more details, presentation slides, and more opportunities to interact, including providing comments, joining our mailing list, registering for future webinars, and suggesting names for the new framework. Webinar: -------- Our first workshop will be held online via zoom: 15 February 2022 1:00pm-3:00pm US-CST (GMT-6) Registration is at: https://urldefense.com/v3/__https://modelchecker.temporallogic.org__;!!IBzWLUs!F_lEA0ENqxxd-vkyRmKq_iBKoFjNLx-vT0yDLsGsAk4d6dzw0JxOXoVbe_iRkk1FTI2z_JB_NCckTg$ Agenda: 15 minutes: Project overview and introduction 45 minutes: Candidate intermediate representation details 60 minutes: Moderated community feedback and questions *** Additional webinars will be held to accommodate other time-zones; please register for a future workshop on the website and provide your timezone when asked. Research Leads: --------------- Kristin Yvonne Rozier, Iowa State University Natarajan Shankar, SRI Cesare Tinelli, University of Iowa Moshe Y. Vardi, Rice University -- ____________________________________________________________ __ /\ \ \_____ / \ ###[==_____> / \ /_/ __ / __ \ \ \_____ | ( ) | ###[==_____> /| /\/\ |\ /_/ / | | | | \ / |=|==|=| \ Kristin Yvonne Rozier, Ph.D. / | | | | \ Black&Veatch Associate Prof, Iowa State Univ / USA | ~||~ |NASA \ Departments of Aerospace Engineering, |______| ~~ |______| Computer Science, Mathematics, and (__||__) Electrical and Computer Engineering /_\ /_\ Virtual Reality Applications Center !!! !!!https://urldefense.com/v3/__http://temporallogic.org/kyr__;!!IBzWLUs!F_lEA0ENqxxd-vkyRmKq_iBKoFjNLx-vT0yDLsGsAk4d6dzw0JxOXoVbe_iRkk1FTI2z_JC0iO0BSw$ From bahareh1812 at gmail.com Thu Feb 3 05:13:05 2022 From: bahareh1812 at gmail.com (Bahareh Afshari) Date: Thu, 3 Feb 2022 11:13:05 +0100 Subject: [TYPES/announce] PhD in Cyclic Proofs for Modal and Higher-order Logic (Amsterdam) Message-ID: <41BAD7BC-01B8-4332-970F-F133148BDF14@gmail.com> *Apologies for cross posting* PHD POSITION CYCLIC PROOFS FOR MODAL AND HIGHER-ORDER LOGIC, AMSTERDAM (THE NETHERLANDS) * ILLC, University of Amsterdam * Duration: 4 years fully-funded, starting September 2022 * Deadline for applications: 28 February 2022 * The Institute for Logic, Language and Computation (ILLC) at the University of Amsterdam invites applications for a fully funded four-year PhD position on the project ?Cyclic Proofs for Modal and Higher-order Logic?, directed by Bahareh Afshari and Yde Venema. * For full details see https://urldefense.com/v3/__https://www.illc.uva.nl/NewsandEvents/News/Positions/newsitem/13350/PhD-in-Cyclic-Proofs-for-Modal-and-Higher-order-Logic__;!!IBzWLUs!Bpo-Y2ByQhOzdQc46fqb3kd4J1ClLw-l4GsA4XsjczR7xZbKH0Q3GbXShXy5I9CaxAckwAbqqsQylg$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From radu.iosif at univ-grenoble-alpes.fr Thu Feb 3 08:08:43 2022 From: radu.iosif at univ-grenoble-alpes.fr (RADU IOSIF) Date: Thu, 3 Feb 2022 14:08:43 +0100 (CET) Subject: [TYPES/announce] Workshop on Advances in Separation Logics (ASL 2022 @ FLOC 2022) Message-ID: <1069844893.2850130.1643893723221.JavaMail.zimbra@univ-grenoble-alpes.fr> Workshop on Advances in Separation Logics (ASL 2022), Haifa, Israel, July 31st 2022 https://urldefense.com/v3/__https://asl-workshop.github.io/asl22/__;!!IBzWLUs!ESHf8lV3ptcgOFyXKXMQeFbC8xsntpkEQUaFOyXibGrVd1Sv6dcOexb3t8rWl74ruG7XM9cfTvG03Q$ The past two decades have witnessed important progress in static analysis and verification of code with low-level pointer and heap manipulations, mainly due to the development of Separation Logic (SL). SL is a resource logic, a dialect of the logic of Bunched Implications (BI) designed to describe models of the heap memory and the mutations that occur in the heap as the result of low-level pointer updates. The success of SL in program analysis is due to the support for local reasoning, namely the ability of describing only the resource(s) being modified, instead of the entire state of the system. This enables the design of compositional analyses that synthesize specifications of the behavior of small parts of the program before combining such local specifications into global verification conditions. Another interesting line of work consists in finding alternatives to the underlying semantic domain of SL, namely heaps with aggregative composition, in order to address other fields in computing, such as self-adapting distributed networks, blockchain and population protocols, social networks or biological systems. We consider submissions on topics including: * decision procedures for SL and other resource logics, * computational complexity of decision problems such as satisfiability, entailment and abduction for SL and other resource logics, * axiomatisations and proof systems for automated or interactive theorem proving for SL and other resource logics, * verification conditions for real-life interprocedural and concurrent programs, using SL and other resource logics, * alternative semantics and computation models based on the notion of resource, * application of separation and resource logics to different fields, such as sociology and biology. ASL 2022 is a workshop affiliated to IJCAR 2022 at FLOC 2022. Keynote Speakers * Philippa Gardner, Imperial College London * Ralf Jung, MIT CSAIL Important Dates * Papers due: May 10, 2022 (AoE) * Authors notification: June 15, 2022 (AoE) * Workshop: July 31, 2022 Program Committee Nadia Polikarpova (UCSD, San Diego, USA) James Brotherston (UCL, London, UK) Qinxiang Cao (Shanghai Jiaotong University) Dan Frumin (University of Groningen, The Netherlands) Lennart Beringer (Princeton University, USA) Arthur Chargu?raud (INRIA Strasbourg, France) Radu Iosif (Verimag, CNRS, Univ. Grenoble Alpes, France) Le Quang Loc (UCL, London, UK) Alessio Mansutti (University of Oxford, UK) Christoph Matheja (DTU, Lyngby, Denmark) Daniel M?ry (University of Loraine, France) Koji Nakazawa (Nagoya University, Japan) Nicolas Peltier (LIG, CNRS, Grenoble, France) Adam Rogalewicz (Brno University of Technology, Czech Republic) Mihaela Sighireanu (LMF, ENS Paris-Saclay, France) Florian Zuleger (Vienna University of Technology, Austria) Organizing committee Radu Iosif (Verimag, CNRS, Univ. Grenoble Alpes, France) Nikos Gorogiannis (Meta, London, UK) Robbert Krebbers (Radboud Univ. Nijmegen, The Netherlands) Mihaela Sighireanu (LMF, ENS Paris-Saclay, France) Makoto Tatsuta (NII, Tokyo, Japan) Thomas Noll (RWTH, Aachen, Germany) -------------- next part -------------- An HTML attachment was scrubbed... URL: From rumi.neykova at gmail.com Fri Feb 4 06:05:05 2022 From: rumi.neykova at gmail.com (Rumyana Neykova) Date: Fri, 4 Feb 2022 11:05:05 +0000 Subject: [TYPES/announce] PLACES 2022 - Call for Papers (Extended deadline & Call for Presentations) Message-ID: # PLACES 2022 - Call for Papers (Extended deadline: 11th Feb 2022 AoE) The 13th edition of PLACES (Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software) will be co-located with ETAPS 2022 in Munich, Germany on 3rd April 2022. ------------------------------------------------------------------------------------ https://urldefense.com/v3/__https://places-workshop.github.io/__;!!IBzWLUs!DdEerWPq3l11s3UX3Ks5BvCWGjAyUpkYFk3xosQUJ1Vz_J9q3MhNaysvRnoazqCwKU2F4YoeqkrE6A$ ------------------------------------------------------------------------------------ For over a decade, PLACES has been a popular forum for researchers from different fields to exchange new ideas about challenges to modern and future programming, where concurrency and distribution are the norm rather than a marginal concern. ## Submissions Guidelines Submissions are invited in the general area of programming language approaches to concurrency, communication, and distribution, ranging from foundational issues, through language implementations, to applications and case studies. Submissions will be peer-reviewed by a minimum of three reviewers, with the aim of allocating at least one expert reviewer. Papers are reviewed based on their novelty, clarity, and technical soundness. Submissions must not be submitted elsewhere and must be formatted in EPTCS format. We accept the following submissions: * Full Research papers containing a maximum of 8 pages (with no restriction on bibliography or appendices, which the reviewers need not read). Full research papers will appear in the workshop proceedings * (NEW) Extended abstracts containing a maximum of 2 pages (with no restriction on bibliography or appendices, which the reviewers need not read). Accepted extended abstracts will be presented at the workshop, but will not appear in the workshop proceedings. The proceedings of PLACES 2022 will be published as a volume of EPTCS. Submission site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=places22__;!!IBzWLUs!DdEerWPq3l11s3UX3Ks5BvCWGjAyUpkYFk3xosQUJ1Vz_J9q3MhNaysvRnoazqCwKU2F4Yp5OZiKyg$ ## Special Issues Authors of selected papers from PLACES 2022 will be invited to submit extended versions of their workshop papers to a special issue to Information and Computation and/or JLAMP. ## Key dates * Submission deadline: 4th February 2022 (AoE) 11th February 2022 (AoE) * Author notification: 28th February 2022 * Camera ready: 11th March 2022 * Workshop: 3rd April 2022 * ETAPS: 2nd-7th April 2022 ## Topics Relevant topics include, but are not limited to: * Design and implementation of programming languages with first class concurrency and communication primitives * Models for concurrent and distributed systems, such as process algebra and automata, and their mechanisation in proof assistants * Behavioural types, including session types * Concurrent data types, objects and actors * Verification and program analysis methods for safe and secure concurrent and distributed software * Interface and contract languages for communication and distribution * Applications to microservices, sensor networks, scientific computing, HPC, blockchains, robotics * Concurrency and communication in event processing and business process management ## Chairs * Marco Carbone, IT-University of Denmark * Rumyana Neykova, Brunel University London ## Programme Committee * Ilaria Castellani, INRIA Sophia Antipolis M?diterran?e * Tiago Cogumbreiro, University of Massachusetts Boston, USA * Farzaneh Derakhshan, Carnegie Mellon University, USA * Silvia Ghilezan, University of Novi Sad, Serbia * Jonas Hinrichsen, Aarhus University, Denmark * Keigo Imai, Gifu University, Japan * Roland Kuhn, Actyx * Julien Lange, Royal Holloway University of London, UK * Jorge A. P?rez, University of Groningen, Netherlands * Kirstin Peters, Technische Universit?t Darmstadt, Germany * Antonio Ravara, New University of Lisbon, Portugal * Peter Thiemann, University of Freiburg, Germany * Uma Zalakain, University of Glasgow, UK ## Organising committee * Simon Gay, University of Glasgow * Luca Padovani, University of Torino * Vasco T. Vasconcelos, Universidade de Lisboa * Nobuko Yoshida, Imperial College London We hope you will submit and join us for another successful edition of PLACES! Best Regards, Rumyana Neykova & Marco Carbone -------------- next part -------------- An HTML attachment was scrubbed... URL: From msteffen at ifi.uio.no Wed Feb 2 03:42:50 2022 From: msteffen at ifi.uio.no (Martin Steffen) Date: Wed, 02 Feb 2022 09:42:50 +0100 Subject: [TYPES/announce] 2 Ph.D positions on formal methods available at the University of Oslo Message-ID: <20220202084250.BDAAC110@afram.ifi.uio.no> +-----------------------------------------+ 2 Ph.D positions in Formal Methods available at the Dept. of Informatics, University of Oslo. on the following two topics: +-----------------------------------------+ 1. Symbolic Execution 2. Formal Analysis for Concurrent Programs +-----------------------------------------+ Deadline: 28. 02. 2022 +-----------------------------------------+ 1. Positions =========== Both position will be part of the research group on formal methods at the Department of Informatics (IFI). The research group develops and applies techniques for formal modelling and analysis in a range of problem domains. As a research fellow in this research group, you will be working in a friendly, stimulating and international research environment with a number of PhD and postdoctoral fellows. The position targeting symbolic execution is part of a project in collaboration with TU Darmstadt (Germany) and CWI Amsterdam (the Netherlands). 2. Qualification requirements, employment details & how to apply ================================================================ For detailed information about how to apply, formal application requirements and expectations, terms of employment and wage etc., see the web announcements: - https://urldefense.com/v3/__https://www.jobbnorge.no/en/available-jobs/job/219729/phd-research-fellow-in-symbolic-execution__;!!IBzWLUs!AgdKWIDzGxGavuMTR89a4qy-LT9XzVgwF35Lm4RBiewBcEx7h5-ftN1eydpKToeFZ4gzQruGNy80Uw$ - https://urldefense.com/v3/__https://www.jobbnorge.no/en/available-jobs/job/219775/phd-research-fellow-in-formal-analysis-of-concurrent-systems__;!!IBzWLUs!AgdKWIDzGxGavuMTR89a4qy-LT9XzVgwF35Lm4RBiewBcEx7h5-ftN1eydpKToeFZ4gzQruWF9OzEA$ 3. Contacts: =========== - Einar Broch Johnsen (einarj at ifi.uio.no) - Silvia Lizeth Tapia Tarifa (sltarifa at ifi.uio.no) - Eduard Kamburjan (eduard at ifi.uio.no) - Martin Steffen (msteffen at ifi.uio.no) 4. More details on the intended area of research of the two positions: ==================================================================== 4.1. Symbolic Execution ~~~~~~~~~~~~~~~~~~~~~~ The planned PhD research is concerned with symbolic execution of concurrent and distributed systems. Symbolic execution is an elegant, well-established technique to analyse software, which allows different executions to be explored systematically and efficiently. It is used both for testing and verification of program behaviour, with applications in, e.g., security, memory management and behavioural correctness. However, symbolic execution is today largely restricted to sequential software; the current techniques do not scale to concurrent and distributed systems due to an exponential increase in the size of the search space of possible executions, which stems from the additional non-determinism inherent to concurrency. The idea of the project proposal is to devise abstraction techniques that enable us to tackle the state-space explosion which currently makes concurrent programs out-of-bounds for symbolic execution. This is an exciting position for candidates interested in topics such as software verification, static analysis and formal modelling languages. 4.2. Formal Analysis of Concurrent Systems ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ The planned PhD research aims to develop formal semantic-based analysis methods for tackling modern concurrency abstraction and memory models for multi-threaded programming languages and systems. That also involves developing and using appropriate software analysis and synthesis tools to ensure synchronisation-related correctness properties, such as deadlock-freedom, sequential consistency, functional determinacy or absence of information leakage. The results from the theoretical investigations will be encapsulated in programming libraries and analysis algorithms that fit into the existing eco-systems of the chosen host languages. Methodologically, the research will target mainly light-weight verification methods, analysis methods and corresponding tools that work automatically, without interactive user intervention. In particular, type-based analyses and synthesis methods to check for resource-consumption, conformance with interface specification, race freedom, etc. From benedikt.ahrens at gmail.com Fri Feb 4 14:44:17 2022 From: benedikt.ahrens at gmail.com (Benedikt Ahrens) Date: Fri, 4 Feb 2022 20:44:17 +0100 Subject: [TYPES/announce] HoTT/UF 2022: Call for Contributions Message-ID: ========================================================== CALL FOR CONTRIBUTIONS AND PARTICIPATION Workshop on Homotopy Type Theory and Univalent Foundations (HoTT/UF 2022, co-located with FSCD 2022) ========================================================== ------------------------------------------------------------------------ Workshop on Homotopy Type Theory and Univalent Foundations July 31 - August 1, 2022, Haifa, Israel https://urldefense.com/v3/__https://hott-uf.github.io/2022/__;!!IBzWLUs!AQ0FLG6ZucDzP2_oRgb7N80MTAPfWFTI_2c2sJyrtmVix0hL7mOjI9-GlnNXsSCOLFP8BSk2lndqRQ$ Co-located with FSCD 2022 https://urldefense.com/v3/__http://www.cs.tau.ac.il/*nachumd/FSCD/__;fg!!IBzWLUs!AQ0FLG6ZucDzP2_oRgb7N80MTAPfWFTI_2c2sJyrtmVix0hL7mOjI9-GlnNXsSCOLFP8BSnAdNZPPA$ Abstract submission deadline: 10 May 2022 ------------------------------------------------------------------------ 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/Univalent Foundations: from the study of syntax and semantics of type theory to practical formalization in proof assistants based on univalent type theory. As part of the workshop there will be an introductory tutorial intended to make the invited and contributed talks accessible to non-experts. ============================ # Invited speakers * Eric Finster (University of Birmingham) * Kristina Sojakova (INRIA Paris) * Taichi Uemura (Stockholm University) ================ # Submissions * Abstract submission deadline: 10 May 2022 * Author notification: mid June 2022 Submissions should consist of a title and a 1-2 pages abstract, in pdf format, via https://urldefense.com/v3/__https://easychair.org/conferences/?conf=hottuf2022__;!!IBzWLUs!AQ0FLG6ZucDzP2_oRgb7N80MTAPfWFTI_2c2sJyrtmVix0hL7mOjI9-GlnNXsSCOLFP8BSmGKqjQeA$ . 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 (Delft University of Technology and U of Birmingham) * Carlo Angiuli (Carnegie Mellon University) * Evan Cavallo (Stockholm University) * Chris Kapulkin (Western University) * Nicolai Kraus (University of Nottingham) * Peter LeFanu Lumsdaine (Stockholm University) * Anja Petkovi? Komel (Vienna University of Technology) * Paige Randall North (University of Pennsylvania) * Christian Sattler (Chalmers University of Technology) * Michael Shulman (University of San Diego) * Th?o Winterhalter (Max Planck Institute, Bochum) ================ # Organizers * Benedikt Ahrens (Delft University of Technology and U of Birmingham) * Evan Cavallo (Stockholm University) * Chris Kapulkin (Western University) * Anja Petkovi? Komel (Vienna University of Technology) * Paige Randall North (University of Pennsylvania) From email at justinh.su Fri Feb 4 15:39:33 2022 From: email at justinh.su (Justin Hsu) Date: Fri, 04 Feb 2022 15:39:33 -0500 Subject: [TYPES/announce] First CFP: MFPS 2022: Conference on Mathematical Foundations of Programming Semantics Message-ID: ========================================================= CALL FOR PAPERS: MFPS XXXVIII (MFPS 2022) 38th Conference on Mathematical Foundations of Programming Semantics July 11-13, 2022 Hybrid, from Ithaca, NY, USA https://urldefense.com/v3/__https://www.cs.cornell.edu/mfps-2022/__;!!IBzWLUs!HH0v3UHPOH2BiqMDHP3L8vlBjaM_d3HrN5zh1xYnV2TSpQd3DK4uF5wgT1UL2NaXPnrCAr1dFwyE-Q$ ========================================================== IMPORTANT DATES (anywhere on earth): Paper submission: April 29, 2022 Author notification: June 10, 2022 Final version due: June 24, 2022 ========================================================== We are delighted to announce the 38th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2022). While the pandemic situation is uncertain, we plan to hold a hybrid conference with the in-person event at Cornell University in Ithaca, New York. 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; process calculi; probabilistic systems; constructive mathematics; domain theory and categorical models; formal languages; formal methods; game semantics; lambda calculus; programming-language theory; quantum computation; security; topological models; logic; 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. ------------------------------------------------- PROGRAM COMMITTEE and SUBMISSION INSTRUCTIONS: The list of program committee members and the submission instructions will be announced soon. ------------------------------------------------- MFPS ORGANIZERS: Andrej Bauer, University of Ljubljana Lars Birkedal, Aarhus University Stephen Brookes, Carnegie Mellon University Justin Hsu, Cornell University Achim Jung, University of Birmingham Catherine Meadows, Naval Research Laboratory Michael Mislove, Tulane University Jo?l Ouaknine, Max Planck Institute for Software Systems Prakash Panangaden, McGill University Alexandra Silva, Cornell University Sam Staton, University of Oxford Christine Tasson, Sorbonne Universit? ------------------------------------------------- LOCAL ORGANIZERS: Dexter Kozen, Cornell University Alexandra Silva, Cornell University ------------------------------------------------- CONTACT For any further information about MFPS 2022, please contact the co-chairs: Justin Hsu (email at justinh.su) and Christine Tasson (christine.tasson at lip6.fr). -------------- next part -------------- An HTML attachment was scrubbed... URL: From unruh at ut.ee Sat Feb 5 14:42:35 2022 From: unruh at ut.ee (Dominique Unruh) Date: Sat, 5 Feb 2022 21:42:35 +0200 Subject: [TYPES/announce] Researcher positions (postdoc / phd) in Quantum Crypto and Formal Verification Message-ID: <8bbf9dca-bd38-43f9-c9ea-da65a5adce8e@ut.ee> *Researcher positions (postdoc/phd) **within the ERC Consolidator grant ?Certified Quantum Security?* [Below is the description of postdoc positions. Phd positions are similar and can be found here: https://urldefense.com/v3/__https://tinyurl.com/phd-vqc__;!!IBzWLUs!G9wHTdXdWlTau8RitJ396YNzA2QJuyojaZWpZgzfMS_VVNrePzjw7J3rIY2yg34clFKiU1DgYZo4VQ$ ] [This call can also be found here: https://urldefense.com/v3/__http://tinyurl.com/postdoc-vqc__;!!IBzWLUs!G9wHTdXdWlTau8RitJ396YNzA2QJuyojaZWpZgzfMS_VVNrePzjw7J3rIY2yg34clFKiU1Ak4zl_Ag$ ] As part of the ERC Consolidator Grant "Certified Quantum Security" and the US Airforce project "Verification of Quantum Cryptography", we are looking for postdocs to work on verification of quantum cryptography (or more generally on quantum cryptography). We will develop methods for the verification of proofs in quantum cryptography. Similar to what the EasyCrypt tool does in classical cryptography. The scope of the project covers everything from the logical foundations, through the development of tools, to the verification of real quantum protocols. The *ideal candidate* would have experience in: * Semantics * Theorem proving * Verification of classical cryptography * Quantum cryptography * Quantum computation / communication Of course, expertise in all those areas is very rare, so candidates who are strong in some of those areas and are interested in the others are encouraged to apply! Please contact *Dominique Unruh * if you have more questions about the project, the required background, Estonia, the position itself, or the application process. I can also provide a detailed description of the overall research project. The *salary range is 30000-36000 Euro* per year (depending on experience), which is highly competitive in Estonia due to low costs of living and low income tax rate (20%). Pension contributions and health insurance are covered by the employer. Applications are accepted at any time (until all positions are filled), and positions can start as soon as possible. Positions are typically for 2-3 years (up to negotiation). *To apply*, please send the following documents to unruh at ut.ee: * Curriculum vitae (please explain your scientific background) * List of publications * Research plan (i.e., how do you think you could contribute to the topic) * At least two letters of reference (please ask for the letters to be sent directly to us) * Phd degree Please apply as soon as possible. -------------- next part -------------- An HTML attachment was scrubbed... URL: From carsten at dcs.bbk.ac.uk Mon Feb 7 03:34:36 2022 From: carsten at dcs.bbk.ac.uk (Carsten Fuhs) Date: Mon, 7 Feb 2022 08:34:36 +0000 Subject: [TYPES/announce] FSCD 2022: Extended deadline (Abstract: February 12/ Submission: February 18) Message-ID: ================================================================== Updated information on: Abstract and Submission dates ================================================================== 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!FMuhvUrmit5vV3hR_FMtjGALE_6-Du5KPQOeDIDczx1jgs9c2fLMaDXyx2fhLybiyxfdfypGP3kakA$ 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 12, 2022 *** extended Submission: February 18, 2022 *** extended Rebuttal: March 29-April 1, 2022 Notification: April 15, 2022 Final version: April 30, 2022 INVITED SPEAKERS ---------------- - Cynthia Kop, Radboud University Nijmegen (FSCD Invited Speaker) - Alwen Tiu, The Australian National University (FSCD Invited Speaker) - Orna Kupferman, Hebrew University (FLoC Plenary Speaker) - Catuscia Palamidessi, INRIA Saclay and LIX (FLoC Keynote Speaker) AFFILIATED WORKSHOPS -------------------- - IFIP-WG1.6: Annual Meeting of the IFIP Working Group 1.6 on Term Rewriting (July 31, Invited talks only) https://urldefense.com/v3/__https://ifip-wg-rewriting.cs.ru.nl/__;!!IBzWLUs!FMuhvUrmit5vV3hR_FMtjGALE_6-Du5KPQOeDIDczx1jgs9c2fLMaDXyx2fhLybiyxfdfyrKn8XjzA$ - HoTT/UF: 7th Workshop on Homotopy Type Theory/Univalent Foundations (July 31-August 1) https://urldefense.com/v3/__https://hott-uf.github.io/2022/__;!!IBzWLUs!FMuhvUrmit5vV3hR_FMtjGALE_6-Du5KPQOeDIDczx1jgs9c2fLMaDXyx2fhLybiyxfdfyruxCQrUw$ - IWC: 11th International Workshop on Confluence (August 1) https://urldefense.com/v3/__http://cl-informatik.uibk.ac.at/iwc/2022/__;!!IBzWLUs!FMuhvUrmit5vV3hR_FMtjGALE_6-Du5KPQOeDIDczx1jgs9c2fLMaDXyx2fhLybiyxfdfyrzlcTfNA$ - LFMTP: International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (August 1) https://urldefense.com/v3/__https://lfmtp.org/workshops/2022/__;!!IBzWLUs!FMuhvUrmit5vV3hR_FMtjGALE_6-Du5KPQOeDIDczx1jgs9c2fLMaDXyx2fhLybiyxfdfyo0INmFkw$ - Linearity-TLLA: 3rd Joint International Workshop on Linearity in Logic and Computer science and its Applications (July 31-August 1) - TERMGRAPH: 12th International Workshop on Computing with Terms and Graphs (August 1) https://urldefense.com/v3/__http://www.termgraph.org.uk/2022/__;!!IBzWLUs!FMuhvUrmit5vV3hR_FMtjGALE_6-Du5KPQOeDIDczx1jgs9c2fLMaDXyx2fhLybiyxfdfyp2eQX1zw$ - WiL: 6th Workshop on Women in Logic (July 31) https://urldefense.com/v3/__https://sites.google.com/view/womeninlogic/workshops__;!!IBzWLUs!FMuhvUrmit5vV3hR_FMtjGALE_6-Du5KPQOeDIDczx1jgs9c2fLMaDXyx2fhLybiyxfdfyqdOi1Khw$ - WPTE: 9th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (July 31) https://urldefense.com/v3/__https://wpte2022.github.io/__;!!IBzWLUs!FMuhvUrmit5vV3hR_FMtjGALE_6-Du5KPQOeDIDczx1jgs9c2fLMaDXyx2fhLybiyxfdfyoD0QuSpg$ OVERVIEW -------- FSCD (https://urldefense.com/v3/__http://fscd-conference.org/__;!!IBzWLUs!FMuhvUrmit5vV3hR_FMtjGALE_6-Du5KPQOeDIDczx1jgs9c2fLMaDXyx2fhLybiyxfdfyrfhEpCOg$ ) 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!FMuhvUrmit5vV3hR_FMtjGALE_6-Du5KPQOeDIDczx1jgs9c2fLMaDXyx2fhLybiyxfdfyrtinE7VQ$ Submissions must be formatted using the LIPIcs style files (https://urldefense.com/v3/__https://submission.dagstuhl.de/series/details/5*author__;Iw!!IBzWLUs!FMuhvUrmit5vV3hR_FMtjGALE_6-Du5KPQOeDIDczx1jgs9c2fLMaDXyx2fhLybiyxfdfyrHphGZaQ$ ). 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 gabriel.scherer at gmail.com Mon Feb 7 09:53:52 2022 From: gabriel.scherer at gmail.com (Gabriel Scherer) Date: Mon, 7 Feb 2022 15:53:52 +0100 Subject: [TYPES/announce] CFP : Logical Frameworks and Meta-Languages: Theory and Practice + Frank Pfenning's 60th birthday @ FLOC 2022 Message-ID: ============================================================= Call for papers -- LFMTP 2022 Logical Frameworks and Meta-Languages: Theory and Practice Haifa, Israel -- August 1st, 2022 Affiliated with FSCD at FLoC 2022 https://urldefense.com/v3/__http://lfmtp.org/workshops/2022__;!!IBzWLUs!FAw5H8mpkebub9G85TV1zOCg_HJTw2ejrXAt3ceaD_oeSQTh6d_R-NRpIr3GbJzXs7FAIwChHxPQJg$ ============================================================= Abstract submission deadline: May 3, 2022 LFMTP 2022 will hold a special session in honour of Frank Pfenning's 60th birthday: one more reason to contribute & participate! 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 2022 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. The workshop's program will include contributed and invited talks. We hope that LFMTP takes place physically in Haifa, but online participation will be possible and may even be necessary. LMFTP 2022 will host a special session celebrating Frank Pfenning's contributions in the occasion of his 60th Birthday (belated). We therefore encourage and invite contributions that build or reflect on Frank's broad range of contributions. ## Important Dates Abstract submission deadline: May 3 Paper submission deadline: May 10 Notification to authors: June 15 ## Submission Submit on EasyChair: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=lfmtp2022__;!!IBzWLUs!FAw5H8mpkebub9G85TV1zOCg_HJTw2ejrXAt3ceaD_oeSQTh6d_R-NRpIr3GbJzXs7FAIwAiLeiM1Q$ 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. ## Proceedings A selection of the presented papers will be published online in the Electronic Proceedings in Theoretical Computer Science (EPTCS). ## Program Committee * Andreas Abel (Gothenburg University) * David Baelde, Co-Chair (ENS Rennes, IRISA) * Stephanie Balzer (CMU) * Kaustuv Chaudhuri (Inria Saclay Ile-de-France) * Kenji Maillard (Inria Rennes Bretagne Atlantique) * Sonia Marin (University of Birmingham) * Vivek Nigam, Co-Chair (Huawei ERC & UFPB) * Giselle Reis (CMU Qatar) * Gabriel Scherer (Inria Saclay Ile-de-France) * Carsten Schuermann (IT University of Copenhagen) * Bernardo Toninho (Universidade Nova de Lisboa and NOVA-LINCS) -------------- next part -------------- An HTML attachment was scrubbed... URL: From L.Bocchi at kent.ac.uk Tue Feb 8 08:20:22 2022 From: L.Bocchi at kent.ac.uk (Laura Bocchi) Date: Tue, 8 Feb 2022 13:20:22 +0000 Subject: [TYPES/announce] Postdoc on session types and reliability Message-ID: Dear Colleagues, We have an open postdoc position at the University of Kent on session types for reliable actor-based systems. Here is the call: https://urldefense.com/v3/__https://jobs.kent.ac.uk/Vacancy.aspx?id=3868&forced=1__;!!IBzWLUs!Hlp8L9hroE2imDFlWYyGYehbQ3ydBa_U47CanoFllZo_svDJt5eqk4tWnvg5RBIePdRHcy-Xuq2StA$ Feel free to forward this post to anyone that may be interested and to contact me for any questions. The deadline for application is March 1st . Best regards, Laura Bocchi -------------- next part -------------- An HTML attachment was scrubbed... URL: From a.hartmanns at utwente.nl Tue Feb 8 12:58:42 2022 From: a.hartmanns at utwente.nl (Hartmanns, Arnd (UT-EEMCS)) Date: Tue, 8 Feb 2022 17:58:42 +0000 Subject: [TYPES/announce] RRRR 2022: Call for submissions (extended deadlines) Message-ID: <455e672bbf0646cda44d250abda3062a@utwente.nl> Second 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!BqC78Sl06_H1f9OquZGKG3kk4mVZbmiBCxUHYwQ_9EIJjZlajE1HqimEDV4xB_ASKaUz_GTMljNtGQ$ *** EXTENDED DEADLINE: FEBRUARY 24 *** 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: * Presentation abstracts (1-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. The page limits are to be interpreted as guidelines, not as absolute limits. Authors of all accepted submissions will present their work at the workshop. We encourage demonstrations to be integrated in presentations, in particular for replication studies. SPECIAL ISSUE IN STTT Authors of accepted papers and abstracts will be invited to submit an extended/full version of their work to a special issue in the International Journal on Software Tools for Technology Transfer (STTT). Where applicable, we expect these journal submissions to be accompanied by an artifact for reproduction that will be permanently archived with a DOI upon publication. All journal submissions will undergo a full reviewing process. TIMELINE * February 24: **EXTENDED** Submission deadline for short papers and presentation abstracts * March 3: Acceptance notification * March 17: 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 s.dziembowski at uw.edu.pl Tue Feb 8 13:52:03 2022 From: s.dziembowski at uw.edu.pl (Stefan Dziembowski) Date: Tue, 8 Feb 2022 19:52:03 +0100 Subject: [TYPES/announce] Post-doc/senior researcher in smart contract security analysis using formal methods Message-ID: Position: Post-doc/senior researcher in smart contract security analysis using formal methods. Institution: Cryptography and Blockchain Lab, University of Warsaw, Poland We are looking for a post-doc/senior researcher in an Advanced Grant ?PROCONTRA? funded by the European Research Council (ERC) and led by Stefan Dziembowski. The task of the successful candidate will be to substantially contribute to our efforts of formally verifying cryptographic protocols that interact with smart contracts deployed on blockchains. Examples of such protocols include ?state channels,? ?Plasma,? or ?rollups? (see, e.g., the publications of Stefan Dziembowski for more on such protocols). We are currently focusing on applying proof assistants and automated provers (such as Coq, Easycrypt, Why3) to achieve this goal. We aim to formalize cryptography using the Universal Composability framework. Still, a successful candidate will be given substantial academic freedom and can work on various research problems related to the project?s central theme. We require good background on formal verification, documented by publications. Knowledge of cryptography is a plus but is not required. We offer an internationally competitive salary, a substantial budget for travel and equipment, and membership in a young and vibrant team with several international contacts. The funding is available until the end of 2025, and the position can last until then (this is subject to negotiations). For more information, please get in touch with the project leader, Stefan Dziembowski, by sending an email to s.dziembowski at uw.edu.pl. -- Prof. Stefan Dziembowski Institute of Informatics UNIVERSITY OF WARSAW Banacha 2 02-097 Warsaw, Poland phone: +48 609 015 404 website: https://urldefense.com/v3/__http://www.crypto.edu.pl/Dziembowski__;!!IBzWLUs!BTXwvxJp_OATw4uo8r6zAdsXl1QRaDtwBOfNq-zC04rKjEV1OPSddaE4F9kpWuISZI2okNlu9r4UKg$ From cmezzina at gmail.com Wed Feb 9 04:53:38 2022 From: cmezzina at gmail.com (Claudio Mezzina) Date: Wed, 9 Feb 2022 10:53:38 +0100 Subject: [TYPES/announce] RC2022 final CFP [extended deadline] Message-ID: ======================================================================= Final Call for Papers 14th Conference on Reversible Computation (RC 2022) https://urldefense.com/v3/__https://reversible-computation-2022.github.io/__;!!IBzWLUs!ClyCcYDDaWpRfZIzSVSGrWklJ6giWqjmfgSJxzE9k-2pcreSLswA2Nr-thazQ6pVK4ONZnvEuM5o_Q$ July 5th-6th, 2022, Urbino, Italy Abstract Submission: Mon, February 7th, 2022 Submission Deadline: Mon, February 21st, 2022 ======================================================================= ++++++++++ COVID-19 RC 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 cancel the physical event and adopt a fully remote solution ++++++++++ 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 28th, 2022 [extended] - Submission Deadline: Mon, February 28th, 2022 [extended] - Notification to Authors: Mon, April 4th, 2022 - Final Version: Mon, April 25th, 2022 - Conference: Tue-Wed, July 5th-6th, 2022 ===== Invited speakers ===== - Robert O'Callahan (rr debugger developer - Mozilla Foundation/Pernosco) - Vincent van Wingerden (Quantum Computing - Microsoft) ===== Paper submission ===== Interested researchers are invited to submit - full research papers (15 pages + 2 pages references), - tutorials (15 pages + 2 of bibliography), as well as - work-in-progress or tool demonstration papers (6 pages + 1 page references) 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!ClyCcYDDaWpRfZIzSVSGrWklJ6giWqjmfgSJxzE9k-2pcreSLswA2Nr-thazQ6pVK4ONZnvw3xhyHA$ SPECIAL ISSUE Selected papers will be invited to a special issue on the Journal of Logical and Algebraic Methods ===== 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 daniele.nantes at gmail.com Wed Feb 9 06:56:34 2022 From: daniele.nantes at gmail.com (Daniele Nantes) Date: Wed, 9 Feb 2022 08:56:34 -0300 Subject: [TYPES/announce] LSFA 2022 -- First Call for Papers Message-ID: 17th Workshop on Logical and Semantic Frameworks with Applications - LSFA 2022 23-24 September 2022 https://urldefense.com/v3/__https://lsfa2022.dcc.ufmg.br/__;!!IBzWLUs!Hb5jKFdvHnb21Q-pz8xZGKSfLUvZtMNud98yGCAAYHgZokfexpgTJ826gz0v_lXqkVROOuQR09AkAg$ Belo Horizonte, Brazil First Call for Papers ***Overview*** 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 excluding references) or short papers (with a maximum of 6 pages excluding references). 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://urldefense.com/v3/__https://easychair.org/conferences/?conf=lsfa2022__;!!IBzWLUs!Hb5jKFdvHnb21Q-pz8xZGKSfLUvZtMNud98yGCAAYHgZokfexpgTJ826gz0v_lXqkVROOuT7zgdgVw$ The pre-proceedings, containing the reviewed papers, will be available at the LSFA's webpage. 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 of each submission must 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 https://urldefense.com/v3/__http://lsfa.cic.unb.br__;!!IBzWLUs!Hb5jKFdvHnb21Q-pz8xZGKSfLUvZtMNud98yGCAAYHgZokfexpgTJ826gz0v_lXqkVROOuSQ1kPXMw$ ). ***Important dates*** * Abstract: Monday 2 May * Submission: Monday 9 May * Notification: Saturday 9 July * Preliminary proceedings version due: Thursday 1 September * Conference: Friday-Saturday 23-24 September * Submission for final EPTCS proceedings: Monday 17 October * Final version: Monday 21 November ***Program Committee*** Beniamino Accattoli, Inria & ?cole Polytechnique, France Sandra Alves, Universidade de Porto, Portugal Carlos Areces, Universidad Nacional de C?rdoba, Argentina Mauricio Ayala Rinc?n, Universidade de Bras?lia, Brazil Haniel Barbosa, Universidade Federal de Minas Gerais, Brazil Mario R. Folhadela Benevides, Universidade Federal Fluminense, Brazil Alejandro D?az-Caro, Universidad Nacional de Quilmes & ICC, CONICET/Universidad de Buenos Aires, Argentina Amy Felty, University of Ottawa, Canada Pascal Fontaine, University of Li?ge, Belgium (co-chair) Edward Hermann Haeusler, PUC-Rio de Janeiro, Brazil Delia Kesner, Universit? de Paris, France Temur Kutsia, RISC/Johannes Kepler University Linz, Austria Bruno Lopes, Universidade Federal Fluminense, Brazil Ian Mackie, Polytechnique, France, and University of Sussex, UK Alexandre Madeira, Universidade de Aveiro, Portugal S?rgio Marcelino, University of Lisbon, Portugal Mariano Moscato, National Institute of Aerospace, USA Daniele Nantes, Universidade de Bras?lia, Brazil (co-chair) Vivek Nigam, Huawei Munich Research Center, Germany Carlos Olarte, Universit? Sorbonne Paris Nord, France Mateus de Oliveira Oliveira, University of Bergen, Norway Valeria de Paiva, Topos Institute, Berkeley, USA, Brazil Alberto Pardo, Universidad de la Rep?blica, Uruguay Elaine Pimentel, University College London, UK Giselle Reis, Carnegie Mellon University-Qatar, Qatar Umberto Rivieccio, Universidade Federal do Rio Grande do Norte, Brazil Camilo Rocha, Pontificia Universidad Javeriana - Cali, Colombia Daniel Ventura, Universidade Federal de Goi?s, Brazil Petrucio Viana, Universidade Federal Fluminense, UFF, Brazil ***Organisers*** Haniel Barbosa (UFMG, Brazil) Mario S. Alvim (UFMG, Brazil) -- Daniele Nantes Grupo de Teoria da Computa??o Departamentos de Matem?tica e Computa??o Universidade de Bras?lia https://urldefense.com/v3/__http://www.mat.unb.br/*dnantes__;fg!!IBzWLUs!Hb5jKFdvHnb21Q-pz8xZGKSfLUvZtMNud98yGCAAYHgZokfexpgTJ826gz0v_lXqkVROOuS-LED8qQ$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From willem.heijltjes at gmail.com Wed Feb 9 09:16:23 2022 From: willem.heijltjes at gmail.com (Willem Heijltjes) Date: Wed, 9 Feb 2022 14:16:23 +0000 Subject: [TYPES/announce] PhD positions in Mathematical Foundations of Computer Science - Bath - deadline 4 March Message-ID: We are recruiting for 2 PhD positions Funding: Competition funded Deadline: Friday 4 March 2022 Start: October 2022 (anticipated) Contacts: Willem Heijltjes W.B.Heijltjes at bath.ac.uk Alessio Guglielmi A.Guglielmi at bath.ac.uk 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://urldefense.com/v3/__https://www.bath.ac.uk/projects/mathematical-foundations-of-computation/__;!!IBzWLUs!B24Jyxw15VSJgw-v_VH0JaxgceQy5Wtbz1usOV0PPyIr5aVgAbduvA1PDvzqpn5C41ouV3tywO-43g$ Please see at the end of this email for a list of projects and supervisors. ===== How to apply ===== To apply, please send a CV and transcript to one of the contacts: Willem Heijltjes W.B.Heijltjes at bath.ac.uk Alessio Guglielmi A.Guglielmi at bath.ac.uk We recommended to contact us informally first, or to contact one of the supervisors of the projects at the end of this email. Please use the above contacts also for any questions. 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. Non-UK applicants will also be required to have met the English language entry requirements of the University of Bath: https://urldefense.com/v3/__http://www.bath.ac.uk/corporate-information/postgraduate-english-language-requirements-for-international-students/__;!!IBzWLUs!B24Jyxw15VSJgw-v_VH0JaxgceQy5Wtbz1usOV0PPyIr5aVgAbduvA1PDvzqpn5C41ouV3sA8_Jw0A$ Anticipated start date: Monday 3 October 2022 ===== 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,609 per annum, 2021/22 rate) and research/training expenses (?1,000 per annum). EPSRC DTP studentships are open to Home students, and a limited number of opportunities are available to excellent International candidates. ===== Projects and Supervisors ===== VERIFICATION FOR REAL POLYNOMIAL ARITHMETIC Russell Bradford | R.J.Bradford at bath.ac.uk | https://urldefense.com/v3/__http://people.bath.ac.uk/masrjb/__;!!IBzWLUs!B24Jyxw15VSJgw-v_VH0JaxgceQy5Wtbz1usOV0PPyIr5aVgAbduvA1PDvzqpn5C41ouV3uOsAYPAA$ James Davenport | J.H.Davenport at bath.ac.uk | https://urldefense.com/v3/__http://people.bath.ac.uk/masjhd/__;!!IBzWLUs!B24Jyxw15VSJgw-v_VH0JaxgceQy5Wtbz1usOV0PPyIr5aVgAbduvA1PDvzqpn5C41ouV3vY7opZDA$ Tom Powell | trjp20 at bath.ac.uk | https://urldefense.com/v3/__http://t-powell.github.io__;!!IBzWLUs!B24Jyxw15VSJgw-v_VH0JaxgceQy5Wtbz1usOV0PPyIr5aVgAbduvA1PDvzqpn5C41ouV3spNE1KdA$ 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 (https://urldefense.com/v3/__http://arxiv.org/abs/2004.04034__;!!IBzWLUs!B24Jyxw15VSJgw-v_VH0JaxgceQy5Wtbz1usOV0PPyIr5aVgAbduvA1PDvzqpn5C41ouV3vSpgzw8g$ ) 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 | https://urldefense.com/v3/__http://alessio.guglielmi.name__;!!IBzWLUs!B24Jyxw15VSJgw-v_VH0JaxgceQy5Wtbz1usOV0PPyIr5aVgAbduvA1PDvzqpn5C41ouV3sqqHSFJw$ 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 | https://urldefense.com/v3/__http://willem.heijltj.es__;!!IBzWLUs!B24Jyxw15VSJgw-v_VH0JaxgceQy5Wtbz1usOV0PPyIr5aVgAbduvA1PDvzqpn5C41ouV3vvpjrtEg$ 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 with a new way of incorporating effects into the lambda-calculus: the Functional Machine 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 | https://urldefense.com/v3/__http://www.cs.bath.ac.uk/*jl317/__;fg!!IBzWLUs!B24Jyxw15VSJgw-v_VH0JaxgceQy5Wtbz1usOV0PPyIr5aVgAbduvA1PDvzqpn5C41ouV3sul-ZgwA$ 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 | https://urldefense.com/v3/__http://www.cs.bath.ac.uk/*gam23/__;fg!!IBzWLUs!B24Jyxw15VSJgw-v_VH0JaxgceQy5Wtbz1usOV0PPyIr5aVgAbduvA1PDvzqpn5C41ouV3uft8gSDA$ 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 | https://urldefense.com/v3/__http://t-powell.github.io__;!!IBzWLUs!B24Jyxw15VSJgw-v_VH0JaxgceQy5Wtbz1usOV0PPyIr5aVgAbduvA1PDvzqpn5C41ouV3spNE1KdA$ 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. From A.Lisitsa at liverpool.ac.uk Thu Feb 10 10:19:24 2022 From: A.Lisitsa at liverpool.ac.uk (Lisitsa, Alexei) Date: Thu, 10 Feb 2022 15:19:24 +0000 Subject: [TYPES/announce] VPT 2022 Workshop, Extended Deadline Message-ID: <78a281eaba1840969213f1bd62afa5fd@liverpool.ac.uk> *************************************************************** (Submission deadline is extended) 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!B7H-lgQltBbNsXLRtwEtsXPgjlJXAHRtqPxN6qJiHtu-4zE-DPLKI1bStXE36_W2lXWffcwUuMPcoQ$ 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* * February 13th, 2022: Paper submission deadline (extended) * February 27th, 2022: Acceptance notification * March 14th, 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!B7H-lgQltBbNsXLRtwEtsXPgjlJXAHRtqPxN6qJiHtu-4zE-DPLKI1bStXE36_W2lXWffcxk1oaY0Q$ ), via the Easychair submission website for VPT 2022: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=vpt2022__;!!IBzWLUs!B7H-lgQltBbNsXLRtwEtsXPgjlJXAHRtqPxN6qJiHtu-4zE-DPLKI1bStXE36_W2lXWffczED0Ev5g$ 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!B7H-lgQltBbNsXLRtwEtsXPgjlJXAHRtqPxN6qJiHtu-4zE-DPLKI1bStXE36_W2lXWffcwS8Dg5QQ$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From patrick.baillot at univ-lille.fr Fri Feb 11 10:17:03 2022 From: patrick.baillot at univ-lille.fr (Patrick Baillot) Date: Fri, 11 Feb 2022 16:17:03 +0100 (CET) Subject: [TYPES/announce] LCC 2022 workshop Final call for participation Message-ID: <1184769779.1316396.1644592623379.JavaMail.zimbra@univ-lille.fr> ================================================================= Final Call for Participation 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!CYaEPTE8kKWOWW6UKDFcv_P1JDrZiDAfqoUWDNXS1U7nBZZwn5yKextE0zP4QLfb7aGcd0UIBVR_Cw$ ================================================================= * The programme is now available online on the workshop?s web page: https://urldefense.com/v3/__http://www.cs.swansea.ac.uk/lcc/__;!!IBzWLUs!CYaEPTE8kKWOWW6UKDFcv_P1JDrZiDAfqoUWDNXS1U7nBZZwn5yKextE0zP4QLfb7aGcd0UIBVR_Cw$ * Invited speakers: Stephan Kreutzer (TU Berlin) Carsten Lutz (University of Bremen) Isabel Oitavem (Nova University Lisbon) * Registration is free, but necessary for organisation reasons. Please register on CSL?s website: https://urldefense.com/v3/__http://csl2022.uni-goettingen.de/__;!!IBzWLUs!CYaEPTE8kKWOWW6UKDFcv_P1JDrZiDAfqoUWDNXS1U7nBZZwn5yKextE0zP4QLfb7aGcd0U4OrO8xA$ 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. 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 ugo.dallago at unibo.it Sat Feb 12 03:49:37 2022 From: ugo.dallago at unibo.it (Ugo Dal Lago) Date: Sat, 12 Feb 2022 09:49:37 +0100 Subject: [TYPES/announce] Tenure Track Position (RTDB) in Computer Science (INF/01) at the University of Bologna - Call Opened Message-ID: <5D7B0BBA-4653-46DB-BB65-C05BA40E8B82@unibo.it> The University of Bologna is offering a tenure-track position in Computer Science (Ricercatore a Tempo Determinato, Tipo B, INF/01) at the Department of Computer Science and Engineering. The official call is out, with deadline March 15th, 2022: Indirizzo: https://urldefense.com/v3/__https://bandi.unibo.it/s/apos5/rif-687-bando-per-1-posto-da-ricercatore-a-tempo-determinato-b-senior-dipartimento-di-informatica-scienza-e-ingegneria-disi-inf-01__;!!IBzWLUs!AT_4JAS22p5Y9RSR_scV-yE-bWyPVFivYDRUxuqElnr668aCMi6Axu1QWUPzZRta0-4jh2r_i3qedw$ Interested candidates could contact Prof. Ugo Dal Lago (ugo.dallago at unibo.it) for more information. From cposkitt at smu.edu.sg Sat Feb 12 12:02:25 2022 From: cposkitt at smu.edu.sg (Christopher Michael POSKITT) Date: Sat, 12 Feb 2022 17:02:25 +0000 Subject: [TYPES/announce] CfP GCM 2022 - 13th International Workshop on Graph Computation Models Message-ID: <390F193E-675E-4FCA-A30D-44143FDB73DB@smu.edu.sg> [apologies for cross-posting] ***** CALL FOR PAPERS ***** ======================================= 13th International Workshop on Graph Computation Models (GCM 2022) 4-8 July 2022 (exact day TBC) Venue: Nantes, France Web site: https://urldefense.com/v3/__https://gcm2022.github.io/__;!!IBzWLUs!DcHlK0bVIMIAnaOoYQXyRiRUHSaPfwl-Ofefrjrryp7v-iC2px3oKYnFCJ4f7YBAkwYXK_MPSfCFIA$ Part of STAF 2022 (https://urldefense.com/v3/__https://staf2022.univ-nantes.io/__;!!IBzWLUs!DcHlK0bVIMIAnaOoYQXyRiRUHSaPfwl-Ofefrjrryp7v-iC2px3oKYnFCJ4f7YBAkwYXK_PovUqetQ$ ) ======================================= Graphs are common mathematical structures which are visual and intuitive. They constitute a natural and seamless way for system modeling in science, engineering and beyond, including computer science, life sciences, business processes, etc. Graph computation models constitute a class of very high-level models where graphs are first-class citizens. They generalize classical computation models based on strings or trees, such as Chomsky grammars or term rewrite systems. Their mathematical foundation, in addition to their visual nature, facilitates specification, validation and analysis of complex systems. A variety of computation models have been developed using graphs and rule-based graph transformation. These models include features of programming languages and systems, paradigms for software development, concurrent calculi, local computations and distributed algorithms, and biological and chemical computations. The International Workshop on Graph Computation Models aims at bringing together researchers interested in all aspects of computation models based on graphs and graph transformation. It promotes the cross-fertilizing exchange of ideas and experiences among young and senior researchers from different communities who are interested in the foundations, applications, and implementations of graph computation models and related areas. --------------------------------------- ** IMPORTANT DATES ** Abstract Submission: 20 April 2022 Paper Submission: 27 April 2022 Notification: 25 May 2022 Final version due: 15 June 2022 Workshop: 4?8 July 2022 (exact day TBC) --------------------------------------- ** TOPICS ** GCM 2022 solicits papers on all aspects of graph computation models. This includes, but is not limited to the following topics: FOUNDATIONS * Models of graph transformation * Analysis and verification of graph transformation systems * Parallel, concurrent, and distributed graph transformation * Term graph rewriting * Formal graph languages APPLICATIONS * Graph-based programming models and visual programming * Program analysis and transformation * Graph-based machine learning, including graph neural networks and models of rule inference * Model-driven engineering and model transformation * Evolutionary computation; software architectures, validation and evolution * Databases * Graph-based security models * Workflow and business processes * Social network analysis * Bioinformatics and computational chemistry * Quantum computing * Case studies --------------------------------------- ** SUBMISSION TYPES ** Authors are invited to submit papers in two possible categories: (1) Regular papers of at most 16 pages describing innovative contributions. (2) Position papers, system descriptions, or work in progress of 6 to 12 pages. Papers in PDF format should be submitted electronically via the EasyChair system site (https://urldefense.com/v3/__https://easychair.org/conferences/?conf=gcm2022__;!!IBzWLUs!DcHlK0bVIMIAnaOoYQXyRiRUHSaPfwl-Ofefrjrryp7v-iC2px3oKYnFCJ4f7YBAkwYXK_OA1Nlb5g$ ). Submissions must use the EPTCS LaTeX style (https://urldefense.com/v3/__http://style.eptcs.org/__;!!IBzWLUs!DcHlK0bVIMIAnaOoYQXyRiRUHSaPfwl-Ofefrjrryp7v-iC2px3oKYnFCJ4f7YBAkwYXK_O4-NlcyA$ ). Simultaneous submission to other conferences with proceedings, as well as submission of material that has already been published elsewhere is not allowed. The page limits include references. An optional appendix can be added if this is useful for the reviewing process. All submissions will be reviewed by the programme committee. Electronic proceedings will be available at the time of the workshop. Selected authors will be invited to contribute to post-proceedings to be published online by Electronic Proceedings in Theoretical Computer Science (EPTCS, https://urldefense.com/v3/__http://www.eptcs.org/__;!!IBzWLUs!DcHlK0bVIMIAnaOoYQXyRiRUHSaPfwl-Ofefrjrryp7v-iC2px3oKYnFCJ4f7YBAkwYXK_NZpIeSPA$ ). --------------------------------------- ** INVITED SPEAKER ** * Elizabeth Dinella (University of Pennsylvania, USA) ? graph-based machine learning in program transformation and analysis --------------------------------------- ** PROGRAMME COMMITTEE ** Confirmed programme committee members at the time of this call include: * Andrea Corradini, Universit? di Pisa, Italy * Frank Drewes, Ume? University, Sweden * Annegret Habel, University of Oldenburg, Germany * Reiko Heckel (co-Chair), University of Leicester, Germany * Berthold Hoffmann, University of Bremen, Germany * Barbara K?nig, University of Duisburg-Essen, Germany * Leen Lambers, Brandenburgische Technische Universit?t Cottbus-Senftenberg, Germany * Mark Minas, Universit?t der Bundeswehr M?nchen, Germany * Fernando Orejas, Universitat Polit?cnica de Catalunya, Spain * Detlef Plump, University of York, UK * Chris Poskitt (co-Chair), Singapore Management University, Singapore --------------------------------------- ** ORGANISERS ** * Reiko Heckel (rh122 at leicester.ac.uk) * Chris Poskitt (cposkitt at smu.edu.sg) For more information, please visit the official workshop website at: https://urldefense.com/v3/__https://gcm2022.github.io/__;!!IBzWLUs!DcHlK0bVIMIAnaOoYQXyRiRUHSaPfwl-Ofefrjrryp7v-iC2px3oKYnFCJ4f7YBAkwYXK_MPSfCFIA$ --------------------------------------- From theo at irif.fr Sun Feb 13 10:49:19 2022 From: theo at irif.fr (=?UTF-8?Q?Th=c3=a9o_Zimmermann?=) Date: Sun, 13 Feb 2022 16:49:19 +0100 Subject: [TYPES/announce] Coq Community Survey 2022 Message-ID: <6040cf03-a2fc-1320-08bd-31e683a4447b@irif.fr> Dear type theory enthusiasts who have used or are using the Coq proof assistant, The Coq team kindly requests your participation in the Coq community survey 2022, at the following URL: https://urldefense.com/v3/__https://sondages.inria.fr/index.php/356388?lang=en__;!!IBzWLUs!CPO-O_jeDIIe4ICFKVqa7nXFjLSQi9Bb1CDPGYERh2FHjVuBN0MhoGWwhWQqGyKsJhthszIQWJEfhQ$ This survey will help us get an updated picture of the Coq community and inform our future decisions. As part of the survey, participants can answer questions on whether they use specific typing mechanisms and features in Coq, and we will share aggregate survey data with the type theory community. The deadline for submitting the survey is February 28, 2022 (AoE). Since the survey is quite long, please don't wait until the last minute to start answering. The survey is available in English and in Chinese. See our Discourse post for more information about the survey: https://urldefense.com/v3/__https://coq.discourse.group/t/coq-community-survey-2022/1547/4__;!!IBzWLUs!CPO-O_jeDIIe4ICFKVqa7nXFjLSQi9Bb1CDPGYERh2FHjVuBN0MhoGWwhWQqGyKsJhthszKN9cLfkw$ Regards, The Coq team From Clement.Aubert at math.cnrs.fr Sun Feb 13 11:18:26 2022 From: Clement.Aubert at math.cnrs.fr (=?UTF-8?Q?Cl=c3=a9ment_Aubert?=) Date: Sun, 13 Feb 2022 11:18:26 -0500 Subject: [TYPES/announce] CfP: 15th Interaction and Concurrency Experience (ICE 2022) Message-ID: <5d721b2f-dcac-b047-4f64-5a09959d9bde@math.cnrs.fr> *** We apologize for possible cross posting *** ?????????????????????????????? ICE 2022 ???????????? 15th Interaction and Concurrency Experience ???????????????????????????? 17 June 2022 ????? IMT School for Advanced Studies Lucca, Italy and/or online ???????????????? Satellite workshop of DisCoTec 2022 ????????????????? https://www.discotec.org/2022/ice ?????????????????????????? Submission link: ??? https://openreview.net/group?id=DisCoTec.org/2022/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 === ??? * 11 April 2022: abstract submission ??? * 15 April 2022: paper submission ??? * 3 June 2022: notification ??? * 17 June 2022: ICE workshop ??? * 12 July 2022: camera-ready for EPTCS post-proceedings (to be confirmed) === 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/2022/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 === ??? * Cl?ment Aubert (Augusta University, USA) - aubert (at) math.cnrs.fr ??? * Cinzia Di Giusto (Universit? C?te d?Azur, CNRS, I3S, FR) - cinzia.di-giusto (at) unice.fr ??? * Larisa Safina (Inria, FR) - larisa.safina (at) inria.fr ??? * Alceste Scalas (Technical University of Denmark, DK) - alcsc (at) dtu.dk === PROGRAM COMMITTEE (under construction) === ??? * Duncan Paul Attard (Reykjav?k University, IS) ??? * Massimo Bartoletti (Universit? di Cagliari, IT) ??? * Davide Basile (ISTI CNR, IT) ??? * H?l?ne Coullon (IMT Atlantique, FR) ??? * Jovana Dedei? (Faculty of Technical Sciences, University of Novi Sad, RS) ??? * Simon Fowler (University of Glasgow School of Computing Science, GB-SCT) ??? * Saverio Giallorenzo (University of Bologna, IT) ??? * Ludovic Henrio (CNRS, FR) ??? * Keigo Imai (Gifu University, JP) ??? * Sung-Shik Jongmans (Open University of the Netherlands, NL) ??? * Ivan Lanese (University of Bologna, IT) ??? * Julien Lange (Royal Holloway, University of London, GB) ??? * Diego Marmsoler (University of Exeter, GB) ??? * Marco Peressotti (University of Southern Denmark, DK) ??? * Kirstin Peters (Technischen Universit?t Darmstadt, GE) ??? * Ivan Proki? (Faculty of Technical Sciences, University of Novi Sad, RS) ??? * Matteo Sammartino (Royal Holloway, University of London, GB) === 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: ice22 at googlegroups.com -- Cl?ment Aubert, Assistant Professor of Computer Science, School of Computer and Cyber Sciences, Augusta University, https://spots.augusta.edu/caubert/ -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_0x3BDD37F5437DD153.asc Type: application/pgp-keys Size: 3103 bytes Desc: OpenPGP public key URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_signature Type: application/pgp-signature Size: 840 bytes Desc: OpenPGP digital signature URL: From tobias.wrigstad at it.uu.se Tue Feb 15 13:12:21 2022 From: tobias.wrigstad at it.uu.se (Tobias Wrigstad) Date: Tue, 15 Feb 2022 18:12:21 +0000 Subject: [TYPES/announce] PhD position on efficient and provably correct execution environments Message-ID: <267EE259-E9CD-48EF-A3FC-A9F8B3A08717@it.uu.se> The programming languages' group at the Department of Information Technology at Uppsala University, Sweden is opening one PhD student position to on the topic of efficient and provably correct execution environments for managed languages. Background: Managed languages (such as Java, Python, R and JavaScript) allow a high level of programming abstraction which allows rapid application development with fewer errors, in particular by presenting programmers with an abstract view of memory that can be managed automatically by the runtime system (aka execution environment). The efficiency of the algorithms at the core of runtime systems for managing memory, scheduling, etc. are imperative for the performance of managed languages. The strive for efficiency drives up complexity of the algorithms, stressing the need for a rigorous process for verifying their correctness. Project: This project aims to develop efficient algorithms for key aspects of runtime systems related to memory management, task scheduling, compiler optimisations for specific runtimes with a strong focus on their formal verification. Thus, this project requires an understanding of and interest in both low-level aspects of program execution as well as mathematical underpinnings of verifying of algorithms operating at a low-level. There exist a wide range of interesting challenges to work on in the context of some specific runtime systems. Candidates will be working with experts in programming languages, computer architecture, and with close ties to companies developing and maintaining programming language implementations. Additional Details: Swedish PhD positions are for four years of research, but will typically include 20% teaching extending the time to five years. You will be expected to teach in English. Swedish PhD students are full employees, with competitive salaries, pension provision and five weeks of paid leave per year. Spouses of employees are entitled to work permits. Healthcare is free after a small co-pay and the university subsidises athletic costs, such as a gym membership. The parental benefits in Sweden are among the best in the world, including extensive parental leave (for both parents), paid time off to care for sick children, and affordable daycare. Upon completion of the PhD degree, students are entitled to permanent residency to find employment within Sweden. More information and instructions for how to apply here: https://urldefense.com/v3/__https://www.uu.se/en/about-uu/join-us/details/?positionId=466911__;!!IBzWLUs!DqFpkCq-4xzKbt1bKGakIT6uPta1IdbgnvNJVARA6RkIEMIh0Dyqzj33mDrEGuz12XOdLJXbjQaPbg$ * Application deadline: March 1st, 2022 * Targeted starting time: as soon as possible, before September 1st, 2021 Questions can be asked to: Professor Tobias Wrigstad, tobias.wrigstad at it.uu.se Associate Professor Tjark Weber tjark.weber at it.uu.se ------------------------------------------------------------ Tobias Wrigstad, Professor Distinguished University Teacher Head of Education Department of Information Technology Uppsala University, Sweden Email: tobias.wrigstad at it.uu.se Web: https://urldefense.com/v3/__http://wrigstad.com__;!!IBzWLUs!DqFpkCq-4xzKbt1bKGakIT6uPta1IdbgnvNJVARA6RkIEMIh0Dyqzj33mDrEGuz12XOdLJUs1SdCZQ$ 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: https://urldefense.com/v3/__http://www.uu.se/om-uu/dataskydd-personuppgifter/__;!!IBzWLUs!DqFpkCq-4xzKbt1bKGakIT6uPta1IdbgnvNJVARA6RkIEMIh0Dyqzj33mDrEGuz12XOdLJX6-9uweQ$ E-mailing Uppsala University means that we will process your personal data. For more information on how this is performed, please read here: https://urldefense.com/v3/__http://www.uu.se/en/about-uu/data-protection-policy__;!!IBzWLUs!DqFpkCq-4xzKbt1bKGakIT6uPta1IdbgnvNJVARA6RkIEMIh0Dyqzj33mDrEGuz12XOdLJWoWPHSMw$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From giorgio.audrito at unito.it Tue Feb 15 13:59:57 2022 From: giorgio.audrito at unito.it (Giorgio Audrito) Date: Tue, 15 Feb 2022 19:59:57 +0100 Subject: [TYPES/announce] DisCoTec 2022 call for tutorials [deadline feb 28] Message-ID: ***************************************************************************** Call for 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!BnV2SpzEyjFNK7QcF32V6TO53A4JcN22rUoUbcQ5U6i2pbzHYBnh96H2PL8xUuQySXhHNKhFm2l2dA$ ***************************************************************************** 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. Tutorials will take place on Monday, June 13, 2022. Submissions of tutorial proposals must reach the Workshops and Tutorials Chairs by February 28, 2022. * 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!BnV2SpzEyjFNK7QcF32V6TO53A4JcN22rUoUbcQ5U6i2pbzHYBnh96H2PL8xUuQySXhHNKgC20nL9w$ * Proposal Evaluation Criteria * - Interest and relevance for the DisCoTec community - Impact of the topic - The novelty with respect to other 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 graham.leigh at gu.se Wed Feb 16 02:58:36 2022 From: graham.leigh at gu.se (Graham Leigh) Date: Wed, 16 Feb 2022 07:58:36 +0000 Subject: [TYPES/announce] Nordic Online Logic Seminar: next talk on February 28 by Thierry Coquand Message-ID: <8F2049E8-4477-4639-A870-7F1E497D6AEF@gu.se> The Nordic Online Logic Seminar (NOL Seminar) is organised monthly over Zoom, with expository talks on topics of interest for the broader logic community. The seminar is open for professional or aspiring logicians and logic aficionados worldwide. See the announcement for the next talk below. If you wish to receive the Zoom ID and password for it, as well as further announcements, please subscribe here: https://urldefense.com/v3/__https://listserv.gu.se/sympa/subscribe/nordiclogic__;!!IBzWLUs!ApnzhNt8RTIXnZMlC8xOjxnwJFA8CSy3_y2Qyeg6nsWQ54qGBQA41bdz6v73bYkwd84FIsdQ9Xrv-g$ . Val Goranko and Graham Leigh NOL seminar organisers -------------------------------------- Nordic Online Logic Seminar Next talk: Monday, February 28, 16.00-17.30 CET (UTC+1), on Zoom (details are provided to the seminar subscribers) Title: Formalization of Mathematics and Dependent Type Theory Speaker: Thierry Coquand, professor in computer science at the University of Gothenburg, Sweden Abstract: The first part will be about representation of mathematics on a computer.Questions that arise there are naturally reminiscent of issues that arise when teaching formal proofs in a basic logic course, e.g. how to deal with free and bound variables, and instantiation rules. As discussed in a 1962 paper of Tarski, these issues are "clearly experienced both in teaching an elementary course in mathematical logic and in formalizing the syntax of predicate logic for some theoretical purposes." I will present two quite different approaches to this problem: one inspired by Tarski's paper (N. Megill, system Metamath) and one using dependent type theory (N.G. de Bruijn). The second part will then try to explain how notations introduced by dependent type theory suggest new insights for old questions coming from Principia Mathematica (extensionality, reducibility axiom) through the notion of universe, introduced by Grothendieck for representing category theory in set theory, and introduced in dependent type theory by P. Martin-L?f. -------------- next part -------------- An HTML attachment was scrubbed... URL: From Marie.Farrell at mu.ie Thu Feb 17 10:08:55 2022 From: Marie.Farrell at mu.ie (Marie Farrell) Date: Thu, 17 Feb 2022 15:08:55 +0000 Subject: [TYPES/announce] VerifyThis Verification Competition 2022 Message-ID: ******************************************************************************** VerifyThis Verification Competition 2022 CALL FOR PARTICIPATION -- TRAVEL GRANTS Competition to be held at ETAPS 2022 https://urldefense.com/v3/__http://verifythis.ethz.ch__;!!IBzWLUs!BLBoiWhsVCUQhWYign51wtibo5oHy6gnDpt4dAiRcd4C1H4hbJBAGYMnuQ8aGoc0RBWQUoqcSSFfug$ ******************************************************************************** IMPORTANT DATES Grant application deadline: March 7, 2022 Competition: April 2 and 3, 2022 ABOUT VerifyThis 2022 is a program verification competition taking place as part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2022) on April 2-3, 2022 in Munich, Germany. It is the 10th event in the VerifyThis competition series. 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. Registration for ETAPS workshops and physical presence on site is required. We particularly encourage participation of: - student teams (this includes PhD students) - non-developer teams using a tool someone else developed - several teams using the same tool TRAVEL GRANTS The competition has funds for a limited number of travel grants. A grant covers the incurred travel and accommodation costs up to a certain limit. The expected limit is EUR 350 for those coming from Europe and EUR 600 for those coming from outside Europe. To apply for a travel grant, send an email to verifythis at googlegroups.com by March 7, 2022. The application should include: - your name - your affiliation - the verification system(s) you plan to use at the competition - the planned composition of your team (and whether you are developers of the tools you'll be using) - a short letter of motivation explaining your involvement with formal verification so far - if you are a student, please state the academic degree you are seeking and have your supervisor send a brief letter of support to verifythis at googlegroups.com ORGANIZERS * Marie Farrell, Maynooth University, Ireland * Peter Lammich, University of Twente, The Netherlands CONTACT Email: verifythis at googlegroups.com Web: https://urldefense.com/v3/__http://verifythis.ethz.ch__;!!IBzWLUs!BLBoiWhsVCUQhWYign51wtibo5oHy6gnDpt4dAiRcd4C1H4hbJBAGYMnuQ8aGoc0RBWQUoqcSSFfug$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From david.pearce at ecs.vuw.ac.nz Wed Feb 16 21:55:46 2022 From: david.pearce at ecs.vuw.ac.nz (David Pearce) Date: Thu, 17 Feb 2022 15:55:46 +1300 Subject: [TYPES/announce] Lecturer / Senior Lecturer in Software Engineering Message-ID: Hi all, Victoria University is advertising a lecturer (or senior lecturer) position in Software Engineering. This academic role encompasses the delivery of high-quality teaching, research and service that supports the school and programme. Applications are welcome from people with experience areas that complement our expertise in Software Engineering including but not limited to: * Software supply chain management, including software ecosystems and dependency management, repository mining * Software process and devops, including process automation, automated testing, agile techniques * Software quality and assurance, including automated methods to assess and improve quality attributes of software systems such as testing, verification and program analysis * Software engineering techniques with an emphasis on cloud computing, including cloud-based development and collaboration platforms, virtualisation, cloud storage, data management and API design See the advertisement here: https://urldefense.com/v3/__https://vuwnz.broadbeantech.com/jobs/view/1048/Lecturer-/-Senior-Lecturer-in-Software-Engineering.html__;!!IBzWLUs!Cg9t_Ci6n3jB3vRVtE2ucIg2IxLDG6f-H9VIR108N2Bg1UdZzQ5gqf3_uDh9qLtPxuSPoS3aHEHAkg$ Cheers, Dave -- Associate Professor of Computer Science (Ahonuku), School of Engineering and Computer Science Victoria University of Wellington, PO Box 600, Wellington, New Zealand. He/Him Cotton 231 (Office) +64 (0)4 463 5833 https://urldefense.com/v3/__http://ecs.victoria.ac.nz/*djp__;fg!!IBzWLUs!Cg9t_Ci6n3jB3vRVtE2ucIg2IxLDG6f-H9VIR108N2Bg1UdZzQ5gqf3_uDh9qLtPxuSPoS3wZfgkTw$ From Luigia.Petre at abo.fi Thu Feb 17 04:59:24 2022 From: Luigia.Petre at abo.fi (Luigia Petre) Date: Thu, 17 Feb 2022 09:59:24 +0000 Subject: [TYPES/announce] FME Teaching tutorial on Friday, February 25, at 3 pm CET --> Prof Shriram Krishnamurthi, Brown University, US Message-ID: <354a20730e654a21a0fb0102a21d15d1@abo.fi> Dear all, We restart the FME Teaching Committee's series of tutorials in 2022 with Prof. Shriram Krishnamurthi's lecture on Friday, February 25, at 3 pm CET. His talk in entitled "From Tests to Properties: Property-Based Testing Using Relational Problems". The zoom link is https://aboakademi.zoom.us/j/64254430116. The event will last about an hour. Warmly welcome!! Kind regards, Luigia Petre (on behalf of the FME Teaching Committee) PS1: the tutorial series webpage is updated with the list of speakers who confirmed their lectures in 2022 here: https://urldefense.com/v3/__https://fme-teaching.github.io/2021/08/24/tutorial-series-of-the-fme-teaching-committee/__;!!IBzWLUs!A1sjZwMBn8NqbCvLUvaR8gwOHrsDFb0KqOEbz2JhTkPTiAKqEM83B9QCHjDsgIChLjSuib8okuGBtg$ . PS2: the tutorial series aims to increase the awareness and sharing of tools and techniques used for teaching formal methods __ Luigia Petre, Docent, PhD Faculty of Science and Engineering ?bo Akademi University, Finland https://urldefense.com/v3/__http://www.users.abo.fi/lpetre__;!!IBzWLUs!A1sjZwMBn8NqbCvLUvaR8gwOHrsDFb0KqOEbz2JhTkPTiAKqEM83B9QCHjDsgIChLjSuib_-fLkpvQ$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From caterina.urban at ens.fr Thu Feb 17 16:26:51 2022 From: caterina.urban at ens.fr (Caterina Urban) Date: Thu, 17 Feb 2022 22:26:51 +0100 Subject: [TYPES/announce] ETAPS Mentoring Workshop 2022 - Call for Participation Message-ID: <015655BC-765F-41FB-B1B2-EB6BCD191E42@ens.fr> ETAPS Mentoring Workshop 2022 3rd April 2022 Call for Participation As a PhD student, or Master student with research ambitions, you may wonder how internationally recognised researchers in computer science could become what they are now. What can one learn from their example? What do successful research paths look like? Are the important factors just as expected, or are there surprising aspects which make the difference? What is important to think about at your stage? We welcome PhD students, and Master students with research ambitions, to join the Mentoring Workshop at ETAPS 2022! During this workshop, well known computer science researchers, of different seniority, will give inspirational talks about their path they took, what was important on the way, and insights they want to pass on to early career researchers. There will be plenty of opportunity for discussions and interaction, during the workshop and in the social programme around it. We are proud that we could secure the following speakers: Erika ?brah?m , RWTH Aachen Eva Darulova , Uppsala University Laura Kov?cs , Vienna University of Technology Peter M?ller , ETH Zurich Martin Sch?f , Amazon AWS Martin Wirsing , LMU Munich You register for the Mentoring Workshop by registering for ?Satellite (Workshops) Sunday? at the ETAPS registration page. (You may also want to register for the main conference. But note that these registrations do not overlap.) The early registration deadline is very soon (20 Feb), but the normal registration is open until 10 March. (After that, the late registration fee applies.) ETAPS provides some student scholarships, see link below. Important links: ETAPS Mentoring Workshop: https://urldefense.com/v3/__https://etaps.org/user-profile/archive/53-etaps-2022/486-mentoring-workshop-2022__;!!IBzWLUs!F_06AQcZQ798NonQhF55WXSZXuOsUokskHR-v0VI1qPZs6sE16cURi9ZHAiWOwqIOS8YICrSIhCd0w$ ETAPS 2022 in Munich: https://urldefense.com/v3/__https://etaps.org/__;!!IBzWLUs!F_06AQcZQ798NonQhF55WXSZXuOsUokskHR-v0VI1qPZs6sE16cURi9ZHAiWOwqIOS8YICq0RHwjmA$ ETAPS 2022 registration: https://urldefense.com/v3/__https://etaps.org/2022/registration__;!!IBzWLUs!F_06AQcZQ798NonQhF55WXSZXuOsUokskHR-v0VI1qPZs6sE16cURi9ZHAiWOwqIOS8YICpxx4QL2w$ ETAPS student scholarships (application deadline 1 March): https://urldefense.com/v3/__https://etaps.org/2022/student-scholarships__;!!IBzWLUs!F_06AQcZQ798NonQhF55WXSZXuOsUokskHR-v0VI1qPZs6sE16cURi9ZHAiWOwqIOS8YICrXPNVNxA$ In case of questions, please contact the organizers: Wolfgang Ahrendt , Chalmers University of Technology Gidon Ernst , LMU Munich Caterina Urban , Inria & ?cole Normale Sup?rieure | PSL University -------------- next part -------------- An HTML attachment was scrubbed... URL: From mzi at cs.aau.dk Fri Feb 18 04:09:55 2022 From: mzi at cs.aau.dk (Martin Zimmermann) Date: Fri, 18 Feb 2022 09:09:55 +0000 Subject: [TYPES/announce] 1st Call for Participation: 15th Summer School on Modelling and Verification of Parallel Processes (MOVEP2022) Message-ID: <7EB993CB-E106-40E5-987A-23046BD49252@cs.aau.dk> 1st Call for Participation: 15th Summer School on Modelling and Verification of Parallel Processes (MOVEP2022) WHERE? Aalborg University, Aalborg, Denmark WHEN? June 13 - 17, 2022 WEBSITE: https://urldefense.com/v3/__https://movep2022.cs.aau.dk/__;!!IBzWLUs!EsASF06mhsWxfJDtCPl76RLXHUWgosyrNHNsWlTA272kwHksmiR7ZD5PUciLnv6CJzK13wJClE1sCw$ == MOVEP is a five-day summer school on modelling and verification of infinite state systems. It aims to bring together researchers and students working in the fields of control and verification of concurrent and reactive systems. MOVEP 2022 will consist of ten invited tutorials. In addition, there will be special sessions that allow PhD students to present their on-going research (each talk will last around 20 minutes). Extended abstracts (1-2 pages) of these presentations will be published in informal proceedings. The organisation committee is closely monitoring the COVID situation. Currently, we are planning for an in-person school in Aalborg with the possibility for remote participation for those that cannot attend in person. Should it become necessary, the school will be held virtually. == Speakers == * Giovanni Bacci (Aalborg University, Denmark): From Bisimulations to Metrics via Couplings * David Baelde (ENS Rennes & IRISA): Formal Proofs of Cryptographic Protocols with Squirrel * Christel Baier (Technische Universit?t Dresden, Germany): From Verification to Causality-based Explications * Wojciech Czerwi?ski (University of Warsaw, Poland): The Reachability Problem for Vector Addition Systems * Bartek Klin (Oxford University, United Kingdom): Computation Theory over Sets with Atoms * Laura Kovacs (Vienna University of Technology, Austria): First-Order Theorem Proving and Vampire * Anca Muscholl (LaBRI & Universit? Bordeaux, France): A View on String Transducers * Nir Piterman (Chalmers University of Technology, Sweden): Reactive Synthesis * Amaury Pouly (IRIF, France): Linear Dynamical Systems: Reachability and Invariant Generation * Renaud Vilmart (LMF & Inria): How to Verify Quantum Processes == Student Session == We encourage participants to present their (ongoing or published) work. Talks will last around 20 minutes. 1-2 page abstracts (no particular format is required) should be submitted via easychair: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=movep2022__;!!IBzWLUs!EsASF06mhsWxfJDtCPl76RLXHUWgosyrNHNsWlTA272kwHksmiR7ZD5PUciLnv6CJzK13wKQmJgpiA$ Important Dates Abstract submission: May 1st, 2022 Notification of acceptance: May 14, 2022 == Fees and Registration == The fees include coffee and lunch breaks as well as the conference dinner. Early-bird 350 Euro (before May 1st, 2022) Late 400 Euro https://urldefense.com/v3/__https://movep2022.cs.aau.dk/registration.html__;!!IBzWLUs!EsASF06mhsWxfJDtCPl76RLXHUWgosyrNHNsWlTA272kwHksmiR7ZD5PUciLnv6CJzK13wIOFYpJGw$ == Committees == Organising committee * Peter G. Jensen (Aalborg University, Denmark) * Florian Lorber (Aalborg University, Denmark) * Martin Zimmermann (chair, Aalborg University, Denmark) Program committee * Saddek Bensalem (Universirsit? Grenoble Alpes, France) * Patricia Bouyer-DeCitre (LMF, CNRS & ENS Paris-Saclay, France) * Emmanuel Filiot (Universit? libre de Bruxelles, Belgium) * Dana Fisman (Ben-Gurion University, Israel) * Radu Grosu (Vienna University of Technology, Austria) * Holger Hermanns (Saarland University, Germany) * Nils Jansen (Radboud University Nijmegen, Netherlands) * Marcin Jurdzinski (University of Warwick, United Kingdom) * Steve Kremer (Inria Nancy - Grand Est, France) * K Narayan Kumar (Chennai Mathematical Institute, India) * Denis Kuperberg (ENS Lyon, France) * Anca Muscholl (LaBRI & Universit? Bordeaux, France) * Paritosh K. Pandya (IIT Bombay, India) * Gabrielle Puppis (Udine University, Italy) * Nir Piterman (Chalmers University of Technology, Sweden) * Kristin Rozier (Iowa State University, United States) * C?sar S?nchez (IMDEA Software Institute, Spain) * Szymon Torunczyk (University of Warsaw, Poland) * Martin Zimmermann (chair, Aalborg University, Denmark) Steering committee * Nathalie Bertrand (INRIA Rennes, France) * Benedikt Bollig (LMF, CNRS & ENS Paris-Saclay, France) * Radu Iosif (CNRS & Verimag, France) * Didier Lime (Ecole centrale de Nantes, France) * Christof L?ding (RWTH Aachen University, Germany) * Nicolas Markey (CNRS & INRIA & Univ. Rennes 1, France) -------------- next part -------------- An HTML attachment was scrubbed... URL: From bogom.s at gmail.com Wed Feb 16 07:27:45 2022 From: bogom.s at gmail.com (Sergiy Bogomolov) Date: Wed, 16 Feb 2022 12:27:45 +0000 Subject: [TYPES/announce] Two Lecturer / Senior Lecturer posts in Formal Methods at Newcastle University Message-ID: The School of Computing here at Newcastle University is growing. We are advertising *five* faculty positions at Lecturer / Senior Lecturer levels (deadline on 27 February 2022): https://urldefense.com/v3/__https://jobs.ncl.ac.uk/job/Newcastle-LecturerSenior-Lecturer-in-Computing-Science/767741201__;!!IBzWLUs!Bhec3MjX9Bs-tc0ijHDcHyj3kp97e8IELL6hg1jCKqzOxUZYwEEA2O91_CYl98oOa0b8jbQvOA9RMA$ Two of these are specifically in the area of *formal methods*. Please do not hesitate to reach out to me if you are interested in applying and would like to learn more about the School. Thanks, Sergiy From icfp.publicity at googlemail.com Mon Feb 21 01:09:18 2022 From: icfp.publicity at googlemail.com (ICFP Publicity) Date: Mon, 21 Feb 2022 14:09:18 +0800 Subject: [TYPES/announce] Call for Papers: PACMPL issue ICFP 2022 Message-ID: PACMPL Volume 6, Issue ICFP 2022 Call for Papers Accepted papers to be invited for presentation at The 27th ACM SIGPLAN International Conference on Functional Programming Ljubljana, Slovenia https://urldefense.com/v3/__http://icfp22.sigplan.org/__;!!IBzWLUs!Hno6BNTeOYXI2TtHLT0KmewBlK4HTBq3NH4nWmbAfQmE3WKsCkeexkP63DrA5ILTRf9SzNfv6Qch5A$ ### Important dates Submissions due: 2 March 2022 (Wednesday), Anywhere on Earth Author response: 2 May (Monday) - 5 May (Thursday) Notification: 21 May (Thursday) Submission of revised papers: 16 June (Thursday) Final copy due: 21 July (Thursday) Conference: 11 September (Sunday) - 16 September (Friday) [PACMPL](https://urldefense.com/v3/__https://pacmpl.acm.org/__;!!IBzWLUs!Hno6BNTeOYXI2TtHLT0KmewBlK4HTBq3NH4nWmbAfQmE3WKsCkeexkP63DrA5ILTRf9SzNcP7eE18w$ ) issue ICFP 2022 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 2022 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. ### 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. ### Preparation of submissions **Deadline**: The deadline for submissions is **Wednesday, March 2, 2022**, 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 *Monday, May 2, 2022*, 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 2022. 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 2022 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 21, 2022**. Authors of conditionally accepted papers will be provided with committee reviews along with a set of mandatory revisions. On June 16, 2022, 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 are that the mandatory revisions can be addressed within three 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 2022 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 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 papers 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, 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://urldefense.com/v3/__https://oaspa.org/why-cc-by/__;!!IBzWLUs!Hno6BNTeOYXI2TtHLT0KmewBlK4HTBq3NH4nWmbAfQmE3WKsCkeexkP63DrA5ILTRf9SzNdRvqikog$ ) published by OASPA, the Open Access Scholarly Publishers Association. The other options are copyright transfer to ACM or retaining copyright but granting ACM exclusive publication rights. * 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 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 describe the experience of using functional programming in practice, whether in industrial application, tool development, programming education, or any other area. 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 accepted Experience Report 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 understand the application 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 describes an illuminating experience with functional programming, or provide evidence for a clear thesis about the use of functional programming. The experience or thesis must be relevant to ICFP, but it need not be novel. The review committee will accept or reject Experience Reports based on whether they judge the paper to illuminate some aspect of the use of functional programming. 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 papers show how functional programming was used than from papers that only say that functional programming was used. The most convincing Experience Reports often include comparisons of situations before and after the introduction or discontinuation of functional programming. Experience 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 it should 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. 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 principal editor will be happy to advise on any concerns about which category to submit to. From info at tomasp.net Mon Feb 21 04:29:58 2022 From: info at tomasp.net (Tomas Petricek) Date: Mon, 21 Feb 2022 09:29:58 +0000 Subject: [TYPES/announce] CFP - Symposium on the History and Philosophy of Programming Message-ID: <01d401d82705$95e6f2d0$c1b4d870$@tomasp.net> Dear colleagues, I would like to invite you to submit abstracts to the Symposium on the History and Philosophy of Programming, taking place in Lille (and online) on 13 June. This is a fifth edition of the symposium and the past editions had many interesting submissions related to types, programming languages and formal systems! The submission deadline for a 2-page abstract is 18 March. Please see detailed call for papers below and feel free to reach out if you have any questions! Thanks, Tomas Petricek ======================== Second call for Abstracts ======================== *HaPoP 2022* /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!HnBWSRRzciB56IETGNUvAE4RJfe_OoCmr0yCfTbyXf3i0ceAXXYa9RnWrgfvm8V6S8h6CSeTAjcHPw$ 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!HnBWSRRzciB56IETGNUvAE4RJfe_OoCmr0yCfTbyXf3i0ceAXXYa9RnWrgfvm8V6S8h6CSdUYYbMxA$ ) 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 mailto:liesbeth.de-mol at univ-lille.fr or Tomas at mailto:tomas at tomasp.net. For quick questions, you can also use @tomaspetricek on Twitter. - Arnaud Bailly, Pankzsoft - 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!HnBWSRRzciB56IETGNUvAE4RJfe_OoCmr0yCfTbyXf3i0ceAXXYa9RnWrgfvm8V6S8h6CSeTAjcHPw$ 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!HnBWSRRzciB56IETGNUvAE4RJfe_OoCmr0yCfTbyXf3i0ceAXXYa9RnWrgfvm8V6S8h6CSfhPglPfw$ . 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!HnBWSRRzciB56IETGNUvAE4RJfe_OoCmr0yCfTbyXf3i0ceAXXYa9RnWrgfvm8V6S8h6CSfhPglPfw$ Financial support: Coming soon Registraton site: Coming soon SUPPORT The symposium is supported by: - ANR (https://urldefense.com/v3/__https://anr.fr/__;!!IBzWLUs!HnBWSRRzciB56IETGNUvAE4RJfe_OoCmr0yCfTbyXf3i0ceAXXYa9RnWrgfvm8V6S8h6CSfqqKYY1g$ ) - UMR 8162 Savoirs, Textes, Langage, Universit? de Lille (https://urldefense.com/v3/__https://stl.univ-lille.fr/__;!!IBzWLUs!HnBWSRRzciB56IETGNUvAE4RJfe_OoCmr0yCfTbyXf3i0ceAXXYa9RnWrgfvm8V6S8h6CSc8AK84jQ$ ) - HAPOC (https://urldefense.com/v3/__http://www.hapoc.org__;!!IBzWLUs!HnBWSRRzciB56IETGNUvAE4RJfe_OoCmr0yCfTbyXf3i0ceAXXYa9RnWrgfvm8V6S8h6CSdUYYbMxA$ ) From W.S.Swierstra at uu.nl Mon Feb 21 04:59:50 2022 From: W.S.Swierstra at uu.nl (Swierstra, W.S. (Wouter)) Date: Mon, 21 Feb 2022 09:59:50 +0000 Subject: [TYPES/announce] Six positions in Mathematics-Computer Science-Physics at Utrecht University Message-ID: We are currently advertising vacancies for 6 positions at the interfaces of Mathematics, Computing Science and Physics (0.8 - 1.0 FTE) ## Job description The Mathematical Institute, the Department of Information and Computing Sciences, and the Department of Physics currently offer 6 positions at the level of lecturer/researcher, assistant or associate professor. The main goal of these positions is to stimulate increased collaboration and cross-fertilization to further strengthen the ties between these fundamental disciplines. In both research and education, there are strong overlaps between the disciplines of mathematics, computer science, and physics: the use of mathematics in physics, the increasing role of artificial intelligence and machine learning techniques in both maths and physics, the development of quantum algorithms and quantum computing, data science and the computational complexity of many problems in all of the three disciplines, just to name a few examples. At an educational level, new generations of students strongly connect to such an interdisciplinary approach. We are looking for candidates who possess a proven commitment and talent for research, as well as a demonstrable motivation to teach. Working at the interface of two disciplines, you will closely collaborate with people from several departments. It goes without saying that you are a team player who easily connects with others and who is encouraged to take ownership. These are the different research areas in which the positions will be embedded: 1) Mathematics and Computer Science Within this area, topics to be addressed include operations research and combinatorial optimization, topological data analysis, and AI and logic. 2) Computer Science and Physics Within this area, topics to be addressed include green computing, quantum computing and quantum algorithms. 3) Physics and Mathematics Within this area, topics to be addressed include geometry and theoretical physics, and mathematics of climate science. So, if you are excited to actively participate and collaborate in this interdisciplinary project, we encourage you to apply! ## Qualifications We are looking for driven and enthusiastic new colleagues who fit well with the following qualifications. For candidates at the level of lecturer/researcher: * a PhD in computer science, information science, mathematics or physics; * the ability to teach in departmental Bachelor's and Master's programmes? * experience with and enthusiasm for teaching and student supervision? * the ability to speak and write English fluently. For candidates at assistant or associate professor level: * a PhD in computer science, information science, mathematics or physics; * publications with impact, in international conferences and journals; * a vision on future research directions for your interdisciplinary research area; * experience with and enthusiasm for teaching and using innovative teaching methods and technologies; * experience with, or readiness to supervise (PhD) students; * experience in the acquisition of research funding and the supervision of research projects; * a vision on teaching and your own contribution to teaching? * the ability to speak and write English fluently. ## Offer ### Lecturer/researcher positions * a full-time position for five years; * a full-time gross salary that ranges between ?2,846 and ?4,490 per month (scale 10 Collective Labour Agreement Dutch Universities). ### Assistant/Associate professor * dependent on your qualities, ambitions and current position, we can offer you a full-time position on a tenure track or a placement on a permanent position (which could be preceded by an 18 month temporary contract); * a full-time gross salary, depending on previous qualifications and work experience, that ranges between ?3,821 and ?7,079 per month (scale 11-14 Collective Labour Agreement Dutch Universities); * a special perk includes the possibility to hire a PhD candidate in order to start up your research. ### For both types of positions: * 8% holiday bonus and 8.3% end-of-year bonus; * a pension scheme, partially paid parental leave, and flexible employment conditions based on the Collective Labour Agreement Dutch Universities; * the possibility to travel to conferences. Please note that the levels of the positions offered will vary, depending on experience and expertise. In addition to the employment conditions laid down in the cao for Dutch Universities, Utrecht University has a number of its own arrangements. For example, there are agreements on professional development, leave arrangements, and sports. We also give you the opportunity to expand your terms of employment via the Employment Conditions Selection Model. This is how we like to encourage you to continue to grow. Utrecht is an attractive city located in the Netherlands, one of the world?s most open and connected countries. Utrecht University reflects this philosophy by offering a flexible work/life balance that prioritizes your well-being within an understanding and supportive, family-friendly environment. ## About the organisation The Department of Information and Computing Sciences is nationally and internationally renowned for its fundamental and applied research in computer science and information science. In our ever changing (digital) society, we are constantly looking for new, realistic ways to push the boundaries of both science and social application. We contribute to innovative information technologies through the development and application of new concepts, theories, algorithms, and software methods. Relevant areas of interdisciplinary research include Game Research, Foundations of Complex Systems, Applied Data Science, and Artificial Intelligence. The Mathematical Institute covers a broad range of active areas of research. We aim for a stimulating research environment with ample opportunity for interaction between different fields. This interaction is not restricted to areas within mathematics; contacts with physics, biology, and technological applications play an equally important role in several of our research activities. The Department of Physics hosts a unique group of scientists and supporting staff addressing problems in physics, from the smallest scales of elementary particles, via the 'human' scales of climate dynamics, to the largest scales of cosmology. The department has a long history of excellence in physics research and education. Today, we consist of about forty tenured staff who excel in research on topics such as string theory, cosmology, hard and soft condensed matter physics, high-energy physics, nanophotonics, and climate physics. About fifty graduate and over a hundred undergraduate students start each year in the broad Bachelor's programme and the four specialised Master's programmes. At the Faculty of Science, there are 6 departments to make a fundamental connection with: Biology, Chemistry, Information and Computing Sciences, Mathematics, Pharmaceutical Sciences, and Physics. Each of these is made up of distinct institutes that work together to focus on answering some of humanity?s most pressing problems. More fundamental still are the individual research groups ? the building blocks of our ambitious scientific projects. Utrecht University is a friendly and ambitious university at the heart of an ancient city. We love to welcome new scientists to our city ? a thriving cultural hub that is consistently rated as one of the world?s happiest cities. We are renowned for our innovative interdisciplinary research and our emphasis on inspirational research and excellent education. We are equally well-known for our familiar atmosphere and the can-do attitude of our people. This fundamental connection attracts researchers, professors and PhD candidates from all over the globe, making both the university and the Faculty of Science a vibrant international and wonderfully diverse community. Additional information Do you have any questions that you would like an answer to first? No problem. Please contact Professor Jason Frank (Mathematics) at j.e.frank at uu.nl, Professor Johan Jeuring (Information and Computing Sciences) at j.t.jeuring at uu.nl, or Professor Stefan Vandoren (Physics) at s.j.g.vandoren at uu.nl. Do you have a question about the application procedure? Then please send an email to science.recruitment at uu.nl ## Applying Everyone deserves to feel at home at our university. We welcome employees with a wide variety of backgrounds and perspectives and we attach great importance to diversity and gender balance. Applicants are encouraged to mention any personal circumstances that need to be taken into account, for example, parental leave or military service. If you prefer a part-time appointment, you are also invited to apply, stating the desired part-time ratio. Please note: Due to the current situation regarding the Coronavirus (COVID-19) the process of selection and interviews is subject to change. Initial interviews will most likely be conducted online. The application deadline is 14 March 2022. Please use the link below to submit your application: https://urldefense.com/v3/__https://www.uu.nl/en/organisation/working-at-utrecht-university/jobs/6-positions-at-the-interfaces-of-mathematics-computing-science-and-physics-08-10-fte__;!!IBzWLUs!Atj7v36I3Ew7vyVCTP6MrIzpw1oXo6BGm3LGLBEzpZ770yvVl4YwXf2aqL7-Tdba5_jllZUhGCNI_g$ From ralf.kuesters at sec.uni-stuttgart.de Mon Feb 21 05:30:56 2022 From: ralf.kuesters at sec.uni-stuttgart.de (Ralf Kuesters) Date: Mon, 21 Feb 2022 11:30:56 +0100 Subject: [TYPES/announce] Formal Verification: Postdoc and PhD Positions available at University of Stuttgart, Germany Message-ID: <42b747e0-19cc-2906-0b3e-7cd3f09962fd@sec.uni-stuttgart.de> 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!F2PawhcKY3kR7enu28OEfVwW0xf5ko3cZIagqxZA7s9qge48SQechQU_qZn8Ucj3pGbh2nyrT8xLvw$ ). 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 March 13th, 2022. Late applications will be considered until the positions are filled. See https://urldefense.com/v3/__https://sec.uni-stuttgart.de/__;!!IBzWLUs!F2PawhcKY3kR7enu28OEfVwW0xf5ko3cZIagqxZA7s9qge48SQechQU_qZn8Ucj3pGbh2nz6hITu2Q$ for more information about the institute. See https://urldefense.com/v3/__https://www.sec.uni-stuttgart.de/institute/job-openings/__;!!IBzWLUs!F2PawhcKY3kR7enu28OEfVwW0xf5ko3cZIagqxZA7s9qge48SQechQU_qZn8Ucj3pGbh2nzHGlMEJA$ 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!F2PawhcKY3kR7enu28OEfVwW0xf5ko3cZIagqxZA7s9qge48SQechQU_qZn8Ucj3pGbh2ny67YH4VA$ Phone: +49 (0) 711 685 88283 From Gethin.Norman at glasgow.ac.uk Mon Feb 21 06:18:10 2022 From: Gethin.Norman at glasgow.ac.uk (Gethin Norman) Date: Mon, 21 Feb 2022 11:18:10 +0000 Subject: [TYPES/announce] FORMATS'22: second call for papers Message-ID: <0E6C0F61-4448-41EC-A6A1-B04BBF00C2BA@glasgow.ac.uk> FORMATS 2022: SECOND 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!DJld8e95dfdTsVNYyRHOXFKyT2xQuqDI9rK_SR4U6xpyabrMJCfsFJnygYCpAXYHOMaDYRL9YGS2SA$ 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). In 2022, FORMATS celebrates its 20th anniversary and we plan to commemorate this with a special session at the conference. INVITED SPEAKERS FORMATS 2022 will feature two invited speakers: ? Thao Dang (CNRS & VERIMAG, Universit? Grenoble-Alpes) ? Jo?l Ouaknine (Max Planck Institute for Software 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!DJld8e95dfdTsVNYyRHOXFKyT2xQuqDI9rK_SR4U6xpyabrMJCfsFJnygYCpAXYHOMaDYRI6iUKGCg$ 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. For more details, see: https://urldefense.com/v3/__https://conferences.ncl.ac.uk/formats2022/artifactevaluation/__;!!IBzWLUs!DJld8e95dfdTsVNYyRHOXFKyT2xQuqDI9rK_SR4U6xpyabrMJCfsFJnygYCpAXYHOMaDYRKb6I1ESw$ 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 nicolai.kraus at gmail.com Mon Feb 21 06:41:02 2022 From: nicolai.kraus at gmail.com (Nicolai Kraus) Date: Mon, 21 Feb 2022 11:41:02 +0000 Subject: [TYPES/announce] 22nd Midlands Graduate School, 10-14 April 2022: Call for Participation Message-ID: CALL FOR PARTICIPATION 22nd Midlands Graduate School (MGS'22) in the Foundations of Computing Science 10-14 April 2022, Nottingham (UK) https://urldefense.com/v3/__https://www.cs.nott.ac.uk/*psznk/events/mgs22.html__;fg!!IBzWLUs!GSmdPP0Alv-mz_5on6dW8JJ99O3ZevWeLKOOUU3z5Fm_llnJ4L2UskvtB_vFV9oPjE19WG02Tve9dg$ OVERVIEW MGS is an annual spring school that offers an intensive programme of lectures on the mathematical foundations of computing. While the school addresses especially PhD students in their first or second year, it is also open to UG and MSc students, postdocs, participants from the industry, and generally everyone interested in its topics. MGS'22 is the school's 22nd incarnation. PROGRAMME MGS'22 offers eight courses: - our invited course by Andrej Bauer - three basic courses on category theory, proof theory, and HoTT/UF with agda, which require no previous experience - four advanced courses on topos theory, string diagrams, coalgebra, and graph transformations. REGISTRATION Participation at MGS'22 costs GBP 320. Please see the website https://urldefense.com/v3/__https://www.cs.nott.ac.uk/*psznk/events/mgs22.html__;fg!!IBzWLUs!GSmdPP0Alv-mz_5on6dW8JJ99O3ZevWeLKOOUU3z5Fm_llnJ4L2UskvtB_vFV9oPjE19WG02Tve9dg$ for details, point "Registration". The fee covers participation in all lectures and exercise classes, refreshments in coffee breaks, and a conference dinner. Please note that you have to book accommodation yourselves but there are rooms available on campus. Places are limited and will be allocated on a first-come-first-served basis. If you would like to participate, please register early to secure a place. The registration period closes as soon as all places are filled or on March 20, whichever is sooner. ORGANISATION Please direct all queries about MGS'22 to Thorsten Altenkirch and Nicolai Kraus, thorsten.altenkirch at nottingham.ac.uk nicolai.kraus at nottingham.ac.uk -------------- next part -------------- An HTML attachment was scrubbed... URL: From s.lasota at uw.edu.pl Mon Feb 21 07:44:28 2022 From: s.lasota at uw.edu.pl (=?UTF-8?Q?S=C5=82awomir_Lasota?=) Date: Mon, 21 Feb 2022 13:44:28 +0100 Subject: [TYPES/announce] CONCUR 2022: 2nd CFP Message-ID: CONCUR 2022: second call for papers ============================== September 13-16, 2022 at the University of Warsaw, Poland Website: https://urldefense.com/v3/__https://concur2022.mimuw.edu.pl/__;!!IBzWLUs!HJMHfwWgXSVqU2M1mn50KWh5KDzM4y67WDdl-S7yTclrrN717h117Cv6tiYgyk6NVy4rd-JYoM4uRw$ 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!HJMHfwWgXSVqU2M1mn50KWh5KDzM4y67WDdl-S7yTclrrN717h117Cv6tiYgyk6NVy4rd-JYoM4uRw$ 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!HJMHfwWgXSVqU2M1mn50KWh5KDzM4y67WDdl-S7yTclrrN717h117Cv6tiYgyk6NVy4rd-LSFB6uyQ$ 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 -------------- next part -------------- An HTML attachment was scrubbed... URL: From P.Achten at cs.ru.nl Mon Feb 21 09:06:52 2022 From: P.Achten at cs.ru.nl (Peter Achten) Date: Mon, 21 Feb 2022 15:06:52 +0100 Subject: [TYPES/announce] [TFP'22] final call for papers: Trends in Functional Programming 2022 (deadline March 7 2022) Message-ID: <6d363a8c-8dd1-3256-2aa7-c08302662638@cs.ru.nl> ================ TFP 2022 ================= ==???????? Final Call For Papers???????? == ==????????? registration opened????????? == =========================================== 23rd Symposium on Trends in Functional Programming 17-18 March, 2022 Online event https://urldefense.com/v3/__https://trendsfp.github.io/index.html__;!!IBzWLUs!DgNZ3EhwISPQQu17oGf-e1_3meQWiANiKjiiSXvWekCo5tXl_j9_rpLtvMk4fklnEF93pQlQ3Uxzmw$ Due the pandemic, we have had to make TFP virtual this year. As a result, we've decided to push back the deadlines and conference date by a few weeks. In particular, the pre-symposium deadline for submitting the first version of your paper is now just after the ICFP deadline. == Important Dates == Submission deadline for draft papers??????????????? Monday 7th March, 2022 Notification for draft submissions????????????????? Friday 11th March, 2022 Symposium dates???????????????????????????????????? Thursday 17th - Friday 18th March, 2022 Submission deadline for post-symposium reviewing??? Wednesday 6th April, 2022 Notification for post-symposium submissions???????? Friday 27th 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. == 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!DgNZ3EhwISPQQu17oGf-e1_3meQWiANiKjiiSXvWekCo5tXl_j9_rpLtvMk4fklnEF93pQku4B9B6w$ Authors of papers have the choice of having their contributions formally reviewed either before or after the Symposium. == Post-symposium formal review process == 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 == Guillaume Allais??????????????? University of St Andrews Jos? Manuel Calder?n Trilla???? Galois, Inc. Stephen Chang?????????????????? University of Massachusetts Boston Matthew Flatt?????????????????? University of Utah Jeremy Gibbons????????????????? University of Oxford Zhenjiang Hu??????????????????? Peking University Mauro Jaskelioff??????????????? CIFASIS / Universidad Nacional de Rosario Moa Johansson?????????????????? Chalmers University of Technology Shin-ya Katsumata?????????????? National Institute of Informatics Oleg Kiselyov?????????????????? Tohoku University Bas Lijnse????????????????????? Netherlands Defence Academy / Radboud University Nijmegen Kazutaka Matsuda??????????????? Tohoku University Nico Naus?????????????????????? Virginia Tech Christine Rizkallah???????????? University of New South Wales Alejandro Serrano?????????????? 47 Degrees Amir Shaikhha?????????????????? Ecole Polytechnique F?d?rale de Lausanne Aaron Stump???????????????????? University of Iowa Wouter Swierstra (Co-chair)???? Utrecht University Baltasar Tranc?n Y Widemann???? Semantics GmbH Nicolas Wu (Co-chair)?????????? Imperial College London Ningning Xie??????????????????? University of Hong Kong From eacsl.ls1 at cs.tu-dortmund.de Mon Feb 21 10:38:24 2022 From: eacsl.ls1 at cs.tu-dortmund.de (EACSL Mail-Account) Date: Mon, 21 Feb 2022 16:38:24 +0100 Subject: [TYPES/announce] ACKERMANN AWARD 2022: CALL FOR NOMINATIONS Message-ID: ACKERMANN AWARD 2022 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE CALL FOR NOMINATIONS Nominations are now invited for the 2022 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 2020 and 31 December 2021 are eligible for nomination for the award. The deadline for submission is 1 July 2022. Submission details follow below. Nominations can be submitted from 1 March 2022 and should be sent to the chair of the Jury, Thomas Schwentick, by e-mail: thomas.schwentick at tu-dortmund.de *** The Award The 2022 Ackermann award will be presented to the recipient(s) at CSL 2023, 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); * Maribel Fernandez (King?s College London); * Jean Goubault-Larrecq (ENS Paris-Saclay); * Delia Kesner (IRIF, U Paris); * Slawomir Lasota (U Warsaw); * 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; * James Worrell (U Oxford). *** 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 10 pages) of the thesis in ENGLISH (ps or pdf file); it is recommended to not squeeze as much material as possible into these (at most) 10 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 22 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 s.lasota at uw.edu.pl Mon Feb 21 12:46:33 2022 From: s.lasota at uw.edu.pl (=?UTF-8?Q?S=C5=82awomir_Lasota?=) Date: Mon, 21 Feb 2022 18:46:33 +0100 Subject: [TYPES/announce] postdoc position, University of Warsaw Message-ID: Postdoc position in automata theory, University of Warsaw ************************************************************************** - Application deadline: March 31, 2022 - Starting date: As soon as possible - Salary: 27.000 PLN per annum (very competitive in Poland) - Duration: one year, possible extension to another year - Project: "Data-enriched models of computation" funded by NCN - Principal investigator: Prof. S?awomir Lasota (https://urldefense.com/v3/__http://www.mimuw.edu.pl/*sl__;fg!!IBzWLUs!BtApIM-cXc3QIz-uFVhZyCjZ2BOhP7hAkMH_R2QVfeCgW11UeT8lSuTsD640A1V5VM0Mc321-Gz1Ew$ ) - Contact: sl at mimuw.edu.pl ************************************************************************** The project aims at advancing theoretical foundations at the borderline between automata theory, concurrency and verification. We promise, except for very competitive salary, a vibrant working atmosphere in the automata group at the University of Warsaw, and exciting and challenging research problems. The ideal candidate is expected to have: ? PhD degree or equivalent in computer science or math ? Solid background in formal methods and automata theory ? Significant publication record ? Strong motivation for research work in foundations of computer science ? Advanced skills in written and spoken English. To apply, please send your curriculum vitae to sl at mimuw.edu.pl. -------------- next part -------------- An HTML attachment was scrubbed... URL: From s.lasota at uw.edu.pl Mon Feb 21 12:47:30 2022 From: s.lasota at uw.edu.pl (=?UTF-8?Q?S=C5=82awomir_Lasota?=) Date: Mon, 21 Feb 2022 18:47:30 +0100 Subject: [TYPES/announce] PhD position, University of Warsaw Message-ID: PhD position in concurrency theory, University of Warsaw ************************************************************************** Fully-Funded 4-year Ph.D. position in automata theory Department of Mathematics, Informatics and Mechanics, University of Warsaw Project: "Frontiers of automatic analysis of concurrent systems" funded by NCN Principal investigator: Prof. S?awomir Lasota (https://urldefense.com/v3/__http://www.mimuw.edu.pl/*sl__;fg!!IBzWLUs!GLJkhlvh4of-oECqW9D3qenJPM0LZpSxW-R36qAtkltVcopJeR7gyE0mX0ECMYjH--NPA_4sVndI9g$ ) Contact: sl at mimuw.edu.pl Start: Oct 1, 2022 (or earlier) Application deadline: April 15, 2022 ************************************************************************** We offer a fully-funded PhD position within the NCN grant "Frontiers of automatic analysis of concurrent systems". The project aims at advancing theoretical foundations at the borderline between automata theory, concurrency and verification, but anticipates also development of prototype analysis tools. A successful candidate is expected to enroll into the PhD program in the University of Warsaw. We offer: ? very competitive salary ? vibrant working atmosphere in the automata group at Warsaw ? exciting and challenging research problems ? scientific collaborations worldwide. The successful candidate is expected to have: ? Master?s degree or equivalent in computer science or math ? solid background in formal methods and automata theory ? strong motivation for research work in foundations of computer science ? advanced skills in written and spoken English. -------------- next part -------------- An HTML attachment was scrubbed... URL: From andrei at chalmers.se Mon Feb 21 08:24:29 2022 From: andrei at chalmers.se (Andrei Sabelfeld) Date: Mon, 21 Feb 2022 13:24:29 +0000 Subject: [TYPES/announce] PhD and postdoc positions in security and privacy at Chalmers University of Technology Message-ID: <8E74554A-7A08-4009-8F8A-AE437C889CE9@chalmers.se> Chalmers University of Technology invites applications for PhD and postdoc positions in security and privacy. The PhD students and postdoc will join a high-profile group of researchers on security and privacy, the Chalmers Security Lab https://urldefense.com/v3/__https://www.cse.chalmers.se/research/group/security/__;!!IBzWLUs!GWrdd6F0s4koNsnAimDShJvSjlO0Gf6kzwfbqDml0c4AEYU6LpFzw_bEmkXyqtP5iKpYebPoGCPaNw$ Software is often the root cause of vulnerabilities in modern computing systems. By focusing on securing the software, we target principled security mechanisms that provide robust protection against large classes of attacks. Typed-based approaches to application security are of our particular interest. The PhD students and postdoc will join one of our ambitious projects: -WebSec: Securing Web-driven Systems https://urldefense.com/v3/__https://www.cse.chalmers.se/research/group/security/websec/__;!!IBzWLUs!GWrdd6F0s4koNsnAimDShJvSjlO0Gf6kzwfbqDml0c4AEYU6LpFzw_bEmkXyqtP5iKpYebNtA2x_8A$ conducted jointly with Uppsala University, and funded by the Swedish Foundation for Strategic Research (SSF). Promotional video of Chalmers research on securing web applications https://urldefense.com/v3/__http://vimeo.com/82206652__;!!IBzWLUs!GWrdd6F0s4koNsnAimDShJvSjlO0Gf6kzwfbqDml0c4AEYU6LpFzw_bEmkXyqtP5iKpYebOBZNUYnQ$ -WASP NEST CyberSecIT, a framework project conducted jointly with KTH and Ume? University to explore the security and privacy of IoT applications, with the emphasis on software. NESTs are flagship projects of the Wallenberg AI, Autonomous Systems and Software Program (WASP https://urldefense.com/v3/__https://wasp-sweden.org/__;!!IBzWLUs!GWrdd6F0s4koNsnAimDShJvSjlO0Gf6kzwfbqDml0c4AEYU6LpFzw_bEmkXyqtP5iKpYebPQvqS7WQ$ ). The PhD student will thus enjoy the benefits of the WASP graduate school. -VR NewGen project with Uppsala University on applications of programming language-based, SMT solving, and symbolic execution techniques to discover vulnerabilities and secure software systems by construction. The PhD students and postdoc in systems and languages for security and privacy will be supervised by Prof. Andrei Sabelfeld https://urldefense.com/v3/__https://www.cse.chalmers.se/*andrei/__;fg!!IBzWLUs!GWrdd6F0s4koNsnAimDShJvSjlO0Gf6kzwfbqDml0c4AEYU6LpFzw_bEmkXyqtP5iKpYebOCT6_FYA$ (recipient of a number of awards by ERC, SSF, Google, and Facebook as well as the Chalmers PhD Supervisor of the Year award). The PhD student in usable privacy and security will be supervised by Prof. Simone Fischer-H?bner https://urldefense.com/v3/__https://simone.hotell.kau.se/__;!!IBzWLUs!GWrdd6F0s4koNsnAimDShJvSjlO0Gf6kzwfbqDml0c4AEYU6LpFzw_bEmkXyqtP5iKpYebN2yvc9Lw$ (recipient of a number of awards by EU H2020, SSF, Google), Professor at Karlstad University and Affiliated Professor at Chalmers. The PhD student positions are limited to five years and normally include 20 per cent departmental work, mostly teaching duties. Salary for the position is as specified in Chalmers' general agreement for PhD student positions, currently starting from 31,000 SEK per month before taxes. This postdoc position is a full-time temporary employment for two years, with a possibility of a one-year extension. Salary for the position is in line with Chalmers' general agreement for postdoc positions, around 40,000 SEK per month before taxes. The Department of Computer Science and Engineering https://urldefense.com/v3/__https://www.chalmers.se/en/departments/cse/Pages/default.aspx__;!!IBzWLUs!GWrdd6F0s4koNsnAimDShJvSjlO0Gf6kzwfbqDml0c4AEYU6LpFzw_bEmkXyqtP5iKpYebNt1K3jHQ$ is a joint department at Chalmers University of Technology and the University of Gothenburg, with activities on two campuses in the city of Gothenburg. The department has around 270 employees from over 30 countries. Our research has a wide span, from theoretical foundations to applied systems development. We provide high-quality education at Bachelor's, Master's, and graduate levels, offering over 120 courses each year. We also have extensive national and international collaborations with academia, industry and society. Chalmers offers a cultivating and inspiring working environment in the coastal city of Gothenburg https://urldefense.com/v3/__https://www.goteborg.com/en/__;!!IBzWLUs!GWrdd6F0s4koNsnAimDShJvSjlO0Gf6kzwfbqDml0c4AEYU6LpFzw_bEmkXyqtP5iKpYebOHTc8lTA$ . Read more about working at Chalmers https://urldefense.com/v3/__https://www.chalmers.se/en/about-chalmers/Working-at-Chalmers/Pages/default.aspx__;!!IBzWLUs!GWrdd6F0s4koNsnAimDShJvSjlO0Gf6kzwfbqDml0c4AEYU6LpFzw_bEmkXyqtP5iKpYebOIQ32oMg$ and our benefits https://urldefense.com/v3/__https://www.chalmers.se/en/about-chalmers/Working-at-Chalmers/Benefits/Pages/default.aspx__;!!IBzWLUs!GWrdd6F0s4koNsnAimDShJvSjlO0Gf6kzwfbqDml0c4AEYU6LpFzw_bEmkXyqtP5iKpYebO0gqDuJQ$ for employees. Chalmers aims to actively improve our gender balance. We work broadly with equality projects, for example the GENIE Initiative on gender equality for excellence. Equality and diversity are substantial foundations in all activities at Chalmers. Application deadline: 1 May 2022. For details, including employment conditions and how to apply, see: 2 PhD student positions in systems and languages for cybersecurity and privacy: https://urldefense.com/v3/__https://www.chalmers.se/en/about-chalmers/Working-at-Chalmers/Vacancies/Pages/default.aspx?rmpage=job&rmjob=10252&rmlang=UK__;!!IBzWLUs!GWrdd6F0s4koNsnAimDShJvSjlO0Gf6kzwfbqDml0c4AEYU6LpFzw_bEmkXyqtP5iKpYebOJSmHFLw$ PhD student position in usable privacy and security: https://urldefense.com/v3/__https://www.chalmers.se/en/about-chalmers/Working-at-Chalmers/Vacancies/Pages/default.aspx?rmpage=job&rmjob=10251&rmlang=UK__;!!IBzWLUs!GWrdd6F0s4koNsnAimDShJvSjlO0Gf6kzwfbqDml0c4AEYU6LpFzw_bEmkXyqtP5iKpYebOWgw7yTg$ Postdoc in systems and languages for cybersecurity and privacy: https://urldefense.com/v3/__https://www.chalmers.se/en/about-chalmers/Working-at-Chalmers/Vacancies/Pages/default.aspx?rmpage=job&rmjob=10253&rmlang=UK__;!!IBzWLUs!GWrdd6F0s4koNsnAimDShJvSjlO0Gf6kzwfbqDml0c4AEYU6LpFzw_bEmkXyqtP5iKpYebPdSNUPFA$ From s.lasota at uw.edu.pl Tue Feb 22 03:27:43 2022 From: s.lasota at uw.edu.pl (=?UTF-8?Q?S=C5=82awomir_Lasota?=) Date: Tue, 22 Feb 2022 09:27:43 +0100 Subject: [TYPES/announce] postdoc position, University of Warsaw Message-ID: [ erratum: mistaken salary amount corrected ] Postdoc position in automata theory, University of Warsaw ************************************************************************** - Application deadline: March 31, 2022 - Starting date: As soon as possible - Salary: 27.000 EUR per annum (very competitive in Poland) - Duration: one year, possible extension to another year - Project: "Data-enriched models of computation" funded by NCN - Principal investigator: Prof. S?awomir Lasota (https://urldefense.com/v3/__http://www.mimuw.edu.pl/*sl__;fg!!IBzWLUs!EHBRhAjeYEDUNQwhE6Oizf3ysQHhCfrM64bEGeqiw5AEo4uvAQEo_0JzR29C8gnYnG9kBakO3hXXeA$ ) - Contact: sl at mimuw.edu.pl ************************************************************************** The project aims at advancing theoretical foundations at the borderline between automata theory, concurrency and verification. We promise, except for very competitive salary, a vibrant working atmosphere in the automata group at the University of Warsaw, and exciting and challenging research problems. The ideal candidate is expected to have: ? PhD degree or equivalent in computer science or math ? Solid background in formal methods and automata theory ? Significant publication record ? Strong motivation for research work in foundations of computer science ? Advanced skills in written and spoken English. To apply, please send your curriculum vitae to sl at mimuw.edu.pl. -------------- next part -------------- An HTML attachment was scrubbed... URL: From qest.publicity at gmail.com Tue Feb 22 06:01:31 2022 From: qest.publicity at gmail.com (QEST Publicity) Date: Tue, 22 Feb 2022 11:01:31 -0000 Subject: [TYPES/announce] QEST 2022: Second Call for Papers Message-ID: <20220222110132.A606660AD0@anxur.fi.muni.cz> An HTML attachment was scrubbed... URL: From goubault at lix.polytechnique.fr Wed Feb 23 05:00:16 2022 From: goubault at lix.polytechnique.fr (Eric Goubault) Date: Wed, 23 Feb 2022 11:00:16 +0100 Subject: [TYPES/announce] Call for contributions - 11th Conference on Geometric and Topological Methods in Computer Science Message-ID: <783AFC44-6B50-444A-969F-CCDC7E889202@lix.polytechnique.fr> GETCO 2022 ? 11th International Conference on Geometric and Topological Methods in Computer Science GETCO 2022 will take place in Paris from May 30th to June 3rd 2022, see https://urldefense.com/v3/__https://www.lix.polytechnique.fr/*smimram/getco22/__;fg!!IBzWLUs!AVXR4UyrkrG0u27S-BQp_9JW2gGQKPvXXvD7PGtO29b2GhKtHQt-b4WoxEmnoSMij_bS3zsj4cBG0w$ 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 Participation The conference is hybrid. Onsite participation is encouraged, but an option for online participation will be provided. Registration is free but mandatory on the dedicated form . Submissions The conference will feature contributed talks. Important dates are submission: 31 March 2022 notification: 15 April 2022 The submissions should consist in free-form abstracts (longer submissions are also accepted) and be uploaded on the dedicated easychair page . There is no imposed format. Venue The conference will take place at EPITA School of Engineering and Computer Science located 14-16 rue Voltaire 94270 Le Kremlin-Bic?tre (just at the south border of Paris) Publication A special issue of a journal will be dedicated to selected papers from the conference. Organization 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 ariesco at fdi.ucm.es Wed Feb 23 06:11:49 2022 From: ariesco at fdi.ucm.es (ADRIAN RIESCO RODRIGUEZ) Date: Wed, 23 Feb 2022 12:11:49 +0100 Subject: [TYPES/announce] [ICFEM 2022] Call for Workshops and tutorials Message-ID: 23rd International Conference on Formal Engineering Methods - ICFEM 2022 October 24-27, 2022 Madrid, Spain https://urldefense.com/v3/__http://maude.ucm.es/ICFEM22/__;!!IBzWLUs!DrgKWZshy1lWk1RzisBd3a7l8cyiHUpQWUmEqBsywWYMDfa9mfDSswyfeT0kDlhxHFmRO-qsD949GQ$ CALL FOR WORKSHOPS AND TUTORIALS Workshops and tutorials will take place before the main conference, on October 24, 2022. SUBMISSION OF WORKSHOP AND TUTORIAL PROPOSALS Researchers and practitioners are invited to submit proposals for workshops and tutorials on topics in the field of computer science, related to Formal Engineering Methods in the broad sense. 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/tutorials (if relevant). 2) An organisational part including: - contact information for the workshop/tutorial organizers; - estimate of the number of workshop/tutorial participants; - 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 ICFEM); - procedures for selecting papers and participants; - plans for dissemination, if any (e.g. a journal special issue); - duration (which may vary from half a day to one day); - virtual/hybrid backup plans (including platform preference). The ICFEM Organizing Committee will determine the final list of accepted workshop/tutorial based on the scientific interest for ICFEM participants, as well on the availability of space and facilities. Proposals should be submitted via email to ariesco at ucm.es and zhangmin at sei.ecnu.edu.cn before March, 20. -------------- next part -------------- An HTML attachment was scrubbed... URL: From noam.zeilberger at gmail.com Wed Feb 23 13:16:02 2022 From: noam.zeilberger at gmail.com (Noam Zeilberger) Date: Wed, 23 Feb 2022 19:16:02 +0100 Subject: [TYPES/announce] Two postdoc positions at LIS (Aix-Marseille University) and LIX (Ecole Polytechnique) In-Reply-To: References: Message-ID: Announcement for two 11-15-month postdoctoral positions funded by the ANR LambdaComb. Project summary : LambdaComb is an interdisciplinary project financed by the French Agence Nationale de la Recherche. Broadly, the project aims to deepen connections between lambda calculus and logic on the one hand and combinatorics on the other. One important motivation for the project is the discovery over recent years of a host of surprising links between subsystems of lambda calculus and enumeration of graphs on surfaces, or "maps", the latter being an active subfield of combinatorics with roots in W. T. Tutte's work in the 1960s. More informations can be found on the project webpage: https://urldefense.com/v3/__https://www.lix.polytechnique.fr/LambdaComb/__;!!IBzWLUs!G3M763_fgbA1TWWijp2NjbeZtcZGX2ylpqMKkEqnWMnowr9TCsamDj5N152AxfulX3LLyaQ6SImy4A$ We seek candidates holding or soon to receive a PhD in Computer Science or Mathematics and with expertise in one or several of the following areas: - Category theory (with a focus on monoidal closed categories and multicategories) - Combinatorics - Logic and lattice theory - Proof theory, types, and Curry-Howard correspondence The ideal candidate will have a strong background in one of the areas and at least an interest in the others. We aim to recruit two postdocs who will be employed respectively at: * LIS research laboratory (https://urldefense.com/v3/__https://www.lis-lab.fr/__;!!IBzWLUs!G3M763_fgbA1TWWijp2NjbeZtcZGX2ylpqMKkEqnWMnowr9TCsamDj5N152AxfulX3LLyaTO2eZpsQ$ ) in Marseille, France, working under the mentorship of Luigi Santocanale * LIX laboratory (https://urldefense.com/v3/__https://www.lix.polytechnique.fr/__;!!IBzWLUs!G3M763_fgbA1TWWijp2NjbeZtcZGX2ylpqMKkEqnWMnowr9TCsamDj5N152AxfulX3LLyaSm1SO5kw$ ) in Palaiseau, France (south of Paris), working under the mentorship of Noam Zeilberger Both postdocs will have opportunities for visiting other partner institutions and for collaborating with other members of the project (see full list at the project page linked above). Application process: - Deadline for applications is March 27, 2022, for a starting date in September 2022 (or sooner, negotiable). - Candidates can send their application to Luigi Santocanale (luigi.santocanale at lis-lab.fr) and/or Noam Zeilberger (noam.zeilberger at lix.polytechnique.fr) with a subject containing ?[LambdaComb 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 and precise length of the contract will depend on the successful candidate's prior research experience, with a guaranteed minimum of 2466 EUR/month gross salary for the LIS postdoc and of 2520 EUR/month gross salary for the LIX postdoc. - The selection process will be achieved in collaboration with other project coordinators. Further enquiries about the position may be addressed to Luigi Santocanale (luigi.santocanale at lis-lab.fr) or Noam Zeilberger (noam.zeilberger at lix.polytechnique.fr). From fredrik.nordvall-forsberg at strath.ac.uk Wed Feb 23 13:53:52 2022 From: fredrik.nordvall-forsberg at strath.ac.uk (Fredrik Nordvall Forsberg) Date: Wed, 23 Feb 2022 18:53:52 +0000 Subject: [TYPES/announce] Applied Category Theory 2022: First Call for Papers Message-ID: <24447816-6fdf-0fda-6022-4f63abe6412d@strath.ac.uk> 5th Annual International Conference on Applied Category Theory (ACT2022) July 18--22, 2022 https://urldefense.com/v3/__https://msp.cis.strath.ac.uk/act2022/__;!!IBzWLUs!GOBc0nMH_L3ZwFiCsHBb87-5etWVhzOwH14kzSBNtBVjO0m5X5q8vcPdrfaievjj30GBpq-BralwMA$ The Fifth International Conference on Applied Category Theory will take place at the University of Strathclyde from 18 to 22 July 2022, preceded by the Adjoint School 2022 from 11 to 15 July. This conference follows previous events at Cambridge (UK), Cambridge (MA), Oxford and Leiden. Applied category theory is important to a growing community of researchers who study computer science, logic, type theory, engineering, physics, biology, chemistry, social science, linguistics and other subjects using category-theoretic tools. 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, strengthen the applied category theory community, disseminate the latest results, and facilitate further development of the field. SUBMISSIONS We accept submissions in English of original research papers, talks about work accepted/submitted/published elsewhere, and demonstrations of relevant software. Accepted original research papers will be published in a proceedings volume. The keynote addresses will be chosen from the accepted papers. The conference will include an industry showcase event and community meeting. We particularly encourage people from underrepresented groups to submit their work and the organizers are committed to non-discrimination, equity, and inclusion. Submission formats: 1. Extended Abstracts should be submitted describing the contribution and providing a basis for determining the topics and quality of the anticipated presentation (1-2 pages). These submissions will be adjudicated for inclusion as a talk at the conference. Such work should include references to any longer papers, preprints, or manuscripts providing additional details. 2. Conference Papers should present original, high-quality work in the style of a computer science conference paper (up to 14 pages, not counting the bibliography; detailed proofs may be included in an appendix for the convenience of the reviewers). Such submissions should not be an abridged version of an existing journal article (see item 1) although pre-submission Arxiv preprints are permitted. These submissions will be adjudicated for both a talk and publication in the conference proceedings. 3. Software Demonstrations should be submitted in the format of an Extended Abstract (1-2 pages) giving the program committee enough information to assess the content of the demonstration. We are particularly interested in software that makes category theory research easier, or uses category theoretic ideas to improve software in other domains. Extended abstracts and conference papers should be prepared with LaTeX. For conference papers please use the EPTCS style files available at https://urldefense.com/v3/__http://style.eptcs.org/__;!!IBzWLUs!GOBc0nMH_L3ZwFiCsHBb87-5etWVhzOwH14kzSBNtBVjO0m5X5q8vcPdrfaievjj30GBpq9Oajv7Bw$ . The submission link is https://urldefense.com/v3/__https://easychair.org/conferences/?conf=act2022__;!!IBzWLUs!GOBc0nMH_L3ZwFiCsHBb87-5etWVhzOwH14kzSBNtBVjO0m5X5q8vcPdrfaievjj30GBpq9LA8RBnA$ . IMPORTANT DATES The following dates are all in 2022, and Anywhere On Earth. - Submission Deadline: Monday 9 May - Author Notification: Tuesday 7 June - Camera-ready version due: Tuesday 28 June - Adjoint School: Monday 11 to Friday 15 July - Main Conference: Monday 18 to Friday 22 July CONFERENCE FORMAT We hope to run the conference as a hybrid event with talks recorded or streamed for remote participation. However, due to the state of the pandemic, the possibility of in-person attendance is not yet confirmed. Please be mindful of changing conditions when booking travel or hotel accommodations. FINANCIAL SUPPORT Limited financial support will be available. Please contact the organisers for more information. PROGRAM COMMITTEE Jade Master, University of Strathclyde (Co-Chair) Martha Lewis, University of Bristol (Co-Chair) The full program committee will be announced soon. ORGANISING COMMITTEE Jules Hedges, University of Strathclyde Jade Master, University of Strathclyde Fredrik Nordvall Forsberg, University of Strathclyde James Fairbanks, University of Florida STEERING COMMITTEE John Baez, University of California, Riverside Bob Coecke, Cambridge Quantum Dorette Pronk, Dalhousie University David Spivak, Topos Institute From tobias.wrigstad at it.uu.se Wed Feb 23 14:27:12 2022 From: tobias.wrigstad at it.uu.se (Tobias Wrigstad) Date: Wed, 23 Feb 2022 19:27:12 +0000 Subject: [TYPES/announce] Associate Professor Position in Software Engineering at Uppsala University Message-ID: <4B38BB4B-02D7-4D6C-867E-2D69DCE46AC6@it.uu.se> Closing date: 22 March 2022 Salary: Depending on experience, and level of employment (See public salary information: https://urldefense.com/v3/__https://www.saco.fackorg.uu.se/pay-salary/salary-statistics/__;!!IBzWLUs!GgPtSNrW-SESxyxj7JqYxZhpvC5lg0w3llKXVbjo8RQbRwzt0Ds4yHSWerq-yh7TfpZnD94iSSeUfw$ ? look at Senior lecturers or Professors at TekNat) Key Research Areas of interest: Software Engineering Full details: https://urldefense.com/v3/__https://uu.se/en/about-uu/join-us/details/?positionId=457604__;!!IBzWLUs!GgPtSNrW-SESxyxj7JqYxZhpvC5lg0w3llKXVbjo8RQbRwzt0Ds4yHSWerq-yh7TfpZnD95o4JhKUw$ Contact: Professor Joachim Parrow (joachim.parrow at it.uu.se) The Department of Information Technology within the Faculty of Science and Technology at Uppsala University, Sweden is seeking to make an appointment at Senior Lecturer/Associate Professor or Professor level (depending on experience) in Software Engineering with a focus on at least one of the following topics: search-based software engineering, machine learning with and for software engineering, program synthesis, software testing, program analysis, mining software repositories, software evolution and maintenance, human aspects of software engineering, software processes, software economics, ethics in software engineering, privacy and security by design. The appointee will be expected to take a leading role in teaching and research in Software Engineering within the division of Computing Science. The appointee will carry out internationally-leading research and take an active role in providing high quality and innovative teaching in the broad area of Software Engineering. Interest in developing connections between academia and industry, and integrating industry in teaching software engineering will be especially welcomed. (See full ad for details.) The Department of Information Technology has a leading position in research and education and currently employs more than 300 teachers and PhD students. More than 4000 students study one or more courses at the department each year. More info: https://urldefense.com/v3/__http://www.it.uu.se__;!!IBzWLUs!GgPtSNrW-SESxyxj7JqYxZhpvC5lg0w3llKXVbjo8RQbRwzt0Ds4yHSWerq-yh7TfpZnD96oIKq04g$ . The M?lardalen region in which Uppsala is located and the close-by Stockholm region are home to a wide range of software companies, both Swedish and international. The openness of Swedish universities (where researchers own their own research, not the universities) further promotes collaboration. Grant schemes for industrial mobility and funding for PhD students from industry are available yearly. The appointee will be employed at the division of computing science within the department. The division currently employs 5 full professors, 10 associate professors, and 2 assistant professors and a number of PhD students, organised in informal research groups pursuing a wide range of research interests including formal methods, formal semantics, concurrency theory, optimisation, programming languages, data science and databases. Other divisions at the department conduct research in computer systems (including verification, testing, embedded systems and computer architecture), scientific computing, modelling, analysis and control of dynamical systems, computerised image analysis, human-computer interaction and computer education research. Please get in touch directly if the position is of interest. About Working and Living in Sweden Sweden is a fantastic place for living and working. Swedes are friendly and speak excellent English. The quality of life is high, with a strong emphasis on outdoor activities. The Swedish working climate emphasises an open atmosphere, with active discussions involving both junior and senior staff. Spouses of employees are entitled to work permits. Healthcare is free after a small co-pay and the university subsidises athletic costs, such as a gym membership. The parental benefits in Sweden are among the best in the world, including extensive parental leave (for both parents), paid time off to care for sick children, and affordable daycare. For more information, be sure to read "Why choose Sweden?" (https://urldefense.com/v3/__https://www.uu.se/en/about-uu/join-us/advantages__;!!IBzWLUs!GgPtSNrW-SESxyxj7JqYxZhpvC5lg0w3llKXVbjo8RQbRwzt0Ds4yHSWerq-yh7TfpZnD95reFQQDA$ ) and "Why choose Uppsala University?" (https://urldefense.com/v3/__https://www.uu.se/en/about-uu/join-us/why-uppsala-university__;!!IBzWLUs!GgPtSNrW-SESxyxj7JqYxZhpvC5lg0w3llKXVbjo8RQbRwzt0Ds4yHSWerq-yh7TfpZnD96W_S6byg$ ). 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: https://urldefense.com/v3/__http://www.uu.se/om-uu/dataskydd-personuppgifter/__;!!IBzWLUs!GgPtSNrW-SESxyxj7JqYxZhpvC5lg0w3llKXVbjo8RQbRwzt0Ds4yHSWerq-yh7TfpZnD940nT5mEQ$ E-mailing Uppsala University means that we will process your personal data. For more information on how this is performed, please read here: https://urldefense.com/v3/__http://www.uu.se/en/about-uu/data-protection-policy__;!!IBzWLUs!GgPtSNrW-SESxyxj7JqYxZhpvC5lg0w3llKXVbjo8RQbRwzt0Ds4yHSWerq-yh7TfpZnD97K0Uo0_Q$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From giorgio.audrito at unito.it Fri Feb 25 04:05:45 2022 From: giorgio.audrito at unito.it (Giorgio Audrito) Date: Fri, 25 Feb 2022 10:05:45 +0100 Subject: [TYPES/announce] DisCoTec 2022 Call for Workshop Papers [deadline 7 apr+] Message-ID: ***************************************************************************** Joint Call for Workshops Papers 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!Ao_GzH3hdwMA9aDBbqgXZXJ0U5w3cdOdn7JY8DPdFgxteNLF3c5h7jYdkJfSDd-VVMKp9PW4R8d2pQ$ ***************************************************************************** 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 will take place on Monday, June 13, 2022, and post-conference workshops on Friday, June 17, 2022. ------------------------------------------------------------------------------------------ First Workshop on Collaborative Mining for Distributed Systems CoMinDs 2022 https://urldefense.com/v3/__https://www.discotec.org/2022/cominds__;!!IBzWLUs!Ao_GzH3hdwMA9aDBbqgXZXJ0U5w3cdOdn7JY8DPdFgxteNLF3c5h7jYdkJfSDd-VVMKp9PXIMROTKg$ CoMinDS workshop is about collaborative mining, i.e., process mining applied in the presence of heterogeneous data produced by the components of a distributed system, i.e., distributed event logs. The workshop welcomes open challenges, state-of-the-art, in-progress research, practical experiences, and case studies regarding the effective coordination and cooperation of distributed systems. The topics of CoMinDS include Construction of Distributed Event Logs, Discovery of Collaborative Models, Conformance Analysis for Collaborative Models, Multi-perspective Collaborative Mining, Privacy-preserving Collaborative Process Mining, Distributed Systems Monitoring and Repair, Collaborative Decision Mining, and Streaming Collaborative Mining. Paper submission deadline: April 7, 2022 Notification of accepted papers: May 20, 2022 Workshop: June 13, 2022 ------------------------------------------------------------------------------------------ 3th International Workshop on Foundations of Consensus and Distributed Ledgers FOCODILE 2022 https://urldefense.com/v3/__https://www.discotec.org/2022/focodile__;!!IBzWLUs!Ao_GzH3hdwMA9aDBbqgXZXJ0U5w3cdOdn7JY8DPdFgxteNLF3c5h7jYdkJfSDd-VVMKp9PWpWchP2Q$ FOCODILE is a forum to exchange ideas and recent research findings on theoretical foundations of consensus and blockchain technology. FOCODILE has no formal proceedings. Novel research works or already published papers are welcome (in the form of extended abstracts). Topics include, but are not limited to: Formal models of distributed consensus; Blockchain-specific cryptographic primitives and protocols; Formal verification of blockchain protocols and smart contracts; Byzantine fault tolerance and consensus; Design and analysis of distributed ledgers; Blockchain consensus mechanisms; Privacy and anonymity in cryptocurrencies; Game-theoretic approaches to blockchains; Post-quantum blockchain protocols; Performance and scalability of blockchain systems. Extended abstract submission deadline: April 30, 2022 Notification of accepted talks: May 20, 2022 Workshop: June 13, 2022 ------------------------------------------------------------------------------------------ 15th Interaction and Concurrency Experience ICE 2022 https://urldefense.com/v3/__https://www.discotec.org/2022/ice__;!!IBzWLUs!Ao_GzH3hdwMA9aDBbqgXZXJ0U5w3cdOdn7JY8DPdFgxteNLF3c5h7jYdkJfSDd-VVMKp9PWpFSHLxA$ ICE is a series of international scientific meetings oriented to theoretical computer science researchers with a special interest in models, verification, tools, and programming primitives for concurrent systems and complex interactions. 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. Papers and talks submission deadline: April 15, 2022 Notification of accepted papers and talks: May 23, 2022 Workshop: June 17, 2022 ------------------------------------------------------------------------------------------ First Workshop on Blockchain Technologies and Trusted Execution Environments BlockTEE 2022 https://urldefense.com/v3/__https://www.discotec.org/2022/blocktee__;!!IBzWLUs!Ao_GzH3hdwMA9aDBbqgXZXJ0U5w3cdOdn7JY8DPdFgxteNLF3c5h7jYdkJfSDd-VVMKp9PW_AUt1Ew$ Blockchains and TEE (trusted execution environments) are popular emerging technologies, enabling new or existing use cases to be deployed under stronger security and trust models. Blockchains and TEEs have been combined in the past to enhance the performance, security, and applicability for blockchains. In this workshop, we invite novel combinations of these two technologies. Some of the topics we are interested in include practical results that show how to combine these two technologies to operate under stricter security models, offering new performance results, new proof-of-* systems enabled by TEEs, improvements over state-of-the-art ledgers exploiting TEEs, mixed or hybrid TEE deployments for distributed ledgers, or novel partitioning techniques dealing with heterogeneous TEE setups for blockchains. Real-world results from large-scale deployments combining TEEs and blockchains are highly encouraged. Paper submission deadline: April 17, 2022 (AoE timezone) Notification of accepted papers: May 23, 2022 Workshop: June 17, 2022 ------------------------------------------------------------------------------------------ Robotics, Electronics and Machine Vision REMV 2022 https://urldefense.com/v3/__https://www.discotec.org/2022/remv__;!!IBzWLUs!Ao_GzH3hdwMA9aDBbqgXZXJ0U5w3cdOdn7JY8DPdFgxteNLF3c5h7jYdkJfSDd-VVMKp9PVGIhbqwQ$ REMV is aimed at discussing with the professional community the latest achievements in the field of robotic systems, intelligent electronics, the development of machine vision systems, the application of the achievements of robotics, electronics and machine vision in various aspects at all levels and in all contexts. The workshop can cover various topics, not limited to, including innovative research in the following areas: computer vision and robotics in agriculture; computer vision and robotics in sports and medicine; robots and production automation; unmanned vehicles and autonomous devices; fundamental problems of creating robotic systems; algorithms and tools for the development of computer vision systems and robotic systems; legal aspects of computer vision and robotics. Paper submission deadline: April 30, 2022 Notification of accepted papers: May 25, 2022 Workshop: June 17, 2022 ------------------------------------------------------------------------------------------ * COVID-19 pandemic * COVID-19: 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 pierre-marie.pedrot at inria.fr Fri Feb 25 10:08:37 2022 From: pierre-marie.pedrot at inria.fr (=?UTF-8?Q?Pierre-Marie_P=c3=a9drot?=) Date: Fri, 25 Feb 2022 16:08:37 +0100 Subject: [TYPES/announce] TYPES 2022 -- Last call for contributions Message-ID: <4c77aac2-436a-6451-e33a-28599953825f@inria.fr> LAST CALL FOR CONTRIBUTIONS 28th International Conference on Types for Proofs and Programs, TYPES 2022 and EuroProofNet Cost Action CA20111 meeting Nantes, France, 20-25 June 2022 https://types22.inria.fr 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; * 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; * formalizing mathematics using type theory. 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. The EuroProofNet Cost Action CA20111 focuses on the same research topics as TYPES and partially sponsors the TYPES Conference. INVITED SPEAKERS: Youyou Cong (Tokyo Institute of Technology) Ekaterina Komendantskaya (Heriot-Watt University) Sam Lindley (University of Edinburgh) Leonardo de Moura (Microsoft Research) CONTRIBUTED TALKS: We solicit contributed talks. Selection of those will be based on extended abstracts/short papers of 2 pp (not including bibliography) formatted with easychair.cls. The submission site is https://easychair.org/conferences/?conf=types2022 IMPORTANT DATES: * submission of 2 pp abstract: 9 March 2022 * notification of acceptance/rejection: 20 April 2022 * camera-ready version of abstract: 15 May 2022 Camera-ready versions of the accepted contributions will be published in an informal book of abstracts for distribution at the workshop. POST-PROCEEDINGS 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 submission deadline for the post-proceedings: September 2022. PROGRAM COMMITTEE Sandra Alves (University of Porto) Carlo Angiuli (Carnegie Mellon University) Stephanie Balzer (Carnegie Mellon University) Lars Birkedal (Aarhus University) Fr?d?ric Blanqui (INRIA) Sandrine Blazy (Universit? de Rennes 1 - IRISA) Thierry Coquand (University of Technology) Andrej Dudenhefner (Saarland University) Jacques Garrigue (Nagoya University) Delia Kesner (Universit? de Paris) (PC Co-Chair) Marina Lenisa (Universit? di Udine) Paul Blain Levy (University of Birmingham) Sara Negri (Universit? degli Studi di Genova) Pierre-Marie P?drot (INRIA) (PC Co-Chair) Luca Padovani (Universit? di Torino) Zoe Paraskevopoulou (Northeastern University) Brigitte Pientka (McGill University) Matija Pretnar (University of Ljubljana) Talia Ringer (University of Washington) Kathrin Stark (Princeton University) Pawe? Urzyczyn (University of Warsaw) Lionel Vaux (Universit? d?Aix-Marseille) Niki Vazou (IMDEA Software) TYPES STEERING COMMITTEE Andreas Abel (Gothenburg University) Sandra Alves (University of Porto) (Secretary) Henning Basold (Leiden University) (SC chair) Fr?d?ric Blanqui (INRIA) Ugo de'Liguoro (Universit? di Torino) Matthieu Sozeau (INRIA & Universit? de Nantes) 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. 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), Virtual (2021). CONTACT Email: types2022 at easychair.org Organisers: Assia Mahboubi (INRIA & Universit? de Nantes) Matthieu Sozeau (INRIA & Universit? de Nantes) Nicolas Tabareau (INRIA & Universit? de Nantes) -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_signature Type: application/pgp-signature Size: 840 bytes Desc: OpenPGP digital signature URL: From bahareh1812 at gmail.com Sun Feb 27 04:45:10 2022 From: bahareh1812 at gmail.com (Bahareh Afshari) Date: Sun, 27 Feb 2022 10:45:10 +0100 Subject: [TYPES/announce] PhD in Cyclic Proofs for Modal and Higher-order Logic - deadline extended Message-ID: <023A1BB5-7AB3-4761-AD71-541E793E2D3C@gmail.com> UPDATE: Deadline extended. Required documents updated. PHD POSITION CYCLIC PROOFS FOR MODAL AND HIGHER-ORDER LOGIC, AMSTERDAM (THE NETHERLANDS) * ILLC, University of Amsterdam * Duration: 4 years fully-funded, starting September 2022 * Deadline for applications: Extended to 7 March 2022 * The Institute for Logic, Language and Computation (ILLC) at the University of Amsterdam invites applications for a fully funded four-year PhD position on the project "Cyclic Proofs for Modal and Higher-order Logic", directed by Bahareh Afshari and Yde Venema. * For full details see https://urldefense.com/v3/__https://www.illc.uva.nl/NewsandEvents/News/Positions/newsitem/13350/PhD-in-Cyclic-Proofs-for-Modal-and-Higher-order-Logic__;!!IBzWLUs!CExOP6tMhNn1jzROTyfvqR7ZJJPwsPI9BtUIn6cZCerHFG4xYgSVjM0Umsa4jpGGLKphbPdpsZbgmQ$ Please note currently the application system is reporting the old deadline; this will be updated shortly. -------------- next part -------------- An HTML attachment was scrubbed... URL: From cmezzina at gmail.com Mon Feb 28 05:16:47 2022 From: cmezzina at gmail.com (Claudio Mezzina) Date: Mon, 28 Feb 2022 11:16:47 +0100 Subject: [TYPES/announce] EXPRESS/SOS 2022 first call for Papers Message-ID: =========================================== FIRST CALL FOR PAPERS Combined 29th International Workshop on Expressiveness in Concurrency and 19th Workshop on Structural Operational Semantics (EXPRESS/SOS 2022) https://urldefense.com/v3/__https://express-sos2022.github.io/__;!!IBzWLUs!HzXnGOnJwhrQ6vEyNMILFBxElMMYEroph4w-8OKipaaGw0YlRSSAwqTquCdxokwXDEe7YrJmX3uD3w$ Warsaw (Poland) September 12, 2022, Affiliated with CONCUR 2022 Submission deadline (full and short papers): Friday, July 1, 2022 =========================================== == INVITED SPEAKERS Silvia Crafa (University of Padova, Italy) Ross Horne (University of Luxembourg, Luxembourg) == 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 2022 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 (https://urldefense.com/v3/__http://www.eptcs.org__;!!IBzWLUs!HzXnGOnJwhrQ6vEyNMILFBxElMMYEroph4w-8OKipaaGw0YlRSSAwqTquCdxokwXDEe7YrL9SXB4EQ$ ). 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://urldefense.com/v3/__https://easychair.org/conferences/?conf=expresssos2022__;!!IBzWLUs!HzXnGOnJwhrQ6vEyNMILFBxElMMYEroph4w-8OKipaaGw0YlRSSAwqTquCdxokwXDEe7YrLh0aNnWg$ 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 for the workshop and give the talk. We are monitoring the COVID-19 pandemic to decide if the workshop will take place physically in Warsaw, online, or hybrid. Whatever the decision, we will guarantee the possibility of 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. We are planning a special issue with selected papers from EXPRESS/SOS 2021 and EXPRESS/SOS 2022. More information will follow closer to the event. == IMPORTANT DATES - Paper submission: July 1, 2022 - Notification date: August 5, 2022 - Camera ready version: August 19, 2022 - Workshop: September 12, 2022 == WORKSHOP CO-CHAIRS: Valentina Castiglioni (Reykjavik University, IS) Claudio Antares Mezzina (University of Urbino, IT) == PROGRAM COMMITTEE: Georgiana Caltais (University of Konstanz, Germany) Valentina Castiglioni (Reykjavik University, Iceland), co-chair Wan Fokkink (Vrije University Amsterdam, The Netherlands) Paola Giannini (University of Piemonte Orientale, Italy) Daniel Hirschkoff (ENS Lyon, France) Tobias Kappe (Cornell University, UK) Vasileios Koutavas (Trinity College Dublin, Ireland) Ondrej Lengal (Brno University of Technology, Czech Republic) Gerald Luettgen (University of Bamberg, Germany) Claudio Antares Mezzina (University of Urbino, Italy), co-chair Max Tschaikowski (Aalborg University, Denmark) == CONTACT Prospective authors are encouraged to contact the co-chairs in case of questions at express-sos22 at easychair.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From dcerna at cs.cas.cz Tue Mar 1 08:20:57 2022 From: dcerna at cs.cas.cz (David Cerna) Date: Tue, 1 Mar 2022 14:20:57 +0100 Subject: [TYPES/announce] UNIF 2022 CFP - 36TH International Workshop on Unification - deadline: May 5, 2022 Message-ID: ****************************************************************************** ??????? UNIF 2022: 36TH International Workshop on Unification ?????????????????? -- co-located with FLoC/IJCAR 2022? -- ???????????????????? August 12, 2022, Haifa, Israel ??????? Website: cs.cas.cz/unif-2022 ??????? Poster: https://urldefense.com/v3/__http://www.cs.cas.cz/unif-2022/Poster.pdf__;!!IBzWLUs!EH-EqRExaQxAVzRvjNdEoN5jp4vVckgWjpclrL7YTeIXwj3p3fCzASv_j4N4mdOXnaV0I7AhQq0Wbw$ ??????? Submission link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=unif2022__;!!IBzWLUs!EH-EqRExaQxAVzRvjNdEoN5jp4vVckgWjpclrL7YTeIXwj3p3fCzASv_j4N4mdOXnaV0I7AXTPvmJA$ ??????? Paper submission deadline: May 5, 2022 ??????? Topics: Unification, Anti-unification, Constraint solving ****************************************************************************** UNIF 2022 is associated with IJCAR 2022 part of the Federated Logic Conference 2022. UNIF 2022 is the 36th in a series of annual workshops on unification and related topics (https://urldefense.com/v3/__https://www.irif.fr/*treinen/unif/__;fg!!IBzWLUs!EH-EqRExaQxAVzRvjNdEoN5jp4vVckgWjpclrL7YTeIXwj3p3fCzASv_j4N4mdOXnaV0I7BtFQ9DUw$ ). Just as its predecessors', the purpose of UNIF 2022 is to bring together researchers interested in unification theory and its applications, as well as closely related topics, such as matching (i.e., one- sided unification), anti-unification (i.e., the dual problem to unification), disunification (i.e., solving equations and inequations) and the admissibility problem (which generalizes unification in modal logics). It is a forum for presenting recent (even unfinished) work, and discuss new ideas and trends in this and related fields. Unification is concerned with the problem of identifying given (first- or higher- order) terms, either syntactically or modulo a theory. It is a fundamental technique that is employed in various areas of Computer Science and Mathematics. In particular, unification algorithms are key components in completion of term rewriting systems, resolution-based theorem proving, and logic programming. But unification is, for example, also investigated in the context of natural language processing, program analysis, types, modal logics, and in knowledge representation. Submission Information --------------------- Following the tradition of UNIF, we call for submissions of extended abstracts (5 pages) in EasyChair style, to be submitted electronically as PDF through the EasyChair submission site: https://urldefense.com/v3/__https://easychair.org/my/conference?conf=unif2022__;!!IBzWLUs!EH-EqRExaQxAVzRvjNdEoN5jp4vVckgWjpclrL7YTeIXwj3p3fCzASv_j4N4mdOXnaV0I7C2uXXnZw$ Abstracts will be evaluated by the Program Committee (if necessary with support from external reviewers) regarding their significance for the workshop. We also allow submission of work presented/submitted in/to another conference. Accepted abstracts will be presented at the workshop and made available at the Web-page of UNIF 2022. Topics include, but are not limited to: -------------------------------------- Topics of interest of the workshop include, but are not limited to: ??? - Syntactic and equational unification algorithms ??? - Matching and constraint solving ??? - Unification in modal, temporal, and description logics ??? - Higher-order unification ??? - Narrowing ??? - Disunification ??? - Anti-unification ??? - As well as relevant investigations concerning: ??????? * Complexity ??????? * Combination methods ??????? * Implementation ??????? * Applications Chairs ------ * David M. Cerna (RISC JKU, CAS ICS) * Barbara Morawska (tba) Invited Speakers ---------------- * Philippe Balbiani (Institut de recherche en informatique de Toulouse) * Christopher Lynch (Clarkson University) Programme Committee ------------------- * Mauricio Ayala-Rinc?n (Universidade de Brasil?a) * Franz Baader (TU Dresden) * Daniel Dougherty (Worcester Polytechnic Institute) * Besik Dundua (Institute of Applied Mathematics, Tbilisi State University) * Serdar Erbatur (Ludwig Maximilian University of Munich) * Santiago Escobar (Universitat Polit?cnica de Val?ncia) * Maribel Fernandez (Universidade de Brasil?a) * Silvio Ghilardi (Dipartimento di Matematica, Universit? degli Studi di Milano) * Pascual Juli?n-Iranzo (University of Castilla-La Mancha) * Temur Kutsia (RISC, Johannes Kepler University Linz) * Jordi Levy (IIIA - CSIC) * Andrew M. Marshall (University of Mary Washington) * Daniele Nantes-Sobrinho (Universidade de Brasil?a) * Paliath Narendran (University at Albany, SUNY) * Christophe Ringeissen (INRIA) * David Sabel (Ludwig-Maximilians-University Munich) * Manfred Schmidt-Schauss (Goethe-University Frankfurt am Main) Publication ----------- Depending on the number and quality of submissions a special issue in AMAI or MSCS is envisioned. Venue ----- FLoC 2022 at Haifa, Israel Important dates --------------- * Paper submission: May 5, 2022 * Notification of acceptance: June 10, 2022 * Final version of accepted papers: June 18, 2022 * Registration deadline: June 30, 2022 * Workshop date: August 12, 2022 -------------- next part -------------- An HTML attachment was scrubbed... URL: From nclpltt at gmail.com Tue Mar 1 17:04:45 2022 From: nclpltt at gmail.com (Nicola Paoletti) Date: Tue, 1 Mar 2022 22:04:45 +0000 Subject: [TYPES/announce] HSCC 2022 Test-of-time-award (deadline 10 April) Message-ID: The HSCC 2022 organizers are soliciting nominations for the HSCC Test-of-Time Award to recognize the work published at a Hybrid Systems: Computation and Control (HSCC) conference in 2012 or before, which has proven to be the most visionary and impactful, leading to new directions of research being initiated, or new applications being brought into the hybrid systems research community. The award selection is through a committee of four internationally well-known and outstanding scientists who significantly contributed to the hybrid systems field and also to the HSCC organization. The decision to attribute the award and the choice of the awardee is at the sole discretion of the selection committee, which will carefully consider the nominated papers. See https://urldefense.com/v3/__https://hscc.acm.org/2022/hscc-test-of-time-award/__;!!IBzWLUs!Goh4UL9GhHoKzu9vNVWygnMYnMqnZal8QRcjU1v6Yru4GhzttZaKhFI2-SXF-qEFMAQvupqXL44YIA$ for details on eligibility and nomination rules. **Deadline for nominating papers for the award:** April 10, 2022 The selection committee for this year?s award is composed of the following distinguished members: * (Chair) Alessandro Abate, University of Oxford, UK * Rajeev Alur, University of Pennsylvania, USA * Thao Dang, Le Centre National de la Recherche Scientifique (CNRS), France * George Pappas, University of Pennsylvania, 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!Goh4UL9GhHoKzu9vNVWygnMYnMqnZal8QRcjU1v6Yru4GhzttZaKhFI2-SXF-qEFMAQvupp7xCQkOQ$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From nicolai.kraus at gmail.com Thu Mar 3 09:32:34 2022 From: nicolai.kraus at gmail.com (Nicolai Kraus) Date: Thu, 3 Mar 2022 14:32:34 +0000 Subject: [TYPES/announce] Postdoc and PhD position in homotopy type theory Message-ID: Dear all, I would like to invite applications for one postdoctoral position and one PhD position in homotopy type theory or related areas at the University of Nottingham, UK. Our group in Nottingham has three academics (Ulrik Buchholtz, Thorsten Altenkirch, myself) and multiple PhD students working in the field. We have regular seminars and discussions, which offer a great environment to learn and collaborate. (1) Postdoc position The starting date for the postdoc position is flexible and it will initially be for 15 months (i.e. 15 months are guaranteed, extensions are likely but will depend on the funder). The position comes without teaching obligations. The current call primarily addresses applicants who have experience in homotopy type theory, but if you are working in a related area and would be interested to switch to the field, please feel free to contact me. As postdoc (officially: "research fellow"), you will be employed by the University of Nottingham with all employment benefits (pension etc). Details on the position are available here: https://urldefense.com/v3/__https://www.nottingham.ac.uk/jobs/currentvacancies/ref/SCI022322__;!!IBzWLUs!E98pfCGRwjdJE0036KGMQXJM_mHz_KCgqN4SPuGXfwhgqgAlY7cY8_FUZqMTshgrN9_YoqdtxzRlJg$ The application deadline is the 3rd of April. For any questions or expressions of interest, feel free to contact me (see email address at the end of this message). (2) PhD position The PhD position is for four years, includes all tuition fees, and comes with a stipend at the UKRI standard (currently approx. ?15600 annually, increases with inflation). The stipend is free from tax or other deductions. You will not be obliged to teach but there will be opportunities to teach, paid on top of the stipend. I will consider applications until the position is filled. If you are interested, please contact me (see email below). Best wishes, Nicolai nicolai.kraus at nottingham.ac.uk or nicolai.kraus at gmail.com -------------- next part -------------- An HTML attachment was scrubbed... URL: From andrei.h.popescu at gmail.com Thu Mar 3 14:17:00 2022 From: andrei.h.popescu at gmail.com (Andrei Popescu) Date: Thu, 3 Mar 2022 19:17:00 +0000 Subject: [TYPES/announce] PhD Position in Number Theory and Formalization Message-ID: The Department of Mathematics of Vrije Universiteit Amsterdam welcomes applications for a fully-funded, 4-year PhD position in Number Theory and Formalization. The preferred starting date is in the period 1 May - 1 September 2022. The candidate will conduct research on Sander Dahmen's NWO-funded project "Formalizing Diophantine algorithms". This amounts to both developing and formalizing (with a proof assistant such as Lean or Coq) number theory necessary for solving Diophantine problems. The focus will be on effective/algorithmic number theory, but more "pure" results will (necessarily) also play an important role. We note that in this project most of the time will likely be spent on actual formalization work and that the proof assistant to be used will probably be Lean (but that is open for discussion). The position also contains a small teaching component. The research will be embedded in the Algebra and Number Theory group of the Mathematics Department and in particular connects to the CAN-endowed chair "Automated verification of mathematical proof" held by Assia Mahboubi. Within the Faculty of Science there will also be close collaboration with (Theoretical) Computer Science, especially the group of Jasmin Blanchette. Applications from all groups currently under-represented in academic posts are particularly encouraged. We are working to improve the present gender balance within the department, and particularly welcome applications from women. More details at https://urldefense.com/v3/__https://workingat.vu.nl/ad/phd-position-number-theory-and-formalization/70lg5t__;!!IBzWLUs!Dg0VWMAZKY3qOi2GhJfHxZEvk9-Yp_EPIx4s8CCZUgFD4L5IlgXVMc5uCqmLsF8n33-mqKh9WNRyBA$ From wjb at williamjbowman.com Fri Mar 4 14:48:41 2022 From: wjb at williamjbowman.com (William J. Bowman (PLDI 2022 Publicity Co-chair)) Date: Fri, 4 Mar 2022 11:48:41 -0800 Subject: [TYPES/announce] PLDI 2022 Call for Student Volunteers Message-ID: Sign up to be a Student Volunteer (SV) and help us make PLDI 2022 a unique experience for all attendants! PLDI 2022 is pleased to offer a number of opportunities for student volunteers, who are vital to the efficient operation and continued success of the conference each year. The student volunteer program is a chance for students from around the world to participate in the conference whilst assisting us in preparing and running the event. In exchange for a fixed number of work hours (usually from 12 to 15) helping with the conference organization, you will be able to closely interact with researchers, mentors, and other students at PLDI 2022. You will be able to support us in-person or virtually. We are looking forward to seeing you in the SV team! Apply using this form: https://urldefense.com/v3/__https://forms.gle/iUc857vkwhXXcsBu8__;!!IBzWLUs!Aa-ToPZVulGkZpKl_25fj0K9EBUNYBDZfivA0yK5sCea6Pm9fQJr5o8WiS4DhQ5Os4Kt7wMsDp5MPQ$ ## Eligibility Applicants can be undergraduate, Master?s, PhD full- or part-time students, of computer science or related fields. ## Duration Applicants must be available for at least four (4) full days between the 12th and 17th of June and will be expected to provide 12-15 hours of volunteering work in that time. Volunteers will also be expected to be available for some amount of pre-conference discussion and training if necessary. Volunteers from all timezones are welcome. ## About Volunteering The skills, talents, and dedication of the Student Volunteers contribute to the overall quality of the conference. The Student Volunteer role this year will mainly involve working with the organizers to prepare for the conference by providing technical assistance to attendees, managing online Q&A and poster sessions, and supporting active communication in our online environment. ## Qualifications A Student Volunteer should: - Be enthusiastic and highly motivated, with strong interpersonal skills, - Be fluent in English, which is the language of the conference, - Be reliable, punctual and organized. ## Applications The applications and acceptations will be done in two rounds. Please check the dates on this page. Application form: https://urldefense.com/v3/__https://forms.gle/fybjNmPH4F8khQsq7__;!!IBzWLUs!Aa-ToPZVulGkZpKl_25fj0K9EBUNYBDZfivA0yK5sCea6Pm9fQJr5o8WiS4DhQ5Os4Kt7wP87e2zrg$ From ventura at ufg.br Sat Mar 5 10:37:29 2022 From: ventura at ufg.br (D. Ventura) Date: Sat, 5 Mar 2022 12:37:29 -0300 Subject: [TYPES/announce] CfP: 3rd Joint Workshop Linearity & TLLA [FLoC 2022] Message-ID: *2022 Joint Workshop Linearity & TLLA* Haifa, Israel 31 July - 1 August 2022 ========================================================*FIRST Call for Papers* https://urldefense.com/v3/__https://easychair.org/cfp/tlla-linearity-2022*3rd__;Kg!!IBzWLUs!H-f0pks1oWSyvesUnFkuUT9Jkd3JG0cuOi-MkpyPELEmBL1vFIFSs8FYvs5ioAS34nzgQ0PZkjUTeg$ Joint Workshop Linearity & TLLA* Seventh International Workshop on Linearity Sixth International Workshop on Trends in Linear Logic and Applications *Haifa, Israel, 31 July - 1 August 2022* Affiliated with FSCD 2022 (FLoC 2022 ) https://urldefense.com/v3/__https://lipn.univ-paris13.fr/LinearityTLLA2022/========================================================__;!!IBzWLUs!H-f0pks1oWSyvesUnFkuUT9Jkd3JG0cuOi-MkpyPELEmBL1vFIFSs8FYvs5ioAS34nzgQ0N9qiWxyg$ Linearity has been a key feature in several lines of research in both theoretical and practical approaches to computer science. On the theoretical side there is much work stemming from linear logic dealing with proof technology, complexity classes, and more recently quantum computation. On the practical side, there is work on program analysis, expressive operational semantics for programming languages, linear programming languages, program transformation, update analysis and efficient implementation techniques. Linear logic is not only a theoretical tool to analyse 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 were originally developed for the study of linear logic's syntax and semantics and are nowadays applied in several other fields. The aim of this Joint Linearity and TLLA workshop is to bring together researchers who are currently working on linear logic and related fields, to foster their interaction and provide a forum for presenting new ideas and work in progress. We also hope to enable newcomers to learn about current activities in this area. New results that make central use of linearity, ranging from foundational work to applications in any field, are welcome. Also welcome are more exploratory presentations, which may examine open questions and raise fundamental concerns about existing theories and practices. *Topics of interest include*: - theory of programming languages - type systems - verification - models of computation: + categorical models + quantum and probabilistic models + biological and chemical models - games and languages - proof theory - parallelism and concurrency - linear logic methods in computer science - implicit computational complexity - sub-linear logics - interaction-based systems - categories and algebra - connections with combinatorics - functional analysis and operator algebras - logic and philosophy - linguistics *IMPORTANT DATES* * *Submission deadline*: *20th May 2022* * *Author notification*: *17th June 2022* * *Contribution for Informal Proceedings*: *1st July 2022* * *Workshop date*: *31st July - 1st August 2022* *SUBMISSIONS* Authors are invited to submit: * an *extended abstract* (8 pages max) describing original ideas and results not published nor submitted elsewhere, * or a *5-page abstract* presenting relevant work that has been or will be published elsewhere, * or a *2-page description* of work in progress. Preliminary proceedings will be available at the workshop. Papers should be written in English, and submitted in PDF format using the EPTCS style files. Submission is through the Easychair website: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=tllalinearity2022*POST-PROCEEDINGS*__;Kio!!IBzWLUs!H-f0pks1oWSyvesUnFkuUT9Jkd3JG0cuOi-MkpyPELEmBL1vFIFSs8FYvs5ioAS34nzgQ0NMvTM7OA$ After the workshop, authors of extended abstracts will be invited to submit a longer version of their work (typically a 15-pages paper) for publication in EPTCS (TBC). These submissions will undergo a second round of refereeing. *PROGRAMME COMMITTEE* Maribel Fernandez - King's College London, UK Marie Kerjean - CNRS-University Sorbonne Paris Nord, France Ugo Dal Lago - University of Bologna, Italy Marina Lenisa - University of Udine, Italy Guy McCusker - University of Bath, UK L? Th?nh D?ng Nguy?n - University of Rennes, France Valeria de Paiva - Topos Institute, USA Laurent Regnier (co-chair) - University of Aix-Marseille, France Lorenzo Tortora de Falco - University Roma Tre, Italy Andr?s Viso - Inria, France Daniel Ventura (co-chair) - Federal University of Goi?s, Brazil -------------- next part -------------- An HTML attachment was scrubbed... URL: From osera at cs.grinnell.edu Sun Mar 6 19:14:00 2022 From: osera at cs.grinnell.edu (Osera, Peter-Michael) Date: Mon, 7 Mar 2022 00:14:00 +0000 Subject: [TYPES/announce] 2-Year Postdoctoral Fellowship in Program Synthesis at Grinnell College Message-ID: Hello all! I am happy to announce that I am offering a two-year postdoctoral fellowship studying the foundations of program synthesis and types starting in the Fall of 2022. This position is unique in that I am offering the position from a liberal arts college where we emphasize both research and undergraduate education. As a postdoctoral fellow at Grinnell, in addition to research, you will have the opportunity to craft a teaching portfolio appropriate for application to teaching-focused positions such as tenure-track positions at liberal arts colleges or teaching-track faculty at larger universities. The official mini-blurb and link to the position's application page can be found below. We will begin to review applications for these positions starting March 21st. You can learn more about the position on my website: https://urldefense.com/v3/__https://osera.cs.grinnell.edu/postdoc__;!!IBzWLUs!CWSTsDKI5nVxMIw3kAnYSeIncn3wSC0ruz2dgTov8WHLPXyZBc5udTQFMIhC22HTEzsP3zoF31V_aw$ If you have any questions about this position, or about teaching-focused careers in academia in general, I am happy to chat with you over email (osera at cs.grinnell.edu); just let me know! Thanks! Peter-Michael Osera Assistant Professor, Co-chair Department of Computer Science Grinnell College https://urldefense.com/v3/__https://osera.cs.grinnell.edu__;!!IBzWLUs!CWSTsDKI5nVxMIw3kAnYSeIncn3wSC0ruz2dgTov8WHLPXyZBc5udTQFMIhC22HTEzsP3zqM8682xA$ --- The Department of Computer Science invites applications for a two-year Postdoctoral Fellowship in Computer Science beginning Fall 2022. Eligible candidates must have received their terminal degree within 3 years or later of their start date. The candidate will conduct research in the foundations of program synthesis, at the intersection of programming language theory and human-computing interaction. The candidate will also teach courses at the introductory CS level as well as in their own area of expertise. The annual teaching load for the Fellow is two courses per year (one per semester). Possible teaching areas include introductory courses or other courses in the regular curriculum of the Computer Science Department. The Fellow also will be expected to share their research with the Grinnell community and to be a contributing member of the Computer Science Department faculty. Additional information about this postdoctoral fellowship can be found at https://urldefense.com/v3/__https://osera.cs.grinnell.edu/postdoc__;!!IBzWLUs!CWSTsDKI5nVxMIw3kAnYSeIncn3wSC0ruz2dgTov8WHLPXyZBc5udTQFMIhC22HTEzsP3zoF31V_aw$ . https://urldefense.com/v3/__https://jobs.grinnell.edu/postings/4205__;!!IBzWLUs!CWSTsDKI5nVxMIw3kAnYSeIncn3wSC0ruz2dgTov8WHLPXyZBc5udTQFMIhC22HTEzsP3zqxH_PXmg$ From quentin.stievenart at gmail.com Mon Mar 7 03:04:15 2022 From: quentin.stievenart at gmail.com (Quentin Stievenart) Date: Mon, 7 Mar 2022 09:04:15 +0100 Subject: [TYPES/announce] Call for presentations: Program Analyses for WebAssembly (PAW @ ECOOP 2022) Message-ID: WebAssembly is a recently introduced portable virtual machine, to which code written in many high-level languages can be compiled in order to be executed in web browsers and other runtimes. There have been several independent efforts to bring static and dynamic analysis tools to the WebAssembly ecosystem. This workshop aims to bring together researchers working in the domain of static and dynamic analyses for WebAssembly. Specifically, this workshop aims to discuss all techniques related to detecting bugs and vulnerabilities in WebAssembly binaries, to build models of such binaries, to prove their correctness, to monitor their execution, or to optimise binaries for running time and binary size. The PAW workshop is a community-building event, for exchanging ideas and fostering collaborations in these domains. The workshop will consist of submitted and invited talks, as well as discussion sessions. To that end, we invite submissions for talks in the form of a 1-page abstract delineating at a high-level the content of the presentation. More info: https://urldefense.com/v3/__https://2022.ecoop.org/home/paw-2022__;!!IBzWLUs!FHowReDlyJ09rqs1K-NFTWfzi2ZMHb0XjO2rvN1VfVgyQpKg6nWyMwqypGOf37zLzs4VKiGL7PBMCA$ Submission site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=paw2022__;!!IBzWLUs!FHowReDlyJ09rqs1K-NFTWfzi2ZMHb0XjO2rvN1VfVgyQpKg6nWyMwqypGOf37zLzs4VKiEAM5copA$ Timeline: April 11 2022: Submission deadline May 2 2022: Acceptance notification June 6-10 2022: ECOOP conference -------------- next part -------------- An HTML attachment was scrubbed... URL: From antti.hyvarinen at gmail.com Mon Mar 7 05:15:23 2022 From: antti.hyvarinen at gmail.com (=?UTF-8?Q?Antti_Hyv=C3=A4rinen?=) Date: Mon, 7 Mar 2022 11:15:23 +0100 Subject: [TYPES/announce] SMT 2022 - 20th International Workshop on Satisfiability Modulo Theories Message-ID: SMT2022 Call For Papers SMT 2022: 20th International Workshop on Satisfiability Modulo Theories Haifa, Israel, August 11-12, 2022 Conference website https://urldefense.com/v3/__http://smt-workshop.cs.uiowa.edu/2022/__;!!IBzWLUs!CVXgGAdcLtwvCdQq25ScdRS0Ry9kHbyyIjOVw-f_F-FM7wpMpPfM7MYUL_Y3vj6kdX0vtG17d_yo0w$ Submission link https://urldefense.com/v3/__https://easychair.org/conferences/?conf=smt2022__;!!IBzWLUs!CVXgGAdcLtwvCdQq25ScdRS0Ry9kHbyyIjOVw-f_F-FM7wpMpPfM7MYUL_Y3vj6kdX0vtG1YK0xX-g$ Submission deadline May 15, 2022 Notification June 24, 2022 == Overview SMT 2022 is the 20th International Workshop on Satisfiability Modulo Theories. It is affiliated with IJCAR 2022, part of FLoC2022, and will be held on August 11th-12th, 2022, in Haifa, Israel. 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. In addition, to celebrate the 20th edition of the workshop, we challenge the community to submit high-impact work! == Submission Guidelines Three categories of submissions are invited: 1. 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. They will be included in the informal proceedings. 2. Original papers: contain original research (simultaneous submissions are not allowed) 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. 3. 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. The 10 page limit does not include references, and 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. To submit a paper, go to the EasyChair SMT 2022 submission page and follow the instructions there. == Committees === Program Chairs * David D?harbe ? CLEARSY * Antti Hyv?rinen ? Universit? della Svizzera Italiana === Program Committee * Leonard Alt ? Ethereum Foundation * Haniel Barbosa ? Universidade Federal de Minas Gerais * Nikolaj Bj?rner ? Microsoft Research * Maria Paola Bonacina ? Universit? degli Studi di Verona * Martin Bromberger ? Max-Planck Institut f?r Informatik * Rayna Dimitrova ? CISPA Helmholtz Center for Information Security * Pascal Fontaine ? Universit? de Li?ge * St?phane Graham-Lengrand ? SRI International * Liana Hadarean ? Amazon Web Services * Jochen Hoenicke ? University of Freiburg * Chantal Keller ? Universit? Paris-Saclay * Igor Konnov ? Informal Systems Austria * Matteo Marescotti ? Meta Platforms, UK * Aina Niemetz ? Stanford University * Elizabeth Polgreen ? University of Edinburgh * Mathias Preiner ? Stanford University * Andrew Reynolds ? University of Iowa * Tanja Schindler ? University of Freiburg * Sophie Tourret ? INRIA and MPI for Informatics * Yoni Zohar ? Bar Ilan University == Contact All questions about submissions should be emailed to the PC chairs. From Simon.Gay at glasgow.ac.uk Mon Mar 7 06:43:42 2022 From: Simon.Gay at glasgow.ac.uk (Simon Gay) Date: Mon, 7 Mar 2022 11:43:42 +0000 Subject: [TYPES/announce] Postdoc position on session types for Erlang, University of Glasgow Message-ID: University of Glasgow College of Science and Engineering School of Computing Science Research Assistant / Associate Ref: 077847 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. The main line of work in Glasgow is the development of a session type system for Erlang. The first phase of the project has produced a session type system for a higher-order actor-based functional calculus, with a prototype implementation. The next phase will transfer these theoretical results into a session type system for Erlang, implemented as either a language extension or an external tool. 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. Experience with the theory and implementation of type systems in general is more important than specific knowledge of session types or actor languages. 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!D-ZmKfiqnhBycM-7nmoHoMm5Mpa9_ICV1EWa-X6nKAhts5Vzui82ZpM5FqztcezFyn__ISSZVdZUfA$ *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_jobspec_version_4.jobspec?p_id=077847__;!!IBzWLUs!D-ZmKfiqnhBycM-7nmoHoMm5Mpa9_ICV1EWa-X6nKAhts5Vzui82ZpM5FqztcezFyn__ISQJ_28a9Q$ Also: https://urldefense.com/v3/__https://www.jobs.ac.uk/job/CMS487/research-assistant-associate__;!!IBzWLUs!D-ZmKfiqnhBycM-7nmoHoMm5Mpa9_ICV1EWa-X6nKAhts5Vzui82ZpM5FqztcezFyn__ISTiBkK1lQ$ Closing date: 15th March 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!D-ZmKfiqnhBycM-7nmoHoMm5Mpa9_ICV1EWa-X6nKAhts5Vzui82ZpM5FqztcezFyn__IST_0aGdVg$ *************************************** From michael.marcozzi at gmail.com Mon Mar 7 07:21:57 2022 From: michael.marcozzi at gmail.com (=?UTF-8?Q?Micha=C3=ABl_Marcozzi?=) Date: Mon, 7 Mar 2022 13:21:57 +0100 Subject: [TYPES/announce] =?utf-8?q?Fwd=3A_PhD_and_postdoc_positions_in_S?= =?utf-8?q?oftware_Security_=28Universit=C3=A9_Paris-Saclay=2C_CEA_?= =?utf-8?q?List_institute=2C_France=29?= In-Reply-To: References: Message-ID: The BINSEC team ( https://urldefense.com/v3/__https://binsec.github.io__;!!IBzWLUs!DD1VnbNFBVrHBocvuIOIom1LMW3xgnHeTcrTV6RfG6jViqk4AyGKcK0JJBWCToG8Q1VF2r357XKKjA$ ) opens two PhD and one postdoc positions to work with S?bastien Bardin ( https://urldefense.com/v3/__http://sebastien.bardin.free.fr__;!!IBzWLUs!DD1VnbNFBVrHBocvuIOIom1LMW3xgnHeTcrTV6RfG6jViqk4AyGKcK0JJBWCToG8Q1VF2r3gu96O2A$ ) and Micha?l Marcozzi ( https://urldefense.com/v3/__http://www.marcozzi.net__;!!IBzWLUs!DD1VnbNFBVrHBocvuIOIom1LMW3xgnHeTcrTV6RfG6jViqk4AyGKcK0JJBWCToG8Q1VF2r1aCj2iaQ$ ) on detection and prevention of advanced software vulnerabilities. (sorry if you receive duplicate versions of this email) *Start*: as soon as possible in 2022. *Duration*: 3 years (PhD), 2 years (postdoc). *Keywords*: software security, program analysis, testing, formal methods, symbolic execution, fuzzing, micro-architectural attacks *Detailed job offer*: https://urldefense.com/v3/__https://binsec.github.io/jobs/2022/03/03/phd-postdoc-offer.html__;!!IBzWLUs!DD1VnbNFBVrHBocvuIOIom1LMW3xgnHeTcrTV6RfG6jViqk4AyGKcK0JJBWCToG8Q1VF2r0yPW8JWQ$ *== ABOUT US* The BINary-level SECurity research group (BINSEC) is a dynamic team of 11 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. The team has high-level expertise in several code analysis approaches, namely symbolic execution, fuzzing and abstract interpretation. We apply these techniques to improve software security, covering notably vulnerability detection, code (de)obfuscation and formal verification. See our website at https://urldefense.com/v3/__https://binsec.github.io__;!!IBzWLUs!DD1VnbNFBVrHBocvuIOIom1LMW3xgnHeTcrTV6RfG6jViqk4AyGKcK0JJBWCToG8Q1VF2r357XKKjA$ for additional information. *== JOB OFFERS SUMMARY* * One Ph.D position (3 years) in detection of complex vulnerabilities with fuzzing. * One Ph.D position (3 years) in formal verification of security properties against micro-architectural attacks. * One postdoc position (2 years) in detection of complex vulnerabilities with symbolic execution and fuzzing. 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. The positions comprise 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 PROCEDURE SUMMARY* Candidates should send a *CV*, a *cover letter*, and *contact information of at least two referees* to binsec-jobs at saxifrage.saclay.cea.fr as soon as possible (and at the latest by May 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). -------------- next part -------------- An HTML attachment was scrubbed... URL: From catherine.dubois at ensiie.fr Mon Mar 7 13:06:19 2022 From: catherine.dubois at ensiie.fr (Catherine DUBOIS) Date: Mon, 7 Mar 2022 19:06:19 +0100 Subject: [TYPES/announce] TAP22: Tests and Proofs 2022 - Call for Papers Message-ID: <233e6fb0-e333-4201-2c66-7689d6952c6a@ensiie.fr> TAP22: Tests and Proofs 2022 co-located event of STAF 2022 Nantes, France, July 4-8, 2022 Conference website https://urldefense.com/v3/__https://easychair.org/smart-program/TAP22/index.html__;!!IBzWLUs!FFeVjueuSLl7yvEY92spNRKvC9VTg9tvYdAYBv1ma8ML1jEIrtYCgVcA-CL_q___dGrocHctKLevxg$ Submission link https://urldefense.com/v3/__https://easychair.org/conferences/?conf=tap22__;!!IBzWLUs!FFeVjueuSLl7yvEY92spNRKvC9VTg9tvYdAYBv1ma8ML1jEIrtYCgVcA-CL_q___dGrocHeR4-MRUA$ Conference program https://urldefense.com/v3/__https://easychair.org/smart-program/TAP22/__;!!IBzWLUs!FFeVjueuSLl7yvEY92spNRKvC9VTg9tvYdAYBv1ma8ML1jEIrtYCgVcA-CL_q___dGrocHfMjNJFTQ$ Abstract registration deadline March 18, 2022 Submission deadline March 23, 2022 Author notification May 9, 2022 The TAP conference promotes research in verification and formal methods that targets the interplay of proofs and testing: the advancement of techniques of each kind and their combination, with the ultimate goal of improving software and system dependability. Research in verification has seen a steady convergence of heterogeneous techniques and a synergy between the traditionally distinct areas of testing (and dynamic analysis) and of proving (and static analysis). Formal techniques for counter-example generation based on, for example, symbolic execution, SAT/SMT-solving or model checking, furnish evidence for the potential of a combination of tests and proofs. The combination of predicate abstraction with testing-like techniques based on exhaustive enumeration opens the perspective for novel techniques of proving correctness. On the practical side, testing offers cost-effective debugging techniques of specifications or crucial parts of program proofs (such as invariants). Last but not least, testing is indispensable when it comes to the validation of the underlying assumptions of complex system models involving hardware and/or system environments. Over the years, there is growing acceptance in research communities that testing and proving are complementary rather than mutually exclusive techniques. The TAP conference aims to promote research in the intersection of testing and proving by bringing together researchers and practitioners from both areas of verification. *** Submission Guidelines All papers must be original and not simultaneously submitted to another journal or conference. The following paper categories are welcome: ** Regular research papers: full submissions describing original research, of up to 16 pages (excluding references and appedix). In case regular papers rely on experimental data and/or tool support, authors are strongly recommended to make the experimental data and/or tool support available for public use. ** Tool demonstration papers: submissions describing the design and implementation of an analysis/verification tool or framework, of up to 8 pages (excluding references and appendix). The tool/framework described in a tool demonstration paper should be available for public use. ** Short papers: submissions describing preliminary findings, proofs of concepts, and exploratory studies, of up to 6 pages (excluding references and appendix). Papers have to adhere to Springer's LNCS format and must be submitted in PDF format at the EasyChair submission site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=tap22__;!!IBzWLUs!FFeVjueuSLl7yvEY92spNRKvC9VTg9tvYdAYBv1ma8ML1jEIrtYCgVcA-CL_q___dGrocHeR4-MRUA$ *** List of Topics TAP's scope encompasses many aspects of verification technology, including foundational work, tool development, and empirical research. Its topics of interest center around the connection between proofs (and other static techniques) and testing (and other dynamic techniques). Papers are solicited on, but not limited to, the following topics: * Verification and analysis techniques combining proofs and tests * Program proving with the aid of testing techniques * Deductive techniques supporting the automated generation of test vectors and oracles (theorem proving, model checking, symbolic execution, SAT/SMT solving, constraint logic programming, etc.) * Deductive techniques supporting novel definitions of coverage criteria * Program analysis techniques combining static and dynamic analysis * Specification inference by deductive and dynamic methods * Testing and runtime analysis of formal specifications * Search-based technics for proving and testing * Verification of verification tools and environments * Applications of test and proof techniques in new domains, such as security, configuration management, learning * Combined approaches of test and proof in the context of formal certifications (Common Criteria, CENELEC, ?) * Case studies, tool and framework descriptions, and experience reports combining tests and proofs *** Program Committee * Wolfgang Ahrendt (Chalmers University of Technology) * Catherine Dubois (ENSIIE-Samovar) * Carlo A. Furia (USI - Universit? della Svizzera Italiana) * Dilian Gurov (KTH Royal Institute of Technology) * Falk Howar (TU Clausthal / IPSSE) * Marieke Huisman (University of Twente) * Reiner H?hnle (TU Darmstadt) * Einar Broch Johnsen (University of Oslo) * Konstantin Korovin (The University of Manchester) * Laura Kovacs (Vienna University of Technology) - chair * Karl Meinke (KTH Royal Institute of Technology) - chair * Jakob Nordstrom (University of Copenhagen and Lund University) * Patrizio Pelliccione (Gran Sasso Science Institute (GSSI)) * Luigia Petre (?bo Akademi University) * Cristina Seceleanu (M?lardalen University) * Sahar Tahvili (Ericsson) * Neil Walkinshaw (The University of Sheffield) * Heike Wehrheim (Paderborn University) *** Publication Accepted submissions will be published in Springer's LNCS series. Papers have to adhere to Springer's LNCS format and must be submitted in PDF format at the EasyChair submission site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=tap22__;!!IBzWLUs!FFeVjueuSLl7yvEY92spNRKvC9VTg9tvYdAYBv1ma8ML1jEIrtYCgVcA-CL_q___dGrocHeR4-MRUA$ *** Venue The conference will be held as an affiliated event of STAF 2022, during July 4-8, 2022, in Nantes, France. *** Contact All questions about submissions should be emailed to laura.kovacs at tuwien.ac.at and karlm at kth.se. -------------- next part -------------- A non-text attachment was scrubbed... Name: catherine_dubois.vcf Type: text/vcard Size: 4 bytes Desc: not available URL: From kaposi.ambrus at gmail.com Tue Mar 8 03:44:18 2022 From: kaposi.ambrus at gmail.com (Ambrus Kaposi) Date: Tue, 8 Mar 2022 09:44:18 +0100 Subject: [TYPES/announce] Call for STSMs, deadline 3 April 2022 In-Reply-To: References: <9b720e84-5623-2a46-8b1e-83a765fb3765@inria.fr> <8791d66d-d475-1573-79bc-d07c81674fe3@inria.fr> Message-ID: COST Action CA20111 EuroProofNet Open call for Short-Term Scientific Missions (STSMs) Dear Action members, Proposals have to be submitted on https://urldefense.com/v3/__https://e-services.cost.eu/activity/grants/add?type=STSM__;!!IBzWLUs!DqnLuKCr_IPlVdIJJaw9m9mSdODF_ghHtvhjP92TUd75tmFi3zSkMWwr_PdTUcLgmzTJMNsYl2J5Hw$ (you need to add a bank account on your e-cost profile first). The deadline is 3 April 2022 (AoE). We are especially looking for applications from women and from working groups other than WG3. A Short-Term Scientific Mission (STSM) is a research visit of an individual researcher from a country participating in the Action in a different country also participating in the Action. We encourage STSMs, as they are an effective way of starting and maintaining collaborations. The procedure for proposing an STSM is described in Annex 2, section 2.3, of the Annotated Rules ( https://urldefense.com/v3/__https://www.cost.eu/uploads/2021/10/COST-094-21-Annotated-Rules-for-COST-Actions-Level-C-2021-11-01-1.pdf__;!!IBzWLUs!DqnLuKCr_IPlVdIJJaw9m9mSdODF_ghHtvhjP92TUd75tmFi3zSkMWwr_PdTUcLgmzTJMNuK-I5mAQ$ ). The main points about STSMs are: * An STSM must be between two different countries which are participating in the Action. * The typical duration is one or two weeks. We favor short missions so that more people can get funded. * The financial contribution for an STSM is a fixed grant based on the applicant's budget request and the evaluation of the application by the STSM assessment committee. The grant will not necessarily cover all costs of the visit. The grant only covers travel and subsistence and is transferred after the STSM has taken place. * Recommended grants: - up to EUR 120 for daily allowance (depending on the location) - up to EUR 400 for travel. - the total may not exceed EUR 4000 (this is a hard limit) * As part of the application form submitted through e-COST, the goals of the mission have to be described including how it contributes to the objectives of the Action (see https://urldefense.com/v3/__https://www.cost.eu/actions/CA20111__;!!IBzWLUs!DqnLuKCr_IPlVdIJJaw9m9mSdODF_ghHtvhjP92TUd75tmFi3zSkMWwr_PdTUcLgmzTJMNt8e3jEkg$ ), which working group(s) it contributes to, and a confirmation from the host that he or she will receive the applicant. * Proposals should be submitted by the deadlines. * STSMs must end before the end of October. The criteria according to which funding will be decided are in order: * importance with regard to the research coordination objectives * inclusiveness target countries * age * gender * team with low resources * balance over the action life time between people, teams, countries and working groups. After acceptance, to get reimbursed, a short scientific report must be submitted through the e-cost system along with the Host?s approval of the report, within 15 days after the end of the STSM. For more information, see the website of the action https://urldefense.com/v3/__https://europroofnet.github.io__;!!IBzWLUs!DqnLuKCr_IPlVdIJJaw9m9mSdODF_ghHtvhjP92TUd75tmFi3zSkMWwr_PdTUcLgmzTJMNsdyBT1ww$ . Regards, Danijela Simic and Ambrus Kaposi EuroProofNet STSM Coordinators -------------- next part -------------- An HTML attachment was scrubbed... URL: From tobias.kappe at gmail.com Tue Mar 8 04:16:51 2022 From: tobias.kappe at gmail.com (=?UTF-8?Q?Tobias_Kapp=C3=A9?=) Date: Tue, 8 Mar 2022 10:16:51 +0100 Subject: [TYPES/announce] Learning and Automata (LearnAut) 2022 -- ICALP 2022 Workshop, second CFP Message-ID: Learning and Automata (LearnAut) -- ICALP 2022 workshop July 4th - Paris, France and virtually Website: https://urldefense.com/v3/__https://learnaut22.github.io__;!!IBzWLUs!G_F0CMqXm0dL_4rmYjxPUJwF0sEWPubQNGp45w-5VV0UnhCF-ZGj6JmyopFO_U42UhM83uKuKw1YTg$ Learning models defining recursive computations, like automata and formal grammars, are the core of the field called Grammatical Inference (GI). The expressive power of these models and the complexity of the associated computational problems are major research topics within mathematical logic and computer science. Historically, there has been little interaction between the GI and ICALP communities, though recently some important results started to bridge the gap between both worlds, including applications of learning to formal verification and model checking, and (co-)algebraic formulations of automata and grammar learning algorithms. The goal of this workshop is to bring together experts on logic who could benefit from grammatical inference tools, and researchers in grammatical inference who could find in logic and verification new fruitful applications for their methods. We invite submissions of recent work, including preliminary research, related to the theme of the workshop. The Program Committee will select a subset of the abstracts for oral presentation. At least one author of each accepted abstract is expected to represent it at the workshop (in person, or virtually). Note that accepted papers will be made available on the workshop website but will not be part of formal proceedings (i.e., LearnAut is a non-archival workshop). Topics of interest include (but are not limited to): - Computational complexity of learning problems involving automata and formal languages. - Algorithms and frameworks for learning models representing language classes inside and outside the Chomsky hierarchy, including tree and graph grammars. - Learning problems involving models with additional structure, including numeric weights, inputs/outputs such as transducers, register automata, timed automata, Markov reward and decision processes, and semi-hidden Markov models. - Logical and relational aspects of learning and grammatical inference. - Theoretical studies of learnable classes of languages/representations. - Relations between automata or any other models from language theory and deep learning models for sequential data. - Active learning of finite state machines and formal languages. - Methods for estimating probability distributions over strings, trees, graphs, or any data used as input for symbolic models. - Applications of learning to formal verification and (statistical) model checking. - Metrics and other error measures between automata or formal languages. ** Invited speakers ** Jeffrey Heinz (Stony Brook University) Sheila McIlraith (University of Toronto) Ariadna Quattoni (Universitat Polit?cnica de Catalunya) ** Submission instructions ** Submissions in the form of extended abstracts must be at most 8 single-column pages long at most (plus at most four for bibliography and possible appendixes) and must be submitted in the JMLR/PMLR format. The LaTeX style file is available here: https://urldefense.com/v3/__https://ctan.org/tex-archive/macros/latex/contrib/jmlr__;!!IBzWLUs!G_F0CMqXm0dL_4rmYjxPUJwF0sEWPubQNGp45w-5VV0UnhCF-ZGj6JmyopFO_U42UhM83uL3U8jf9Q$ We do accept submissions of work recently published or currently under review. - Submission url: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=learnaut2022__;!!IBzWLUs!G_F0CMqXm0dL_4rmYjxPUJwF0sEWPubQNGp45w-5VV0UnhCF-ZGj6JmyopFO_U42UhM83uKGjLeqyA$ - Submission deadline: March 31st - Notification of acceptance: April 30th - Early registration: TBD ** Program Committee ** - Dana Angluin (Yale University) - Leonor Becerra-Bonache (Jean Monnet University, Saint-?tienne) - Jorge Castro (Universitat Polit?cnica de Catalunya) - Dana Fisman (Ben-Gurion University) - Matthias Gall? (Naver Labs Europe) - Gerco van Heerdt (University College London) - Colin de la Higuera (University of Nantes) - Falk Howar (TU Dortmund) - Nils Jansen (Radboud University) - Joshua Moerman (Open University of the Netherlands) - Ariadna Quattoni (Universitat Polit?cnica de Catalunya) - Bernhard Steffen (TU Dortmund) - Henning Urbat (Friedrich-Alexander University Erlangen-N?rnberg) - Frits Vaandrager (Radboud University) - Ryo Yoshinaka (Tohoku University) ** Organizers ** R?mi Eyraud (Jean Monnet University, Saint-?tienne) Tobias Kapp? (ILLC, University of Amsterdam) Guillaume Rabusseau (Mila & DIRO, Universit? de Montr?al) Matteo Sammartino (Royal Holloway, University of London & University College London) -------------- next part -------------- An HTML attachment was scrubbed... URL: From bennovdberg at gmail.com Tue Mar 8 07:30:34 2022 From: bennovdberg at gmail.com (Benno van den Berg) Date: Tue, 8 Mar 2022 13:30:34 +0100 Subject: [TYPES/announce] PhD position at the University of Amsterdam Message-ID: Dear all, At the Institute for Logic, Language and Computation (part of the University of Amsterdam) there is a vacancy for a PhD student within our Mathematical and Computational Logic group. The advert can be found here: https://urldefense.com/v3/__https://vacatures.uva.nl/UvA/job/PhD-in-Mathematical-and-Computational-Logic/742421702/__;!!IBzWLUs!FAclAzZK84zrcTK48spnscqVqghQAaDhZ-N9cWBYB8F0dzT3Q7LamrSr9FJjEYErHuha-I1b2p4Tuw$ Deadline is March 31. Interested candidates should feel free to contact me. Best wishes, Benno -------------- next part -------------- An HTML attachment was scrubbed... URL: From laura.titolo at nianet.org Tue Mar 8 15:09:07 2022 From: laura.titolo at nianet.org (Titolo, Laura) Date: Tue, 8 Mar 2022 20:09:07 +0000 Subject: [TYPES/announce] SOAP 2022 - submission deadline extended Message-ID: ============================================================ ???????? The 11th ACM SIGPLAN International Workshop on the State of the Art in Program Analysis (SOAP) ???????????????????? ?14?June 2022 San Diego (CA), USA ?????????????https://urldefense.com/v3/__https://pldi22.sigplan.org/home/SOAP-2022__;!!IBzWLUs!E68mE314lPqpgDWxPwJG1biBrkuXx-Hn1vaZf4hI_742II1foAk4ij48xKtI1TeV4UUgNfEtTrnsDw$ ????????????????? Co-located with PLDI 2022 =========================================================== 21 March 2022: Submission deadline (extended) 21 April 2022: Author notification 5 May 2022: Camera-ready deadline 14 June 2022: Workshop 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 2022 aims to bring together the members of the program analysis community to share new developments and shape new innovations in program analysis. For SOAP 2022, 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 the main parts of the demo. Submission Details ================= Submissions should be 4 to 6 pages long 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 https://urldefense.com/v3/__http://www.sigplan.org/Resources/Author__;!!IBzWLUs!E68mE314lPqpgDWxPwJG1biBrkuXx-Hn1vaZf4hI_742II1foAk4ij48xKtI1TeV4UUgNfFIPojBiA$ . The ACM class \documentclass[sigplan,screen]{acmart} should be used in order to ensure the expected default settings and correct colors. Papers must be submitted in PDF format at the EasyChair submission site: https://urldefense.com/v3/__https://easychair.org/my/conference?conf=soap2022__;!!IBzWLUs!E68mE314lPqpgDWxPwJG1biBrkuXx-Hn1vaZf4hI_742II1foAk4ij48xKtI1TeV4UUgNfFgoW_1Yw$ . More Information ================ For additional information, please visit the website, follow @SOAP_Workshop on Twitter, or contact the chairs Laure Gonnord (laure.gonnord at ens-lyon.fr) and Laura Titolo (laura.titolo at nasa.gov) From rupak at mpi-sws.org Wed Mar 9 04:37:44 2022 From: rupak at mpi-sws.org (rupak at mpi-sws.org) Date: Wed, 9 Mar 2022 10:37:44 +0100 Subject: [TYPES/announce] Postdoctoral positions in AI for Programming Education at MPI-SWS, Germany Message-ID: Postdoctoral positions in AI for Programming Education at MPI-SWS, Germany ======================================================== The Max Planck Institute for Software Systems in Germany (MPI-SWS, https://urldefense.com/v3/__http://www.mpi-sws.org/__;!!IBzWLUs!DAoctr71t1_CSoOH5_qArtv2RJpx3zPF0eqrbQteHUSDTBfStE0mLMzWOKSI8EpKbzwg9ikUM9JowA$ ) has several open postdoctoral positions in AI for Programming Education. *** Open positions *** We are looking to hire postdoctoral researchers in AI for Programming Education. Main topics of interest include, but are not limited to: program synthesis and repair, neuro-symbolic AI, reinforcement learning, human-centered computing, cognitive science, and learning sciences. These are joint positions with Adish Singla (MPI-SWS), Sumit Gulwani (Microsoft), and Rupak Majumdar (MPI-SWS). Moreover, you will have opportunities to conduct interdisciplinary work in close collaboration with researchers at several institutions, both within Max Planck Society and worldwide. *** Resources *** Postdoctoral research positions come with highly competitive salaries, as well as generous travel, administrative, and technical support. You will have opportunities to work closely with graduate students, recruit interns, and lead research projects. In short, you will have great support to do outstanding research. MPI-SWS is located in Saarbrucken and Kaiserslautern, Germany, in the tri-border area of Germany, France, and Luxembourg. The area offers a high standard of living, beautiful surroundings, and easy access to major metropolitan areas in central Europe. *** Qualifications *** Postdoctoral applicants should have completed or be close to completing a Ph.D. in a relevant field (e.g., Computer Science, Information Science, Engineering, Cognitive Science). Applicants should have a strong track record of research publications in top-tier conferences. We maintain an open, international, and diverse work environment, and seek applications from outstanding researchers regardless of national origin. Our working language is English. *** How to apply *** Please apply at https://urldefense.com/v3/__https://apply.mpi-sws.org/__;!!IBzWLUs!DAoctr71t1_CSoOH5_qArtv2RJpx3zPF0eqrbQteHUSDTBfStE0mLMzWOKSI8EpKbzwg9inPbT0F7Q$ by creating a new application under the category "Post Doctoral Researcher Position". You need to provide your CV, a research statement, an optional teaching statement, and names of 3 references. Reviews of applications will start immediately, and continue until the positions are filled. *** Contacts and further information *** For any questions or informal queries, please get in touch with Adish Singla (adishs @ mpi-sws.org), Sumit Gulwani (sumitg @ microsoft.com), or Rupak Majumdar (rupak @ mpi-sws.org). You can find more about our work at: - https://urldefense.com/v3/__https://machineteaching.mpi-sws.org/__;!!IBzWLUs!DAoctr71t1_CSoOH5_qArtv2RJpx3zPF0eqrbQteHUSDTBfStE0mLMzWOKSI8EpKbzwg9illubb5RA$ - https://urldefense.com/v3/__https://www.microsoft.com/en-us/research/video/ai-for-programming-education/__;!!IBzWLUs!DAoctr71t1_CSoOH5_qArtv2RJpx3zPF0eqrbQteHUSDTBfStE0mLMzWOKSI8EpKbzwg9imimE733Q$ ======================================================== -------------- next part -------------- An HTML attachment was scrubbed... URL: From pierre-marie.pedrot at inria.fr Thu Mar 10 02:48:02 2022 From: pierre-marie.pedrot at inria.fr (=?UTF-8?Q?Pierre-Marie_P=c3=a9drot?=) Date: Thu, 10 Mar 2022 08:48:02 +0100 Subject: [TYPES/announce] TYPES 2022 -- Deadline extension Message-ID: DEADLINE EXTENSION Following popular pressure, the deadline for talk submission to TYPES 2022 has been extended to **Monday, March 14th AoE**. ----------------------------------------------------------------------- 28th International Conference on Types for Proofs and Programs, TYPES 2022 and EuroProofNet Cost Action CA20111 meeting Nantes, France, 20-25 June 2022 https://types22.inria.fr 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; * 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; * formalizing mathematics using type theory. 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. The EuroProofNet Cost Action CA20111 focuses on the same research topics as TYPES and partially sponsors the TYPES Conference. INVITED SPEAKERS: Youyou Cong (Tokyo Institute of Technology) Ekaterina Komendantskaya (Heriot-Watt University) Sam Lindley (University of Edinburgh) Leonardo de Moura (Microsoft Research) CONTRIBUTED TALKS: We solicit contributed talks. Selection of those will be based on extended abstracts/short papers of 2 pp (not including bibliography) formatted with easychair.cls. The submission site is https://easychair.org/conferences/?conf=types2022 IMPORTANT DATES: * submission of 2 pp abstract: 9 March 2022 * notification of acceptance/rejection: 20 April 2022 * camera-ready version of abstract: 15 May 2022 Camera-ready versions of the accepted contributions will be published in an informal book of abstracts for distribution at the workshop. POST-PROCEEDINGS 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 submission deadline for the post-proceedings: September 2022. PROGRAM COMMITTEE Sandra Alves (University of Porto) Carlo Angiuli (Carnegie Mellon University) Stephanie Balzer (Carnegie Mellon University) Lars Birkedal (Aarhus University) Fr?d?ric Blanqui (INRIA) Sandrine Blazy (Universit? de Rennes 1 - IRISA) Thierry Coquand (University of Technology) Andrej Dudenhefner (Saarland University) Jacques Garrigue (Nagoya University) Delia Kesner (Universit? de Paris) (PC Co-Chair) Marina Lenisa (Universit? di Udine) Paul Blain Levy (University of Birmingham) Sara Negri (Universit? degli Studi di Genova) Pierre-Marie P?drot (INRIA) (PC Co-Chair) Luca Padovani (Universit? di Torino) Zoe Paraskevopoulou (Northeastern University) Brigitte Pientka (McGill University) Matija Pretnar (University of Ljubljana) Talia Ringer (University of Washington) Kathrin Stark (Princeton University) Pawe? Urzyczyn (University of Warsaw) Lionel Vaux (Universit? d?Aix-Marseille) Niki Vazou (IMDEA Software) TYPES STEERING COMMITTEE Andreas Abel (Gothenburg University) Sandra Alves (University of Porto) (Secretary) Henning Basold (Leiden University) (SC chair) Fr?d?ric Blanqui (INRIA) Ugo de'Liguoro (Universit? di Torino) Matthieu Sozeau (INRIA & Universit? de Nantes) 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. 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), Virtual (2021). CONTACT Email: types2022 at easychair.org Organisers: Assia Mahboubi (INRIA & Universit? de Nantes) Matthieu Sozeau (INRIA & Universit? de Nantes) Nicolas Tabareau (INRIA & Universit? de Nantes) -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_signature Type: application/pgp-signature Size: 840 bytes Desc: OpenPGP digital signature URL: From balzers at cs.cmu.edu Thu Mar 10 06:25:03 2022 From: balzers at cs.cmu.edu (Stephanie Balzer) Date: Thu, 10 Mar 2022 12:25:03 +0100 Subject: [TYPES/announce] ECOOP Doctoral Symposium 2022: Call for Participation Message-ID: <40C35F50-6A14-4194-9A3B-DF44EB86DB63@cs.cmu.edu> Call for Contributions The ECOOP Doctoral Symposium https://urldefense.com/v3/__https://2022.ecoop.org/track/ecoop-2022-doctoral-symposium__;!!IBzWLUs!EryhUnDCuBv4vfCcDlmmgWlohK5EaHyfmG0trg3L6ytrsLU36uP3afUOlk77veJIzjiMU7vHdmdeAg$ provides a forum for PhD students at any stage in their research to get detailed feedback and advice. We welcome contributions in all aspects of practice and theory of programming languages, systems and environments, ranging the whole spectrum from novel ideas to evaluation of existing solutions. There are distinct submission instructions for junior and senior PhD students: Junior students may not have a full research plan but shall have an identified research topic; they will present their ideas and any progress to date, and will receive feedback to help them determine further steps in research. Senior students are expected to give an outline of their thesis research and will receive feedback to help them successfully complete their thesis and defense/viva. As participants of the Doctoral Symposium are not expected to submit technical papers, but rather thesis proposals, participants can submit to both the main conferences/workshops and the Doctoral Symposium. There will be no proceedings for the Doctoral Symposium. Submissions will be carried out electronically via HotCRP (link TBD). To submit, upload a pdf and specify the submission category (junior or senior). Please, also specify the PC members that have conflicts of interest with your submission. Students of accepted submissions are expected to attend the entire doctoral symposium. Junior PhD Students Submit a 4?8 page research proposal in the Dagstuhl LIPIcs format with: a problem description; a detailed sketch of a proposed approach; related work. It is not necessary to present concrete results. Instead, try to inform the reader that you have a (well-motivated) problem and present a possible solution. Attempt to provide a clear roadmap detailing future research efforts. Senior PhD Students The experience for senior students is meant to mimic a ?mini-defense? interview. Aside from the actual feedback, this helps the student gain familiarity with the style and mechanics of such an interview (advisors of student presenters will not be allowed in). The students should be able to present: the importance of the problem; a clear research proposal; some preliminary work; an evaluation plan. Please submit a 6?10 page thesis proposal in the Dagstuhl LIPIcs format with the following: Problem Description What is the problem? What is the significance of this problem? Why can the current state of the art not solve this problem? Goal Statement What is the goal of your research? What artifacts (tools, theories, methods) will be produced, How do they address the stated problem? Method What experiments, prototypes, or studies need to be produced/executed? What is the validation strategy? How will it show the goal was reached? This isn?t a technical paper, don?t focus on technical details, but rather on the research method. -------------- next part -------------- An HTML attachment was scrubbed... URL: From caterina.urban at ens.fr Thu Mar 10 08:46:35 2022 From: caterina.urban at ens.fr (Caterina Urban) Date: Thu, 10 Mar 2022 14:46:35 +0100 Subject: [TYPES/announce] SAS 2022 - First Call for Papers - Paper submission deadline: May 4th, 2022 Message-ID: -------------------------------------------------------------------------------- SAS 2022 29th Static Analysis Symposium Auckland, New Zealand, December 5th-7th, 2022 https://urldefense.com/v3/__https://2022.splashcon.org/home/sas-2022__;!!IBzWLUs!HY45afKEAFwpGIvLErPpYyHS7iEM12tCMAQO_hzjz3IOYYzoPhVRbfHXYsYZpEmrr1emXxu8Mkr3rQ$ -------------------------------------------------------------------------------- The 28th Static Analysis Symposium, SAS 2022, will be co-located with SPLASH 2022 in Auckland, New Zealand. 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 - Full paper submission: Wednesday, May 4th, 2022 (Anywhere on Earth) - Artifact submission: Wednesday, May 18th, 2022 (anywhere on earth) - Notification: Friday, July 15th, 2022 - Final version due: Friday, September 16th, 2022 - Conference: Monday, December 5th, 2022 - Wednesday, December 7th, 2022 PAPER SUBMISSION All paper submissions will be judged on the basis of significance, relevance, correctness, originality, and clarity. Submission link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=sas2022__;!!IBzWLUs!HY45afKEAFwpGIvLErPpYyHS7iEM12tCMAQO_hzjz3IOYYzoPhVRbfHXYsYZpEmrr1emXxuRDe2SeA$ We welcome regular papers as well as papers focusing on any of the following: * Experience with static analysis tools, Industrial Reports, and Case Studies * Tool papers * Brief announcements of work in progress * Well-motivated discussion of new questions or new areas. We do not impose a page limit for submitted papers but we encourage brevity as reviewers have a limited time that they can spend on each paper. With the exception of experience papers, all other papers will follow a lightweight double-blind reviewing process. 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. From tringer at cs.washington.edu Thu Mar 10 16:32:43 2022 From: tringer at cs.washington.edu (Talia Ringer) Date: Thu, 10 Mar 2022 15:32:43 -0600 Subject: [TYPES/announce] The Coq Workshop 2022: Call for Presentation Proposals Message-ID: We are pleased to invite you to submit presentation proposals for the Coq Workshop 2022, which will be held in Haifa, Israel on August 12, 2022, as part of FLoC 2022 . The Coq Workshop 2022 is affiliated with ITP 2022 , and is the 13th installment of the Coq Workshop series . The workshop brings together users, contributors, and developers of the Coq proof assistant . The Coq Workshop focuses on strengthening the Coq 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 presentations and discussions, supplemented with invited talks. *Important dates:* - May 10, 2022 (AoE): Deadline for submission of presentation proposals - June 10, 2022: Notification to authors - August 12, 2022: Workshop *Submission instructions:* Authors should submit presentation proposals as extended abstracts through EasyChair . Relevant subject matter includes but is not limited to: - Language or tactic features for Coq - Theory and implementation of the Calculus of Inductive Constructions - Applications of Coq and experience reports on Coq use in education and industry - Tools and platforms built on Coq - Plugins and libraries for Coq - Interfacing with Coq - Formalization tricks and Coq pearls *Submission format:* Presentation proposals should be no more than 2 pages in length including bibliographic references, and should use the EasyChair style with the fullpage package. All submissions must be in PDF format. *Program committee:* - ?ukasz Czajka (Technical University of Dortmund) - Emily First (University of Massachusetts Amherst) - Kesha Hietala (University of Maryland) - Shachar Itzhaky (Technion) - Xavier Leroy (Coll?ge de France and Inria) - ?rik Martin-Dorel (IRIT) - Anders M?rtberg (Stockholm University) - Karl Palmskog (KTH Royal Institute of Technology) [chair] - Cl?ment Pit-Claudel (Amazon AWS) - Vincent Rahli (University of Birmingham) - Talia Ringer (University of Illinois at Urbana-Champaign) [chair] *Organizers and contact:* Karl Palmskog and Talia Ringer (coq2022 at easychair.org) -------------- next part -------------- An HTML attachment was scrubbed... URL: From alcsc at dtu.dk Fri Mar 11 10:41:51 2022 From: alcsc at dtu.dk (Alceste Scalas) Date: Fri, 11 Mar 2022 16:41:51 +0100 Subject: [TYPES/announce] PhD scholarship in Verification of Software-Defined Networks Message-ID: DTU - Technical University of Denmark DTU Compute - Section for Software Systems Engineering We are looking for a bright and motivated PhD student for a 3-year PhD position. The research topic is the verification of Software-Defined Network configurations (details below). * Application deadline: 30 April 2022 * Expected starting date: 1 July 2022 (negotiable) * For inquiries, please contact: Alceste Scalas - https://urldefense.com/v3/__https://people.compute.dtu.dk/alcsc__;!!IBzWLUs!EavaHUD6lEGaVydZnOyXUJI3ubXPxAc8XQpC_dtrX1-BAyZtSRH1FniVh_U-MAlWyGim1H4CT8NVcQ$ * Application link with complete details: https://urldefense.com/v3/__https://www.dtu.dk/english/About/JOB-and-CAREER/vacant-positions/job?id=0907dfc3-ab0b-4985-afd2-3413e2564a83__;!!IBzWLUs!EavaHUD6lEGaVydZnOyXUJI3ubXPxAc8XQpC_dtrX1-BAyZtSRH1FniVh_U-MAlWyGim1H7zlEE6RA$ The project is financed by DTU, as part of a larger collaboration with the KTH Royal Institute of Technology in Stockholm (Sweden) and major industry partners, within the Nordic Five Tech strategic alliance between the leading Nordic technical universities: https://urldefense.com/v3/__http://www.nordicfivetech.org/__;!!IBzWLUs!EavaHUD6lEGaVydZnOyXUJI3ubXPxAc8XQpC_dtrX1-BAyZtSRH1FniVh_U-MAlWyGim1H7G_GH0EQ$ It is an excellent opportunity to be involved in advanced research on programming languages and distributed systems, with important practical applications. *PROJECT DESCRIPTION* The project goal is to develop new methods and tools to verify the correctness of Software-Defined Networking (SDN) configurations. Modern SDN-enabled network routers and switches are programmable using vendor-neutral languages and standards (such as P4 ), hence they are very powerful and flexible. Unfortunately, this power and flexibility comes at a cost: SDN configurations can be complicated, and mistakes can be costly - very simple bugs can bring whole networks and businesses offline, or compromise their privacy and security. Therefore, our research question is: can we prevent these mistakes? Can we verify the correctness of SDN configurations before they are deployed? *RESPONSIBILITIES AND QUALIFICATIONS* If you join this project, you will become a member of the DTU Compute research section on Software Systems Engineering, and you will work in close collaboration with an external supervisor at KTH. You will also join the DTU Compute PhD school and take part in its courses and activities. As part of your PhD training and research activities, you will have research stays at the Division of Theoretical Computer Science at KTH. Links: * https://urldefense.com/v3/__https://www.compute.dtu.dk/english/research/research-sections/software-systems-engineering__;!!IBzWLUs!EavaHUD6lEGaVydZnOyXUJI3ubXPxAc8XQpC_dtrX1-BAyZtSRH1FniVh_U-MAlWyGim1H5N4cXnVg$ * https://urldefense.com/v3/__https://www.compute.dtu.dk/english/phd__;!!IBzWLUs!EavaHUD6lEGaVydZnOyXUJI3ubXPxAc8XQpC_dtrX1-BAyZtSRH1FniVh_U-MAlWyGim1H55uoGScQ$ * https://urldefense.com/v3/__https://www.kth.se/cs/tcs/research__;!!IBzWLUs!EavaHUD6lEGaVydZnOyXUJI3ubXPxAc8XQpC_dtrX1-BAyZtSRH1FniVh_U-MAlWyGim1H5aRRFOgw$ Your main tasks within this project will be: * become familiar with state-of-the-art research in programming languages and formal methods; * study existing methodologies for the development of SDN setups based on use cases from the project?s industry partners; * explore new methods to ensure the correctness of such SDN setups. You will help in developing the necessary theory, and implementing new software tools based on such theory. Your duties will also include some Teaching Assistance work at DTU, and (if you wish) the co-supervision of BSc and MSc student projects related to your research. To be considered for the position, you need some familiarity with formal methods for programming languages (e.g., type systems, control flow analysis...), and you need good programming skills (preferably including functional programming). You will need to document these skills by listing the relevant university courses you took, or the relevant experience you have. It will be an advantage if you can also document some familiarity with formal methods for concurrent and distributed systems (in particular, process calculi and model checking). You must have a two-year master's degree (120 ECTS points) or a similar degree with an academic level equivalent to a two-year master's degree. You may apply prior to obtaining your master's degree, but you but cannot start the PhD position before having received it. *ASSESSMENT AND FURTHER DETAILS* The assessment of the applicants will take place around the middle of May 2022. For the application details, see: https://urldefense.com/v3/__https://www.dtu.dk/english/About/JOB-and-CAREER/vacant-positions/job?id=0907dfc3-ab0b-4985-afd2-3413e2564a83__;!!IBzWLUs!EavaHUD6lEGaVydZnOyXUJI3ubXPxAc8XQpC_dtrX1-BAyZtSRH1FniVh_U-MAlWyGim1H7zlEE6RA$ For further information and inquiries, please contact: Alceste Scalas You can read more about DTU Compute at: https://urldefense.com/v3/__https://www.compute.dtu.dk/english__;!!IBzWLUs!EavaHUD6lEGaVydZnOyXUJI3ubXPxAc8XQpC_dtrX1-BAyZtSRH1FniVh_U-MAlWyGim1H5NoqnCfg$ You can read more about the DTU Compute Research Section on Software Systems Engineering at: https://urldefense.com/v3/__https://www.compute.dtu.dk/english/research/research-sections/software-systems-engineering__;!!IBzWLUs!EavaHUD6lEGaVydZnOyXUJI3ubXPxAc8XQpC_dtrX1-BAyZtSRH1FniVh_U-MAlWyGim1H5N4cXnVg$ If you are applying from abroad, you may find useful information on working in Denmark at: https://urldefense.com/v3/__https://www.dtu.dk/english/about/job-and-career/moving-to-denmark__;!!IBzWLUs!EavaHUD6lEGaVydZnOyXUJI3ubXPxAc8XQpC_dtrX1-BAyZtSRH1FniVh_U-MAlWyGim1H4Kvr507w$ -- Alceste Scalas - https://urldefense.com/v3/__https://people.compute.dtu.dk/alcsc__;!!IBzWLUs!EavaHUD6lEGaVydZnOyXUJI3ubXPxAc8XQpC_dtrX1-BAyZtSRH1FniVh_U-MAlWyGim1H4CT8NVcQ$ Associate Professor @ DTU Compute - Section for Software Systems Engineering Technical University of Denmark Building 321, Room 010 2800 Kgs. Lyngby From beniamino.accattoli at inria.fr Fri Mar 11 12:24:54 2022 From: beniamino.accattoli at inria.fr (Beniamino Accattoli) Date: Fri, 11 Mar 2022 18:24:54 +0100 (CET) Subject: [TYPES/announce] PPDP 2022 - 1st Call for Papers Message-ID: <1282507285.17871638.1647019494596.JavaMail.zimbra@inria.fr> ========================= PPDP 2022 1st Call for Papers ========================= 24th International Symposium on Principles and Practice of Declarative Programming 20-22 September 2022, Tbilisi, Georgia https://urldefense.com/v3/__https://software.imdea.org/Conferences/PPDP2022/__;!!IBzWLUs!BnucTskVPspirP1VXiEwotPiM1gZNyW-LHtGU3nUTT60AG1F3h9o0sg9Mtt0B1m2yN457g752e1zrA$ Collocated with CLAS 2022 (including LOPSTR 2022) =================================== Important Dates --------------------- - 15.05.2022 AoE title and abstract submission - 22.05.2022 AoE paper submission - 29.06.2022 rebuttal period (48 hours) - 09.07.2022 notification - 23.07.2022 final paper - 20.09.2022 conference starts About PPDP ---------- The PPDP 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 chairs will be happy to advise on the appropriateness of a topic. Submission web page --------------------- [ https://urldefense.com/v3/__https://easychair.org/conferences/?conf=ppdp2022__;!!IBzWLUs!BnucTskVPspirP1VXiEwotPiM1gZNyW-LHtGU3nUTT60AG1F3h9o0sg9Mtt0B1m2yN457g71_zvenQ$ | https://urldefense.com/v3/__https://easychair.org/conferences/?conf=ppdp2022__;!!IBzWLUs!BnucTskVPspirP1VXiEwotPiM1gZNyW-LHtGU3nUTT60AG1F3h9o0sg9Mtt0B1m2yN457g71_zvenQ$ ] Submission Categories --------------------- For the moment, PPDP 2012 has received ACM In-Cooperation Status. The exact form of the proceedings will be communicated in the forthcoming 2nd call for papers. 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 (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. Program Committee ------------------ Beniamino Accattoli, Inria & LIX ?cole Polytechnique, France (co-chair) Manuel Hermenegildo, IMDEA Software Institute and Technical U. of Madrid, Spain (co-chair) Salvador Abreu, NOVA LINCS / University of Evora, Portugal David Baelde, ENS Rennes, IRISA, France Pierre-Evariste Dagand, IRIF - CNRS, France Marina De-Vos, University of Bath, UK Esra Erdem, Sabanci University, Turkey Guilhem Jaber, Universit? de Nantes, France Oleg Kiselyov, Tohoku University, Japan Georg Moser, University of Innsbruck, Austria Koko Muroya, RIMS, Kyoto University, Japan Gopalan Nadathur, University of Minnesota, US Kim Nguyen, Universit? Paris-Sud 11, France Carlos Olarte, LIPN, Universit? Sorbonne Paris Nord, France Ricardo Rocha, University of Porto, Portugal Filip Sieczkowski, Heriot Watt University, UK Theresa Swift, NovaLINCS, Universidade Nova de Lisboa, Portugal Benoit Valiron, LMF - CentraleSupelec, Univ. Paris Saclay, France Jan Van den Bussche, Hasselt University, Belgium German Vidal, MiST, VRAIN, Universitat Politecnica de Valencia, Spain ------------------------------------------------------------------ Organizing committee chair: Besik Dundua, Tbilisi State University, Georgia Steering committee chair: James Cheney, Edinburgh University, UK ------------------------------------------------------------------ -------------- next part -------------- An HTML attachment was scrubbed... URL: From Ian.Stark at ed.ac.uk Fri Mar 11 14:15:57 2022 From: Ian.Stark at ed.ac.uk (Ian Stark) Date: Fri, 11 Mar 2022 19:15:57 +0000 (GMT Standard Time) Subject: [TYPES/announce] Morello: Edinburgh research post on capability-based security technologies Message-ID: <17430c9-d49f-2ab7-b633-ffc32c45ae44@stark.net> Morello: Digital Security by Design Technology Platform Prototype Laboratory for Foundations of Computer Science School of Informatics The University of Edinburgh https://urldefense.com/v3/__https://www.jobs.ac.uk/job/CNK977/research-associate__;!!IBzWLUs!AcmGpSAqg3oyNnPBxTdz6H4x-95zCQckzrNCEB0AP-y-r8eK1Bv3QafOpzqF2ueTdeisIlwYa2-MHw$ Applications close 11 April 2022 at 1600 UTC We are recruiting a postdoctoral researcher 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. https://urldefense.com/v3/__https://blogs.ed.ac.uk/morello__;!!IBzWLUs!AcmGpSAqg3oyNnPBxTdz6H4x-95zCQckzrNCEB0AP-y-r8eK1Bv3QafOpzqF2ueTdeisIlwDOgO8ww$ Further information below: for full details and how to apply please visit https://urldefense.com/v3/__https://www.jobs.ac.uk/job/CNK977/research-associate__;!!IBzWLUs!AcmGpSAqg3oyNnPBxTdz6H4x-95zCQckzrNCEB0AP-y-r8eK1Bv3QafOpzqF2ueTdeisIlwYa2-MHw$ 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 takes formal references after appointment: if you have individual letters of support then please submit these as part of your initial application. This position is not restricted to UK or EU citizens and the university will assist with any visas and work permits necessary. Follow these links for more about the wider project. Morello at Edinburgh: https://urldefense.com/v3/__https://blogs.ed.ac.uk/morello__;!!IBzWLUs!AcmGpSAqg3oyNnPBxTdz6H4x-95zCQckzrNCEB0AP-y-r8eK1Bv3QafOpzqF2ueTdeisIlwDOgO8ww$ CHERI Architecture: https://urldefense.com/v3/__https://www.cheri-cpu.org__;!!IBzWLUs!AcmGpSAqg3oyNnPBxTdz6H4x-95zCQckzrNCEB0AP-y-r8eK1Bv3QafOpzqF2ueTdeisIlyVwpay_A$ Morello at Arm: https://urldefense.com/v3/__https://www.arm.com/architecture/cpu/morello__;!!IBzWLUs!AcmGpSAqg3oyNnPBxTdz6H4x-95zCQckzrNCEB0AP-y-r8eK1Bv3QafOpzqF2ueTdeisIlwkoruc9A$ Morello Software Stack: https://urldefense.com/v3/__https://www.morello-project.org__;!!IBzWLUs!AcmGpSAqg3oyNnPBxTdz6H4x-95zCQckzrNCEB0AP-y-r8eK1Bv3QafOpzqF2ueTdeisIlxBLf_cfA$ Sail Language: https://urldefense.com/v3/__https://www.cl.cam.ac.uk/*pes20/sail/__;fg!!IBzWLUs!AcmGpSAqg3oyNnPBxTdz6H4x-95zCQckzrNCEB0AP-y-r8eK1Bv3QafOpzqF2ueTdeisIlzfQ-ZjKw$ Video presentation of CHERI security architecture and Morello platform https://urldefense.com/v3/__https://youtu.be/dxDDZ5aNTNs__;!!IBzWLUs!AcmGpSAqg3oyNnPBxTdz6H4x-95zCQckzrNCEB0AP-y-r8eK1Bv3QafOpzqF2ueTdeisIlxS7BNIAg$ Digital Security by Design: https://urldefense.com/v3/__https://dsbd.tech__;!!IBzWLUs!AcmGpSAqg3oyNnPBxTdz6H4x-95zCQckzrNCEB0AP-y-r8eK1Bv3QafOpzqF2ueTdeisIlxRsx95Ag$ The only essential requirement for these positions is 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. - Knowledge of instruction-set architectures; specifically Arm A64, but RISC-V also relevant. - Experience with compiler optimization correctness or secure compilation. - Experience in formal modelling of security properties. - Knowledge of programming-language semantics and type systems. - Knowledge of program logics, program analysis, and specification. -- Ian Stark Laboratory for Foundations of Computer Science https://urldefense.com/v3/__http://homepages.ed.ac.uk/stark__;!!IBzWLUs!AcmGpSAqg3oyNnPBxTdz6H4x-95zCQckzrNCEB0AP-y-r8eK1Bv3QafOpzqF2ueTdeisIlzGaOtmXQ$ School of Informatics, University of Edinburgh ------------------------------------------------------------------------------ The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From elenam at morris.umn.edu Fri Mar 11 18:07:13 2022 From: elenam at morris.umn.edu (Elena Machkasova) Date: Fri, 11 Mar 2022 17:07:13 -0600 Subject: [TYPES/announce] TFPIE 2022 March 16 online - last call for participation Message-ID: Dear All, TFPIE 2022 invites you to attend the conference on March 16 online. The program and the registration link are posted here: https://urldefense.com/v3/__https://wiki.tfpie.science.ru.nl/TFPIE2022__;!!IBzWLUs!C1pPi5eATr9ijI8R0njNQynL8MbPAbtwSLA9-1S4t5jOGqNyFfNcg3R1TvgSo7dj6XyuZ-2OEN9osw$ Registration is free, but required for the zoom link to be sent. TFPIE is followed by TFP on March 17-18: https://urldefense.com/v3/__https://trendsfp.github.io/index.html__;!!IBzWLUs!C1pPi5eATr9ijI8R0njNQynL8MbPAbtwSLA9-1S4t5jOGqNyFfNcg3R1TvgSo7dj6XyuZ-2hbCdpqg$ The registration is the same for the two conferences. More details: The 2022 edition of Trends in Functional Programming in Education will be held *virtually on March 16th 2022*, together with TFP which will be held on March 17-18. Note that *Lambda Days* in Krakow, Poland has been rescheduled to July 28-29, and authors of TFPIE accepted papers are welcome to present their papers at the Lambda Days, in addition to the virtual presentations in March. The goal of TFPIE is to gather researchers, teachers and 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. Hope to see you there! 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!C1pPi5eATr9ijI8R0njNQynL8MbPAbtwSLA9-1S4t5jOGqNyFfNcg3R1TvgSo7dj6XyuZ-1Jt_MmrA$ Pronouns: she/her/hers or any other -------------- next part -------------- An HTML attachment was scrubbed... URL: From P.Achten at cs.ru.nl Sun Mar 13 07:09:44 2022 From: P.Achten at cs.ru.nl (Peter Achten) Date: Sun, 13 Mar 2022 12:09:44 +0100 Subject: [TYPES/announce] [Call for participation] TFPiE and TFP online events March 16-18 Message-ID: <6e46e4bf-7473-064a-04f4-32c2b291131c@cs.ru.nl> ------------------------------------------------------------------------------- ????????????? C A L L? F O R? P A R T I C I P A T I O N ?11th International Workshop on Trends in Functional Programming in Education ????????????????????????????????? + ?????????? 23rd Symposium on Trends in Functional Programming ???????????????????????? 16 - 18 March 2022 ???????????????? wiki.tfpie.science.ru.nl/TFPIE2022 ???????????????????????? trendsfp.github.io ------------------------------------------------------------------------------- The programmes for TFPIE and TFP are online (all times are UTC+0): - TFPIE: https://urldefense.com/v3/__https://wiki.tfpie.science.ru.nl/TFPIE2022__;!!IBzWLUs!CZ-_cKT4QpsPd_WsffH3n05SXNdoE_VEwV8ilRUKYv2B8oNiFAHVrnWhUnSqMET5YklD8EtbwaorIg$ - TFP:?? https://urldefense.com/v3/__https://trendsfp.github.io/schedule.html__;!!IBzWLUs!CZ-_cKT4QpsPd_WsffH3n05SXNdoE_VEwV8ilRUKYv2B8oNiFAHVrnWhUnSqMET5YklD8EsN5NuBnA$ Registration is free. Prior to the events you receive a mail with the links to the Zoom meetings. 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. We aspire to be a lively environment for presenting the latest research results, and other contributions. The Trends in Functional Programming in Education workshops are an informal meeting intended for 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. We foster a spirit of open discussion by having a review process for publication after the workshop. The program has a lot of interesting talks, possibilities for interaction, and keynote presentations: Trends in Functional Programming in Education keynote speaker: --------------------------------------------------------------- Peter Achten: The Perfect Functional Programming Course Trends in Functional Programming keynote speaker: ------------------------------------------------- Christiaan Baaij: Building a Haskell-to-Hardware compiler: Theory & Practice From gtan at cse.psu.edu Sun Mar 13 16:50:48 2022 From: gtan at cse.psu.edu (Gang (Gary) Tan) Date: Sun, 13 Mar 2022 16:50:48 -0400 Subject: [TYPES/announce] Assistant Research Professor or Postdoc position at Penn State CSE Message-ID: <4357e0c0-4d43-7973-21c1-234bd576bf33@cse.psu.edu> Applications are invited for a full-time researcher position in the Security of Software (SOS) Lab at Penn State (https://urldefense.com/v3/__http://www.cse.psu.edu/*gxt29/sos/__;fg!!IBzWLUs!GLZPey41e8fIm8YG_jhPzN--en0GyYWkGMAYnplNvuf85VolTQiKKBdn-t65LecHXLdKplwVh2wvBg$ ). The researcher will be appointed as either an assistant research professor or a postdoctoral researcher, depending on experience. 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 researcher will be provided with competitive salary and employment benefits. The initial appointment will be for one year, with an option to renew for additional years. Inquiries about the position should be directed to Dr. Gary Tan (gtan at psu.edu). Applicants should send a resume with at least two names of references. Applications will be reviewed until the position is filled. Penn State is a major research university ranked 3rd in U.S. in industry-sponsored research. The CSE department is ranked 5th 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 https://urldefense.com/v3/__http://www.cse.psu.edu/*gxt29__;fg!!IBzWLUs!GLZPey41e8fIm8YG_jhPzN--en0GyYWkGMAYnplNvuf85VolTQiKKBdn-t65LecHXLdKplwjl1kjJQ$ Tel:814-8657364 -------------- next part -------------- An HTML attachment was scrubbed... URL: From sperber at deinprogramm.de Mon Mar 14 03:09:11 2022 From: sperber at deinprogramm.de (Michael Sperber) Date: Mon, 14 Mar 2022 08:09:11 +0100 Subject: [TYPES/announce] ACM Workshop on Functional Art, Music, Modelling and Design - Call for Papers, Demos, and Performances Message-ID: =============================================================================== 10th ACM SIGPLAN International Workshop on Functional Art, Music, Modelling and Design (FARM) Call for Papers, Demos, and Performance Ljubljana, Slovenia, 16th September 2022 Deadline: June 1 https://urldefense.com/v3/__https://functional-art.org/2022/__;!!IBzWLUs!ARi96x-8vVmdRPXdu2_oTU9fQLUdsZOEp6y8OshNExwAmwRzKJz9nQWIS4fE3UgmL_x0NJI-8WbfAg$ =============================================================================== Key Dates --------- Submission deadline June 1 Author notification July 1 Workshop September 16 Call for Papers --------------- The ACM SIGPLAN International Workshop on Functional Art, Music, Modelling and Design (FARM) encourages submissions from across art, craft, and design, including textiles, visual art, music, 3D sculpture, animation, GUIs, video games, 3D printing and architectural models, choreography, poetry, and even VLSI layouts, GPU configurations, or mechanical engineering designs. Theoretical foundations, language design, implementation issues, and applications in industry or the arts are all within the scope of the workshop. In addition to the main workshop, FARM hosts a traditional evening of performances. Thus, this call encompasses both papers/demos for the workshop (and its published proceedings) as well as performance proposals for the evening's event. Authors are invited to make a single submission for each. Authors may submit both a paper/demo and performance proposal, but the submissions will be considered independently. Note on Finances ---------------- Paid registration to the FARM workshop is usually required for paper and demo submitters, but will be waived for performers. If you would have financial difficulty attending, you can apply for conference ?PAC? funds. Please get in touch for more information. Papers ------ Paper submissions are invited in three categories: - Original research - Overview / state of the art - Technology tutorial (especially tools and environments for distributed artistic workflow) Papers must be submitted via HotCRP (https://urldefense.com/v3/__https://farm22.hotcrp.com/__;!!IBzWLUs!ARi96x-8vVmdRPXdu2_oTU9fQLUdsZOEp6y8OshNExwAmwRzKJz9nQWIS4fE3UgmL_x0NJIM2Q0O6g$ ), and meet the following requirements: - 5 to 12 pages - PDF format - Adhere to the ACM SIGPLAN template Accepted papers will be published in the ACM Digital Library as part of the FARM 2022 proceedings. Authors are encouraged to submit auxiliary material for publication along with their paper (source code, data, videos, images, etc.). Authors retain all rights to the auxiliary material. Demos ----- Demo submissions should describe a demonstration and its context, connecting it with the themes of FARM. A demo could be in the form of a short (10 to 20 minute) tutorial, a presentation of work in progress, an exhibition of some work, or even a performance. Demos must be submitted via HotCRP (https://urldefense.com/v3/__https://farm22.hotcrp.com/__;!!IBzWLUs!ARi96x-8vVmdRPXdu2_oTU9fQLUdsZOEp6y8OshNExwAmwRzKJz9nQWIS4fE3UgmL_x0NJIM2Q0O6g$ ), and meet the following requirements: - 500 to 2000 words - Have a title starting with ?Demo: ? - PDF format - Adhere to the ACM SIGPLAN template (https://urldefense.com/v3/__https://www.sigplan.org/Resources/ProceedingsFormat/__;!!IBzWLUs!ARi96x-8vVmdRPXdu2_oTU9fQLUdsZOEp6y8OshNExwAmwRzKJz9nQWIS4fE3UgmL_x0NJJP_QYXIA$ ) Accepted demos will be published in the ACM Digital Library as part of the FARM 2022 proceedings. Performances ------------ FARM seeks proposals for performances which employ functional programming techniques, in whole or in part. We invite a diverse range of functionally-themed submissions including music, video, dance, and performance art. Both live performances and fixed-media submissions are welcome. We encourage risk-taking proposals that push forward the state of the art as well as refined presentations of highly developed practice. In either case, please support your submission with a clear description of your performance, including how your performance employs functional programming and a discussion of influences and prior art as appropriate. Performance proposals should be emailed to performance at functional-art.org, and must include: - A description of the performance (please be as specific as possible) - An explanation of the use of functional programming in the work - A list of technical requirements - A link to an audio or video example (YouTube, Vimeo, Bandcamp, etc.) Accepted performances will be presented at the performance evening. Workshop Organization --------------------- Workshop Chair: John Leo (Halfaya Research) Program Chair: Youyou Cong (Tokyo Institute of Technology) Performance Chair: Luka Frelih (Ljudmila Art & Science Laboratory) Publicity Chair: Michael Sperber (Active Group GmbH) Contact ------- For any questions, issues or comments, email farm-2022 at functional-art.org. From elaine.pimentel at gmail.com Mon Mar 14 06:07:59 2022 From: elaine.pimentel at gmail.com (Elaine Pimentel) Date: Mon, 14 Mar 2022 10:07:59 +0000 Subject: [TYPES/announce] =?utf-8?q?CSL=E2=80=9923_--_CALL_FOR_WORKSHOPS?= Message-ID: CSL?23 -- CALL FOR WORKSHOPS Computer Science Logic 2023 (CSL?23) will be held in Warsaw, Poland, between 13 and 16 February 2023. Following the long tradition of this event, we invite researchers and practitioners to submit proposals for co-located workshops on topics relating to mathematical logic and computer science. Workshops can target the logic in computer science community in general, focus on particular applications, or highlight more specific issues or recent developments. Co-located events will take place Friday February 17, 2023 and will be held on the same premises as the main conference. Conference facilities are offered free of charge to the organisers. Workshops-only attendees will enjoy a significantly reduced registration fee. Detailed organisational matters such as paper submission and review process, or publication of proceedings, are up to the organisers of individual workshops. All accepted workshops/tutorials will be expected to have their program ready by 17 January 2023. 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 - preferred length of workshop (between half day and one day) - estimated number of attendees - short (up to one page) description of topic - (if applicable:) pointers to previous editions of the workshop, or to similar events - The publication plan (only invited speakers, no published proceedings, pre-/post-proceedings published with EPTCS/LNCS...). Proposals are invited to be submitted by email to e.pimentel at ucl.ac.uk, no later than 20 April 2022. Selected events will be notified by 30 April 2022. The workshop selection committee consists of the CSL program chairs and the conference organisers. CSL 2023 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 November 2022. -- CSL chairs. -------------- next part -------------- An HTML attachment was scrubbed... URL: From nicolai.kraus at gmail.com Mon Mar 14 10:40:41 2022 From: nicolai.kraus at gmail.com (Nicolai Kraus) Date: Mon, 14 Mar 2022 14:40:41 +0000 Subject: [TYPES/announce] Midlands Graduate School: Accommodation and second (final) call for participation Message-ID: Dear all, I'm aware that some people interested in our spring school found that the on-campus accommodation had been booked out. I'm happy to announce that we have secured additional en-suite bedrooms on campus, just a couple of meters away from the event. Registration is still open until March 21 and bedrooms are now available again. Please forward the below advertisement to all interested students, academics, or professionals! -- Nicolai CALL FOR PARTICIPATION 22nd Midlands Graduate School (MGS'22) in the Foundations of Computing Science 10-14 April 2022, Nottingham (UK) https://urldefense.com/v3/__https://www.cs.nott.ac.uk/*psznk/events/mgs22.html__;fg!!IBzWLUs!Fd9HCGtMwtPH_qm33GXFnE5lp4ir6lTteasd3mokza5JAEUBbejSfhiJS0YsAyaRC6dfCOwgkU0kiA$ OVERVIEW MGS is an annual spring school that offers an intensive programme of lectures on the mathematical foundations of computing. While the school addresses especially PhD students in their first or second year, it is also open to UG and MSc students, postdocs, participants from the industry, and generally everyone interested in its topics. MGS'22 is the school's 22nd incarnation. PROGRAMME MGS'22 offers eight courses: - our invited course by Andrej Bauer from the University of Ljubljana - three basic courses on category theory, proof theory, and HoTT/UF with Agda, which require no previous experience - four advanced courses on topos theory, string diagrams, coalgebra, and graph transformations. REGISTRATION Participation at MGS'22 costs GBP 320. Please see the website https://urldefense.com/v3/__https://www.cs.nott.ac.uk/*psznk/events/mgs22.html__;fg!!IBzWLUs!Fd9HCGtMwtPH_qm33GXFnE5lp4ir6lTteasd3mokza5JAEUBbejSfhiJS0YsAyaRC6dfCOwgkU0kiA$ for details, point "Registration". The fee covers participation in all lectures and exercise classes, refreshments in coffee breaks and a conference dinner. Please note that you have to book accommodation yourselves but there are rooms available on campus. Places are limited and will be allocated on a first-come first-served basis. If you would like to participate, please register early to secure a place. The registration period closes as soon as all places are filled or on March 20, whichever is sooner. ORGANISATION Please direct all queries about MGS'22 to Thorsten Altenkirch and Nicolai Kraus, thorsten.altenkirch at nottingham.ac.uk nicolai.kraus at nottingham.ac.uk -------------- next part -------------- An HTML attachment was scrubbed... URL: From davide.ancona at unige.it Mon Mar 14 11:38:46 2022 From: davide.ancona at unige.it (Davide Ancona) Date: Mon, 14 Mar 2022 16:38:46 +0100 Subject: [TYPES/announce] VORTEX 2022: Call for Papers Message-ID: <3463dd49-5a18-c5e1-b8ee-9abcb67c7b59@unige.it> VORTEX 2022, Workshop co-located with ECOOP 2022, Berlin International Workshop on Verification and mOnitoring at Runtime EXecution (https://urldefense.com/v3/__https://2022.ecoop.org/home/vortex-2022__;!!IBzWLUs!DNDPLPclHFWzWWEwIQIH1Z58DDXYhv_VFJfaecNxKQ7z9E25mzO06POR9bVXDtonIw-uwgOFe9uZFw$ ) ================================================================================ 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. 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 18 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: Apr 18, 2022 * Author notification: May 2, 2022 * Early registration: May 9, 2022 * ECOOP conference: June 6-10, 2022 Proceedings ----------- Depending on the quality and number of submissions, the workshop proceedings will be published in the ACM DL, and authors of selected papers will be invited to contribute with extended versions to be included in a special issue of the Journal of Object Technology(JOT) Workshop Organizers ------------------- * Davide Ancona, Universita` di Genova, Italy * Adrian Francalanza, University of Malta, Malta Program Committee ----------------- * Wolfgang Ahrendt, Chalmers University of Technology, Sweden * Duncan Paul Attard, Reykjavik University and University of Malta, Malta * Giorgio Audrito, University of Torino, Italy * Daniela Briola, University of Milano Bicocca, Italy * Rafael C. Cardoso, University of Aberdeen, UK * Marie Farrell, Maynooth University, Ireland * Angelo Ferrando, University of Genova, Italy * Simon Fowler, University of Glasgow, Italy * Hannah Gommerstadt, Vassar College, USA * Massimo Merro, University of Verona, Italy * Laura Nenzi, University of Trieste, Italy * Srinivas Pinisetty, Indian Institute of Technology Bhubaneswar, India * Julien Signoles, CEA LIST, France * Cesar Sanchez, IMDEA Software Institute, Spain * Mark Vella, University of Malta, Malta From email at justinh.su Mon Mar 14 12:35:42 2022 From: email at justinh.su (Justin Hsu) Date: Mon, 14 Mar 2022 12:35:42 -0400 Subject: [TYPES/announce] Second CFP: MFPS 2022: Conference on Mathematical Foundations of Programming Semantics Message-ID: <12ada01b-a98a-4809-97ff-05a0d0ee88b8@www.fastmail.com> ========================================================= CALL FOR PAPERS: MFPS XXXVIII (MFPS 2022) 38th Conference on Mathematical Foundations of Programming Semantics July 11-13, 2022 Hybrid, from Ithaca, NY, USA https://urldefense.com/v3/__https://www.cs.cornell.edu/mfps-2022/__;!!IBzWLUs!BKB9IYH8iIRcdY1_clZHy-fZ1mU3rGKjLlp7vlyUqQ0Gu_tMLIeSUl1jcktPN6VizJHH2jsutJ-sLQ$ ========================================================== IMPORTANT DATES (anywhere on earth): Paper submission: April 29, 2022 Author notification: June 10, 2022 Final version due: June 24, 2022 ========================================================== We are delighted to announce the 38th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2022). While the pandemic situation is uncertain, we plan to hold a hybrid conference with the in-person event at Cornell University in Ithaca, New York. 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; process calculi; probabilistic systems; constructive mathematics; domain theory and categorical models; formal languages; formal methods; game semantics; lambda calculus; programming-language theory; quantum computation; security; topological models; logic; 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. ------------------------------------------------- INVITED SPEAKERS: Barbara K?nig, University of Duisburg--Essen Anca Muscholl, Universit? Bordeaux Daniela Petrisan, Universit? Paris Cit? Frank Pfenning, Carnegie Mellon University ------------------------------------------------- SPECIAL SESSIONS: 1. Species of Structures in Algebra, Computation, and Logic Organizer: Marcelo Fiore, University of Cambridge Organizer: Nicola Gambino, University of Leeds 2. Relational Verification and Formal Reasoning Organizer: Marco Gaboardi, Boston University 3. Algebraic Effects Organizer: Ningning Xie, University of Cambridge ------------------------------------------------- PROGRAM COMMITTEE: Sandra Alves, University of Porto Arthur Azevedo de Amorim, Boston University Lars Birkedal, Aarhus University Steve Brookes, Carnegie Mellon University Jacques Carette, McMaster University Pierre Clairambault, CNRS and ENS Lyon J?r?my Dubut, National Institute of Informatics, Tokyo Daniel Gratzer, Aarhus University Amar Hadzihasanovic, Tallinn University of Technology Masahito Hasegawa, Kyoto University Favonia, University of Minnesota Justin Hsu, Cornell University (co-chair) Achim Jung, University of Birmingham Delia Kesner, Universit? Paris-Diderot Isabella Mastroeni, Universit? di Verona Michael Mislove, Tulane University Renato Neves, Minho University Max New, University of Michigan Krishna S, IIT Bombay Taro Sekiyama; National Institute of Informatics, Tokyo Alexandra Silva, Cornell University Sam Staton, University of Oxford Christine Tasson, Sorbonne Universit? (co-chair) Maaike Zwart, IT University of Copenhagen ------------------------------------------------- MFPS ORGANIZERS: Andrej Bauer, University of Ljubljana Lars Birkedal, Aarhus University Stephen Brookes, Carnegie Mellon University Justin Hsu, Cornell University Achim Jung, University of Birmingham Catherine Meadows, Naval Research Laboratory Michael Mislove, Tulane University Jo?l Ouaknine, Max Planck Institute for Software Systems Prakash Panangaden, McGill University Alexandra Silva, Cornell University Sam Staton, University of Oxford Christine Tasson, Sorbonne Universit? ------------------------------------------------- LOCAL ORGANIZERS: Dexter Kozen, Cornell University Alexandra Silva, Cornell University ------------------------------------------------- SUBMISSION INSTRUCTIONS: Submissions should be made through EasyChair (). Papers can be at most **15 pages** long, excluding bibliography, and should be prepared using the MFPS macros (). ------------------------------------------------- PROCEEDINGS: A preliminary version will be distributed at the meeting. Final proceedings will be published in an open access journal after the meeting. ------------------------------------------------- CONTACT: For any further information about MFPS 2022, please contact the co-chairs: Justin Hsu (email at justinh.su) and Christine Tasson (christine.tasson at lip6.fr). -------------- next part -------------- An HTML attachment was scrubbed... URL: From dario.dellamonica at uniud.it Tue Mar 15 08:30:21 2022 From: dario.dellamonica at uniud.it (Dario Della Monica) Date: Tue, 15 Mar 2022 13:30:21 +0100 Subject: [TYPES/announce] GandALF 2022 -- 2nd Call For Papers Message-ID: <5bc53db9-0bc4-1d1e-0dbd-07d5f9c7bb0c@uniud.it> [apologies for cross-postings] The Thirteenth International Symposium on Games, Automata, Logics, and Formal Verification will be held in Madrid (Spain) on September 21-23, 2022. The aim of GandALF 2022 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 Abstract Submission: May 27, 2022 Paper Submission: June 3, 2022 Notification: July 24, 2022 Camera-ready: August 12, 2022 Conference: September 21-23, 2022 ? : submission, Notification and Camera-ready dates are AoE Publication 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), Acta Informatica (GandALF 2015) and Logical Methods in Computer Science (2021). Submission Submitted papers should not exceed 14 pages (excluding references and clearly marked appendices) using EPTCS format (please use the LaTeX style provided here , be unpublished and contain original research. 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 HotCRP Conference system at the following address: https://urldefense.com/v3/__https://hotcrp.software.imdea.org/gandalf2022__;!!IBzWLUs!H5un-I0F2xOXqzfZN95Tp-h8-j0T4n1DlimVYcqb23GDxWkzo0NsYum38NAXni9DQtqyweWkiuLvsA$ Invited Speakers * Wojciech Czerwi?ski , University of Warsaw, Poland * Javier Esparza , Technische Universit?t M?nchen, Germany * Dana Fisman , Ben-Gurion University, Israel * Jerzy Marcinkowski , University of Wroc?aw, Poland Program Committee Pierre Ganty? IMDEA Software Institute Spain Dario Della Monica? University of Udine Italy Christel Baier TU Dresden Germany Suguman Bansal University of Pennsylvania USA Nathalie Bertrand Inria France Filippo Bonchi University of Pisa Italy Laura Bozzelli Universit? degli Studi di Napoli Federico II Italy V?ronique Bruy?re University of Mons Belgium David de Frutos Escrig Universidad Complutense de Madrid Spain Cezara Dr?goi Informal systems Mohamed Faouzi Atig Uppsala University Sweden Adrian Francalanza University of Malta Malta Orna Kupferman The Hebrew University Israel Konstantinos Mamouras Rice University USA Roland Meyer TU Braunschweig Germany Fabio Mogavero Universit? degli Studi di Napoli Federico II Italy Paritosh Pandya IIT Bombay India Pawe? Parys University of Warsaw Poland Guillermo P?rez University of Antwerp Belgium Pierre-Alain Reynier LIS, Aix-Marseille University & CNRS France Andrea Turrini Institute of Software, Chinese Academy of Sciences China Georg Zetzsche Max Planck Institute for Software Systems (MPI-SWS) Germany ?: co-chair 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 Aalborg University Denmark -- 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:https://urldefense.com/v3/__http://users.dimi.uniud.it/*dario.dellamonica/__;fg!!IBzWLUs!H5un-I0F2xOXqzfZN95Tp-h8-j0T4n1DlimVYcqb23GDxWkzo0NsYum38NAXni9DQtqyweUKsxUeig$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From carsten at dcs.bbk.ac.uk Tue Mar 15 09:45:42 2022 From: carsten at dcs.bbk.ac.uk (carsten at dcs.bbk.ac.uk) Date: Tue, 15 Mar 2022 13:45:42 +0000 Subject: [TYPES/announce] FSCD 2024: Call for Location Message-ID: <20220315134542.Horde.KYES6bWsjVHUh-Dcatj2Ixw@webmail.dcs.bbk.ac.uk> (Apologies for multiple copies of this announcement. Please circulate.) --------------- Call for Location for FSCD 2024 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 9th FSCD International Conference to be held during the summer of 2024. 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 FLOC2022; FSCD 2023 in Rome (Italy). The deadline for proposals is *** 27th June 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. Selected proposals are to be presented at the business meeting of FSCD 2022 taking place at Haifa in August 2022. The final decision about hosting and organising of FSCD 2024 will be taken by the SC after an advisory vote of the members of the community in attendance at the business meeting. 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 session workshops/tutorials in the two days before and the two days after the main conference; = internet connectivity and workstations for demos/competitions; = catering services; = presence of professional staff. * Support for hybrid attendance to the conference. * 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 kameyama at acm.org Tue Mar 15 12:09:16 2022 From: kameyama at acm.org (Yukiyoshi Kameyama) Date: Wed, 16 Mar 2022 01:09:16 +0900 Subject: [TYPES/announce] GPCE 2022 Call for Papers Message-ID: ------------------------------------------------------------------------------- GPCE 2022: 21st International Conference on Generative Programming: Concepts & Experiences December 5-10, 2022 (co-located with SPLASH) Auckland, New Zealand, or hybrid https://urldefense.com/v3/__https://conf.researchr.org/home/gpce-2022/__;!!IBzWLUs!EieUUJLHoU3EbhOll4pAFD3HF6paaQwFSAtScplMCu9VUwVmCO7X4lfufVeojeK2fi3RI2SLkfFUBw$ ------------------------------------------------------------------------------- --------------------------- CALL FOR PAPERS --------------------------- The ACM SIGPLAN International Conference on Generative Programming: Concepts & Experiences (GPCE) 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. GPCE promotes cross-fertilization between programming languages and software development and among different styles of generative programming in its broadest sense. 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 for any GPCE topics. Full paper submissions must not exceed 12 pages excluding the bibliography. - **Short Papers** presenting unconventional ideas or new visions in any GPCE topics. Short papers do not always contain complete results as in the case of full papers, but can introduce new ideas to the community and get early feedback. Note that short papers are not intended to be position statements. Accepted short papers are included in the proceedings and will be presented at the conference. Short paper submissions must not exceed 6 pages excluding the bibliography, and must have the text "(Short Paper)" appended to their titles. - **Tool Demonstrations** presenting tools for any GPCE topics. 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 demonstration submissions must have the text "(Tool Demonstration)" appended to their titles. If they are accepted, tool descriptions will be included in the proceedings. The demonstration outline will only be used 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. --------------------------- BEST PAPER AWARD --------------------------- Following the tradition, the GPCE 2022 program committee will select the best paper among accepted papers. The authors of the best paper will be given the best paper award at the conference. --------------------------- IMPORTANT DATES --------------------------- - Abstract submission 8 August (Mon) - Paper submission 12 August (Fri) - Review notification 28 September (Wed) - Author response period 28 September (Wed) - 30 September (Fri) - Final notification 10 October (Mon) - Camera-ready 24 October (Mon) - Conference two days in 5 December (Mon) - 10 December (Sat) All times are in AoE (Anywhere on Earth). --------------------------- PAPER SUBMISSION --------------------------- Papers must be submitted using HotCRP: https://urldefense.com/v3/__https://gpce2022.hotcrp.com/__;!!IBzWLUs!EieUUJLHoU3EbhOll4pAFD3HF6paaQwFSAtScplMCu9VUwVmCO7X4lfufVeojeK2fi3RI2SFGClpkw$ All submissions must use the ACM SIGPLAN Conference Format "acmart". 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, GPCE 2022 uses the double-blind review process which has become standard across SIGPLAN conferences: - Author names, institutions, and acknowledgments should be omitted from submitted papers, and - references to the authors' own work should be in the third person. No other changes are necessary, and authors will not be penalized if reviewers are able to infer authors' identities in implicit ways. For additional information, clarification, or answers to questions, 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 (https://urldefense.com/v3/__http://www.sigplan.org/Resources/Policies/Republication/__;!!IBzWLUs!EieUUJLHoU3EbhOll4pAFD3HF6paaQwFSAtScplMCu9VUwVmCO7X4lfufVeojeK2fi3RI2Qbclbxkw$ ). --------------------------- ORGANIZATION --------------------------- - General Chair: Bernhard Scholz (University of Sydney) - Program Chair: Yukiyoshi Kameyama (University of Tsukuba) - Publicity Chair: Youyou Cong (Tokyo Institute of Technology) - Steering Committee Chair: Sebastian Erdweg (JGU Mainz) For additional information, clarification, or answers to questions, contact the program chair: kameyama at acm.org --------------------------- PROGRAM COMMITTEE --------------------------- Baris Aktemur - Intel Walter Binder - Universit? della Svizzera italiana Nicolas Biri - Luxembourg Institute of Science and Technology Elisa Gonzalez Boix - Vrije Universiteit Brussel Sheng Chen - UL Lafayette Shigeru Chiba - The University of Tokyo Youyou Cong - Tokyo Institute of Technology Coen De Roover - Vrije Universiteit Brussel Robert Gl?ck - University of Copenhagen Jeff Gray - University of Alabama Atsushi Igarashi - Kyoto University Yukiyoshi Kameyama - University of Tsukuba, Chair Raffi Khatchadourian - City University of New York (CUNY) Hunter College Julia Lawall - Inria Geoffrey Mainland - Drexel University Bruno C. d. S. Oliveira - The University of Hong Kong Klaus Ostermann - University of T?bingen Max Schaefer - GitHub Ulrik Pagh Schultz - University of Southern Denmark Sibylle Schupp - Hamburg University of Technology Amir Shaikhha - University of Edinburgh Artjoms Sinkarovs - Heriot-Watt University Daniel Str?ber - Chalmers University of Gothenburg, Radboud University Nijmegen Nicolas Stucki - EPFL Eli Tilevich - Virginia Tech Tijs van der Storm - CWI & University of Groningen Jeremy Yallop - University of Cambridge From herman at cs.ru.nl Tue Mar 15 12:20:16 2022 From: herman at cs.ru.nl (Herman Geuvers) Date: Tue, 15 Mar 2022 17:20:16 +0100 Subject: [TYPES/announce] Vacancy for an Assistant Professor in Formal Methods at the Eindhoven University of Technology (NL) Message-ID: Vacancy for an *Assistant Professor* in *Formal Methods* at the Eindhoven University of Technology, the Netherlands The Formal System Analysis group has a vacancy for an assistant professor in the field of Formal Methods. Our group studies formal techniques to model and analyse software and hardware systems. Our goal is to develop theories and techniques that are both mathematically elegant and effective in practice. Examples of this include term rewriting, modal logics, process algebras, parity games, SAT and SMT solving and symbolic state space representations. Our group maintains the well-known mCRL2 toolset, which is used in major industries and institutes, generally as a verification backend. Our group has a strong research track record and actively applies its methods in industrial contexts. For more details, including how to apply, see: https://urldefense.com/v3/__https://jobs.tue.nl/en/vacancy/assistant-professor-in-formal-system-analysis-914506.html__;!!IBzWLUs!B7Dl_ooNgvEjsyW5uzKntxRVJvJ6MeVAhNlH4WjE2KHfUMkY69tXva2FW3rzMn0e345gKKvgxrmR5g$ The deadline for application is *15 May*, 2022. Eindhoven University of Technology is a top-ranking Dutch university that combines scientific curiosity with a hands-on attitude. Our spirit of collaboration translates into an open culture and a number 1 position in collaborating with advanced industries. Fundamental knowledge enables us to design solutions for the highly complex problems of today and tomorrow. From patrick.baillot at univ-lille.fr Tue Mar 15 18:03:01 2022 From: patrick.baillot at univ-lille.fr (Patrick Baillot) Date: Tue, 15 Mar 2022 23:03:01 +0100 (CET) Subject: [TYPES/announce] postdoc position in Lille (France) on type systems and logical methods Message-ID: <1615353558.7809161.1647381781870.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 or complexity analysis for sequential, parallel or concurrent systems (e.g. for process calculi or session types); - privacy properties of programs (sensitivity analysis, differential privacy?) - typing methods for synchronous languages (e.g. static analysis and clock calculus). 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 could be June 2022. 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!HggkZOp9ERXT8-2F41p5ejd_OCyQcj_15NrgIKnkEMLkjUrNkN8aRXhksgksQmiqv_KvRf66QsSAIA$ ), which is a joint project team between Inria, CNRS and University of Lille. It belongs to the CRIStAL research center (https://urldefense.com/v3/__https://www.cristal.univ-lille.fr/en/__;!!IBzWLUs!HggkZOp9ERXT8-2F41p5ejd_OCyQcj_15NrgIKnkEMLkjUrNkN8aRXhksgksQmiqv_KvRf5_xU4NAQ$ ). The position is funded by I-site Universit? Lille Nord-Europe. Lille is a youthful and dynamic city, located in the north of France, at the crossroads of Europe, close to Paris (1h10 by train), Brussels and London. 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 applications will be reviewed as soon as they are received and until the position is filled. Patrick Baillot (https://urldefense.com/v3/__https://pro.univ-lille.fr/patrick-baillot/__;!!IBzWLUs!HggkZOp9ERXT8-2F41p5ejd_OCyQcj_15NrgIKnkEMLkjUrNkN8aRXhksgksQmiqv_KvRf7dGYLD7A$ ) From griggio at fbk.eu Wed Mar 16 03:27:29 2022 From: griggio at fbk.eu (Alberto Griggio) Date: Wed, 16 Mar 2022 08:27:29 +0100 Subject: [TYPES/announce] Formal Methods in Computer-Aided Design 2022: Second Call For Papers Message-ID: <3ad74586-4005-16ff-10dc-49a0e6639a4c@fbk.eu> (apologies for multiple copies) ======================================================================== 2022 Formal Methods in Computer-Aided Design (FMCAD): Call for Papers ======================================================================== IMPORTANT DATES --------------- Abstract Submission: May 8, 2022 Paper Submission: May 15, 2022 Author Response: June 22 - 24, 2022 Author Notification: July 1, 2022 Camera-Ready Version: August 16, 2022 All deadlines are 11:59 pm AoE (Anywhere on Earth) FMCAD Tutorial Day: Oct. 18, 2022 Regular Program: Oct. 19-21, 2022 Part of the FMCAD 2022 program: FMCAD Student Forum CONFERENCE SCOPE AND PUBLICATION -------------------------------- FMCAD 2022 is the twenty-second 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. 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://urldefense.com/v3/__https://easychair.org/conferences/?conf=fmcad2022__;!!IBzWLUs!GNYrnm2nG20-d01ZDbVaKSBIbM56nfO0_dSBuZKHw9PzR74yt1kz1S9JQSlHhFJh7JR6fwtDrqZuEA$ 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://urldefense.com/v3/__https://fmcad.or.at/pdf/copyright.pdf__;!!IBzWLUs!GNYrnm2nG20-d01ZDbVaKSBIbM56nfO0_dSBuZKHw9PzR74yt1kz1S9JQSlHhFJh7JR6fwvjzJQN4w$ . STUDENT FORUM ------------- Continuing the tradition of the previous years, FMCAD 2022 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. CO-LOCATED EVENTS ----------------- 14th International Conference on Verified Software: Theories, Tools, and Experiments (VSTTE 2022): https://urldefense.com/v3/__https://vstte22.fbk.eu/__;!!IBzWLUs!GNYrnm2nG20-d01ZDbVaKSBIbM56nfO0_dSBuZKHw9PzR74yt1kz1S9JQSlHhFJh7JR6fwvOZRdFRg$ FMCAD 2022 COMMITTEES --------------------- PROGRAM CHAIRS: Alberto Griggio Fondazione Bruno Kessler, Italy Neha Rungta Amazon Web Services, Inc., CA, USA PROGRAM COMMITTEE: Erika Abraham RWTH Aachen University Jade Alglave University College London Josh Berdine Facebook Per Bjesse Synopsys Inc. Nikolaj Bjorner Microsoft Research Roderick Bloem Graz University of Technology Supratik Chakraborty IIT Bombay Sylvain Conchon Universite Paris-Sud Vijay D'Silva Google Rayna Dimitrova CISPA Helmholtz Center for Information Security Rohit Dureja IBM Grigory Fedukovich Florida State University Arie Gurfinkel University of Waterloo Fei He Tsinghua University Alexander Ivrii IBM Barbara Jobstmann EPFL Tim King Google Kuldeep Meel National University of Singapore Sergio Mover ?cole Polytechnique Alexander Nadel Intel Aina Niemetz Stanford University Elizabeth Polgreen University of California Berkeley Rahul Purandare IIT-Delhi Andrew Reynolds University of Iowa Marco Roveri Universit? di Trento Kristin Yvonne Rozier Iowa State University Philipp Ruemmer Uppsala University Cristoph Scholl University of Freiburg Natasha Sharygina USI Lugano Elena Sherman University of Iowa Sharon Shoham Tel Aviv University Anna Slobodova Intel Christoph Sticksel The Mathworks Michael Tautschnig AWS Nestan Tsiskaridze Stanford University Yakir Vizel Technion Georg Weissenbacher Vienna University of Technology Michael Whalen Amazon Web Services, Inc. STUDENT FORUM CHAIR: Mathias Preiner Stanford University, CA, USA SPONSORSHIP AND WEB CHAIR: Martin Jon?? Fondazione Bruno Kessler, Italy PUBLICATION CHAIR: Georg Weissenbacher TU Wien FMCAD STEERING COMMITTEE: Clark Barrett Stanford University, CA, USA Armin Biere University of Freiburg, Germany Anna Slobodova Intel Corporation, TX, USA Georg Weissenbacher TU Vienna, Austria -- -- Le informazioni contenute nella presente comunicazione sono di natura? privata e come tali sono da considerarsi riservate ed indirizzate? esclusivamente ai destinatari indicati e per le finalit? strettamente? legate al relativo contenuto. Se avete ricevuto questo messaggio per? errore, vi preghiamo di eliminarlo e di inviare una comunicazione? all?indirizzo e-mail del mittente. -- The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. If you received this in error, please contact the sender and delete the material. From caterina.urban at ens.fr Thu Mar 17 04:15:57 2022 From: caterina.urban at ens.fr (Caterina Urban) Date: Thu, 17 Mar 2022 09:15:57 +0100 Subject: [TYPES/announce] =?utf-8?q?FLoC_2022_Mentoring_Workshop=3A_Call_?= =?utf-8?q?for_Scholarship_Applications_=E2=80=94_deadline_on_April_11th?= Message-ID: <2EAEDA9F-811E-4082-83AD-9518FFCDB88C@ens.fr> FLoC 2022 Mentoring Workshop (FLoC'22 MW) https://urldefense.com/v3/__https://www.floc2022.org/flocmentoringworkshop__;!!IBzWLUs!GgwIJo-9BRxoBJtvNmZnmUcXyxnis0ZkmWUYVttq0u5tBKHhdZYSkHrrt0tFo5Kmmf0WQ2rpnNfytQ$ 1 August 2022 and 5 August 2022 Haifa, Israel We warmly invite students to apply for travel scholarships to attend the Mentoring Workshop and FLoC. The deadline for applications is April 11th. Applications are received via the form at https://urldefense.com/v3/__https://forms.gle/QxWmYcvQCPgXRxEq6__;!!IBzWLUs!GgwIJo-9BRxoBJtvNmZnmUcXyxnis0ZkmWUYVttq0u5tBKHhdZYSkHrrt0tFo5Kmmf0WQ2rLQ9aVBA$ ABOUT THE MENTORING WORKSHOP The purpose of the FLoC 2022 Mentoring Workshop (FLoC'22 MW) is to provide mentoring and career advice to early-stage graduate students, to attract them to pursue research careers in various logic-related areas. The workshop will particularly encourage participation of women and under-represented minorities. There will be two workshop days, one for each FLoC Conference Block, so the students can choose which one of the two they prefer to attend. The workshop program will include a number of talks and interactive sessions. The talks will give an overview of the field along with brief introductions to the varied topics highlighted at FLoC. Other talks will provide mentoring and career advice, from academia and industry. CONFIRMED SPEAKERS Mentoring Workshop for FLoC Conference Block 1 (Friday, August 5th, 2022) TBA (check the website for updates!) Mentoring Workshop for FLoC Conference Block 2 (Friday, August 5th, 2022) Rajeev Alur, University of Pennsylvania, USA Kristin Rozier, Iowa State University, USA Natarajan Shankar, SRI, USA Alexandra Silva, Cornell University, USA CONTACT In case of questions, please contact the Mentoring Workshop co-chairs: Sandra Kiefer Marijana Lazi? Caterina Urban > -------------- next part -------------- An HTML attachment was scrubbed... URL: From Clement.Aubert at math.cnrs.fr Thu Mar 17 16:57:17 2022 From: Clement.Aubert at math.cnrs.fr (=?UTF-8?Q?Cl=c3=a9ment_Aubert?=) Date: Thu, 17 Mar 2022 16:57:17 -0400 Subject: [TYPES/announce] CfP: 15th Interaction and Concurrency Experience (ICE 2022) Message-ID: *** We apologize for possible cross posting *** ?????????????????????????????? ICE 2022 ???????????? 15th Interaction and Concurrency Experience ???????????????????????????? 17 June 2022 ????? IMT School for Advanced Studies Lucca, Italy and/or online ???????????????? Satellite workshop of DisCoTec 2022 ????????????????? https://www.discotec.org/2022/ice ?????????????????????????? Submission link: ??? https://openreview.net/group?id=DisCoTec.org/2022/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: Matthew Parkinson (Microsoft Research, UK) + TBA === IMPORTANT DATES === ??? * 11 April 2022: abstract submission ??? * 15 April 2022: paper submission ??? * 23 May 2022: notification ??? * 17 June 2022: ICE workshop ??? * 12 July 2022: 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/2022/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 === ??? * Cl?ment Aubert (Augusta University, USA) - aubert (at) math.cnrs.fr ??? * Cinzia Di Giusto (Universit? C?te d?Azur, CNRS, I3S, FR) - cinzia.di-giusto (at) unice.fr ??? * Larisa Safina (Inria, FR) - larisa.safina (at) inria.fr ??? * Alceste Scalas (Technical University of Denmark, DK) - alcsc (at) dtu.dk === PROGRAM COMMITTEE === ??? * Duncan Paul Attard (Reykjav?k University, IS) ??? * Massimo Bartoletti (Universit? di Cagliari, IT) ??? * Davide Basile (ISTI CNR, IT) ??? * H?l?ne Coullon (IMT Atlantique, FR) ??? * Alex Coto (Gran Sasso Science Institute, IT) ??? * H?l?ne Coullon (IMT Atlantique, FR) ??? * Jovana Dedei? (Faculty of Technical Sciences, University of Novi Sad, RS) ??? * Simon Fowler (University of Glasgow School of Computing Science, GB-SCT) ??? * Saverio Giallorenzo (University of Bologna, IT) ??? * Ludovic Henrio (CNRS, FR) ??? * Keigo Imai (Gifu University, JP) ??? * Sung-Shik Jongmans (Open University of the Netherlands, NL) ??? * Ivan Lanese (University of Bologna, IT) ??? * Julien Lange (Royal Holloway, University of London, GB) ??? * Sergue? Lenglet (Universit? de Lorraine, FR) ??? * Diego Marmsoler (University of Exeter, GB) ??? * Doriana Medi? (University of Turin, IT) ??? * Marco Peressotti (University of Southern Denmark, DK) ??? * Kirstin Peters (Technischen Universit?t Darmstadt, GE) ??? * Ivan Proki? (Faculty of Technical Sciences, University of Novi Sad, RS) ??? * Matteo Sammartino (Royal Holloway, University of London, GB) ??? * Amrita Suresh (ENS Paris Saclay, FR) === 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 (Evidence Srl, IT) === MORE INFORMATION === For additional information, please contact: ice22 at googlegroups.com -- Cl?ment Aubert, Assistant Professor of Computer Science, School of Computer and Cyber Sciences, Augusta University, https://spots.augusta.edu/caubert/ -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_0x3BDD37F5437DD153.asc Type: application/pgp-keys Size: 3104 bytes Desc: OpenPGP public key URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_signature Type: application/pgp-signature Size: 840 bytes Desc: OpenPGP digital signature URL: From stefan at szeider.net Fri Mar 18 10:26:55 2022 From: stefan at szeider.net (Stefan Szeider) Date: Fri, 18 Mar 2022 15:26:55 +0100 Subject: [TYPES/announce] MFCS 2022 - Second Call for Papers Message-ID: <2EDF6C96-027A-43D7-BE57-90DCE2AC4266@szeider.net> MFCS 2022 - SECOND CALL FOR PAPERS The 47th International Symposium on Mathematical Foundations of Computer Science, August 22-26, 2022, Vienna, Austria https://urldefense.com/v3/__https://www.ac.tuwien.ac.at/mfcs2022/__;!!IBzWLUs!DOXaVuvQL4PcMNYadYYc7qDBamh9JnNQ9TWf3ljhmocHsbJebcKhqgfAtbVfZNOhN1ZL3cRvEMhc-Q$ The MFCS conference series on Mathematical Foundations of Computer Science is a high-quality venue for original research in all branches of Theoretical Computer Science. MFCS is among the conferences with the longest history in the field - the first conference in the series was held already in 1972. Traditionally, the conference moved between the Czech Republic, Slovakia, and Poland, while since 2013, the conference has traveled around Europe. In 2022, at its 50th anniversary, MFCS will be held in Vienna, Austria. MFCS 2022 will be co-located with MATCH-UP 2022 (https://urldefense.com/v3/__https://www.ac.tuwien.ac.at/matchup2022/__;!!IBzWLUs!DOXaVuvQL4PcMNYadYYc7qDBamh9JnNQ9TWf3ljhmocHsbJebcKhqgfAtbVfZNOhN1ZL3cRTrtGrzA$ ), the 6th Workshop on Matching Under Preferences. Barring substantial and unforeseen developments, MFCS will be organized as a physical event. At least one author of each accepted paper must register at the conference. Authors who cannot physically attend the conference will be given the option to present their results via a live video talk. INVITED SPEAKERS Fedor V. Fomin (University of Bergen) Monika Henzinger (University of Vienna) Thomas Henzinger (IST Austria) Marta Kwiatkowska (University of Oxford) Vijay Vazirani (University of California, Irvine) IMPORTANT DATES Abstract Deadline: Friday, April 22, 2022 (Anywhere on Earth) Submission Deadline: Wednesday, April 27, 2022 (Anywhere on Earth) Notification: Tuesday, June 21, 2022 Conference: August 22-26, 2022 SUBMISSION GUIDELINES Papers should be submitted electronically through EasyChair at https://urldefense.com/v3/__https://easychair.org/conferences/?conf=mfcs2022__;!!IBzWLUs!DOXaVuvQL4PcMNYadYYc7qDBamh9JnNQ9TWf3ljhmocHsbJebcKhqgfAtbVfZNOhN1ZL3cTp3UGkng$ Submissions should be formatted using the LIPIcs style with a length not exceeding 12 pages (excluding references and an optional appendix). References and an optional appendix can go beyond the 12 pages; the appendix will be consulted at the discretion of the program committee. It is mandatory to use the LIPIcs style for submissions. No prior publication or simultaneous submission to other conferences or journals are allowed (except preprint repositories such as arXiv or workshops without formal published proceedings). PUBLICATION As in previous years, MFCS 2022 proceedings will be published in LIPIcs (Leibniz International Proceedings in Informatics) under an open-access license. LIST OF TOPICS We encourage submission of original research papers in all areas of theoretical computer science, including (but not limited to) the following: - algebraic and co-algebraic methods in computer science - algorithms and data structures - automata and formal languages - bioinformatics - combinatorics on words, trees, and other structures - computational complexity (structural and model-related) - computational geometry - computer-aided verification - computer assisted reasoning - concurrency theory - cryptography and security - cyber physical systems, databases and knowledge-based systems - formal specifications and program development - foundations of computing - logics in computer science - mobile computing - models of computation - networks - parallel and distributed computing - quantum computing - semantics and verification of programs - theoretical issues in artificial intelligence and machine learning - types in computer science PROGRAM COMMITTEE Christoph Berkholz (Humboldt-Universit?t zu Berlin) Ren? van Bevern (Huawei Technologies) Olaf Beyersdorff (Friedrich Schiller University Jena) Filippo Bonchi (Computer Science Department, University of Pisa) Andrei Bulatov (Simon Fraser University) Ugo Dal Lago (Universit? di Bologna and INRIA Sophia Antipolis) Laure Daviaud (City, University of London) Anuj Dawar (University of Cambridge) Stefan Felsner (TU Berlin) Celina Figueiredo (UFRJ) Nathana?l Fijalkow (CNRS, LaBRI, University of Bordeaux) Marie Fortin (University of Liverpool) Robert Ganian (TU Wien, co-chair) Petr Golovach (Department of Informatics, Bergen University) Gregory Gutin (Royal Holloway, University of London) Sara Kalvala (The University of Warwick) Sandra Kiefer (RWTH Aachen University) Eun Jung Kim (CNRS - Paris Dauphine) Du?an Knop (Czech Technical University in Prague) Martin Koutecky (Charles University in Prague) Martin Lange (University of Kassel) Massimo Lauria (Sapienza University of Rome) Karoliina Lehtinen (University of Liverpool) Meena Mahajan (The Institute of Mathematical Sciences, HBNI, Chennai) Konstantinos Mamouras (Rice University) Barnaby Martin (Durham University) George Mertzios (Durham University) Stefan Milius (FAU Erlangen) Neeldhara Misra (Indian Institute of Technology, Gandhinagar) Fabrizio Montecchiani (University of Perugia) Sebastian Ordyniak (The University of Sheffield) Sang-il Oum (Institute for Basic Science (IBS) and KAIST) Daniel Paulusma (Durham University) Daniela Petrisan (Universit? de Paris, IRIF) Micha? Pilipczuk (University of Warsaw) Damien Pous (CNRS - ENS Lyon) Simon Puglisi (University of Helsinki) Pawe? Rz??ewski (Warsaw University of Technology) Alexandra Silva (Cornell University, co-chair) Friedrich Slivovsky (Vienna University of Technology) Ana Sokolova (University of Salzburg) Stefan Szeider (TU Wien, general chair) Hellis Tamm (Tallinn University of Technology) Florian Zuleger (TU Wien) ORGANIZING COMMITTEE Jan Dreier (TU Wien) Robert Ganian (TU Wien) Stefan Szeider (TU Wien) From radu.iosif at univ-grenoble-alpes.fr Fri Mar 18 10:53:07 2022 From: radu.iosif at univ-grenoble-alpes.fr (RADU IOSIF) Date: Fri, 18 Mar 2022 15:53:07 +0100 (CET) Subject: [TYPES/announce] Workshop on Advances in Separation Logics (ASL 2022 @ FLOC 2022) Message-ID: <223327438.493956.1647615187022.JavaMail.zimbra@univ-grenoble-alpes.fr> Workshop on Advances in Separation Logics (ASL 2022), Haifa, Israel, July 31st 2022 https://urldefense.com/v3/__https://asl-workshop.github.io/asl22/__;!!IBzWLUs!EztEPnhuKPAQrOR7P_fFBvMXdE76sjXct3jWMrvZIXWiGaJi5oUkqmOsEuOlZdjaHs-NONstGuuTsg$ The past two decades have witnessed important progress in static analysis and verification of code with low-level pointer and heap manipulations, mainly due to the development of Separation Logic (SL). SL is a resource logic, a dialect of the logic of Bunched Implications (BI) designed to describe models of the heap memory and the mutations that occur in the heap as the result of low-level pointer updates. The success of SL in program analysis is due to the support for local reasoning, namely the ability of describing only the resource(s) being modified, instead of the entire state of the system. This enables the design of compositional analyses that synthesize specifications of the behavior of small parts of the program before combining such local specifications into global verification conditions. Another interesting line of work consists in finding alternatives to the underlying semantic domain of SL, namely heaps with aggregative composition, in order to address other fields in computing, such as self-adapting distributed networks, blockchain and population protocols, social networks or biological systems. We consider submissions on topics including: * decision procedures for SL and other resource logics, * computational complexity of decision problems such as satisfiability, entailment and abduction for SL and other resource logics, * axiomatisations and proof systems for automated or interactive theorem proving for SL and other resource logics, * verification conditions for real-life interprocedural and concurrent programs, using SL and other resource logics, * alternative semantics and computation models based on the notion of resource, * application of separation and resource logics to different fields, such as sociology and biology. ASL 2022 is a workshop affiliated to IJCAR 2022 at FLOC 2022. Keynote Speakers * Philippa Gardner, Imperial College London * Ralf Jung, MIT CSAIL Important Dates * Papers due: May 10, 2022 (AoE) * Authors notification: June 15, 2022 (AoE) * Workshop: July 31, 2022 Program Committee Nadia Polikarpova (UCSD, San Diego, USA) James Brotherston (UCL, London, UK) Qinxiang Cao (Shanghai Jiaotong University) Dan Frumin (University of Groningen, The Netherlands) Lennart Beringer (Princeton University, USA) Arthur Chargu?raud (INRIA Strasbourg, France) Radu Iosif (Verimag, CNRS, Univ. Grenoble Alpes, France) Le Quang Loc (UCL, London, UK) Alessio Mansutti (University of Oxford, UK) Christoph Matheja (DTU, Lyngby, Denmark) Daniel M?ry (University of Loraine, France) Koji Nakazawa (Nagoya University, Japan) Nicolas Peltier (LIG, CNRS, Grenoble, France) Adam Rogalewicz (Brno University of Technology, Czech Republic) Mihaela Sighireanu (LMF, ENS Paris-Saclay, France) Florian Zuleger (Vienna University of Technology, Austria) Organizing committee Radu Iosif (Verimag, CNRS, Univ. Grenoble Alpes, France) Nikos Gorogiannis (Meta, London, UK) Robbert Krebbers (Radboud Univ. Nijmegen, The Netherlands) Mihaela Sighireanu (LMF, ENS Paris-Saclay, France) Makoto Tatsuta (NII, Tokyo, Japan) Thomas Noll (RWTH, Aachen, Germany) From ariola at cs.uoregon.edu Fri Mar 18 11:35:44 2022 From: ariola at cs.uoregon.edu (Zena Matilde Ariola) Date: Fri, 18 Mar 2022 08:35:44 -0700 Subject: [TYPES/announce] OPLSS 2022 Message-ID: <4DB3519E-E0B8-47ED-B058-8CCE707FE664@cs.uoregon.edu> We are pleased to announce the program for the 20th annual Oregon Programming Languages Summer School (OPLSS) to be held from June 20th to July 2nd, 2022 at the University of Oregon in Eugene. We are looking forward to getting together in person for our 20th anniversary! The registration deadline is April 10th, 2022. Full information on registration, scholarships and COVID-19 regulations can be found here: https://urldefense.com/v3/__http://www.cs.uoregon.edu/Activities/summerschool__;!!IBzWLUs!AdfSzyyxJwY5g4M9m2M5xxYy0xfvDUYRjJj00DnJnSTi0RkSDNzPUVIS9YqFOvc_w1J_eu2FOfWRXg$ The program is as follows: Thorsten Altenkirch - University of Nottingham Introduction to Type Theory Stephanie Balzer - Carnegie Mellon University Session-Typed Concurrent Programming Adam Chlipala - Massachusetts Institute of Technology >From Type Theory to End-to-End Proof of Realistic Systems Pierre-Louis Curien - Institut de Recherche en Informatique Fondamentale Game semantics Paul Downen - University of Massachusetts, Lowell Abstract machines and classical realizability Silvia Ghilezan - University of Novi Sad Rewriting and termination in lambda calculus Jeremy Gibbons - University of Oxford Algebra of Programming Robert Harper - Carnegie Mellon University Introduction to the theory of Logical Relations Sam Lindley - The University of Edinburgh Effect Handler Oriented Programming Frank Pfenning - Carnegie Mellon University Introduction to Proof Theory Stephanie Weirich - University of Pennsylvania Implementing Dependent Types in pi-forall Steve Zdancewic - University of Pennsylvania Formal Verification of Monadic Computations You can find the description of each course here: https://urldefense.com/v3/__https://www.cs.uoregon.edu/research/summerschool/summer22/topics.php__;!!IBzWLUs!AdfSzyyxJwY5g4M9m2M5xxYy0xfvDUYRjJj00DnJnSTi0RkSDNzPUVIS9YqFOvc_w1J_eu3VDqO1Xg$ We hope to see you in Eugene for this excellent program. Paul, Marco and Zena -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: logo-small.png Type: image/png Size: 20102 bytes Desc: not available URL: From jeremy.yallop at cl.cam.ac.uk Fri Mar 18 12:15:11 2022 From: jeremy.yallop at cl.cam.ac.uk (Jeremy Yallop) Date: Fri, 18 Mar 2022 16:15:11 +0000 Subject: [TYPES/announce] Postdoctoral researcher: opening at the University of Cambridge Message-ID: <316c6db5-d24f-4cbf-ae1d-d24c06ade190@www.fastmail.com> We have an opening at the University of Cambridge for a postdoctoral researcher on the Modular Macros project, which extends OCaml with new language features for typed compile-time computation. More details and an application form can be found here: https://urldefense.com/v3/__https://www.jobs.cam.ac.uk/job/34041/__;!!IBzWLUs!GGG2mZx7DnS32kq_n0gkei2Sk6I7SHEyYH5Jf16e8lp-jk46ADeWHQ-r5u8arLxAlkE-FmSYZC6xFA$ -------------------------------------------------------------------------------- Applications are invited for a Research Assistant/Associate to join the Modular Macros project. The Modular Macros project brings new language features for typed, hygienic, compile-time computation to OCaml, making it possible for programmers to write high-level abstract libraries that generate efficient low-level code. Our design builds on a long tradition of work in multi-stage programming, taking inspiration from languages such as MetaML, MetaOCaml and Typed Template Haskell, and integrating smoothly with existing OCaml features, such as its advanced module system. We'll port existing multi-staged libraries and develop new applications that combine high-level abstractions with outstanding performance. The position will involve working with Modular Macros project members at the University of Cambridge and industrial partners including Jane Street Capital to develop, formalise and implement the design of Modular Macros. 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: - Programming language design and formalisation - Implementation of programming languages, broadly construed (including compilers, interpreters, proof assistants, static analysers and language tools) Informal enquiries are welcome and should be directed to Dr Jeremy Yallop (jeremy.yallop at cl.cam.ac.uk) -------------- next part -------------- An HTML attachment was scrubbed... URL: From andreeac at comp.nus.edu.sg Sun Mar 20 23:32:47 2022 From: andreeac at comp.nus.edu.sg (Andreea Costea) Date: Mon, 21 Mar 2022 11:32:47 +0800 Subject: [TYPES/announce] OOPSLA 2022 - Round 2 CFP Message-ID: <1eadb961a901cadaff11532ce33761ec@comp.nus.edu.sg> Round 2 paper submission deadline due on ** April 15th, 2022 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) December 5-10, 2022, Auckland, New Zealand https://urldefense.com/v3/__https://2022.splashcon.org/track/splash-2022-oopsla__;!!IBzWLUs!BrC1OfINTy3fytodWFjy-lB-0AMSHpPQd04DkIaWUjGzGKql6SEdyhwpbMNaE1j0UXXn_78jrkO8jA$ ======================================================================== ### Important dates 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 in this edition] 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 in the 2022 volume of 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. Papers with a Revise outcome in Round 2 and an Accept outcome in the subsequent Round 1 will appear in the 2023 volume of PACMPL(OOPSLA). *Reject*: Rejected papers will not be included in the 2022 volume of 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!BrC1OfINTy3fytodWFjy-lB-0AMSHpPQd04DkIaWUjGzGKql6SEdyhwpbMNaE1j0UXXn_78Vd1ijEw$ ). 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!BrC1OfINTy3fytodWFjy-lB-0AMSHpPQd04DkIaWUjGzGKql6SEdyhwpbMNaE1j0UXXn_79RE0kh2A$ ). 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!BrC1OfINTy3fytodWFjy-lB-0AMSHpPQd04DkIaWUjGzGKql6SEdyhwpbMNaE1j0UXXn_793fQtf7Q$ ). 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!BrC1OfINTy3fytodWFjy-lB-0AMSHpPQd04DkIaWUjGzGKql6SEdyhwpbMNaE1j0UXXn_7-004UNOA$ ). ### 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!BrC1OfINTy3fytodWFjy-lB-0AMSHpPQd04DkIaWUjGzGKql6SEdyhwpbMNaE1j0UXXn_78jrkO8jA$ From bennovdberg at gmail.com Mon Mar 21 07:01:34 2022 From: bennovdberg at gmail.com (Benno van den Berg) Date: Mon, 21 Mar 2022 12:01:34 +0100 Subject: [TYPES/announce] PhD position on Homotopy Type Theory Message-ID: Dear all, At the University of Amsterdam we are looking for a PhD student who wants to work on homotopy type theory (preferred starting date 1 September 2022). The advertisement can be found here: https://urldefense.com/v3/__https://vacatures.uva.nl/UvA/job/PhD-in-Homotopy-Type-Theory/743389302/__;!!IBzWLUs!AC931FIUstCFopG2MMDT2agBUKk7dcV8cJIaRl9eGevkzv56vtUizrG8uaBIQZUjLet0MXnOgqL3UA$ Please feel free to forward this to potential candidates, who in turn should feel free to contact me. Let me also remind you that there is also this position: https://urldefense.com/v3/__https://vacatures.uva.nl/UvA/job/PhD-in-Mathematical-and-Computational-Logic/742421702/__;!!IBzWLUs!AC931FIUstCFopG2MMDT2agBUKk7dcV8cJIaRl9eGevkzv56vtUizrG8uaBIQZUjLet0MXlMAOS7BA$ where students who want to work with me on topics related to category theory and type theory can also apply. Best wishes, Benno -------------- next part -------------- An HTML attachment was scrubbed... URL: From wjb at williamjbowman.com Mon Mar 21 14:30:38 2022 From: wjb at williamjbowman.com (William J. Bowman (PLDI Publicity Chair)) Date: Mon, 21 Mar 2022 11:30:38 -0700 Subject: [TYPES/announce] Call for Participation PLDI 2022 Message-ID: Call for Participation for PLDI 2022, the ACM SIGPLAN Conference on Programming Language Design and Implementation! ------------------------------------------------------------------------ PLDI is a premier forum for programming language research, broadly construed, including design, implementation, theory, applications, and performance. Come join us, online or in San Diego, to discuss the latest programming languages research! * Website : https://urldefense.com/v3/__https://pldi22.sigplan.org/attending/Registration__;!!IBzWLUs!BgqHCxuZbnX0a3YeGYb1sd-7rMRZGUjH14GZUIaDqJotPF7qYxy7F1vG7-7Avlp1NvZQ8jWToL_PPQ$ * Time : 13th--17th June 2022 * Place : Catamaran Resort in San Diego, California, USA + online option, comprising live streamed talks + Q&A and social interaction and events on ?gather.town?. ### Important dates: * Early Registration: On or before 16 May, 2022 ### Important rates: Registration rates (in-person) On or before 16 May, 2022 After 16 May, 2022 Regular (ACM or SIGPLAN member) $650 $750 Regular (non-member) $725 $825 Student (ACM or SIGPLAN member) $350 $450 Student (non-member) $425 $500 Registration rates (virtual) On or before 16 May, 2022 After 16 May, 2022 Regular (ACM or SIGPLAN member) $150 $175 Regular (non-member) $175 $200 Student (ACM or SIGPLAN member) $100 $125 Student (non-member) $125 $150 ### Co-located events: Co-located Conferences: - ISMM, ACM SIGPLAN International Symposium on Memory Management https://urldefense.com/v3/__https://conf.researchr.org/home/ismm-2022__;!!IBzWLUs!BgqHCxuZbnX0a3YeGYb1sd-7rMRZGUjH14GZUIaDqJotPF7qYxy7F1vG7-7Avlp1NvZQ8jXMnIpuzA$ - LCTES, ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, and Tools for Embedded Systems https://urldefense.com/v3/__https://pldi22.sigplan.org/track/LCTES-2022__;!!IBzWLUs!BgqHCxuZbnX0a3YeGYb1sd-7rMRZGUjH14GZUIaDqJotPF7qYxy7F1vG7-7Avlp1NvZQ8jW0EsCfYw$ Workshops: - ARRAY, the Array Programming Workshop https://urldefense.com/v3/__https://pldi22.sigplan.org/home/ARRAY-2022__;!!IBzWLUs!BgqHCxuZbnX0a3YeGYb1sd-7rMRZGUjH14GZUIaDqJotPF7qYxy7F1vG7-7Avlp1NvZQ8jUZom0oEw$ - EGRAPH, the E-Graph Research, Applications, Practices, and Human-factors Symposium https://urldefense.com/v3/__https://pldi22.sigplan.org/home/egraphs-2022__;!!IBzWLUs!BgqHCxuZbnX0a3YeGYb1sd-7rMRZGUjH14GZUIaDqJotPF7qYxy7F1vG7-7Avlp1NvZQ8jXn098U2w$ - INFER, the Infer Practitioners Workshop https://urldefense.com/v3/__https://pldi22.sigplan.org/home/infer-2022__;!!IBzWLUs!BgqHCxuZbnX0a3YeGYb1sd-7rMRZGUjH14GZUIaDqJotPF7qYxy7F1vG7-7Avlp1NvZQ8jW8WeGqvg$ - MAPS, the Annual Symposium on Machine Programming https://urldefense.com/v3/__https://pldi22.sigplan.org/home/maps-2022__;!!IBzWLUs!BgqHCxuZbnX0a3YeGYb1sd-7rMRZGUjH14GZUIaDqJotPF7qYxy7F1vG7-7Avlp1NvZQ8jX_38Kl8w$ - PLMW, the Programming Language Mentoring Workshop https://urldefense.com/v3/__https://pldi22.sigplan.org/track/PLMW-PLDI-2022__;!!IBzWLUs!BgqHCxuZbnX0a3YeGYb1sd-7rMRZGUjH14GZUIaDqJotPF7qYxy7F1vG7-7Avlp1NvZQ8jXRl-34xw$ - SOAP, the ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis https://urldefense.com/v3/__https://pldi22.sigplan.org/home/SOAP-2022__;!!IBzWLUs!BgqHCxuZbnX0a3YeGYb1sd-7rMRZGUjH14GZUIaDqJotPF7qYxy7F1vG7-7Avlp1NvZQ8jUyJk7yJQ$ Tutorials: https://urldefense.com/v3/__https://pldi22.sigplan.org/track/pldi-2022-tutorials__;!!IBzWLUs!BgqHCxuZbnX0a3YeGYb1sd-7rMRZGUjH14GZUIaDqJotPF7qYxy7F1vG7-7Avlp1NvZQ8jVb7rOqtA$ - Build your own optimizer with egg! Max Willsey, Zachary Tatlock - Discover[i]: Taming Unbounded Distributed Systems with Modular, Bounded Reasoning Roopsha Samanta, Nouraldin Jaber, Christopher Wagner - Filling the gap between the JavaScript language specification and tools using the JISET family Sukyoung Ryu, Jihyeok Park, Seungmin An - Making C Programs Safer with Checked C Jie Zhou, Michael Hicks, John Criswell - Reasoning About and Discovering LLVM Optimizations John Regehr, Nuno P. Lopes Student Research Competition! - https://urldefense.com/v3/__https://pldi22.sigplan.org/track/pldi-2022-SRC__;!!IBzWLUs!BgqHCxuZbnX0a3YeGYb1sd-7rMRZGUjH14GZUIaDqJotPF7qYxy7F1vG7-7Avlp1NvZQ8jX3KYmKUg$ From antonios at ru.is Tue Mar 22 17:19:02 2022 From: antonios at ru.is (Antonios Achilleos) Date: Tue, 22 Mar 2022 21:19:02 +0000 Subject: [TYPES/announce] The Logic Colloquium 2022 Message-ID: The Logic Colloquium 2022 will take place from June 27 to July 1, 2022 at Reykjavik University, in Iceland. The deadline to submit abstracts is quite soon, on 24/3. The website is: https://urldefense.com/v3/__http://icetcs.ru.is/lc2022/__;!!IBzWLUs!AZpiW0NAswHwxbTo8z-aur5bZ7AbJPgRnMmyxdo7snv8EhOdbPt2R2UH2a5ZEts15lSYivQJ3JqMPQ$ **************************************** The Logic Colloquium is the European Summer Meeting of the Association for Symbolic Logic, that in 2022 will be held from the 27th of June to the 1st of July 2022 at Reyjavik University, Iceland. We encourage you to submit abstracts for contributed talks. Call for Papers The deadline for contributed talk submissions and for student travel grants applications is March 24, 2022. Contributed talks Abstracts for contributed talks should conform to the Rules for Abstracts of the ASL, and should be sent to asl at uconn.edu. Online contributed talks are welcome and we will do our best to make this event hybrid, although we of course encourage you to come to Iceland (see the travel information) to meet the community. Topics of interest include: Set Theory Proof Theory Model Theory Computability Theory Philosophical Logic Logic in Computer Science Student travel grants To be considered for a travel award, please send a letter of application, and ask your thesis supervisor to send a brief recommendation letter. Your application letter should be brief (preferably one page) and should include: your name; your home institution; your thesis supervisor's name; a one-paragraph description of your studies and work in logic, and a paragraph indicating why it is important to attend the meeting; your estimate of the travel expenses you will incur; (for citizens or residents of the USA) citizenship or visa status; and (voluntary) indication of your gender and minority status. Women and members of minority groups are strongly encouraged to apply. Travel grant applications are accepted from students and also from recent Ph.D. recipients, until the deadline of March 24, 2022, and ASL membership is not required. Applications should be submitted via email to asl at uconn.edu or to the ASL Business Office: ASL, Dept. of Mathematics, Univ. of Connecticut, 341 Mansfield Road, U-1009, Storrs, CT 06269-1009, USA. Decisions will be communicated at least two months prior to the meeting. Important Dates Deadline for Abstract Submission: 24th of March Start of the Conference: 27th of June End of the Conference: 1st of July For more information, please visit https://urldefense.com/v3/__http://icetcs.ru.is/lc2022/__;!!IBzWLUs!AZpiW0NAswHwxbTo8z-aur5bZ7AbJPgRnMmyxdo7snv8EhOdbPt2R2UH2a5ZEts15lSYivQJ3JqMPQ$ On behalf of the OC, Antonis Achilleos -------------- next part -------------- An HTML attachment was scrubbed... URL: From violetpun at gmail.com Wed Mar 23 05:42:55 2022 From: violetpun at gmail.com (Violet Ka I Pun) Date: Wed, 23 Mar 2022 10:42:55 +0100 Subject: [TYPES/announce] First CFP: FM 2023 - 25th International Symposium on Formal Methods Message-ID: <2058267D-9AF8-4651-8B21-2905F6C20188@gmail.com> [apologies for cross-postings] ================================================== Call for Papers FM 2023: 25th International Symposium on Formal Methods L?beck, Germany, March 6-10, 2023 https://urldefense.com/v3/__https://fm2023.isp.uni-luebeck.de/__;!!IBzWLUs!D9X8003YL1n-QLRbjnZPu5bJw-J4LTxEVq1RQl8NkG5CZX8FxqyCKtujl9UKRG5BSSVVPpC0XUDWUQ$ ================================================== FM 2023 is the 25th international symposium in a series organised by Formal Methods Europe (FME), an independent association whose aim is to stimulate the use of, and research on, formal methods for software development. The FM symposia have been successful in bringing together researchers and industrial users around a programme of original papers on research and industrial experience, workshops, tutorials, reports on tools, projects, and ongoing doctoral research. FM 2023 will be both an occasion to celebrate and a platform for enthusiastic researchers and practitioners from a diversity of backgrounds to exchange their ideas and share their experiences. =Important Dates= Abstract submission: September 4, 2022, 23:59 AoE (firm) Full paper submission: September 11, 2022, 23:59 AoE (firm) Notification: November 15, 2022 Camera ready: December 11, 2022 Conference: March 6-10, 2023 =Topics of Interest= FM 2023 will highlight the development and application of formal methods in a wide range of domains including trustworthy AI, software, computer-based systems, systems-of-systems, cyber-physical systems, security, human-computer interaction, manufacturing, sustainability, energy, transport, smart cities, healthcare and biology. We particularly welcome papers on techniques, tools and experiences in interdisciplinary settings. We also welcome papers on experiences of applying formal methods in industrial settings, and on the design and validation of formal method tools. The topics of interest for FM 2023 include, but are not limited to: Interdisciplinary formal methods: Techniques, tools and experiences demonstrating the use of formal methods in interdisciplinary settings. Formal methods in practice: Industrial applications of formal methods, experience with formal methods in industry, tool usage reports, experiments with challenge problems. The authors are encouraged to explain how formal methods overcame problems, led to improved designs, or provided new insights. Tools for formal methods: Advances in automated verification, model checking, and testing with formal methods, tools integration, environments for formal methods, and experimental validation of tools. The authors are encouraged to demonstrate empirically that the new tool or environment advances the state of the art. Formal methods in software and systems engineering: Development processes with formal methods, usage guidelines for formal methods, and method integration. The authors are encouraged to evaluate process innovations with respect to qualitative or quantitative improvements. Empirical studies and evaluations are also solicited. Theoretical foundations of formal methods: All aspects of theory related to specification, verification, refinement, and static and dynamic analysis. The authors are encouraged to explain how their results contribute to the solution of practical problems with formal methods or tools. We explicitly welcome submissions to the special FM 2023 session on "Formal methods meets AI", which is focused on formal and rigorous modelling and analysis techniques to ensuring safety, robustness etc. (trustworthiness) of AI-based systems. =Submission Guidelines= Papers should be original work, not published or submitted elsewhere, in Springer LNCS format, written in English, submitted through EasyChair: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=fm2023__;!!IBzWLUs!D9X8003YL1n-QLRbjnZPu5bJw-J4LTxEVq1RQl8NkG5CZX8FxqyCKtujl9UKRG5BSSVVPpCK-Qhr7g$ Each paper will be evaluated by at least three members of the Programme Committee. Authors of papers reporting experimental work are strongly encouraged to make their experimental results available for use by the reviewers. Similarly, case study papers should describe significant case studies, and the complete development should be made available at the time of review. The usual criteria for novelty, reproducibility, correctness and the ability for others to build upon the described work apply. Tool papers and tool demonstration papers should explain enhancements made compared to previously published work. A tool demonstration paper need not present the theory behind the tool, but can focus on the tool?s features, how it is used, its evaluation, and examples and screenshots illustrating the tool?s use. Authors of tool and tool demonstration papers should make their tool available for use by the reviewers. We solicit various categories of papers: Regular Papers (max 15 pages) Long tool papers (max 15 pages) Case study papers (max 15 pages) Short papers (max 6 pages), including tool demonstration papers. Short papers present novel ideas (e.g., without an extensive experimental evaluation) or results that can well be presented in 6 pages. Short papers will be given short presentation slots at the conference. All page limits do not include references and appendices. For all papers, an appendix can provide additional material such as details on proofs or experiments. The appendix is not part of the page count and not guaranteed to be read or taken into account by the reviewers. Thus, it should not contain information necessary for the understanding and the evaluation of the presented work. Papers will be accepted or rejected in the category in which they were submitted and will not be moved between categories. At least one author of an accepted paper is expected to present the paper at the conference as a registered participant. =Best Paper Award= At the conference, the PC Chairs will present an award to the authors of the submission selected as the FM 2023 Best Paper. =Publication= Accepted papers will be published in the Symposium Proceedings to appear in Springer?s Lecture Notes in Computer Science. Extended versions of selected papers will be invited for publication in a special issue of a journal. =General Chair= Martin Leucker, University of L?beck, Germany =Program Committee Chairs= Marsha Chechik, University of Toronto, Canada Joost-Pieter Katoen, RWTH Aachen University, Germany & University of Twente, the Netherlands =Program Committee= TBD -- Violet Ka I Pun / https://urldefense.com/v3/__http://violet.foldr.org/__;!!IBzWLUs!D9X8003YL1n-QLRbjnZPu5bJw-J4LTxEVq1RQl8NkG5CZX8FxqyCKtujl9UKRG5BSSVVPpB-FIUgXA$ From daniel.hillerstrom at ed.ac.uk Wed Mar 23 14:11:37 2022 From: daniel.hillerstrom at ed.ac.uk (=?UTF-8?Q?Daniel_Hillerstr=c3=b6m?=) Date: Wed, 23 Mar 2022 18:11:37 +0000 Subject: [TYPES/announce] [CFP] HOPE'22: ACM SIGPLAN Workshop on Higher-Order Programming with Effects Message-ID: <3db3c072-4ef5-044a-c06d-9a67c7e74f12@ed.ac.uk> HOPE'22: ACM SIGPLAN Workshop on Higher-Order Programming with Effects September 11, 2022 (Sun), Ljubljana, Slovenia (the day before ICFP 2022) Call-for presentations https://urldefense.com/v3/__https://icfp22.sigplan.org/home/hope-2022__;!!IBzWLUs!AC-nEyFBhFYUw7zWMxj9exAYyxawesQNV3NPiPi-NkVBKS8CMND0XrKflpNifEsGynDnr6Lh_EuaAA$ 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, Daniel Hillerstr?m (daniel.hillerstrom at ed.ac.uk) and Oleg Kiselyov (oleg at okmij.org). * Deadline for talk proposals: **June 1st, 2022** (Wednesday) * Notification of acceptance: **July 13th, 2022** (Wednesday) * Workshop: **September 11th, 2022** (Sunday) Program Committee Jonathan Immanuel Brachth?user University of T?bingen, Germany Edwin Brady University of St. Andrews, UK Daniel Hillerstr?m (co-chair) University of Edinburgh, UK Mauro Jaskelioff National University of Rosario, Argentina Oleg Kiselyov (co-chair) Tohoku University, Japan Sean Moss University of Oxford, UK Maciej Pir?g Huawei Research, UK Taro Sekiyama National Institute of Informatics, Japan Ningning Xie University of Cambridge, UK Yizhou Zhang University of Waterloo, Canada -- Kind regards Daniel Hillerstr?m Find me in Informatics Forum office 5.28/1. 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 msteffen at ifi.uio.no Wed Mar 23 10:07:50 2022 From: msteffen at ifi.uio.no (Martin Steffen) Date: Wed, 23 Mar 2022 15:07:50 +0100 Subject: [TYPES/announce] Ph.D position on formal methods available @ University of Oslo (short deadline) Message-ID: <20220323140750.5D57A9F@afram.ifi.uio.no> +-----------------------------------------+ Ph.D position in Formal Methods available at the Dept. of Informatics, University of Oslo. on the topic +--------------------------------------+ Formal Analysis for Concurrent Programs +--------------------------------------+ Deadline: 08. 04. 2022 1. Position =========== The position will be part of the research group on formal methods at the Department of Informatics (IFI). The research group develops and applies techniques for formal modelling and analysis in a range of problem domains. As a research fellow in this research group, you will be working in a friendly, stimulating and international research environment with a number of PhD and postdoctoral fellows. 2. Qualification requirements, employment details & how to apply ================================================================ For detailed information about how to apply, formal application requirements and expectations, terms of employment and wage etc., see the web announcements: - https://urldefense.com/v3/__https://www.jobbnorge.no/en/available-jobs/job/222897/phd-research-fellow-in-formal-analysis-of-concurrent-systems__;!!IBzWLUs!FPggx67PTjENQl-UxY3_A1TpO3eJYtOvN9_w60oLr9JWoF1KI3vQ8V1a34G7jZ4BsBd96oLLA4c0Qg$ 3. Contacts: =========== - Martin Steffen (msteffen at ifi.uio.no) - Einar Broch Johnsen (einarj at ifi.uio.no) 4. More details on the intended area of research ================================================ The planned PhD research aims to develop formal semantic-based analysis methods for tackling modern concurrency abstraction and memory models for multi-threaded programming languages and systems. That also involves developing and using appropriate software analysis and synthesis tools to ensure synchronisation-related correctness properties, such as deadlock-freedom, sequential consistency, functional determinacy or absence of information leakage. The results from the theoretical investigations will be encapsulated in programming libraries and analysis algorithms that fit into the existing eco-systems of the chosen host languages. Methodologically, the research will target mainly light-weight verification methods, analysis methods and corresponding tools that work automatically, without interactive user intervention. In particular, type-based analyses and synthesis methods to check for resource-consumption, conformance with interface specification, race freedom, etc. From kaposi.ambrus at gmail.com Thu Mar 24 12:44:24 2022 From: kaposi.ambrus at gmail.com (Ambrus Kaposi) Date: Thu, 24 Mar 2022 17:44:24 +0100 Subject: [TYPES/announce] Call for STSMs, deadline 3 April 2022 Message-ID: COST Action CA20111 EuroProofNet Open call for Short-Term Scientific Missions (STSMs) Dear Action members, The next STSM deadline is: 3 April 2022 Notification: 15 April. We are especially looking for applications from women and working groups other than WG3. *What is an STSM?* A Short-Term Scientific Mission (STSM) is a research visit of an individual researcher from a country participating in the Action in a different country also participating in the Action. We encourage STSMs, as they are an effective way of starting and maintaining collaborations. The procedure for proposing an STSM is described in Annex 2 of the Annotated Rules ( https://urldefense.com/v3/__https://www.cost.eu/uploads/2021/10/COST-094-21-Annotated-Rules-for-COST-Actions-Level-C-2021-11-01-1.pdf*page=92__;Iw!!IBzWLUs!AXaeXjDgTFoVViu2moOL7IURku1hLkUjqyYyJJbF-NtDXAN0UiL8z3SKQa7R75iibsYu1rCYgrUCbA$ ). The main points about STSMs are: * An STSM must be between two different countries which are participating in the Action. * The typical duration is one or two weeks. We favor short missions so that more people can get funded. * The financial contribution for an STSM is a fixed grant based on the applicant?s budget request and the evaluation of the application by the STSM assessment committee. The grant may not necessarily cover all costs of the visit. The grant only covers travel and subsistence and is transferred after the STSM has taken place. * Recommended grants: - up to EUR 120 for daily allowance (depending on the location) - up to EUR 400 for travel. - the total may not exceed EUR 4000 (this is a hard limit) * Proposals should be submitted by the deadlines. *What documents to provide?* Proposals must be made through the e-COST system ( https://urldefense.com/v3/__https://e-services.cost.eu/activity/grants/add?type=STSM__;!!IBzWLUs!AXaeXjDgTFoVViu2moOL7IURku1hLkUjqyYyJJbF-NtDXAN0UiL8z3SKQa7R75iibsYu1rBUMeQOUQ$ , you need to add a bank account on your profile first). The following documents must be uploaded: * The application form ( https://urldefense.com/v3/__https://europroofnet.github.io/assets/documents/STSM-application-template.docx__;!!IBzWLUs!AXaeXjDgTFoVViu2moOL7IURku1hLkUjqyYyJJbF-NtDXAN0UiL8z3SKQa7R75iibsYu1rBCLkNAQg$ ) with the following data: - Details of the STSM: title, dates and justification of the grant request (details of the travel cost, accommodation cost and living cost) - Goals of the STSM (max 200 words) - Working plan (max 500 words) - Working group(s) it contributes to (see https://urldefense.com/v3/__https://europroofnet.github.io/wg__;!!IBzWLUs!AXaeXjDgTFoVViu2moOL7IURku1hLkUjqyYyJJbF-NtDXAN0UiL8z3SKQa7R75iibsYu1rDIiGx-gg$ ) and expected outputs and contribution to the action objectives and deliverables (max 500 words, see https://urldefense.com/v3/__https://europroofnet.github.io/description__;!!IBzWLUs!AXaeXjDgTFoVViu2moOL7IURku1hLkUjqyYyJJbF-NtDXAN0UiL8z3SKQa7R75iibsYu1rCvjhtMvA$ ) * A letter from the host confirming that he or she will receive the applicant. * Documents justifying the grant request (quotes for travel and accommodation). *Selection criteria:* The criteria according to which funding will be decided are in order: * importance with regard to the research coordination objectives * inclusiveness target countries * age * gender * team with low resources * balance over the action life time between people, teams, countries and working groups. *Grant reception:* To receive the grant, a short scientific report must be submitted through the e-cost system along with the Host?s approval of the report, within 15 days after the end of the STSM. *Changing the dates of an STSM, or cancelling an STSM?* In case you need to change the dates of an accepted STSM, you need to inform the STSM coordinators as soon as possible and provide new dates so that the STSM ends before the end of October. In case you need to cancel an accepted STSM, you need to inform the STSM coordinators as soon as possible. For more information, see the website of the action https://urldefense.com/v3/__https://europroofnet.github.io__;!!IBzWLUs!AXaeXjDgTFoVViu2moOL7IURku1hLkUjqyYyJJbF-NtDXAN0UiL8z3SKQa7R75iibsYu1rDhVXettg$ . Regards, Danijela Simic and Ambrus Kaposi EuroProofNet STSM Coordinators -------------- next part -------------- An HTML attachment was scrubbed... URL: From s-dgq at thorsten-wissmann.de Thu Mar 24 06:24:09 2022 From: s-dgq at thorsten-wissmann.de (Thorsten Wissmann) Date: Thu, 24 Mar 2022 11:24:09 +0100 Subject: [TYPES/announce] CMCS 2022: Call for Participation Message-ID: <20220324102409.GA22642@dobby> Call for Participation 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/__https://www.coalg.org/cmcs22__;!!IBzWLUs!HEI4eyRve4LU8-UNULQzWxfxMkcOFHdbelpHBeCNsaxBXBc3BG1tIrPLIwhBLMr_4rnMc6w5BIRfdg$ ***ETAPS Registration closes on 26 March 2022*** 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. We aim for an event with maximal on-site participation, but a few presentations will be given online due to circumstances. See the programme for details: https://urldefense.com/v3/__https://www.coalg.org/cmcs22/programme/__;!!IBzWLUs!HEI4eyRve4LU8-UNULQzWxfxMkcOFHdbelpHBeCNsaxBXBc3BG1tIrPLIwhBLMr_4rnMc6xLAjht_w$ If you would like to join the CMCS workshop dinner, please sign up asap here: https://urldefense.com/v3/__https://www.coalg.org/cmcs22/workshop-dinner/__;!!IBzWLUs!HEI4eyRve4LU8-UNULQzWxfxMkcOFHdbelpHBeCNsaxBXBc3BG1tIrPLIwhBLMr_4rnMc6yemEEYYQ$ Keynote speaker --------------- Ana Sokolova, University of Salzburg, Austria Invited speakers ---------------- Renato Neves, University of Minho, Portugal Sam Staton, University of Oxford, United Kingdom Invited tutorial speakers ------------------------- There will be a special session on Data Languages with invited tutorials by: S?awomir Lasota, University of Warsaw, Poland Mahsa Shirmohammadi, CNRS & University of Paris, France Programme and Accepted papers ----------------------------- The list of accepted papers and short contributions, and the programme is available on the website: https://urldefense.com/v3/__https://www.coalg.org/cmcs22/__;!!IBzWLUs!HEI4eyRve4LU8-UNULQzWxfxMkcOFHdbelpHBeCNsaxBXBc3BG1tIrPLIwhBLMr_4rnMc6yQjQEQXQ$ 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, Chapman University, United States 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 From i.hasuo at acm.org Fri Mar 25 07:15:24 2022 From: i.hasuo at acm.org (Ichiro Hasuo) Date: Fri, 25 Mar 2022 20:15:24 +0900 Subject: [TYPES/announce] post-doc & programmer positions in Tokyo, Japan Message-ID: Dear all, We have two open positions (post-doc and a scientific programmer) at NII, Tokyo, Japan. The scope is the combination of logic and optimization metaheuristics. They are funded by the ERATO MMSD project (extended till March 2025). Please find further details at https://urldefense.com/v3/__https://group-mmm.org/eratommsd/open-positions/__;!!IBzWLUs!BZrieZ9BFdwav9IJXEE2J9SUW4Se9KXJ7zF76na_tZjW5MD9i8he0VLcFP4JIOys4AONs0qArMuE1A$ Thanks a lot for your consideration. Best, Ichiro ====== Ichiro Hasuo Associate Professor, National Institute of Informatics i.hasuo at acm.org Secretaries: hasuolab-secr at nii.ac.jp https://urldefense.com/v3/__http://group-mmm.org/*ichiro/__;fg!!IBzWLUs!BZrieZ9BFdwav9IJXEE2J9SUW4Se9KXJ7zF76na_tZjW5MD9i8he0VLcFP4JIOys4AONs0pd3Imx0w$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From antonios at ru.is Fri Mar 25 07:50:50 2022 From: antonios at ru.is (Antonios Achilleos) Date: Fri, 25 Mar 2022 11:50:50 +0000 Subject: [TYPES/announce] Logic Colloquium deadline extension Message-ID: <1c33d37a9be84a1a86bebc0380ff43a0@ru.is> The Logic Colloquium 2022 will take place from June 27 to July 1, 2022 at Reykjavik University, in Iceland. The deadline to submit abstracts has been extended to March 31. For updates, please visit the website: https://urldefense.com/v3/__http://icetcs.ru.is/lc2022/__;!!IBzWLUs!HGAtyUHQlE9dakJXZUa9R8hLvaFkAAzUIvuWXKpd0AMYHaEONQJPEWmdr8OsW-R1oGDJHIaWW1ozPw$ **************************************** The Logic Colloquium is the European Summer Meeting of the Association for Symbolic Logic, that in 2022 will be held from the 27th of June to the 1st of July 2022 at Reyjavik University, Iceland. We encourage you to submit abstracts for contributed talks. On behalf of the OC, Antonis Achilleos -------------- next part -------------- An HTML attachment was scrubbed... URL: From tobias.kappe at gmail.com Fri Mar 25 11:15:55 2022 From: tobias.kappe at gmail.com (=?UTF-8?Q?Tobias_Kapp=C3=A9?=) Date: Fri, 25 Mar 2022 16:15:55 +0100 Subject: [TYPES/announce] Learning and Automata (LearnAut) 2022 -- ICALP 2022 Workshop, last CFP and deadline extension Message-ID: Learning and Automata (LearnAut) -- ICALP 2022 workshop July 4th - Paris, France and virtually Website: https://urldefense.com/v3/__https://learnaut22.github.io__;!!IBzWLUs!F16fHxiiN9Ydqy-XW2VUHvjtZ2L0ZFI1CK6cfXpwt3xDl-H5ZUerSrDu4qCC4RZrg_qsSbTfmkhgGQ$ Deadline: Extended to April 7th Submission portal: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=learnaut2022__;!!IBzWLUs!F16fHxiiN9Ydqy-XW2VUHvjtZ2L0ZFI1CK6cfXpwt3xDl-H5ZUerSrDu4qCC4RZrg_qsSbR92c3JeQ$ Learning models defining recursive computations, like automata and formal grammars, are the core of the field called Grammatical Inference (GI). The expressive power of these models and the complexity of the associated computational problems are major research topics within mathematical logic and computer science. Historically, there has been little interaction between the GI and ICALP communities, though recently some important results started to bridge the gap between both worlds, including applications of learning to formal verification and model checking, and (co-)algebraic formulations of automata and grammar learning algorithms. The goal of this workshop is to bring together experts on logic who could benefit from grammatical inference tools, and researchers in grammatical inference who could find in logic and verification new fruitful applications for their methods. We invite submissions of recent work, including preliminary research, related to the theme of the workshop. The Program Committee will select a subset of the abstracts for oral presentation. At least one author of each accepted abstract is expected to represent it at the workshop (in person, or virtually). Note that accepted papers will be made available on the workshop website but will not be part of formal proceedings (i.e., LearnAut is a non-archival workshop). Topics of interest include (but are not limited to): - Computational complexity of learning problems involving automata and formal languages. - Algorithms and frameworks for learning models representing language classes inside and outside the Chomsky hierarchy, including tree and graph grammars. - Learning problems involving models with additional structure, including numeric weights, inputs/outputs such as transducers, register automata, timed automata, Markov reward and decision processes, and semi-hidden Markov models. - Logical and relational aspects of learning and grammatical inference. - Theoretical studies of learnable classes of languages/representations. - Relations between automata or any other models from language theory and deep learning models for sequential data. - Active learning of finite state machines and formal languages. - Methods for estimating probability distributions over strings, trees, graphs, or any data used as input for symbolic models. - Applications of learning to formal verification and (statistical) model checking. - Metrics and other error measures between automata or formal languages. ** Invited speakers ** Jeffrey Heinz (Stony Brook University) Sheila McIlraith (University of Toronto) Ariadna Quattoni (Universitat Polit?cnica de Catalunya) ** Submission instructions ** Submissions in the form of anonymized extended abstracts must be at most 8 single-column pages long at most (plus at most four for bibliography and possible appendixes) and must be submitted in the JMLR/PMLR format. The LaTeX style file is available here: https://urldefense.com/v3/__https://ctan.org/tex-archive/macros/latex/contrib/jmlr__;!!IBzWLUs!F16fHxiiN9Ydqy-XW2VUHvjtZ2L0ZFI1CK6cfXpwt3xDl-H5ZUerSrDu4qCC4RZrg_qsSbSwLbDXKA$ We do accept submissions of work recently published or currently under review. - Submission url: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=learnaut2022__;!!IBzWLUs!F16fHxiiN9Ydqy-XW2VUHvjtZ2L0ZFI1CK6cfXpwt3xDl-H5ZUerSrDu4qCC4RZrg_qsSbR92c3JeQ$ - Submission deadline: April 7th - Notification of acceptance: May 5th - Early registration: TBD ** Program Committee ** - Dana Angluin (Yale University) - Leonor Becerra-Bonache (Jean Monnet University, Saint-?tienne) - Jorge Castro (Universitat Polit?cnica de Catalunya) - Dana Fisman (Ben-Gurion University) - Matthias Gall? (Naver Labs Europe) - Gerco van Heerdt (University College London) - Colin de la Higuera (University of Nantes) - Falk Howar (TU Dortmund) - Nils Jansen (Radboud University) - Joshua Moerman (Open University of the Netherlands) - Ariadna Quattoni (Universitat Polit?cnica de Catalunya) - Bernhard Steffen (TU Dortmund) - Henning Urbat (Friedrich-Alexander University Erlangen-N?rnberg) - Frits Vaandrager (Radboud University) - Ryo Yoshinaka (Tohoku University) ** Organizers ** R?mi Eyraud (Jean Monnet University, Saint-?tienne) Tobias Kapp? (ILLC, University of Amsterdam) Guillaume Rabusseau (Mila & DIRO, Universit? de Montr?al) Matteo Sammartino (Royal Holloway, University of London & University College London) -------------- next part -------------- An HTML attachment was scrubbed... URL: From pnwamk at gmail.com Fri Mar 25 17:25:48 2022 From: pnwamk at gmail.com (Andrew Kent) Date: Fri, 25 Mar 2022 14:25:48 -0700 Subject: [TYPES/announce] FLoC 2022 Mentoring Workshop: Call for Scholarship Applications - deadline on April 11th Message-ID: FLoC 2022 Mentoring Workshop (FLoC'22 MW) https://urldefense.com/v3/__https://www.floc2022.org/flocmentoringworkshop__;!!IBzWLUs!F2_teuOA2uKaDF7zeirODXG7ppGHc_O-M8WPjiyClhBueXYTLcN47YBGj2UPJHqx8g2DCkBSKk9hJA$ 1 August 2022 and 5 August 2022 Haifa, Israel We warmly invite students to apply for travel scholarships to attend the Mentoring Workshop and FLoC. The deadline for applications is April 11th. Applications are received via the form at https://urldefense.com/v3/__https://forms.gle/QxWmYcvQCPgXRxEq6__;!!IBzWLUs!F2_teuOA2uKaDF7zeirODXG7ppGHc_O-M8WPjiyClhBueXYTLcN47YBGj2UPJHqx8g2DCkCOelfKSw$ ABOUT THE MENTORING WORKSHOP The purpose of the FLoC 2022 Mentoring Workshop (FLoC'22 MW) is to provide mentoring and career advice to early-stage graduate students, to attract them to pursue research careers in various logic-related areas. The workshop will particularly encourage participation of women and under-represented minorities. There will be two workshop days, one for each FLoC Conference Block, so the students can choose which one of the two they prefer to attend. The workshop program will include a number of talks and interactive sessions. The talks will give an overview of the field along with brief introductions to the varied topics highlighted at FLoC. Other talks will provide mentoring and career advice, from academia and industry. CONFIRMED SPEAKERS Mentoring Workshop for FLoC Conference Block 1 (Friday, August 5th, 2022) TBA (check the website for updates!) Mentoring Workshop for FLoC Conference Block 2 (Friday, August 5th, 2022) Rajeev Alur, University of Pennsylvania, USA Kristin Rozier, Iowa State University, USA Natarajan Shankar, SRI, USA Alexandra Silva, Cornell University, USA CONTACT In case of questions, please contact the Mentoring Workshop co-chairs: Sandra Kiefer Marijana Lazi? Caterina Urban From andersmortberg at gmail.com Sun Mar 27 12:27:53 2022 From: andersmortberg at gmail.com (Anders Mortberg) Date: Sun, 27 Mar 2022 18:27:53 +0200 Subject: [TYPES/announce] Workshop on Syntax and Semantics of Type Theories in Stockholm, Sweden, on May 20-21, 2022 Message-ID: We are organizing a workshop on Syntax and Semantics of Type Theories in Stockholm, Sweden, on May 20-21, 2022: https://urldefense.com/v3/__https://europroofnet.github.io/wg6-kickoff-stockholm/__;!!IBzWLUs!F1vFHyLfRbA2OYww3lxoDeJpcyxydQvAaAsUuFgus5H7NqzQ3-F7p2HRE2KuHO8QNDCsbX4NictioA$ The event is intended as a kick-off meeting for working group 6 on type theory of the EuroProofNet EU Cost Action: https://urldefense.com/v3/__https://europroofnet.github.io/wg6/__;!!IBzWLUs!F1vFHyLfRbA2OYww3lxoDeJpcyxydQvAaAsUuFgus5H7NqzQ3-F7p2HRE2KuHO8QNDCsbX4H7EK8Cw$ The programme will consist primarily of short talks, with plenty of time for discussion to share recent results, and co-ordinate future research, including collaboration towards deliverables. On the Sunday after the workshop, there will be an informal social excursion ? details TBA. The meeting will be in-person. # Confirmed speakers (more TBA) * Andr?s Kovacs * Andrej Bauer * Anja Petkovic Komel * Ivan Di Liberti * Jonathan Sterling * Taichi Uemura * Th?o Winterhalter # Deadlines Contributed talks deadline: *Monday 11 April* Funding request deadline: *Monday 11 April* Participation registration deadline: *Friday 13 May* To register please fill out the form linked to on the event webpage. # Organisers * Benedikt Ahrens (TU Delft & University of Birmingham) * Peter LeFanu Lumsdaine (Stockholm University) * Anders M?rtberg (Stockholm University) -------------- next part -------------- An HTML attachment was scrubbed... URL: From kutsia at risc.jku.at Sun Mar 27 12:34:47 2022 From: kutsia at risc.jku.at (Temur Kutsia) Date: Sun, 27 Mar 2022 18:34:47 +0200 Subject: [TYPES/announce] 2nd CfP: AMAI Special Issue on Symbolic Computation in Software Science Message-ID: Call for submissions Annals of Mathematics and Artificial Intelligence Special Issue on on Symbolic Computation in Software Science -- In the Era of Computational and Artificial Intelligence https://urldefense.com/v3/__https://www.risc.jku.at/people/tkutsia/organization/amai-scss.html__;!!IBzWLUs!DnCh74anMKIzoBLOVbAEEfxOrEc9gv4ucrvkYiHv_aukLJGZPbojri8tP2azDV5HsH-kXr4iZfiSrQ$ ------------------------------------------------------------------ SCOPE -------- In 2020, Annals of Mathematics and Artificial Intelligence (AMAI) celebrated its 30th anniversary. Over the years, the journal has promoted better understanding of the application of quantitative, combinatorial, logical, algebraic and algorithmic methods to artificial intelligence areas as diverse as decision support, automated deduction, reasoning, knowledge-based systems, machine learning, computer vision, robotics and planning. AMAI special issues are intended to be collections of original research papers reflecting the intersection of mathematics and a focused discipline demonstrating how each has contributed greatly to the other. A further goal of the journal is to close the gaps between the fields even further. Papers should report on current research in the appropriate areas, as well as more retrospective papers in which progress has been ongoing over a period of time. The purpose of this special issue of AMAI is to promote research on theoretical and practical aspects of symbolic computation in software science, combined with recent artificial intelligence techniques. 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 special issue is related to the topics of the The 9th International Symposium on Symbolic Computation in Software Science - SCSS 2021. Participants of the symposium, as well as other authors are invited to submit contributions. TOPICS ------------------- This special issue focuses on advanced results on the topics that include, but are not limited to, the following: - software science-relevant applications of * automated reasoning, knowledge reasoning, common-sense reasoning, reasoning in science * combinations of linguistic/learning-based and semantic/reasoning methods * algebras, co-algebras, categories, proof theory, model theory * artificial intelligence and machine learning methods - algorithm (program) analysis, synthesis, verification - extraction of specifications from algorithms (programs) - algorithm (program) transformation - formal methods for network and system security - programming models - formalization and computerization of knowledge; large-scale computer understanding of mathematics and science - alignment and joint processing of formal, semi-formal, and informal libraries - 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 - computational origami SUBMISSION ----------- This special issue welcomes original high-quality contributions that have been neither published in nor simultaneously submitted to any journals or refereed conferences. Submissions will be peer-reviewed using the standard refereeing procedure of the Annals of Mathematics and Artificial Intelligence. Submitted papers must be in English, prepared in LaTeX according to the guidelines of the journal: https://urldefense.com/v3/__https://www.springer.com/journal/10472/submission-guidelines__;!!IBzWLUs!DnCh74anMKIzoBLOVbAEEfxOrEc9gv4ucrvkYiHv_aukLJGZPbojri8tP2azDV5HsH-kXr5pIW986g$ . PDF versions of papers should be uploaded at the submission page https://urldefense.com/v3/__https://www.editorialmanager.com/amai__;!!IBzWLUs!DnCh74anMKIzoBLOVbAEEfxOrEc9gv4ucrvkYiHv_aukLJGZPbojri8tP2azDV5HsH-kXr5mU8Ulnw$ by May 23, 2022. Please choose S710: SCSS - Symbolic Computation in Software Science when you will be selecting the article type. GUEST EDITORS -------------------- Adel Bouhoula (Arabian Gulf University, Bahrain) Bruno Buchberger (RISC, Johannes Kepler University Linz, Austria) Tetsuo Ida (University of Tsukuba, Japan) Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) From xu at math.lmu.de Mon Mar 28 03:46:39 2022 From: xu at math.lmu.de (Chuangjie Xu) Date: Mon, 28 Mar 2022 09:46:39 +0200 Subject: [TYPES/announce] Autumn school "Proof and Computation", Fischbachau (Germany), 26 Sep - 1 Oct 2022 Message-ID: [Apologies for for multiple postings.] Autumn school "Proof and Computation" Fischbachau, Germany, 26th Sep. to 1st Oct. 2022 https://urldefense.com/v3/__http://www.mathematik.uni-muenchen.de/*schwicht/pc22.php__;fg!!IBzWLUs!Ee9uEcC9btmHhNIr_TK54dCHhqxK1Yaiom3H3_qtdgyo5nbSDVDlxucSS2v1HZ5Sk4IR4TO_4tDBhQ$ This year's international autumn school "Proof and Computation" will be held from 26th September to 1st October 2022 in Fischbachau near Munich. Its aim is to bring together young researchers in the field of Foundations of Mathematics, Computer Science and Philosophy. SCOPE -------------------- - Predicative Foundations - Constructive Mathematics and Type Theory - Computation in Higher Types - Extraction of Programs from Proofs COURSES -------------------- - Steve Awodey: Categorical logic - Marc Bezem: Coherent logic - Hajime Ishihara: Reverse mathematics in constructive set theory - Klaus Mainzer: tba - Stefan Neuwirth: The philosophy of dynamic algebra - Frederik Nordvall Forsberg: Universes of data types in constructive type theory - Monika Seisenberger: Extraction of programs from proofs - Chuangjie Xu: Various approaches to computing moduli of continuity WORKING GROUPS -------------------- There will be an opportunity to form ad-hoc groups working on specific projects, but also to discuss in more general terms the vision of constructing correct programs from proofs. APPLICATIONS -------------------- Graduate or PhD students and young postdoctoral researches are invited to apply. Applications (e.g. a self-introduction including research interests and motivation) should be sent to Chuangjie Xu >. Students are required to provide also a letter of recommendation, preferably from the thesis adviser. Deadline for applications: **27 May 2022**. Applicants will be notified by 20th June 2022. FINANCIAL SUPPORT -------------------- Successful applicants will be offered **full-board accommodation** for the days of the autumn school. There are NO funds, however, to reimburse travel or further expenses, which successful applicants will have to cover otherwise. The workshop is supported by the Udo Keller Stiftung (Hamburg), the CID (Computing with Infinite Data) programme of the European Commission and a JSPS core-to-core project. Klaus Mainzer Peter Schuster Helmut Schwichtenberg -------------- next part -------------- An HTML attachment was scrubbed... URL: From jaklt at kam.mff.cuni.cz Mon Mar 28 07:31:14 2022 From: jaklt at kam.mff.cuni.cz (=?UTF-8?B?VG9tw6HFoSBKYWts?=) Date: Mon, 28 Mar 2022 12:31:14 +0100 Subject: [TYPES/announce] Structure meets Power workshop 2022 Message-ID: <8c1348c2-4241-707d-d981-8a2cf3f4245b@kam.mff.cuni.cz> **************************************** * STRUCTURE MEETS POWER 2022 * * (an ICALP workshop) * * * * Call for Contributions * **************************************** Workshop dates: 4 July 2022 (Paris and online) https://urldefense.com/v3/__https://www.cst.cam.ac.uk/conference/structure-meets-power-2022__;!!IBzWLUs!AhTEtiwlp5nJhp3kwhiMsT9I5w8Hjt16v2xtLLUhb0fVIzK2OQ_eTrXo4rCnBCGnCDwTbwOV_bejMw$ 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 is an ICALP 2022 affiliated workshop. This will be a hybrid event, however, on site participation is highly recommended. Important dates --------------- Abstract submission: 20 May 2022 Author notification: 5 June 2022 Registration: 20 June 2022 Invited speakers ---------------- * Libor Barto (Charles University) * Sandra Kiefer (RWTH Aachen University) * Bartek Klin (University of Oxford) 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://urldefense.com/v3/__https://easychair.org/conferences/?conf=smp2022__;!!IBzWLUs!AhTEtiwlp5nJhp3kwhiMsT9I5w8Hjt16v2xtLLUhb0fVIzK2OQ_eTrXo4rCnBCGnCDwTbwPnzNdNbg$ 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 ------------ TBA later Organising and Programme Committee: ----------------------------------- * Samson Abramsky * Anuj Dawar * Tomas Jakl * Dan Marsden From pavlogiannis at cs.au.dk Mon Mar 28 08:24:14 2022 From: pavlogiannis at cs.au.dk (Andreas Pavlogiannis) Date: Mon, 28 Mar 2022 12:24:14 +0000 Subject: [TYPES/announce] PhD positions at Aarhus University Message-ID: The Department of Computer Science at Aarhus University, Denmark, offers two PhD positions in the area of Algorithmic Verification. The research topics are focused on the automated analysis of concurrent systems, as well as algorithmic aspects of static analyses of sequential/concurrent programs. Applicants are expected to have strong analytical skills in Computer Science and a personal drive for research. Admission can be on the basis of either a BSc or an MSc degree. Tuition is fully covered, and a generous stipend is provided for the full duration of the PhD. Interested applicants are encouraged to contact pavlogiannis at cs.au.dk, enclosing a CV. Next deadline: May 1, 2022 Application website: https://urldefense.com/v3/__https://phd.nat.au.dk/for-applicants/open-calls/february-2022-1/re-advertisement-programming-language-design-analysis-and-verification-1__;!!IBzWLUs!Dq3Uec0Q_haJTyMJrB7LzHBToxXzm15seZ1SV8O7CXSdRdS_zIDyM4qBvG-4SBhJ78vy2L72ZVpj1g$ Information about our PhD program: https://urldefense.com/v3/__http://phd.scitech.au.dk/for-applicants/application-guide/__;!!IBzWLUs!Dq3Uec0Q_haJTyMJrB7LzHBToxXzm15seZ1SV8O7CXSdRdS_zIDyM4qBvG-4SBhJ78vy2L4SOp-xUQ$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From m.sadrzadeh at ucl.ac.uk Mon Mar 28 09:37:00 2022 From: m.sadrzadeh at ucl.ac.uk (Sadrzadeh, Mehrnoosh) Date: Mon, 28 Mar 2022 13:37:00 +0000 Subject: [TYPES/announce] Second Call for Nominations: E. W. Beth Outstanding Dissertation Prize 2022 Message-ID: Second Call for Nominations: E. W. Beth Outstanding Dissertation Prize 2022 Since 1998, 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 (https://urldefense.com/v3/__http://www.folli.info/?page_id=74__;!!IBzWLUs!Bu-03w2XDK2eGOXqc1uUkdyVOJ5GWDoykFviKTukwb3NZ1xRlQdMAWlNezvegeOHTLu8KjYTXa_YbQ$ ), with financial support of the E.W. Beth Foundation (https://urldefense.com/v3/__https://www.knaw.nl/en/awards/funds/evert-willem-beth-stichting/evert-willem-beth-foundation__;!!IBzWLUs!Bu-03w2XDK2eGOXqc1uUkdyVOJ5GWDoykFviKTukwb3NZ1xRlQdMAWlNezvegeOHTLu8KjbOceJU1A$ ). 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 outstanding dissertations on topics in the broad remit of ESSLLI, in logic, language, information and computation. Interdisciplinary dissertations with results impacting various of these research areas in their investigations are especially solicited. Nominations are now invited for outstanding dissertations in these areas resulting in a Ph.D. degree awarded in 2021. The deadline for nominations is the 15th of April 2022. Qualifications: - A Ph.D. dissertation on a related topic is eligible for the Beth Dissertation Prize 2022, if the degree was awarded between January 1st and December 31st, 2021. - 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. - If a nominated dissertation has originally been written in a language other than English, its file 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 2023. The English translation must in such cases be submitted before the deadline of the call for nominations in 2023. 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 a single nomination file in zip format: - 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://urldefense.com/v3/__https://easychair.org/conferences/?conf=bodp2022__;!!IBzWLUs!Bu-03w2XDK2eGOXqc1uUkdyVOJ5GWDoykFviKTukwb3NZ1xRlQdMAWlNezvegeOHTLu8KjYPnvUl1A$ . 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 33rd ESSLLI summer school, in Galway, August 8-19, 2021. Beth dissertation prize committee 2022: 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) Christoph Haase (University of Oxford) Reinhard Muskens (University of Amsterdam) Francesca Poggiolesi (CNRS, IHPST, University of Paris 1) Mehrnoosh Sadrzadeh (University College London, chair) Ana Sokolova (University of Salzburg) Mark Steedman (University of Edinburgh) Carla Umbach (University of Koeln) 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 zaydargaye at gmail.com Mon Mar 28 10:56:35 2022 From: zaydargaye at gmail.com (zaynah dargaye) Date: Mon, 28 Mar 2022 16:56:35 +0200 Subject: [TYPES/announce] First CfP: FMBC 2022 - 4th International Workshop on Formal Methods for Blockchains Message-ID: FMBC 2022 First Call for Papers [ Please distribute, apologies for multiple postings. ] ======================================================================== 4th International Workshop on Formal Methods for Blockchains (FMBC) - First Call https://urldefense.com/v3/__https://fmbc.gitlab.io/2022__;!!IBzWLUs!GQvdigwHViNzGtNn8Yexnzl25JcuFwmqlfs9FU960a39nYw8EZYl245lPx6OFvmlQugOZkigAT2xHg$ August 11, 2022, Haifa, Israel Co-located with the The Federated Logic Conference 2022 (FLoC 22 -- https://urldefense.com/v3/__https://www.floc2022.org/__;!!IBzWLUs!GQvdigwHViNzGtNn8Yexnzl25JcuFwmqlfs9FU960a39nYw8EZYl245lPx6OFvmlQugOZkgqoVflUQ$ ) as a satellite workshop of the 34th International Conference on Computer-Aided Verification (CAV 2022 -- https://urldefense.com/v3/__http://i-cav.org/2022/__;!!IBzWLUs!GQvdigwHViNzGtNn8Yexnzl25JcuFwmqlfs9FU960a39nYw8EZYl245lPx6OFvmlQugOZkgmIJAS_g$ ). ----------------------------------------------------------------- Important dates --------------------- Abstract submission: May 3, 2022 Full paper submission: May 10, 2022 Notification: June 15, 2022 Camera-ready: July 13, 2022 Workshop: August 11, 2022 Deadlines are Anywhere on Earth -- https://urldefense.com/v3/__https://en.wikipedia.org/wiki/Anywhere_on_Earth__;!!IBzWLUs!GQvdigwHViNzGtNn8Yexnzl25JcuFwmqlfs9FU960a39nYw8EZYl245lPx6OFvmlQugOZkh58iK4ww$ . ---------------------- ---------------------- 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 Systematization of Knowledge (SoK) papers, 6 pages for short papers, and 2 pages for tool 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 a 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. -------------------- -------------------- 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. ---------------------- ---------------------- INVITED SPEAKER --------------------- Massimo Bartoletti, Professor, Universit? degli Studi di Cagliari, Italy ---------------------- ---------------------- PROGRAM COMMITTEE --------------------- PC CO-CHAIRS * Zaynah Dargaye (Nomadic Labs, France) (zaynah.dargaye at nomadic-labs.com) * Schneidewind Clara, (MPI-SP, Germany) (clara.schneidewind at mpi-sp.org) PC MEMBERS Wolfgang Ahrendt (Chalmers University of Technology, Sweden) Leonardo Alt (Ethereum Foundation, Germany) Lacramioara Astefanoaei (Nomadic Labs, France) Roberto Blanco (MPI-SP, Germany) Joachim Breitner (Germany) Achim Brucker (University of Exeter, UK) Ethan Cecchetti (University of Maryland, USA) Manuel Chakravarty (IOHK & Tweag, Netherlands) Jing Chen (Algorand Inc, USA) J?r?mie Decouchant (TU Delft, Netherlands) Antonella Del Pozzo (Universit? Paris-Saclay & CEA & List, France) Dana Drachsler Cohen (Technion, Israel) Cezara Dragoi (INRIA & ENS & CNRS & PSL, France) Ansgar Fehnker (Twente, Netherlands) Dominik Harz (Interlay & Imperial College London, UK) Lars Hupel (INNOQ, Germany) Igor Konnov (Informal Systems, Austria) Paul Laforgue (Nomadic Labs, France) Julian Nagele (Bank of America, USA) Russel O?Connor (Blockstream) Maria Potop-Butucaru (LIP6, France) Albert Rubio (Complutense University of Madrid, Spain) C?sar Sanchez (IMDEA, Spain) Sun Meng (Peking University, China) Simon Thompson (IO Global, UK) Josef Widder (Informal Systems, Austria) -------------- next part -------------- An HTML attachment was scrubbed... URL: From shankar at csl.sri.com Tue Mar 29 03:27:19 2022 From: shankar at csl.sri.com (Natarajan Shankar) Date: Tue, 29 Mar 2022 00:27:19 -0700 Subject: [TYPES/announce] Eleventh Summer School on Formal Techniques, May 30 - June 5, 2022, Menlo College, Atherton, California Message-ID: <352385d0-7cb8-7368-aad7-7267d7a365dc@csl.sri.com> Eleventh Summer School on Formal Techniques May 30 - June 5, 2022, Menlo College, Atherton, California https://urldefense.com/v3/__http://fm.csl.sri.com/SSFT22__;!!IBzWLUs!BML_qCAOaIyC4DG-SMnHDRttRxF6zJ8EEyz45KHFpywRIGFDbskFYdGWSP7yOiC4IGm_V3jlybu4hw$ * The Eleventh Summer School on Formal Techniques is directed at graduate students and young researchers.? A prior background in formal methods is helpful but not required.? This year, the school will take place in a hybrid mode: the lectures and labs will be live-streamed and recorded, but we strongly encourage in-person participation.? Funding for transportation/food/lodging is available for US-based students. * The lecturers at the school include Corina Pasareanu (NASA Ames/CMU West), Randy Bryant (CMU), Sanjit Seshia (UC Berkeley), Ruzica Piskac (Yale University), and Mayur Naik (U. of Pennsylvania). * We also have distinguished invited talks from Thomas Wies (New York University), Phokion G. Kolaitis (University of California Santa Cruz and IBM Research), Maria Paola Bonacina (Universit? degli Studi di Verona), Susmit Jha (SRI International) * The main lectures in the summer school start on Tuesday May 31 and will be preceded by a background course on logic given by Natarajan Shankar (SRI) and Stephane Graham-Lengrand (SRI) on Monday May 30 and a mini-bootcamp on Sunday June 5. * Registration link: https://urldefense.com/v3/__http://fm.csl.sri.com/SSFT22__;!!IBzWLUs!BML_qCAOaIyC4DG-SMnHDRttRxF6zJ8EEyz45KHFpywRIGFDbskFYdGWSP7yOiC4IGm_V3jlybu4hw$ * Registration deadline: April 30, 2022 From Stefan.Leue at uni-konstanz.de Mon Mar 28 04:41:16 2022 From: Stefan.Leue at uni-konstanz.de (Stefan Leue) Date: Mon, 28 Mar 2022 10:41:16 +0200 Subject: [TYPES/announce] PhD Student / Post-Doc Position at University of Konstanz In-Reply-To: <537a205c-b8f2-e593-ad16-2c6f8f2bca47@uni-konstanz.de> References: <537a205c-b8f2-e593-ad16-2c6f8f2bca47@uni-konstanz.de> Message-ID: The Chair for Software and Systems Engineering (Prof. Stefan Leue) of the University of Konstanz has the immediately opening of a full-time PhD Student / Post-Doc position. Reference Number 2022/078. The start date is July 1st, 2022, or by mutual agreement. The position is initially available for three years (Doctoral Position) or two years (Post-Doctoral Position) with a possibility of extension. Preference will be given to Doctoral candidates. The position will allow for the writing of a doctoral dissertation. The position is to support the research, teaching and administrative activities of the Chair for Software and Systems Engineering. Our research interests span a wide spectrum of topics in systems and formal methods, ranging from model checking, SMT solving, real-time systems, hybrid systems, system analysis, causality, automated repair, verification of machine learning, automotive functional safety, software tool environments to formal modeling in Legal Tech. The working language is English. Excellent undergraduate and graduate degrees (or doctoral degree in case of a Post-Doc application) in Computer Science or a very closely related area are a prerequisite. Renumeration is according to the TV-L labor agreement in the EG 13 payscale, amounting to at least approx. ? 50.000,00 p.a. Application deadline: April 24, 2022. For more information and application instructions please see https://urldefense.com/v3/__https://stellen.uni-konstanz.de/jobposting/acf41fd61d1ed76fb0a6495a83468ca48a16e0fd0__;!!IBzWLUs!E6CDUFzvL7B9fNFGSMEwpjk19sSGleQnj-LkOPOwpdtiQqryrNUkNUrCDDZhLOEKX0CSWRCFYv6jWw$ I will be happy to answer further questions, and look forward to your qualified application! Stefan Leue -- Prof. Dr. Stefan Leue Chair for Software and Systems Engineering Department of Computer and Information Science University of Konstanz, Box 67 D-78457 Konstanz, Germany Office: PZ902 Phone: +49 (0)7531 88 2893, ~4631 (secretary) Home: +49 (0)7533 949 2182 Email: Stefan.Leue at uni-konstanz.de WWW: https://urldefense.com/v3/__http://sen.uni-konstanz.de__;!!IBzWLUs!E6CDUFzvL7B9fNFGSMEwpjk19sSGleQnj-LkOPOwpdtiQqryrNUkNUrCDDZhLOEKX0CSWRC0E01CTA$ From nclpltt at gmail.com Tue Mar 29 05:18:12 2022 From: nclpltt at gmail.com (Nicola Paoletti) Date: Tue, 29 Mar 2022 10:18:12 +0100 Subject: [TYPES/announce] last call: HSCC 2022 Test-of-time-award (deadline 10 April) Message-ID: The HSCC 2022 organizers are soliciting nominations for the HSCC Test-of-Time Award to recognize the work published at a Hybrid Systems: Computation and Control (HSCC) conference in 2012 or before, which has proven to be the most visionary and impactful, leading to new directions of research being initiated, or new applications being brought into the hybrid systems research community. The award selection is through a committee of four internationally well-known and outstanding scientists who significantly contributed to the hybrid systems field and also to the HSCC organization. The decision to attribute the award and the choice of the awardee is at the sole discretion of the selection committee, which will carefully consider the nominated papers. See https://urldefense.com/v3/__https://hscc.acm.org/2022/hscc-test-of-time-award/__;!!IBzWLUs!AUIdY4B9UQu7-SaCEhuz89umXbhl9YZFDwgPTQ4yinhluglPL0TLtKsJn9dGp2WOYj0ejJrXTrddFw$ for details on eligibility and nomination rules. **Deadline for nominating papers for the award:** April 10, 2022 The selection committee for this year?s award is composed of the following distinguished members: * (Chair) Alessandro Abate, University of Oxford, UK * Rajeev Alur, University of Pennsylvania, USA * Thao Dang, Le Centre National de la Recherche Scientifique (CNRS), France * George Pappas, University of Pennsylvania, 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!AUIdY4B9UQu7-SaCEhuz89umXbhl9YZFDwgPTQ4yinhluglPL0TLtKsJn9dGp2WOYj0ejJqHCF_yOg$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From michele.alberti at cea.fr Tue Mar 29 10:53:45 2022 From: michele.alberti at cea.fr (Michele Alberti) Date: Tue, 29 Mar 2022 16:53:45 +0200 Subject: [TYPES/announce] =?utf-8?q?PhD_position_in_machine_learning_for_?= =?utf-8?q?formal_verification_=28Universit=C3=A9_Paris-Saclay=2C_CEA_LIST?= =?utf-8?q?_Institute=2C_France=29?= Message-ID: <0a2afa9e-a8a7-1e1a-010c-db43399f377b@cea.fr> Dear all, The Software Reliability and Security Lab at CEA LIST (Universit? Paris-Saclay, France) is hiring a PhD student (3 years contract) to work on machine learning for formal software verification in the context of Frama-C. Frama-C is an open-source platform providing several analyzers for C code as plug-ins. The most notables are Eva, based on abstract interpretation, and WP, based on the weakest preconditions calculus. Both plug-ins provide highly parametrizable techniques that may be efficiently combined, but their activation may be prohibitive in terms of resources such as time of computation and memory footprint. Moreover, many of these techniques are more or less based on heuristics which are usually manually conceived. These heuristics may be suboptimal, and require considerable technical knowledge and effort to be devised. The goal of the PhD is to integrate machine learning approaches to the Frama-C static analyzers in order to overcome the aforementioned shortcomings. The PhD will start by studying which heuristics already in place in Eva or WP could be automatically learned. Later, the PhD will investigate and propose representations and learning algorithms for treating code, with a particular focus on maintaining as much as possible the semantic elements. The developed research work will be evaluated on academic and industrial use cases. Knowledge in the following fields is required: - Machine learning or deep learning - Python programming Some knowledge in program verification is especially welcome. A full description of the position is available online: https://urldefense.com/v3/__https://www.frama-c.com/jobs/2022-03-28-machine-learning-for-improving-formal-verification-of-code.html__;!!IBzWLUs!Fm729NmlR-JkMcegkpifxE1F9cA302IV40lGZmGHsSYM_GbU5yObqVi3MRthnXUGcJ0XMO0ccDv3xA$ The starting date is expected to be in September 2022. However, we suggest the interested candidates to get in touch with us as soon as possible as a 3+ month procedure for administrative and security purposes is typically required by CEA. For further information and inquiries, please contact: * Michele Alberti (michele.alberti at cea.fr) * Valentin Perrelle (valentin.perrelle at cea.fr) Best regards, Michele Alberti -------------- next part -------------- An HTML attachment was scrubbed... URL: From marco.maggesi at unifi.it Wed Mar 30 08:40:52 2022 From: marco.maggesi at unifi.it (Marco Maggesi) Date: Wed, 30 Mar 2022 14:40:52 +0200 Subject: [TYPES/announce] School on Univalent Mathematics, Cortona (Italy), July 17-23: Application deadline 15 April 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!Gmye0y5Af6orRF47PSIIOEv58vLAxiLhrVEeg9zDMeByR4F0imZNRKbJPuKQ0BMMGa4AWedtjZgw9A$ ), Cortona, Italy, July 17-23, 2022 (https://urldefense.com/v3/__https://unimath.github.io/cortona2022/__;!!IBzWLUs!Gmye0y5Af6orRF47PSIIOEv58vLAxiLhrVEeg9zDMeByR4F0imZNRKbJPuKQ0BMMGa4AWefqhSsZrA$ ) 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!Gmye0y5Af6orRF47PSIIOEv58vLAxiLhrVEeg9zDMeByR4F0imZNRKbJPuKQ0BMMGa4AWecr1ktJyQ$ ), 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!Gmye0y5Af6orRF47PSIIOEv58vLAxiLhrVEeg9zDMeByR4F0imZNRKbJPuKQ0BMMGa4AWeeKwNMTyA$ . The application deadline is 15 April 2022. Best regards, The organizers Benedikt Ahrens and Marco Maggesi -------------- next part -------------- An HTML attachment was scrubbed... URL: From florian.rademacher at fh-dortmund.de Thu Mar 31 04:30:27 2022 From: florian.rademacher at fh-dortmund.de (Florian Rademacher) Date: Thu, 31 Mar 2022 10:30:27 +0200 Subject: [TYPES/announce] Microservices 2022 - First Call for Participation Message-ID: International Conference on Microservices: 1st Call for Participation ========================================================== Call for Participation Fourth International Conference on Microservices May 10th-12th 2022, Paris, France https://urldefense.com/v3/__https://www.conf-micro.services/2022/__;!!IBzWLUs!HTDPwZX5u16VnisXv2BLdFMkkUU2c1NySak5H1xCkXs7tjPN6Bow6nPseprPWypuH5-uqnEt-JOS5w$ ========================================================== Executive Summary: ?- The (Tentative) Conference Program is online: https://urldefense.com/v3/__https://www.conf-micro.services/2022/program/__;!!IBzWLUs!HTDPwZX5u16VnisXv2BLdFMkkUU2c1NySak5H1xCkXs7tjPN6Bow6nPseprPWypuH5-uqnHUKAPnhQ$ ?- Registration deadline is April 25th, 2022 (AoE) ?- Early bird registration (EXTENDED): April 11th, 2022 (AoE) Keynote Speakers ---------------- Valentina Lenarduzzi (University of Oulu, Finland): Technical Debt and Microservices Fabio Casati (Servicenow, USA): Crossing the Chasm Between AI Services and AI-powered Workflows Cesare Pautasso (USI Lugano, Switzerland): The Microservice Hypothesis For more information: https://urldefense.com/v3/__https://www.conf-micro.services/2022/keynotes/*technical-debt-and-microservices__;Iw!!IBzWLUs!HTDPwZX5u16VnisXv2BLdFMkkUU2c1NySak5H1xCkXs7tjPN6Bow6nPseprPWypuH5-uqnED7ejIJw$ Theme and Topics ---------------- The theme of this edition is aspects of microservices in the age of digital transformation. ?- On the one hand, the adoption of microservices is fostering the adoption of new architectural patterns and software construction practices; understanding the security properties (or the emerging vulnerabilities) of the resulting constructs calls for the development of a fresh mindset in analysts, designers and testers alike. In addition, the additional middleware and infrastructure typically proposed for the management of microservice-based architectures could expand the attack surface of the systems. ?- On the other hand, microservices are often adopted as an accelerator of digital transformations. Some of the opportunities in microservices involve the development of sustainable practices, the application of artificial intelligence and machine learning, and new architectures and technologies. In this light, addressing the complexity of digital transformation should be a primary concern for microservices researchers and practitioners, while improving/enhancing microservices principles, patterns, architectures, security, and technologies. Organisation ------------ General Chair: Giulio Manzonetto, Universit? Sorbonne Paris Nord (FR) Program Chairs: Gokila Dorai, Augusta University (US) Dimka Karastoyanova, University of Groningen (NL) Aomar Osmani, Universit? Sorbonne Paris Nord (FR) Industrial Liaison Chair: Claudio Guidi, italianaSoftware (IT) Publicity Chair: Pierre Boudes, Universit? Sorbonne Paris Nord (FR) Florian Rademacher, University of Applied Sciences and Arts Dortmund (DE) Local Chairs: Damiano Mazza, CNRS, University Sorbonne Paris Nord (FR) Steering Committee ----------------- Fabrizio Montesi, University of Southern Denmark Sabine Sachweh, University of Applied Sciences and Arts Dortmund Program Committee ----------------- Mohamed Abouelsaoud, Cisco (CA) Vasilios Andrikopoulos, University of Groningen (NL) Jaime Arias, CNRS, Universit? Sorbonne Paris Nord (FR) Ibrahim Baggili, University of New Haven (US) Salima Benbernou, Universit? de Paris (FR) Matteo Bordin, Profesia (IT) Elisabetta Di Nitto, Politecnico di Milano (IT) Lyes Khoukhi, ENSICAEN (FR) Piyush Kumar, Florida State University (US) Patricia Lago, Vrije Universiteit Amsterdam (NL) Giuseppe Lipari, Universit? de Lille (FR) Anupama Pathirage, WSO2 (US) Pierluigi Plebani, Politecnico di Milano (IT) Dakshitha Ratnayake, WSO2 (US) Maria Seralessandri, European Central Bank (DE) Matteo Zanioli, Alpenite (IT) Asli Zengin, Imola Informatica (IT) Note about COVID-19 ------------------- Due to the ongoing COVID-19 situation, Microservices 2022 will take place as a hybrid meeting. All the information regarding the conference (scheduling, platform, etc.) will be posted on the conference website shortly. Contact Information ------------------- Please contact us if you have questions: https://urldefense.com/v3/__https://www.conf-micro.services/2022/contact/__;!!IBzWLUs!HTDPwZX5u16VnisXv2BLdFMkkUU2c1NySak5H1xCkXs7tjPN6Bow6nPseprPWypuH5-uqnFEd5Tb4g$ From andreeac at comp.nus.edu.sg Thu Mar 31 06:46:33 2022 From: andreeac at comp.nus.edu.sg (Andreea Costea) Date: Thu, 31 Mar 2022 18:46:33 +0800 Subject: [TYPES/announce] SPLASH 2022 Call for Workshop Proposals Message-ID: Deadline for SPLASH 2022 Workshop Proposals submission due on ** May 1st, 2022 AoE ** ======================================================================== SPLASH 2022 Call for Workshops The ACM Conference on Systems, Programming, Languages, and Applications: Software for Humanity December 5-10, 2022, Auckland, New Zealand https://urldefense.com/v3/__https://2022.splashcon.org/track/splash-2022-Workshops__;!!IBzWLUs!HKsNSdoTPuoVn2LTTkM_QfO7En8l7k6Z42TEJ_OM4RnUBJjLFryCl9acbidC2ps3Owgo8deVAN94KA$ ======================================================================== We encourage proposals for workshops on any topic relevant to SPLASH. If there is a topic that you feel passionate about, and want to connect with others who have similar interests, submit a workshop proposal! We more than welcome new, and unconventional ideas for workshop formats. The following suggestions are a starting point: - Conference-style workshops allow participants to present their work to other domain experts. The smaller and more focused setting of a workshop allows for Q&A sessions and facilitates discussions. Presentations of work-in-progress are welcome. - Retreats act as a platform for experts to gather to tackle issues of a predetermined research agenda. Retreats are highly interactive and goal-oriented, allowing participants to address open challenges, explore new and uncharted ideas. - Agenda-setting workshops provide a forum for experts to determine a research agenda for a sub-field. - Other common activities at workshops include poster sessions, hands-on practical work, and focus groups. Workshops that include the presentation of research papers and that implement a SIGPLAN-approved selection process may archive proceedings in the ACM Digital Library. The workshop chairs will provide advice on achieving this for those interested. Workshop applications will be considered until **May 01, 2022**, or until all slots are allocated. We will also entertain requests for workshops to be held in remote or hybrid modes. ## Workshop Proposal Submission Visit the submission link for the workshop proposal form and for more information on requirements and the evaluation process. To submit a workshop proposal, you will need to login to https://urldefense.com/v3/__http://conf.research.org__;!!IBzWLUs!HKsNSdoTPuoVn2LTTkM_QfO7En8l7k6Z42TEJ_OM4RnUBJjLFryCl9acbidC2ps3Owgo8de6FtIJSQ$ . ## Important Deadlines - The deadline for proposal submission for all workshops is **May 01, 2022** - The deadline for paper/abstract submission for all workshops is **September 01, 2022** - The early registration deadline for SPLASH is **TBD**. Before the SPLASH early registration deadline, all workshops must a) send out accept/reject notifications, and b) publish a draft schedule on the SPLASH website. For workshops with proceedings published in the ACM Digital Library, **TBD** is the camera-ready deadline. Therefore, you should plan to notify authors several days before this date, so that they have time for revisions. **TBD** dates will be announced as soon as the SPLASH dates they are dependent on are decided. ## Questions Please [email the workshop co-chairs](mailto:workshops at splashcon.org) with any questions. ## Submission Link https://urldefense.com/v3/__https://bit.ly/splash2022w__;!!IBzWLUs!HKsNSdoTPuoVn2LTTkM_QfO7En8l7k6Z42TEJ_OM4RnUBJjLFryCl9acbidC2ps3Owgo8dc8y3WxQQ$ ## Organizing Committee - Mehdi Bagherzadeh, Oakland University, USA - Raffi Khatchadourian, CUNY Hunter College, USA From C.E.Brandt at tudelft.nl Thu Mar 31 10:03:23 2022 From: C.E.Brandt at tudelft.nl (Carolin Brandt) Date: Thu, 31 Mar 2022 14:03:23 +0000 Subject: [TYPES/announce] Call for Workshop Papers - ECOOP 2022 Message-ID: <1C65A118-850A-4636-9865-BE7BF190C012@tudelft.nl> ---------------------------------------------------------------------------------------- ECOOP 2022: Call for Workshop Papers ---------------------------------------------------------------------------------------- Summary: COP 2022: International Workshop on Context-Oriented Programming and Advanced Modularity Deadline: Friday, 15th of April Workshop on Formal Techniques for Java-like Programs Deadline: Friday, 1st of April ICOOOLPS?22: Workshop on Implementation, Compilation, Optimization of OO Languages, Programs and Systems Deadline: Thursday, 21st off April (Submission Talks, Demos, Position Papers) Program Analysis for WebAssembly (PAW) 2022 Deadline: Monday, 11th of April Programming Local-first Software Deadline: Friday, 1st of April PRIDE 2022: Workshop on Practical Research IDEs Deadline: Friday, 15th of April Truffle 2022: Truffle/GraalVM Languages Workshop Deadline: Saturday, 30th of April VORTEX 2022: Workshop on Verification and mOnitoring at Runtime EXecution Deadline: Monday, 18th of April ---------------------------------------------------------------------------------------- Detailed Calls for Papers: ---------------------------------------------------------------------------------------- ---------------------------------------------------------------------------------------- COP 2022: International Workshop on Context-Oriented Programming and Advanced Modularity ---------------------------------------------------------------------------------------- https://2022.ecoop.org/home/COP-2022 Deadline: Friday, 15th of April ---------------------------------------------------------------------------------------- Contextual information plays an ever-increasing role in our information-centric world. Current-day software systems adapt continuously to changing execution and usage contexts, even while running. Unfortunately, mainstream programming languages and development environments still do not support this kind of dynamicity very well, leading developers to implement complex designs to anticipate various dimensions of variability. Context-Oriented Programming directly supports variability at the programming level, depending on a wide range of dynamic attributes. It enables run-time behavior to be dispatched directly on any detected properties of the execution or user context. Since more than a decade, researchers have been working on a variety of notions approaching that idea. Implementations ranging from first prototypes to mature platform extensions used in commercial deployments have illustrated how multidimensional dispatch can be supported effectively to achieve expressive run-time variation in behavior. The scope of this workshop will further encompass diverse and advanced forms of modularity support in programming languages. We encourage results and discussions on advanced modularity that go beyond COP. ## Call for Papers COP invites submissions of high-quality papers reporting original research, or describing innovative contributions to, or experience with context-oriented programming, its implementation, and application. Papers that depart significantly from established ideas and practices are particularly welcome. All papers must be original. Submissions must not have been published previously and must not be simultaneously submitted or under review at any other refereed event or publication. The program committee will evaluate each contributed paper based on its relevance, significance, clarity, and originality. ### Topics 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); ### Submission guidelines Papers are to be submitted via [EasyChair](https://easychair.org/my/conference?conf=cop2022). They must be written in English, provided as PDF documents, and follow the new [ACM Master Article Template](https://www.acm.org/publications/proceedings-template) with the sigconf option. They should not exceed 8 pages. Accepted papers will be published in the ACM Digital Library (SCOPUS). ---------------------------------------------------------------------------------------- Workshop on Formal Techniques for Java-like Programs ---------------------------------------------------------------------------------------- https://2022.ecoop.org/track/ftfjp-2022 Deadline: Friday, 1st of April ---------------------------------------------------------------------------------------- Participation: Participation in the workshop is hybrid as with ECOOP 2022, but registration through the ECOOP registration system is required. As a hybrid event, when considering virtual mode, the registration system will provide you with the link to participate in the Zoom conference sessions. Formal techniques can help analyse programs, precisely describe program behaviour, and verify program properties. Modern programming languages are interesting targets for formal techniques due to their ubiquity and wide user base, stable and well-defined interfaces and platforms, and powerful (but also complex) libraries. New languages and applications in this space are continually arising, resulting in new programming languages (PL) research challenges. Work on formal techniques and tools and on the formal underpinnings of programming languages themselves naturally complement each other. FTfJP is an established workshop which has run annually since 1999 alongside ECOOP, with the goal of bringing together people working in both fields. The workshop has a broad PL theme; the most important criterion is that submissions will generate interesting discussions within this community. The term ?Java-like? is somewhat historic and should be interpreted broadly: FTfJP solicits and welcomes submission relating to programming languages in general, beyond Java, including C#, Scala, etc. Example topics of interest include (but not limited to): - Language design and semantics - Type systems - Concurrency and new application domains - Specification and verification of program properties - Program analysis (static or dynamic) - Program synthesis - Security Pearls (programs or proofs) - Programming environments FTfJP welcomes submissions on technical contributions, case studies, experience reports, challenge proposals, tools, and position papers. Webpages for previous workshops in this series are available at: https://ftfjp.github.io/. We plan that, as in previous years, accepted papers will be published in the ACM Digital Library, though authors will be able to opt out of this publication, if desired. At least one author of an accepted paper must attend the workshop to present the work and participate in the discussions. ## Submissions Contributions are sought in two categories: * Full Papers (6 pages, excluding references) present a technical contribution, case study, tool, or detailed experience report. We welcome both complete and incomplete technical results; ongoing work is particularly welcome, provided it is substantial enough to stimulate interesting discussions. * Short Papers (2 pages, excluding references) should advocate a promising research direction, or otherwise present a position likely to stimulate discussion at the workshop. We encourage e.g. established researchers to set out a personal vision, and beginning researchers to present a planned path to a PhD. All submissions and reviews will be managed within EasyChair. Submissions should be made via https://easychair.org/conferences/?conf=ftfjp2022. There is no need to indicate the paper category (long/short). Both types of contributions will benefit from feedback received at the workshop. Submissions will be peer reviewed, and will be evaluated based on their clarity and their potential to generate interesting discussions. Reviewing will be single blind, there is no need to anonymize submissions. The format of the workshop encourages interaction. FTfJP is a forum in which a wide range of people share their expertise, from experienced researchers to beginning PhD students. ## Formatting and Publication 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} We plan that, as in previous years, accepted papers will be published in the ACM Digital Library, though authors will be able to opt out of this publication, if desired. At least one author of an accepted paper must register to the conference by the early registration date and attend the workshop to present the work and participate in the discussions. Selected papers will also be considered for extended versions to be submitted to the Journal of Object Technology (JOT). ---------------------------------------------------------------------------------------- ICOOOLPS?22: Workshop on Implementation, Compilation, Optimization of OO Languages, Programs and Systems ---------------------------------------------------------------------------------------- https://2022.ecoop.org/home/ICOOOLPS-2022 Deadline: Thursday, 21st off April (Submission Talks, Demos, Position Papers) ---------------------------------------------------------------------------------------- The ICOOOLPS workshop series brings together researchers and practitioners working in the field of language implementation and optimization. The goal of the workshop is to discuss emerging problems and research directions as well as new solutions to classic performance challenges. The topics of interest for the workshop include techniques for the implementation and optimization of a wide range of languages including but not limited to object-oriented ones. Furthermore, virtual machines, meta-compilation techniques or language-agnostic approaches are welcome, too. Call for Contributions The ICOOOLPS workshop series brings together researchers and practitioners working in the field of language implementation and optimization (even beyond the historical OO background of the workshop). The goal of the workshop is to discuss emerging problems and research directions, as well as new solutions and techniques. We hope to provide a space for participation and discussion and in particular to discuss your work in progress. That?s why we?ll have two additional submission categories for position papers and talks. We also accept talk proposals for papers that have appeared at some other past conference, but didn?t receive much discussion there due to the conference being cancelled or virtual because of Covid. A non-exclusive list of topics of interest for this workshop is: ? Implementation and optimization of fundamental languages features (from automatic memory management to metaprogramming) ? Runtime systems technology (libraries, virtual machines) ? Static, adaptive, and speculative optimizations and compiler techniques ? Meta-compilation techniques and language-agnostic approaches for the efficient implementation of languages ? Compilers (intermediate representations, offline and online optimizations,?) ? Empirical studies on language usage, benchmark design, and benchmarking methodology ? Resource-sensitive systems (real-time, low power, mobile, cloud) ? Studies on design choices and tradeoffs (dynamic vs. static compilation, heuristics vs. programmer input,?) ? Tooling support, debuggability and observability of languages as well as their implementations Workshop Format The workshop welcomes the presentation and discussion of new ideas and emerging problems. We aim to provide an environment to present and discuss your work at different stages of maturity. Therefore we provide three submission categories: ? Full papers (up to 12 pages), which will be included in the proceedings; ? Position papers (up to 4 pages), for work in progress, ideas in early stages; ? Talks, Demos. Please note that option (1) features a different submission deadline than the rest and will include a short rebuttal period, in which authors will be able to answer reviewers comments. Submission To submit a paper please use the official ?ACM Master article template?, which can be obtained from the ACM Proceedings Template pages. ICOOOLPS features a light-weight double-blind review process. Authors should omit their names in the submission. Use the sigconf option as well as review and anonymous, i.e., place the following at the start of the latex document: \documentclass[sigconf,review,anonymous]{acmart}. ---------------------------------------------------------------------------------------- Program Analysis for WebAssembly (PAW) 2022 ---------------------------------------------------------------------------------------- https://2022.ecoop.org/home/paw-2022 Deadline: Monday, 11th of April ---------------------------------------------------------------------------------------- WebAssembly is a recently introduced portable virtual machine, to which code written in many high-level languages can be compiled in order to be executed in web browsers and other runtimes. There have been several independent efforts to bring static and dynamic analysis tools to the WebAssembly ecosystem. This workshop aims to bring together researchers working in the domain of static and dynamic analyses for WebAssembly. Specifically, this workshop aims to discuss all techniques related to detecting bugs and vulnerabilities in WebAssembly binaries, to build models of such binaries, to prove their correctness, to monitor their execution, or to optimize binaries for running time and binary size. The workshop will be a community-building event to exchange ideas and build collaborations in these domains. To that end, contributions in the form of submitted talks are welcome. The workshop will also hold discussion sessions in order to foster collaborations. Questions? Use the PAW contact form (https://2022.ecoop.org/contact2/paw-2022-papers ). Call for presentations WebAssembly is a recently introduced portable virtual machine, to which code written in many high-level languages can be compiled in order to be executed in web browsers and other runtimes. There have been several independent efforts to bring static and dynamic analysis tools to the WebAssembly ecosystem. This workshop aims to bring together researchers working in the domain of static and dynamic analyses for WebAssembly. Specifically, this workshop aims to discuss all techniques related to detecting bugs and vulnerabilities in WebAssembly binaries, to build models of such binaries, to prove their correctness, to monitor their execution, or to optimise binaries for running time and binary size. The PAW workshop is a community-building event, for exchanging ideas and fostering collaborations in these domains. The workshop will consist of submitted and invited talks, as well as discussion sessions. To that end, we invite submissions for talks in the form of a 1-page abstract delineating at a high-level the content of the proposed presentation. Submission site: https://easychair.org/conferences/?conf=paw2022 Timeline: ? April 11 2022: Submission deadline ? May 2 2022: Acceptance notification ? June 6-10 2022: ECOOP conference ---------------------------------------------------------------------------------------- Programming Local-first Software ---------------------------------------------------------------------------------------- https://2022.ecoop.org/home/plf-2022 Deadline: Friday, 1st of April ---------------------------------------------------------------------------------------- Languages for Multi-Device Collaborative Applications Due to ubiquitous connectivity and cheap availability of user devices from smartphones to desktops, applications supporting multi-device and collaborative use have become more common, and with the Corona pandemic this trend has tremendously accelerated. While most of the distributed applications that we see nowadays are cloud-based, avoiding the cloud can lead to privacy and performance benefits for users and operational and cost benefits for companies and developers. Following this idea, Local-First Software runs and stores its data locally while still allowing collaboration, thus retaining the benefits of existing collaborative applications without depending on the cloud. Many specific solutions already exist: operational transformation, client-side databases with eventually consistent replication based on CRDTs, and even synchronization as a service provided by commercial offerings, and a vast selection of UI design libraries. However, these solutions are not integrated with the programming languages that applications are developed in. Language based solutions related to distribution such as type systems describing protocols, reliable actor runtimes, data processing, machine learning, etc., are designed and optimized for the cloud not for a loosely connected set of cooperating devices. This workshop aims at bringing the issue to the attention of the PL community, and accelerating the development of suitable solutions for this area. Workshop timeline Note: Times are only examples and will change along the main conference and other workshops. We currently plan an in-person event, however, we will keep monitoring the ongoing situation. In case of a virtual workshop, we will ask speakers to prerecord their talk, and organize live Q&A sessions. We do plan to make the workshop accessible to remote participation for non-speakers. ? ~09:30 Keynote (TBA) ? ~10:30 Accepted talk block 1 ? ~13:00 Accepted talk block 2 ? ~16:00 Panel discussion (TBA) Call for Talks and Papers Note: details about the process are still subject to change. Scope of contributions We are looking to advance the state of the art to program local-first software, that is, programs that are useful to a single user while offline, but allow sharing and collaboration when connected. Examples topics include: ? language constructs that enable offline use ? case studies that consider what works well and what is challenging using existing languages ? UI techniques that consider connectivity states ? users, identities, and trust as language constructs ? type systems to track what functionality is available offline ? easy to use APIs for (new and existing) efficient data synchronization algorithms ? dynamic placement techniques that scale down to a single offline device Types of contribution We encourage a range of contributions to facilitate exchange between academia and industry. Specifically, we are looking for: ? Talk proposals of at most 1 page summarizing: ? the content and scope ? the context (speaker, company, research group, larger project, etc.) ? include links to further info if available (an existing published paper, prior talks, project websites, etc.) ? Relevant in progress research papers: ? no format or page limit ? if the paper is longer than 8 pages: include a summary one or two key contributions/sections the reviewers should focus on ? these will receive reviews by the organizing committee focused on potential improvements ? there will be no officially published proceedings, but papers will be listed on the website if the authors agree If accepted, authors of both types of submission are assigned a 25 minute slot for a talk + 5 minutes for questions. In addition, submissions are published on the website. Timeline and submission ? 2022-04-01 Submission closes ? 2022-05-01 Notification of accepted papers Use the submission link at the top of the right sidebar. For talk proposals, you may either upload a PDF, or put the proposal into the ?abstract? field of the submission site. For in progress papers of more than 8 pages, include the description of what the reviewers should focus on as part of the abstract. In case will would only attend the workshop in person or only via video conferencing, please indicate this as part of the submission (in the abstract field). Questions? Use the PLF contact form (https://2022.ecoop.org/contact2/plf-2022-papers ) ---------------------------------------------------------------------------------------- PRIDE 2022: Workshop on Practical Research IDEs ---------------------------------------------------------------------------------------- https://2022.ecoop.org/home/pride-2022 Deadline: Friday, 15th of April ---------------------------------------------------------------------------------------- Goal of the Workshop The goal of this workshop is to help researchers take their research developments and integrate them easily into existing IDE tools. We are seeking participation from researchers who have developed novel analysis technology and would like an easy way to deploy this technology in existing IDE tools. For example, a new, more-precise taint analysis is nice, but it will be potentially much easier to use and to evaluate if it is available in popular IDE?s?e.g. IntelliJ, VisualStudio Code?in editors?e.g. Sublime Text, Atom?and traditional editors used by programmers?e.g. Emacs, Vim. We welcome researchers who are interested in IDE integration of program analyses to submit talk proposals (see Call for Talks). We will also host a hands-on Panathon session (Call for Participation in Panathon) where participants will be using MagpieBridge to integrate their own program analysis tools. MagpieBridge provides support for accomplishing this: it provides a framework in which a research analysis can be invoked from standard IDE?s. The underlying mechanism makes use of the Language Server Protocol (LSP), but that is completely hidden by a straightforward API that allows analyses to be invoked on source projects from IDE?s and report results that get displayed in idioms natural to each IDE. Such functionality could benefit a wide range of research tools, and so we encourage participation by bringing either your own research analysis or any analysis that you would like to see in a tool. Preliminary Workshop Program Date: Tuesday, 7 June 2022 Time Session 09:00 - 09:15 ? Welcome by the organizers 09:15 - 12:00 ? Invited Talks (See Call for Talks) 13:00 - 14:00 ? MagpieBridge Tutorial 14:00 - 17:00 ? Panathon (See Call for Participation in Panathon) 17:00 - 18:30 ? Demonstration and Best IDE Integration Award Questions? Use the PRIDE contact form (https://2022.ecoop.org/contact2/pride-2022 ) --- Call for Talks --- We look for talk proposals for the Invited Talks session. We welcome submissions addressing the following topics: ? Past experience with integrating program analyses into IDEs. E.g, it would describe an integration into an IDE, and discuss how MagpieBridge simplified it. It could contrast MagpieBridge with other integrations, or it could show issues using MagpieBridge and possible improvements, ? Tool demonstration. A tool demonstration should show a running analysis integrated into IDEs, and the talk would focus on how the information is displayed and how the mechanisms are used to show the analysis. ? Report of user experience and expectation. A report of user experience would discuss user studies of IDE integration of program analyses. It should focus on how the integration works, what informations is displayed, how the study was designed and results. ? Explainability of analysis result. Explainability of analysis results would describe novel IDE mechanisms for displaying results, and how that was done. For instance, mechanisms for showing interprocedural data-flow paths. Authors of accepted proposals will be invited to give a talk (10 - 15 mins + 5 mins Q&A) at the workshop. How to Submit All submissions must confirm to the ECOOP 2022 formatting instructions and must not exceed 2 pages for the main text, inclusive of all figures and tables. Reference has no page limit. The submission is non-blind. Please include your name, e-mail and affiliation in the submission. The proposal should describe: motivation, background about the program analysis tool, lessons learned or features of the IDE integration, looks of the analysis result in IDE, user feedbacks, challenges for future research. ? Submission deadline: 15. April 2022 ? Submission website: click here ? Accepted talk proposals will be notified by 1. May 2022 --- Call for Participation in Panathon --- Researchers who want to integrate their program analysis tools into IDEs are welcome to participate in the Panathon session, get cool Swag and win the Best IDE Integration Award with prize money. Before the Panathon session, participants will be given a tutorial on how to use MagpieBridge for integrating program analysis tools into IDEs. During the Panathon session, participants will be given three hours to build an IDE integration of their analysis tools using MagpieBridge. Afterwards, each participant will be given 5 minutes to demonstrate an integrated analysis tool. The demonstration will be evaluated by a panel of judges. A winner will be chosen and receive the Best IDE Integration Award. All participants will get cool Swag as a gift from the organizers. For participation, the idea is to create integration, so the ideal analysis will already work on code and produce some kind of result amenable to displaying in an IDE, such as issues or warnings about specific code constructs or variables. How to participate Participants first need to register their interests by providing some basic information such as the background of the analysis tool that needs to be integrated into IDEs. ? Registration link: click here ? Registration deadline: 15. April 2022. ? Selected participants for the Panathonn session will be notified by 1. May 2022. ? Selected participants come to the workshop and build IDE integration for their analysis tools. ? A winner will be selected after the demonstration of integrated analysis tools. Guidelines MagpieBridge is designed to be broadly useful, but there are a few guidelines as to what sort of analysis would likely work best. Consult these guidelines to understand whether your analysis would be easy to integrate and whether you could display information as you would like: 1. Ease of use ? The MagpieBridge wiki provides documentation and tutorials. ? MagpieBridge is available on Maven Central. It can be easily added to projects using common build tools such as Maven and Gradle. 2. Performance and language requirements ? MagpieBridge is largely asynchronous with respect to the IDE, so analysis computation time will never block the IDE and results are reported when they are ready. Latency-sensitive features such as hovers can have results computed during analysis, so analysis computation time can be hidden even there. This increases the amount of analysis time that is tolerable compared to on-demand analysis; however, analyses that take excessive amounts of time would not be suitable. ? MagpieBridge is written in Java, which makes integrating analyses also written in Java simplest. However, the protocol for communicating with analyses is straightforward, and we will support projects communicating with other languages with JNI bindings when appropriate and also with JSON messaging when that is most convenient. As such, the language in which your analysis is written should not be an issue for taking part in the hackathon. 3. How analysis results can be displayed MagpieBridge largely supports functionality provided by LSP, with a focus on three features given below, but also provides a mechanism to integrate arbitrary HTML pages including forms and JavaScript. The three focus features are the following: ? Diagnostics are the kind of error, warning and informational messages commonly supported in IDE?s. MagpieBridge provides an API for returning these kinds of messages, which then get displayed by the IDE using its usual mechanisms. ? Hovers are messages that pop up when the mouse hovers over a specific code segment . Note that LSP in most IDE?s integrates its hovers seamlessly with any other hover messages that the IDE generates. ? Code lenses are comments injected into program buffers by the IDE, typically accentuated by means of different fonts or colors. These lenses can be linked to actions that interact with the analysis. ? Code actions such as quick fixes, displaying a HTML page which presents more complex information. MagpieBridge does not support wholesale changes to the IDE, but, using the HTML integration mechanism, it allows non-trivial views to e.g. configure an analysis or display results. This HTML integration is robust across all IDE?s supported: if an IDE provides such a mechanism (e.g. VS Code), MagpieBridge uses it; otherwise these views would show up in the user?s Web browser. 4. How analysis results can be used MagpieBridge supports the LSP notion of code actions, in which an analysis provides a code range from the program and the text with which it would like to replace that range. This is the primary mechanism, but it is straightforward to extend it to multiple ranges for a single fix. MagpieBridge supports arbitrary HTML documents, which can be used by an analysis to display more complex information than can be easily rendered in a hover. For example, a detailed description of a security warning could be displayed for a brief error message, a data-flow path could be displayed in a graph-like structure. We encourage student participants with limited funding to apply for student volunteers at ECOOP. ---------------------------------------------------------------------------------------- Truffle 2022: Truffle/GraalVM Languages Workshop ---------------------------------------------------------------------------------------- https://2022.ecoop.org/home/truffle-2022 Deadline: Saturday, 30th of April ---------------------------------------------------------------------------------------- The Truffle/GraalVM Languages Workshop is intended to bring together researchers and developers from both industry and academia that work with the technologies offered by the Truffle language framework and the GraalVM runtime, as well as those working on related approaches pertaining to specializing dynamic language runtimes and tooling. The workshop is meant to foster the exchange of experiences of working with Truffle, provide introductions to Truffle & GraalVM to developers interested in starting their own projects, present specific implementation aspects of existing languages on Truffle, and discuss limitations and future directions of language implementation frameworks in general and Truffle/GraalVM in particular. The format of the workshop will include both presentations of current research and experiences in dynamic language runtime and tool implementations, as well as tutorial-style presentations of specific aspects of using Truffle and GraalVM. We explicitly encourage presentations of work-in-progress as well as work in the early exploration phases to solicit early feedback from and foster discussion with other experienced language developers. Questions? Use the Truffle contact form (https://2022.ecoop.org/contact2/truffle-2022 ) Call for Participation: We solicit discussion topic proposals, describing both ongoing and future projects, in the form of extended (1-3 page) abstracts. The discussion topics include but are not limited to the following areas: ? Case studies of existing language implementations on Truffle and/or GraalVM. ? Comparing alternative language implementation techniques to Truffle. ? Performance analysis and/or optimizations for GraalVM and Truffle language implementations. ? Tooling support for Truffle languages and GraalVM. ? Infrastructure-level optimizations and extensions that can benefit languages built with Truffle. ? Research project proposals utilizing Truffle and/or GraalVM. Depending on the number of accepted submissions, we expect topics to cover between 30 minutes and 60 minutes time slots at the workshop. All proposals should be submitted by email to Tim Felgentreff ? Deadline for proposal submissions: Apr 30, 2022 (by 11:59 PM AoE) ? Notification: May 6, 2022 Although we would like to encourage participants to join the workshop in person, we are planning for a hybrid event due to the continued uncertainties surrounding travel. Please indicate if you plan to attend in person or via video conferencing. ---------------------------------------------------------------------------------------- VORTEX 2022: Workshop on Verification and mOnitoring at Runtime EXecution ---------------------------------------------------------------------------------------- https://2022.ecoop.org/home/vortex-2022 Deadline: Monday, 18th of April ---------------------------------------------------------------------------------------- Runtime Monitoring (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. 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 18 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} Proceedings Depending on the quality and number of submissions, the workshop proceedings will be published in the ACM DL, and authors of selected papers will be invited to contribute with extended versions to be included in a special issue of the Journal of Object Technology (JOT) Questions? Use the VORTEX contact form (https://2022.ecoop.org/contact2/vortex-2022 ) ---------------------------------------------------------------------------------------- Carolin Brandt PhD Student // she/her // ?? ?? ?? TU Delft // EEMCS // Software Engineering Research Group // TestShift Project E c.e.brandt at tudelft.nl // T https://twitter.com/laci_noire // W https://carolin-brandt.de/ -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: signature.asc Type: application/pgp-signature Size: 833 bytes Desc: Message signed with OpenPGP URL: From bernhard at sussex.ac.uk Fri Apr 1 11:06:29 2022 From: bernhard at sussex.ac.uk (Bernhard Reus) Date: Fri, 1 Apr 2022 15:06:29 +0000 Subject: [TYPES/announce] Lecturer Positions in Computer Science at Sussex Message-ID: The Department of Informatics at the University of Sussex (UK) is advertising four lectureship positions (equivalent to Assistant Professor) in Computer Science and Artificial Intelligence. Applications are welcome from academics with experience in _any_ area of Computer Science. Lecturers are expected to teach at undergraduate an postgraduate level and will be associated with one of our research groups: Artificial Intelligence, Creative Technology, and Foundations of Software Systems; the latter being the natural home for Theoretical Computer Science - including type theory and logic. More details can be found at: https://urldefense.com/v3/__https://www.sussex.ac.uk/about/jobs/lecturer-com-sci-8058__;!!IBzWLUs!FKHCVCFtjSAPqLictNb3zEuwmQjmijVjUvI6ebglXGD9dF8C1YLHgo6L5aSCCggKa8teYdCvsgxSNQ$ Closing date is May, 9th. Best, Bernhard From mihaela.sighireanu at ens-paris-saclay.fr Sat Apr 2 03:43:35 2022 From: mihaela.sighireanu at ens-paris-saclay.fr (Mihaela Sighireanu) Date: Sat, 2 Apr 2022 09:43:35 +0200 Subject: [TYPES/announce] CFP SL-COMP 2022 Message-ID: <03dc16b8-2b45-e256-9b91-dac76301e1c5@ens-paris-saclay.fr> SL-COMP 2022 Separation Logic Competition Fourth edition https://urldefense.com/v3/__https://sl-comp.github.io/__;!!IBzWLUs!H3YWEA227Zk7CIt-ajlyaLR3aVCKL8nZ92Von4NqCRGNOXz_Y8PjNjbrQsrgcK4nhMntvxE3nQr70Q$ part of the FLoC 2022 Olympic Games and ASL 22 Workshop at IJCAR 31 July 2022 The fourth edition of the Separation Logic Competition (SL-COMP) is directed at solvers for fragments of Separation Logics. The competition started at FLoC 2014 and continued to attract new solvers and to improve its benchmarks during the following editions at FLoC 2018 and TOOLympics 2019. SL-COMP compares the performances of sound, fully automatic solvers for Separation Logics in terms of: + fragments dealt, + number of problems solved for each fragment, and + average runtime for problems solved. The benchmark foreseen for this edition includes various extensions of the symbolic heap fragment (quantified or quantifier-free formulas, various classes of inductively defined predicates, arithmetic constraints) and the general boolean combination of SL atoms. New problems may be proposed for the existing divisions or for new divisions. The proposals should be sent by email to the competition's organisers. The participants can register their solver by sending to organisers a short description, a web page, and a corresponding person. The corresponding person will be in charge of providing a version of the tool compatible with the StarExec platform (https://urldefense.com/v3/__http://www.starexec.org__;!!IBzWLUs!H3YWEA227Zk7CIt-ajlyaLR3aVCKL8nZ92Von4NqCRGNOXz_Y8PjNjbrQsrgcK4nhMntvxE-OIP1pw$ ) and of training the solver on the final benchmark of the competition. The participating solvers will be invited to present (online) their tool at a session dedicated to SL-COMP during the Advancing Separation Logic (ASL 2022) workshop: https://urldefense.com/v3/__https://asl-workshop.github.io/asl22/__;!!IBzWLUs!H3YWEA227Zk7CIt-ajlyaLR3aVCKL8nZ92Von4NqCRGNOXz_Y8PjNjbrQsrgcK4nhMntvxH2z9ulVg$ Further details are available at: https://urldefense.com/v3/__https://sl-comp.github.io/__;!!IBzWLUs!H3YWEA227Zk7CIt-ajlyaLR3aVCKL8nZ92Von4NqCRGNOXz_Y8PjNjbrQsrgcK4nhMntvxE3nQr70Q$ Important dates: ================ - Problems proposals: May 31, 2022 - Solver registration: June 15, 2022 - Training period: June 15 - July 15, 2022 - Competition rounds: July 15 - July 30, 2022 - Presentation of results: July 31, 2022 Organisers of SL-COMP 2022 ========================== Quang Loc Le Mihaela Sighireanu From ariesco at fdi.ucm.es Sun Apr 3 05:14:57 2022 From: ariesco at fdi.ucm.es (ADRIAN RIESCO RODRIGUEZ) Date: Sun, 3 Apr 2022 11:14:57 +0200 Subject: [TYPES/announce] [ICFEM 2022] Last CfP Message-ID: ICFEM 2022 October 24-27, 2022, Madrid, Spain https://urldefense.com/v3/__http://maude.ucm.es/ICFEM22/__;!!IBzWLUs!Cy-h7jAKIdNrA64iSrEz1GfgleVA5z-4FKTqT4rrQ9o7Jnanrh-d-EiGlfFWaZ_xfA60JpTYW5FeGg$ Overview -------- ICFEM is an international leading conference series in formal methods and software engineering. Since 1997, ICFEM has been serving as an international forum for researchers and practitioners who have been seriously applying formal methods to practical applications. Researchers and practitioners, from industry, academia, and government, are encouraged to attend, present their research, and help advance the state of the art. ICFEM is interested in work that has been incorporated into real production systems, and in theoretical work that promises to bring practical and tangible benefit. ICFEM has been hosted in many countries around the world. Participation ------------- We expect ICFEM 2022 to take place physically. However, in case any participant requires to assist/present virtually we will provide support for attending the conference online. Topics of Interest ------------------ Authors are invited to submit high quality technical papers describing original and unpublished work in all theoretical aspects of software engineering. Topics of interest include, but are not limited to: - Abstraction, refinement and evolution - Formal specification and modelling - Formal verification and analysis - Model checking - Formal approaches to software testing and inspection - Formal methods for self-adaptive systems - Formal methods for object-oriented systems - Formal methods for component-based systems - Formal methods for concurrent and real-time systems - Formal methods for cloud computing - Formal methods for cyber-physical systems - Formal methods for software safety and security - Formal methods for software reliability and dependability - Development, integration and experiments involving verified systems - Formal certification of products under international standards - Formal model-based development and code generation Important Dates --------------- Workshop/Tutorial Proposals: March 13, 2022 (send your proposals to ariesco at ucm.es) Abstract Submission: April 10, 2022 (AOE) Paper Submission: April 17, 2022 (AOE) Author Notification: June 26, 2022 Camera-ready versions: July 10, 2022 Conference: October 24-27, 2022 Publication ----------- The proceedings of the ICFEM 2022 symposium are planned to be published in Lecture Notes in Computer Science (Springer). The authors of a selected subset of accepted papers will be invited to submit extended versions of their papers to a special issue in journals indexed in the JCR. In particular, selected papers in the topics of the Journal of Logical and Algebraic Methods in Programming will be invited to a special issue. Invited speakers ---------------- Santiago Escobar (Universitat Polit?cnica de Val?ncia) Xiaowei Huang (University of Liverpool) Yuan Feng (University of Technology Sydney) Paper submission ---------------- Submission should be done through the ICFEM 2022 submission page, handled by the EasyChair conference system: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=icfem2022__;!!IBzWLUs!Cy-h7jAKIdNrA64iSrEz1GfgleVA5z-4FKTqT4rrQ9o7Jnanrh-d-EiGlfFWaZ_xfA60JpSMtd2odg$ . As in previous years, the proceedings will be published in the Springer Lecture Notes in Computer Science series. Papers should be written in English and should not exceed 16 pages (including references) in the 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 (more details at https://urldefense.com/v3/__https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines__;!!IBzWLUs!Cy-h7jAKIdNrA64iSrEz1GfgleVA5z-4FKTqT4rrQ9o7Jnanrh-d-EiGlfFWaZ_xfA60JpQ3qL7kfw$ ). -------------- next part -------------- An HTML attachment was scrubbed... URL: From klin at mimuw.edu.pl Sun Apr 3 05:40:47 2022 From: klin at mimuw.edu.pl (Bartek Klin) Date: Sun, 3 Apr 2022 10:40:47 +0100 Subject: [TYPES/announce] CONCUR 2022 - last CFP Message-ID: CONCUR 2022: last call for papers ============================== September 12-16, 2022 at the University of Warsaw, Poland Website: https://urldefense.com/v3/__https://concur2022.mimuw.edu.pl/__;!!IBzWLUs!DtbMsf6MZOcR7adrATLgtz1w34Qpb6r9MP6El9wxLLXJScuQGB2-nuaZm6F56hHmI86lmBfCuN8G8g$ 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) SATELLITE WORKSHOPS Combined 29th Workshop on Expressiveness in Concurrency / 19th Workshop on Structural Operational Semantics (EXPRESS/SOS 2022) 11th IFIP WG 1.8 Workshop on Trends in Concurrency Theory (TRENDS 2022) 8th International Workshop on Symbolic-Numeric Methods for Reasoning about CPS and IoT (SNR 2022) 10th Young Researchers Workshop on Concurrency Theory (YR-CONCUR 2022) 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, 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!DtbMsf6MZOcR7adrATLgtz1w34Qpb6r9MP6El9wxLLXJScuQGB2-nuaZm6F56hHmI86lmBf-Kc1T5w$ 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 From brucker at spamfence.net Sun Apr 3 11:42:54 2022 From: brucker at spamfence.net (Achim D. Brucker) Date: Sun, 3 Apr 2022 16:42:54 +0100 Subject: [TYPES/announce] Fully Funded PhD Positions in the Safety and Security of Advanced Systems Group (Exeter, UK, Deadline 2022-04-29) Message-ID: We have two fully funded PhD scholarships for UK applicants 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), * software security, * cyber-physical systems, * specification-based testing, and * design and implementation of security architectures. The positions offer the flexibility to define the PhD topic jointly between the successful candidate and the supervisors. Interested candidates should contact the potential supervisor 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!F0-tj2AYOeTeUP7_YdraVBi4w1o1Igfqr65GYgQXUNHb3Zt0_ylAoPgb5OZ6SMzJxW8xtkUHFapRVQ$ * Formal Verification for Safety- or Security-Critical Systems: https://urldefense.com/v3/__https://www.exeter.ac.uk/study/funding/award/?id=4328__;!!IBzWLUs!F0-tj2AYOeTeUP7_YdraVBi4w1o1Igfqr65GYgQXUNHb3Zt0_ylAoPgb5OZ6SMzJxW8xtkWEfgCTVg$ The closing date for applications is midnight on the 29th April 2022. Best, Achim and Diego [1] https://urldefense.com/v3/__http://emps.exeter.ac.uk/computer-science/research/cyber-security/__;!!IBzWLUs!F0-tj2AYOeTeUP7_YdraVBi4w1o1Igfqr65GYgQXUNHb3Zt0_ylAoPgb5OZ6SMzJxW8xtkVFGKd9rw$ [2] https://urldefense.com/v3/__https://www.brucker.ch/__;!!IBzWLUs!F0-tj2AYOeTeUP7_YdraVBi4w1o1Igfqr65GYgQXUNHb3Zt0_ylAoPgb5OZ6SMzJxW8xtkUCx7d8Uw$ [3] https://urldefense.com/v3/__https://marmsoler.com/__;!!IBzWLUs!F0-tj2AYOeTeUP7_YdraVBi4w1o1Igfqr65GYgQXUNHb3Zt0_ylAoPgb5OZ6SMzJxW8xtkU8Bqfpsg$ [4] https://urldefense.com/v3/__http://emps.exeter.ac.uk/computer-science/__;!!IBzWLUs!F0-tj2AYOeTeUP7_YdraVBi4w1o1Igfqr65GYgQXUNHb3Zt0_ylAoPgb5OZ6SMzJxW8xtkVN8oA1KA$ -- Prof. Achim Brucker | Chair in Cybersecurity & Head of Group | University of Exeter https://urldefense.com/v3/__https://www.brucker.ch__;!!IBzWLUs!F0-tj2AYOeTeUP7_YdraVBi4w1o1Igfqr65GYgQXUNHb3Zt0_ylAoPgb5OZ6SMzJxW8xtkWcik8V8A$ | https://urldefense.com/v3/__https://logicalhacking.com/blog__;!!IBzWLUs!F0-tj2AYOeTeUP7_YdraVBi4w1o1Igfqr65GYgQXUNHb3Zt0_ylAoPgb5OZ6SMzJxW8xtkUQ40hufA$ @adbrucker | @logicalhacking From emanuela.merelli at unicam.it Sun Apr 3 17:14:43 2022 From: emanuela.merelli at unicam.it (Emanuela Merelli) Date: Sun, 3 Apr 2022 23:14:43 +0200 Subject: [TYPES/announce] ICALP 2024 - call for location Message-ID: CALL FOR LOCATION ICALP 2024 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 international conference was launched in 1972 and covers all aspects of theoretical computer science. ICALP comprises the main, two-track conference over four days, plus a pre- and/or a post-workshop day. We invite proposals for locations to host the 51th ICALP, to be held in the first half of July 2024. Previous (and upcoming) ICALP editions include: ICALP 2023 in Paderborn (Germany) ICALP 2022 in Paris (France) ICALP 2021 in Glasgow (UK), virtual ICALP 2020 in Saarbr?cken (Germany), virtual ICALP 2019 in Patras (Greece) ICALP 2018 in Prague (Czech Rep.) The deadline for proposals is *** May 15, 2022 ***. Proposals or informal enquires should be sent to the President of the EATCS and the SC chair (see contact information below). Selected proposals are to be presented at the General Assembly of the EATCS at ICALP 2022. Proposals should address the following points: - name(s) of the Conference Chair(s) and their host institution - proposed location (and possibly venue) - appropriateness of the proposed dates (including possible holidays or other events) - travel information and estimated transportation costs - estimated accommodation and registration costs - conference facilities (session and plenary rooms, workshop rooms) EATCS president: Artur Czumaj (aczumaj at acm dot org) SC chair: Anca Muscholl (anca at labri dot fr) -------------- next part -------------- An HTML attachment was scrubbed... URL: From qest.publicity at gmail.com Mon Apr 4 16:55:48 2022 From: qest.publicity at gmail.com (QEST Publicity) Date: Mon, 04 Apr 2022 20:55:48 -0000 Subject: [TYPES/announce] QEST 2022: Last Call for Papers Message-ID: <20220404205550.5BDA861897@anxur.fi.muni.cz> An HTML attachment was scrubbed... URL: From balzers at cs.cmu.edu Tue Apr 5 15:24:42 2022 From: balzers at cs.cmu.edu (Stephanie Balzer) Date: Tue, 5 Apr 2022 15:24:42 -0400 Subject: [TYPES/announce] ECOOP Doctoral Symposium 2022: 2nd Call for Contributions Message-ID: <1D91EC3E-8236-40EF-9000-0CE3F9210A5D@cs.cmu.edu> 2nd Call for Contributions The ECOOP Doctoral Symposium https://urldefense.com/v3/__https://2022.ecoop.org/track/ecoop-2022-doctoral-symposium__;!!IBzWLUs!BU9nbUDcj2--pcN9CeRNSfMTRVgb9GmPhEVHkAZWylzchGWZUWsCQ8rLPpcb--9WtbdZO8XN4SnDxw$ provides a forum for PhD students at any stage in their research to get detailed feedback and advice. We welcome contributions in all aspects of practice and theory of programming languages, systems and environments, ranging the whole spectrum from novel ideas to evaluation of existing solutions. There are distinct submission instructions for junior and senior PhD students: Junior students may not have a full research plan but shall have an identified research topic; they will present their ideas and any progress to date, and will receive feedback to help them determine further steps in research. Senior students are expected to give an outline of their thesis research and will receive feedback to help them successfully complete their thesis and defense/viva. As participants of the Doctoral Symposium are not expected to submit technical papers, but rather thesis proposals, participants can submit to both the main conferences/workshops and the Doctoral Symposium. There will be no proceedings for the Doctoral Symposium. Submissions will be carried out electronically via HotCRP (link TBD). To submit, upload a pdf and specify the submission category (junior or senior). Please, also specify the PC members that have conflicts of interest with your submission. Students of accepted submissions are expected to attend the entire doctoral symposium. Junior PhD Students Submit a 4?8 page (excluding bibliography) research proposal in the Dagstuhl LIPIcs format with: a problem description; a detailed sketch of a proposed approach; related work. It is not necessary to present concrete results. Instead, try to inform the reader that you have a (well-motivated) problem and present a possible solution. Attempt to provide a clear roadmap detailing future research efforts. Senior PhD Students The experience for senior students is meant to mimic a ?mini-defense? interview. Aside from the actual feedback, this helps the student gain familiarity with the style and mechanics of such an interview (advisors of student presenters will not be allowed in). The students should be able to present: the importance of the problem; a clear research proposal; some preliminary work; an evaluation plan. Please submit a 6?10 page (excluding bibliography) thesis proposal in the Dagstuhl LIPIcs format with the following: Problem Description What is the problem? What is the significance of this problem? Why can the current state of the art not solve this problem? Goal Statement What is the goal of your research? What artifacts (tools, theories, methods) will be produced, How do they address the stated problem? Method What experiments, prototypes, or studies need to be produced/executed? What is the validation strategy? How will it show the goal was reached? This isn?t a technical paper, don?t focus on technical details, but rather on the research method. Deadline: April 22, 2022 (AoE) -------------- next part -------------- An HTML attachment was scrubbed... URL: From albl at dtu.dk Wed Apr 6 07:23:24 2022 From: albl at dtu.dk (Alberto Lluch Lafuente) Date: Wed, 6 Apr 2022 13:23:24 +0200 Subject: [TYPES/announce] Assistant/Associate Professor positions at the Technical University of Denmark Message-ID: Dear colleagues, We have recently established a new section in software systems engineering at the Technical University of Denmark: https://urldefense.com/v3/__https://www.compute.dtu.dk/english/research/research-sections/software-systems-engineering__;!!IBzWLUs!DL6MDnZRkBhZTttT0kJMsL715dyzJJUghlUYjk_6gq4ERQAgqIfVI5lzjZD-8DNvKvwUxG7-M45spw$ We are now hiring faculty members for the team. We expect to hire 2 new assistant/associate professors. Details can be found here: https://urldefense.com/v3/__https://www.dtu.dk/english/about/job-and-career/vacant-positions/job?id=0c35cb4e-9d1c-40a6-9f0a-6be1180715d5__;!!IBzWLUs!DL6MDnZRkBhZTttT0kJMsL715dyzJJUghlUYjk_6gq4ERQAgqIfVI5lzjZD-8DNvKvwUxG5moDX3Vw$ Deadline: May 30, 2022. Feel free to share. Best regards, Alberto -- Alberto Lluch Lafuente Full Professor & Head of Section @ DTU Compute Technical University of Denmark --------------------------------------------------------------------------------- Richard Petersens Plads, Building 321, Room 012 2800 Kgs. Lyngby --------------------------------------------------------------------------------- albl at dtu.dk https://urldefense.com/v3/__https://people.compute.dtu.dk/albl/__;!!IBzWLUs!DL6MDnZRkBhZTttT0kJMsL715dyzJJUghlUYjk_6gq4ERQAgqIfVI5lzjZD-8DNvKvwUxG6J3xorfQ$ +45 31241447 -------------- next part -------------- An HTML attachment was scrubbed... URL: From madeira at ua.pt Wed Apr 6 08:26:35 2022 From: madeira at ua.pt (Alexandre Madeira) Date: Wed, 6 Apr 2022 12:26:35 +0000 Subject: [TYPES/announce] WADT'22 - 26th International Workshop on Algebraic Development Techniques 2022 (2nd cfp) Message-ID: <1BA009F9-8333-4705-A4DF-FF31D9747E2C@ua.pt> =================================================================================== WADT'22 - 26th International Workshop on Algebraic Development Techniques 2022 ****************** Second call for papers ****************** **** UPDATES: Deadline Extension and Invited Speakers ****** https://urldefense.com/v3/__http://wadt2022.web.ua.pt__;!!IBzWLUs!AjqaXEH5oHv8cbJqhUVPT1PjoFarfL8EqxtMxqVDusJOZ002TtVbMTim22gvZcXX_YOHhE7B-dYI_g$ Aveiro, 28-30 June, 2022 =================================================================================== ** Aims and Scope ** The algebraic approach to system specification encompasses many aspects of the formal design of software systems. Originally born as a formal method for reasoning about abstract data types, it now covers new specification frameworks and programming paradigms (such as object-oriented, aspect oriented, agent-oriented, logic and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed and mobile systems). The workshop will provide an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends. In 2020 WADT features additionally two special thematic tracks: one in *Algebra for timed and hybrid systems* and another in *Algebraic approaches to quantum computation*. ** Main track ** Typical, but not exclusive topics of interest for the main track are: - Foundations of algebraic specification - Other approaches to formal specification, including process calculi and models of concurrent and distributed systems - Specification languages, methods, and environments - Semantics of conceptual modelling methods and techniques - Integration of formal specification techniques - Formal testing and quality assurance, validation, and verification ** Algebra for timed and hybrid systems ** Track Chair: Renato Neves (UM, PT) The track 'Algebra for timed and hybrid systems' seeks algebraic contributions towards a better understanding of timed and hybrid systems, including their design and verification. A non-exhaustive list of topics includes: - (co)algebraic syntax and semantics, - observational notions of equivalence, - equational reasoning and variants thereof, - distributed and/or concurrent computing; - modal and temporal logic, - (co)algebraic verification tools, - experience reports on the use of (co)algebraic tools. ** Algebraic approaches to quantum computation ** Track Chair: Rui Soares Barbosa (INL, PT) This track seeks contributions on algebraic methods in the context of quantum computing, broadly understood, ranging from foundations to applications and tools. A non-exhaustive list of topics includes: - foundational structures for quantum computing - quantum calculi and logics - quantum programming languages - algebraic and categorical semantics for quantum computing - algebraic approaches to verification of quantum programs - rewriting and automated reasoning with applications to quantum compilation and optimisation - tool support - application of quantum algebra to quantum computing and beyond ** Invited Speakers ** - Radu Mardare University of Strathclyde, UK - Jos? Meseguer University of Illinois at Urbana-Champaign, US - Jos? Nuno Oliveira Universidade do Minho, PT - Peter Selinger Dalhousie University, CA ** Workshop format and location ** WADT'22 is planned to be realised in a family-owned guesthouse with panoramic views to lagoon Pateira de Fermentelos, 20 minutes from the centre of Aveiro. The registration fees, that includes the event registration, accommodations and meals, will be around EUR 500 for standard and EUR 300 for student participants. Instructions will be available soon at https://urldefense.com/v3/__http://wadt2022.web.ua.pt__;!!IBzWLUs!AjqaXEH5oHv8cbJqhUVPT1PjoFarfL8EqxtMxqVDusJOZ002TtVbMTim22gvZcXX_YOHhE7B-dYI_g$ . ** Submissions and Publications ** Presentations will be selected on the basis of submitted abstracts. The abstracts must be up to two pages long including references. If a longer version of the contribution is available, it can be made accessible on the web and referenced in the abstract. The abstracts have to be submitted electronically via the EasyChair link https://urldefense.com/v3/__https://easychair.org/conferences/?conf=wadt2022__;!!IBzWLUs!AjqaXEH5oHv8cbJqhUVPT1PjoFarfL8EqxtMxqVDusJOZ002TtVbMTim22gvZcXX_YOHhE5gmjOm5A$ . WADT 2022 is organised by IFIP WG 1.03. As an IFIP event, post-proceedings will be published by Springer in the LNCS series. The deadline for the submission of full papers to be considered in this volume, to be announced during the workshop, are expected to the end of September 2022. ** Important dates ** April 15 (Extended) Contributed Abstracts April 25 (Extended) Notifications about the contributed talks TBA: full papers (Expected to September) ** Organisation ** * Steering Committee * Andrea Corradini (IT) Jos? Fiadeiro (UK) Rolf Hennicker (GE) Alexander Knapp (GE) Hans-J?rg Kreowski (GE) Till Mossakowski (GE) Fernando Orejas (SP) Leila Ribeiro (BR) Markus Roggenbach (UK) Grigore Ro?u (US) * Program Committee * Erika Abraham (RWTH Aachen, NL) Luis S. Barbosa (U. Minho, PT) Rui S. Barbosa (INL, PT) [Track Chair] Carlos Caleiro (U. Lisboa, PT) Andrea Corradini (U. Pisa, IT) Jos? Luiz Fiadeiro (U. Dundee, UK) Ichiro Hasuo (National Institute of Informatics, JP) Rolf Hennicker (LMU, DE) Marieke Huisman (U. Twente, NL) Martti Karvonen (U. Ottawa, CN) Aleks Kissinger (U. Oxford, UK) Alexander Knapp (U. Augsburg, DE) Alexandre Madeira (U. Aveiro, PT) [Co-chair] Manuel A. Martins (U. Aveiro, PT) [Co-chair] Narciso Marti-Oliet (U. Complutense de Madrid, SP) Dominique Mery (LORIA, FR) Till Mossakowski (U. Magdeburg, DE) Renato Neves (U. Minho, PT) [Track Chair] Peter ?lveczky (U. Oslo, NR) Fernando Orejas (U. Polit?cnica Catalunya, SP) Markus Roggenbach (Swansea University, UK) Georg Struth (U. Sheffield, UK) Ionut Tutu (Simion Stoilow Institute of Mathematics, RO) Beno?t Valiron (Univ. Paris Saclay, FR) Vladimir Zamdzhiev (Inria, FR) ** Contacts ** For any information, please contact us to wadt2022 at easychair.org From deian at cs.ucsd.edu Wed Apr 6 14:37:11 2022 From: deian at cs.ucsd.edu (Deian Stefan) Date: Wed, 6 Apr 2022 11:37:11 -0700 Subject: [TYPES/announce] Student applications for PLMW @ PLDI 2022 Message-ID: CALL FOR APPLICATIONS ACM SIGPLAN Programming Languages Mentoring Workshop Co-located with PLDI 2022 June 13-14, 2022 https://urldefense.com/v3/__https://pldi22.sigplan.org/track/PLMW-PLDI-2022__;!!IBzWLUs!DJvoDIyxMaFHNI2cfFW03JkgpBBeDa0hMkhlT7wPpx4VIgjh9Ct-dQu1S8pV3gtUZ_IjfAC_aEGPxA$ The Programming Language Mentoring Workshop (PLMW) aims 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 research careers, technical sessions that cover core subfields of programming languages research, and social sessions that create opportunities for students to interact with researchers in the field. PLMW at PLDI 2022 will be held on June 13-14 in San Diego, immediately before the Programming Languages Design and Implementation (PLDI) conference. PLMW at PLDI 2022 will be organized as a hybrid event. Most speakers and all panelists will be present in person. Students will be able to choose between in-person and virtual participation when they apply. We will try to provide an excellent experience to both in-person and virtual participants, but informal interactions during breaks will be limited to in-person participants only. PLMW at PLDI 2022 will offer a limited number of scholarships to students who wish to participate in person but cannot cover the costs from other sources. These scholarships will cover the PLDI registration fee, the cost of accommodation shared with another student, and reasonable trip expenses. Similarly, a limited number of scholarships are available to students who wish to participate virtually. These scholarships will cover the PLDI registration fee only. To participate, you must apply online at https://urldefense.com/v3/__https://forms.gle/ydGX35fEAty55JEV9__;!!IBzWLUs!DJvoDIyxMaFHNI2cfFW03JkgpBBeDa0hMkhlT7wPpx4VIgjh9Ct-dQu1S8pV3gtUZ_IjfAC1XIlxgQ$ . The application form asks whether you prefer to attend in person or virtually, and whether you need a scholarship to cover your expenses. Note that the number of participation spots and the number of available scholarships are both limited, so do not register for the event or make any travel plans till you receive the result of your application. Submit your application by April 26 for full consideration. PLMW @ PLDI 2022 specifically welcomes applications from members of underrepresented groups in computing. Best regards, PLMW at PLDI 2021 Organizing Committee Deepak Garg, MPI-SWS, Germany Limin Jia, CMU, USA Tamara Rezk, Inria, France Deian Stefan, UCSD, USA From clemens.grabmayer at gssi.it Mon Apr 4 01:33:42 2022 From: clemens.grabmayer at gssi.it (Clemens Grabmayer) Date: Mon, 4 Apr 2022 07:33:42 +0200 Subject: [TYPES/announce] TERMGRAPH 2022 Workshop: Second Call for Papers Message-ID: ======================================================================== Second Call for Papers TERMGRAPH 2022 Twelfth International Workshop on Computing with Terms and Graphs https://urldefense.com/v3/__http://termgraph.org.uk/2022__;!!IBzWLUs!F84rAB2Jq2rcgi2CypCPAh2upY43zCSr4AbJ8QThF9pnbPVUfQ7AfUruScB5Jn35BC0E97z2rNcPGA$ Technion, Haifa, Israel Monday, 1st August 2022 *) A Workshop that is part of FLoC 2022 ======================================================================== *) preliminary, due to room capacity decisions the FLoC organizers can reschedule to Sunday, 31st July 2022 (decision on 15 June 2022) Graphs and graph transformation systems are used in many areas within Computer Science: to represent data structures and algorithms, to define computation models, as a general modeling tool to study complex systems, etc. Topics of interest for TERMGRAPH encompass all aspects of term-/graph rewriting (term-graph and graph rewriting), and applications of graph transformations in programming, automated reasoning and symbolic computation, including: * Theory of first-order and higher-order term graph rewriting * Graph rewriting in lambda calculus (sharing graphs, optimality) * Term-/graph based models of computation * Graph grammars * Term-/graph based languages and modelling frameworks * Term-/graph rewriting tools: -- system descriptions and case studies * Applications of term-/graph rewriting in, and term-/graph rewriting aspects of: -- semantics and implementation of programming languages -- compiler construction -- interaction nets and proof nets -- software engineering -- automated reasoning and symbolic computation -- functional and logic programming -- pattern recognition -- bioinformatics The aim of this workshop is to bring together researchers working in these different domains, to foster their interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in this area. Invited Speaker(s): ------------------- Joerg Endrullis, Vrije Universiteit Amsterdam, The Netherlands (Second invited speaker to be announced in April) Submissions and Publication: ---------------------------- We invite submissions of extended abstracts of at most 8 pages typeset in EPTCS (Electronic Proceedings in Theoretical Computer Science) style. This may include, concerning any of the topics above: -- original work, -- tutorials, -- work in progress, -- system descriptions of term-/graph rewriting tools. Extended abstracts have to be submitted no later than 10 May 2022 (AoE) electronically (pdf) via the EasyChair submission site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=termgraph2022__;!!IBzWLUs!F84rAB2Jq2rcgi2CypCPAh2upY43zCSr4AbJ8QThF9pnbPVUfQ7AfUruScB5Jn35BC0E97x0UaMatg$ Papers will be judged on relevance, originality, correctness, and usefulness. Preliminary proceedings will be available for the workshop. After the workshop, authors will be invited to submit a longer version of their work (a 15-pages paper) for the publication of the Workshop Post-Proceedings in EPTCS. These submissions will undergo a second round of refereeing with: submission deadline in the mid of October 2022, notification in December 2022, publication in February or March 2023. Important Dates: ---------------- Submission deadline: 10 May 2022 Notification: 7 June 2022 Program publication: 15 June 2022 PreProceedings version due: 21 June 2022 Workshop: 1 August 2022 (see proviso (*) above) Programme Committee: -------------------- Sandra Alves, Universidade do Porto, Portugal Martin Avanzini, INRIA Sophia Antipolis - M?diterran?e, France Patrick Bahr, IT University Copenhagen, Copenhagen, Denmark Thierry Boy de la Tour, CNRS, France Clemens Grabmayer (chair), Gran Sasso Science Institute, Italy Wolfram Kahl, McMaster University, Canada Ian Mackie, LIX, France Koko Muroya, Kyoto University, Japan Femke van Raamsdonk, Vrije Universiteit Amsterdam, The Netherlands Adrian Rutle, Western Norway University, Norway Kazunori Ueda, Waseda University, Japan Contact: -------- Clemens Grabmayer clemens.grabmayer at gssi.it ======================================================================== From gorla at di.uniroma1.it Mon Apr 4 09:07:50 2022 From: gorla at di.uniroma1.it (Daniele Gorla) Date: Mon, 4 Apr 2022 15:07:50 +0200 Subject: [TYPES/announce] ICTCS'22: preliminary CfP Message-ID: ICTCS 2022 - 23rd Italian Conference on Theoretical Computer Science 7-9 September 2022, Roma, Italy https://urldefense.com/v3/__https://easyconferences.eu/ictcs2022/__;!!IBzWLUs!AszmJKcwZ81Uq9OFExTkXllZPAbbT8kQon_niR3eaKmZPazG8NwzEr34Lh7jLaA7o_Rzh_2FT6NViA$ PRELIMINARY 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 regular 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. 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 2023. =============== IMPORTANT DATES =============== Abstract submission: May 15th, 2022 Paper submission: May 22nd, 2022 Notification: June 24th, 2022 Revised version for pre-proceedings: July 17th, 2022 Conference: September 7th-9th, 2022 Final version for CEUR-WS proceedings: September 25th, 2022 (tentative) ================== INVITED SPEAKERS ================== Luca Aceto (Gran Sasso Science Institute and Reykjavik University) Fabrizio Grandoni (IDSIA, USI-SUPSI) ==================== PROGRAM COMMITTEE ==================== Massimo Bartoletti (University of Cagliari) Filippo Bonchi (University of Pisa) Viviana Bono (University of Torino) Pierluigi Crescenzi (Gran Sasso Science Institute) Ugo Dal Lago (co-chair; University of Bologna and INRIA Sophia Antipolis) Simone Faro (University of Catania) Gabriele Fici (University of Palermo) Daniele Gorla (co-chair; "Sapienza" University of Rome) Luciano Gual? (University of Roma ?Tor Vergata?) Zsuzsanna Liptak (University of Verona) Giovanni Manzini (University of Pisa) Carlo Mereghetti (University of Milan) Donatella Merlini (University of Firenze) Claudio Antares Mezzina (University of Urbino) Eugenio Moggi (University of Genova) Alfredo Navarra (University of Perugia) Yuri Pirola (University of Milano-Bicocca) Nicola Prezza (Ca? Foscari University of Venice) Gabriele Puppis (University of Udine) Paola Quaglia (University of Trento) Barbara Re (University of Camerino) Michele Scquizzato (University of Padova) Mirco Tribastone (IMT School for Advanced Studies of Lucca) Emilio Tuosto (Gran Sasso Science Institute) -- ================================ Daniele Gorla Associate Professor in Computer Science Dipartimento di Informatica "Sapienza" Universit? di Roma Viale Regina Elena 295 Palazzina E, 2nd floor, room 205 00161 Roma (IT) tel. +39 06 49255 431 (int. 36431) email: gorla at di.uniroma1.it web: https://urldefense.com/v3/__https://sites.google.com/uniroma1.it/gorla__;!!IBzWLUs!AszmJKcwZ81Uq9OFExTkXllZPAbbT8kQon_niR3eaKmZPazG8NwzEr34Lh7jLaA7o_Rzh_1DHsZjUw$ ================================ -------------- next part -------------- An HTML attachment was scrubbed... URL: From job.caminati at gmail.com Tue Apr 5 09:47:40 2022 From: job.caminati at gmail.com (Marco Caminati) Date: Tue, 5 Apr 2022 15:47:40 +0200 Subject: [TYPES/announce] Vacancy at Lancaster University (Leipzig campus), Deadline 18 April 2022 Message-ID: [Apologies for cross/multiple postings] Dear colleagues, Please find below the advert for a Lecturer or Teaching fellow position in Computing and Software Engineering: https://urldefense.com/v3/__https://hr-jobs.lancs.ac.uk/Vacancy.aspx?ref=LZ11__;!!IBzWLUs!FKsKZKxR3OCOUfmJ5bKk_qp4eCoj6_qOuDV428jsIuIkpaO7lwTb1Du2y7IhfuKu38WARiaeDxnPgA$ Kind regards, Marco Marco Caminati Lecturer in Computing Lancaster University Leipzig Strohsack-Passage, room 604 Nikolaistra?e 10 04109 Leipzig Germany GPS: 51.3410, 12.3782 Landline: +49 341 339 77 646 Email: m.caminati at lancaster.ac.uk https://urldefense.com/v3/__http://www.lancasterleipzig.de__;!!IBzWLUs!FKsKZKxR3OCOUfmJ5bKk_qp4eCoj6_qOuDV428jsIuIkpaO7lwTb1Du2y7IhfuKu38WARibrU4wKTg$ From gsilvia at uns.ac.rs Thu Apr 7 08:31:14 2022 From: gsilvia at uns.ac.rs (Silvia Ghilezan) Date: Thu, 7 Apr 2022 15:31:14 +0300 Subject: [TYPES/announce] LAP 2022 - Logic and Applications: CFP Message-ID: <3B4AC11D-F071-48E5-B062-4C3E9B5BF8E5@uns.ac.rs> ========================================================= [Please broadcast/post/forward. Apologies for duplicates] LAP 2022 CONFERENCE ANNOUNCEMENT LOGIC AND APPLICATIONS - LAP 2022 September 26-29, 2022, Dubrovnik, Croatia https://urldefense.com/v3/__http://imft.ftn.uns.ac.rs/math/cms/LAP2022__;!!IBzWLUs!Fv68--eGTbmI9Sw2MEOV_mAJxnh48MsrZMtrryI7qgp_LY1VNC5MBEFq_lT0ZsDuW9Cb9N8JbmjXZA$ 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; - Model 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 (https://urldefense.com/v3/__http://imft.ftn.uns.ac.rs/math/cms/LAP2013__;!!IBzWLUs!Fv68--eGTbmI9Sw2MEOV_mAJxnh48MsrZMtrryI7qgp_LY1VNC5MBEFq_lT0ZsDuW9Cb9N8TXk_acQ$ ) LAP 2014, September 22-26, 2014 (https://urldefense.com/v3/__http://imft.ftn.uns.ac.rs/math/cms/LAP2014__;!!IBzWLUs!Fv68--eGTbmI9Sw2MEOV_mAJxnh48MsrZMtrryI7qgp_LY1VNC5MBEFq_lT0ZsDuW9Cb9N_a3gg4yQ$ ) LAP 2015, September 21-25, 2015 (https://urldefense.com/v3/__http://imft.ftn.uns.ac.rs/math/cms/LAP2015__;!!IBzWLUs!Fv68--eGTbmI9Sw2MEOV_mAJxnh48MsrZMtrryI7qgp_LY1VNC5MBEFq_lT0ZsDuW9Cb9N_gVqVKIA$ ) LAP 2016, September 19-23, 2016 (https://urldefense.com/v3/__http://imft.ftn.uns.ac.rs/math/cms/LAP2016__;!!IBzWLUs!Fv68--eGTbmI9Sw2MEOV_mAJxnh48MsrZMtrryI7qgp_LY1VNC5MBEFq_lT0ZsDuW9Cb9N9N9rBT6A$ ) LAP 2017, September 18-22, 2017 (https://urldefense.com/v3/__http://imft.ftn.uns.ac.rs/math/cms/LAP2017__;!!IBzWLUs!Fv68--eGTbmI9Sw2MEOV_mAJxnh48MsrZMtrryI7qgp_LY1VNC5MBEFq_lT0ZsDuW9Cb9N9LAB8jzw$ ) LAP 2018, September 24-28, 2018 (https://urldefense.com/v3/__http://imft.ftn.uns.ac.rs/math/cms/LAP2018__;!!IBzWLUs!Fv68--eGTbmI9Sw2MEOV_mAJxnh48MsrZMtrryI7qgp_LY1VNC5MBEFq_lT0ZsDuW9Cb9N93TZB3ow$ ) LAP 2019, September 23-27, 2019 (https://urldefense.com/v3/__http://imft.ftn.uns.ac.rs/math/cms/LAP2019__;!!IBzWLUs!Fv68--eGTbmI9Sw2MEOV_mAJxnh48MsrZMtrryI7qgp_LY1VNC5MBEFq_lT0ZsDuW9Cb9N8TekiNDg$ ) LAP 2020, September 21-25, 2020 (https://urldefense.com/v3/__http://imft.ftn.uns.ac.rs/math/cms/LAP2020__;!!IBzWLUs!Fv68--eGTbmI9Sw2MEOV_mAJxnh48MsrZMtrryI7qgp_LY1VNC5MBEFq_lT0ZsDuW9Cb9N-6Afh-aA$ ) LAP 2021, September 20-24, 2021 (https://urldefense.com/v3/__http://imft.ftn.uns.ac.rs/math/cms/LAP2021__;!!IBzWLUs!Fv68--eGTbmI9Sw2MEOV_mAJxnh48MsrZMtrryI7qgp_LY1VNC5MBEFq_lT0ZsDuW9Cb9N_tG3CCSQ$ ) ------------------------------------------------- IMPORTANT DATES Abstract Submission: June 15, 2022 Author Notification: July 1, 2022 Final version: July 8, 2022 ------------------------------------------------- SUBMISSION Authors should submit an abstract in LaTeX format, not exceeding three pages, to vlp at mi . sanu .ac.rs (with the subject "LAP 2022"). ------------------------------------------------- LOCATION: IUC - Inter University Center Dubrovnik https://urldefense.com/v3/__http://www.iuc.hr/__;!!IBzWLUs!Fv68--eGTbmI9Sw2MEOV_mAJxnh48MsrZMtrryI7qgp_LY1VNC5MBEFq_lT0ZsDuW9Cb9N-Fu5ucZQ$ ------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From andersmortberg at gmail.com Fri Apr 8 09:43:24 2022 From: andersmortberg at gmail.com (Anders Mortberg) Date: Fri, 8 Apr 2022 15:43:24 +0200 Subject: [TYPES/announce] Reminder: Workshop on Syntax and Semantics of Type Theories in Stockholm, Sweden, May 20-21 (contributed talk and funding deadline Monday 11 April) Message-ID: Reminder: the deadline to contribute a talk and applying for funding to participate in the workshop on type theory here in Stockholm is *Monday next week (11 April)*. For details see the email below. The meeting is open to anyone interested in type theory and the program will consist primarily of short talks, with plenty of time for discussions to share recent results, and co-ordinate future research. Everyone is very welcome to apply for funding regardless of whether one is contributing a talk or not. Priority will then be given to speakers, participants from ?Inclusiveness Target Countries?, early-career researchers, and women (following the EU COST inclusiveness policy, details here ). Best, Anders On Sun, Mar 27, 2022 at 6:27 PM Anders Mortberg wrote: > We are organizing a workshop on Syntax and Semantics of Type Theories in > Stockholm, Sweden, on May 20-21, 2022: > > https://urldefense.com/v3/__https://europroofnet.github.io/wg6-kickoff-stockholm/__;!!IBzWLUs!COIgzJXLn4eOcvtnmpH5Sq0RZksu0_Yqbr78KvPPwz79F3QQtmZKyQhuOZetgXOgiFY0neb2ht-NwQ$ > > The event is intended as a kick-off meeting for working group 6 on type > theory of the EuroProofNet EU Cost Action: > > https://urldefense.com/v3/__https://europroofnet.github.io/wg6/__;!!IBzWLUs!COIgzJXLn4eOcvtnmpH5Sq0RZksu0_Yqbr78KvPPwz79F3QQtmZKyQhuOZetgXOgiFY0neY9WU9W1A$ > > The programme will consist primarily of short talks, with plenty of time > for discussion to share recent results, and co-ordinate future research, > including collaboration towards deliverables. On the Sunday after the > workshop, there will be an informal social excursion ? details TBA. The > meeting will be in-person. > # Confirmed speakers (more TBA) > > * Andr?s Kovacs > * Andrej Bauer > * Anja Petkovic Komel > * Ivan Di Liberti > * Jonathan Sterling > * Taichi Uemura > * Th?o Winterhalter > > # Deadlines > > Contributed talks deadline: *Monday 11 April* > Funding request deadline: *Monday 11 April* > Participation registration deadline: *Friday 13 May* > > To register please fill out the form linked to on the event webpage. > > # Organisers > > * Benedikt Ahrens (TU Delft & University of Birmingham) > * Peter LeFanu Lumsdaine (Stockholm University) > * Anders M?rtberg (Stockholm University) > > -------------- next part -------------- An HTML attachment was scrubbed... URL: From Coen.De.Roover at vub.be Fri Apr 8 09:26:48 2022 From: Coen.De.Roover at vub.be (Coen DE ROOVER) Date: Fri, 8 Apr 2022 13:26:48 +0000 Subject: [TYPES/announce] Tenure-track assistant professor Message-ID: <54CDF6C7-2421-4DD6-96D6-130252DE1D72@vub.be> The Software Languages Lab (https://urldefense.com/v3/__http://soft.vub.ac.be/__;!!IBzWLUs!Dubuhcl_Vf2EFV04V2iSgS--8y9n8wb048iwLfZ7H9mXq9UbuqFrouuCMcEEOgZYD38IiGuwCTue0g$ ) of the Vrije Universiteit Brussel (https://urldefense.com/v3/__https://www.vub.be__;!!IBzWLUs!Dubuhcl_Vf2EFV04V2iSgS--8y9n8wb048iwLfZ7H9mXq9UbuqFrouuCMcEEOgZYD38IiGs1sBu9lA$ ) in Belgium has a vacancy for a **tenure-track assistant professor** in the broad domain of: Formal Aspects of Programming Languages Please apply by April 22nd through https://urldefense.com/v3/__https://jobs.vub.be/job/Elsene-Tenure-Track-lecturer-*28research*29-'Formal-Aspects-of-Programming-Languages'/786364001/__;JSU!!IBzWLUs!Dubuhcl_Vf2EFV04V2iSgS--8y9n8wb048iwLfZ7H9mXq9UbuqFrouuCMcEEOgZYD38IiGtOJB4dKA$ From sperber at deinprogramm.de Sun Apr 10 11:47:42 2022 From: sperber at deinprogramm.de (Michael Sperber) Date: Sun, 10 Apr 2022 17:47:42 +0200 Subject: [TYPES/announce] 2nd CfP - ACM Workshop on Functional Art, Music, Modelling and Design - Deadline June 1 Message-ID: =============================================================================== 10th ACM SIGPLAN International Workshop on Functional Art, Music, Modelling and Design (FARM) Call for Papers, Demos, and Performance Ljubljana, Slovenia, 16th September 2022 Deadline: June 1 https://urldefense.com/v3/__https://functional-art.org/2022/__;!!IBzWLUs!GUmdlk5jZVPaQinbE5zCKmJYUdqXAJ6n0KNGtDF5wer8IFR-62FfG08olBqyEem3Yr5J7HWSQk7Rcw$ =============================================================================== Key Dates --------- Submission deadline June 1 Author notification July 1 Workshop September 16 Call for Papers --------------- The ACM SIGPLAN International Workshop on Functional Art, Music, Modelling and Design (FARM) encourages submissions from across art, craft, and design, including textiles, visual art, music, 3D sculpture, animation, GUIs, video games, 3D printing and architectural models, choreography, poetry, and even VLSI layouts, GPU configurations, or mechanical engineering designs. Theoretical foundations, language design, implementation issues, and applications in industry or the arts are all within the scope of the workshop. In addition to the main workshop, FARM hosts a traditional evening of performances. Thus, this call encompasses both papers/demos for the workshop (and its published proceedings) as well as performance proposals for the evening's event. Authors are invited to make a single submission for each. Authors may submit both a paper/demo and performance proposal, but the submissions will be considered independently. Note on Finances ---------------- Paid registration to the FARM workshop is usually required for paper and demo submitters, but will be waived for performers. If you would have financial difficulty attending, you can apply for conference ?PAC? funds. Please get in touch for more information. Papers ------ Paper submissions are invited in three categories: - Original research - Overview / state of the art - Technology tutorial (especially tools and environments for distributed artistic workflow) Papers must be submitted via HotCRP (https://urldefense.com/v3/__https://farm22.hotcrp.com/__;!!IBzWLUs!GUmdlk5jZVPaQinbE5zCKmJYUdqXAJ6n0KNGtDF5wer8IFR-62FfG08olBqyEem3Yr5J7HXx0NPpzA$ ), and meet the following requirements: - 5 to 12 pages - PDF format - Adhere to the ACM SIGPLAN template Accepted papers will be published in the ACM Digital Library as part of the FARM 2022 proceedings. Authors are encouraged to submit auxiliary material for publication along with their paper (source code, data, videos, images, etc.). Authors retain all rights to the auxiliary material. Demos ----- Demo submissions should describe a demonstration and its context, connecting it with the themes of FARM. A demo could be in the form of a short (10 to 20 minute) tutorial, a presentation of work in progress, an exhibition of some work, or even a performance. Demos must be submitted via HotCRP (https://urldefense.com/v3/__https://farm22.hotcrp.com/__;!!IBzWLUs!GUmdlk5jZVPaQinbE5zCKmJYUdqXAJ6n0KNGtDF5wer8IFR-62FfG08olBqyEem3Yr5J7HXx0NPpzA$ ), and meet the following requirements: - 500 to 2000 words - Have a title starting with ?Demo: ? - PDF format - Adhere to the ACM SIGPLAN template (https://urldefense.com/v3/__https://www.sigplan.org/Resources/ProceedingsFormat/__;!!IBzWLUs!GUmdlk5jZVPaQinbE5zCKmJYUdqXAJ6n0KNGtDF5wer8IFR-62FfG08olBqyEem3Yr5J7HUvYE634g$ ) Accepted demos will be published in the ACM Digital Library as part of the FARM 2022 proceedings. Performances ------------ FARM seeks proposals for performances which employ functional programming techniques, in whole or in part. We invite a diverse range of functionally-themed submissions including music, video, dance, and performance art. Both live performances and fixed-media submissions are welcome. We encourage risk-taking proposals that push forward the state of the art as well as refined presentations of highly developed practice. In either case, please support your submission with a clear description of your performance, including how your performance employs functional programming and a discussion of influences and prior art as appropriate. Performance proposals should be emailed to performance at functional-art.org, and must include: - A description of the performance (please be as specific as possible) - An explanation of the use of functional programming in the work - A list of technical requirements - A link to an audio or video example (YouTube, Vimeo, Bandcamp, etc.) Accepted performances will be presented at the performance evening. Workshop Organization --------------------- Workshop Chair: John Leo (Halfaya Research) Program Chair: Youyou Cong (Tokyo Institute of Technology) Performance Chair: Luka Frelih (Ljudmila Art & Science Laboratory) Publicity Chair: Michael Sperber (Active Group GmbH) Contact ------- For any questions, issues or comments, email farm-2022 at functional-art.org. From danel.ahman at fmf.uni-lj.si Mon Apr 11 02:07:18 2022 From: danel.ahman at fmf.uni-lj.si (Danel Ahman) Date: Mon, 11 Apr 2022 08:07:18 +0200 Subject: [TYPES/announce] ICFP 2022 Student Research Competition: Call for Submissions Message-ID: <9E6C957B-9D56-4A18-8F22-E2775621F1EB@fmf.uni-lj.si> ICFP 2022 Student Research Competition Call for Submissions ICFP 2022 invites students to participate in the Student Research Competition in order to present their research and get feedback from prominent members of the programming language research community. The SRC consists of three rounds: * Submission of an extended abstract * Poster session at ICFP 2022 * Finalists' presentations at ICFP 2022 During the first round students submit an extended abstract detailing their research to be reviewed by the program committee. Those students whose abstracts get accepted advance to the poster session round which will take place during ICFP 2022. Winners of the poster session advance to next round, where they will give a 5-minute presentation about their work on the ICFP main stage in front of a live audience. ### IMPORTANT DATES * Submission Deadline: 8 June 2022 (Wednesday) * Author Notification: 24 June 2022 (Friday) * ICFP 2022 Conference in Ljubljana, Slovenia: 11 September 2022 (Sunday) - 16 September 2022 (Friday) ### SUBMISSION OF EXTENDED ABSTRACTS * Submission Website: https://urldefense.com/v3/__https://icfp22src.hotcrp.com__;!!IBzWLUs!BWY51CxuXm5QH6dQzowetuo2RrpAYiHyKR1D5Kep-384zPOhNBucz8w7B7D0Zkdv_TVvyQaWkfGscw$ 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://urldefense.com/v3/__https://www.acm.org/publications/authors/submissions__;!!IBzWLUs!BWY51CxuXm5QH6dQzowetuo2RrpAYiHyKR1D5Kep-384zPOhNBucz8w7B7D0Zkdv_TVvyQZHL3ACDQ$ . For authors using LaTeX, a lighter-weight package, including only the essential files, is available from https://urldefense.com/v3/__http://sigplan.org/Resources/Author/*acmart-format__;Iw!!IBzWLUs!BWY51CxuXm5QH6dQzowetuo2RrpAYiHyKR1D5Kep-384zPOhNBucz8w7B7D0Zkdv_TVvyQYg_2QeKA$ . 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://urldefense.com/v3/__https://icfp22.sigplan.org/track/icfp-2022-student-research-competition__;!!IBzWLUs!BWY51CxuXm5QH6dQzowetuo2RrpAYiHyKR1D5Kep-384zPOhNBucz8w7B7D0Zkdv_TVvyQYJFYDt7A$ ### PROGRAM COMMITTEE Danel Ahman (University of Ljubljana) (co-chair) Maria I. Gorinova (Twitter) Daniel Hillerstr?m (University of Edinburgh) (co-chair) Shin-ya Katsumata (National Institute of Informatics) Jennifer Paykin (Galois) Fran?ois Pottier (Inria) Nikhil Swamy (Microsoft Research) -------------- next part -------------- An HTML attachment was scrubbed... URL: From gabriel.scherer at gmail.com Mon Apr 11 16:18:06 2022 From: gabriel.scherer at gmail.com (Gabriel Scherer) Date: Mon, 11 Apr 2022 22:18:06 +0200 Subject: [TYPES/announce] ICFP'22 Artifact Evaluation Committee: call for nominations Message-ID: Dear all, We are looking for motivated people to be members of the ICFP 2022 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://urldefense.com/v3/__https://framaforms.org/icfp22-aec-nomination-form-1649450477__;!!IBzWLUs!BffL5u6H1iF1wjdnriSMM0TrYAAMrfTVO7pBJUCQ7MSxSp1YhBSijtSgj5OHjV99SCVkVnPWKg7dmg$ For more information, see the AEC webpage: https://urldefense.com/v3/__https://icfp22.sigplan.org/track/icfp-2022-artifact-evaluation__;!!IBzWLUs!BffL5u6H1iF1wjdnriSMM0TrYAAMrfTVO7pBJUCQ7MSxSp1YhBSijtSgj5OHjV99SCVkVnOYkMs1-A$ 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 work in June, with the review work happening between June 2nd and June 28th. Here are some reasons why we think nominees 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: about a third of last year's evaluators volunteered to join the committee again this year. (The cons: unpaid work, 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: Jannis Limperg and Gabriel Scherer. -------------- next part -------------- An HTML attachment was scrubbed... URL: From email at justinh.su Tue Apr 12 00:00:30 2022 From: email at justinh.su (Justin Hsu) Date: Tue, 12 Apr 2022 00:00:30 -0400 Subject: [TYPES/announce] Final CFP: MFPS 2022: Conference on Mathematical Foundations of Programming Semantics Message-ID: <95056089-6578-40cc-a727-736566e407d9@www.fastmail.com> ========================================================= CALL FOR PAPERS: MFPS XXXVIII (MFPS 2022) 38th Conference on Mathematical Foundations of Programming Semantics July 11-13, 2022 Hybrid, from Ithaca, NY, USA https://urldefense.com/v3/__https://www.cs.cornell.edu/mfps-2022/__;!!IBzWLUs!AESa8LpVMtsYaATjO9svwu5Xl-UxG4xsdCMiwsvkhC4i3wuhN08YNB3RJafmGmgd2d4sMsGj5STdwA$ ========================================================== IMPORTANT DATES (anywhere on earth): Paper submission: April 29, 2022 Author notification: June 10, 2022 Final version due: June 24, 2022 ========================================================== We are delighted to announce the 38th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2022). While the pandemic situation is uncertain, we plan to hold a hybrid conference with the in-person event at Cornell University in Ithaca, New York. 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; process calculi; probabilistic systems; constructive mathematics; domain theory and categorical models; formal languages; formal methods; game semantics; lambda calculus; programming-language theory; quantum computation; security; topological models; logic; 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. ------------------------------------------------- INVITED SPEAKERS: Barbara K?nig, University of Duisburg--Essen Anca Muscholl, Universit? Bordeaux Daniela Petrisan, Universit? Paris Cit? Frank Pfenning, Carnegie Mellon University ------------------------------------------------- SPECIAL SESSIONS: 1. Species of Structures in Algebra, Computation, and Logic Organizer: Marcelo Fiore, University of Cambridge Organizer: Nicola Gambino, University of Leeds 2. Relational Verification and Formal Reasoning Organizer: Marco Gaboardi, Boston University 3. Algebraic Effects Organizer: Ningning Xie, University of Cambridge ------------------------------------------------- PROGRAM COMMITTEE: Sandra Alves, University of Porto Arthur Azevedo de Amorim, Boston University Lars Birkedal, Aarhus University Steve Brookes, Carnegie Mellon University Jacques Carette, McMaster University Pierre Clairambault, CNRS and ENS Lyon J?r?my Dubut, National Institute of Informatics, Tokyo Daniel Gratzer, Aarhus University Amar Hadzihasanovic, Tallinn University of Technology Masahito Hasegawa, Kyoto University Favonia, University of Minnesota Justin Hsu, Cornell University (co-chair) Achim Jung, University of Birmingham Delia Kesner, Universit? Paris-Diderot Isabella Mastroeni, Universit? di Verona Michael Mislove, Tulane University Renato Neves, Minho University Max New, University of Michigan Krishna S, IIT Bombay Taro Sekiyama, National Institute of Informatics, Tokyo Alexandra Silva, Cornell University Sam Staton, University of Oxford Christine Tasson, Sorbonne Universit? (co-chair) Maaike Zwart, IT University of Copenhagen ------------------------------------------------- MFPS ORGANIZERS: Andrej Bauer, University of Ljubljana Lars Birkedal, Aarhus University Stephen Brookes, Carnegie Mellon University Justin Hsu, Cornell University Achim Jung, University of Birmingham Catherine Meadows, Naval Research Laboratory Michael Mislove, Tulane University Jo?l Ouaknine, Max Planck Institute for Software Systems Prakash Panangaden, McGill University Alexandra Silva, Cornell University Sam Staton, University of Oxford Christine Tasson, Sorbonne Universit? ------------------------------------------------- LOCAL ORGANIZERS: Dexter Kozen, Cornell University Alexandra Silva, Cornell University ------------------------------------------------- SUBMISSION INSTRUCTIONS: Submissions should be made through EasyChair (). Papers can be at most **15 pages** long, excluding bibliography, and should be prepared using the MFPS macros (). ------------------------------------------------- PROCEEDINGS: A preliminary version will be distributed at the meeting. Final proceedings will be published in an open access journal after the meeting. ------------------------------------------------- CONTACT: For any further information about MFPS 2022, please contact the co-chairs: Justin Hsu (email at justinh.su) and Christine Tasson (christine.tasson at lip6.fr). -------------- next part -------------- An HTML attachment was scrubbed... URL: From quentin.stievenart at gmail.com Tue Apr 12 07:45:40 2022 From: quentin.stievenart at gmail.com (Quentin Stievenart) Date: Tue, 12 Apr 2022 13:45:40 +0200 Subject: [TYPES/announce] Call for presentations: Program Analyses for WebAssembly (PAW @ ECOOP 2022) (Deadline extension) Message-ID: WebAssembly is a recently introduced portable virtual machine, to which code written in many high-level languages can be compiled in order to be executed in web browsers and other runtimes. There have been several independent efforts to bring static and dynamic analysis tools to the WebAssembly ecosystem. This workshop aims to bring together researchers working in the domain of static and dynamic analyses for WebAssembly. Specifically, this workshop aims to discuss all techniques related to detecting bugs and vulnerabilities in WebAssembly binaries, to build models of such binaries, to prove their correctness, to monitor their execution, or to optimise binaries for running time and binary size. The PAW workshop is a community-building event, for exchanging ideas and fostering collaborations in these domains. The workshop will consist of submitted and invited talks, as well as discussion sessions. To that end, we invite submissions for talks in the form of a 1-page abstract delineating at a high-level the content of the presentation. More info: https://urldefense.com/v3/__https://2022.ecoop.org/home/paw-2022__;!!IBzWLUs!CQthdbEPY3u45g72Em-w4LXdw34LX34VmcS1cyZ7AuUkfqdlT3ZomxsQovKFV63xHSUgROlGKiLVBw$ Submission site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=paw2022__;!!IBzWLUs!CQthdbEPY3u45g72Em-w4LXdw34LX34VmcS1cyZ7AuUkfqdlT3ZomxsQovKFV63xHSUgROl6j0gDsA$ Timeline: April 18 2022: Submission deadline -- updated May 2 2022: Acceptance notification June 6-10 2022: ECOOP conference -------------- next part -------------- An HTML attachment was scrubbed... URL: From Clement.Aubert at math.cnrs.fr Tue Apr 12 08:43:15 2022 From: Clement.Aubert at math.cnrs.fr (=?UTF-8?Q?Cl=c3=a9ment_Aubert?=) Date: Tue, 12 Apr 2022 08:43:15 -0400 Subject: [TYPES/announce] Final CfP (with extended deadline): 15th Interaction and Concurrency Experience (ICE 2022) Message-ID: <565de48c-bd48-fee4-47e9-162abee8021c@math.cnrs.fr> ICE 2022 15th Interaction and Concurrency Experience 17 June 2022 IMT School for Advanced Studies Lucca, Italy and/or online Satellite workshop of DisCoTec 2022 https://www.discotec.org/2022/ice Submission link: https://openreview.net/group?id=DisCoTec.org/2022/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: Matthew Parkinson (Microsoft Research, UK) + TBA === IMPORTANT DATES === * 25 April 2022: abstract submission (EXTENDED!) * 29 April 2022: paper submission (EXTENDED!) * 23 May 2022: notification * 17 June 2022: ICE workshop * 12 July 2022: 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/2022/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 === * Cl?ment Aubert (Augusta University, USA) - aubert (at) math.cnrs.fr * Cinzia Di Giusto (Universit? C?te d?Azur, CNRS, I3S, FR) - cinzia.di-giusto (at) unice.fr * Larisa Safina (Inria, FR) - larisa.safina (at) inria.fr * Alceste Scalas (Technical University of Denmark, DK) - alcsc (at) dtu.dk === PROGRAM COMMITTEE === * Duncan Paul Attard (Reykjav?k University, IS) * Massimo Bartoletti (Universit? di Cagliari, IT) * Davide Basile (ISTI CNR, IT) * H?l?ne Coullon (IMT Atlantique, FR) * Alex Coto (Gran Sasso Science Institute, IT) * H?l?ne Coullon (IMT Atlantique, FR) * Jovana Dedei? (Faculty of Technical Sciences, University of Novi Sad, RS) * Simon Fowler (University of Glasgow School of Computing Science, GB-SCT) * Saverio Giallorenzo (University of Bologna, IT) * Ludovic Henrio (CNRS, FR) * Keigo Imai (Gifu University, JP) * Sung-Shik Jongmans (Open University of the Netherlands, NL) * Ivan Lanese (University of Bologna, IT) * Julien Lange (Royal Holloway, University of London, GB) * Sergue? Lenglet (Universit? de Lorraine, FR) * Diego Marmsoler (University of Exeter, GB) * Doriana Medi? (University of Turin, IT) * Marco Peressotti (University of Southern Denmark, DK) * Kirstin Peters (Technischen Universit?t Darmstadt, GE) * Ivan Proki? (Faculty of Technical Sciences, University of Novi Sad, RS) * Matteo Sammartino (Royal Holloway, University of London, GB) * Amrita Suresh (ENS Paris Saclay, FR) === 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 (Evidence Srl, IT) === MORE INFORMATION === For additional information, please contact:ice22 at googlegroups.com -- Cl?ment Aubert, Assistant Professor of Computer Science, School of Computer and Cyber Sciences, Augusta University, https://spots.augusta.edu/caubert/ -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_0xDC72C5ECF4AC65AC.asc Type: application/pgp-keys Size: 3130 bytes Desc: OpenPGP public key URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_signature Type: application/pgp-signature Size: 840 bytes Desc: OpenPGP digital signature URL: From botocudo at gmail.com Tue Apr 12 09:52:19 2022 From: botocudo at gmail.com (Joao Marcos) Date: Tue, 12 Apr 2022 10:52:19 -0300 Subject: [TYPES/announce] 2nd CFP: ThEdu'22 - Theorem-proving Components for Educational Software Message-ID: 2nd Call for Extended Abstracts & Demonstrations ************************************************************************** ThEdu'22 Theorem-proving Components for Educational Software 11 August 2022 https://urldefense.com/v3/__http://www.uc.pt/en/congressos/thedu/ThEdu22__;!!IBzWLUs!BJPk8ABzWjJTpiJU0IukiWeosFH_XIm5w8WWg-btmuhLRN3cFxPX8w6g9ZAjP_fdOdaZt4IPCnzFWw$ ************************************************************************** at FLoC 2022 Federated Logic Conference July 31 - August 12, 2022 Haifa, Israel ************************************************************************** THedu'22 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 Speakers Thierry Dana-Picard, Jerusalem College of Technology, Israel Yoni Zohar, Bar Ilan University, Israel Important Dates * Extended Abstracts: 9 May 2022 * Author Notification: 6 June 2022 * Workshop Day: 11 August 2022 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 deductive and computerized enabling systems to propose next steps; * automated provers specific for dynamic geometry systems; * proofs 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://urldefense.com/v3/__https://easychair.org/conferences/?conf=thedu22__;!!IBzWLUs!BJPk8ABzWjJTpiJU0IukiWeosFH_XIm5w8WWg-btmuhLRN3cFxPX8w6g9ZAjP_fdOdaZt4J1KH9rvw$ formatted according to https://urldefense.com/v3/__http://www.easychair.org/publications/easychair.zip__;!!IBzWLUs!BJPk8ABzWjJTpiJU0IukiWeosFH_XIm5w8WWg-btmuhLRN3cFxPX8w6g9ZAjP_fdOdaZt4LTK57JiQ$ Extended abstracts and demonstration proposals should be 5 pages (+|-1) in length and are to be submitted in PDF format. At least one of the authors of each accepted extended abstract/demonstration proposal is expected to attend THedu'22 and presents their extended abstract/demonstration. Program Committee (tentative) 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 Mari?, 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) Giselle Reis, Carnegie Mellon University Qatar, Qatar Philippe R. Richard, Universit? de Montr?al, Canada Vanda Santos, University of Aveiro, Portugal Anders Schlichtkrull, Aalborg University, Denmark Wolfgang Schreiner, Johannes Kepler University, Austria M. Pilar V?lez, Nebrija University, Spain J?rgen Villadsen, Technical University of Denmark, Denmark Proceedings The extended abstracts and system descriptions will be available in ThEdu'22 Web-wage. After the Workshop an open call for papers will be issued. It is expected that authors of accepted extended abstract can submit a substantially revised version, extended to 14-20 pages, for publication by the Electronic Proceedings in Theoretical Computer Science (EPTCS). From asolar at csail.mit.edu Tue Apr 12 14:36:23 2022 From: asolar at csail.mit.edu (Armando Solar-Lezama) Date: Tue, 12 Apr 2022 14:36:23 -0400 Subject: [TYPES/announce] Summer School on Neurosymbolic Programming July 11-13, Pasadena CA Message-ID: Applications are now open for the First Summer School on Neurosymbolic Programming organized as part of the NSF funded Expeditions Project "Understanding the World Through Code". Neurosymbolic programming is an exciting new area at the intersection of Program Synthesis and Machine Learning that aims to learn models that incorporate program-like structure. For this first summer school in Neurosymbolic Programming we aim to bring together students and researchers from different backgrounds who are interested in learning about the state of the art, applications and open problems in the field. The summer school will include lectures and hands-on tutorials from leading researchers in the area. It will take place on July 11-13 at the California Institute of Technology in Pasadena, California USA. Apply here to attend the summer school: https://urldefense.com/v3/__https://forms.gle/LMVo1KEiJxPLtLfu9__;!!IBzWLUs!ExKj7ypj6CdbsdeaRxq31udBU7DkoFbNChT3bcQD1GgyPKvxesejsbzurC-TPjNMoKCfUuzswy3U9g$ For more information, visit the summer school website: https://urldefense.com/v3/__http://www.neurosymbolic.org/summerschool.html__;!!IBzWLUs!ExKj7ypj6CdbsdeaRxq31udBU7DkoFbNChT3bcQD1GgyPKvxesejsbzurC-TPjNMoKCfUuzSWXDIWQ$ The application deadline is *May 13* . Limited funds for travel grants are available with priority given to graduate students. For more information, reach out to Omar Costilla Reyes . -------------- next part -------------- An HTML attachment was scrubbed... URL: From bollig at lsv.fr Wed Apr 13 04:55:22 2022 From: bollig at lsv.fr (Benedikt Bollig) Date: Wed, 13 Apr 2022 10:55:22 +0200 Subject: [TYPES/announce] ETAPS 2023: Call for Satellite Events Message-ID: <3980B5C9-6AE0-4913-BA00-04E9FC01C068@lsv.fr> [Apologies for multiple postings] ETAPS 2023 26th European Joint Conferences on Theory and Practice of Software Sorbonne Universit? Paris, France, April 22-27, 2023 Call for Satellite Events ======================================== ABOUT ETAPS ======================================== The European Joint Conferences on Theory and Practice of Software (ETAPS) is the primary European forum for academic and industrial researchers working on topics relating to Software Science. It has been an annual event held in Europe each spring since 1998. Its 26th edition, ETAPS 2023, will be held on April 22-27, 2023, at Sorbonne Universit?, in Paris, France. The ETAPS 2023 main conferences, scheduled for April 24-27 on Campus Pierre et Marie Curie (Jussieu) are: * ESOP: European Symposium on Programming * FASE: Fundamental Approaches to Software Engineering * FoSSaCS: Foundations of Software Science and Computation Structures * TACAS: Tools and Algorithms for the Construction and Analysis of Systems The ETAPS 2023 satellite events will be held on Saturday and Sunday, April 22-23, 2023, at Institut Henri Poincar?, situated in the 5th arrondissement of Paris. ======================================== CALL FOR SATELLITE EVENTS ======================================== The ETAPS 2023 organizing committee invites proposals for satellite events (workshops) to complement the main conferences. They should fall within the scope of ETAPS. Satellite events provide an opportunity to discuss and report on emerging research approaches and practical experience relevant to the theory and practice of software. ======================================== IMPORTANT DATES ======================================== Deadline for proposals of satellite events: May 20, 2022 Notification of acceptance: May 30, 2022 ======================================== ARRANGEMENTS FOR SATELLITE EVENTS ======================================== The organizers of an ETAPS 2023 satellite event are expected to: - create and maintain a website for the event as a part of the main ETAPS website - form a PC and produce a call for papers for the event (if appropriate) - advertise the event through mailing lists etc. to complement the publicity of ETAPS - review submissions and make acceptance decisions - prepare informal (pre-)proceedings for the event, if appropriate - prepare the event's program according to the overall schedule of ETAPS 2023 - prepare and organize the publication of formal (post-)proceedings, if desired The ETAPS 2023 organizing committee will: - promote the event on the website and in the publicity material of ETAPS 2023 - integrate the event's program into the overall program of the conference - arrange registration for the event as a component of registration for ETAPS - collect a participation fee from the registrants - provide a meeting room of appropriate size, A/V equipment, coffee breaks, and possibly lunch(es) As a rule, ETAPS will not contribute toward the travel or accommodation costs of invited speakers or organizers of satellite events. ======================================== SUBMISSION OF SATELLITE EVENT PROPOSALS ======================================== Researchers and practitioners wishing to organize a satellite event are invited to submit their proposal to the workshop co-chairs via email: - Benedikt Bollig (CNRS), bollig at lsv.fr - Stefan Haar (Inria), stefan.haar at inria.fr The following information is requested: - the name and acronym of the satellite event - the names and contact information of the organizers - the duration of the event (one or two days) and the preferred period (April 22 / April 23 / April 22-23) - the expected number of participants - a brief description (120 words approximately) of the event topic for the website and publicity material of ETAPS 2023 - a brief explanation of the event topic and its relevance to ETAPS - an explanation of the selection procedure of contributions to the event; the PC chair and PC members, if known already; information about past editions of the event, if applicable - any other relevant information, like a special event format, invited speakers, demo sessions, special space requirements, etc. - a tentative schedule for paper submission, notification of acceptance and final versions for the (informal pre-)proceedings (the ETAPS 2023 organizing committee will need the final files by the end of February 2023) - the plans for formal publication (no formal publication, formal proceedings ready by the event, formal post-proceedings, publication venue - EPTCS or elsewhere) Proposals will be evaluated by the ETAPS 2023 organizing committee on the basis of their assessed benefit for prospective participants of ETAPS 2023. We invite prospective organizers to consult the websites of previous satellite events as examples: ETAPS 2022: https://urldefense.com/v3/__https://etaps.org/2022/workshops__;!!IBzWLUs!Am8hBPvjhQ8dpMhv43FTZfJqlslHJgPP99sBktcarRVN9kn6L85VePhKI8Qow4ixkUaJX1tvJFDZpw$ ETAPS 2021: https://urldefense.com/v3/__https://etaps.org/2021/workshops__;!!IBzWLUs!Am8hBPvjhQ8dpMhv43FTZfJqlslHJgPP99sBktcarRVN9kn6L85VePhKI8Qow4ixkUaJX1twQ-5ZqA$ ETAPS 2020: https://urldefense.com/v3/__https://etaps.org/2020/workshops__;!!IBzWLUs!Am8hBPvjhQ8dpMhv43FTZfJqlslHJgPP99sBktcarRVN9kn6L85VePhKI8Qow4ixkUaJX1uasp5pxg$ ETAPS 2019: https://urldefense.com/v3/__https://etaps.org/2019/workshops__;!!IBzWLUs!Am8hBPvjhQ8dpMhv43FTZfJqlslHJgPP99sBktcarRVN9kn6L85VePhKI8Qow4ixkUaJX1s8xydIOg$ ETAPS 2018: https://urldefense.com/v3/__https://etaps.org/2018/workshops__;!!IBzWLUs!Am8hBPvjhQ8dpMhv43FTZfJqlslHJgPP99sBktcarRVN9kn6L85VePhKI8Qow4ixkUaJX1tmPk4KxQ$ ======================================== FURTHER INFORMATION AND ENQUIRIES ======================================== Please contact the workshop co-chairs: - Benedikt Bollig (CNRS), bollig at lsv.fr - Stefan Haar (Inria), stefan.haar at inria.fr -------------- next part -------------- An HTML attachment was scrubbed... URL: From andrew.j.reynolds at gmail.com Wed Apr 13 17:20:40 2022 From: andrew.j.reynolds at gmail.com (Andrew Reynolds) Date: Wed, 13 Apr 2022 16:20:40 -0500 Subject: [TYPES/announce] Call for solvers and benchmarks for the Synthesis Standard Demonstration Message-ID: [Apologies for multiple postings] Call for SyGuS and SemGuS benchmarks and solvers for the Synthesis Standard Demonstration (Deadline July 1st 2022). Background: The classical formulation of the program-synthesis problem is to find a program that meets a correctness specification given as a logical formula. Recent work on program synthesis and program optimization illustrates many potential benefits of allowing the user to supplement the logical specification with a syntactic template that constrains the space of allowed implementations. The scope of synthesis problems in this demonstration fit into the following paradigms: 1) Syntax-Guided Synthesis (SyGuS) is a paradigm for specifying problems where the target program is an expression in an SMT theory. The input to SyGuS consists of a background theory, a semantic-correctness specification for the desired program given by a logical formula, and a syntactic set of candidate implementations given by a grammar. 2) Semantics-Guided Synthesis (SemGuS) is a paradigm for specifying problems where the target program lies in an arbitrary language. The key difference from SyGuS is that the SemGuS format allows one to specify both the syntax and semantics that define the search space. The syntax is defined by giving a grammar; the semantics of the language is defined using constrained Horn clauses (CHCs). For both paradigms, the computational problem then is to find an implementation from the set of candidate programs that satisfies the specification. Aimed at stimulating innovations in SyGuS techniques, SyGuS-Comp, a competition of solvers for SyGuS benchmarks, was held every year from 2014 to 2019. There has been continued interest in both using SyGuS solvers for various synthesis applications and using SyGuS benchmarks for evaluating new solution strategies. In 2020, the SyGuS organization sent a call to the SyGuS community requesting new benchmarks, feedback on proposed new extensions, and suggestions for new features. Additionally, semantics-guided synthesis was introduced recently as a way of specifying user-defined semantics for expressions that do not fit an SMT-LIB background theory. We demo a range of baseline solvers for these domains at FloC 2022. The demonstration will consist of 4 tracks. For each track, the organizers will curate a set of benchmarks and run all available solvers on them. The tracks are: 1. SyGuS general track: Benchmarks in SyGuS 2.1 format ( https://urldefense.com/v3/__https://sygus.org/assets/pdf/SyGuS-IF_2.1.pdf__;!!IBzWLUs!ALWKnpxaor9P_rjydK3oAxLGoOgT89Ik-Ah6p7dy4-ldfxvIPnzdcsIo_TIoluWediWogI1-TJM-xg$ ) whose logic is limited to standard SMT-LIB theories. 2. Tables track: Benchmarks in SyGuS 2.1 format whose logic includes a recently developed SMT-LIB theory of tables. 3. Oracles track: Benchmarks in SyGuS 2.1 format that use the oracles feature. 4. SemGuS track: Benchmarks in the SemGuS format (https://urldefense.com/v3/__http://semgus.org/__;!!IBzWLUs!ALWKnpxaor9P_rjydK3oAxLGoOgT89Ik-Ah6p7dy4-ldfxvIPnzdcsIo_TIoluWediWogI2KYRNmkQ$ ). Solvers may be judged based on speed and quality of solutions. However, there will be no official scoring or awards. Instead, an emphasis will be put on showcasing available features in solvers and challenging benchmarks in current applications. We invite the members of the synthesis community to participate in all tracks of this demonstration, either by submitting benchmarks and new solvers. New categories for this year?s demonstration Synthesis for a Theory of Tables: Synthesizing table manipulation programs (e.g., SQL, Python Pandas, R tidyverse) can benefit data scientists by automating their data preparation and database querying pipelines. While table manipulation programs are often short, they have large parameter spaces and also operate over tables that are compound values (list of tuples); as a result, synthesizing table manipulation programs provide unique challenges for synthesizer developers. In order to advance our synthesis algorithm development for tables, we start a new track of ?Synthesis for a Theory of Tables? for Sygus with the following resources: - An SMT-LIB compliant theory of tables that standardized signatures of common table operators including table join, filtering, and aggregation ( https://urldefense.com/v3/__https://homepage.cs.uiowa.edu/*ajreynol/tableTheory.pdf__;fg!!IBzWLUs!ALWKnpxaor9P_rjydK3oAxLGoOgT89Ik-Ah6p7dy4-ldfxvIPnzdcsIo_TIoluWediWogI12L6AmXA$ ). - We provide a set of programming-by-examples (PBE) benchmarks from the paper ?Synthesizing Highly Expressive SQL Queries from Input-Output Examples (PLDI 2017)? over this domain in the standard SyGuS format for evaluation of the synthesizers. We envision this as the first step towards developing a full ?theory of relational tables? for developing general table program synthesizers. Oracles: Formal inductive synthesis, such as the algorithms typically deployed to solve SyGuS problems, typically work by querying an oracle multiple times. Typically a verification oracle, which uses the semantic constraints given in the SyGuS file to generate a verification query to give to an SMT solver. However, problems exist where it?s either not possible/difficult to encode these constraints as static first-order logic constraints in SyGuS-IF, or checking these constraints is difficult for an SMT solver and a custom reasoning engine would be better suited. The new oracles extension, based on work in the paper ?Satisfiability and Synthesis Modulo Oracles?, allows a user to provide external oracles alongside a typical SyGuS specification. This enables the user to provide models that refer to external binaries treated as queryable black-boxes, and to use external reasoning engines as part of the verification condition. The concrete syntax for specifying constraints involving oracles has been incorporated in the SyGuS IF 2.1 standard ( https://urldefense.com/v3/__https://sygus.org/assets/pdf/SyGuS-IF_2.1.pdf__;!!IBzWLUs!ALWKnpxaor9P_rjydK3oAxLGoOgT89Ik-Ah6p7dy4-ldfxvIPnzdcsIo_TIoluWediWogI1-TJM-xg$ ). Specifically, this track will involve benchmarks in the SyGuS format where the ?oracles? feature (see Section 2.8) is enabled, and where the background theories are part of the SMT-LIB standard. SemGuS: The SemGuS problem formulation was first introduced in the paper ?Semantics-guided synthesis,? together with a number of solvers that could handle various SemGuS problems. While SyGuS is useful for synthesizing expressions over a fixed theory, SemGuS has the capability of defining a semantics for the programming language to be used in the synthesis problem in a domain-agnostic, logical format. This capability allows SemGuS to support a wider range of synthesis problems?in particular, synthesis problems for which SMT-LIB compliant background theories have not been developed, such as imperative programs, SQL queries, etc. SemGuS is a new format, and so far only a handful of solvers have been developed for solving SemGuS problems. The SemGuS format and a parser for it are available at semgus.org. The purpose of this call is two-fold: 1. For developers of synthesis tools to develop new SemGuS solvers. 2. To gather a broader set of SemGuS benchmarks. The original SemGuS paper compiled a set of 496 benchmarks, ranging over standard SyGuS problems, imperative program-synthesis problems, and synthesis problems over regular expressions. Like SyGuS, there is a need to grow the number of SemGuS benchmarks; in particular, as SemGuS promises to be a general format capable of expressing synthesis problems over arbitrary domains, we are looking for a wide variety of benchmarks coming from various domains and scenarios. Any contribution adding to the set of SemGuS benchmarks would be much appreciated. Call for Solvers and Benchmarks (Deadline July 1st 2022): 1) Call for solvers: This year?s demonstration will run on the existing benchmarks and on the ones collected through this call. The demonstration will welcome solvers that can solve benchmarks in any of the categories mentioned in this call. Those interested in submitting a new solver can contact the organizers at the following email addresses: - SyGuS: sygus-organizers at seas.upenn.edu. - SemGuS: semgus at office365.wisc.edu 2) Call for benchmarks: Benchmarks can be submitted through the following ways for each category: - SyGuS: pull requests at https://urldefense.com/v3/__https://github.com/SyGuS-Org/benchmarks__;!!IBzWLUs!ALWKnpxaor9P_rjydK3oAxLGoOgT89Ik-Ah6p7dy4-ldfxvIPnzdcsIo_TIoluWediWogI2BwyDF-w$ - SemGuS: pull requests at https://urldefense.com/v3/__https://github.com/SemGuS-git/Semgus-Benchmarks/__;!!IBzWLUs!ALWKnpxaor9P_rjydK3oAxLGoOgT89Ik-Ah6p7dy4-ldfxvIPnzdcsIo_TIoluWediWogI2QTDzeUQ$ . All solvers will be presented and advertised through a talk describing the results of this demonstration at SYNT, a workshop co-located with CAV22. Organization: The SyGuS infrastructure and competition was initiated as part of NSF Expeditions in Computing project ExCAPE, and is currently organized by Saswat Padhi (Amazon) and Andrew Reynolds (University of Iowa). For more information see the sygus webpage https://urldefense.com/v3/__https://sygus.org/__;!!IBzWLUs!ALWKnpxaor9P_rjydK3oAxLGoOgT89Ik-Ah6p7dy4-ldfxvIPnzdcsIo_TIoluWediWogI1_OdsXuQ$ . For questions please contact the organizers at sygus-organizers at seas.upenn.edu. The SemGuS framework and its infrastructure were initiated by Jinwoo Kim, Loris D?Antoni, and Tom Reps at the University of Wisconsin. The SemGuS specification language was designed with the help of Andrew Reynolds. For questions please contact semgus at office365.wisc.edu. -------------- next part -------------- An HTML attachment was scrubbed... URL: From m.sadrzadeh at ucl.ac.uk Thu Apr 14 05:39:26 2022 From: m.sadrzadeh at ucl.ac.uk (Sadrzadeh, Mehrnoosh) Date: Thu, 14 Apr 2022 09:39:26 +0000 Subject: [TYPES/announce] Final Call and Deadline Extension for Beth Outstanding Dissertation Prize 2022 In-Reply-To: References: Message-ID: Final Call and Deadline Extension for Beth Outstanding Dissertation Prize 2022 Extended Deadline: 30th of April 2022. Since 1998, 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 (https://urldefense.com/v3/__http://www.folli.info/?page_id=74__;!!IBzWLUs!H9EZhz8-JcB4QomoMNBIlHqSnqMWncZRUtws3OlopWwXNn56ZG4okmLtQheeH7FYssRddl6nD_g0PQ$ ), with financial support of the E.W. Beth Foundation (https://urldefense.com/v3/__https://www.knaw.nl/en/awards/funds/evert-willem-beth-stichting/evert-willem-beth-foundation__;!!IBzWLUs!H9EZhz8-JcB4QomoMNBIlHqSnqMWncZRUtws3OlopWwXNn56ZG4okmLtQheeH7FYssRddl4d7i6eHg$ ). 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 outstanding dissertations on topics in the broad remit of ESSLLI, in logic, language, information and computation. Interdisciplinary dissertations with results impacting various of these research areas in their investigations are especially solicited. Nominations are now invited for outstanding dissertations in these areas resulting in a Ph.D. degree awarded in 2021. The deadline for nominations is the 30th of April 2022. Qualifications: - A Ph.D. dissertation on a related topic is eligible for the Beth Dissertation Prize 2022, if the degree was awarded between January 1st and December 31st, 2021. - 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. - If a nominated dissertation has originally been written in a language other than English, its file 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 2023. The English translation must in such cases be submitted before the deadline of the call for nominations in 2023. 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 a single nomination file in zip format: - 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://urldefense.com/v3/__https://easychair.org/conferences/?conf=bodp2022__;!!IBzWLUs!H9EZhz8-JcB4QomoMNBIlHqSnqMWncZRUtws3OlopWwXNn56ZG4okmLtQheeH7FYssRddl68_8ne5Q$ . 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 33rd ESSLLI summer school, in Galway, August 8-19, 2021. Beth dissertation prize committee 2022: 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) Christoph Haase (University of Oxford) Reinhard Muskens (University of Amsterdam) Francesca Poggiolesi (CNRS, IHPST, University of Paris 1) Mehrnoosh Sadrzadeh (University College London, chair) Ana Sokolova (University of Salzburg) Mark Steedman (University of Edinburgh) Carla Umbach (University of Koeln) 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 anca at labri.fr Fri Apr 15 01:14:47 2022 From: anca at labri.fr (Anca Muscholl) Date: Fri, 15 Apr 2022 07:14:47 +0200 Subject: [TYPES/announce] Call for location ICALP 2025 Message-ID: <21CF4CDC-6D57-435A-92EE-ECA59ADBB99C@labri.fr> CALL FOR LOCATION ICALP 2025 [Note: This is a correction of a location call recently sent] 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 international conference was launched in 1972 and covers all aspects of theoretical computer science. ICALP comprises the main, two-track conference over four days, plus a pre- and/or a post-workshop day. We invite proposals for locations to host the 52nd ICALP, to be held in the first half of July 2025. Previous and upcoming ICALP editions include: ICALP 2024 in Tallinn (Estonia) ICALP 2023 in Paderborn (Germany) ICALP 2022 in Paris (France) ICALP 2021 in Glasgow (UK), virtual ICALP 2020 in Saarbr?cken (Germany), virtual ICALP 2019 in Patras (Greece) The deadline for proposals is *** May 30, 2022 ***. Proposals or informal enquires should be sent to the President of the EATCS and the SC chair (see contact information below). Selected proposals are to be presented at the General Assembly of the EATCS at ICALP 2022. Proposals should address the following points: - name(s) of the Conference Chair(s) and their host institution - proposed location (and possibly venue) - appropriateness of the proposed dates (including possible holidays or other events) - travel information and estimated transportation costs - estimated accommodation and registration costs - conference facilities (session and plenary rooms, workshop rooms) EATCS president: Artur Czumaj (aczumaj at acm dot org) SC chair: Anca Muscholl (anca at labri dot fr) From stefan.ciobaca at gmail.com Sat Apr 16 09:03:07 2022 From: stefan.ciobaca at gmail.com (Stefan Ciobaca) Date: Sat, 16 Apr 2022 16:03:07 +0300 Subject: [TYPES/announce] WPTE 2022 call for papers Message-ID: WPTE 2022 (affiliated to FSCD 2022, part of FLoC 2022, Haifa, Israel) 9th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (July 31st, 2022) Web: https://urldefense.com/v3/__https://wpte2022.github.io/__;!!IBzWLUs!AQizJKYfRN0Y18yeKJ2AqQsoVtzKdYt1sPc8G0k1Ir9CWoOezO8E2m96oC5hfA1neX8Uf0PV3Zpn0g$ Submit: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=wpte2022__;!!IBzWLUs!AQizJKYfRN0Y18yeKJ2AqQsoVtzKdYt1sPc8G0k1Ir9CWoOezO8E2m96oC5hfA1neX8Uf0P9yhbrqQ$ Deadline: 26 April 2022 (abstract) / 3 May 2022 (paper) Publication: post-proceedings as a special issue in the Journal of Logical and Algebraic Methods in Programming for selected papers --------------------------------------------------------------------------- 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. 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. The extended abstract may present original work, but 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 viahttps://easychair.org/conferences/?conf=wpte2022. Formal Proceedings --------------------------------------------------------------------------- For the 2020 and 2021 editions, WPTE post-proceedings of selected papers are scheduled to be published in JLAMP special issues. We are delighted that the 2022 workshop will continue this tradition. Based on the quality of the submission and the presentation, we will invite a selection of papers to be published in extended form in a special issue of the Journal of Logical and Algebraic Methods in Programming. Invited Speakers --------------------------------------------------------------------------- Akihisa YAMADA, National Institute of Advanced Industrial Science and Technology (AIST), Japan. Important Dates --------------------------------------------------------------------------- Submission of extended abstracts: May 3, 2022 (AoE) Notification of acceptance: June 15, 2022 Final version for informal proceedings: June 29, 2022 Workshop: July 31, 2022 Submission to post-proceedings (JAMP special issue): autumn 2022 Program Committees --------------------------------------------------------------------------- Mar?a Alpuente, Universitat Polit?cnica de Val?ncia, Spain Demis Ballis, University of Udine, Italy Christopher Brown, University of St Andrews, UK Stefan Ciobaca, Alexandru Ioan Cuza University, Romania (co-chair) D?niel Horp?csi, E?tv?s Lor?nd University, Hungary Shin-Ya Katsumata, National Institute of Informatics, Japan Kentaro Kikuchi, Tohoku University, Japan Cynthia Kop, Radboud University, The Netherlands Pierre-Etienne Moreau, Universit? de Lorraine, France Koko Muroya, Kyoto University, Japan Keisuke Nakano, Tohoku University, Japan (co-chair) Masahiko Sakai, Nagoya University, Japan Contact --------------------------------------------------------------------------- Please direct questions to wpte2022 at easychair.org. -------------- next part -------------- An HTML attachment was scrubbed... URL: From yoni206 at gmail.com Sun Apr 17 04:13:12 2022 From: yoni206 at gmail.com (Yoni) Date: Sun, 17 Apr 2022 11:13:12 +0300 Subject: [TYPES/announce] SAT/SMT/AR + CP Summer School Message-ID: SAT/SMT/AR Summer School 2022: August 14-16 CP Summer School 2022: August 17 Technion Haifa, Israel The joint SAT/SMT/AR and CP 2022 Summer School will take place at the Technion, Haifa, Israel, on August 14-17 - immediately after the FLoC events. The school aims to bring its students up to speed with the exciting and developing fields of satisfiability testing, satisfiability modulo theories, automated reasoning, and constraint programming. Confirmed speakers and talks: Alex Nadel: Introduction to SAT Bruno Dutertre: Introduction to SMT Marijn J.H. Heule: Proofs of Unatisfiability ? Validation and applications Dana Drachsler Cohen: Safety of Neural Networks Shachar Itzhaky: Formal Software Verification in Proof Assistants Yakir Vizel: TBD Dana Fisman: TBD Cezary Kaliszyk: Introduction to ITP Liron Cohen: TBD George Katsirelos -- Introduction to CP & The cross-fertilization of CP and SAT Michael Codish -- Constraint Minds Think Alike: The application of CP & SAT to Solve Hard Combinatorial Problems Michael Veksler -- TBD Tentative schedule and abstracts of the tutorials can be found in the summer school?s website: https://urldefense.com/v3/__https://sat-smt-ar-school.gitlab.io/www/2022/index.html__;!!IBzWLUs!BXqlxTDiDuDHdzPNE8xLM5aj6FzXnGDWyz6oBrDNbt4C8TeFLY7tsxWcMFd21Z6LV-QCJLBJmH9zvQ$ For registration, please fill out this form: https://urldefense.com/v3/__https://forms.gle/2gEZhRt74AgptLvb6__;!!IBzWLUs!BXqlxTDiDuDHdzPNE8xLM5aj6FzXnGDWyz6oBrDNbt4C8TeFLY7tsxWcMFd21Z6LV-QCJLALpp4t0g$ Scholarships for housing at the Technion's dormitories will be available for the duration of the summer school, thanks to the support of our sponsors. If requested, please mark accordingly in the registration form, and we will contact you with more details around June. For any questions, feel free to contact the organization committee at ssa.school2022 at gmail.com Organizing Committee of SAT/SMT/AR Summer School: Guy Katz, Ori Lahav, Yoni Zohar Organizing Committee of CP Summer School: Emmanuel Hebrard -------------- next part -------------- An HTML attachment was scrubbed... URL: From lysxia at gmail.com Mon Apr 18 10:51:42 2022 From: lysxia at gmail.com (Li-yao Xia) Date: Mon, 18 Apr 2022 10:51:42 -0400 Subject: [TYPES/announce] BX 2022 - Call for papers (deadline 14 May) Message-ID: # Tenth International Workshop on Bidirectional Transformations (BX 2022) 8 July 2022, Nantes, France Part of STAF 2022 (5-8 July): https://urldefense.com/v3/__https://staf2022.univ-nantes.io/__;!!IBzWLUs!HVmu13GoSx6nR257McO-uEqVxxvUQz9MShWvlUD3i3m2rkQLGVw2j8YCOP_KxdB-gnD55j7ERyMcUw$ BX 2022 homepage: https://urldefense.com/v3/__http://bx-community.wikidot.com/bx2022:home__;!!IBzWLUs!HVmu13GoSx6nR257McO-uEqVxxvUQz9MShWvlUD3i3m2rkQLGVw2j8YCOP_KxdB-gnD55j7MWunzRA$ ## Overview Bidirectional transformations (BX) are a mechanism for maintaining the consistency between two or more related (and heterogeneous) sources of information (e.g., relational databases, software models and code, or any other artefacts following standard or domain-specific formats). The strongest argument in favour of BX is its ability to provide a synchronization mechanism that is guaranteed to be correct by construction. BX has been attracting a wide range of research areas and communities, with prominent presence at top conferences in several different fields (namely databases, programming languages, software engineering, and graph transformation). Nowadays, the fast-growing complexity of software- or data-intensive systems has forced industry and academia to use and investigate different development techniques to manage the many different aspects of the systems. Researchers are actively investigating the use of bidirectional approaches to tackle a diverse set of challenges with various applications including model-driven software development, visualization with direct manipulation, big data, databases, domain-specific languages, serializers, and data transformation, integration and exchange. BX 2022 is a dedicated venue for BX in all relevant fields and is part of a workshop series that was created in order to promote cross-disciplinary research and awareness in the area. As such, since its beginning in 2012, the workshop has rotated between venues in different fields. Papers for BX 2022 can be submitted on EasyChair: https://urldefense.com/v3/__https://www.easychair.org/conferences/?conf=bx2022__;!!IBzWLUs!HVmu13GoSx6nR257McO-uEqVxxvUQz9MShWvlUD3i3m2rkQLGVw2j8YCOP_KxdB-gnD55j4RbEIZUA$ ## Important Dates - Paper submission: 14 May, 2022 - Author notification: 28 May, 2022 - Workshop: 8 July, 2022 ## Topics The aim of the workshop is to bring together researchers and practitioners, established and new, interested in bx from different perspectives, including but not limited to: - bidirectional programming languages and frameworks - software development with BX - data and model synchronization - view updating - inter-model consistency analysis and repair - data/schema (or model/metamodel) co-evolution - coupled software/model transformations - inversion of transformations and data exchange mappings - domain-specific languages for BX - analysis and classification of requirements for BX - bridging the gap between formal concepts and application scenarios - analysis of efficiency of transformation algorithms and benchmarks - model-driven and model-based approaches - survey and comparison of BX technologies - case studies and tool support - applications and experiences of adopting BX in the real world ## Categories of Submissions Five categories of submissions are considered: 1. Full Research Papers (13-15 pages) - in-depth presentations of novel concepts and results - applications of bx to new domains - survey papers providing novel comparisons between existing bx technologies and approaches, case studies 2. Tool Papers (7-8 pages) - guideline papers presenting best practices for employing a specific bx approach (with a specific tool) - presentation of new tools or substantial improvements to existing ones - qualitative and/or quantitative comparisons of applying different bx approaches and tools 3. Experience Report (7-8 pages) - sharing experiences and lessons learned with bx tools/frameworks/languages - how bx is used in (research/industrial/educational) projects 4. Short Papers (5 pages) - work in progress - small focused contributions - position papers and research perspectives - critical questions and challenges for bx 5. Talk Proposals (2 pages) - proposed lectures about topics of interest for bx - existing work representing relevant contributions for bx - promising contributions that are not mature enough to be proposed as papers of the other categories ## Submission guidelines Papers should use the new CEUR-ART style, single column, available as an Overleaf page or as a zip archive: https://urldefense.com/v3/__https://www.overleaf.com/read/gwhxnqcghhdt__;!!IBzWLUs!HVmu13GoSx6nR257McO-uEqVxxvUQz9MShWvlUD3i3m2rkQLGVw2j8YCOP_KxdB-gnD55j7IRZGwYw$ https://urldefense.com/v3/__http://ceur-ws.org/Vol-XXX/CEURART.zip__;!!IBzWLUs!HVmu13GoSx6nR257McO-uEqVxxvUQz9MShWvlUD3i3m2rkQLGVw2j8YCOP_KxdB-gnD55j7ODV3o8g$ and must be submitted via EasyChair: https://urldefense.com/v3/__https://www.easychair.org/conferences/?conf=bx2022__;!!IBzWLUs!HVmu13GoSx6nR257McO-uEqVxxvUQz9MShWvlUD3i3m2rkQLGVw2j8YCOP_KxdB-gnD55j4RbEIZUA$ If your submission is not a Full Research Paper, please include the intended submission category in the Title field of EasyChair?s submission form. Tool papers, experience reports and short papers will be mapped to the short paper category in CEUR (having between 5-9 standard pages, 1 standard page = 2500 characters), whereas full research papers will be mapped to the regular paper category in CEUR (having at least 10 standard pages). The bibliography is excluded from the page limits. All papers are expected to be self-contained and well-written. Tool papers are not expected to present novel scientific results, but to document artifacts of interest and share bx experience/best practices with the community. Experience papers are expected to report on lessons learnt from applying bx approaches, languages, tools, and theories to practical application case studies. Extended abstracts should primarily provoke interesting discussion at the workshop and will not be held to the same standard of maturity as regular papers; short papers contain focused results, positions or perspectives that can be presented in full in just a few pages, and that correspondingly contain fewer results and that therefore might not be competitive in the full paper category. Talk proposals are expected to present work that is of particular interest to the community and worth a talk slot at the workshop. We strongly encourage authors to ensure that any (variants of) examples are present in the bx example repository at the time of submission, and, for tool papers, to allow for reproducibility with minimal effort, either via a virtual machine (e.g., via Share) or a dedicated website with relevant artifacts and tool access. All papers will be peer-reviewed by at least three members of the program committee. If a submission is accepted, at least one author is expected to participate in the workshop to present it. Authors of accepted tool paper submissions are also expected to be available to demonstrate their tool at the event. ## Proceedings The workshop proceedings (in a STAF 2022 joint volume for workshops), including all accepted papers (except talk proposals), shall be submitted after the conference to CEUR-WS.org for online publication. Pre-prints of all papers will be available via the workshop website at the beginning of the conference. In case of questions, please contact the PC chairs at bx2022 at easychair.org. Best regards, Li-yao Xia, Vadim Zaytsev, Xiao He From i.hasuo at acm.org Mon Apr 18 11:27:33 2022 From: i.hasuo at acm.org (Ichiro Hasuo) Date: Tue, 19 Apr 2022 00:27:33 +0900 Subject: [TYPES/announce] Postdoc position in Tokyo: model checking and optimization metaheuristics Message-ID: [Please distribute, apologies for multiple postings.] Open Position for a PostDoc Researcher (Model Checking Extended with Optimization Metaheuristics, April 2022) ERATO Hasuo Metamathematics for Systems Design Project (ERATO MMSD ) invites applications for a postdoc researcher. We aim to combine model checking and optimization metaheuristics, in order to scale formal verification techniques up to real-world industrial problems that are complex and black-box. We aim to do so, at the same time, in a way guided by solid meta-theoretical foundations such as those which we've presented in LICS and CAV. We thus explore new shapes of application of logic to modern software and systems. The position will be especially suited for those who have experience in model checking research and who wish to expand their research portfolio. Some further details are found below. See https://urldefense.com/v3/__https://group-mmm.org/eratommsd/open-position-for-a-postdoc-researcher-march-2022/__;!!IBzWLUs!BDZN4rGPRuQkPWQZcGBZBnmH8ZJjFN7noYdQLXvoXdEnxRidC1Otggp1onYqYgQRJpapZntWM2LN3g$ for full details. Thanks a lot for your consideration. Best, Ichiro ------------- JOB DESCRIPTION The candidate will work at National Institute of Informatics , Tokyo, Japan, and will pursue a novel extension of model checking techniques (temporal logic, automata theory) with optimization metaheuristics (evolutionary computation, stochastic optimization, statistical machine learning). The goal is to overcome two major challenges that currently limit the applicability of formal verification techniques to real-world industrial systems, namely *scalability* and the *absence of white-box models*. In our endeavor towards the goal, we do not mind relying on testing, rather than exhaustive verification; this puts us somewhat closer to so-called *lightweight formal methods*. That said, our theoretical development shall be nothing "lightweight." We believe that there is a great theoretical depth here--we will explore the depth using logical, automata-theoretic, and/or categorical machinery. This *theory of * *"lightweight" formal methods* will significantly expand the current landscape of application of logic to software. The position should be especially suited for model checking researchers who wish to expand their research portfolio. We find case studies in our industrial collaborations and seek applicability to those real-world problems (they are mostly from the manufacturing industry). At the same time, we seek rigorous logical/automata-theoretic/categorical foundations for the solutions we come up with--so our work stays well in the realm of the formal verification community. We work in an interdisciplinary environment, and the candidate will be constantly exposed to interaction with control theory, software engineering, automated driving, and category theory. The candidate will work closely with Prof. Ichiro Hasuo and a few other team members. It is possible that the candidate be granted an academic title (such as Project Assistant/Associate Professor). References The following are some outcomes of our efforts so far. They are listed here in order to exemplify concrete topics. Note that the topics of these papers are diverse, and the candidate is not expected to follow all of them. A good match with one of them would suffice. - Masaki Waga, ?tienne Andr?, Ichiro Hasuo: Symbolic Monitoring Against Specifications Parametric in Time and Data. CAV (1) 2019: 520-539. doi arXiv (The topic is the theory of timed automata, which strikes a balance between theory and applicability.) - Kittiphon Phalakarn, Toru Takisaka, Thomas Haas, Ichiro Hasuo: Widest Paths and Global Propagation in Bounded Value Iteration for Stochastic Games. CAV (2) 2020: 349-371 doi arXiv (A work on a rather classic topic in formal verification, but the algorithm is approximate and highly scalable. The basic idea behind the algorithm has potential extensions, both theoretically and practically) - Zhenya Zhang, Ichiro Hasuo, Paolo Arcaini: Multi-armed Bandits for Boolean Connectives in Hybrid System Falsification. CAV (1) 2019: 401-420. doi arXiv (The work exploits logical structures to organize optimization metaheuristics on continuous domains.) - Sota Sato, Atsuyoshi Saimen, Masaki Waga, Kenji Takao, Ichiro Hasuo: Hybrid System Falsification for Multiple-Constraint Parameter Synthesis: A Gas Turbine Case Study. FM 2021: 313-329. doi (A real-world case study of logically structured optimization metaheuristics) - Yuichi Komorida, Shin-ya Katsumata, Clemens Kupke, Jurriaan Rot, Ichiro Hasuo: Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and Approximation. LICS 2021: 1-14. doi arXiv (A categorical work, a potential foundation of our theory. If this paper is your closest match, please note that you are expected to be eager in working with optimization metaheuristics too.) - Mayuko Kori, Natsuki Urabe, Shin-ya Katsumata, Kohei Suenaga, Ichiro Hasuo: The Lattice-Theoretic Essence of Property Directed Reachability Analysis. CoRR abs/2203.14261 (2022) arXiv (Another categorical work, but with a big emphasis on implementation. You are expected to be familiar with or eager for both.) ====== Ichiro Hasuo Professor, National Institute of Informatics i.hasuo at acm.org Secretaries: hasuolab-secr at nii.ac.jp https://urldefense.com/v3/__http://group-mmm.org/*ichiro/__;fg!!IBzWLUs!BDZN4rGPRuQkPWQZcGBZBnmH8ZJjFN7noYdQLXvoXdEnxRidC1Otggp1onYqYgQRJpapZnuSRsi59A$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From cmezzina at gmail.com Tue Apr 19 03:27:06 2022 From: cmezzina at gmail.com (Claudio Mezzina) Date: Tue, 19 Apr 2022 09:27:06 +0200 Subject: [TYPES/announce] EXPRESS/SOS 2022 second call for Papers Message-ID: =========================================== SECOND CALL FOR PAPERS Combined 29th International Workshop on Expressiveness in Concurrency and 19th Workshop on Structural Operational Semantics (EXPRESS/SOS 2022) https://urldefense.com/v3/__https://express-sos2022.github.io/__;!!IBzWLUs!H0yVAJg1NU2rxZlb5Wu373ySCXCJdzivsv3m4foVfvGtluXzYylF4lQhJhmFnM3t8ML6ROGIE2AHbw$ Warsaw (Poland) September 12, 2022, Affiliated with CONCUR 2022 Submission deadline (full and short papers): Friday, July 1, 2022 =========================================== == INVITED SPEAKERS Silvia Crafa (University of Padova, Italy) Ross Horne (University of Luxembourg, Luxembourg) == 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 2022 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 (https://urldefense.com/v3/__http://www.eptcs.org__;!!IBzWLUs!H0yVAJg1NU2rxZlb5Wu373ySCXCJdzivsv3m4foVfvGtluXzYylF4lQhJhmFnM3t8ML6ROGTF0pFNg$ ). 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://urldefense.com/v3/__https://easychair.org/conferences/?conf=expresssos2022__;!!IBzWLUs!H0yVAJg1NU2rxZlb5Wu373ySCXCJdzivsv3m4foVfvGtluXzYylF4lQhJhmFnM3t8ML6ROFj2Mko1Q$ 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 for the workshop and give the talk. We are monitoring the COVID-19 pandemic to decide if the workshop will take place physically in Warsaw, online, or hybrid. Whatever the decision, we will guarantee the possibility of 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. We are planning a special issue with selected papers from EXPRESS/SOS 2021 and EXPRESS/SOS 2022. More information will follow closer to the event. == IMPORTANT DATES - Paper submission: July 1, 2022 - Notification date: August 5, 2022 - Camera ready version: August 19, 2022 - Workshop: September 12, 2022 == WORKSHOP CO-CHAIRS: Valentina Castiglioni (Reykjavik University, IS) Claudio Antares Mezzina (University of Urbino, IT) == PROGRAM COMMITTEE: Georgiana Caltais (University of Konstanz, Germany) Valentina Castiglioni (Reykjavik University, Iceland), co-chair Wan Fokkink (Vrije University Amsterdam, The Netherlands) Paola Giannini (University of Piemonte Orientale, Italy) Daniel Hirschkoff (ENS Lyon, France) Tobias Kappe (Cornell University, UK) Vasileios Koutavas (Trinity College Dublin, Ireland) Ondrej Lengal (Brno University of Technology, Czech Republic) Gerald Luettgen (University of Bamberg, Germany) Claudio Antares Mezzina (University of Urbino, Italy), co-chair Max Tschaikowski (Aalborg University, Denmark) == CONTACT Prospective authors are encouraged to contact the co-chairs in case of questions at express-sos22 at easychair.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From dcerna at cs.cas.cz Tue Apr 19 04:21:22 2022 From: dcerna at cs.cas.cz (David Cerna) Date: Tue, 19 Apr 2022 10:21:22 +0200 Subject: [TYPES/announce] UNIF 2022 (2nd CFP) - 36TH International Workshop on Unification - deadline: May 5, 2022 Message-ID: <61b5b39c-6e1c-d498-4d36-b2a49790c4cf@cs.cas.cz> ****************************************************************************** ??????? UNIF 2022: 36TH International Workshop on Unification ?????????????????? -- co-located with FLoC/IJCAR 2022? -- ???????????????????? August 12, 2022, Haifa, Israel ??????? Website: cs.cas.cz/unif-2022 ??????? Poster: https://urldefense.com/v3/__http://www.cs.cas.cz/unif-2022/Poster.pdf__;!!IBzWLUs!AycfSXT1D5CCrpLMGfiiJeAitpDIt9pAX3JbQAu7jqz8xe3xaV-cTzajddxhu726fnLb33PTzXmhyg$ ??????? Submission link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=unif2022__;!!IBzWLUs!AycfSXT1D5CCrpLMGfiiJeAitpDIt9pAX3JbQAu7jqz8xe3xaV-cTzajddxhu726fnLb33Nes7wcBg$ ??????? Paper submission deadline: May 5, 2022 ??????? Topics: Unification, Anti-unification, Constraint solving ****************************************************************************** UNIF 2022 is associated with IJCAR 2022 part of the Federated Logic Conference 2022. UNIF 2022 is the 36th in a series of annual workshops on unification and related topics (https://urldefense.com/v3/__https://www.irif.fr/*treinen/unif/__;fg!!IBzWLUs!AycfSXT1D5CCrpLMGfiiJeAitpDIt9pAX3JbQAu7jqz8xe3xaV-cTzajddxhu726fnLb33O96Rvq2Q$ ). Just as its predecessors', the purpose of UNIF 2022 is to bring together researchers interested in unification theory and its applications, as well as closely related topics, such as matching (i.e., one- sided unification), anti-unification (i.e., the dual problem to unification), dis- unification (i.e., solving equations and inequations) and the admissibility problem (which generalizes unification in modal logics). It is a forum for presenting recent (even unfinished) work, and discuss new ideas and trends in this and related fields. Unification is concerned with the problem of identifying given (first- or higher- order) terms, either syntactically or modulo a theory. It is a fundamental technique that is employed in various areas of Computer Science and Mathematics. In particular, unification algorithms are key components in completion of term rewriting systems, resolution-based theorem proving, and logic programming. But unification is, for example, also investigated in the context of natural language processing, program analysis, types, modal logics, and in knowledge representation. Submission Information --------------------- Following the tradition of UNIF, we call for submissions of extended abstracts (5 pages) in EasyChair style, to be submitted electronically as PDF through the EasyChair submission site: https://urldefense.com/v3/__https://easychair.org/my/conference?conf=unif2022__;!!IBzWLUs!AycfSXT1D5CCrpLMGfiiJeAitpDIt9pAX3JbQAu7jqz8xe3xaV-cTzajddxhu726fnLb33PKJoy4Xw$ Abstracts will be evaluated by the Program Committee (if necessary with support from external reviewers) regarding their significance for the workshop. We also allow submission of work presented/submitted in/to another conference. Accepted abstracts will be presented at the workshop and made available at the Web-page of UNIF 2022. Topics include, but are not limited to: -------------------------------------- Topics of interest of the workshop include, but are not limited to: ??? - Syntactic and equational unification algorithms ??? - Matching and constraint solving ??? - Unification in modal, temporal, and description logics ??? - Higher-order unification ??? - Narrowing ??? - Disunification ??? - Anti-unification ??? - As well as relevant investigations concerning: ??????? * Complexity ??????? * Combination methods ??????? * Implementation ??????? * Applications Chairs ------ * David M. Cerna (RISC JKU, CAS ICS) * Barbara Morawska (tba) Invited Speakers ---------------- * Philippe Balbiani (Institut de recherche en informatique de Toulouse) * Christopher Lynch (Clarkson University) Programme Committee ------------------- * Mauricio Ayala-Rinc?n (Universidade de Brasil?a) * Franz Baader (TU Dresden) * Daniel Dougherty (Worcester Polytechnic Institute) * Besik Dundua (Institute of Applied Mathematics, Tbilisi State University) * Serdar Erbatur (University of Texas at Dallas (UT Dallas)) * Santiago Escobar (Universitat Polit?cnica de Val?ncia) * Maribel Fernandez (King's College London) * Silvio Ghilardi (Dipartimento di Matematica, Universit? degli Studi di Milano) * Pascual Juli?n-Iranzo (University of Castilla-La Mancha) * Temur Kutsia (RISC, Johannes Kepler University Linz) * Jordi Levy (IIIA - CSIC) * Andrew M. Marshall (University of Mary Washington) * Daniele Nantes-Sobrinho (Universidade de Brasil?a) * Paliath Narendran (University at Albany, SUNY) * Christophe Ringeissen (INRIA) * David Sabel (Ludwig-Maximilians-University Munich) * Manfred Schmidt-Schauss (Goethe-University Frankfurt am Main) Publication ----------- Depending on the number and quality of submissions a special issue in AMAI or MSCS is envisioned. Venue ----- FLoC 2022 at Haifa, Israel Important dates --------------- * Paper submission: May 5, 2022 * Notification of acceptance: June 10, 2022 * Final version of accepted papers: June 18, 2022 * Registration deadline: June 30, 2022 * Workshop date: August 12, 2022 From p.l.lumsdaine at gmail.com Tue Apr 19 05:55:36 2022 From: p.l.lumsdaine at gmail.com (Peter LeFanu Lumsdaine) Date: Tue, 19 Apr 2022 11:55:36 +0200 Subject: [TYPES/announce] Reminder: PhD positions in Stockholm, deadline this Friday, 22 April Message-ID: Dear all, A reminder for all interested in the PhD openings here that the deadline is *this Friday*, 22 April (full information repeated below). (Note: if you?ve contacted me about this before last week and I haven?t replied yet, please write again ? at least a couple of inquiries got caught in my spam filter, so it?s possible there are more I missed, for which my apologies! If you wrote last week, expect a reply today.) Best, ?Peter. Dear all, We are recruiting for PhD students in HoTT (and other topics) at the Stockholm University Department of Mathematics, starting Autumn 2022. The deadline for applications is Friday, April 22. Full details and application are through the university website: https://urldefense.com/v3/__https://www.su.se/english/about-the-university/work-at-su/available-jobs/phd-student-positions-1.507588?rmpage=job&rmjob=17395&rmlang=UK__;!!IBzWLUs!AZmFWVrBxolcx8HvniMCF972CP4GIijk4IINObI2NvehuDX_mwjTAXw2mAnrjQ33ChKB54K_PRAYJA$ Please contact me 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 davide.ancona at unige.it Wed Apr 20 03:40:08 2022 From: davide.ancona at unige.it (Davide Ancona) Date: Wed, 20 Apr 2022 09:40:08 +0200 Subject: [TYPES/announce] VORTEX 2022: Extended Submission Deadline, April 24 Message-ID: VORTEX 2022, Workshop co-located with ECOOP 2022, Berlin International Workshop on Verification and mOnitoring at Runtime EXecution (https://urldefense.com/v3/__https://2022.ecoop.org/home/vortex-2022__;!!IBzWLUs!HrX58rU1UiFZoxgx1qrapZooCqz0vzCva_phGNQ7xCAM3TNzFkHoQeHuS62Z_l48RLyUwcoT1V9Bwg$ ) ================================================================================ Important Dates --------------- * Submission deadline: **Apr 24, 2022** (AoE, extended deadline) * Author notification: May 2, 2022 * Early registration: May 9, 2022 * ECOOP conference: June 6-10, 2022 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. 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 18 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} Proceedings ----------- Depending on the quality and number of submissions, the workshop proceedings will be published in the ACM DL, and authors of selected papers will be invited to contribute with extended versions to be included in a special issue of the Journal of Object Technology(JOT) Workshop Organizers ------------------- * Davide Ancona, Universita` di Genova, Italy * Adrian Francalanza, University of Malta, Malta Program Committee ----------------- * Wolfgang Ahrendt, Chalmers University of Technology, Sweden * Duncan Paul Attard, Reykjavik University and University of Malta, Malta * Giorgio Audrito, University of Torino, Italy * Daniela Briola, University of Milano Bicocca, Italy * Rafael C. Cardoso, University of Aberdeen, UK * Marie Farrell, Maynooth University, Ireland * Angelo Ferrando, University of Genova, Italy * Simon Fowler, University of Glasgow, Italy * Hannah Gommerstadt, Vassar College, USA * Massimo Merro, University of Verona, Italy * Laura Nenzi, University of Trieste, Italy * Srinivas Pinisetty, Indian Institute of Technology Bhubaneswar, India * Julien Signoles, CEA LIST, France * Cesar Sanchez, IMDEA Software Institute, Spain * Mark Vella, University of Malta, Malta From violetpun at gmail.com Wed Apr 20 04:12:00 2022 From: violetpun at gmail.com (Violet Ka I Pun) Date: Wed, 20 Apr 2022 10:12:00 +0200 Subject: [TYPES/announce] Formal Methods 2023 -- Joint call for workshop & tutorial proposals Message-ID: [apologies for cross-postings] ================================================== FM 2023: 25th International Symposium on Formal Methods L?beck, Germany, March 6-10, 2023 https://urldefense.com/v3/__https://fm2023.isp.uni-luebeck.de/__;!!IBzWLUs!Hzyi2hmnBz7Xn_Yp4pG7NT9rg7c2ZEnNisRprQ4h66QGAaTHmUJ5r1RvgaOcKcu9Ps_RNPibr73f3g$ === CALL FOR WORKSHOP & TUTORIAL PROPOSALS === ================================================== IMPORTANT DATES ================ Submission of workshop proposals: June 10, 2022 Notification of success of proposals (workshop): June 24, 2022 Submission of tutorial proposals: July 1, 2022 Notification of success of proposals (tutorial): July 15, 2022 PROPOSALS =========== We are now inviting proposals for workshops, tutorials (and other similar events) that will complement the main FM 2023 symposium. We encourage a diversity of topics relating to different ways of developing and using formal methods. Due to the growing interest in AI and machine learning-based software development, we particularly invite topics at the intersection of machine learning and formal methods. 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 that involves an open call for contributions. A tutorial is an event based entirely on invited talks by the organizers or by invited speakers. Events that mix open and invited presentations will also be considered. Workshops and tutorials will take place on March 6th & 10th, 2023, flanking the main symposium. Each event (workshop or tutorial) should typically run for a half day or one day, but two-day events will also be considered. The FM 2023 organizing committee aims to contribute to at least partial support for one invited speaker per event. ==Submission Information== Researchers and practitioners wishing to organize a workshop or tutorial are invited to submit proposals by e-mail to the Workshops & Tutorials Chairs: =Tutorial chairs= - Cesar Sanchez (cesar.sanchez at imdea.org) and - Martin Sachenbacher (sachenbacher at isp.uni-luebeck.de) =Workshop chairs= - Esfandiar Mohammadi (esfandiar.mohammadi at uni-luebeck.de) and - Volker Stolz (vsto at hvl.no) An event 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 organizers. The organizers 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 installments. - A discussion of the proposed format and agenda (for example: paper presentations, tutorials, demo sessions, etc). The organizers 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-day events may be considered. - Potential invited speaker(s). - Workshop proposals should describe procedures for selecting papers and participants, including a tentative timeline for submission and notification of acceptance, and plans for the publication of proceedings, if any. The organizers of the proposed events are expected to create and maintain a website for the event; handle paper selection, reviewing and acceptance; draw up a program 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. FM 2023 will provide the facilities and handle the registrations for the events. -- Violet Ka I Pun https://urldefense.com/v3/__http://violet.foldr.org/__;!!IBzWLUs!Hzyi2hmnBz7Xn_Yp4pG7NT9rg7c2ZEnNisRprQ4h66QGAaTHmUJ5r1RvgaOcKcu9Ps_RNPgXV5-r6A$ From florian.rademacher at fh-dortmund.de Wed Apr 20 05:41:16 2022 From: florian.rademacher at fh-dortmund.de (Florian Rademacher) Date: Wed, 20 Apr 2022 11:41:16 +0200 Subject: [TYPES/announce] Microservices 2022 - Second Call for Participation Message-ID: International Conference on Microservices: Second Call for Participation ========================================================== Second Call for Participation Fourth International Conference on Microservices May 10th-12th 2022, Paris, France https://urldefense.com/v3/__https://www.conf-micro.services/2022/__;!!IBzWLUs!EN7ncc2n-z7RIYXgY1vWh9KAro_ZuOdRJ6OEnthZEoe3zdggj_vmHrSS4GrmCoNbgZ_aab2NBKHExQ$ ========================================================== Executive Summary: ?- The Conference Program is online: https://urldefense.com/v3/__https://www.conf-micro.services/2022/program/__;!!IBzWLUs!EN7ncc2n-z7RIYXgY1vWh9KAro_ZuOdRJ6OEnthZEoe3zdggj_vmHrSS4GrmCoNbgZ_aab0LQf0-bQ$ ?- Registration deadline is April 25th, 2022 (AoE) Keynote Speakers ---------------- Valentina Lenarduzzi (University of Oulu, Finland): Technical Debt and Microservices Fabio Casati (Servicenow, USA): Crossing the Chasm Between AI Services and AI-powered Workflows Cesare Pautasso (USI Lugano, Switzerland): The Microservice Hypothesis For more information: https://urldefense.com/v3/__https://www.conf-micro.services/2022/keynotes/*technical-debt-and-microservices__;Iw!!IBzWLUs!EN7ncc2n-z7RIYXgY1vWh9KAro_ZuOdRJ6OEnthZEoe3zdggj_vmHrSS4GrmCoNbgZ_aab2Y8pGQHA$ Theme and Topics ---------------- The theme of this edition is aspects of microservices in the age of digital transformation. ?- On the one hand, the adoption of microservices is fostering the adoption of new architectural patterns and software construction practices; understanding the security properties (or the emerging vulnerabilities) of the resulting constructs calls for the development of a fresh mindset in analysts, designers and testers alike. In addition, the additional middleware and infrastructure typically proposed for the management of microservice-based architectures could expand the attack surface of the systems. ?- On the other hand, microservices are often adopted as an accelerator of digital transformations. Some of the opportunities in microservices involve the development of sustainable practices, the application of artificial intelligence and machine learning, and new architectures and technologies. In this light, addressing the complexity of digital transformation should be a primary concern for microservices researchers and practitioners, while improving/enhancing microservices principles, patterns, architectures, security, and technologies. Organisation ------------ General Chair: Giulio Manzonetto, Universit? Sorbonne Paris Nord (FR) Program Chairs: Gokila Dorai, Augusta University (US) Dimka Karastoyanova, University of Groningen (NL) Aomar Osmani, Universit? Sorbonne Paris Nord (FR) Industrial Liaison Chair: Claudio Guidi, italianaSoftware (IT) Publicity Chair: Pierre Boudes, Universit? Sorbonne Paris Nord (FR) Florian Rademacher, University of Applied Sciences and Arts Dortmund (DE) Local Chairs: Damiano Mazza, CNRS, University Sorbonne Paris Nord (FR) Steering Committee ----------------- Fabrizio Montesi, University of Southern Denmark Sabine Sachweh, University of Applied Sciences and Arts Dortmund Program Committee ----------------- Mohamed Abouelsaoud, Cisco (CA) Vasilios Andrikopoulos, University of Groningen (NL) Jaime Arias, CNRS, Universit? Sorbonne Paris Nord (FR) Ibrahim Baggili, University of New Haven (US) Salima Benbernou, Universit? de Paris (FR) Matteo Bordin, Profesia (IT) Elisabetta Di Nitto, Politecnico di Milano (IT) Lyes Khoukhi, ENSICAEN (FR) Piyush Kumar, Florida State University (US) Patricia Lago, Vrije Universiteit Amsterdam (NL) Giuseppe Lipari, Universit? de Lille (FR) Anupama Pathirage, WSO2 (US) Pierluigi Plebani, Politecnico di Milano (IT) Dakshitha Ratnayake, WSO2 (US) Maria Seralessandri, European Central Bank (DE) Matteo Zanioli, Alpenite (IT) Asli Zengin, Imola Informatica (IT) Note about COVID-19 ------------------- Due to the ongoing COVID-19 situation, Microservices 2022 will take place as a hybrid meeting. All the information regarding the conference (scheduling, platform, etc.) will be posted on the conference website shortly. Contact Information ------------------- Please contact us if you have questions: https://urldefense.com/v3/__https://www.conf-micro.services/2022/contact/__;!!IBzWLUs!EN7ncc2n-z7RIYXgY1vWh9KAro_ZuOdRJ6OEnthZEoe3zdggj_vmHrSS4GrmCoNbgZ_aab0ACaBMog$ From havelund at gmail.com Wed Apr 20 09:37:01 2022 From: havelund at gmail.com (Klaus Havelund) Date: Wed, 20 Apr 2022 06:37:01 -0700 Subject: [TYPES/announce] NFM 2022 - Call for participation Message-ID: *CALL FOR PARTICIPATION* 14th NASA Formal Methods Symposium (NFM 2022) May 24-27, 2022 Pasadena, California, USA URL: https://urldefense.com/v3/__https://nfm2022.caltech.edu__;!!IBzWLUs!Bj_P3B4e-vCuOj1CficepLHAA7EprVFAcsIYvaJMAcACZgJ3aOX5Oyc04lvrXuJuBbce2az0Lu8NNw$ NFM 2022 is organized by Jet Propulsion Laboratory, USA *** Free Registration *** : https://urldefense.com/v3/__https://nfm2022.caltech.edu/register__;!!IBzWLUs!Bj_P3B4e-vCuOj1CficepLHAA7EprVFAcsIYvaJMAcACZgJ3aOX5Oyc04lvrXuJuBbce2azLEyFbhg$ MIXED PHYSICAL + VIRTUAL SYMPOSIUM After two years of virtual NFM symposia, we are returning to arranging a physical event. However, virtual participation is supported for those who prefer this option. THEME OF THE SYMPOSIUM The complexity of mission-critical and safety-critical systems at NASA and in the aerospace industry requires advanced techniques to address their specification, design, verification, validation, and certification. The NASA Formal Methods Symposium (NFM) is a forum to foster collaboration between theoreticians and practitioners from NASA, academia, and industry working on formal methods to develop and apply such techniques. The NASA Formal Methods Symposium is an annual event organized by the NASA Formal Methods Research Group, composed of researchers spanning six NASA centers. REGISTRATION There is no registration fee charged to participants. Register here: https://urldefense.com/v3/__https://nfm2022.caltech.edu/register__;!!IBzWLUs!Bj_P3B4e-vCuOj1CficepLHAA7EprVFAcsIYvaJMAcACZgJ3aOX5Oyc04lvrXuJuBbce2azLEyFbhg$ KEYNOTE SPEAKERS Dines Bj?rner (Technical University of Denmark, Denmark) Steve Chien (Jet Propulsion Laboratory, USA) Daniel Jackson (MIT CSAIL, USA) Julia Lawall (Inria-Paris, France) Sriram Sankaranarayanan (University of Colorado Boulder, USA) Alex Summers (University of British Columbia, Canada) Emina Torlak (University of Washington, USA) TUTORIALS Edwin Brady (University of St. Andrews, UK) Ankush Desai (Amazon Web Services, USA) Anastasia Mavridou (KBR Inc/NASA Ames Research Center, USA) Leonardo de Moura (Microsoft Research, USA) Sebastian Ullrich (Karlsruhe Institute of Technology, Germany) ORGANIZERS Klaus Havelund (Jet Propulsion Laboratory, PC chair) Jyo Deshmukh (USC, PC chair) Richard Murray (Caltech, Local chair) Ivan Perez (NIA, PC chair) -------------- next part -------------- An HTML attachment was scrubbed... URL: From ruy at cin.ufpe.br Tue Apr 19 19:08:44 2022 From: ruy at cin.ufpe.br (Ruy Jose Guerra Barretto de Queiroz) Date: Tue, 19 Apr 2022 20:08:44 -0300 Subject: [TYPES/announce] 28th WoLLIC 2022 - 3rd 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 European Association for Computer Science Logic (EACSL), the Interest Group in Pure and Applied Logics (IGPL), the The Association for Logic, Language and Information (FoLLI), the Association for Symbolic Logic (ASL) (tbc), 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!D3_okca2afEm4HpUDn4n90JiLIgxYEBaccTVa7JBDdA2Q19chvjCVoAVVwRBlMVf4zXIKq-jH920vg$ 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!D3_okca2afEm4HpUDn4n90JiLIgxYEBaccTVa7JBDdA2Q19chvjCVoAVVwRBlMVf4zXIKq80E3tFhg$ ). 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!D3_okca2afEm4HpUDn4n90JiLIgxYEBaccTVa7JBDdA2Q19chvjCVoAVVwRBlMVf4zXIKq8giKynqQ$ . 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 Mathematical Structures in Computer Science (MSCS). INVITED SPEAKERS Anupam Das, University of Birmingham John Horty, University of Maryland Marie Kerjean, Universit? Sorbonne Paris Nord/CNRS Dorel Lucanu, Alexandru Ioan Cuza University Francesca Poggiolesi, Universit? Sorbonne/CNRS/IHPST 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) PROGRAM COMMITTEE Arthur Azevedo de Amorim (Boston University) Agata Ciabattoni (Technische Universit?t Wien) (Co-Chair) Diana Costa (University of Lisbon) Denisa Diaconescu (University of Bucharest) Hans van Ditmarsch (Open University of the Netherlands) Rajeev Gor? (The Australian National University) 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 (University College London) (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) 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) Anjolina G. de Oliveira (Univ Federal de Pernambuco, Brasil) Ruy de Queiroz (Univ Federal de Pernambuco, Brasil) (co-chair) SCIENTIFIC SPONSORSHIP European Association for Computer Science Logic (EACSL) 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) 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/__https://wollic2022.github.io/__;!!IBzWLUs!D3_okca2afEm4HpUDn4n90JiLIgxYEBaccTVa7JBDdA2Q19chvjCVoAVVwRBlMVf4zXIKq-m8W5K0A$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From qest.publicity at gmail.com Wed Apr 20 09:45:28 2022 From: qest.publicity at gmail.com (QEST Publicity) Date: Wed, 20 Apr 2022 13:45:28 -0000 Subject: [TYPES/announce] QEST 2022 Call for Papers: Deadline Extension Message-ID: <20220420134528.D4F7660A95@anxur.fi.muni.cz> An HTML attachment was scrubbed... URL: From Luigia.Petre at abo.fi Thu Apr 21 08:11:42 2022 From: Luigia.Petre at abo.fi (Luigia Petre) Date: Thu, 21 Apr 2022 12:11:42 +0000 Subject: [TYPES/announce] FM Tutorial Lecture on THURSDAY, April 28, at 3 pm CET: Prof. Jeremy Gibbons on How to Design Co-Programs Message-ID: Dear all, The FM Tutorial series continues with Prof. Jeremy Gibbons's lecture on THURSDAY April 28, 2022, at 3 pm CET: His talk is entitled "How to Design Co ?Programs". The abstract of Prof. Gibbons's lecture is here: The observation that program structure follows data structure is a key lesson in introductory programming: good hints for possible program designs can be found by considering the structure of the data concerned. In particular, this lesson is a core message of the influential textbook ?How to Design Programs? by Felleisen, Findler, Flatt, and Krishnamurthi. However, that book discusses using only the structure of input data for guiding program design, typically leading towards structurally recursive programs. We argue that novice programmers should also be taught to consider the structure of output data, leading them also towards structurally corecursive programs. The zoom link is https://aboakademi.zoom.us/j/64254430116. The event will last about an hour. Warmly welcome!! Best wishes, Luigia PS1: the tutorial series webpage is updated with the list of speakers who confirmed their lectures in 2022 here: https://urldefense.com/v3/__https://fme-teaching.github.io/2021/08/24/tutorial-series-of-the-fme-teaching-committee/__;!!IBzWLUs!HuSsb7CCnmDrdq8-ZnJq0ORdxHHjz0txDoA4bscdRPFXr9mHg6lDBT-pyccL1ByFBexPJMaKDDn5GQ$ . Please note that we have a speaker every month from now on until August, and then also October is booked. PS2: the April 2022 lecture is scheduled exceptionally on the last _Thursday_ of the month, instead of the usual Friday. __ Luigia Petre, Docent, PhD Faculty of Science and Engineering ?bo Akademi University, Finland https://urldefense.com/v3/__http://www.users.abo.fi/lpetre__;!!IBzWLUs!HuSsb7CCnmDrdq8-ZnJq0ORdxHHjz0txDoA4bscdRPFXr9mHg6lDBT-pyccL1ByFBexPJMYFzbTtjw$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From andrea.morichetta at unicam.it Thu Apr 21 08:42:11 2022 From: andrea.morichetta at unicam.it (Andrea Morichetta) Date: Thu, 21 Apr 2022 14:42:11 +0200 Subject: [TYPES/announce] FOCODILE@DisCoTec 2022: Call For Extended Abstract - 3th International Workshop on Foundations of Consensus and Distributed Ledgers Message-ID: FOCODILE 2022 - 3rd International Workshop on Foundations of Consensus and Distributed Ledgers FOCODILE 2022 (https://urldefense.com/v3/__https://www.discotec.org/2022/focodile__;!!IBzWLUs!EHsOXCh4FR-BKW_yTsMri2lqPBRK-1pvHsEdVBiIfLPFee3wNl5tkrIKMF6WWnUS7-P3GniSJ7T-fA$ ) is one of the workshops at DisCoTec 2022, the 17th International Federated Conference on Distributed Computing Techniques (https://urldefense.com/v3/__https://www.discotec.org/focodile/2022/__;!!IBzWLUs!EHsOXCh4FR-BKW_yTsMri2lqPBRK-1pvHsEdVBiIfLPFee3wNl5tkrIKMF6WWnUS7-P3GngrX3dnFQ$ ). DisCoTec 2022 will take place at the IMT School for Advanced Studies Lucca (IT). Important Dates - Submission deadline (Hard): May 11th, 2022 (AoE) - Notification of accepted talks: May 20th, 2022 - Workshop: June 13th, 2022 *Scope* FOCODILE is a forum to exchange ideas and recent research findings on theoretical foundations of consensus and blockchain technology. Topics include, but are not limited to: - Formal models of distributed consensus - Blockchain-specific cryptographic primitives and protocols - Formal verification of blockchain protocols and smart contracts - Byzantine fault tolerance and consensus - Design and analysis of distributed ledgers - Blockchain consensus mechanisms - Privacy and anonymity in cryptocurrencies - Game-theoretic approaches to blockchains - Post-quantum blockchain protocols - Performance and scalability of blockchain systems Extended Abstract Novel research works or already published papers are welcome (in the form of extended abstracts). Submission information Extended abstracts (2 pages + references) have to be submitted in PDF format using the EasyChair submission page https://urldefense.com/v3/__https://easychair.org/conferences/?conf=focodile2022__;!!IBzWLUs!EHsOXCh4FR-BKW_yTsMri2lqPBRK-1pvHsEdVBiIfLPFee3wNl5tkrIKMF6WWnUS7-P3GnjkyTdstQ$ The submissions must be prepared using Springer?s LNCS style. Accepted submissions should be presented during the workshop day. FOCODILE has no formal proceedings. Organizing committee chairs - Zeta Avarikioti (TU Wien) zetavar at hotmail.com - Andrea Morichetta (University of Camerino) andrea.morichetta at unicam.it -- -------------- next part -------------- An HTML attachment was scrubbed... URL: From samuel.mimram at lix.polytechnique.fr Thu Apr 21 10:21:02 2022 From: samuel.mimram at lix.polytechnique.fr (Samuel Mimram) Date: Thu, 21 Apr 2022 16:21:02 +0200 Subject: [TYPES/announce] Special Issue on Logic and Higher Structures in MSCS Message-ID: Special Issue on Logic and Higher Structures in MSCS ==================================================== Dear everybody, There will be a special issue about logic and higher structures in the Mathematical Structures an Computer Science journal. Your contributions are welcome! Topic ----- Voevodsky's univalent foundations program has revealed deep connections between logic and homotopy theory, in particular via higher category theory. The goal of this special issue is to investigate these interactions, bringing together mathematicians from the communities of type theory, higher rewriting, higher category theory and homotopy theory. It follows the _Logic and Higher Structures_ conference which was held at CIRM, France, from 21 to 25 February 2022, although contributions not presented during the conference are also welcome. Submitting ---------- Submissions should be sent to lhs-mscs at lix.polytechnique.fr Important dates are - deadline for submissions: 1 July 2022 - notification of acceptance: 30 November 2022 Editors ------- The editors are - Dimitri Ara (Aix-Marseille Universit?) - Thierry Coquand (University of Gothenburg) - Philippe Malbos (Universit? Claude Bernard Lyon 1) - Samuel Mimram (?cole Polytechnique) - Sinan Yalin (Universit? d'Angers) You are welcome to contact them individually although the use of the global mail lhs-mscs at lix.polytechnique.fr is advised. From griggio at fbk.eu Fri Apr 22 02:24:00 2022 From: griggio at fbk.eu (Alberto Griggio) Date: Fri, 22 Apr 2022 08:24:00 +0200 Subject: [TYPES/announce] Formal Methods in Computer-Aided Design 2022: Final Call For Papers Message-ID: (apologies for multiple copies) ======================================================================== 2022 Formal Methods in Computer-Aided Design (FMCAD): Call for Papers ======================================================================== IMPORTANT DATES --------------- Abstract Submission: May 8, 2022 Paper Submission: May 15, 2022 Author Response: June 22 - 24, 2022 Author Notification: July 1, 2022 Camera-Ready Version: August 16, 2022 All deadlines are 11:59 pm AoE (Anywhere on Earth) FMCAD Tutorial Day: Oct. 18, 2022 Regular Program: Oct. 19-21, 2022 Part of the FMCAD 2022 program: FMCAD Student Forum CONFERENCE SCOPE AND PUBLICATION -------------------------------- FMCAD 2022 is the twenty-second 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. 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://urldefense.com/v3/__https://easychair.org/conferences/?conf=fmcad2022__;!!IBzWLUs!CS1n1HRJ_-5TU86gdTy7866S1UVLdASefeqBikQSDRDtI8xQbQF8V8qNtktt7l1_aZUcTI3qAkFU4A$ 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://urldefense.com/v3/__https://fmcad.or.at/pdf/copyright.pdf__;!!IBzWLUs!CS1n1HRJ_-5TU86gdTy7866S1UVLdASefeqBikQSDRDtI8xQbQF8V8qNtktt7l1_aZUcTI3Diw5VdQ$ . STUDENT FORUM ------------- Continuing the tradition of the previous years, FMCAD 2022 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. CO-LOCATED EVENTS ----------------- 14th International Conference on Verified Software: Theories, Tools, and Experiments (VSTTE 2022): https://urldefense.com/v3/__https://vstte22.fbk.eu/__;!!IBzWLUs!CS1n1HRJ_-5TU86gdTy7866S1UVLdASefeqBikQSDRDtI8xQbQF8V8qNtktt7l1_aZUcTI1TP47Lkg$ FMCAD 2022 COMMITTEES --------------------- PROGRAM CHAIRS: Alberto Griggio Fondazione Bruno Kessler, Italy Neha Rungta Amazon Web Services, Inc., CA, USA PROGRAM COMMITTEE: Erika Abraham RWTH Aachen University Jade Alglave University College London Josh Berdine Facebook Per Bjesse Synopsys Inc. Nikolaj Bjorner Microsoft Research Roderick Bloem Graz University of Technology Supratik Chakraborty IIT Bombay Sylvain Conchon Universite Paris-Sud Vijay D'Silva Google Rayna Dimitrova CISPA Helmholtz Center for Information Security Rohit Dureja IBM Grigory Fedukovich Florida State University Arie Gurfinkel University of Waterloo Fei He Tsinghua University Alexander Ivrii IBM Barbara Jobstmann EPFL Tim King Google Kuldeep Meel National University of Singapore Sergio Mover ?cole Polytechnique Alexander Nadel Intel Aina Niemetz Stanford University Elizabeth Polgreen University of California Berkeley Rahul Purandare IIT-Delhi Andrew Reynolds University of Iowa Marco Roveri Universit? di Trento Kristin Yvonne Rozier Iowa State University Philipp Ruemmer Uppsala University Cristoph Scholl University of Freiburg Natasha Sharygina USI Lugano Elena Sherman University of Iowa Sharon Shoham Tel Aviv University Anna Slobodova Intel Christoph Sticksel The Mathworks Michael Tautschnig AWS Nestan Tsiskaridze Stanford University Yakir Vizel Technion Georg Weissenbacher Vienna University of Technology Michael Whalen Amazon Web Services, Inc. STUDENT FORUM CHAIR: Mathias Preiner Stanford University, CA, USA SPONSORSHIP AND WEB CHAIR: Martin Jon?? Fondazione Bruno Kessler, Italy PUBLICATION CHAIR: Georg Weissenbacher TU Wien FMCAD STEERING COMMITTEE: Clark Barrett Stanford University, CA, USA Armin Biere University of Freiburg, Germany Anna Slobodova Intel Corporation, TX, USA Georg Weissenbacher TU Vienna, Austria -- -- Le informazioni contenute nella presente comunicazione sono di natura? privata e come tali sono da considerarsi riservate ed indirizzate? esclusivamente ai destinatari indicati e per le finalit? strettamente? legate al relativo contenuto. Se avete ricevuto questo messaggio per? errore, vi preghiamo di eliminarlo e di inviare una comunicazione? all?indirizzo e-mail del mittente. -- The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. If you received this in error, please contact the sender and delete the material. From fredrik.nordvall-forsberg at strath.ac.uk Fri Apr 22 08:06:25 2022 From: fredrik.nordvall-forsberg at strath.ac.uk (Fredrik Nordvall Forsberg) Date: Fri, 22 Apr 2022 13:06:25 +0100 Subject: [TYPES/announce] Applied Category Theory 2022: Second Call for Papers Message-ID: SECOND CALL FOR PAPERS 5th Annual International Conference on Applied Category Theory (ACT2022) July 18--22, 2022 https://urldefense.com/v3/__https://msp.cis.strath.ac.uk/act2022/__;!!IBzWLUs!AxXg9A97Q6jo7dnvHqkJaiGNqqYIwI0YTz3MC7d0u1wJbCTw-1sGFOZ_DQUlmoexvHTZS2zZrTYU3A$ The Fifth International Conference on Applied Category Theory will take place at the University of Strathclyde from 18 to 22 July 2022, preceded by the Adjoint School 2022 from 11 to 15 July. This conference follows previous events at Cambridge (UK), Cambridge (MA), Oxford and Leiden. Applied category theory is important to a growing community of researchers who study computer science, logic, engineering, physics, biology, chemistry, social science, linguistics and other subjects using category-theoretic tools. 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, strengthen the applied category theory community, disseminate the latest results, and facilitate further development of the field. SUBMISSIONS We accept submissions in English of original research papers, talks about work accepted/submitted/published elsewhere, and demonstrations of relevant software. Accepted original research papers will be published in a proceedings volume. The keynote addresses will be chosen from the accepted papers. The conference will include an industry showcase event and community meeting. We particularly encourage people from underrepresented groups to submit their work and the organisers are committed to non-discrimination, equity, and inclusion. Submission formats: 1. Extended Abstracts should be submitted describing the contribution and providing a basis for determining the topics and quality of the anticipated presentation (1-2 pages). These submissions will be adjudicated for inclusion as a talk at the conference. Such work should include references to any longer papers, preprints, or manuscripts providing additional details. 2. Conference Papers should present original, high-quality work in the style of a computer science conference paper (up to 14 pages, not counting the bibliography; detailed proofs may be included in an appendix for the convenience of the reviewers). Such submissions should not be an abridged version of an existing journal article (see item 1) although pre-submission Arxiv preprints are permitted. These submissions will be adjudicated for both a talk and publication in the conference proceedings. 3. Software Demonstrations should be submitted in the format of an Extended Abstract (1-2 pages) giving the program committee enough information to assess the content of the demonstration. We are particularly interested in software that makes category theory research easier, or uses category theoretic ideas to improve software in other domains. Extended abstracts and conference papers should be prepared with LaTeX. For conference papers please use the EPTCS style files available at https://urldefense.com/v3/__http://style.eptcs.org__;!!IBzWLUs!AxXg9A97Q6jo7dnvHqkJaiGNqqYIwI0YTz3MC7d0u1wJbCTw-1sGFOZ_DQUlmoexvHTZS2zPpfImwg$ . The submission link is https://urldefense.com/v3/__https://easychair.org/conferences/?conf=act2022__;!!IBzWLUs!AxXg9A97Q6jo7dnvHqkJaiGNqqYIwI0YTz3MC7d0u1wJbCTw-1sGFOZ_DQUlmoexvHTZS2wMoux9ew$ . IMPORTANT DATES The following dates are all in 2022, and Anywhere On Earth. - Submission Deadline: Monday 9 May - Author Notification: Tuesday 7 June - Camera-ready version due: Tuesday 28 June - Adjoint School: Monday 11 to Friday 15 July - Main Conference: Monday 18 to Friday 22 July CONFERENCE FORMAT Assuming additional Covid restrictions will not be introduced in the UK, the conference will run as a hybrid event, with talks recorded or streamed for remote participation. Please be mindful of changing conditions when booking travel or hotel accommodations. FINANCIAL SUPPORT Limited financial support will be available for travel and accommodation. Priority will be given to people with financial need and those giving presentations. Please contact the organisers for more information. PROGRAM COMMITTEE Tai-Danae Bradley, City University of New York Benjamin Merlin Bumpus, University of Glasgow Matteo Capucci, University of Strathclyde Andrea Censi, ETH Zurich Corina Cirstea, University of Southampton Elena Di Lavore, Tallinn University of Technology James Fairbanks, University of Florida Zardini Gioele, ETH Zurich Jules Hedges, University of Strathclyde Kohei Kishida, University of Illinois, Urbana-Champaign Barbara K?nig, University of Duisburg-Essen Clemens Kupke, University of Strathclyde Alexander Kurz, Chapman University Martha Lewis, University of Bristol (PC co-chair) Sophie Libkind, Stanford University Jade Master, University of Strathclyde (PC co-chair) Conor Mcbride, University of Strathclyde Joe Moeller, National Institute of Standards and Technology Elizabeth Munch, Michigan State University Fredrik Nordvall Forsberg, University of Strathclyde Paige North, University of Pennsylvania Emily Roff, University of Edinburgh Mehrnoosh Sadr